Home
last modified time | relevance | path

Searched refs:node_list (Results 1 – 5 of 5) sorted by relevance

/external/kernel-headers/original/linux/
Dplist.h82 struct list_head node_list; member
107 .node_list = LIST_HEAD_INIT((head).node_list), \
132 INIT_LIST_HEAD(&head->node_list); in plist_head_init()
160 list_for_each_entry(pos, &(head)->node_list, plist.node_list)
171 list_for_each_entry_safe(pos, n, &(head)->node_list, plist.node_list)
181 list_for_each_entry(pos, &(head)->node_list, mem.plist.node_list)
193 list_for_each_entry_safe(pos, n, &(head)->node_list, m.plist.node_list)
202 return list_empty(&head->node_list); in plist_head_empty()
244 return list_entry(head->node_list.next, in plist_first()
245 struct plist_node, plist.node_list); in plist_first()
/external/bluetooth/bluez/test/
Dlist-devices74 node_list = properties["Nodes"] variable
76 node_list = [] variable
78 for x in node_list:
/external/bison/src/
Dvcg.c129 g->node_list = G_NODE_LIST; in new_graph()
386 n->next = g->node_list; in add_node()
387 g->node_list = n; in add_node()
490 for (n = g->node_list; n; n = n->next) in close_graph()
Dvcg.h928 node *node_list; member
/external/v8/src/
Dliveedit-debugger.js100 function CollectNew(node_list) { argument
101 for (var i = 0; i < node_list.length; i++) {
102 link_to_original_script_list.push(node_list[i]);
103 CollectNew(node_list[i].children);