/system/core/sh/ |
H A D | redir.h | 42 union node; 43 void redirect(union node *, int);
|
H A D | nodes.h | 36 union node *ch1; 37 union node *ch2; 44 union node *args; 45 union node *redirect; 58 union node *n; 59 union node *redirect; 65 union node *test; 66 union node *ifpart; 67 union node *elsepart; 73 union node *arg 134 union node { union [all...] |
H A D | show.h | 36 union node; 37 void showtree(union node *);
|
H A D | expand.h | 59 union node; 60 void expandhere(union node *, int); 61 void expandarg(union node *, struct arglist *, int); 65 int casematch(union node *, char *);
|
H A D | eval.h | 51 union node; /* BLETCH for ansi C */ 52 void evaltree(union node *, int); 53 void evalbackcmd(union node *, struct backcmd *);
|
H A D | jobs.h | 95 struct job *makejob(union node *, int); 96 int forkshell(struct job *, union node *, int); 97 void forkchild(struct job *, union node *, int, int); 98 int forkparent(struct job *, union node *, int, pid_t); 101 void commandtext(struct procstat *, union node *);
|
H A D | nodes.c.pat | 50 int funcstringsize; /* size of strings in node */ 57 STATIC void calcsize(union node *); 59 STATIC union node *copynode(union node *); 69 union node * 71 union node *n; 87 union node *n; 107 STATIC union node * 109 union node *n; 111 union node *ne [all...] |
H A D | parser.h | 75 #define NEOF ((union node *)&tokpushback) 79 union node *parsecmd(int); 80 void fixredir(union node *, const char *, int);
|
H A D | mknodes.sh | 90 nodeptr ) type="union node *";; 103 echo "union node {" 113 echo " union node *n;" 117 echo "union node *copyfunc(union node *);" 118 echo "void freefunc(union node *);"
|
H A D | exec.h | 50 union node *func; 76 void defun(char *, union node *);
|
H A D | parser.c | 81 union node *here; /* redirection node */ 98 union node *redirnode; 104 STATIC union node *list(int); 105 STATIC union node *andor(void); 106 STATIC union node *pipeline(void); 107 STATIC union node *command(void); 108 STATIC union node *simplecmd(union node **, union node *); [all...] |
H A D | show.c | 57 static void shtree(union node *, int, char *, FILE*); 58 static void shcmd(union node *, FILE *); 59 static void sharg(union node *, FILE *); 65 showtree(union node *n) 73 shtree(union node *n, int ind, char *pfx, FILE *fp) 114 fprintf(fp, "<node type %d>", n->type); 124 shcmd(union node *cmd, FILE *fp) 126 union node *np; 166 sharg(union node *arg, FILE *fp) 173 printf("<node typ [all...] |
H A D | nodes.c | 54 int funcstringsize; /* size of strings in node */ 88 STATIC void calcsize(union node *); 90 STATIC union node *copynode(union node *); 100 union node * 102 union node *n; 118 union node *n; 209 STATIC union node * 211 union node *n; 213 union node *ne [all...] |
H A D | redir.c | 94 STATIC void openredirect(union node *, char[10], int); 95 STATIC int openhere(union node *); 107 redirect(union node *redir, int flags) 109 union node *n; 175 openredirect(union node *redir, char memory[10], int flags) 258 openhere(union node *redir) 272 if (forkshell((struct job *)NULL, (union node *)NULL, FORK_NOJOB) == 0) {
|
/system/core/init/ |
H A D | list.h | 26 #define node_to_item(node, container, member) \ 27 (container *) (((char*) (node)) - offsetof(container, member)) 35 #define list_for_each(node, list) \ 36 for (node = (list)->next; node != (list); node = node->next) 38 #define list_for_each_reverse(node, list) \ 39 for (node = (list)->prev; node ! [all...] |
H A D | init_parser.c | 247 struct listnode *node; local 249 list_for_each(node, &service_list) { 250 svc = node_to_item(node, struct service, slist); 260 struct listnode *node; local 262 list_for_each(node, &service_list) { 263 svc = node_to_item(node, struct service, slist); 273 struct listnode *node; local 275 list_for_each(node, &service_list) { 276 svc = node_to_item(node, struct service, slist); 286 struct listnode *node; local 297 struct listnode *node; local 310 struct listnode *node; local 323 struct listnode *node; local 335 struct listnode *node; local 354 struct listnode *node; local 412 struct listnode *node = list_head(&action_queue); local [all...] |
H A D | parser.c | 17 struct listnode *node; 22 list_for_each(node, &service_list) { 23 svc = node_to_item(node, struct service, slist); 36 list_for_each(node, &action_list) { 37 act = node_to_item(node, struct action, alist);
|
H A D | devices.c | 105 struct perm_node *node = calloc(1, sizeof(*node)); local 106 if (!node) 109 node->dp.name = strdup(name); 110 if (!node->dp.name) 114 node->dp.attr = strdup(attr); 115 if (!node->dp.attr) 119 node->dp.perm = perm; 120 node->dp.uid = uid; 121 node 135 struct listnode *node; local 164 struct listnode *node; local [all...] |
H A D | signal_handler.c | 51 struct listnode *node; local 113 list_for_each(node, &svc->onrestart.commands) { 114 cmd = node_to_item(node, struct command, clist);
|
/system/core/libcutils/ |
H A D | config_utils.c | 28 cnode *node; local 30 node = calloc(sizeof(cnode), 1); 31 if(node) { 32 node->name = name ? name : ""; 33 node->value = value ? value : ""; 36 return node; 41 cnode *node, *match = NULL; local 44 for(node = root->first_child; node; node 53 cnode *node; local 69 cnode *node; local 87 cnode *node; local 97 cnode *node; local 245 parse_block(cstate *cs, cnode *node) argument 264 cnode *node; local [all...] |
/system/core/sdcard/ |
H A D | sdcard.c | 52 * CREAT) must bump that node's refcount 61 * - need to move/rename node on RENAME 79 struct node *node; member in struct:handle 84 struct node *node; member in struct:dirhandle 88 struct node { struct 92 struct node *next; 93 struct node *child; 94 struct node *al 117 node_get_path(struct node *node, char *buf, const char *name) argument 173 node_get_attr(struct node *node, struct fuse_attr *attr) argument 194 struct node *node; local 254 lookup_child_by_name(struct node *node, const char *name) argument 264 lookup_child_by_inode(struct node *node, __u64 nid) argument 280 struct node *node; local 305 node_release(struct node *node) argument 368 lookup_entry(struct fuse *fuse, struct node *node, const char *name, __u64 unique) argument 393 struct node *node; local [all...] |
/system/media/opensles/libopensles/ |
H A D | OpenSLESUT.c | 116 iid->node[0], iid->node[1], iid->node[2], iid->node[3], iid->node[4], iid->node[5]);
|
H A D | IAndroidEffectCapabilities.c | 118 this->mFxDescriptors[i].type.node[0], 119 this->mFxDescriptors[i].type.node[1], 120 this->mFxDescriptors[i].type.node[2], 121 this->mFxDescriptors[i].type.node[3], 122 this->mFxDescriptors[i].type.node[4], 123 this->mFxDescriptors[i].type.node[5],
|
/system/media/opensles/tests/examples/ |
H A D | slesTestEffectCapabilities.cpp | 56 guid->node[0], 57 guid->node[1], 58 guid->node[2], 59 guid->node[3], 60 guid->node[4], 61 guid->node[5]);
|
/system/core/adb/ |
H A D | fdevent.c | 67 static void fdevent_plist_enqueue(fdevent *node); 68 static void fdevent_plist_remove(fdevent *node); 364 static void fdevent_plist_enqueue(fdevent *node) argument 368 node->next = list; 369 node->prev = list->prev; 370 node->prev->next = node; 371 list->prev = node; 374 static void fdevent_plist_remove(fdevent *node) argument 376 node 385 fdevent *node = list->next; local [all...] |