reactos/dll/win32/glu32/libtess/dict.c

   1 /*
   2 ** License Applicability. Except to the extent portions of this file are
   3 ** made subject to an alternative license as permitted in the SGI Free
   4 ** Software License B, Version 1.1 (the "License"), the contents of this
   5 ** file are subject only to the provisions of the License. You may not use
   6 ** this file except in compliance with the License. You may obtain a copy
   7 ** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
   8 ** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
   9 **
  10 ** http://oss.sgi.com/projects/FreeB
  11 **
  12 ** Note that, as provided in the License, the Software is distributed on an
  13 ** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
  14 ** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
  15 ** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
  16 ** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
  17 **
  18 ** Original Code. The Original Code is: OpenGL Sample Implementation,
  19 ** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
  20 ** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
  21 ** Copyright in any portions created by third parties is as indicated
  22 ** elsewhere herein. All Rights Reserved.
  23 **
  24 ** Additional Notice Provisions: The application programming interfaces
  25 ** established by SGI in conjunction with the Original Code are The
  26 ** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
  27 ** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
  28 ** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
  29 ** Window System(R) (Version 1.3), released October 19, 1998. This software
  30 ** was created using the OpenGL(R) version 1.2.1 Sample Implementation
  31 ** published by SGI, but has not been independently verified as being
  32 ** compliant with the OpenGL(R) version 1.2.1 Specification.
  33 **
  34 */
  35 /*
  36 ** Author: Eric Veach, July 1994.
  37 **
  38 ** $Date$ $Revision: 1.1 $
  39 ** $Header: /cygdrive/c/RCVS/CVS/ReactOS/reactos/lib/glu32/libtess/dict.c,v 1.1 2004/02/02 16:39:15 navaraf Exp $
  40 */
  41
  42 #include <stddef.h>
  43 #include "dict-list.h"
  44 #include "memalloc.h"
  45
  46 /* really __gl_dictListNewDict */
  47 Dict *dictNewDict( void *frame,
  48                    int (*leq)(void *frame, DictKey key1, DictKey key2) )
  49 {
  50   Dict *dict = (Dict *) memAlloc( sizeof( Dict ));
  51   DictNode *head;
  52
  53   if (dict == NULL) return NULL;
  54
  55   head = &dict->head;
  56
  57   head->key = NULL;
  58   head->next = head;
  59   head->prev = head;
  60
  61   dict->frame = frame;
  62   dict->leq = leq;
  63
  64   return dict;
  65 }
  66
  67 /* really __gl_dictListDeleteDict */
  68 void dictDeleteDict( Dict *dict )
  69 {
  70   DictNode *node;
  71
  72   for( node = dict->head.next; node != &dict->head; node = node->next ) {
  73     memFree( node );
  74   }
  75   memFree( dict );
  76 }
  77
  78 /* really __gl_dictListInsertBefore */
  79 DictNode *dictInsertBefore( Dict *dict, DictNode *node, DictKey key )
  80 {
  81   DictNode *newNode;
  82
  83   do {
  84     node = node->prev;
  85   } while( node->key != NULL && ! (*dict->leq)(dict->frame, node->key, key));
  86
  87   newNode = (DictNode *) memAlloc( sizeof( DictNode ));
  88   if (newNode == NULL) return NULL;
  89
  90   newNode->key = key;
  91   newNode->next = node->next;
  92   node->next->prev = newNode;
  93   newNode->prev = node;
  94   node->next = newNode;
  95
  96   return newNode;
  97 }
  98
  99 /* really __gl_dictListDelete */
 100 void dictDelete( Dict *dict, DictNode *node ) /*ARGSUSED*/
 101 {
 102   node->next->prev = node->prev;
 103   node->prev->next = node->next;
 104   memFree( node );
 105 }
 106
 107 /* really __gl_dictListSearch */
 108 DictNode *dictSearch( Dict *dict, DictKey key )
 109 {
 110   DictNode *node = &dict->head;
 111
 112   do {
 113     node = node->next;
 114   } while( node->key != NULL && ! (*dict->leq)(dict->frame, key, node->key));
 115
 116   return node;
 117 }