Searched refs:dict_next (Results 1 – 7 of 7) sorted by relevance
/third_party/f2fs-tools/fsck/ |
D | dict.c | 161 while (first && (next = dict_next(dict, first))) { in verify_bintree() 167 while (first && (next = dict_next(dict, first))) { in verify_bintree() 662 dnode_t *next = dict_next(dict, delete); in dict_delete() 870 dnode_t *dict_next(dict_t *dict, dnode_t *curr) in dict_next() function 1018 next = dict_next(dict, node); in dict_process() 1172 dnode_t *next = dict_next(dest, leftnode); in dict_merge() 1183 dnode_t *next = dict_next(source, rightnode); in dict_merge() 1449 for (dn = dict_first(d); dn; dn = dict_next(d, dn)) { in main()
|
D | mkquota.c | 51 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()
|
D | dict.h | 107 extern dnode_t *dict_next(dict_t *, dnode_t *);
|
/third_party/e2fsprogs/lib/support/ |
D | dict.c | 169 while (first && (next = dict_next(dict, first))) { in verify_bintree() 175 while (first && (next = dict_next(dict, first))) { in verify_bintree() 697 dnode_t *next = dict_next(dict, delete); in dict_delete() 909 dnode_t *dict_next(dict_t *dict, dnode_t *curr) in dict_next() function 1058 next = dict_next(dict, node); in dict_process() 1212 dnode_t *next = dict_next(dest, leftnode); in dict_merge() 1223 dnode_t *next = dict_next(source, rightnode); in dict_merge() 1489 for (dn = dict_first(d); dn; dn = dict_next(d, dn)) { in main()
|
D | dict.h | 109 extern dnode_t *dict_next(dict_t *, dnode_t *);
|
D | mkquota.c | 152 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/ |
D | pass1b.c | 523 for (n = dict_first(&ino_dict); n; n = dict_next(&ino_dict, n)) { in pass1d()
|