Lines Matching refs:this_node
93 struct befs_btree_node *this_node,
248 struct befs_btree_node *this_node; in befs_btree_find() local
261 this_node = kmalloc(sizeof(struct befs_btree_node), in befs_btree_find()
263 if (!this_node) { in befs_btree_find()
269 this_node->bh = NULL; in befs_btree_find()
273 if (befs_bt_read_node(sb, ds, this_node, node_off) != BEFS_OK) { in befs_btree_find()
279 while (!befs_leafnode(this_node)) { in befs_btree_find()
280 res = befs_find_key(sb, this_node, key, &node_off); in befs_btree_find()
283 node_off = this_node->head.overflow; in befs_btree_find()
284 if (befs_bt_read_node(sb, ds, this_node, node_off) != BEFS_OK) { in befs_btree_find()
292 res = befs_find_key(sb, this_node, key, value); in befs_btree_find()
294 brelse(this_node->bh); in befs_btree_find()
295 kfree(this_node); in befs_btree_find()
308 kfree(this_node); in befs_btree_find()
415 struct befs_btree_node *this_node; in befs_btree_read() local
434 this_node = kmalloc(sizeof(struct befs_btree_node), GFP_NOFS); in befs_btree_read()
435 if (this_node == NULL) { in befs_btree_read()
442 this_node->bh = NULL; in befs_btree_read()
445 res = befs_btree_seekleaf(sb, ds, &bt_super, this_node, &node_off); in befs_btree_read()
447 brelse(this_node->bh); in befs_btree_read()
448 kfree(this_node); in befs_btree_read()
459 while (key_sum + this_node->head.all_key_count <= key_no) { in befs_btree_read()
462 if (this_node->head.right == BEFS_BT_INVAL) { in befs_btree_read()
468 key_sum + this_node->head.all_key_count); in befs_btree_read()
469 brelse(this_node->bh); in befs_btree_read()
470 kfree(this_node); in befs_btree_read()
474 key_sum += this_node->head.all_key_count; in befs_btree_read()
475 node_off = this_node->head.right; in befs_btree_read()
477 if (befs_bt_read_node(sb, ds, this_node, node_off) != BEFS_OK) { in befs_btree_read()
488 valarray = befs_bt_valarray(this_node); in befs_btree_read()
490 keystart = befs_bt_get_key(sb, this_node, cur_key, &keylen); in befs_btree_read()
499 brelse(this_node->bh); in befs_btree_read()
510 brelse(this_node->bh); in befs_btree_read()
511 kfree(this_node); in befs_btree_read()
518 kfree(this_node); in befs_btree_read()
544 struct befs_btree_node *this_node, in befs_btree_seekleaf() argument
550 if (befs_bt_read_node(sb, ds, this_node, *node_off) != BEFS_OK) { in befs_btree_seekleaf()
557 if (this_node->head.all_key_count == 0 && befs_leafnode(this_node)) { in befs_btree_seekleaf()
562 while (!befs_leafnode(this_node)) { in befs_btree_seekleaf()
564 if (this_node->head.all_key_count == 0) { in befs_btree_seekleaf()
568 this_node->head.overflow); in befs_btree_seekleaf()
569 *node_off = this_node->head.overflow; in befs_btree_seekleaf()
571 fs64 *valarray = befs_bt_valarray(this_node); in befs_btree_seekleaf()
574 if (befs_bt_read_node(sb, ds, this_node, *node_off) != BEFS_OK) { in befs_btree_seekleaf()