Lines Matching full:indexing

151 		return "indexing node";  in dbg_ntype()
953  * This function dumps whole UBIFS indexing B-tree, unlike 'ubifs_dump_tnc()'
1166  * In UBIFS indexing B-tree colliding keys has to be sorted in binary order of
1551  * @znode_cb: called for each indexing node
1555  * node and @znode_cb for each indexing node. Returns zero in case of success
1570 	/* If the root indexing node is not in TNC - pull it */  in dbg_walk_index()
1581 	 * We are going to traverse the indexing tree in the postorder manner.  in dbg_walk_index()
1582 	 * Go down and find the leftmost indexing node where we are going to  in dbg_walk_index()
1600 	/* Iterate over all indexing nodes */  in dbg_walk_index()
1690  * every indexing node and adds its size to the 'long long' variable pointed to
1967  * every single leaf node while walking the indexing tree. It checks that the
1968  * leaf node referred from the indexing tree exists, has correct CRC, and does
2260  * The function reads whole indexing tree and all nodes, so it is pretty