Lines Matching +full:locality +full:- +full:specific
4 /* Reiserfs block (de)allocator, bitmap-based. */
20 #define SB_ALLOC_OPTS(s) (REISERFS_SB(s)->s_alloc_options.bits)
57 *bmap_nr = block >> (s->s_blocksize_bits + 3); in get_bit_address()
59 *offset = block & ((s->s_blocksize << 3) - 1); in get_bit_address()
68 reiserfs_error(s, "vs-4010", in is_reusable()
81 &REISERFS_SB(s)->s_properties))) { in is_reusable()
82 b_blocknr_t bmap1 = REISERFS_SB(s)->s_sbh->b_blocknr + 1; in is_reusable()
85 reiserfs_error(s, "vs-4019", "bitmap block %lu(%u) " in is_reusable()
92 reiserfs_error(s, "vs-4020", "bitmap block %lu(%u) " in is_reusable()
100 reiserfs_error(s, "vs-4030", "bitmap for requested block " in is_reusable()
107 reiserfs_error(s, "vs-4050", "this is root block (%u), " in is_reusable()
147 struct super_block *s = th->t_super; in scan_bitmap_block()
153 BUG_ON(!th->t_trans_id); in scan_bitmap_block()
155 "range (0..%u)", bmap_n, reiserfs_bmap_count(s) - 1); in scan_bitmap_block()
159 reiserfs_error(s, "jdm-4055", "NULL bitmap info pointer " in scan_bitmap_block()
170 if (bi->free_count < min) { in scan_bitmap_block()
175 /* search for a first zero bit -- beginning of a window */ in scan_bitmap_block()
177 ((unsigned long *)(bh->b_data), boundary, *beg); in scan_bitmap_block()
193 || reiserfs_test_le_bit(end, bh->b_data)) { in scan_bitmap_block()
213 if (end - *beg >= min) { in scan_bitmap_block()
223 (i, bh->b_data)) { in scan_bitmap_block()
244 while (--i >= *beg) in scan_bitmap_block()
246 (i, bh->b_data); in scan_bitmap_block()
257 bi->free_count -= (end - *beg); in scan_bitmap_block()
264 PUT_SB_FREE_BLOCKS(s, SB_FREE_BLOCKS(s) - (end - *beg)); in scan_bitmap_block()
267 return end - (*beg); in scan_bitmap_block()
307 * to make a better decision. This favors long-term performance gain in block_group_used()
308 * with a better on-disk layout vs. a short term gain of skipping the in block_group_used()
311 if (info->free_count == UINT_MAX) { in block_group_used()
316 if (info->free_count > ((s->s_blocksize << 3) * 60 / 100)) { in block_group_used()
328 if (TEST_OPTION(packing_groups, dir->i_sb)) { in reiserfs_choose_packing()
329 u32 parent_dir = le32_to_cpu(INODE_PKEY(dir)->k_dir_id); in reiserfs_choose_packing()
331 * some versions of reiserfsck expect packing locality 1 to be in reiserfs_choose_packing()
334 if (parent_dir == 1 || block_group_used(dir->i_sb, parent_dir)) in reiserfs_choose_packing()
335 packing = INODE_PKEY(dir)->k_objectid; in reiserfs_choose_packing()
337 packing = INODE_PKEY(dir)->k_dir_id; in reiserfs_choose_packing()
339 packing = INODE_PKEY(dir)->k_objectid; in reiserfs_choose_packing()
352 struct super_block *s = th->t_super; in scan_bitmap()
355 unsigned int off_max = s->s_blocksize << 3; in scan_bitmap()
357 BUG_ON(!th->t_trans_id); in scan_bitmap()
378 * their original allocation. This improves locality, and presumably in scan_bitmap()
389 (s->s_blocksize << 3) / 10) in scan_bitmap()
420 struct super_block *s = th->t_super; in _reiserfs_free_block()
426 BUG_ON(!th->t_trans_id); in _reiserfs_free_block()
435 reiserfs_error(s, "vs-4075", "block %lu is out of range", in _reiserfs_free_block()
447 if (!reiserfs_test_and_clear_le_bit(offset, bmbh->b_data)) { in _reiserfs_free_block()
448 reiserfs_error(s, "vs-4080", in _reiserfs_free_block()
471 struct super_block *s = th->t_super; in reiserfs_free_block()
473 BUG_ON(!th->t_trans_id); in reiserfs_free_block()
474 RFALSE(!s, "vs-4061: trying to free block on nonexistent device"); in reiserfs_free_block()
478 if (block > sb_block_count(REISERFS_SB(s)->s_rs)) { in reiserfs_free_block()
479 reiserfs_error(th->t_super, "bitmap-4072", in reiserfs_free_block()
482 block, sb_block_count(REISERFS_SB(s)->s_rs)); in reiserfs_free_block()
494 BUG_ON(!th->t_trans_id); in reiserfs_free_prealloc_block()
495 RFALSE(!th->t_super, in reiserfs_free_prealloc_block()
496 "vs-4060: trying to free block on nonexistent device"); in reiserfs_free_prealloc_block()
497 if (!is_reusable(th->t_super, block, 1)) in reiserfs_free_prealloc_block()
505 unsigned long save = ei->i_prealloc_block; in __discard_prealloc()
507 struct inode *inode = &ei->vfs_inode; in __discard_prealloc()
509 BUG_ON(!th->t_trans_id); in __discard_prealloc()
511 if (ei->i_prealloc_count < 0) in __discard_prealloc()
512 reiserfs_error(th->t_super, "zam-4001", in __discard_prealloc()
515 while (ei->i_prealloc_count > 0) { in __discard_prealloc()
524 block_to_free = ei->i_prealloc_block++; in __discard_prealloc()
525 ei->i_prealloc_count--; in __discard_prealloc()
531 ei->i_prealloc_block = save; in __discard_prealloc()
532 list_del_init(&ei->i_prealloc_list); in __discard_prealloc()
541 BUG_ON(!th->t_trans_id); in reiserfs_discard_prealloc()
542 if (ei->i_prealloc_count) in reiserfs_discard_prealloc()
548 struct list_head *plist = &SB_JOURNAL(th->t_super)->j_prealloc_list; in reiserfs_discard_all_prealloc()
550 BUG_ON(!th->t_trans_id); in reiserfs_discard_all_prealloc()
553 ei = list_entry(plist->next, struct reiserfs_inode_info, in reiserfs_discard_all_prealloc()
556 if (!ei->i_prealloc_count) { in reiserfs_discard_all_prealloc()
557 reiserfs_error(th->t_super, "zam-4001", in reiserfs_discard_all_prealloc()
579 REISERFS_SB(s)->s_alloc_options.bits = 0; in reiserfs_parse_alloc_options()
592 REISERFS_SB(s)->s_alloc_options.border = 10; in reiserfs_parse_alloc_options()
594 REISERFS_SB(s)->s_alloc_options.border = in reiserfs_parse_alloc_options()
601 REISERFS_SB(s)->s_alloc_options.large_file_size = in reiserfs_parse_alloc_options()
659 REISERFS_SB(s)->s_alloc_options.preallocmin = in reiserfs_parse_alloc_options()
666 REISERFS_SB(s)->s_alloc_options.preallocsize = in reiserfs_parse_alloc_options()
674 reiserfs_warning(s, "zam-4001", "unknown option - %s", in reiserfs_parse_alloc_options()
703 if (REISERFS_SB(s)->s_alloc_options.border != 10) { in show_alloc_options()
705 100 / REISERFS_SB(s)->s_alloc_options.border); in show_alloc_options()
711 if (REISERFS_SB(s)->s_alloc_options.large_file_size != 16) { in show_alloc_options()
713 REISERFS_SB(s)->s_alloc_options.large_file_size); in show_alloc_options()
761 if (REISERFS_SB(s)->s_alloc_options.preallocmin != 0) { in show_alloc_options()
764 REISERFS_SB(s)->s_alloc_options.preallocmin); in show_alloc_options()
766 if (REISERFS_SB(s)->s_alloc_options.preallocsize != 17) { in show_alloc_options()
769 REISERFS_SB(s)->s_alloc_options.preallocsize); in show_alloc_options()
777 if (hint->formatted_node) { in new_hashed_relocation()
778 hash_in = (char *)&hint->key.k_dir_id; in new_hashed_relocation()
780 if (!hint->inode) { in new_hashed_relocation()
781 /*hint->search_start = hint->beg;*/ in new_hashed_relocation()
782 hash_in = (char *)&hint->key.k_dir_id; in new_hashed_relocation()
784 if (TEST_OPTION(displace_based_on_dirid, hint->th->t_super)) in new_hashed_relocation()
785 hash_in = (char *)(&INODE_PKEY(hint->inode)->k_dir_id); in new_hashed_relocation()
788 (char *)(&INODE_PKEY(hint->inode)->k_objectid); in new_hashed_relocation()
791 hint->search_start = in new_hashed_relocation()
792 hint->beg + keyed_hash(hash_in, 4) % (hint->end - hint->beg); in new_hashed_relocation()
804 struct super_block *sb = hint->th->t_super; in dirid_groups()
806 if (hint->inode) in dirid_groups()
807 dirid = le32_to_cpu(INODE_PKEY(hint->inode)->k_dir_id); in dirid_groups()
808 else if (hint->formatted_node) in dirid_groups()
809 dirid = hint->key.k_dir_id; in dirid_groups()
813 hash = bm * (sb->s_blocksize << 3); in dirid_groups()
815 if (hint->inode) in dirid_groups()
816 hash += sb->s_blocksize / 2; in dirid_groups()
817 hint->search_start = hash; in dirid_groups()
827 if (hint->inode) { in oid_groups()
833 dirid = le32_to_cpu(INODE_PKEY(hint->inode)->k_dir_id); in oid_groups()
840 hash = (hint->inode->i_sb->s_blocksize << 3); in oid_groups()
842 oid = le32_to_cpu(INODE_PKEY(hint->inode)->k_objectid); in oid_groups()
843 bm = bmap_hash_id(hint->inode->i_sb, oid); in oid_groups()
844 hash = bm * (hint->inode->i_sb->s_blocksize << 3); in oid_groups()
846 hint->search_start = hash; in oid_groups()
867 if (!hint->path) in get_left_neighbor()
870 path = hint->path; in get_left_neighbor()
872 RFALSE(!bh, "green-4002: Illegal path specified to get_left_neighbor"); in get_left_neighbor()
874 pos_in_item = path->pos_in_item; in get_left_neighbor()
877 hint->search_start = bh->b_blocknr; in get_left_neighbor()
880 * for indirect item: go to left and look for the first non-hole entry in get_left_neighbor()
883 if (!hint->formatted_node && is_indirect_le_ih(ih)) { in get_left_neighbor()
885 pos_in_item--; in get_left_neighbor()
889 hint->search_start = t; in get_left_neighbor()
893 pos_in_item--; in get_left_neighbor()
911 SB_BLOCK_COUNT(s) / REISERFS_SB(s)->s_alloc_options.border; in set_border_in_hint()
913 if (hint->formatted_node) in set_border_in_hint()
914 hint->end = border - 1; in set_border_in_hint()
916 hint->beg = border; in set_border_in_hint()
921 if (TEST_OPTION(displace_based_on_dirid, hint->th->t_super)) in displace_large_file()
922 hint->search_start = in displace_large_file()
923 hint->beg + in displace_large_file()
924 keyed_hash((char *)(&INODE_PKEY(hint->inode)->k_dir_id), in displace_large_file()
925 4) % (hint->end - hint->beg); in displace_large_file()
927 hint->search_start = in displace_large_file()
928 hint->beg + in displace_large_file()
929 keyed_hash((char *)(&INODE_PKEY(hint->inode)->k_objectid), in displace_large_file()
930 4) % (hint->end - hint->beg); in displace_large_file()
937 if (!hint->inode) in hash_formatted_node()
938 hash_in = (char *)&hint->key.k_dir_id; in hash_formatted_node()
939 else if (TEST_OPTION(displace_based_on_dirid, hint->th->t_super)) in hash_formatted_node()
940 hash_in = (char *)(&INODE_PKEY(hint->inode)->k_dir_id); in hash_formatted_node()
942 hash_in = (char *)(&INODE_PKEY(hint->inode)->k_objectid); in hash_formatted_node()
944 hint->search_start = in hash_formatted_node()
945 hint->beg + keyed_hash(hash_in, 4) % (hint->end - hint->beg); in hash_formatted_node()
952 return hint->block == in this_blocknr_allocation_would_make_it_a_large_file()
953 REISERFS_SB(hint->th->t_super)->s_alloc_options.large_file_size; in this_blocknr_allocation_would_make_it_a_large_file()
959 struct in_core_key *key = &hint->key; in displace_new_packing_locality()
961 hint->th->displace_new_blocks = 0; in displace_new_packing_locality()
962 hint->search_start = in displace_new_packing_locality()
963 hint->beg + keyed_hash((char *)(&key->k_objectid), in displace_new_packing_locality()
964 4) % (hint->end - hint->beg); in displace_new_packing_locality()
973 if (hint->formatted_node || hint->inode == NULL) { in old_hashed_relocation()
977 hash_in = le32_to_cpu((INODE_PKEY(hint->inode))->k_dir_id); in old_hashed_relocation()
979 hint->beg + (u32) keyed_hash(((char *)(&hash_in)), in old_hashed_relocation()
980 4) % (hint->end - hint->beg - 1); in old_hashed_relocation()
981 if (border > hint->search_start) in old_hashed_relocation()
982 hint->search_start = border; in old_hashed_relocation()
991 if (hint->formatted_node || hint->inode == NULL) { in old_way()
996 hint->beg + in old_way()
997 le32_to_cpu(INODE_PKEY(hint->inode)->k_dir_id) % (hint->end - in old_way()
998 hint->beg); in old_way()
999 if (border > hint->search_start) in old_way()
1000 hint->search_start = border; in old_way()
1007 struct in_core_key *key = &hint->key; in hundredth_slices()
1011 (keyed_hash((char *)(&key->k_dir_id), 4) % 100) * (hint->end / 100); in hundredth_slices()
1012 if (slice_start > hint->search_start in hundredth_slices()
1013 || slice_start + (hint->end / 100) <= hint->search_start) { in hundredth_slices()
1014 hint->search_start = slice_start; in hundredth_slices()
1021 struct super_block *s = hint->th->t_super; in determine_search_start()
1024 hint->beg = 0; in determine_search_start()
1025 hint->end = SB_BLOCK_COUNT(s) - 1; in determine_search_start()
1038 && hint->th->displace_new_blocks) { in determine_search_start()
1043 * if new packing locality is being displaced in determine_search_start()
1054 if (displacing_large_files(s) && !hint->formatted_node in determine_search_start()
1064 if (hint->formatted_node && TEST_OPTION(hashed_formatted_nodes, s)) { in determine_search_start()
1079 if (!hint->formatted_node) { in determine_search_start()
1085 if (hint->inode in determine_search_start()
1086 && hint->search_start < in determine_search_start()
1087 REISERFS_I(hint->inode)->i_prealloc_block) in determine_search_start()
1088 hint->search_start = in determine_search_start()
1089 REISERFS_I(hint->inode)->i_prealloc_block; in determine_search_start()
1096 && !(displacing_large_files(s) && !hint->formatted_node)) { in determine_search_start()
1102 if (!unfm_hint && !hint->formatted_node && in determine_search_start()
1108 if ((!unfm_hint || hint->formatted_node) && in determine_search_start()
1114 if (!unfm_hint && !hint->formatted_node && TEST_OPTION(dirid_groups, s)) { in determine_search_start()
1118 if (hint->formatted_node && TEST_OPTION(dirid_groups, s)) { in determine_search_start()
1124 if (!unfm_hint && !hint->formatted_node && TEST_OPTION(oid_groups, s)) { in determine_search_start()
1133 /* we preallocate blocks only for regular files, specific size */ in determine_prealloc_size()
1136 hint->prealloc_size = 0; in determine_prealloc_size()
1138 if (!hint->formatted_node && hint->preallocate) { in determine_prealloc_size()
1139 if (S_ISREG(hint->inode->i_mode) && !IS_PRIVATE(hint->inode) in determine_prealloc_size()
1140 && hint->inode->i_size >= in determine_prealloc_size()
1141 REISERFS_SB(hint->th->t_super)->s_alloc_options. in determine_prealloc_size()
1142 preallocmin * hint->inode->i_sb->s_blocksize) in determine_prealloc_size()
1143 hint->prealloc_size = in determine_prealloc_size()
1144 REISERFS_SB(hint->th->t_super)->s_alloc_options. in determine_prealloc_size()
1145 preallocsize - 1; in determine_prealloc_size()
1161 nr_allocated = scan_bitmap(hint->th, &start, finish, min, in allocate_without_wrapping_disk()
1163 !hint->formatted_node, hint->block); in allocate_without_wrapping_disk()
1171 rest--; in allocate_without_wrapping_disk()
1172 nr_allocated--; in allocate_without_wrapping_disk()
1181 list_add(&REISERFS_I(hint->inode)->i_prealloc_list, in allocate_without_wrapping_disk()
1182 &SB_JOURNAL(hint->th->t_super)-> in allocate_without_wrapping_disk()
1184 REISERFS_I(hint->inode)->i_prealloc_block = start; in allocate_without_wrapping_disk()
1185 REISERFS_I(hint->inode)->i_prealloc_count = in allocate_without_wrapping_disk()
1191 return (amount_needed - rest); in allocate_without_wrapping_disk()
1197 struct super_block *s = hint->th->t_super; in blocknrs_and_prealloc_arrays_from_search_start()
1198 b_blocknr_t start = hint->search_start; in blocknrs_and_prealloc_arrays_from_search_start()
1199 b_blocknr_t finish = SB_BLOCK_COUNT(s) - 1; in blocknrs_and_prealloc_arrays_from_search_start()
1205 if (!hint->formatted_node) { in blocknrs_and_prealloc_arrays_from_search_start()
1210 amount_needed, hint->inode->i_uid); in blocknrs_and_prealloc_arrays_from_search_start()
1214 dquot_alloc_block_nodirty(hint->inode, amount_needed); in blocknrs_and_prealloc_arrays_from_search_start()
1219 if (hint->preallocate && hint->prealloc_size) { in blocknrs_and_prealloc_arrays_from_search_start()
1223 hint->prealloc_size, hint->inode->i_uid); in blocknrs_and_prealloc_arrays_from_search_start()
1225 quota_ret = dquot_prealloc_block_nodirty(hint->inode, in blocknrs_and_prealloc_arrays_from_search_start()
1226 hint->prealloc_size); in blocknrs_and_prealloc_arrays_from_search_start()
1228 hint->preallocate = hint->prealloc_size = 0; in blocknrs_and_prealloc_arrays_from_search_start()
1236 case 0: /* Search from hint->search_start to end of disk */ in blocknrs_and_prealloc_arrays_from_search_start()
1237 start = hint->search_start; in blocknrs_and_prealloc_arrays_from_search_start()
1238 finish = SB_BLOCK_COUNT(s) - 1; in blocknrs_and_prealloc_arrays_from_search_start()
1240 case 1: /* Search from hint->beg to hint->search_start */ in blocknrs_and_prealloc_arrays_from_search_start()
1241 start = hint->beg; in blocknrs_and_prealloc_arrays_from_search_start()
1242 finish = hint->search_start; in blocknrs_and_prealloc_arrays_from_search_start()
1244 case 2: /* Last chance: Search from 0 to hint->beg */ in blocknrs_and_prealloc_arrays_from_search_start()
1246 finish = hint->beg; in blocknrs_and_prealloc_arrays_from_search_start()
1251 if (!hint->formatted_node) { in blocknrs_and_prealloc_arrays_from_search_start()
1256 hint->prealloc_size - in blocknrs_and_prealloc_arrays_from_search_start()
1258 hint->inode->i_uid); in blocknrs_and_prealloc_arrays_from_search_start()
1262 dquot_free_block_nodirty(hint->inode, in blocknrs_and_prealloc_arrays_from_search_start()
1263 amount_needed + hint->prealloc_size - in blocknrs_and_prealloc_arrays_from_search_start()
1267 while (nr_allocated--) in blocknrs_and_prealloc_arrays_from_search_start()
1268 reiserfs_free_block(hint->th, hint->inode, in blocknrs_and_prealloc_arrays_from_search_start()
1270 !hint->formatted_node); in blocknrs_and_prealloc_arrays_from_search_start()
1279 amount_needed - in blocknrs_and_prealloc_arrays_from_search_start()
1281 hint-> in blocknrs_and_prealloc_arrays_from_search_start()
1284 if (!hint->formatted_node && in blocknrs_and_prealloc_arrays_from_search_start()
1285 amount_needed + hint->prealloc_size > in blocknrs_and_prealloc_arrays_from_search_start()
1286 nr_allocated + REISERFS_I(hint->inode)->i_prealloc_count) { in blocknrs_and_prealloc_arrays_from_search_start()
1291 amount_needed + hint->prealloc_size - in blocknrs_and_prealloc_arrays_from_search_start()
1292 nr_allocated - in blocknrs_and_prealloc_arrays_from_search_start()
1293 REISERFS_I(hint->inode)->i_prealloc_count, in blocknrs_and_prealloc_arrays_from_search_start()
1294 hint->inode->i_uid); in blocknrs_and_prealloc_arrays_from_search_start()
1298 dquot_free_block_nodirty(hint->inode, amount_needed + in blocknrs_and_prealloc_arrays_from_search_start()
1299 hint->prealloc_size - nr_allocated - in blocknrs_and_prealloc_arrays_from_search_start()
1300 REISERFS_I(hint->inode)-> in blocknrs_and_prealloc_arrays_from_search_start()
1314 struct inode *inode = hint->inode; in use_preallocated_list_if_available()
1316 if (REISERFS_I(inode)->i_prealloc_count > 0) { in use_preallocated_list_if_available()
1319 *new_blocknrs++ = REISERFS_I(inode)->i_prealloc_block++; in use_preallocated_list_if_available()
1320 REISERFS_I(inode)->i_prealloc_count--; in use_preallocated_list_if_available()
1322 amount_needed--; in use_preallocated_list_if_available()
1324 if (REISERFS_I(inode)->i_prealloc_count <= 0) { in use_preallocated_list_if_available()
1325 list_del(&REISERFS_I(inode)->i_prealloc_list); in use_preallocated_list_if_available()
1342 struct super_block *s = hint->th->t_super; in reiserfs_allocate_blocknrs()
1345 if (SB_FREE_BLOCKS(s) - REISERFS_SB(s)->reserved_blocks < in reiserfs_allocate_blocknrs()
1346 amount_needed - reserved_by_us) in reiserfs_allocate_blocknrs()
1348 /* should this be if !hint->inode && hint->preallocate? */ in reiserfs_allocate_blocknrs()
1349 /* do you mean hint->formatted_node can be removed ? - Zam */ in reiserfs_allocate_blocknrs()
1351 * hint->formatted_node cannot be removed because we try to access in reiserfs_allocate_blocknrs()
1353 * metadata allocations - green in reiserfs_allocate_blocknrs()
1356 if (!hint->formatted_node && hint->preallocate) { in reiserfs_allocate_blocknrs()
1366 new_blocknrs += (initial_amount_needed - amount_needed); in reiserfs_allocate_blocknrs()
1371 if (hint->search_start >= SB_BLOCK_COUNT(s)) in reiserfs_allocate_blocknrs()
1372 hint->search_start = SB_BLOCK_COUNT(s) - 1; in reiserfs_allocate_blocknrs()
1381 * prealloc. list or just free them. -- Zam (I chose second in reiserfs_allocate_blocknrs()
1386 reiserfs_free_block(hint->th, hint->inode, in reiserfs_allocate_blocknrs()
1387 *(--new_blocknrs), 1); in reiserfs_allocate_blocknrs()
1397 unsigned long *cur = (unsigned long *)(bh->b_data + bh->b_size); in reiserfs_cache_bitmap_metadata()
1400 if (!reiserfs_test_le_bit(0, (unsigned long *)bh->b_data)) in reiserfs_cache_bitmap_metadata()
1401 reiserfs_error(sb, "reiserfs-2025", "bitmap block %lu is " in reiserfs_cache_bitmap_metadata()
1402 "corrupted: first bit must be 1", bh->b_blocknr); in reiserfs_cache_bitmap_metadata()
1404 info->free_count = 0; in reiserfs_cache_bitmap_metadata()
1406 while (--cur >= (unsigned long *)bh->b_data) { in reiserfs_cache_bitmap_metadata()
1409 info->free_count += BITS_PER_LONG; in reiserfs_cache_bitmap_metadata()
1411 info->free_count += BITS_PER_LONG - hweight_long(*cur); in reiserfs_cache_bitmap_metadata()
1418 b_blocknr_t block = (sb->s_blocksize << 3) * bitmap; in reiserfs_read_bitmap_block()
1427 &REISERFS_SB(sb)->s_properties))) in reiserfs_read_bitmap_block()
1428 block = REISERFS_SB(sb)->s_sbh->b_blocknr + 1 + bitmap; in reiserfs_read_bitmap_block()
1430 block = (REISERFS_DISK_OFFSET_IN_BYTES >> sb->s_blocksize_bits) + 1; in reiserfs_read_bitmap_block()
1434 reiserfs_warning(sb, "sh-2029: %s: bitmap block (#%u) " in reiserfs_read_bitmap_block()
1445 BUG_ON(atomic_read(&bh->b_count) == 0); in reiserfs_read_bitmap_block()
1447 if (info->free_count == UINT_MAX) in reiserfs_read_bitmap_block()
1461 return -ENOMEM; in reiserfs_init_bitmap_cache()