Lines Matching defs:entries
123 struct dx_entry entries[0];
129 struct dx_entry entries[0];
136 struct dx_entry *entries;
151 static unsigned dx_get_count(struct dx_entry *entries);
152 static unsigned dx_get_limit(struct dx_entry *entries);
153 static void dx_set_count(struct dx_entry *entries, unsigned value);
154 static void dx_set_limit(struct dx_entry *entries, unsigned value);
217 static inline unsigned dx_get_count(struct dx_entry *entries)
219 return le16_to_cpu(((struct dx_countlimit *) entries)->count);
222 static inline unsigned dx_get_limit(struct dx_entry *entries)
224 return le16_to_cpu(((struct dx_countlimit *) entries)->limit);
227 static inline void dx_set_count(struct dx_entry *entries, unsigned value)
229 ((struct dx_countlimit *) entries)->count = cpu_to_le16(value);
232 static inline void dx_set_limit(struct dx_entry *entries, unsigned value)
234 ((struct dx_countlimit *) entries)->limit = cpu_to_le16(value);
254 static void dx_show_index(char * label, struct dx_entry *entries)
256 int i, n = dx_get_count (entries);
259 printk("%x->%lu ", i ? dx_get_hash(entries + i) :
260 0, (unsigned long)dx_get_block(entries + i));
303 struct dx_entry *entries, int levels)
306 unsigned count = dx_get_count(entries), names = 0, space = 0, i;
311 for (i = 0; i < count; i++, entries++)
313 ext4_lblk_t block = dx_get_block(entries);
314 ext4_lblk_t hash = i ? dx_get_hash(entries): 0;
315 u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;
320 dx_show_entries(hinfo, dir, ((struct dx_node *) bh->b_data)->entries, levels - 1):
349 struct dx_entry *at, *entries, *p, *q, *m;
392 entries = (struct dx_entry *) (((char *)&root->info) +
395 if (dx_get_limit(entries) != dx_root_limit(dir,
406 count = dx_get_count(entries);
407 if (!count || count > dx_get_limit(entries)) {
415 p = entries + 1;
416 q = entries + count - 1;
430 at = entries;
444 dxtrace(printk(" %x->%u\n", at == entries? 0: dx_get_hash(at), dx_get_block(at)));
446 frame->entries = entries;
451 at = entries = ((struct dx_node *) bh->b_data)->entries;
452 if (dx_get_limit(entries) != dx_node_limit (dir)) {
515 * If we run out of entries in the interior node, loop around and
521 if (++(p->at) < p->entries + dx_get_count(p->entries))
554 p->at = p->entries = ((struct dx_node *) bh->b_data)->entries;
562 * directory block. It returns the number directory entries loaded
617 * This function returns the number of entries inserted into the tree,
685 * Stop if: (a) there are no more entries, or
694 dxtrace(printk(KERN_DEBUG "Fill tree: returned %d entries, "
709 * Returns number of entries mapped.
763 struct dx_entry *entries = frame->entries;
765 int count = dx_get_count(entries);
767 assert(count < dx_get_limit(entries));
768 assert(old < entries + count);
769 memmove(new + 1, new, (char *)(entries + count) - (char *)(new));
772 dx_set_count(entries, count + 1);
1106 * Move count entries from end of map between two memory locations.
1156 * Allocate a new block, and move entries so that they are approx. equally full.
1241 dxtrace(dx_show_index("frame", frame->entries));
1342 struct dx_entry *entries;
1396 entries = root->entries;
1397 dx_set_block(entries, 1);
1398 dx_set_count(entries, 1);
1399 dx_set_limit(entries, dx_root_limit(dir, sizeof(root->info)));
1408 frame->entries = entries;
1409 frame->at = entries;
1492 struct dx_entry *entries, *at;
1503 entries = frame->entries;
1519 dxtrace(printk(KERN_DEBUG "using %u of %u node entries\n",
1520 dx_get_count(entries), dx_get_limit(entries)));
1522 if (dx_get_count(entries) == dx_get_limit(entries)) {
1524 unsigned icount = dx_get_count(entries);
1530 if (levels && (dx_get_count(frames->entries) ==
1531 dx_get_limit(frames->entries))) {
1540 entries2 = node2->entries;
1550 unsigned hash2 = dx_get_hash(entries + icount1);
1560 memcpy((char *) entries2, (char *) (entries + icount1),
1562 dx_set_count(entries, icount1);
1567 if (at - entries >= icount1) {
1568 frame->at = at = at - entries - icount1 + entries2;
1569 frame->entries = entries = entries2;
1573 dxtrace(dx_show_index("node", frames[1].entries));
1575 ((struct dx_node *) bh2->b_data)->entries));
1583 memcpy((char *) entries2, (char *) entries,
1588 dx_set_count(entries, 1);
1589 dx_set_block(entries + 0, newblock);
1594 frame->at = at = at - entries + entries2;
1595 frame->entries = entries = entries2;
1991 * entries can cause panics at unmount time.