Lines Matching defs:entries
124 struct dx_entry entries[0];
130 struct dx_entry entries[0];
137 struct dx_entry *entries;
152 static unsigned dx_get_count (struct dx_entry *entries);
153 static unsigned dx_get_limit (struct dx_entry *entries);
154 static void dx_set_count (struct dx_entry *entries, unsigned value);
155 static void dx_set_limit (struct dx_entry *entries, unsigned value);
216 static inline unsigned dx_get_count (struct dx_entry *entries)
218 return le16_to_cpu(((struct dx_countlimit *) entries)->count);
221 static inline unsigned dx_get_limit (struct dx_entry *entries)
223 return le16_to_cpu(((struct dx_countlimit *) entries)->limit);
226 static inline void dx_set_count (struct dx_entry *entries, unsigned value)
228 ((struct dx_countlimit *) entries)->count = cpu_to_le16(value);
231 static inline void dx_set_limit (struct dx_entry *entries, unsigned value)
233 ((struct dx_countlimit *) entries)->limit = cpu_to_le16(value);
253 static void dx_show_index (char * label, struct dx_entry *entries)
255 int i, n = dx_get_count (entries);
259 printk("%x->%u ", i? dx_get_hash(entries + i): 0, dx_get_block(entries + i));
302 struct dx_entry *entries, int levels)
305 unsigned count = dx_get_count (entries), names = 0, space = 0, i;
310 for (i = 0; i < count; i++, entries++)
312 u32 block = dx_get_block(entries), hash = i? dx_get_hash(entries): 0;
313 u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;
318 dx_show_entries(hinfo, dir, ((struct dx_node *) bh->b_data)->entries, levels - 1):
346 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,
407 count = dx_get_count(entries);
408 if (!count || count > dx_get_limit(entries)) {
416 p = entries + 1;
417 q = entries + count - 1;
431 at = entries;
445 dxtrace(printk(" %x->%u\n", at == entries? 0: dx_get_hash(at), dx_get_block(at)));
447 frame->entries = entries;
452 at = entries = ((struct dx_node *) bh->b_data)->entries;
453 if (dx_get_limit(entries) != dx_node_limit (dir)) {
516 * If we run out of entries in the interior node, loop around and
522 if (++(p->at) < p->entries + dx_get_count(p->entries))
555 p->at = p->entries = ((struct dx_node *) bh->b_data)->entries;
563 * 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("Fill tree: returned %d entries, next hash: %x\n",
709 * Returns number of entries mapped.
765 struct dx_entry *entries = frame->entries;
767 int count = dx_get_count(entries);
769 assert(count < dx_get_limit(entries));
770 assert(old < entries + count);
771 memmove(new + 1, new, (char *)(entries + count) - (char *)(new));
774 dx_set_count(entries, count + 1);
1105 * Move count entries from end of map between two memory locations.
1154 * Allocate a new block, and move entries so that they are approx. equally full.
1236 dxtrace(dx_show_index ("frame", frame->entries));
1347 struct dx_entry *entries;
1400 entries = root->entries;
1401 dx_set_block (entries, 1);
1402 dx_set_count (entries, 1);
1403 dx_set_limit (entries, dx_root_limit(dir, sizeof(root->info)));
1412 frame->entries = entries;
1413 frame->at = entries;
1488 struct dx_entry *entries, *at;
1499 entries = frame->entries;
1517 dxtrace(printk("using %u of %u node entries\n",
1518 dx_get_count(entries), dx_get_limit(entries)));
1520 if (dx_get_count(entries) == dx_get_limit(entries)) {
1522 unsigned icount = dx_get_count(entries);
1528 if (levels && (dx_get_count(frames->entries) ==
1529 dx_get_limit(frames->entries))) {
1539 entries2 = node2->entries;
1548 unsigned hash2 = dx_get_hash(entries + icount1);
1557 memcpy ((char *) entries2, (char *) (entries + icount1),
1559 dx_set_count (entries, icount1);
1564 if (at - entries >= icount1) {
1565 frame->at = at = at - entries - icount1 + entries2;
1566 frame->entries = entries = entries2;
1570 dxtrace(dx_show_index ("node", frames[1].entries));
1572 ((struct dx_node *) bh2->b_data)->entries));
1579 memcpy((char *) entries2, (char *) entries,
1584 dx_set_count(entries, 1);
1585 dx_set_block(entries + 0, newblock);
1590 frame->at = at = at - entries + entries2;
1591 frame->entries = entries = entries2;
1947 * entries can cause panics at unmount time.