Home
last modified time | relevance | path

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

/kernel/linux/linux-5.10/fs/reiserfs/
H A Dlbalance.c27 struct reiserfs_de_head *deh; in leaf_copy_dir_entries() local
39 deh = B_I_DEH(source, ih); in leaf_copy_dir_entries()
41 copy_records_len = (from ? deh_location(&deh[from - 1]) : in leaf_copy_dir_entries()
43 deh_location(&deh[from + copy_count - 1]); in leaf_copy_dir_entries()
46 deh_location(&deh[from + copy_count - 1]); in leaf_copy_dir_entries()
84 deh_offset(&deh[from])); in leaf_copy_dir_entries()
123 : 0, copy_count, deh + from, records, in leaf_copy_dir_entries()
1076 struct reiserfs_de_head *deh; in leaf_cut_entries() local
1098 deh = B_I_DEH(bh, ih); in leaf_cut_entries()
1105 (from ? deh_location(&deh[fro in leaf_cut_entries()
1323 struct reiserfs_de_head *deh; leaf_paste_entries() local
[all...]
H A Ditem_ops.c376 struct reiserfs_de_head *deh; in direntry_print_item() local
383 deh = (struct reiserfs_de_head *)item; in direntry_print_item()
385 for (i = 0; i < ih_entry_count(ih); i++, deh++) { in direntry_print_item()
387 (i ? (deh_location(deh - 1)) : ih_item_len(ih)) - in direntry_print_item()
388 deh_location(deh); in direntry_print_item()
389 name = item + deh_location(deh); in direntry_print_item()
405 deh_dir_id(deh), deh_objectid(deh), in direntry_print_item()
406 GET_HASH_VALUE(deh_offset(deh)), in direntry_print_item()
407 GET_GENERATION_NUMBER((deh_offset(deh))), in direntry_print_item()
415 struct reiserfs_de_head *deh; direntry_check_item() local
465 struct reiserfs_de_head *deh; direntry_create_vi() local
[all...]
H A Ddir.c53 static inline bool is_privroot_deh(struct inode *dir, struct reiserfs_de_head *deh) in is_privroot_deh() argument
57 deh->deh_objectid == INODE_PKEY(d_inode(privroot))->k_objectid); in is_privroot_deh()
136 struct reiserfs_de_head *deh = in reiserfs_readdir_inode() local
140 entry_num++, deh++) { in reiserfs_readdir_inode()
144 loff_t cur_pos = deh_offset(deh); in reiserfs_readdir_inode()
147 if (!de_visible(deh)) in reiserfs_readdir_inode()
150 d_name = B_I_DEH_ENTRY_FILE_NAME(bh, ih, deh); in reiserfs_readdir_inode()
174 if (is_privroot_deh(inode, deh)) in reiserfs_readdir_inode()
177 ctx->pos = deh_offset(deh); in reiserfs_readdir_inode()
178 d_ino = deh_objectid(deh); in reiserfs_readdir_inode()
[all...]
H A Dnamei.c32 struct reiserfs_de_head *deh = de->de_deh; in bin_search_in_dir_item() local
40 if (off < deh_offset(deh + j)) { in bin_search_in_dir_item()
44 if (off > deh_offset(deh + j)) { in bin_search_in_dir_item()
74 struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num; in set_de_name_and_namelen() local
79 de->de_namelen = de->de_entrylen - (de_with_sd(deh) ? SD_SIZE : 0); in set_de_name_and_namelen()
80 de->de_name = ih_item_body(de->de_bh, de->de_ih) + deh_location(deh); in set_de_name_and_namelen()
95 struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num; in store_de_entry_key() local
105 set_cpu_key_k_offset(&de->de_entry_key, deh_offset(deh)); in store_de_entry_key()
230 struct reiserfs_de_head *deh = de->de_deh; in linear_search_in_dir_item() local
237 GET_HASH_VALUE(deh_offset(deh in linear_search_in_dir_item()
437 struct reiserfs_de_head *deh; reiserfs_add_entry() local
[all...]
H A Dprints.c103 struct reiserfs_de_head *deh) in scnprintf_de_head()
105 if (deh) in scnprintf_de_head()
108 deh_offset(deh), deh_dir_id(deh), in scnprintf_de_head()
109 deh_objectid(deh), deh_location(deh), in scnprintf_de_head()
110 deh_state(deh)); in scnprintf_de_head()
102 scnprintf_de_head(char *buf, size_t size, struct reiserfs_de_head *deh) scnprintf_de_head() argument
H A Dreiserfs.h1959 #define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1960 #define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1961 #define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1962 #define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1964 #define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)
2256 struct reiserfs_de_head *deh; entry_length() local
[all...]
H A Dsuper.c1731 struct reiserfs_de_head *deh; in find_hash_out() local
1747 deh = de.de_deh + de.de_entry_num; in find_hash_out()
1749 if (deh_offset(deh) == DOT_DOT_OFFSET) { in find_hash_out()
1757 deh_hashval = GET_HASH_VALUE(deh_offset(deh)); in find_hash_out()
H A Dstree.c392 struct reiserfs_de_head *deh; in has_valid_deh_location() local
395 deh = B_I_DEH(bh, ih); in has_valid_deh_location()
397 if (deh_location(&deh[i]) > ih_item_len(ih)) { in has_valid_deh_location()
400 &deh[i]); in has_valid_deh_location()
/kernel/linux/linux-6.6/fs/reiserfs/
H A Dlbalance.c27 struct reiserfs_de_head *deh; in leaf_copy_dir_entries() local
39 deh = B_I_DEH(source, ih); in leaf_copy_dir_entries()
41 copy_records_len = (from ? deh_location(&deh[from - 1]) : in leaf_copy_dir_entries()
43 deh_location(&deh[from + copy_count - 1]); in leaf_copy_dir_entries()
46 deh_location(&deh[from + copy_count - 1]); in leaf_copy_dir_entries()
84 deh_offset(&deh[from])); in leaf_copy_dir_entries()
123 : 0, copy_count, deh + from, records, in leaf_copy_dir_entries()
1076 struct reiserfs_de_head *deh; in leaf_cut_entries() local
1098 deh = B_I_DEH(bh, ih); in leaf_cut_entries()
1105 (from ? deh_location(&deh[fro in leaf_cut_entries()
1323 struct reiserfs_de_head *deh; leaf_paste_entries() local
[all...]
H A Ditem_ops.c376 struct reiserfs_de_head *deh; in direntry_print_item() local
383 deh = (struct reiserfs_de_head *)item; in direntry_print_item()
385 for (i = 0; i < ih_entry_count(ih); i++, deh++) { in direntry_print_item()
387 (i ? (deh_location(deh - 1)) : ih_item_len(ih)) - in direntry_print_item()
388 deh_location(deh); in direntry_print_item()
389 name = item + deh_location(deh); in direntry_print_item()
405 deh_dir_id(deh), deh_objectid(deh), in direntry_print_item()
406 GET_HASH_VALUE(deh_offset(deh)), in direntry_print_item()
407 GET_GENERATION_NUMBER((deh_offset(deh))), in direntry_print_item()
415 struct reiserfs_de_head *deh; direntry_check_item() local
465 struct reiserfs_de_head *deh; direntry_create_vi() local
[all...]
H A Ddir.c53 static inline bool is_privroot_deh(struct inode *dir, struct reiserfs_de_head *deh) in is_privroot_deh() argument
57 deh->deh_objectid == INODE_PKEY(d_inode(privroot))->k_objectid); in is_privroot_deh()
136 struct reiserfs_de_head *deh = in reiserfs_readdir_inode() local
140 entry_num++, deh++) { in reiserfs_readdir_inode()
144 loff_t cur_pos = deh_offset(deh); in reiserfs_readdir_inode()
147 if (!de_visible(deh)) in reiserfs_readdir_inode()
150 d_name = B_I_DEH_ENTRY_FILE_NAME(bh, ih, deh); in reiserfs_readdir_inode()
174 if (is_privroot_deh(inode, deh)) in reiserfs_readdir_inode()
177 ctx->pos = deh_offset(deh); in reiserfs_readdir_inode()
178 d_ino = deh_objectid(deh); in reiserfs_readdir_inode()
[all...]
H A Dnamei.c32 struct reiserfs_de_head *deh = de->de_deh; in bin_search_in_dir_item() local
40 if (off < deh_offset(deh + j)) { in bin_search_in_dir_item()
44 if (off > deh_offset(deh + j)) { in bin_search_in_dir_item()
74 struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num; in set_de_name_and_namelen() local
79 de->de_namelen = de->de_entrylen - (de_with_sd(deh) ? SD_SIZE : 0); in set_de_name_and_namelen()
80 de->de_name = ih_item_body(de->de_bh, de->de_ih) + deh_location(deh); in set_de_name_and_namelen()
95 struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num; in store_de_entry_key() local
105 set_cpu_key_k_offset(&de->de_entry_key, deh_offset(deh)); in store_de_entry_key()
231 struct reiserfs_de_head *deh = de->de_deh; in linear_search_in_dir_item() local
238 GET_HASH_VALUE(deh_offset(deh in linear_search_in_dir_item()
436 struct reiserfs_de_head *deh; reiserfs_add_entry() local
[all...]
H A Dprints.c103 struct reiserfs_de_head *deh) in scnprintf_de_head()
105 if (deh) in scnprintf_de_head()
108 deh_offset(deh), deh_dir_id(deh), in scnprintf_de_head()
109 deh_objectid(deh), deh_location(deh), in scnprintf_de_head()
110 deh_state(deh)); in scnprintf_de_head()
102 scnprintf_de_head(char *buf, size_t size, struct reiserfs_de_head *deh) scnprintf_de_head() argument
H A Dreiserfs.h1956 #define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1957 #define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1958 #define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1959 #define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1961 #define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)
2253 struct reiserfs_de_head *deh; entry_length() local
[all...]
H A Dsuper.c1729 struct reiserfs_de_head *deh; in find_hash_out() local
1745 deh = de.de_deh + de.de_entry_num; in find_hash_out()
1747 if (deh_offset(deh) == DOT_DOT_OFFSET) { in find_hash_out()
1755 deh_hashval = GET_HASH_VALUE(deh_offset(deh)); in find_hash_out()
H A Dstree.c392 struct reiserfs_de_head *deh; in has_valid_deh_location() local
395 deh = B_I_DEH(bh, ih); in has_valid_deh_location()
397 if (deh_location(&deh[i]) > ih_item_len(ih)) { in has_valid_deh_location()
400 &deh[i]); in has_valid_deh_location()

Completed in 34 milliseconds