90 	struct htree_node root;  member
207 	return traverse_post_order(&targ, &ht->root);  in htree_traverse_post_order()
213 	/* Calculate level of the node, root node (1) has level 1 */  in node_id_to_level()
220 	struct htree_node *node = &ht->root;  in find_closest_node()
224 	/* n = 1 because root node is level 1 */  in find_closest_node()
329 			res = rpc_read_node(ht, 1, idx, &ht->root.node);  in init_head_from_data()
333 			if (!memcmp(ht->root.node.hash, hash,  in init_head_from_data()
334 				    sizeof(ht->root.node.hash))) {  in init_head_from_data()
357 		res = rpc_read_node(ht, 1, idx, &ht->root.node);  in init_head_from_data()
367 	ht->root.id = 1;  in init_head_from_data()
492 		res = crypto_authenc_update_aad(ctx, mode, ht->root.node.hash,  in authenc_init()
623 	ht->root.id = 1;  in init_root_node()
624 	ht->root.dirty = true;  in init_root_node()
626 	res = calc_node_hash(&ht->root, &ht->imeta.meta, ctx,  in init_root_node()
627 			     ht->root.node.hash);  in init_root_node()
734 	ht->root.dirty = true;  in tee_fs_htree_meta_set_dirty()
832 	/* All the nodes are written to storage now. Time to update root. */  in tee_fs_htree_sync_to_storage()
843 		memcpy(hash, ht->root.node.hash, sizeof(ht->root.node.hash));  in tee_fs_htree_sync_to_storage()