HomeSort by relevance Sort by last modified time
    Searched defs:list_node (Results 1 - 12 of 12) sorted by null

  /device/huawei/angler/power/
list.h 30 struct list_node { struct
31 struct list_node *next;
37 int init_list_head(struct list_node *head);
38 struct list_node * add_list_node(struct list_node *head, void *data);
39 int remove_list_node(struct list_node *head, struct list_node *del_node);
40 void dump_list(struct list_node *head);
41 struct list_node *find_node(struct list_node *head, void *comparison_data)
    [all...]
  /device/lge/bullhead/power/
list.h 30 struct list_node { struct
31 struct list_node *next;
37 int init_list_head(struct list_node *head);
38 struct list_node * add_list_node(struct list_node *head, void *data);
39 int remove_list_node(struct list_node *head, struct list_node *del_node);
40 void dump_list(struct list_node *head);
41 struct list_node *find_node(struct list_node *head, void *comparison_data)
    [all...]
  /external/c-ares/
ares_cancel.c 29 struct list_node* list_head;
30 struct list_node* list_node; local
34 for (list_node = list_head->next; list_node != list_head; )
36 query = list_node->data;
37 list_node = list_node->next; /* since we're deleting the query */
ares_llist.h 22 struct list_node { struct
23 struct list_node *prev;
24 struct list_node *next;
28 void ares__init_list_head(struct list_node* head);
30 void ares__init_list_node(struct list_node* node, void* d);
32 int ares__is_list_empty(struct list_node* head);
34 void ares__insert_in_list(struct list_node* new_node,
35 struct list_node* old_node);
37 void ares__remove_from_list(struct list_node* node);
39 void ares__swap_lists(struct list_node* head_a
    [all...]
ares_destroy.c 42 struct list_node* list_head;
43 struct list_node* list_node; local
49 for (list_node = list_head->next; list_node != list_head; )
51 query = list_node->data;
52 list_node = list_node->next; /* since we're deleting the query */
ares_timeout.c 37 struct list_node* list_head;
38 struct list_node* list_node; local
52 for (list_node = list_head->next; list_node != list_head;
53 list_node = list_node->next)
55 query = list_node->data;
ares_query.c 75 struct list_node* list_head;
76 struct list_node* list_node; local
81 for (list_node = list_head->next; list_node != list_head;
82 list_node = list_node->next)
84 struct query *q = list_node->data;
ares_process.c 507 struct list_node* list_head;
508 struct list_node* list_node; local
519 for (list_node = list_head->next; list_node != list_head; )
521 query = list_node->data;
522 list_node = list_node->next; /* in case the query gets deleted */
542 struct list_node* list_head;
543 struct list_node* list_node local
635 struct list_node* list_node; local
    [all...]
  /system/bt/osi/src/
list.c 56 if (list_node(node) == data)
206 void *list_node(const list_node_t *node) { function
  /external/selinux/libsepol/src/
module_to_cil.c 177 struct list_node { struct
179 struct list_node *next;
183 struct list_node *head;
194 struct list_node *curr = (*list)->head;
195 struct list_node *tmp;
209 struct list_node *curr = role_list->head;
226 struct list_node *curr = (*attr_list)->head;
263 struct list_node *node = calloc(1, sizeof(*node));
977 struct list_node *curr;
1259 struct list_node *curr
    [all...]
  /external/v8/src/crankshaft/
hydrogen-instructions.cc 489 HUseListNode* list_node = use_list_; local
490 HValue* value = list_node->value();
492 value->InternalSetOperandAt(list_node->index(), other);
493 use_list_ = list_node->tail();
494 list_node->set_tail(other->use_list_);
495 other->use_list_ = list_node;
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/third_party/nestegg/src/
nestegg.c 275 struct list_node { struct
276 struct list_node * previous;
283 struct list_node * ancestor;
303 struct list_node * ancestor;
787 ne_is_ancestor_element(uint64_t id, struct list_node * ancestor)
814 struct list_node * item;
826 struct list_node * item;
    [all...]

Completed in 166 milliseconds