Lines Matching refs:bh
75 struct buffer_head *bh; in nilfs_btree_get_new_block() local
77 bh = nilfs_btnode_create_block(btnc, ptr); in nilfs_btree_get_new_block()
78 if (!bh) in nilfs_btree_get_new_block()
81 set_buffer_nilfs_volatile(bh); in nilfs_btree_get_new_block()
82 *bhp = bh; in nilfs_btree_get_new_block()
401 int nilfs_btree_broken_node_block(struct buffer_head *bh) in nilfs_btree_broken_node_block() argument
405 if (buffer_nilfs_checked(bh)) in nilfs_btree_broken_node_block()
408 ret = nilfs_btree_node_broken((struct nilfs_btree_node *)bh->b_data, in nilfs_btree_broken_node_block()
409 bh->b_size, bh->b_blocknr); in nilfs_btree_broken_node_block()
411 set_buffer_nilfs_checked(bh); in nilfs_btree_broken_node_block()
479 struct buffer_head *bh, *ra_bh; in __nilfs_btree_get_block() local
483 ret = nilfs_btnode_submit_block(btnc, ptr, 0, READ, &bh, &submit_ptr); in __nilfs_btree_get_block()
505 if (!buffer_locked(bh)) in __nilfs_btree_get_block()
510 wait_on_buffer(bh); in __nilfs_btree_get_block()
513 if (!buffer_uptodate(bh)) { in __nilfs_btree_get_block()
514 brelse(bh); in __nilfs_btree_get_block()
519 if (nilfs_btree_broken_node_block(bh)) { in __nilfs_btree_get_block()
520 clear_buffer_uptodate(bh); in __nilfs_btree_get_block()
521 brelse(bh); in __nilfs_btree_get_block()
525 *bhp = bh; in __nilfs_btree_get_block()
1055 struct buffer_head *bh; in nilfs_btree_prepare_insert() local
1094 ret = nilfs_btree_get_block(btree, sibptr, &bh); in nilfs_btree_prepare_insert()
1097 sib = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_prepare_insert()
1099 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1104 brelse(bh); in nilfs_btree_prepare_insert()
1112 ret = nilfs_btree_get_block(btree, sibptr, &bh); in nilfs_btree_prepare_insert()
1115 sib = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_prepare_insert()
1117 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1122 brelse(bh); in nilfs_btree_prepare_insert()
1135 &bh); in nilfs_btree_prepare_insert()
1141 sib = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_prepare_insert()
1143 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1162 &bh); in nilfs_btree_prepare_insert()
1166 nilfs_btree_node_init((struct nilfs_btree_node *)bh->b_data, in nilfs_btree_prepare_insert()
1168 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1429 struct buffer_head *bh; in nilfs_btree_prepare_delete() local
1464 ret = nilfs_btree_get_block(btree, sibptr, &bh); in nilfs_btree_prepare_delete()
1467 sib = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_prepare_delete()
1469 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1474 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1484 ret = nilfs_btree_get_block(btree, sibptr, &bh); in nilfs_btree_prepare_delete()
1487 sib = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_prepare_delete()
1489 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1494 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1643 struct buffer_head *bh; in nilfs_btree_check_delete() local
1652 bh = NULL; in nilfs_btree_check_delete()
1661 ret = nilfs_btree_get_block(btree, ptr, &bh); in nilfs_btree_check_delete()
1664 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_check_delete()
1674 if (bh != NULL) in nilfs_btree_check_delete()
1675 brelse(bh); in nilfs_btree_check_delete()
1683 struct buffer_head *bh; in nilfs_btree_gather_data() local
1693 bh = NULL; in nilfs_btree_gather_data()
1702 ret = nilfs_btree_get_block(btree, ptr, &bh); in nilfs_btree_gather_data()
1705 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_gather_data()
1723 if (bh != NULL) in nilfs_btree_gather_data()
1724 brelse(bh); in nilfs_btree_gather_data()
1736 struct buffer_head *bh; in nilfs_btree_prepare_convert_and_insert() local
1761 ret = nilfs_btree_get_new_block(btree, nreq->bpr_ptr, &bh); in nilfs_btree_prepare_convert_and_insert()
1765 *bhp = bh; in nilfs_btree_prepare_convert_and_insert()
1789 struct buffer_head *bh) in nilfs_btree_commit_convert_and_insert() argument
1811 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_commit_convert_and_insert()
1815 if (!buffer_dirty(bh)) in nilfs_btree_commit_convert_and_insert()
1816 mark_buffer_dirty(bh); in nilfs_btree_commit_convert_and_insert()
1820 brelse(bh); in nilfs_btree_commit_convert_and_insert()
1859 struct buffer_head *bh; in nilfs_btree_convert_and_insert() local
1877 ret = nilfs_btree_prepare_convert_and_insert(btree, key, di, ni, &bh, in nilfs_btree_convert_and_insert()
1882 di, ni, bh); in nilfs_btree_convert_and_insert()
1890 struct buffer_head *bh) in nilfs_btree_propagate_p() argument
1919 path[level].bp_ctxt.bh = path[level].bp_bh; in nilfs_btree_prepare_update_v()
1949 path[level].bp_bh = path[level].bp_ctxt.bh; in nilfs_btree_commit_update_v()
2008 struct buffer_head *bh, in nilfs_btree_commit_propagate_v() argument
2022 int level, struct buffer_head *bh) in nilfs_btree_propagate_v() argument
2030 get_bh(bh); in nilfs_btree_propagate_v()
2031 path[level].bp_bh = bh; in nilfs_btree_propagate_v()
2047 nilfs_btree_commit_propagate_v(btree, path, level, maxlevel, bh, dat); in nilfs_btree_propagate_v()
2056 struct buffer_head *bh) in nilfs_btree_propagate() argument
2063 WARN_ON(!buffer_dirty(bh)); in nilfs_btree_propagate()
2069 if (buffer_nilfs_node(bh)) { in nilfs_btree_propagate()
2070 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_propagate()
2074 key = nilfs_bmap_data_get_key(btree, bh); in nilfs_btree_propagate()
2087 nilfs_btree_propagate_v(btree, path, level, bh) : in nilfs_btree_propagate()
2088 nilfs_btree_propagate_p(btree, path, level, bh); in nilfs_btree_propagate()
2097 struct buffer_head *bh) in nilfs_btree_propagate_gc() argument
2099 return nilfs_dat_mark_dirty(nilfs_bmap_get_dat(btree), bh->b_blocknr); in nilfs_btree_propagate_gc()
2104 struct buffer_head *bh) in nilfs_btree_add_dirty_buffer() argument
2112 get_bh(bh); in nilfs_btree_add_dirty_buffer()
2113 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_add_dirty_buffer()
2124 (unsigned long long)bh->b_blocknr); in nilfs_btree_add_dirty_buffer()
2135 list_add_tail(&bh->b_assoc_buffers, head); in nilfs_btree_add_dirty_buffer()
2144 struct buffer_head *bh, *head; in nilfs_btree_lookup_dirty_buffers() local
2158 bh = head = page_buffers(pvec.pages[i]); in nilfs_btree_lookup_dirty_buffers()
2160 if (buffer_dirty(bh)) in nilfs_btree_lookup_dirty_buffers()
2162 lists, bh); in nilfs_btree_lookup_dirty_buffers()
2163 } while ((bh = bh->b_this_page) != head); in nilfs_btree_lookup_dirty_buffers()
2178 struct buffer_head **bh, in nilfs_btree_assign_p() argument
2190 if (buffer_nilfs_node(*bh)) { in nilfs_btree_assign_p()
2193 path[level].bp_ctxt.bh = *bh; in nilfs_btree_assign_p()
2202 *bh = path[level].bp_ctxt.bh; in nilfs_btree_assign_p()
2219 struct buffer_head **bh, in nilfs_btree_assign_v() argument
2248 struct buffer_head **bh, in nilfs_btree_assign() argument
2261 if (buffer_nilfs_node(*bh)) { in nilfs_btree_assign()
2262 node = (struct nilfs_btree_node *)(*bh)->b_data; in nilfs_btree_assign()
2266 key = nilfs_bmap_data_get_key(btree, *bh); in nilfs_btree_assign()
2277 nilfs_btree_assign_v(btree, path, level, bh, blocknr, binfo) : in nilfs_btree_assign()
2278 nilfs_btree_assign_p(btree, path, level, bh, blocknr, binfo); in nilfs_btree_assign()
2287 struct buffer_head **bh, in nilfs_btree_assign_gc() argument
2295 ret = nilfs_dat_move(nilfs_bmap_get_dat(btree), (*bh)->b_blocknr, in nilfs_btree_assign_gc()
2300 if (buffer_nilfs_node(*bh)) { in nilfs_btree_assign_gc()
2301 node = (struct nilfs_btree_node *)(*bh)->b_data; in nilfs_btree_assign_gc()
2304 key = nilfs_bmap_data_get_key(btree, *bh); in nilfs_btree_assign_gc()
2307 binfo->bi_v.bi_vblocknr = cpu_to_le64((*bh)->b_blocknr); in nilfs_btree_assign_gc()
2315 struct buffer_head *bh; in nilfs_btree_mark() local
2329 ret = nilfs_btree_get_block(btree, ptr, &bh); in nilfs_btree_mark()
2335 if (!buffer_dirty(bh)) in nilfs_btree_mark()
2336 mark_buffer_dirty(bh); in nilfs_btree_mark()
2337 brelse(bh); in nilfs_btree_mark()