/* ==== fc_key.c ============================================================
 * Copyright (c) 1995 by Chris Provenzano, proven@mit.edu
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *  This product includes software developed by Chris Provenzano.
 * 4. The name of Chris Provenzano may not be used to endorse or promote 
 *	  products derived from this software without specific prior written
 *	  permission.
 *
 * THIS SOFTWARE IS PROVIDED BY CHRIS PROVENZANO ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL CHRIS PROVENZANO BE LIABLE FOR ANY 
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 
 * SUCH DAMAGE.
 *
 * Description : Main fc functions.
 *
 *  1.00 95/06/28  proven
 *      -Started coding this file.
 */

#include <stdio.h>
#include <errno.h>
#include "cluster.h"
#include "util.h"
#include "fc.h"

static cluster fc_key_cluster;

/* ==========================================================================
 * fc_key_init()
 */
int fc_key_init()
{
	return (cluster_init(&fc_key_cluster, sizeof(struct fc_keys)));
}

/* ==========================================================================
 * fc_key_alloc()
 */
struct fc_keys * fc_key_alloc(unsigned int count)
{
	struct fc_keys * next = NULL;
	struct fc_keys * ret = NULL;
	int i;

	switch(count) {
	default:
	 	if (cluster_prealloc(&fc_key_cluster, count) == OK) {
			for (i = 0; i < count; i++) {
				if (ret = cluster_alloc(&fc_key_cluster)) {
					ret->alloctype = UN_ALLOCED;
					ret->key_name = NULL;
					ret->key_num = 0;

					ret->file_first = NULL;
					ret->key_next = next;
					next = ret;
				} else {
					abort();
				}
			}
		}
		break;
	case 1:
		if (ret = cluster_alloc(&fc_key_cluster)) {
			ret->alloctype = UN_ALLOCED;
			ret->key_name = NULL;
			ret->key_num = 0;

			ret->file_first = NULL;
			ret->key_next = next;
			next = ret;
		}
		break;
	case 0:
		break;
	}
	return(ret);
}

/* ==========================================================================
 * fc_key_free()
 */
void fc_key_free(struct fc_keys * dead)
{
	cluster_free(&fc_key_cluster, dead);
}

/* ==========================================================================
 * fc_key_insert()
 */
int fc_key_insert(char * key, struct fc_keys ** fc_key_list,  
  struct fc_keys ** fc_key_returned)
{
	struct fc_keys ** fc_key_p = fc_key_list;
    struct fc_keys * fc_key;
	int result;

    for(fc_key_p = fc_key_list; *fc_key_p; fc_key_p = &((*fc_key_p)->key_next)){
		if ((result = strcmp(key, (*fc_key_p)->key_name)) == 0)
			return(NOTOK);
		if (result < 0) 
			break;
    }
	if (*fc_key_returned = fc_key_alloc(1)) {
        (*fc_key_returned)->key_next = *fc_key_p;
        *fc_key_p = *fc_key_returned;
		return(OK);
	}
	return(ENOMEM);
}