Home
last modified time | relevance | path

Searched refs:dirtree (Results 1 - 25 of 39) sorted by relevance

12

/third_party/toybox/lib/
H A Ddirtree.c0 /* dirtree.c - Functions for dealing with directory trees.
17 int dirtree_notdotdot(struct dirtree *catch) in dirtree_notdotdot()
24 // Create a dirtree node from a path, with stat and symlink info.
28 struct dirtree *dirtree_add_node(struct dirtree *parent, char *name, int flags) in dirtree_add_node()
30 struct dirtree *dt = 0; in dirtree_add_node()
50 dt = xmalloc((len = sizeof(struct dirtree)+len+1)+linklen); in dirtree_add_node()
51 memset(dt, 0, statless ? offsetof(struct dirtree, again) in dirtree_add_node()
52 : offsetof(struct dirtree, st)); in dirtree_add_node()
79 char *dirtree_path(struct dirtree *nod
[all...]
H A Dlib.h60 // dirtree.c
85 #define DIRTREE_ABORTVAL ((struct dirtree *)1)
87 struct dirtree { struct
88 struct dirtree *next, *parent, *child;
97 struct dirtree *dirtree_add_node(struct dirtree *p, char *name, int flags);
98 char *dirtree_path(struct dirtree *node, int *plen);
99 int dirtree_notdotdot(struct dirtree *catch);
100 int dirtree_parentfd(struct dirtree *node);
101 int dirtree_recurse(struct dirtree *nod
[all...]
/third_party/toybox/porting/liteos_a/lib/
H A Ddirtree.c0 /* dirtree.c - Functions for dealing with directory trees.
25 int dirtree_notdotdot(struct dirtree *catch) in dirtree_notdotdot()
32 // Create a dirtree node from a path, with stat and symlink info.
36 struct dirtree *dirtree_add_node(struct dirtree *parent, char *name, int flags) in dirtree_add_node()
38 struct dirtree *dt = 0; in dirtree_add_node()
58 dt = xmalloc((len = sizeof(struct dirtree)+len+1)+linklen); in dirtree_add_node()
59 memset(dt, 0, statless ? offsetof(struct dirtree, again) in dirtree_add_node()
60 : offsetof(struct dirtree, st)); in dirtree_add_node()
87 char *dirtree_path(struct dirtree *nod
[all...]
H A Dlib.h60 // dirtree.c
85 #define DIRTREE_ABORTVAL ((struct dirtree *)1)
87 struct dirtree { struct
88 struct dirtree *next, *parent, *child;
99 struct dirtree *dirtree_add_node(struct dirtree *p, char *name, int flags);
100 char *dirtree_path(struct dirtree *node, int *plen);
101 int dirtree_notdotdot(struct dirtree *catch);
102 int dirtree_parentfd(struct dirtree *node);
103 int dirtree_recurse(struct dirtree *nod
[all...]
/third_party/toybox/porting/liteos_a/toys/posix/
H A Ddu.c38 struct dirtree *node;
43 static void print(long long size, struct dirtree *node) in print()
96 // dirtree callback, compute/display size of node
97 static int do_du(struct dirtree *node) in do_du()
108 struct dirtree *try = node; in do_du()
H A Dls.c59 struct dirtree *files, *singledir;
130 static void entrylen(struct dirtree *dt, unsigned *len) in entrylen()
160 struct dirtree *dta = *(struct dirtree **)a; in compare()
161 struct dirtree *dtb = *(struct dirtree **)b; in compare()
180 static int filter(struct dirtree *new) in filter()
294 // Display a list of dirtree entries, according to current format
297 static void listfiles(int dirfd, struct dirtree *indir) in listfiles()
299 struct dirtree *d in listfiles()
[all...]
H A Dcp.c96 int (*callback)(struct dirtree *try);
110 static int cp_node(struct dirtree *try) in cp_node()
196 struct dirtree *or; in cp_node()
482 static int install_node(struct dirtree *try) in install_node()
H A Dchmod.c42 static int do_chmod(struct dirtree *try) in do_chmod()
H A Dps.c168 struct dirtree *threadparent;
656 // dirtree callback: read data about a process, then display or store it.
659 static int get_ps(struct dirtree *new) in get_ps()
957 static int get_threads(struct dirtree *new) in get_threads()
959 struct dirtree *dt; in get_threads()
1202 static struct procpid **collate_leaves(struct procpid **tb, struct dirtree *dt) in collate_leaves()
1205 struct dirtree *next = dt->next; in collate_leaves()
1217 // fields from dirtree leaf nodes. (top diffs old & new array to show changes)
1218 static struct procpid **collate(int count, struct dirtree *dt) in collate()
1345 struct dirtree *d in top_common()
[all...]
H A Drm.c71 static int do_rm(struct dirtree *try) in do_rm()
154 // dirtree's stat would report the nonexistence as an error, but that's in rm_main()
/third_party/toybox/toys/posix/
H A Ddu.c9 * because dirtree->extra is a long.
51 struct dirtree *node;
56 static void print(long long size, struct dirtree *node) in print()
110 // dirtree callback, compute/display size of node
111 static int do_du(struct dirtree *node) in do_du()
124 struct dirtree *try = node; in do_du()
H A Dls.c60 struct dirtree *files, *singledir;
131 static void entrylen(struct dirtree *dt, unsigned *len) in entrylen()
161 struct dirtree *dta = *(struct dirtree **)a; in compare()
162 struct dirtree *dtb = *(struct dirtree **)b; in compare()
181 static int filter(struct dirtree *new) in filter()
304 // Display a list of dirtree entries, according to current format
307 static void listfiles(int dirfd, struct dirtree *indir) in listfiles()
309 struct dirtree *d in listfiles()
[all...]
H A Dcp.c112 int (*callback)(struct dirtree *try);
126 static int cp_node(struct dirtree *try) in cp_node()
223 struct dirtree *or; in cp_node()
478 static int install_node(struct dirtree *try) in install_node()
H A Dfind.c96 static int flush_exec(struct dirtree *new, struct exec_range *aa) in flush_exec()
164 static void do_print(struct dirtree *new, char c) in do_print()
173 static void execdir(struct dirtree *new, int flush) in execdir()
211 static int do_find(struct dirtree *new) in do_find()
238 struct dirtree *n; in do_find()
450 struct dirtree *dt = new; in do_find()
H A Dchmod.c42 static int do_chmod(struct dirtree *try) in do_chmod()
H A Dchgrp.c45 static int do_chgrp(struct dirtree *node) in do_chgrp()
H A Drm.c26 static int do_rm(struct dirtree *try) in do_rm()
113 // dirtree's stat would report the nonexistence as an error, but that's in rm_main()
H A Dps.c211 struct dirtree *threadparent;
699 // dirtree callback: read data about a process, then display or store it.
702 static int get_ps(struct dirtree *new) in get_ps()
1000 static int get_threads(struct dirtree *new) in get_threads()
1002 struct dirtree *dt; in get_threads()
1245 static struct procpid **collate_leaves(struct procpid **tb, struct dirtree *dt) in collate_leaves()
1248 struct dirtree *next = dt->next; in collate_leaves()
1260 // fields from dirtree leaf nodes. (top diffs old & new array to show changes)
1261 static struct procpid **collate(int count, struct dirtree *dt) in collate()
1285 struct dirtree *d in ps_main()
[all...]
/third_party/toybox/toys/pending/
H A Dmke2fs.c83 char *gendir; // Where to read dirtree from.
86 struct dirtree *dt; // Tree of files to copy into the new filesystem.
288 static struct dirtree *treenext(struct dirtree *this) in treenext()
300 static long check_treesize(struct dirtree *that, off_t *size) in check_treesize()
328 static void check_treelinks(struct dirtree *tree) in check_treelinks()
330 struct dirtree *current=tree, *that; in check_treelinks()
498 // Fill out an inode structure from struct stat info in dirtree.
499 static void fill_inode(struct ext2_inode *in, struct dirtree *that) in fill_inode()
550 struct dirtree *dt in mke2fs_main()
[all...]
/third_party/toybox/toys/other/
H A Dacpi.c44 static int acpi_callback(struct dirtree *tree) in acpi_callback()
85 static int temp_callback(struct dirtree *tree) in temp_callback()
108 static int cool_callback(struct dirtree *tree) in cool_callback()
H A Dchcon.c24 static int do_chcon(struct dirtree *try) in do_chcon()
H A Dlsusb.c18 static int list_device(struct dirtree *new) in list_device()
H A Dlsattr.c142 static int retell_dir(struct dirtree *root) in retell_dir()
252 static int update_attr(struct dirtree *root) in update_attr()
H A Dswitch_root.c30 static int del_node(struct dirtree *node) in del_node()
/third_party/toybox/generated/
H A Dglobals.h901 char *gendir; // Where to read dirtree from.
904 struct dirtree *dt; // Tree of files to copy into the new filesystem.
1222 int (*callback)(struct dirtree *try);
1365 struct dirtree *files, *singledir;
1461 struct dirtree *threadparent;

Completed in 25 milliseconds

12