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()
1050 struct buffer_head *bh; in nilfs_btree_prepare_insert() local
1089 ret = nilfs_btree_get_block(btree, sibptr, &bh); in nilfs_btree_prepare_insert()
1092 sib = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_prepare_insert()
1094 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1099 brelse(bh); in nilfs_btree_prepare_insert()
1107 ret = nilfs_btree_get_block(btree, sibptr, &bh); in nilfs_btree_prepare_insert()
1110 sib = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_prepare_insert()
1112 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1117 brelse(bh); in nilfs_btree_prepare_insert()
1130 &bh); in nilfs_btree_prepare_insert()
1136 sib = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_prepare_insert()
1138 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1157 &bh); in nilfs_btree_prepare_insert()
1161 nilfs_btree_node_init((struct nilfs_btree_node *)bh->b_data, in nilfs_btree_prepare_insert()
1163 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_insert()
1424 struct buffer_head *bh; in nilfs_btree_prepare_delete() local
1459 ret = nilfs_btree_get_block(btree, sibptr, &bh); in nilfs_btree_prepare_delete()
1462 sib = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_prepare_delete()
1464 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1469 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1479 ret = nilfs_btree_get_block(btree, sibptr, &bh); in nilfs_btree_prepare_delete()
1482 sib = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_prepare_delete()
1484 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1489 path[level].bp_sib_bh = bh; in nilfs_btree_prepare_delete()
1638 struct buffer_head *bh; in nilfs_btree_check_delete() local
1647 bh = NULL; in nilfs_btree_check_delete()
1656 ret = nilfs_btree_get_block(btree, ptr, &bh); in nilfs_btree_check_delete()
1659 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_check_delete()
1669 if (bh != NULL) in nilfs_btree_check_delete()
1670 brelse(bh); in nilfs_btree_check_delete()
1678 struct buffer_head *bh; in nilfs_btree_gather_data() local
1688 bh = NULL; in nilfs_btree_gather_data()
1697 ret = nilfs_btree_get_block(btree, ptr, &bh); in nilfs_btree_gather_data()
1700 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_gather_data()
1718 if (bh != NULL) in nilfs_btree_gather_data()
1719 brelse(bh); in nilfs_btree_gather_data()
1731 struct buffer_head *bh; in nilfs_btree_prepare_convert_and_insert() local
1756 ret = nilfs_btree_get_new_block(btree, nreq->bpr_ptr, &bh); in nilfs_btree_prepare_convert_and_insert()
1760 *bhp = bh; in nilfs_btree_prepare_convert_and_insert()
1784 struct buffer_head *bh) in nilfs_btree_commit_convert_and_insert() argument
1806 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_commit_convert_and_insert()
1810 if (!buffer_dirty(bh)) in nilfs_btree_commit_convert_and_insert()
1811 mark_buffer_dirty(bh); in nilfs_btree_commit_convert_and_insert()
1815 brelse(bh); in nilfs_btree_commit_convert_and_insert()
1854 struct buffer_head *bh = NULL; in nilfs_btree_convert_and_insert() local
1872 ret = nilfs_btree_prepare_convert_and_insert(btree, key, di, ni, &bh, in nilfs_btree_convert_and_insert()
1877 di, ni, bh); in nilfs_btree_convert_and_insert()
1885 struct buffer_head *bh) in nilfs_btree_propagate_p() argument
1914 path[level].bp_ctxt.bh = path[level].bp_bh; in nilfs_btree_prepare_update_v()
1944 path[level].bp_bh = path[level].bp_ctxt.bh; in nilfs_btree_commit_update_v()
2003 struct buffer_head *bh, in nilfs_btree_commit_propagate_v() argument
2017 int level, struct buffer_head *bh) in nilfs_btree_propagate_v() argument
2025 get_bh(bh); in nilfs_btree_propagate_v()
2026 path[level].bp_bh = bh; in nilfs_btree_propagate_v()
2042 nilfs_btree_commit_propagate_v(btree, path, level, maxlevel, bh, dat); in nilfs_btree_propagate_v()
2051 struct buffer_head *bh) in nilfs_btree_propagate() argument
2058 WARN_ON(!buffer_dirty(bh)); in nilfs_btree_propagate()
2064 if (buffer_nilfs_node(bh)) { in nilfs_btree_propagate()
2065 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_propagate()
2069 key = nilfs_bmap_data_get_key(btree, bh); in nilfs_btree_propagate()
2082 nilfs_btree_propagate_v(btree, path, level, bh) : in nilfs_btree_propagate()
2083 nilfs_btree_propagate_p(btree, path, level, bh); in nilfs_btree_propagate()
2092 struct buffer_head *bh) in nilfs_btree_propagate_gc() argument
2094 return nilfs_dat_mark_dirty(nilfs_bmap_get_dat(btree), bh->b_blocknr); in nilfs_btree_propagate_gc()
2099 struct buffer_head *bh) in nilfs_btree_add_dirty_buffer() argument
2107 get_bh(bh); in nilfs_btree_add_dirty_buffer()
2108 node = (struct nilfs_btree_node *)bh->b_data; in nilfs_btree_add_dirty_buffer()
2119 (unsigned long long)bh->b_blocknr); in nilfs_btree_add_dirty_buffer()
2130 list_add_tail(&bh->b_assoc_buffers, head); in nilfs_btree_add_dirty_buffer()
2139 struct buffer_head *bh, *head; in nilfs_btree_lookup_dirty_buffers() local
2153 bh = head = page_buffers(pvec.pages[i]); in nilfs_btree_lookup_dirty_buffers()
2155 if (buffer_dirty(bh)) in nilfs_btree_lookup_dirty_buffers()
2157 lists, bh); in nilfs_btree_lookup_dirty_buffers()
2158 } while ((bh = bh->b_this_page) != head); in nilfs_btree_lookup_dirty_buffers()
2173 struct buffer_head **bh, in nilfs_btree_assign_p() argument
2185 if (buffer_nilfs_node(*bh)) { in nilfs_btree_assign_p()
2188 path[level].bp_ctxt.bh = *bh; in nilfs_btree_assign_p()
2197 *bh = path[level].bp_ctxt.bh; in nilfs_btree_assign_p()
2214 struct buffer_head **bh, in nilfs_btree_assign_v() argument
2243 struct buffer_head **bh, in nilfs_btree_assign() argument
2256 if (buffer_nilfs_node(*bh)) { in nilfs_btree_assign()
2257 node = (struct nilfs_btree_node *)(*bh)->b_data; in nilfs_btree_assign()
2261 key = nilfs_bmap_data_get_key(btree, *bh); in nilfs_btree_assign()
2272 nilfs_btree_assign_v(btree, path, level, bh, blocknr, binfo) : in nilfs_btree_assign()
2273 nilfs_btree_assign_p(btree, path, level, bh, blocknr, binfo); in nilfs_btree_assign()
2282 struct buffer_head **bh, in nilfs_btree_assign_gc() argument
2290 ret = nilfs_dat_move(nilfs_bmap_get_dat(btree), (*bh)->b_blocknr, in nilfs_btree_assign_gc()
2295 if (buffer_nilfs_node(*bh)) { in nilfs_btree_assign_gc()
2296 node = (struct nilfs_btree_node *)(*bh)->b_data; in nilfs_btree_assign_gc()
2299 key = nilfs_bmap_data_get_key(btree, *bh); in nilfs_btree_assign_gc()
2302 binfo->bi_v.bi_vblocknr = cpu_to_le64((*bh)->b_blocknr); in nilfs_btree_assign_gc()
2310 struct buffer_head *bh; in nilfs_btree_mark() local
2324 ret = nilfs_btree_get_block(btree, ptr, &bh); in nilfs_btree_mark()
2330 if (!buffer_dirty(bh)) in nilfs_btree_mark()
2331 mark_buffer_dirty(bh); in nilfs_btree_mark()
2332 brelse(bh); in nilfs_btree_mark()