Home
last modified time | relevance | path

Searched refs:leftnode (Results 1 – 3 of 3) sorted by relevance

/external/e2fsprogs/util/
Dmkutf8data.c369 unsigned char leftnode; member
398 if (node->leftnode == NODE) { in lookup()
400 } else if (node->leftnode == LEAF) { in lookup()
450 if (node->leftnode == LEAF) { in tree_walk()
456 assert(node->leftnode == NODE); in tree_walk()
498 node->leftnode = NODE; in alloc_node()
564 node->leftnode = LEAF; in insert()
567 if (node->leftnode == NODE || node->rightnode == NODE) in insert()
584 parent->leftnode = LEAF; in insert()
679 if (node->leftnode == LEAF) in prune()
[all …]
/external/e2fsprogs/lib/support/
Ddict.c1175 dnode_t *leftnode = dict_first(dest), *rightnode = dict_first(source); in dict_merge() local
1186 if (leftnode != NULL && rightnode != NULL) { in dict_merge()
1187 if (dest->compare(leftnode->key, rightnode->key) < 0) in dict_merge()
1191 } else if (leftnode != NULL) { in dict_merge()
1196 dict_assert (leftnode == NULL && rightnode == NULL); in dict_merge()
1202 dnode_t *next = dict_next(dest, leftnode); in dict_merge()
1204 leftnode->left = NULL; /* suppress assertion in dict_load_next */ in dict_merge()
1206 dict_load_next(&load, leftnode, leftnode->key); in dict_merge()
1207 leftnode = next; in dict_merge()
/external/f2fs-tools/fsck/
Ddict.c1145 dnode_t *leftnode = dict_first(dest), *rightnode = dict_first(source); in dict_merge() local
1156 if (leftnode != NULL && rightnode != NULL) { in dict_merge()
1157 if (dest->compare(leftnode->key, rightnode->key) < 0) in dict_merge()
1161 } else if (leftnode != NULL) { in dict_merge()
1166 dict_assert(leftnode == NULL && rightnode == NULL); in dict_merge()
1172 dnode_t *next = dict_next(dest, leftnode); in dict_merge()
1174 leftnode->left = NULL; /* suppress assertion in dict_load_next */ in dict_merge()
1176 dict_load_next(&load, leftnode, leftnode->key); in dict_merge()
1177 leftnode = next; in dict_merge()