Lines Matching defs:node
50 struct listnode *node;
52 node = XMALLOC (MTYPE_LINK_NODE, sizeof (struct listnode));
53 memset (node, 0, sizeof (struct listnode));
54 return node;
59 listnode_free (struct listnode *node)
61 XFREE (MTYPE_LINK_NODE, node);
69 struct listnode *node;
71 node = listnode_new ();
73 node->prev = list->tail;
74 node->data = val;
77 list->head = node;
79 list->tail->next = node;
80 list->tail = node;
85 /* Add new node with sort function. */
165 struct listnode *node;
167 for (node = list->head; node; node = node->next)
169 if (node->data == val)
171 if (node->prev)
172 node->prev->next = node->next;
174 list->head = node->next;
176 if (node->next)
177 node->next->prev = node->prev;
179 list->tail = node->prev;
182 listnode_free (node);
188 /* Return first node's data if it is there. */
192 struct listnode *node;
194 node = list->head;
196 if (node)
197 return node->data;
205 struct listnode *node;
208 for (node = list->head; node; node = next)
210 next = node->next;
212 (*list->del) (node->data);
213 listnode_free (node);
223 struct listnode *node;
226 for (node = list->head; node; node = next)
228 next = node->next;
230 (*list->del) (node->data);
231 listnode_free (node);
236 /* Lookup the node which has given data. */
240 listnode node;
242 for (node = list->head; node; nextnode (node))
243 if (data == getdata (node))
244 return node;
249 /* Delete the node from list. For ospfd and ospf6d. */
251 list_delete_node (list list, listnode node)
253 if (node->prev)
254 node->prev->next = node->next;
256 list->head = node->next;
257 if (node->next)
258 node->next->prev = node->prev;
260 list->tail = node->prev;
262 listnode_free (node);
270 struct listnode *node;
272 node = listnode_new ();
273 node->next = current;
274 node->data = val;
277 list->head = node;
279 current->prev->next = node;
281 node->prev = current->prev;
282 current->prev = node;
291 struct listnode *node;
293 node = listnode_new ();
294 node->prev = current;
295 node->data = val;
298 list->tail = node;
300 current->next->prev = node;
302 node->next = current->next;
303 current->next = node;