Searched refs:node (Results 1 - 25 of 40) sorted by relevance

12

/system/core/sh/
H A Dredir.h42 union node;
43 void redirect(union node *, int);
H A Dnodes.h36 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 Dshow.h36 union node;
37 void showtree(union node *);
H A Dexpand.h59 union node;
60 void expandhere(union node *, int);
61 void expandarg(union node *, struct arglist *, int);
65 int casematch(union node *, char *);
H A Deval.h51 union node; /* BLETCH for ansi C */
52 void evaltree(union node *, int);
53 void evalbackcmd(union node *, struct backcmd *);
H A Djobs.h95 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 Dnodes.c.pat50 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 Dparser.h75 #define NEOF ((union node *)&tokpushback)
79 union node *parsecmd(int);
80 void fixredir(union node *, const char *, int);
H A Dmknodes.sh90 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 Dexec.h50 union node *func;
76 void defun(char *, union node *);
H A Dparser.c81 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 Dshow.c57 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 Dnodes.c54 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...]
/system/core/include/cutils/
H A Dlist.h28 #define node_to_item(node, container, member) \
29 (container *) (((char*) (node)) - offsetof(container, member))
37 #define list_for_each(node, list) \
38 for (node = (list)->next; node != (list); node = node->next)
40 #define list_for_each_reverse(node, list) \
41 for (node = (list)->prev; node !
[all...]
/system/core/sdcard/
H A Dsdcard.c53 * CREAT) must bump that node's refcount
76 struct node *node; member in struct:handle
81 struct node *node; member in struct:dirhandle
85 struct node { struct
89 struct node *next; /* per-dir sibling list */
90 struct node *child; /* first contained file by this dir */
91 struct node *all; /* global node lis
132 do_node_get_path(struct node *node, char *buf, const char *name, int match_case_insensitive) argument
189 node_get_path(struct node *node, char *buf, const char *name) argument
224 node_get_attr(struct node *node, struct fuse_attr *attr) argument
243 add_node_to_parent(struct node *node, struct node *parent) argument
254 node_find_actual_name(struct node *node) argument
287 struct node *node; local
309 rename_node(struct node *node, const char *name) argument
355 lookup_child_by_name(struct node *node, const char *name) argument
365 lookup_child_by_inode(struct node *node, __u64 nid) argument
375 dec_refcount(struct node *node) argument
387 struct node *node; local
412 struct node *node; local
437 node_release(struct node *node) argument
502 lookup_entry(struct fuse *fuse, struct node *node, const char *name, __u64 unique) argument
527 struct node *node; local
[all...]
/system/core/libcutils/
H A Dconfig_utils.c28 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...]
H A Dlist.c19 void list_init(struct listnode *node) argument
21 node->next = node;
22 node->prev = node;
/system/extras/fatblock/
H A Dfdpool.c35 static void fdpool_insert_head(struct pooled_fd *node) argument
40 assert(node);
42 prev->next = node;
43 node->prev = prev;
44 node->next = next;
45 next->prev = node;
50 static void fdpool_remove(struct pooled_fd *node) argument
52 struct pooled_fd *prev = node->prev;
53 struct pooled_fd *next = node->next;
/system/media/wilhelm/src/ut/
H A DOpenSLESUT.c116 iid->node[0], iid->node[1], iid->node[2], iid->node[3], iid->node[4], iid->node[5]);
/system/media/wilhelm/tests/examples/
H A DslesTestEffectCapabilities.cpp56 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/init/
H A Dinit_parser.c260 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
288 list_for_each(node, &service_list) {
289 svc = node_to_item(node, struct service, slist);
299 struct listnode *node; local
310 struct listnode *node; local
323 struct listnode *node; local
336 struct listnode *node; local
348 struct listnode *node; local
368 struct listnode *node; local
427 struct listnode *node = list_head(&action_queue); local
[all...]
H A Ddevices.c88 struct perm_node *node = calloc(1, sizeof(*node)); local
89 if (!node)
92 node->dp.name = strdup(name);
93 if (!node->dp.name)
97 node->dp.attr = strdup(attr);
98 if (!node->dp.attr)
102 node->dp.perm = perm;
103 node->dp.uid = uid;
104 node
118 struct listnode *node; local
147 struct listnode *node; local
200 struct listnode *node; local
228 struct listnode *node; local
244 struct listnode *node; local
[all...]
H A Dparser.c16 struct listnode *node;
21 list_for_each(node, &service_list) {
22 svc = node_to_item(node, struct service, slist);
35 list_for_each(node, &action_list) {
36 act = node_to_item(node, struct action, alist);
/system/media/wilhelm/src/itf/
H A DIAndroidEffectCapabilities.c118 thiz->mFxDescriptors[i].type.node[0],
119 thiz->mFxDescriptors[i].type.node[1],
120 thiz->mFxDescriptors[i].type.node[2],
121 thiz->mFxDescriptors[i].type.node[3],
122 thiz->mFxDescriptors[i].type.node[4],
123 thiz->mFxDescriptors[i].type.node[5],
/system/core/adb/
H A Dfdevent.c92 static void fdevent_plist_enqueue(fdevent *node);
93 static void fdevent_plist_remove(fdevent *node);
474 static void fdevent_plist_enqueue(fdevent *node) argument
478 node->next = list;
479 node->prev = list->prev;
480 node->prev->next = node;
481 list->prev = node;
484 static void fdevent_plist_remove(fdevent *node) argument
486 node
495 fdevent *node = list->next; local
[all...]

Completed in 197 milliseconds

12