86 	struct htree_node *child[2];  member
191 	res = traverse_post_order(targ, node->child[0]);  in traverse_post_order()
195 	res = traverse_post_order(targ, node->child[1]);  in traverse_post_order()
226 		struct htree_node *child;  in find_closest_node()  local
237 		child = node->child[((node_id >> bit_idx) & 1)];  in find_closest_node()
238 		if (!child)  in find_closest_node()
240 		node = child;  in find_closest_node()
285 		assert(!node->child[n & 1]);  in get_node()
292 		node->child[n & 1] = nc;  in get_node()
425 	if (node->child[0]) {  in calc_node_hash()
426 		res = crypto_hash_update(ctx, node->child[0]->node.hash,  in calc_node_hash()
427 					 sizeof(node->child[0]->node.hash));  in calc_node_hash()
432 	if (node->child[1]) {  in calc_node_hash()
433 		res = crypto_hash_update(ctx, node->child[1]->node.hash,  in calc_node_hash()
434 					 sizeof(node->child[1]->node.hash));  in calc_node_hash()
975 		assert(!node->child[0] && !node->child[1]);  in tee_fs_htree_truncate()
977 		assert(node->parent->child[node->id & 1] == node);  in tee_fs_htree_truncate()
978 		node->parent->child[node->id & 1] = NULL;  in tee_fs_htree_truncate()