139 static TEE_Result rpc_read_node(struct tee_fs_htree *ht, size_t node_id,  in rpc_read_node()  argument
143 	return rpc_read(ht, TEE_FS_HTREE_TYPE_NODE, node_id - 1, vers,  in rpc_read_node()
170 static TEE_Result rpc_write_node(struct tee_fs_htree *ht, size_t node_id,  in rpc_write_node()  argument
174 	return rpc_write(ht, TEE_FS_HTREE_TYPE_NODE, node_id - 1, vers,  in rpc_write_node()
210 static size_t node_id_to_level(size_t node_id)  in node_id_to_level()  argument
212 	assert(node_id && node_id < UINT_MAX);  in node_id_to_level()
214 	return sizeof(unsigned int) * 8 - __builtin_clz(node_id);  in node_id_to_level()
218 					    size_t node_id)  in find_closest_node()  argument
221 	size_t level = node_id_to_level(node_id);  in find_closest_node()
237 		child = node->child[((node_id >> bit_idx) & 1)];  in find_closest_node()
246 static struct htree_node *find_node(struct tee_fs_htree *ht, size_t node_id)  in find_node()  argument
248 	struct htree_node *node = find_closest_node(ht, node_id);  in find_node()
250 	if (node && node->id == node_id)  in find_node()
256 			   size_t node_id, struct htree_node **node_ret)  in get_node()  argument
262 	node = find_closest_node(ht, node_id);  in get_node()
265 	if (node->id == node_id)  in get_node()
279 	for (n = node->id + 1; n <= node_id; n++) {  in get_node()
379 	size_t node_id = 2;  in init_tree_from_data()  local
381 	while (node_id <= ht->imeta.max_node_id) {  in init_tree_from_data()
382 		node = find_node(ht, node_id >> 1);  in init_tree_from_data()
386 				    HTREE_NODE_COMMITTED_CHILD(node_id & 1));  in init_tree_from_data()
388 		res = rpc_read_node(ht, node_id, committed_version,  in init_tree_from_data()
393 		res = get_node(ht, true, node_id, &nc);  in init_tree_from_data()
397 		node_id++;  in init_tree_from_data()
966 	size_t node_id = BLOCK_NUM_TO_NODE_ID(block_num);  in tee_fs_htree_truncate()  local
972 	while (node_id < ht->imeta.max_node_id) {  in tee_fs_htree_truncate()