Searched refs:newnode (Results 1 - 3 of 3) sorted by relevance

/xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
H A DsearchTree.cc106 treeNode* TreeNodeInsert(treeNode* root, treeNode* newnode, argument
116 if(compkey(newnode->key,x->key) < 0) /*if newnode < x*/
123 * if newnode < y, then y->left is NULL
124 * if newnode > y, then y->right is NULL.
125 *So we want to isnert newnode to be the child of y
127 newnode->parent = y;
129 return newnode;
130 else if( compkey(newnode->key, y->key) <0)
132 y->left = newnode;
[all...]
H A DsearchTree.h56 treeNode* TreeNodeInsert(treeNode* root, treeNode* newnode,
/xsrc/external/mit/xorg-server.old/dist/hw/xfree86/loader/
H A Dloadext.c241 NODE *newnode; local in function:remove_node
247 newnode = xnfalloc(sizeof(NODE));
248 memcpy(newnode, n, sizeof(NODE));
250 last->n_next = newnode;
252 sorted = newnode;
253 last = newnode;
254 newnode->n_next = NULL;

Completed in 6 milliseconds