Home
last modified time | relevance | path

Searched refs:dict_first (Results 1 – 7 of 7) sorted by relevance

/third_party/f2fs-tools/fsck/
Ddict.c158 first = dict_first(dict); in verify_bintree()
838 dnode_t *dict_first(dict_t *dict) in dict_first() function
1012 dnode_t *node = dict_first(dict), *next; in dict_process()
1145 dnode_t *leftnode = dict_first(dest), *rightnode = dict_first(source); in dict_merge()
1449 for (dn = dict_first(d); dn; dn = dict_next(d, dn)) { in main()
Dmkquota.c51 for (n = dict_first(dict); n; n = dict_next(dict, n)) { in write_dquots()
395 for (n = dict_first(dict); n; n = dict_next(dict, n)) { in quota_compare_and_update()
Ddict.h105 extern dnode_t *dict_first(dict_t *);
/third_party/e2fsprogs/lib/support/
Ddict.c166 first = dict_first(dict); in verify_bintree()
875 dnode_t *dict_first(dict_t *dict) in dict_first() function
1052 dnode_t *node = dict_first(dict), *next; in dict_process()
1185 dnode_t *leftnode = dict_first(dest), *rightnode = dict_first(source); in dict_merge()
1489 for (dn = dict_first(d); dn; dn = dict_next(d, dn)) { in main()
Ddict.h107 extern dnode_t *dict_first(dict_t *);
Dmkquota.c152 for (n = dict_first(dict); n; n = dict_next(dict, n)) { in write_dquots()
685 for (n = dict_first(dict); n; n = dict_next(dict, n)) { in quota_compare_and_update()
/third_party/e2fsprogs/e2fsck/
Dpass1b.c523 for (n = dict_first(&ino_dict); n; n = dict_next(&ino_dict, n)) { in pass1d()