b86e330957
This copies the files for the GLU tesselator from Mesa. The Mesa code is based on the original SGI code and is released under a BSD license. The memalloc.h header has been replaced with one that forces the code to use g_malloc and friends. The rest of the files are not altered from the original so it should be possible to later upgrade the files by simply overwriting them. There is a tesselator.h header which is expected to be included by rest of Cogl to use the tesselator. This contains a trimmed down version of glu.h that only includes parts that pertain to the tesselator. There is also a stub glu.h in the GL directory which is just provided so that the tesselator code can include <GL/gl.h> without depending on the system header. It just redirects to tesselator.h
112 lines
3.1 KiB
C
112 lines
3.1 KiB
C
/*
|
|
* SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
|
|
* Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
* to deal in the Software without restriction, including without limitation
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice including the dates of first publication and
|
|
* either this permission notice or a reference to
|
|
* http://oss.sgi.com/projects/FreeB/
|
|
* shall be included in all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
* SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
|
|
* OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
* SOFTWARE.
|
|
*
|
|
* Except as contained in this notice, the name of Silicon Graphics, Inc.
|
|
* shall not be used in advertising or otherwise to promote the sale, use or
|
|
* other dealings in this Software without prior written authorization from
|
|
* Silicon Graphics, Inc.
|
|
*/
|
|
/*
|
|
** Author: Eric Veach, July 1994.
|
|
**
|
|
*/
|
|
|
|
#include <stddef.h>
|
|
#include "dict-list.h"
|
|
#include "memalloc.h"
|
|
|
|
/* really __gl_dictListNewDict */
|
|
Dict *dictNewDict( void *frame,
|
|
int (*leq)(void *frame, DictKey key1, DictKey key2) )
|
|
{
|
|
Dict *dict = (Dict *) memAlloc( sizeof( Dict ));
|
|
DictNode *head;
|
|
|
|
if (dict == NULL) return NULL;
|
|
|
|
head = &dict->head;
|
|
|
|
head->key = NULL;
|
|
head->next = head;
|
|
head->prev = head;
|
|
|
|
dict->frame = frame;
|
|
dict->leq = leq;
|
|
|
|
return dict;
|
|
}
|
|
|
|
/* really __gl_dictListDeleteDict */
|
|
void dictDeleteDict( Dict *dict )
|
|
{
|
|
DictNode *node, *next;
|
|
|
|
for( node = dict->head.next; node != &dict->head; node = next ) {
|
|
next = node->next;
|
|
memFree( node );
|
|
}
|
|
memFree( dict );
|
|
}
|
|
|
|
/* really __gl_dictListInsertBefore */
|
|
DictNode *dictInsertBefore( Dict *dict, DictNode *node, DictKey key )
|
|
{
|
|
DictNode *newNode;
|
|
|
|
do {
|
|
node = node->prev;
|
|
} while( node->key != NULL && ! (*dict->leq)(dict->frame, node->key, key));
|
|
|
|
newNode = (DictNode *) memAlloc( sizeof( DictNode ));
|
|
if (newNode == NULL) return NULL;
|
|
|
|
newNode->key = key;
|
|
newNode->next = node->next;
|
|
node->next->prev = newNode;
|
|
newNode->prev = node;
|
|
node->next = newNode;
|
|
|
|
return newNode;
|
|
}
|
|
|
|
/* really __gl_dictListDelete */
|
|
void dictDelete( Dict *dict, DictNode *node ) /*ARGSUSED*/
|
|
{
|
|
node->next->prev = node->prev;
|
|
node->prev->next = node->next;
|
|
memFree( node );
|
|
}
|
|
|
|
/* really __gl_dictListSearch */
|
|
DictNode *dictSearch( Dict *dict, DictKey key )
|
|
{
|
|
DictNode *node = &dict->head;
|
|
|
|
do {
|
|
node = node->next;
|
|
} while( node->key != NULL && ! (*dict->leq)(dict->frame, key, node->key));
|
|
|
|
return node;
|
|
}
|