Home
last modified time | relevance | path

Searched refs:item_head (Results 1 - 25 of 32) sorted by relevance

12

/kernel/linux/linux-5.10/fs/reiserfs/
H A Ddo_balan.c83 struct item_head *ih = item_head(tbS0, item_pos); in balance_leaf_when_delete_del()
113 struct item_head *ih = item_head(tbS0, item_pos); in balance_leaf_when_delete_cut()
287 struct item_head *const ih, in balance_leaf_insert_left()
352 struct item_head * const ih, in balance_leaf_paste_left_shift_dirent()
364 struct item_head *pasted; in balance_leaf_paste_left_shift_dirent()
373 pasted = item_head(tb->L[0], B_NR_ITEMS(tb->L[0]) - 1); in balance_leaf_paste_left_shift_dirent()
414 struct item_head * const ih, in balance_leaf_paste_left_shift()
422 if (is_direntry_le_ih(item_head(tbS in balance_leaf_paste_left_shift()
[all...]
H A Dlbalance.c26 struct item_head *ih; in leaf_copy_dir_entries()
31 ih = item_head(source, item_num); in leaf_copy_dir_entries()
70 struct item_head new_ih; in leaf_copy_dir_entries()
121 FIRST_TO_LAST) ? ih_entry_count(item_head(dest, in leaf_copy_dir_entries()
141 struct item_head *ih; in leaf_copy_boundary_item()
142 struct item_head *dih; in leaf_copy_boundary_item()
153 ih = item_head(src, 0); in leaf_copy_boundary_item()
154 dih = item_head(dest, dest_nr_item - 1); in leaf_copy_boundary_item()
221 ih = item_head(src, src_nr_item - 1); in leaf_copy_boundary_item()
222 dih = item_head(des in leaf_copy_boundary_item()
[all...]
H A Ditem_ops.c19 static int sd_bytes_number(struct item_head *ih, int block_size) in sd_bytes_number()
36 static void sd_print_item(struct item_head *ih, char *item) in sd_print_item()
55 static void sd_check_item(struct item_head *ih, char *item) in sd_check_item()
114 static int direct_bytes_number(struct item_head *ih, int block_size) in direct_bytes_number()
134 static void direct_print_item(struct item_head *ih, char *item) in direct_print_item()
145 static void direct_check_item(struct item_head *ih, char *item) in direct_check_item()
205 static int indirect_bytes_number(struct item_head *ih, int block_size) in indirect_bytes_number()
260 static void indirect_print_item(struct item_head *ih, char *item) in indirect_print_item()
283 static void indirect_check_item(struct item_head *ih, char *item) in indirect_check_item()
349 static int direntry_bytes_number(struct item_head *i
[all...]
H A Dreiserfs.h1361 struct item_head { struct
1396 #define IH_SIZE (sizeof(struct item_head))
1482 static inline loff_t le_ih_k_offset(const struct item_head *ih) in le_ih_k_offset()
1496 static inline loff_t le_ih_k_type(const struct item_head *ih) in le_ih_k_type()
1517 static inline void add_le_ih_k_offset(struct item_head *ih, loff_t offset) in add_le_ih_k_offset()
1522 static inline void set_le_ih_k_offset(struct item_head *ih, loff_t offset) in set_le_ih_k_offset()
1537 static inline void set_le_ih_k_type(struct item_head *ih, int type) in set_le_ih_k_type()
1563 static inline int is_direntry_le_ih(struct item_head *ih) in is_direntry_le_ih()
1568 static inline int is_direct_le_ih(struct item_head *ih) in is_direct_le_ih()
1573 static inline int is_indirect_le_ih(struct item_head *i
2199 static inline struct item_head *item_head(const struct buffer_head *bh, item_head() function
[all...]
H A Dstree.c30 inline void copy_item_head(struct item_head *to, in copy_item_head()
31 const struct item_head *from) in copy_item_head()
390 static int has_valid_deh_location(struct buffer_head *bh, struct item_head *ih) in has_valid_deh_location()
411 struct item_head *ih; in is_leaf()
431 ih = (struct item_head *)(buf + BLKH_SIZE) + nr - 1; in is_leaf()
446 ih = (struct item_head *)(buf + BLKH_SIZE); in is_leaf()
770 retval = bin_search(key, item_head(bh, 0), in search_by_key()
860 struct item_head *p_le_ih; /* pointer to on-disk structure */ in search_for_position_by_key()
880 (item_head in search_for_position_by_key()
894 item_head(PATH_PLAST_BUFFE in search_for_position_by_key()
[all...]
H A Dtail_conversion.c31 struct item_head *p_le_ih = tp_item_head(path); in direct2indirect()
41 struct item_head ind_ih; in direct2indirect()
212 struct item_head s_ih; in indirect2direct()
H A Dprints.c116 static int scnprintf_item_head(char *buf, size_t size, struct item_head *ih) in scnprintf_item_head()
234 va_arg(args, struct item_head *)); in prepare_error_buf()
271 * %h to print item_head,
481 struct item_head *ih; in print_leaf()
491 ih = item_head(bh, 0); in print_leaf()
765 struct item_head *ih; in check_leaf()
770 for (i = 0, ih = item_head(bh, 0); i < B_NR_ITEMS(bh); i++, ih++) in check_leaf()
H A Dibalance.c13 int, int, struct item_head *, struct buffer_head **);
128 struct item_head *inserted, in internal_insert_childs()
760 static void replace_lkey(struct tree_balance *tb, int h, struct item_head *key) in replace_lkey()
775 static void replace_rkey(struct tree_balance *tb, int h, struct item_head *key) in replace_rkey()
807 struct item_head *insert_key, in balance_internal()
821 struct item_head new_insert_key; in balance_internal()
823 struct item_head *new_insert_key_addr = insert_key; in balance_internal()
H A Dinode.c137 inline void make_le_item_head(struct item_head *ih, const struct cpu_key *key, in make_le_item_head()
215 struct item_head *ih, in allocation_needed()
226 static inline int indirect_item_found(int retval, struct item_head *ih) in indirect_item_found()
291 struct item_head *ih, tmp_ih; in _get_block_create_0()
667 struct item_head *ih, tmp_ih; in reiserfs_get_block()
1240 struct item_head *ih; in init_inode()
1426 struct item_head *ih; in update_stat_data()
1452 struct item_head *ih, tmp_ih; in reiserfs_update_sd_size()
1800 struct item_head *ih, struct treepath *path, in reiserfs_new_directory()
1863 struct item_head *i in reiserfs_new_symlink()
[all...]
H A Dfix_node.c53 struct item_head *ih; in create_virtual_node()
81 ih = item_head(Sh, 0); in create_virtual_node()
170 && is_direntry_le_ih(item_head(Sh, 0)) in create_virtual_node()
171 && ih_entry_count(item_head(Sh, 0)) == 1)) { in create_virtual_node()
714 struct item_head *ih; in are_leaves_removable()
720 ih = item_head(S0, 0); in are_leaves_removable()
1278 struct item_head *ih; in can_node_be_removed()
1281 ih = item_head(Sh, 0); in can_node_be_removed()
2066 struct item_head *ins_ih, const void *data) in check_balance()
2546 struct item_head *ins_i in fix_nodes()
[all...]
H A Ddir.c70 struct item_head *ih, tmp_ih; in reiserfs_readdir_inode()
/kernel/linux/linux-6.6/fs/reiserfs/
H A Ddo_balan.c83 struct item_head *ih = item_head(tbS0, item_pos); in balance_leaf_when_delete_del()
113 struct item_head *ih = item_head(tbS0, item_pos); in balance_leaf_when_delete_cut()
287 struct item_head *const ih, in balance_leaf_insert_left()
352 struct item_head * const ih, in balance_leaf_paste_left_shift_dirent()
364 struct item_head *pasted; in balance_leaf_paste_left_shift_dirent()
373 pasted = item_head(tb->L[0], B_NR_ITEMS(tb->L[0]) - 1); in balance_leaf_paste_left_shift_dirent()
414 struct item_head * const ih, in balance_leaf_paste_left_shift()
422 if (is_direntry_le_ih(item_head(tbS in balance_leaf_paste_left_shift()
[all...]
H A Dlbalance.c26 struct item_head *ih; in leaf_copy_dir_entries()
31 ih = item_head(source, item_num); in leaf_copy_dir_entries()
70 struct item_head new_ih; in leaf_copy_dir_entries()
121 FIRST_TO_LAST) ? ih_entry_count(item_head(dest, in leaf_copy_dir_entries()
141 struct item_head *ih; in leaf_copy_boundary_item()
142 struct item_head *dih; in leaf_copy_boundary_item()
153 ih = item_head(src, 0); in leaf_copy_boundary_item()
154 dih = item_head(dest, dest_nr_item - 1); in leaf_copy_boundary_item()
221 ih = item_head(src, src_nr_item - 1); in leaf_copy_boundary_item()
222 dih = item_head(des in leaf_copy_boundary_item()
[all...]
H A Ditem_ops.c19 static int sd_bytes_number(struct item_head *ih, int block_size) in sd_bytes_number()
36 static void sd_print_item(struct item_head *ih, char *item) in sd_print_item()
55 static void sd_check_item(struct item_head *ih, char *item) in sd_check_item()
114 static int direct_bytes_number(struct item_head *ih, int block_size) in direct_bytes_number()
134 static void direct_print_item(struct item_head *ih, char *item) in direct_print_item()
145 static void direct_check_item(struct item_head *ih, char *item) in direct_check_item()
205 static int indirect_bytes_number(struct item_head *ih, int block_size) in indirect_bytes_number()
260 static void indirect_print_item(struct item_head *ih, char *item) in indirect_print_item()
283 static void indirect_check_item(struct item_head *ih, char *item) in indirect_check_item()
349 static int direntry_bytes_number(struct item_head *i
[all...]
H A Dreiserfs.h1358 struct item_head { struct
1393 #define IH_SIZE (sizeof(struct item_head))
1479 static inline loff_t le_ih_k_offset(const struct item_head *ih) in le_ih_k_offset()
1493 static inline loff_t le_ih_k_type(const struct item_head *ih) in le_ih_k_type()
1514 static inline void add_le_ih_k_offset(struct item_head *ih, loff_t offset) in add_le_ih_k_offset()
1519 static inline void set_le_ih_k_offset(struct item_head *ih, loff_t offset) in set_le_ih_k_offset()
1534 static inline void set_le_ih_k_type(struct item_head *ih, int type) in set_le_ih_k_type()
1560 static inline int is_direntry_le_ih(struct item_head *ih) in is_direntry_le_ih()
1565 static inline int is_direct_le_ih(struct item_head *ih) in is_direct_le_ih()
1570 static inline int is_indirect_le_ih(struct item_head *i
2196 static inline struct item_head *item_head(const struct buffer_head *bh, item_head() function
[all...]
H A Dstree.c30 inline void copy_item_head(struct item_head *to, in copy_item_head()
31 const struct item_head *from) in copy_item_head()
390 static int has_valid_deh_location(struct buffer_head *bh, struct item_head *ih) in has_valid_deh_location()
411 struct item_head *ih; in is_leaf()
431 ih = (struct item_head *)(buf + BLKH_SIZE) + nr - 1; in is_leaf()
446 ih = (struct item_head *)(buf + BLKH_SIZE); in is_leaf()
770 retval = bin_search(key, item_head(bh, 0), in search_by_key()
860 struct item_head *p_le_ih; /* pointer to on-disk structure */ in search_for_position_by_key()
880 (item_head in search_for_position_by_key()
894 item_head(PATH_PLAST_BUFFE in search_for_position_by_key()
[all...]
H A Dtail_conversion.c31 struct item_head *p_le_ih = tp_item_head(path); in direct2indirect()
41 struct item_head ind_ih; in direct2indirect()
212 struct item_head s_ih; in indirect2direct()
H A Dprints.c116 static int scnprintf_item_head(char *buf, size_t size, struct item_head *ih) in scnprintf_item_head()
234 va_arg(args, struct item_head *)); in prepare_error_buf()
271 * %h to print item_head,
481 struct item_head *ih; in print_leaf()
491 ih = item_head(bh, 0); in print_leaf()
765 struct item_head *ih; in check_leaf()
770 for (i = 0, ih = item_head(bh, 0); i < B_NR_ITEMS(bh); i++, ih++) in check_leaf()
H A Dibalance.c13 int, int, struct item_head *, struct buffer_head **);
128 struct item_head *inserted, in internal_insert_childs()
760 static void replace_lkey(struct tree_balance *tb, int h, struct item_head *key) in replace_lkey()
775 static void replace_rkey(struct tree_balance *tb, int h, struct item_head *key) in replace_rkey()
807 struct item_head *insert_key, in balance_internal()
821 struct item_head new_insert_key; in balance_internal()
823 struct item_head *new_insert_key_addr = insert_key; in balance_internal()
H A Dinode.c137 inline void make_le_item_head(struct item_head *ih, const struct cpu_key *key, in make_le_item_head()
215 struct item_head *ih, in allocation_needed()
226 static inline int indirect_item_found(int retval, struct item_head *ih) in indirect_item_found()
291 struct item_head *ih, tmp_ih; in _get_block_create_0()
659 struct item_head *ih, tmp_ih; in reiserfs_get_block()
1232 struct item_head *ih; in init_inode()
1416 struct item_head *ih; in update_stat_data()
1442 struct item_head *ih, tmp_ih; in reiserfs_update_sd_size()
1790 struct item_head *ih, struct treepath *path, in reiserfs_new_directory()
1853 struct item_head *i in reiserfs_new_symlink()
[all...]
H A Dfix_node.c53 struct item_head *ih; in create_virtual_node()
81 ih = item_head(Sh, 0); in create_virtual_node()
170 && is_direntry_le_ih(item_head(Sh, 0)) in create_virtual_node()
171 && ih_entry_count(item_head(Sh, 0)) == 1)) { in create_virtual_node()
714 struct item_head *ih; in are_leaves_removable()
720 ih = item_head(S0, 0); in are_leaves_removable()
1278 struct item_head *ih; in can_node_be_removed()
1281 ih = item_head(Sh, 0); in can_node_be_removed()
2066 struct item_head *ins_ih, const void *data) in check_balance()
2547 struct item_head *ins_i in fix_nodes()
[all...]
/kernel/linux/linux-5.10/scripts/kconfig/lxdialog/
H A Ddialog.h168 extern struct dialog_list *item_head;
177 for (item_cur = item_head ? item_head: item_cur; \
H A Dutil.c579 struct dialog_list *item_head; variable
585 for (p = item_head; p; p = next) { in item_reset()
589 item_head = NULL; in item_reset()
598 if (item_head) in item_make()
601 item_head = p; in item_make()
661 for (p = item_head; p; p = p->next) in item_count()
679 for (p = item_head; p; p = p->next) { in item_n()
/kernel/linux/linux-6.6/scripts/kconfig/lxdialog/
H A Ddialog.h152 extern struct dialog_list *item_head;
161 for (item_cur = item_head ? item_head: item_cur; \
H A Dutil.c579 struct dialog_list *item_head; variable
585 for (p = item_head; p; p = next) { in item_reset()
589 item_head = NULL; in item_reset()
598 if (item_head) in item_make()
601 item_head = p; in item_make()
661 for (p = item_head; p; p = p->next) in item_count()
679 for (p = item_head; p; p = p->next) { in item_n()

Completed in 44 milliseconds

12