31 		if (pagenum >= node->tree->pages_per_bnode)  in hfs_bnode_read()
63 	struct hfs_btree *tree;  in hfs_bnode_read_key()  local
66 	tree = node->tree;  in hfs_bnode_read_key()
68 	    tree->attributes & HFS_TREE_VARIDXKEYS)  in hfs_bnode_read_key()
71 		key_len = tree->max_key_len + 1;  in hfs_bnode_read_key()
161 	off = node->tree->node_size - 2;  in hfs_bnode_dump()
168 			if (node->tree->attributes & HFS_TREE_VARIDXKEYS)  in hfs_bnode_dump()
171 				tmp = node->tree->max_key_len + 1;  in hfs_bnode_dump()
188 	struct hfs_btree *tree;  in hfs_bnode_unlink()  local
192 	tree = node->tree;  in hfs_bnode_unlink()
194 		tmp = hfs_bnode_find(tree, node->prev);  in hfs_bnode_unlink()
202 		tree->leaf_head = node->next;  in hfs_bnode_unlink()
205 		tmp = hfs_bnode_find(tree, node->next);  in hfs_bnode_unlink()
213 		tree->leaf_tail = node->prev;  in hfs_bnode_unlink()
220 		tree->root = 0;  in hfs_bnode_unlink()
221 		tree->depth = 0;  in hfs_bnode_unlink()
233 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)  in hfs_bnode_findhash()  argument
237 	if (cnid >= tree->node_count) {  in hfs_bnode_findhash()
238 		pr_err("request for non-existent node %d in B*Tree\n", cnid);  in hfs_bnode_findhash()
242 	for (node = tree->node_hash[hfs_bnode_hash(cnid)];  in hfs_bnode_findhash()
251 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)  in __hfs_bnode_create()  argument
259 	if (cnid >= tree->node_count) {  in __hfs_bnode_create()
260 		pr_err("request for non-existent node %d in B*Tree\n", cnid);  in __hfs_bnode_create()
264 	size = sizeof(struct hfs_bnode) + tree->pages_per_bnode *  in __hfs_bnode_create()
269 	node->tree = tree;  in __hfs_bnode_create()
274 		node->tree->cnid, node->this);  in __hfs_bnode_create()
276 	spin_lock(&tree->hash_lock);  in __hfs_bnode_create()
277 	node2 = hfs_bnode_findhash(tree, cnid);  in __hfs_bnode_create()
280 		node->next_hash = tree->node_hash[hash];  in __hfs_bnode_create()
281 		tree->node_hash[hash] = node;  in __hfs_bnode_create()
282 		tree->node_hash_cnt++;  in __hfs_bnode_create()
284 		spin_unlock(&tree->hash_lock);  in __hfs_bnode_create()
289 	spin_unlock(&tree->hash_lock);  in __hfs_bnode_create()
291 	mapping = tree->inode->i_mapping;  in __hfs_bnode_create()
292 	off = (loff_t)cnid * tree->node_size;  in __hfs_bnode_create()
295 	for (i = 0; i < tree->pages_per_bnode; i++) {  in __hfs_bnode_create()
317 		node->tree->cnid, node->this, atomic_read(&node->refcnt));  in hfs_bnode_unhash()
318 	for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)];  in hfs_bnode_unhash()
323 	node->tree->node_hash_cnt--;  in hfs_bnode_unhash()
326 /* Load a particular node out of a tree */
327 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num)  in hfs_bnode_find()  argument
334 	spin_lock(&tree->hash_lock);  in hfs_bnode_find()
335 	node = hfs_bnode_findhash(tree, num);  in hfs_bnode_find()
338 		spin_unlock(&tree->hash_lock);  in hfs_bnode_find()
344 	spin_unlock(&tree->hash_lock);  in hfs_bnode_find()
345 	node = __hfs_bnode_create(tree, num);  in hfs_bnode_find()
372 		if (node->height <= 1 || node->height > tree->depth)  in hfs_bnode_find()
379 	rec_off = tree->node_size - 2;  in hfs_bnode_find()
387 		    next_off > tree->node_size ||  in hfs_bnode_find()
414 	for (i = 0; i < node->tree->pages_per_bnode; i++)  in hfs_bnode_free()
420 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num)  in hfs_bnode_create()  argument
426 	spin_lock(&tree->hash_lock);  in hfs_bnode_create()
427 	node = hfs_bnode_findhash(tree, num);  in hfs_bnode_create()
428 	spin_unlock(&tree->hash_lock);  in hfs_bnode_create()
434 	node = __hfs_bnode_create(tree, num);  in hfs_bnode_create()
444 	       min((int)PAGE_SIZE, (int)tree->node_size));  in hfs_bnode_create()
447 	for (i = 1; i < tree->pages_per_bnode; i++) {  in hfs_bnode_create()
463 			node->tree->cnid, node->this,  in hfs_bnode_get()
472 		struct hfs_btree *tree = node->tree;  in hfs_bnode_put()  local
476 			node->tree->cnid, node->this,  in hfs_bnode_put()
479 		if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock))  in hfs_bnode_put()
481 		for (i = 0; i < tree->pages_per_bnode; i++) {  in hfs_bnode_put()
489 			spin_unlock(&tree->hash_lock);  in hfs_bnode_put()
494 		spin_unlock(&tree->hash_lock);  in hfs_bnode_put()