Home
last modified time | relevance | path

Searched refs:insert_size (Results 1 - 16 of 16) sorted by relevance

/kernel/linux/linux-5.10/fs/reiserfs/
H A Ddo_balan.c67 * if deleting something ( tb->insert_size[0] < 0 )
86 RFALSE(ih_item_len(ih) + IH_SIZE != -tb->insert_size[0], in balance_leaf_when_delete_del()
88 -tb->insert_size[0], ih); in balance_leaf_when_delete_del()
123 * when we cut a directory tb->insert_size[0] means in balance_leaf_when_delete_cut()
126 tb->insert_size[0] = -1; in balance_leaf_when_delete_cut()
128 -tb->insert_size[0]); in balance_leaf_when_delete_cut()
138 -tb->insert_size[0]); in balance_leaf_when_delete_cut()
231 * Balance leaf node in case of delete or cut: insert_size[0] < 0
345 tb->insert_size[0] = 0; in balance_leaf_insert_left()
381 l_pos_in_item, tb->insert_size[ in balance_leaf_paste_left_shift_dirent()
[all...]
H A Ditem_ops.c62 int is_affected, int insert_size) in sd_create_vi()
152 int is_affected, int insert_size) in direct_create_vi()
290 int is_affected, int insert_size) in indirect_create_vi()
460 int is_affected, int insert_size) in direntry_create_vi()
494 dir_u->entry_sizes[vn->vn_pos_in_item] = insert_size; in direntry_create_vi()
508 || vn->vn_mode == M_CUT)) ? insert_size : 0)) { in direntry_create_vi()
510 "insert_size==%d), invalid length of " in direntry_create_vi()
512 vn->vn_mode, insert_size); in direntry_create_vi()
671 int is_affected, int insert_size) in errcatch_create_vi()
60 sd_create_vi(struct virtual_node *vn, struct virtual_item *vi, int is_affected, int insert_size) sd_create_vi() argument
150 direct_create_vi(struct virtual_node *vn, struct virtual_item *vi, int is_affected, int insert_size) direct_create_vi() argument
288 indirect_create_vi(struct virtual_node *vn, struct virtual_item *vi, int is_affected, int insert_size) indirect_create_vi() argument
458 direntry_create_vi(struct virtual_node *vn, struct virtual_item *vi, int is_affected, int insert_size) direntry_create_vi() argument
669 errcatch_create_vi(struct virtual_node *vn, struct virtual_item *vi, int is_affected, int insert_size) errcatch_create_vi() argument
H A Dfix_node.c62 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node()
115 op_create_vi(vn, vi, is_affected, tb->insert_size[0]); in create_virtual_node()
125 vn->vn_vi[new_num].vi_item_len += tb->insert_size[0]; in create_virtual_node()
137 vi->vi_item_len = tb->insert_size[0]; in create_virtual_node()
143 tb->insert_size[0]); in create_virtual_node()
417 RFALSE(tb->insert_size[h] < 0 || (mode != M_INSERT && mode != M_PASTE), in get_num_ver()
418 "vs-8100: insert_size < 0 in overflow"); in get_num_ver()
1277 int levbytes = tb->insert_size[h]; in can_node_be_removed()
1374 levbytes = tb->insert_size[h]; in ip_check_balance()
1742 * using tb->insert_size[ in dc_check_balance_internal()
[all...]
H A Dprints.c658 for (h = 0; h < ARRAY_SIZE(tb->insert_size); h++) { in store_print_tb()
693 tb->insert_size[0], tb->lnum[0], tb->lbytes, tb->rnum[0], in store_print_tb()
704 h, tb->insert_size[h], tb->lnum[h], tb->rnum[h], in store_print_tb()
706 } while (tb->insert_size[h]); in store_print_tb()
H A Dstree.c1174 M_DELETE) ? ih_item_len(p_le_ih) : -tb->insert_size[0]; in calc_deleted_bytes_number()
1204 tb->insert_size[0] = size; in init_tb_struct()
1288 s_del_balance.insert_size[0] = del_size; in reiserfs_delete_item()
1740 s_cut_balance.insert_size[0] = cut_size; in reiserfs_cut_from_item()
1783 insert_size[0]; in reiserfs_cut_from_item()
1825 && s_cut_balance.insert_size[0] != -UNFM_P_SIZE) { in reiserfs_cut_from_item()
1828 "(CUT, insert_size==%d)", in reiserfs_cut_from_item()
1829 le_ih, s_cut_balance.insert_size[0]); in reiserfs_cut_from_item()
H A Dibalance.c640 insert_num = tb->insert_size[h] / ((int)(DC_SIZE + KEY_SIZE)); in balance_internal_when_delete()
651 "tb->blknum[%d]=%d when insert_size < 0", h, tb->blknum[h]); in balance_internal_when_delete()
834 * Using insert_size[h] calculate the number insert_num of items in balance_internal()
837 insert_num = tb->insert_size[h] / ((int)(KEY_SIZE + DC_SIZE)); in balance_internal()
1022 tb->insert_size[h] -= DC_SIZE; in balance_internal()
H A Dreiserfs.h2464 int insert_size[MAX_HEIGHT]; member
2637 int is_affected, int insert_size);
2652 #define op_create_vi(vn,vi,is_affected,insert_size) item_ops[le_ih_k_type ((vi)->vi_ih)]->create_vi (vn,vi,is_affected,insert_size)
/kernel/linux/linux-6.6/fs/reiserfs/
H A Ddo_balan.c67 * if deleting something ( tb->insert_size[0] < 0 )
86 RFALSE(ih_item_len(ih) + IH_SIZE != -tb->insert_size[0], in balance_leaf_when_delete_del()
88 -tb->insert_size[0], ih); in balance_leaf_when_delete_del()
123 * when we cut a directory tb->insert_size[0] means in balance_leaf_when_delete_cut()
126 tb->insert_size[0] = -1; in balance_leaf_when_delete_cut()
128 -tb->insert_size[0]); in balance_leaf_when_delete_cut()
138 -tb->insert_size[0]); in balance_leaf_when_delete_cut()
231 * Balance leaf node in case of delete or cut: insert_size[0] < 0
345 tb->insert_size[0] = 0; in balance_leaf_insert_left()
381 l_pos_in_item, tb->insert_size[ in balance_leaf_paste_left_shift_dirent()
[all...]
H A Ditem_ops.c62 int is_affected, int insert_size) in sd_create_vi()
152 int is_affected, int insert_size) in direct_create_vi()
290 int is_affected, int insert_size) in indirect_create_vi()
460 int is_affected, int insert_size) in direntry_create_vi()
494 dir_u->entry_sizes[vn->vn_pos_in_item] = insert_size; in direntry_create_vi()
508 || vn->vn_mode == M_CUT)) ? insert_size : 0)) { in direntry_create_vi()
510 "insert_size==%d), invalid length of " in direntry_create_vi()
512 vn->vn_mode, insert_size); in direntry_create_vi()
671 int is_affected, int insert_size) in errcatch_create_vi()
60 sd_create_vi(struct virtual_node *vn, struct virtual_item *vi, int is_affected, int insert_size) sd_create_vi() argument
150 direct_create_vi(struct virtual_node *vn, struct virtual_item *vi, int is_affected, int insert_size) direct_create_vi() argument
288 indirect_create_vi(struct virtual_node *vn, struct virtual_item *vi, int is_affected, int insert_size) indirect_create_vi() argument
458 direntry_create_vi(struct virtual_node *vn, struct virtual_item *vi, int is_affected, int insert_size) direntry_create_vi() argument
669 errcatch_create_vi(struct virtual_node *vn, struct virtual_item *vi, int is_affected, int insert_size) errcatch_create_vi() argument
H A Dfix_node.c62 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node()
115 op_create_vi(vn, vi, is_affected, tb->insert_size[0]); in create_virtual_node()
125 vn->vn_vi[new_num].vi_item_len += tb->insert_size[0]; in create_virtual_node()
137 vi->vi_item_len = tb->insert_size[0]; in create_virtual_node()
143 tb->insert_size[0]); in create_virtual_node()
417 RFALSE(tb->insert_size[h] < 0 || (mode != M_INSERT && mode != M_PASTE), in get_num_ver()
418 "vs-8100: insert_size < 0 in overflow"); in get_num_ver()
1277 int levbytes = tb->insert_size[h]; in can_node_be_removed()
1374 levbytes = tb->insert_size[h]; in ip_check_balance()
1742 * using tb->insert_size[ in dc_check_balance_internal()
[all...]
H A Dprints.c658 for (h = 0; h < ARRAY_SIZE(tb->insert_size); h++) { in store_print_tb()
693 tb->insert_size[0], tb->lnum[0], tb->lbytes, tb->rnum[0], in store_print_tb()
704 h, tb->insert_size[h], tb->lnum[h], tb->rnum[h], in store_print_tb()
706 } while (tb->insert_size[h]); in store_print_tb()
H A Dstree.c1174 M_DELETE) ? ih_item_len(p_le_ih) : -tb->insert_size[0]; in calc_deleted_bytes_number()
1204 tb->insert_size[0] = size; in init_tb_struct()
1286 s_del_balance.insert_size[0] = del_size; in reiserfs_delete_item()
1738 s_cut_balance.insert_size[0] = cut_size; in reiserfs_cut_from_item()
1781 insert_size[0]; in reiserfs_cut_from_item()
1823 && s_cut_balance.insert_size[0] != -UNFM_P_SIZE) { in reiserfs_cut_from_item()
1826 "(CUT, insert_size==%d)", in reiserfs_cut_from_item()
1827 le_ih, s_cut_balance.insert_size[0]); in reiserfs_cut_from_item()
H A Dibalance.c640 insert_num = tb->insert_size[h] / ((int)(DC_SIZE + KEY_SIZE)); in balance_internal_when_delete()
651 "tb->blknum[%d]=%d when insert_size < 0", h, tb->blknum[h]); in balance_internal_when_delete()
834 * Using insert_size[h] calculate the number insert_num of items in balance_internal()
837 insert_num = tb->insert_size[h] / ((int)(KEY_SIZE + DC_SIZE)); in balance_internal()
1022 tb->insert_size[h] -= DC_SIZE; in balance_internal()
H A Dreiserfs.h2461 int insert_size[MAX_HEIGHT]; member
2634 int is_affected, int insert_size);
2649 #define op_create_vi(vn,vi,is_affected,insert_size) item_ops[le_ih_k_type ((vi)->vi_ih)]->create_vi (vn,vi,is_affected,insert_size)
/kernel/linux/linux-5.10/drivers/gpu/drm/selftests/
H A Dtest-drm_mm.c1088 unsigned int insert_size = 10000; in igt_frag() local
1092 /* We need 4 * insert_size nodes to hold intermediate allocated in igt_frag()
1098 nodes = vzalloc(array_size(insert_size * 4, sizeof(*nodes))); in igt_frag()
1114 ret = prepare_igt_frag(&mm, nodes, insert_size, mode); in igt_frag()
1118 insert_time1 = get_insert_time(&mm, insert_size, in igt_frag()
1119 nodes + insert_size, mode); in igt_frag()
1123 insert_time2 = get_insert_time(&mm, (insert_size * 2), in igt_frag()
1124 nodes + insert_size * 2, mode); in igt_frag()
1129 mode->name, insert_size, insert_size * in igt_frag()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/tests/
H A Ddrm_mm_test.c996 unsigned int insert_size = 10000; in drm_test_mm_frag() local
999 /* We need 4 * insert_size nodes to hold intermediate allocated in drm_test_mm_frag()
1005 nodes = vzalloc(array_size(insert_size * 4, sizeof(*nodes))); in drm_test_mm_frag()
1020 if (prepare_frag(test, &mm, nodes, insert_size, mode)) in drm_test_mm_frag()
1023 insert_time1 = get_insert_time(test, &mm, insert_size, in drm_test_mm_frag()
1024 nodes + insert_size, mode); in drm_test_mm_frag()
1028 insert_time2 = get_insert_time(test, &mm, (insert_size * 2), in drm_test_mm_frag()
1029 nodes + insert_size * 2, mode); in drm_test_mm_frag()
1034 mode->name, insert_size, insert_size * in drm_test_mm_frag()
[all...]

Completed in 38 milliseconds