| /device/lge/bullhead/power/ |
| D | list.h | 30 struct list_node { struct
31 struct list_node *next; argument
37 int init_list_head(struct list_node *head); argument
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);
|
| D | list.c | 37 int init_list_head(struct list_node *head) in init_list_head()
47 struct list_node *add_list_node(struct list_node *head, void *data) in add_list_node()
50 struct list_node *new_node; in add_list_node()
56 if (!(new_node = malloc(sizeof(struct list_node)))) { in add_list_node()
69 int is_list_empty(struct list_node *head) in is_list_empty()
77 int remove_list_node(struct list_node *head, struct list_node *del_node) in remove_list_node()
79 struct list_node *current_node; in remove_list_node()
80 struct list_node *saved_node; in remove_list_node()
110 void dump_list(struct list_node *head) in dump_list()
112 struct list_node *current_node = head; in dump_list()
[all …]
|
| D | utils.c | 51 static struct list_node active_hint_list_head;
263 struct list_node *found_node; in undo_hint_action()
|
| /device/google/wahoo/power/ |
| D | list.h | 30 struct list_node { struct
31 struct list_node *next; argument
37 int init_list_head(struct list_node *head); argument
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);
|
| D | list.c | 37 int init_list_head(struct list_node *head) in init_list_head()
47 struct list_node *add_list_node(struct list_node *head, void *data) in add_list_node()
50 struct list_node *new_node; in add_list_node()
56 if (!(new_node = malloc(sizeof(struct list_node)))) { in add_list_node()
69 int is_list_empty(struct list_node *head) in is_list_empty()
77 int remove_list_node(struct list_node *head, struct list_node *del_node) in remove_list_node()
79 struct list_node *current_node; in remove_list_node()
80 struct list_node *saved_node; in remove_list_node()
110 void dump_list(struct list_node *head) in dump_list()
112 struct list_node *current_node = head; in dump_list()
[all …]
|
| D | utils.c | 50 static struct list_node active_hint_list_head;
231 struct list_node *found_node = find_node(&active_hint_list_head, in perform_hint_action()
284 struct list_node *found_node; in undo_hint_action()
|
| /device/huawei/angler/power/ |
| D | list.h | 30 struct list_node { struct
31 struct list_node *next; argument
37 int init_list_head(struct list_node *head); argument
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);
|
| D | list.c | 37 int init_list_head(struct list_node *head) in init_list_head()
47 struct list_node *add_list_node(struct list_node *head, void *data) in add_list_node()
50 struct list_node *new_node; in add_list_node()
56 if (!(new_node = malloc(sizeof(struct list_node)))) { in add_list_node()
69 int is_list_empty(struct list_node *head) in is_list_empty()
77 int remove_list_node(struct list_node *head, struct list_node *del_node) in remove_list_node()
79 struct list_node *current_node; in remove_list_node()
80 struct list_node *saved_node; in remove_list_node()
110 void dump_list(struct list_node *head) in dump_list()
112 struct list_node *current_node = head; in dump_list()
[all …]
|
| D | utils.c | 51 static struct list_node active_hint_list_head;
268 struct list_node *found_node; in undo_hint_action()
|
| /device/google/marlin/power/ |
| D | list.h | 30 struct list_node { struct
31 struct list_node *next; argument
37 int init_list_head(struct list_node *head); argument
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);
|
| D | list.c | 37 int init_list_head(struct list_node *head) in init_list_head()
47 struct list_node *add_list_node(struct list_node *head, void *data) in add_list_node()
50 struct list_node *new_node; in add_list_node()
56 if (!(new_node = malloc(sizeof(struct list_node)))) { in add_list_node()
69 int is_list_empty(struct list_node *head) in is_list_empty()
77 int remove_list_node(struct list_node *head, struct list_node *del_node) in remove_list_node()
79 struct list_node *current_node; in remove_list_node()
80 struct list_node *saved_node; in remove_list_node()
110 void dump_list(struct list_node *head) in dump_list()
112 struct list_node *current_node = head; in dump_list()
[all …]
|
| D | utils.c | 61 static struct list_node active_hint_list_head;
253 struct list_node *found_node = find_node(&active_hint_list_head, in perform_hint_action()
306 struct list_node *found_node; in undo_hint_action()
|
| /device/google/marlin/dataservices/datatop/src/ |
| D | datatop_linked_list.c | 57 struct dtop_linked_list *list_node; in dtop_add_linked_list() local
58 list_node = malloc(sizeof(struct dtop_linked_list)); in dtop_add_linked_list()
60 if (!list_node) { in dtop_add_linked_list()
65 list_node->data = data; in dtop_add_linked_list()
66 list_node->next_ptr = list; in dtop_add_linked_list()
67 list = list_node; in dtop_add_linked_list()
|