Searched refs:list_node (Results 1 - 4 of 4) sorted by relevance

/device/google/marlin/power/
H A Dlist.h30 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 *hea
[all...]
H A Dlist.c37 int init_list_head(struct list_node *head)
47 struct list_node *add_list_node(struct list_node *head, void *data)
49 /* Create a new list_node. And put 'data' into it. */
50 struct list_node *new_node;
56 if (!(new_node = malloc(sizeof(struct list_node)))) {
69 int is_list_empty(struct list_node *head)
77 int remove_list_node(struct list_node *head, struct list_node *del_node)
79 struct list_node *current_nod
[all...]
H A Dutils.c62 static struct list_node active_hint_list_head;
254 struct list_node *found_node = find_node(&active_hint_list_head,
307 struct list_node *found_node;
/device/google/marlin/dataservices/datatop/src/
H A Ddatatop_linked_list.c57 struct dtop_linked_list *list_node; local
58 list_node = malloc(sizeof(struct dtop_linked_list));
60 if (!list_node) {
65 list_node->data = data;
66 list_node->next_ptr = list;
67 list = list_node;

Completed in 99 milliseconds