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

/linux-4.4.14/fs/reiserfs/
H A Ddir.c53 static inline bool is_privroot_deh(struct inode *dir, struct reiserfs_de_head *deh) is_privroot_deh() argument
57 deh->deh_objectid == INODE_PKEY(d_inode(privroot))->k_objectid); is_privroot_deh()
136 struct reiserfs_de_head *deh = reiserfs_readdir_inode() local
140 entry_num++, deh++) { reiserfs_readdir_inode()
144 loff_t cur_pos = deh_offset(deh); reiserfs_readdir_inode()
147 if (!de_visible(deh)) reiserfs_readdir_inode()
150 d_name = B_I_DEH_ENTRY_FILE_NAME(bh, ih, deh); reiserfs_readdir_inode()
174 if (is_privroot_deh(inode, deh)) reiserfs_readdir_inode()
177 ctx->pos = deh_offset(deh); reiserfs_readdir_inode()
178 d_ino = deh_objectid(deh); reiserfs_readdir_inode()
223 /* deh_offset(deh) may be invalid now. */ reiserfs_readdir_inode()
H A Dlbalance.c27 struct reiserfs_de_head *deh; leaf_copy_dir_entries() local
39 deh = B_I_DEH(source, ih); leaf_copy_dir_entries()
41 copy_records_len = (from ? deh_location(&deh[from - 1]) : leaf_copy_dir_entries()
43 deh_location(&deh[from + copy_count - 1]); leaf_copy_dir_entries()
46 deh_location(&deh[from + copy_count - 1]); leaf_copy_dir_entries()
84 deh_offset(&deh[from])); leaf_copy_dir_entries()
123 : 0, copy_count, deh + from, records, leaf_copy_dir_entries()
1076 struct reiserfs_de_head *deh; leaf_cut_entries() local
1098 deh = B_I_DEH(bh, ih); leaf_cut_entries()
1105 (from ? deh_location(&deh[from - 1]) : ih_item_len(ih)); leaf_cut_entries()
1107 deh_location(&deh[from + del_count - 1]); leaf_cut_entries()
1112 put_deh_location(&deh[i], leaf_cut_entries()
1113 deh_location(&deh[i]) - leaf_cut_entries()
1117 put_deh_location(&deh[i], leaf_cut_entries()
1118 deh_location(&deh[i]) - (DEH_SIZE * del_count + leaf_cut_entries()
1124 memmove((char *)(deh + from), leaf_cut_entries()
1125 deh + from + del_count, leaf_cut_entries()
1126 prev_record - cut_records_len - (char *)(deh + from + leaf_cut_entries()
1323 struct reiserfs_de_head *deh; leaf_paste_entries() local
1346 deh = B_I_DEH(bh, ih); leaf_paste_entries()
1351 (before ? deh_location(&deh[before - 1]) leaf_paste_entries()
1356 put_deh_location(&deh[i], leaf_paste_entries()
1357 deh_location(&deh[i]) + leaf_paste_entries()
1362 put_deh_location(&deh[i], leaf_paste_entries()
1363 deh_location(&deh[i]) + paste_size); leaf_paste_entries()
1377 deh += before; leaf_paste_entries()
1378 memmove((char *)(deh + new_entry_count), deh, leaf_paste_entries()
1379 insert_point - (char *)deh); leaf_paste_entries()
1382 deh = (struct reiserfs_de_head *)((char *)deh); leaf_paste_entries()
1383 memcpy(deh, new_dehs, DEH_SIZE * new_entry_count); leaf_paste_entries()
1387 put_deh_location(&deh[i], leaf_paste_entries()
1388 deh_location(&deh[i]) + leaf_paste_entries()
1403 deh = B_I_DEH(bh, ih); leaf_paste_entries()
1408 1) ? deh_location(&deh[i + 1]) : 0; leaf_paste_entries()
1409 prev = (i != 0) ? deh_location(&deh[i - 1]) : 0; leaf_paste_entries()
1411 if (prev && prev <= deh_location(&deh[i])) leaf_paste_entries()
1416 ih, deh + i - 1, i, deh + i); leaf_paste_entries()
1417 if (next && next >= deh_location(&deh[i])) leaf_paste_entries()
1422 ih, i, deh + i, deh + i + 1); leaf_paste_entries()
H A Ditem_ops.c384 struct reiserfs_de_head *deh; direntry_print_item() local
391 deh = (struct reiserfs_de_head *)item; direntry_print_item()
393 for (i = 0; i < ih_entry_count(ih); i++, deh++) { direntry_print_item()
395 (i ? (deh_location(deh - 1)) : ih_item_len(ih)) - direntry_print_item()
396 deh_location(deh); direntry_print_item()
397 name = item + deh_location(deh); direntry_print_item()
413 deh_dir_id(deh), deh_objectid(deh), direntry_print_item()
414 GET_HASH_VALUE(deh_offset(deh)), direntry_print_item()
415 GET_GENERATION_NUMBER((deh_offset(deh))), direntry_print_item()
416 (de_hidden(deh)) ? "HIDDEN" : "VISIBLE"); direntry_print_item()
423 struct reiserfs_de_head *deh; direntry_check_item() local
426 deh = (struct reiserfs_de_head *)item; direntry_check_item()
427 for (i = 0; i < ih_entry_count(ih); i++, deh++) { direntry_check_item()
473 struct reiserfs_de_head *deh; direntry_create_vi() local
483 deh = (struct reiserfs_de_head *)(vi->vi_item); direntry_create_vi()
494 (j ? deh_location(&deh[j - 1]) : ih_item_len(vi->vi_ih)) - direntry_create_vi()
495 deh_location(&deh[j]) + DEH_SIZE; direntry_create_vi()
H A Dnamei.c32 struct reiserfs_de_head *deh = de->de_deh; bin_search_in_dir_item() local
40 if (off < deh_offset(deh + j)) { bin_search_in_dir_item()
44 if (off > deh_offset(deh + j)) { bin_search_in_dir_item()
74 struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num; set_de_name_and_namelen() local
79 de->de_namelen = de->de_entrylen - (de_with_sd(deh) ? SD_SIZE : 0); set_de_name_and_namelen()
80 de->de_name = ih_item_body(de->de_bh, de->de_ih) + deh_location(deh); set_de_name_and_namelen()
95 struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num; store_de_entry_key() local
105 set_cpu_key_k_offset(&de->de_entry_key, deh_offset(deh)); store_de_entry_key()
230 struct reiserfs_de_head *deh = de->de_deh; linear_search_in_dir_item() local
237 GET_HASH_VALUE(deh_offset(deh + i)) != linear_search_in_dir_item()
245 deh += i; linear_search_in_dir_item()
247 for (; i >= 0; i--, deh--) { linear_search_in_dir_item()
249 if (GET_HASH_VALUE(deh_offset(deh)) != linear_search_in_dir_item()
256 set_bit(GET_GENERATION_NUMBER(deh_offset(deh)), linear_search_in_dir_item()
434 struct reiserfs_de_head *deh; reiserfs_add_entry() local
481 deh = (struct reiserfs_de_head *)buffer; reiserfs_add_entry()
482 deh->deh_location = 0; /* JDM Endian safe if 0 */ reiserfs_add_entry()
483 put_deh_offset(deh, cpu_key_k_offset(&entry_key)); reiserfs_add_entry()
484 deh->deh_state = 0; /* JDM Endian safe if 0 */ reiserfs_add_entry()
488 deh->deh_dir_id = INODE_PKEY(inode)->k_dir_id; reiserfs_add_entry()
490 deh->deh_objectid = INODE_PKEY(inode)->k_objectid; reiserfs_add_entry()
493 memcpy((char *)(deh + 1), name, namelen); reiserfs_add_entry()
495 padd_item((char *)(deh + 1), ROUND_UP(namelen), namelen); reiserfs_add_entry()
501 mark_de_without_sd(deh); reiserfs_add_entry()
502 visible ? mark_de_visible(deh) : mark_de_hidden(deh); reiserfs_add_entry()
540 put_deh_offset(deh, SET_GENERATION_NUMBER(deh_offset(deh), gen_number)); reiserfs_add_entry()
541 set_cpu_key_k_offset(&entry_key, deh_offset(deh)); reiserfs_add_entry()
H A Dprints.c100 static void sprintf_de_head(char *buf, struct reiserfs_de_head *deh) sprintf_de_head() argument
102 if (deh) sprintf_de_head()
105 deh_offset(deh), deh_dir_id(deh), deh_objectid(deh), sprintf_de_head()
106 deh_location(deh), deh_state(deh)); sprintf_de_head()
H A Dreiserfs.h1957 #define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1958 #define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1959 #define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1960 #define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1962 #define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1963 #define de_visible(deh) test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1964 #define de_hidden(deh) !test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
2004 #define B_I_DEH_ENTRY_FILE_NAME(bh, ih, deh) \
2005 (ih_item_body(bh, ih) + deh_location(deh))
2008 #define I_DEH_N_ENTRY_FILE_NAME_LENGTH(ih,deh,entry_num) \
2009 (I_DEH_N_ENTRY_LENGTH (ih, deh, entry_num) - (de_with_sd (deh) ? SD_SIZE : 0))
2254 struct reiserfs_de_head *deh; entry_length() local
2256 deh = B_I_DEH(bh, ih) + pos_in_item; entry_length()
2258 return deh_location(deh - 1) - deh_location(deh); entry_length()
2260 return ih_item_len(ih) - deh_location(deh); entry_length()
H A Dsuper.c1688 struct reiserfs_de_head *deh; find_hash_out() local
1704 deh = de.de_deh + de.de_entry_num; find_hash_out()
1706 if (deh_offset(deh) == DOT_DOT_OFFSET) { find_hash_out()
1714 deh_hashval = GET_HASH_VALUE(deh_offset(deh)); find_hash_out()

Completed in 165 milliseconds