/system/core/include/cutils/ |
H A D | list.h | 41 #define list_for_each(node, list) \ 42 for (node = (list)->next; node != (list); node = node->next) 44 #define list_for_each_reverse(node, list) \ 45 for (node = (list)->prev; node != (list); node = node->prev) 47 void list_init(struct listnode *list); 48 void list_add_tail(struct listnode *list, struct listnode *item); 51 #define list_empty(list) ((list) [all...] |
/system/core/toolbox/ |
H A D | getprop.c | 11 strlist_t* list = opaque; local 14 strlist_append_dup(list, temp); 19 strlist_t list[1] = { STRLIST_INITIALIZER }; local 21 /* Record properties in the string list */ 22 (void)property_list(record_prop, list); 25 strlist_sort(list); 28 STRLIST_FOREACH(list, str, printf("%s\n", str)); 31 strlist_done(list);
|
H A D | dynarray.c | 64 void strlist_init( strlist_t *list ) 66 dynarray_init(list); 69 void strlist_append_b( strlist_t *list, const void* str, size_t slen ) argument 74 dynarray_append(list, copy); 77 void strlist_append_dup( strlist_t *list, const char *str) argument 79 strlist_append_b(list, str, strlen(str)); 82 void strlist_done( strlist_t *list ) 84 STRLIST_FOREACH(list, string, free(string)); 85 dynarray_done(list); 95 void strlist_sort( strlist_t *list ) [all...] |
H A D | dynarray.h | 59 * to/from the list during iteration. 64 void strlist_init( strlist_t *list ); 66 /* note: strlist_done will free all the strings owned by the list */ 67 void strlist_done( strlist_t *list ); 72 void strlist_append_b( strlist_t *list, const void* str, size_t slen ); 75 void strlist_append_dup( strlist_t *list, const char *str); 77 /* sort the strings in a given list (using strcmp) */ 78 void strlist_sort( strlist_t *list );
|
H A D | id.c | 35 gid_t list[64]; local 41 max = getgroups(64, list); 50 print_gid(list[0]); 53 print_gid(list[n]);
|
/system/core/libcutils/ |
H A D | dir_hash.c | 117 struct list { struct 119 struct list *next; 123 struct list *const *ra = a; 124 struct list *const *rb = b; 130 struct list **out) { 131 struct list *list = NULL; local 132 struct list *f; 150 struct list *node = malloc(sizeof(struct list)); 269 struct list **list; local [all...] |
H A D | list.c | 17 #include <cutils/list.h>
|
/system/extras/showslab/ |
H A D | showslab.c | 58 * Returns the head of the new list of slab_info structures, or NULL on error. 158 * provided slab_info linked list 160 static void free_slablist(struct slab_info *list) argument 162 while (list) { 163 struct slab_info *temp = list->next; 164 free(list); 165 list = temp; 171 struct slab_info list; local 172 struct slab_info *p = &list; 187 return list 193 slabsort(struct slab_info *list) argument 272 struct slab_info *list, *p; local [all...] |
/system/netd/ |
H A D | NetdConstants.h | 21 #include <list>
|
H A D | BandwidthController.h | 19 #include <list> 148 std::list<std::string> sharedQuotaIfaces; 162 std::list<QuotaInfo> quotaIfaces; 163 std::list<int /*appUid*/> naughtyAppUids;
|
H A D | NetdConstants.cpp | 45 /* Read arguments from incoming va_list; we expect the list to be NULL terminated. */ 46 std::list<const char*> argsList; 56 std::list<const char*>::iterator it;
|
/system/extras/ext4_utils/ |
H A D | allocate.c | 34 struct region_list list; member in struct:block_allocation 65 alloc->list.first = NULL; 66 alloc->list.last = NULL; 69 alloc->list.iter = NULL; 70 alloc->list.partial_iter = 0; 76 static void region_list_remove(struct region_list *list, struct region *reg) argument 84 if (list->first == reg) 85 list->first = reg->next; 87 if (list->last == reg) 88 list 94 region_list_append(struct region_list *list, struct region *reg) argument 631 advance_list_ptr(struct region_list *list, int blocks) argument [all...] |
/system/core/sh/ |
H A D | expand.h | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 44 struct strlist *list; member in struct:arglist
|
H A D | eval.c | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 358 arglist.lastp = &arglist.list; 367 for (sp = arglist.list ; sp ; sp = sp->next) { 399 arglist.lastp = &arglist.list; 403 if (casematch(patp, arglist.list->text)) { 448 * Compute the names of the files in a redirection list. 458 fn.lastp = &fn.list; 466 redir->nfile.expfname = fn.list->text; 472 fixredir(redir, fn.list [all...] |
H A D | var.c | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 316 * Process a linked list of variable assignments. 320 listsetvar(struct strlist *list, int flags) argument 325 for (lp = list ; lp ; lp = lp->next) { 332 listmklocal(struct strlist *list, int flags) argument 336 for (lp = list ; lp ; lp = lp->next) 385 * Generate a list of exported variables. This routine is used to construct 458 * Command to list all variables which are set. Currently this command 513 static struct var **list; /* stati local [all...] |
H A D | parser.c | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 80 struct heredoc *next; /* next here document in list */ 89 struct heredoc *heredoclist; /* list of here documents to read */ 104 STATIC union node *list(int); 145 return list(1); 150 list(int nlflag) function 319 n1->nif.test = list(0); 322 n1->nif.ifpart = list(0); 328 n2->nif.test = list( [all...] |
H A D | expand.c | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 81 struct ifsregion *next; /* next region in list */ 89 struct nodelist *argbackq; /* list of back quote expressions */ 90 struct ifsregion ifsfirst; /* first struct in list of ifs regions */ 91 struct ifsregion *ifslastp; /* last struct in list */ 92 struct arglist exparg; /* holds expanded arg list */ 128 * placing the resulting list of arguments in arglist. If EXP_FULL is true, 149 exparg.lastp = &exparg.list; 156 exparg.lastp = &exparg.list; 1285 msort(struct strlist *list, int len) argument [all...] |
/system/core/toolbox/grep/ |
H A D | queue.c | 11 * notice, this list of conditions and the following disclaimer. 13 * notice, this list of conditions and the following disclaimer in the 50 STAILQ_ENTRY(qentry) list; 72 STAILQ_INSERT_TAIL(&queue, item, list); 90 STAILQ_REMOVE_HEAD(&queue, list);
|
/system/extras/latencytop/ |
H A D | latencytop.c | 43 static struct latency_entry *read_global_stats(struct latency_entry *list, int erase); 44 static struct latency_entry *read_process_stats(struct latency_entry *list, int erase, int pid); 45 static struct latency_entry *read_thread_stats(struct latency_entry *list, int erase, int pid, int tid, int fatal); 51 static struct latency_entry *read_latency_file(FILE *f, struct latency_entry *list); 174 static struct latency_entry *read_global_stats(struct latency_entry *list, int erase) { argument 194 e = read_latency_file(f, list); 201 static struct latency_entry *read_process_stats(struct latency_entry *list, int erase, int pid) { argument 216 e = list; 231 static struct latency_entry *read_thread_stats(struct latency_entry *list, int erase, int pid, int tid, int fatal) { argument 246 return list; 325 read_latency_file(FILE *f, struct latency_entry *list) argument [all...] |
/system/core/adb/ |
H A D | adb_auth_client.c | 20 #include <cutils/list.h> 49 static void read_keys(const char *file, struct listnode *list) argument 88 list_add_tail(list, &key->node); 94 static void free_keys(struct listnode *list) argument 98 while (!list_empty(list)) { 99 item = list_head(list);
|
H A D | adb_auth_host.c | 40 #include <cutils/list.h> 226 static int read_key(const char *file, struct listnode *list) argument 256 list_add_tail(list, &key->node); 296 static int get_user_key(struct listnode *list) argument 317 return read_key(path, list); 320 static void get_vendor_keys(struct listnode *list) argument 339 else if (!read_key(path, list))
|
H A D | fdevent.c | 476 fdevent *list = &list_pending; local 478 node->next = list; 479 node->prev = list->prev; 481 list->prev = node; 494 fdevent *list = &list_pending; local 495 fdevent *node = list->next; 497 if(node == list) return 0; 499 list->next = node->next; 500 list->next->prev = list; [all...] |
/system/core/init/ |
H A D | init.h | 20 #include <cutils/list.h> 28 /* list of commands in an action */ 37 /* node in list of all actions */ 41 /* node in list of actions for a trigger */ 81 /* list of all services */
|
H A D | devices.c | 44 #include <cutils/list.h> 91 struct listnode list; member in struct:platform_node 134 /* upaths omit the "/sys" that paths in this list 164 /* search the perms list in reverse so that ueventd.$hardware can 232 bus = node_to_item(node, struct platform_node, list); 245 list_add_tail(&platform_names, &bus->list); 260 bus = node_to_item(node, struct platform_node, list); 276 bus = node_to_item(node, struct platform_node, list);
|
H A D | signal_handler.c | 27 #include <cutils/list.h>
|