Lines Matching refs:node
8 * Handle basic btree node operations
17 void hfs_bnode_read(struct hfs_bnode *node, void *buf,
22 off += node->page_offset;
23 page = node->page[0];
29 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off)
33 hfs_bnode_read(node, &data, off, 2);
37 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off)
41 hfs_bnode_read(node, &data, off, 1);
45 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off)
50 tree = node->tree;
51 if (node->type == HFS_NODE_LEAF ||
53 key_len = hfs_bnode_read_u8(node, off) + 1;
57 hfs_bnode_read(node, key, off, key_len);
60 void hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len)
64 off += node->page_offset;
65 page = node->page[0];
72 void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data)
76 hfs_bnode_write(node, &v, off, 2);
79 void hfs_bnode_write_u8(struct hfs_bnode *node, int off, u8 data)
82 hfs_bnode_write(node, &data, off, 1);
85 void hfs_bnode_clear(struct hfs_bnode *node, int off, int len)
89 off += node->page_offset;
90 page = node->page[0];
118 void hfs_bnode_move(struct hfs_bnode *node, int dst, int src, int len)
126 src += node->page_offset;
127 dst += node->page_offset;
128 page = node->page[0];
135 void hfs_bnode_dump(struct hfs_bnode *node)
141 dprint(DBG_BNODE_MOD, "bnode: %d\n", node->this);
142 hfs_bnode_read(node, &desc, 0, sizeof(desc));
147 off = node->tree->node_size - 2;
149 key_off = hfs_bnode_read_u16(node, off);
151 if (i && node->type == HFS_NODE_INDEX) {
154 if (node->tree->attributes & HFS_TREE_VARIDXKEYS)
155 tmp = (hfs_bnode_read_u8(node, key_off) | 1) + 1;
157 tmp = node->tree->max_key_len + 1;
158 dprint(DBG_BNODE_MOD, " (%d,%d", tmp, hfs_bnode_read_u8(node, key_off));
159 hfs_bnode_read(node, &cnid, key_off + tmp, 4);
161 } else if (i && node->type == HFS_NODE_LEAF) {
164 tmp = hfs_bnode_read_u8(node, key_off);
171 void hfs_bnode_unlink(struct hfs_bnode *node)
177 tree = node->tree;
178 if (node->prev) {
179 tmp = hfs_bnode_find(tree, node->prev);
182 tmp->next = node->next;
186 } else if (node->type == HFS_NODE_LEAF)
187 tree->leaf_head = node->next;
189 if (node->next) {
190 tmp = hfs_bnode_find(tree, node->next);
193 tmp->prev = node->prev;
197 } else if (node->type == HFS_NODE_LEAF)
198 tree->leaf_tail = node->prev;
201 if (!node->prev && !node->next) {
204 if (!node->parent) {
208 set_bit(HFS_BNODE_DELETED, &node->flags);
220 struct hfs_bnode *node;
223 printk(KERN_ERR "hfs: request for non-existent node %d in B*Tree\n", cnid);
227 for (node = tree->node_hash[hfs_bnode_hash(cnid)];
228 node; node = node->next_hash) {
229 if (node->this == cnid) {
230 return node;
239 struct hfs_bnode *node, *node2;
246 printk(KERN_ERR "hfs: request for non-existent node %d in B*Tree\n", cnid);
253 node = kzalloc(size, GFP_KERNEL);
254 if (!node)
256 node->tree = tree;
257 node->this = cnid;
258 set_bit(HFS_BNODE_NEW, &node->flags);
259 atomic_set(&node->refcnt, 1);
261 node->tree->cnid, node->this);
262 init_waitqueue_head(&node->lock_wq);
267 node->next_hash = tree->node_hash[hash];
268 tree->node_hash[hash] = node;
272 kfree(node);
281 node->page_offset = off & ~PAGE_CACHE_MASK;
291 node->page[i] = page;
294 return node;
296 set_bit(HFS_BNODE_ERROR, &node->flags);
297 return node;
300 void hfs_bnode_unhash(struct hfs_bnode *node)
305 node->tree->cnid, node->this, atomic_read(&node->refcnt));
306 for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)];
307 *p && *p != node; p = &(*p)->next_hash)
310 *p = node->next_hash;
311 node->tree->node_hash_cnt--;
314 /* Load a particular node out of a tree */
317 struct hfs_bnode *node;
323 node = hfs_bnode_findhash(tree, num);
324 if (node) {
325 hfs_bnode_get(node);
327 wait_event(node->lock_wq, !test_bit(HFS_BNODE_NEW, &node->flags));
328 if (test_bit(HFS_BNODE_ERROR, &node->flags))
330 return node;
333 node = __hfs_bnode_create(tree, num);
334 if (!node)
336 if (test_bit(HFS_BNODE_ERROR, &node->flags))
338 if (!test_bit(HFS_BNODE_NEW, &node->flags))
339 return node;
341 desc = (struct hfs_bnode_desc *)(kmap(node->page[0]) + node->page_offset);
342 node->prev = be32_to_cpu(desc->prev);
343 node->next = be32_to_cpu(desc->next);
344 node->num_recs = be16_to_cpu(desc->num_recs);
345 node->type = desc->type;
346 node->height = desc->height;
347 kunmap(node->page[0]);
349 switch (node->type) {
352 if (node->height != 0)
356 if (node->height != 1)
360 if (node->height <= 1 || node->height > tree->depth)
368 off = hfs_bnode_read_u16(node, rec_off);
371 for (i = 1; i <= node->num_recs; off = next_off, i++) {
373 next_off = hfs_bnode_read_u16(node, rec_off);
379 if (node->type != HFS_NODE_INDEX &&
380 node->type != HFS_NODE_LEAF)
382 key_size = hfs_bnode_read_u8(node, off) + 1;
386 clear_bit(HFS_BNODE_NEW, &node->flags);
387 wake_up(&node->lock_wq);
388 return node;
391 set_bit(HFS_BNODE_ERROR, &node->flags);
392 clear_bit(HFS_BNODE_NEW, &node->flags);
393 wake_up(&node->lock_wq);
394 hfs_bnode_put(node);
398 void hfs_bnode_free(struct hfs_bnode *node)
402 //for (i = 0; i < node->tree->pages_per_bnode; i++)
403 // if (node->page[i])
404 // page_cache_release(node->page[i]);
405 kfree(node);
410 struct hfs_bnode *node;
415 node = hfs_bnode_findhash(tree, num);
417 BUG_ON(node);
418 node = __hfs_bnode_create(tree, num);
419 if (!node)
421 if (test_bit(HFS_BNODE_ERROR, &node->flags)) {
422 hfs_bnode_put(node);
426 pagep = node->page;
427 memset(kmap(*pagep) + node->page_offset, 0,
436 clear_bit(HFS_BNODE_NEW, &node->flags);
437 wake_up(&node->lock_wq);
439 return node;
442 void hfs_bnode_get(struct hfs_bnode *node)
444 if (node) {
445 atomic_inc(&node->refcnt);
447 node->tree->cnid, node->this, atomic_read(&node->refcnt));
451 /* Dispose of resources used by a node */
452 void hfs_bnode_put(struct hfs_bnode *node)
454 if (node) {
455 struct hfs_btree *tree = node->tree;
459 node->tree->cnid, node->this, atomic_read(&node->refcnt));
460 BUG_ON(!atomic_read(&node->refcnt));
461 if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock))
464 if (!node->page[i])
466 mark_page_accessed(node->page[i]);
469 if (test_bit(HFS_BNODE_DELETED, &node->flags)) {
470 hfs_bnode_unhash(node);
472 hfs_bmap_free(node);
473 hfs_bnode_free(node);