Lines Matching defs:dx_entry

235 struct dx_entry
262 	struct dx_entry	entries[];
268 	struct dx_entry	entries[];
275 	struct dx_entry *entries;
276 	struct dx_entry *at;
450 	size = count_offset + (count * sizeof(struct dx_entry));
475 	if (count_offset + (limit * sizeof(struct dx_entry)) >
480 	t = (struct dx_tail *)(((struct dx_entry *)c) + limit);
504 	if (count_offset + (limit * sizeof(struct dx_entry)) >
509 	t = (struct dx_tail *)(((struct dx_entry *)c) + limit);
537 static inline ext4_lblk_t dx_get_block(struct dx_entry *entry)
542 static inline void dx_set_block(struct dx_entry *entry, ext4_lblk_t value)
547 static inline unsigned dx_get_hash(struct dx_entry *entry)
552 static inline void dx_set_hash(struct dx_entry *entry, unsigned value)
557 static inline unsigned dx_get_count(struct dx_entry *entries)
562 static inline unsigned dx_get_limit(struct dx_entry *entries)
567 static inline void dx_set_count(struct dx_entry *entries, unsigned value)
572 static inline void dx_set_limit(struct dx_entry *entries, unsigned value)
585 	return entry_space / sizeof(struct dx_entry);
595 	return entry_space / sizeof(struct dx_entry);
602 static void dx_show_index(char * label, struct dx_entry *entries)
711 			     struct dx_entry *entries, int levels)
747 static inline void htree_rep_invariant_check(struct dx_entry *at,
748 					     struct dx_entry *target,
761 static inline void htree_rep_invariant_check(struct dx_entry *at,
762 					     struct dx_entry *target,
782 	struct dx_entry *at, *entries, *p, *q, *m;
854 	entries = (struct dx_entry *)(((char *)&root->info) +
1349 	struct dx_entry *entries = frame->entries;
1350 	struct dx_entry *old = frame->at, *new = old + 1;
2216 	struct dx_entry *entries;
2470 	struct dx_entry *entries, *at;
2510 		struct dx_entry *entries2;
2571 			       icount2 * sizeof(struct dx_entry));
2603 			       icount * sizeof(struct dx_entry));