Home
last modified time | relevance | path

Searched refs:item_head (Results 1 – 16 of 16) sorted by relevance

/Linux-v4.19/fs/reiserfs/
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()
245 struct item_head *ih; in balance_leaf_when_delete()
254 ih = item_head(tbS0, item_pos); in balance_leaf_when_delete()
290 struct item_head *const ih, in balance_leaf_insert_left()
358 struct item_head * const ih, in balance_leaf_paste_left_shift_dirent()
370 struct item_head *pasted; in balance_leaf_paste_left_shift_dirent()
379 pasted = item_head(tb->L[0], B_NR_ITEMS(tb->L[0]) - 1); in balance_leaf_paste_left_shift_dirent()
420 struct item_head * const ih, in balance_leaf_paste_left_shift()
428 if (is_direntry_le_ih(item_head(tbS0, tb->item_pos))) { in balance_leaf_paste_left_shift()
[all …]
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(dest, 0); in leaf_copy_boundary_item()
[all …]
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 *ih, int block_size) in direntry_bytes_number()
[all …]
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()
393 struct item_head *ih; in is_leaf()
413 ih = (struct item_head *)(buf + BLKH_SIZE) + nr - 1; in is_leaf()
428 ih = (struct item_head *)(buf + BLKH_SIZE); in is_leaf()
747 retval = bin_search(key, item_head(bh, 0), in search_by_key()
837 struct item_head *p_le_ih; /* pointer to on-disk structure */ in search_for_position_by_key()
857 (item_head in search_for_position_by_key()
871 item_head(PATH_PLAST_BUFFER(search_path), in search_for_position_by_key()
907 int comp_items(const struct item_head *stored_ih, const struct treepath *path) in comp_items()
[all …]
Dreiserfs.h1359 struct item_head { struct
1394 #define IH_SIZE (sizeof(struct item_head)) argument
1480 static inline loff_t le_ih_k_offset(const struct item_head *ih) in le_ih_k_offset()
1494 static inline loff_t le_ih_k_type(const struct item_head *ih) in le_ih_k_type()
1515 static inline void add_le_ih_k_offset(struct item_head *ih, loff_t offset) in add_le_ih_k_offset()
1520 static inline void set_le_ih_k_offset(struct item_head *ih, loff_t offset) in set_le_ih_k_offset()
1535 static inline void set_le_ih_k_type(struct item_head *ih, int type) in set_le_ih_k_type()
1561 static inline int is_direntry_le_ih(struct item_head *ih) in is_direntry_le_ih()
1566 static inline int is_direct_le_ih(struct item_head *ih) in is_direct_le_ih()
1571 static inline int is_indirect_le_ih(struct item_head *ih) in is_indirect_le_ih()
[all …]
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()
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()
481 struct item_head *ih; in print_leaf()
491 ih = item_head(bh, 0); in print_leaf()
768 struct item_head *ih; in check_leaf()
773 for (i = 0, ih = item_head(bh, 0); i < B_NR_ITEMS(bh); i++, ih++) in check_leaf()
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()
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()
1242 struct item_head *ih; in init_inode()
1428 struct item_head *ih; in update_stat_data()
1454 struct item_head *ih, tmp_ih; in reiserfs_update_sd_size()
1806 struct item_head *ih, struct treepath *path, in reiserfs_new_directory()
1869 struct item_head *ih, in reiserfs_new_symlink()
[all …]
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()
716 struct item_head *ih; in are_leaves_removable()
722 ih = item_head(S0, 0); in are_leaves_removable()
1280 struct item_head *ih; in can_node_be_removed()
1283 ih = item_head(Sh, 0); in can_node_be_removed()
2070 struct item_head *ins_ih, const void *data) in check_balance()
2550 struct item_head *ins_ih, const void *data) in fix_nodes()
Ddir.c70 struct item_head *ih, tmp_ih; in reiserfs_readdir_inode()
Dnamei.c31 struct item_head *ih = de->de_ih; in bin_search_in_dir_item()
1312 struct item_head new_entry_ih, old_entry_ih, dot_dot_ih; in reiserfs_rename()
Dsuper.c231 struct item_head *ih; in finish_unfinished()
301 ih = item_head(bh, item_pos); in finish_unfinished()
435 struct item_head ih; in add_save_link()
Dbitmap.c858 struct item_head *ih; in get_left_neighbor()
/Linux-v4.19/scripts/kconfig/lxdialog/
Ddialog.h181 extern struct dialog_list *item_head;
190 for (item_cur = item_head ? item_head: item_cur; \
Dutil.c592 struct dialog_list *item_head; variable
598 for (p = item_head; p; p = next) { in item_reset()
602 item_head = NULL; in item_reset()
611 if (item_head) in item_make()
614 item_head = p; in item_make()
674 for (p = item_head; p; p = p->next) in item_count()
692 for (p = item_head; p; p = p->next) { in item_n()