Lines Matching defs:node
9 struct linklist_node *node;
11 for (node = linklist->head; node; node = node->next)
13 if (linklist->cmp && (*linklist->cmp) (node->data, data) == 0)
14 return node;
15 if (node->data == data)
16 return node;
25 struct linklist_node *node;
27 node = linklist_lookup_node (data, linklist);
28 if (node)
29 return node->data;
36 struct linklist_node *node = NULL, *add;
49 for (node = linklist->head; node; node = node->next)
51 if ((*linklist->cmp) (node->data, add->data) > 0)
56 if (! node)
75 /* insert just before 'node' */
76 if (node->prev)
78 node->prev->next = add;
79 add->prev = node->prev;
87 add->next = node;
88 node->prev = add;
120 linklist_head (struct linklist *linklist, struct linklist_node *node)
124 node->prev = NULL;
125 node->next = NULL;
126 node->data = NULL;
130 node->prev = linklist->head->prev;
131 node->next = linklist->head->next;
132 node->data = linklist->head->data;
136 linklist_end (struct linklist_node *node)
138 if (node->data == NULL && node->next == NULL)
144 linklist_next (struct linklist_node *node)
146 if (node->next == NULL)
148 node->prev = NULL;
149 node->next = NULL;
150 node->data = NULL;
154 node->data = node->next->data;
155 node->prev = node->next->prev;
156 node->next = node->next->next;
175 struct linklist_node node;
177 for (linklist_head (linklist, &node); ! linklist_end (&node);
178 linklist_next (&node))
179 linklist_remove (node.data, linklist);