Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 43) sorted by relevance

12

/system/core/sh/
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 *args;
[all …]
Dexpand.h59 union node;
60 void expandhere(union node *, int);
61 void expandarg(union node *, struct arglist *, int);
65 int casematch(union node *, char *);
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 *);
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 *);
109 STATIC union node *makename(void);
127 union node *
149 STATIC union node *
[all …]
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 *);"
Deval.h51 union node; /* BLETCH for ansi C */
52 void evaltree(union node *, int);
53 void evalbackcmd(union node *, struct backcmd *);
Dparser.h75 #define NEOF ((union node *)&tokpushback)
79 union node *parsecmd(int);
80 void fixredir(union node *, const char *, int);
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 *new;
162 union node *n;
Dredir.h42 union node;
43 void redirect(union node *, int);
Dshow.h36 union node;
37 void showtree(union node *);
Deval.c104 STATIC void evalloop(union node *, int);
105 STATIC void evalfor(union node *, int);
106 STATIC void evalcase(union node *, int);
107 STATIC void evalsubshell(union node *, int);
108 STATIC void expredir(union node *);
109 STATIC void evalpipe(union node *);
110 STATIC void evalcommand(union node *, int, struct backcmd *);
111 STATIC void prehash(union node *);
198 union node *n; in evalstring()
220 evaltree(union node *n, int flags) in evaltree()
[all …]
Dnodes.c88 STATIC void calcsize(union node *);
90 STATIC union node *copynode(union node *);
100 union node *
102 union node *n; in copyfunc()
118 union node *n; in calcsize()
209 STATIC union node *
211 union node *n; in copynode()
213 union node *new;
343 union node *n; in freefunc()
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) in showtree()
73 shtree(union node *n, int ind, char *pfx, FILE *fp) in shtree()
124 shcmd(union node *cmd, FILE *fp) in shcmd()
126 union node *np; in shcmd()
166 sharg(union node *arg, FILE *fp) in sharg()
Dexec.h50 union node *func;
76 void defun(char *, union node *);
Dredir.c94 STATIC void openredirect(union node *, char[10], int);
95 STATIC int openhere(union node *);
107 redirect(union node *redir, int flags) in redirect()
109 union node *n; in redirect()
175 openredirect(union node *redir, char memory[10], int flags) in openredirect()
258 openhere(union node *redir) in openhere()
272 if (forkshell((struct job *)NULL, (union node *)NULL, FORK_NOJOB) == 0) { in openhere()
/system/core/libcutils/
Dconfig_utils.c28 cnode *node; in config_node() local
30 node = calloc(sizeof(cnode), 1); in config_node()
31 if(node) { in config_node()
32 node->name = name ? name : ""; in config_node()
33 node->value = value ? value : ""; in config_node()
36 return node; in config_node()
41 cnode *node, *match = NULL; in config_find() local
44 for(node = root->first_child; node; node = node->next) in config_find()
45 if(!strcmp(node->name, name)) in config_find()
46 match = node; in config_find()
[all …]
Dlist.c19 void list_init(struct listnode *node) in list_init() argument
21 node->next = node; in list_init()
22 node->prev = node; in list_init()
/system/core/sdcard/
Dsdcard.c98 struct node { struct
103 struct node *next; /* per-dir sibling list */ argument
104 struct node *child; /* first contained file by this dir */ argument
105 struct node *parent; /* containing directory */ argument
123 struct node root; argument
150 static void acquire_node_locked(struct node* node) in acquire_node_locked() argument
152 node->refcount++; in acquire_node_locked()
153 TRACE("ACQUIRE %p (%s) rc=%d\n", node, node->name, node->refcount); in acquire_node_locked()
156 static void remove_node_from_parent_locked(struct node* node);
158 static void release_node_locked(struct node* node) in release_node_locked() argument
[all …]
/system/core/include/cutils/
Dlist.h32 #define node_to_item(node, container, member) \ argument
33 (container *) (((char*) (node)) - offsetof(container, member))
41 #define list_for_each(node, list) \ argument
42 for (node = (list)->next; node != (list); node = node->next)
44 #define list_for_each_reverse(node, list) \ argument
45 for (node = (list)->prev; node != (list); node = node->prev)
/system/extras/fatblock/
Dfdpool.c35 static void fdpool_insert_head(struct pooled_fd *node) in fdpool_insert_head() argument
40 assert(node); in fdpool_insert_head()
42 prev->next = node; in fdpool_insert_head()
43 node->prev = prev; in fdpool_insert_head()
44 node->next = next; in fdpool_insert_head()
45 next->prev = node; in fdpool_insert_head()
50 static void fdpool_remove(struct pooled_fd *node) in fdpool_remove() argument
52 struct pooled_fd *prev = node->prev; in fdpool_remove()
53 struct pooled_fd *next = node->next; in fdpool_remove()
/system/core/init/
Dinit_parser.c347 struct listnode *node; in parse_config() local
388 list_for_each(node, &import_list) { in parse_config()
389 struct import *import = node_to_item(node, struct import, list); in parse_config()
427 struct listnode *node; in service_find_by_name() local
429 list_for_each(node, &service_list) { in service_find_by_name()
430 svc = node_to_item(node, struct service, slist); in service_find_by_name()
440 struct listnode *node; in service_find_by_pid() local
442 list_for_each(node, &service_list) { in service_find_by_pid()
443 svc = node_to_item(node, struct service, slist); in service_find_by_pid()
453 struct listnode *node; in service_find_by_keychord() local
[all …]
Ddevices.c101 struct perm_node *node = calloc(1, sizeof(*node)); in add_dev_perms() local
102 if (!node) in add_dev_perms()
105 node->dp.name = strdup(name); in add_dev_perms()
106 if (!node->dp.name) in add_dev_perms()
110 node->dp.attr = strdup(attr); in add_dev_perms()
111 if (!node->dp.attr) in add_dev_perms()
115 node->dp.perm = perm; in add_dev_perms()
116 node->dp.uid = uid; in add_dev_perms()
117 node->dp.gid = gid; in add_dev_perms()
118 node->dp.prefix = prefix; in add_dev_perms()
[all …]
Dparser.c16 struct listnode *node; in DUMP()
21 list_for_each(node, &service_list) { in DUMP()
22 svc = node_to_item(node, struct service, slist); in DUMP()
35 list_for_each(node, &action_list) { in DUMP()
36 act = node_to_item(node, struct action, alist); in DUMP()
/system/core/adb/
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) in fdevent_plist_enqueue() argument
478 node->next = list; in fdevent_plist_enqueue()
479 node->prev = list->prev; in fdevent_plist_enqueue()
480 node->prev->next = node; in fdevent_plist_enqueue()
481 list->prev = node; in fdevent_plist_enqueue()
484 static void fdevent_plist_remove(fdevent *node) in fdevent_plist_remove() argument
486 node->prev->next = node->next; in fdevent_plist_remove()
487 node->next->prev = node->prev; in fdevent_plist_remove()
[all …]
Dsysdeps_win32.c1266 static void fdevent_plist_enqueue(fdevent *node);
1267 static void fdevent_plist_remove(fdevent *node);
1366 EventHook node = *pnode; in event_looper_find_p() local
1368 if ( node == NULL || node->fh == fh ) in event_looper_find_p()
1370 pnode = &node->next; in event_looper_find_p()
1371 node = *pnode; in event_looper_find_p()
1381 EventHook node; in event_looper_hook() local
1389 node = *pnode; in event_looper_hook()
1390 if ( node == NULL ) { in event_looper_hook()
1391 node = event_hook_alloc( f ); in event_looper_hook()
[all …]

12