dn_list.c

来自「ftam等标准协议服务器和客户端的源代码。」· C语言 代码 · 共 213 行

#ifndef lint
static char *rcsid = "$Header: /xtel/isode/isode/others/quipu/uips/doog/query/RCS/dn_list.c,v 9.0 1992/06/16 12:45:27 isode Rel $";
#endif

/* $Header: /xtel/isode/isode/others/quipu/uips/doog/query/RCS/dn_list.c,v 9.0 1992/06/16 12:45:27 isode Rel $ */

/*
 * $Log: dn_list.c,v $
 * Revision 9.0  1992/06/16  12:45:27  isode
 * Release 8.0
 *
 */

/*****************************************************************************

  dn_list.c - Implements a list of sorted entry names.

*****************************************************************************/

#include <stdio.h>
#include <ctype.h>

#include "quipu/util.h"

#include "types.h"
#include "util.h"
#include "dn_list.h"



/*
 * - dn_list_insert -
 * Insert a new entry name into an unsorted listed of entry names.
 *
 */
QBool dn_list_insert(dn, entry_list_ptr, object_type)
     char *dn;
     entryList *entry_list_ptr;
     AttributeType object_type;
{
  entryList element, new_element;
  register char *sort_key;
  char *entry_name;

  element = *entry_list_ptr;

  new_element = entry_list_alloc();
  new_element->string_dn = entry_name = copy_string(dn);
  new_element->object_class = object_type;
  
  /* Sort key is at present the attr value of the RDN.
     ####### Need to do more for 'cn' attributes. ####### */
  sort_key = entry_name;

  while (*sort_key != '\0') sort_key++;
  while (*sort_key != '=') sort_key--;

  sort_key++;

  while (isspace(*sort_key)) sort_key++;

  new_element->sort_key = sort_key;

  new_element->next = element;
  *entry_list_ptr = new_element;

  return TRUE;
} /* dn_list_insert */

/*
 * - dn_list_add -
 * Insert a new entry name into a sorted listed of entry names.
 *
 */
QBool dn_list_add(dn, entry_list_ptr, object_type)
     char *dn;
     entryList *entry_list_ptr;
     AttributeType object_type;
{
  entryList element, new_element;
  register char *sort_key;
  char *entry_name;
  int lexcmp;

  element = *entry_list_ptr;

  new_element = entry_list_alloc();
  new_element->string_dn = entry_name = copy_string(dn);
  new_element->object_class = object_type;
  
  /* Sort key is at present the attr value of the RDN.
     ####### Need to do more for 'cn' attributes. ####### */
  sort_key = entry_name;

  while (*sort_key != '\0')
    sort_key++;

  while (*sort_key != '=')
    sort_key--;

  sort_key++;
  while (isspace(*sort_key))
    sort_key++;

  new_element->sort_key = sort_key;
  
  /* If given list is empty, return new_element. */
  if (element == NULLEntryList)
    {
      new_element->next = NULLEntryList;
      *entry_list_ptr = new_element;

      return TRUE;
    }
  
  /* Check if alphabetically lower than first in list. */
  lexcmp = lexequ(sort_key, element->sort_key);

  if (lexcmp < 0)
    {
      new_element->next = element;
      *entry_list_ptr = new_element;
    }
  else if (lexcmp == 0) /* Don't want the same dn twice */
    {
      (void) free(entry_name);
      (void) free((char *) new_element);

      return FALSE;
    }
  else
    {
      /* Insert new entry_list into alphabetical position. */
      while (element->next != NULLEntryList)
	{
	  lexcmp = lexequ(sort_key, element->next->sort_key);

	  if (lexcmp < 0)
	    break;
	  else if (lexcmp == 0)
	    {
	      (void) free(entry_name);
	      (void) free((char *) new_element);

	      return FALSE;
	    }
	  else
	    element = element->next;
	}

      new_element->next = element->next;
      element->next = new_element;
    }
  
  return TRUE;
} /* dn_list_add */

/*
 * - dn_list_free() -
 * Free given entry list.
 *
 */
void dn_list_free(entry_list_ptr)
     entryList *entry_list_ptr;
{
  entryList next_entry, list = *entry_list_ptr;

  while (list != NULLEntryList)
    {
      next_entry = list->next;
      (void) free(list->string_dn);

      /* Don't have to free sort key as it is a pointer into above string. */
      (void) free((char *) list);
      list = next_entry;
    }
  
  *entry_list_ptr = NULLEntryList;
} /* dn_list_free */

/*
 * - dn_list_copy() -
 *
 *
 */
void dn_list_copy(original, copy)
     entryList original, *copy;
{
  entryList copylist = NULLEntryList;
  int sort_key_diff = 0;

  for (*copy = NULLEntryList;
       original != NULLEntryList;
       original = original->next)
    {
      if (copylist == NULLEntryList)
	copylist = *copy = entry_list_alloc();
      else
	copylist = copylist->next = entry_list_alloc();
      
      copylist->next = NULLEntryList;

      /* sort_key is a pointer into string_dn */
      sort_key_diff = (int) (original->sort_key - original->string_dn);
      
      copylist->sort_key = copylist->string_dn =
	copy_string(original->string_dn);
      
      copylist->sort_key = (char *) (sort_key_diff + copylist->sort_key);
      copylist->object_class = original->object_class;
    }
} /* dn_list_copy */