Searched refs:IH_SIZE (Results 1 – 7 of 7) sorted by relevance
/fs/reiserfs/ |
D | lbalance.c | 350 RFALSE(blkh_free_space(blkh) < cpy_num * IH_SIZE, in leaf_copy_items_entirely() 352 B_FREE_SPACE(dest), cpy_num * IH_SIZE); in leaf_copy_items_entirely() 355 memmove(ih + cpy_num, ih, (nr - dest_before) * IH_SIZE); in leaf_copy_items_entirely() 358 memcpy(ih, item_head(src, first), cpy_num * IH_SIZE); in leaf_copy_items_entirely() 360 free_space -= (IH_SIZE * cpy_num); in leaf_copy_items_entirely() 403 IH_SIZE * cpy_num)); in leaf_copy_items_entirely() 442 memcpy(&n_ih, ih, IH_SIZE); in leaf_item_bottle() 919 RFALSE(free_space < ih_item_len(inserted_item_ih) + IH_SIZE, in leaf_insert_into_buf() 948 memmove(ih + 1, ih, IH_SIZE * (nr - before)); in leaf_insert_into_buf() 949 memmove(ih, inserted_item_ih, IH_SIZE); in leaf_insert_into_buf() [all …]
|
D | stree.c | 33 memcpy(to, from, IH_SIZE); in copy_item_head() 425 if (nr < 1 || nr > ((blocksize - BLKH_SIZE) / (IH_SIZE + MIN_ITEM_LEN))) { in is_leaf() 432 used_space = BLKH_SIZE + IH_SIZE * nr + (blocksize - ih_location(ih)); in is_leaf() 456 || ih_location(ih) < IH_SIZE * nr) { in is_leaf() 476 if (ih_item_len(ih) < (ih_entry_count(ih) * IH_SIZE)) { in is_leaf() 773 DISK_LEAF_NODE_LEVEL) ? IH_SIZE : in search_by_key() 945 return memcmp(stored_ih, ih, IH_SIZE); in comp_items() 964 *cut_size = -(IH_SIZE + ih_item_len(le_ih)); in prepare_for_direct_item() 972 *cut_size = -(IH_SIZE + ih_item_len(le_ih)); in prepare_for_direct_item() 985 *cut_size = -(IH_SIZE + ih_item_len(le_ih)); in prepare_for_direct_item() [all …]
|
D | fix_node.c | 105 vi->vi_item_len += ih_item_len(ih + j) + IH_SIZE; in create_virtual_node() 224 ((vi->vi_type & VI_TYPE_LEFT_MERGEABLE) ? IH_SIZE : 0))) { in check_left() 235 d_size = 0, ih_size = IH_SIZE; in check_left() 239 d_size = -((int)IH_SIZE), ih_size = 0; in check_left() 243 i++, ih_size = IH_SIZE, d_size = 0, vi++) { in check_left() 310 ((vi->vi_type & VI_TYPE_RIGHT_MERGEABLE) ? IH_SIZE : 0))) { in check_right() 321 d_size = 0, ih_size = IH_SIZE; in check_right() 325 d_size = -(int)IH_SIZE, ih_size = 0; in check_right() 329 i--, d_size = 0, ih_size = IH_SIZE, vi--) { in check_right() 513 free_space = max_node_size - total_node_size - IH_SIZE; in get_num_ver() [all …]
|
D | item_ops.c | 88 return vi->vi_item_len - IH_SIZE; in sd_unit_num() 179 return vi->vi_item_len - IH_SIZE; in direct_unit_num() 323 return vi->vi_item_len - IH_SIZE; in indirect_unit_num() 505 if (l + IH_SIZE != vi->vi_item_len + in direntry_create_vi()
|
D | prints.c | 738 if (nr > (bh->b_size - BLKH_SIZE) / IH_SIZE) in check_leaf_block_head() 741 if (blkh_free_space(blkh) > bh->b_size - BLKH_SIZE - IH_SIZE * nr) in check_leaf_block_head() 752 if (B_NR_ITEMS(bh) > (bh->b_size - BLKH_SIZE) / IH_SIZE) in check_internal_block_head()
|
D | reiserfs.h | 1396 #define IH_SIZE (sizeof(struct item_head)) macro 1625 #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE) 2681 #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)
|
D | do_balan.c | 86 RFALSE(ih_item_len(ih) + IH_SIZE != -tb->insert_size[0], in balance_leaf_when_delete_del()
|