Orange Pi5 kernel

^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   1) // SPDX-License-Identifier: GPL-2.0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   2) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   3)  *  linux/fs/hfs/bnode.c
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   4)  *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   5)  * Copyright (C) 2001
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   6)  * Brad Boyer (flar@allandria.com)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   7)  * (C) 2003 Ardis Technologies <roman@ardistech.com>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   8)  *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   9)  * Handle basic btree node operations
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  10)  */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  11) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  12) #include <linux/pagemap.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  13) #include <linux/slab.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  14) #include <linux/swap.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  15) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  16) #include "btree.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  17) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  18) void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  19) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  20) 	struct page *page;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  21) 	int pagenum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  22) 	int bytes_read;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  23) 	int bytes_to_read;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  24) 	void *vaddr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  25) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  26) 	off += node->page_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  27) 	pagenum = off >> PAGE_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  28) 	off &= ~PAGE_MASK; /* compute page offset for the first page */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  29) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  30) 	for (bytes_read = 0; bytes_read < len; bytes_read += bytes_to_read) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  31) 		if (pagenum >= node->tree->pages_per_bnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  32) 			break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  33) 		page = node->page[pagenum];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  34) 		bytes_to_read = min_t(int, len - bytes_read, PAGE_SIZE - off);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  35) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  36) 		vaddr = kmap_atomic(page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  37) 		memcpy(buf + bytes_read, vaddr + off, bytes_to_read);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  38) 		kunmap_atomic(vaddr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  39) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  40) 		pagenum++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  41) 		off = 0; /* page offset only applies to the first page */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  42) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  43) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  44) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  45) u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  46) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  47) 	__be16 data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  48) 	// optimize later...
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  49) 	hfs_bnode_read(node, &data, off, 2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  50) 	return be16_to_cpu(data);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  51) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  52) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  53) u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  54) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  55) 	u8 data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  56) 	// optimize later...
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  57) 	hfs_bnode_read(node, &data, off, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  58) 	return data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  59) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  60) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  61) void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  62) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  63) 	struct hfs_btree *tree;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  64) 	int key_len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  65) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  66) 	tree = node->tree;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  67) 	if (node->type == HFS_NODE_LEAF ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  68) 	    tree->attributes & HFS_TREE_VARIDXKEYS)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  69) 		key_len = hfs_bnode_read_u8(node, off) + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  70) 	else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  71) 		key_len = tree->max_key_len + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  72) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  73) 	hfs_bnode_read(node, key, off, key_len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  74) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  75) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  76) void hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  77) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  78) 	struct page *page;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  79) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  80) 	off += node->page_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  81) 	page = node->page[0];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  82) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  83) 	memcpy(kmap(page) + off, buf, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  84) 	kunmap(page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  85) 	set_page_dirty(page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  86) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  87) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  88) void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  89) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  90) 	__be16 v = cpu_to_be16(data);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  91) 	// optimize later...
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  92) 	hfs_bnode_write(node, &v, off, 2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  93) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  94) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  95) void hfs_bnode_write_u8(struct hfs_bnode *node, int off, u8 data)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  96) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  97) 	// optimize later...
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  98) 	hfs_bnode_write(node, &data, off, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  99) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) void hfs_bnode_clear(struct hfs_bnode *node, int off, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103) 	struct page *page;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105) 	off += node->page_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106) 	page = node->page[0];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) 	memset(kmap(page) + off, 0, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109) 	kunmap(page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110) 	set_page_dirty(page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 112) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 113) void hfs_bnode_copy(struct hfs_bnode *dst_node, int dst,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114) 		struct hfs_bnode *src_node, int src, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) 	struct page *src_page, *dst_page;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118) 	hfs_dbg(BNODE_MOD, "copybytes: %u,%u,%u\n", dst, src, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119) 	if (!len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120) 		return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) 	src += src_node->page_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122) 	dst += dst_node->page_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123) 	src_page = src_node->page[0];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124) 	dst_page = dst_node->page[0];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) 	memcpy(kmap(dst_page) + dst, kmap(src_page) + src, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) 	kunmap(src_page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128) 	kunmap(dst_page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129) 	set_page_dirty(dst_page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132) void hfs_bnode_move(struct hfs_bnode *node, int dst, int src, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134) 	struct page *page;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135) 	void *ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137) 	hfs_dbg(BNODE_MOD, "movebytes: %u,%u,%u\n", dst, src, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) 	if (!len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139) 		return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140) 	src += node->page_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141) 	dst += node->page_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) 	page = node->page[0];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143) 	ptr = kmap(page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144) 	memmove(ptr + dst, ptr + src, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145) 	kunmap(page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146) 	set_page_dirty(page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149) void hfs_bnode_dump(struct hfs_bnode *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151) 	struct hfs_bnode_desc desc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152) 	__be32 cnid;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153) 	int i, off, key_off;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155) 	hfs_dbg(BNODE_MOD, "bnode: %d\n", node->this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156) 	hfs_bnode_read(node, &desc, 0, sizeof(desc));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157) 	hfs_dbg(BNODE_MOD, "%d, %d, %d, %d, %d\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158) 		be32_to_cpu(desc.next), be32_to_cpu(desc.prev),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 159) 		desc.type, desc.height, be16_to_cpu(desc.num_recs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 160) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 161) 	off = node->tree->node_size - 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162) 	for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) 		key_off = hfs_bnode_read_u16(node, off);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164) 		hfs_dbg_cont(BNODE_MOD, " %d", key_off);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) 		if (i && node->type == HFS_NODE_INDEX) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166) 			int tmp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168) 			if (node->tree->attributes & HFS_TREE_VARIDXKEYS)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169) 				tmp = (hfs_bnode_read_u8(node, key_off) | 1) + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) 			else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171) 				tmp = node->tree->max_key_len + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172) 			hfs_dbg_cont(BNODE_MOD, " (%d,%d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173) 				     tmp, hfs_bnode_read_u8(node, key_off));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174) 			hfs_bnode_read(node, &cnid, key_off + tmp, 4);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175) 			hfs_dbg_cont(BNODE_MOD, ",%d)", be32_to_cpu(cnid));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176) 		} else if (i && node->type == HFS_NODE_LEAF) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177) 			int tmp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179) 			tmp = hfs_bnode_read_u8(node, key_off);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180) 			hfs_dbg_cont(BNODE_MOD, " (%d)", tmp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181) 		}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183) 	hfs_dbg_cont(BNODE_MOD, "\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186) void hfs_bnode_unlink(struct hfs_bnode *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188) 	struct hfs_btree *tree;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189) 	struct hfs_bnode *tmp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190) 	__be32 cnid;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) 	tree = node->tree;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193) 	if (node->prev) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194) 		tmp = hfs_bnode_find(tree, node->prev);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195) 		if (IS_ERR(tmp))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196) 			return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197) 		tmp->next = node->next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198) 		cnid = cpu_to_be32(tmp->next);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) 		hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, next), 4);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200) 		hfs_bnode_put(tmp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201) 	} else if (node->type == HFS_NODE_LEAF)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202) 		tree->leaf_head = node->next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204) 	if (node->next) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205) 		tmp = hfs_bnode_find(tree, node->next);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206) 		if (IS_ERR(tmp))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207) 			return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208) 		tmp->prev = node->prev;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) 		cnid = cpu_to_be32(tmp->prev);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) 		hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211) 		hfs_bnode_put(tmp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212) 	} else if (node->type == HFS_NODE_LEAF)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213) 		tree->leaf_tail = node->prev;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215) 	// move down?
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) 	if (!node->prev && !node->next) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217) 		printk(KERN_DEBUG "hfs_btree_del_level\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219) 	if (!node->parent) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220) 		tree->root = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221) 		tree->depth = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223) 	set_bit(HFS_BNODE_DELETED, &node->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226) static inline int hfs_bnode_hash(u32 num)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) 	num = (num >> 16) + num;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229) 	num += num >> 8;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230) 	return num & (NODE_HASH_SIZE - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) 	struct hfs_bnode *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237) 	if (cnid >= tree->node_count) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) 		pr_err("request for non-existent node %d in B*Tree\n", cnid);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239) 		return NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242) 	for (node = tree->node_hash[hfs_bnode_hash(cnid)];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243) 	     node; node = node->next_hash) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244) 		if (node->this == cnid) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) 			return node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) 		}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 247) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 248) 	return NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 249) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251) static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) 	struct hfs_bnode *node, *node2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254) 	struct address_space *mapping;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255) 	struct page *page;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256) 	int size, block, i, hash;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 257) 	loff_t off;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 258) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 259) 	if (cnid >= tree->node_count) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 260) 		pr_err("request for non-existent node %d in B*Tree\n", cnid);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 261) 		return NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 262) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 263) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 264) 	size = sizeof(struct hfs_bnode) + tree->pages_per_bnode *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 265) 		sizeof(struct page *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 266) 	node = kzalloc(size, GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 267) 	if (!node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 268) 		return NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 269) 	node->tree = tree;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 270) 	node->this = cnid;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 271) 	set_bit(HFS_BNODE_NEW, &node->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 272) 	atomic_set(&node->refcnt, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 273) 	hfs_dbg(BNODE_REFS, "new_node(%d:%d): 1\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 274) 		node->tree->cnid, node->this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 275) 	init_waitqueue_head(&node->lock_wq);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 276) 	spin_lock(&tree->hash_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 277) 	node2 = hfs_bnode_findhash(tree, cnid);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 278) 	if (!node2) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 279) 		hash = hfs_bnode_hash(cnid);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 280) 		node->next_hash = tree->node_hash[hash];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 281) 		tree->node_hash[hash] = node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 282) 		tree->node_hash_cnt++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 283) 	} else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 284) 		spin_unlock(&tree->hash_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 285) 		kfree(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 286) 		wait_event(node2->lock_wq, !test_bit(HFS_BNODE_NEW, &node2->flags));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 287) 		return node2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 288) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 289) 	spin_unlock(&tree->hash_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 290) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 291) 	mapping = tree->inode->i_mapping;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 292) 	off = (loff_t)cnid * tree->node_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 293) 	block = off >> PAGE_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 294) 	node->page_offset = off & ~PAGE_MASK;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 295) 	for (i = 0; i < tree->pages_per_bnode; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 296) 		page = read_mapping_page(mapping, block++, NULL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 297) 		if (IS_ERR(page))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 298) 			goto fail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 299) 		if (PageError(page)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 300) 			put_page(page);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 301) 			goto fail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 302) 		}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 303) 		node->page[i] = page;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 304) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 305) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 306) 	return node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 307) fail:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 308) 	set_bit(HFS_BNODE_ERROR, &node->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 309) 	return node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 310) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 311) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 312) void hfs_bnode_unhash(struct hfs_bnode *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 313) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 314) 	struct hfs_bnode **p;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 315) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 316) 	hfs_dbg(BNODE_REFS, "remove_node(%d:%d): %d\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 317) 		node->tree->cnid, node->this, atomic_read(&node->refcnt));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 318) 	for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 319) 	     *p && *p != node; p = &(*p)->next_hash)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 320) 		;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 321) 	BUG_ON(!*p);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 322) 	*p = node->next_hash;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 323) 	node->tree->node_hash_cnt--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 324) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 325) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 326) /* Load a particular node out of a tree */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 327) struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 328) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 329) 	struct hfs_bnode *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 330) 	struct hfs_bnode_desc *desc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 331) 	int i, rec_off, off, next_off;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 332) 	int entry_size, key_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 333) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 334) 	spin_lock(&tree->hash_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 335) 	node = hfs_bnode_findhash(tree, num);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 336) 	if (node) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 337) 		hfs_bnode_get(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 338) 		spin_unlock(&tree->hash_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 339) 		wait_event(node->lock_wq, !test_bit(HFS_BNODE_NEW, &node->flags));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 340) 		if (test_bit(HFS_BNODE_ERROR, &node->flags))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 341) 			goto node_error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 342) 		return node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 343) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 344) 	spin_unlock(&tree->hash_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 345) 	node = __hfs_bnode_create(tree, num);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 346) 	if (!node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 347) 		return ERR_PTR(-ENOMEM);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 348) 	if (test_bit(HFS_BNODE_ERROR, &node->flags))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 349) 		goto node_error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 350) 	if (!test_bit(HFS_BNODE_NEW, &node->flags))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 351) 		return node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 352) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 353) 	desc = (struct hfs_bnode_desc *)(kmap(node->page[0]) + node->page_offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 354) 	node->prev = be32_to_cpu(desc->prev);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 355) 	node->next = be32_to_cpu(desc->next);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 356) 	node->num_recs = be16_to_cpu(desc->num_recs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 357) 	node->type = desc->type;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 358) 	node->height = desc->height;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 359) 	kunmap(node->page[0]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 360) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 361) 	switch (node->type) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 362) 	case HFS_NODE_HEADER:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 363) 	case HFS_NODE_MAP:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 364) 		if (node->height != 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 365) 			goto node_error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 366) 		break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 367) 	case HFS_NODE_LEAF:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 368) 		if (node->height != 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 369) 			goto node_error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 370) 		break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 371) 	case HFS_NODE_INDEX:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 372) 		if (node->height <= 1 || node->height > tree->depth)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 373) 			goto node_error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 374) 		break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 375) 	default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 376) 		goto node_error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 377) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 378) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 379) 	rec_off = tree->node_size - 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 380) 	off = hfs_bnode_read_u16(node, rec_off);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 381) 	if (off != sizeof(struct hfs_bnode_desc))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 382) 		goto node_error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 383) 	for (i = 1; i <= node->num_recs; off = next_off, i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 384) 		rec_off -= 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 385) 		next_off = hfs_bnode_read_u16(node, rec_off);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 386) 		if (next_off <= off ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 387) 		    next_off > tree->node_size ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 388) 		    next_off & 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 389) 			goto node_error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 390) 		entry_size = next_off - off;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 391) 		if (node->type != HFS_NODE_INDEX &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 392) 		    node->type != HFS_NODE_LEAF)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 393) 			continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 394) 		key_size = hfs_bnode_read_u8(node, off) + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 395) 		if (key_size >= entry_size /*|| key_size & 1*/)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 396) 			goto node_error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 397) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 398) 	clear_bit(HFS_BNODE_NEW, &node->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 399) 	wake_up(&node->lock_wq);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 400) 	return node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 401) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 402) node_error:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 403) 	set_bit(HFS_BNODE_ERROR, &node->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 404) 	clear_bit(HFS_BNODE_NEW, &node->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 405) 	wake_up(&node->lock_wq);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 406) 	hfs_bnode_put(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 407) 	return ERR_PTR(-EIO);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 408) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 409) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 410) void hfs_bnode_free(struct hfs_bnode *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 411) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 412) 	int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 413) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 414) 	for (i = 0; i < node->tree->pages_per_bnode; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 415) 		if (node->page[i])
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 416) 			put_page(node->page[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 417) 	kfree(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 418) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 419) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 420) struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 421) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 422) 	struct hfs_bnode *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 423) 	struct page **pagep;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 424) 	int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 425) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 426) 	spin_lock(&tree->hash_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 427) 	node = hfs_bnode_findhash(tree, num);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 428) 	spin_unlock(&tree->hash_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 429) 	if (node) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 430) 		pr_crit("new node %u already hashed?\n", num);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 431) 		WARN_ON(1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 432) 		return node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 433) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 434) 	node = __hfs_bnode_create(tree, num);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 435) 	if (!node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 436) 		return ERR_PTR(-ENOMEM);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 437) 	if (test_bit(HFS_BNODE_ERROR, &node->flags)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 438) 		hfs_bnode_put(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 439) 		return ERR_PTR(-EIO);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 440) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 441) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 442) 	pagep = node->page;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 443) 	memset(kmap(*pagep) + node->page_offset, 0,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 444) 	       min((int)PAGE_SIZE, (int)tree->node_size));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 445) 	set_page_dirty(*pagep);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 446) 	kunmap(*pagep);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 447) 	for (i = 1; i < tree->pages_per_bnode; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 448) 		memset(kmap(*++pagep), 0, PAGE_SIZE);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 449) 		set_page_dirty(*pagep);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 450) 		kunmap(*pagep);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 451) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 452) 	clear_bit(HFS_BNODE_NEW, &node->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 453) 	wake_up(&node->lock_wq);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 454) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 455) 	return node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 456) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 457) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 458) void hfs_bnode_get(struct hfs_bnode *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 459) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 460) 	if (node) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 461) 		atomic_inc(&node->refcnt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 462) 		hfs_dbg(BNODE_REFS, "get_node(%d:%d): %d\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 463) 			node->tree->cnid, node->this,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 464) 			atomic_read(&node->refcnt));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 465) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 466) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 467) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 468) /* Dispose of resources used by a node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 469) void hfs_bnode_put(struct hfs_bnode *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 470) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 471) 	if (node) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 472) 		struct hfs_btree *tree = node->tree;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 473) 		int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 474) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 475) 		hfs_dbg(BNODE_REFS, "put_node(%d:%d): %d\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 476) 			node->tree->cnid, node->this,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 477) 			atomic_read(&node->refcnt));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 478) 		BUG_ON(!atomic_read(&node->refcnt));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 479) 		if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 480) 			return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 481) 		for (i = 0; i < tree->pages_per_bnode; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 482) 			if (!node->page[i])
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 483) 				continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 484) 			mark_page_accessed(node->page[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 485) 		}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 486) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 487) 		if (test_bit(HFS_BNODE_DELETED, &node->flags)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 488) 			hfs_bnode_unhash(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 489) 			spin_unlock(&tree->hash_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 490) 			hfs_bmap_free(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 491) 			hfs_bnode_free(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 492) 			return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 493) 		}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 494) 		spin_unlock(&tree->hash_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 495) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 496) }