Lines Matching refs:entries
566 * Copy out entries of shortform attribute lists for attr_list().
569 * we have to calculate each entries' hashvalue and sort them before
643 * Scan the attribute list for the rest of the entries, storing
671 * Sort the entries on hash then entno.
697 * Loop putting entries into the user buffer.
722 * Check a leaf attribute block to see if all the entries would fit into
736 entry = &leaf->entries[0];
740 continue; /* don't copy partial entries */
810 entry = &leaf->entries[0];
813 continue; /* don't copy partial entries */
878 leaf->entries[be16_to_cpu(leaf->hdr.count)-1 ].hashval;
960 * Rebalance the entries across the two leaves.
1041 * Compact the entries to coalesce free space.
1042 * This may change the hdr->count via dropping INCOMPLETE entries.
1081 entry = &leaf->entries[args->index];
1231 * Redistribute the attribute list entries between two leaf nodes,
1282 * Examine entries until we reduce the absolute difference in
1295 * Move any entries required from leaf to leaf:
1301 /* number entries being moved */
1317 * Move high entries from leaf1 to low end of leaf2.
1333 /* number entries being moved */
1349 * Move low entries from leaf2 to high end of leaf1.
1362 leaf1->entries[be16_to_cpu(leaf1->hdr.count)-1].hashval);
1364 leaf2->entries[be16_to_cpu(leaf2->hdr.count)-1].hashval);
1403 * Examine entries until we reduce the absolute difference in
1432 * Examine entries until we reduce the absolute difference in
1445 entry = &leaf1->entries[0];
1470 entry = &leaf1->entries[0];
1517 * GROT: allow for INCOMPLETE entries in calculation.
1662 entry = &leaf->entries[args->index];
1741 * Compress the remaining entries and zero out the removed stuff.
1755 entry = &leaf->entries[be16_to_cpu(hdr->count)];
1766 entry = &leaf->entries[0];
1797 * Move all the attribute list entries from drop_leaf into save_leaf.
1825 drop_leaf->entries[be16_to_cpu(drop_leaf->hdr.count)-1].hashval);
1887 save_leaf->entries[be16_to_cpu(save_leaf->hdr.count)-1].hashval);
1927 for (entry = &leaf->entries[probe]; span > 4;
1928 entry = &leaf->entries[probe]) {
1968 * GROT: Add code to remove incomplete entries.
1971 * If we are looking for INCOMPLETE entries, show only those.
1972 * If we are looking for complete entries, show only those.
2027 entry = &leaf->entries[args->index];
2068 * Move the indicated entries from one leaf to another.
2109 * Move the entries in the destination leaf up to make a hole?
2114 entry_s = &leaf_d->entries[start_d];
2115 entry_d = &leaf_d->entries[start_d + count];
2123 entry_s = &leaf_s->entries[start_s];
2124 entry_d = &leaf_d->entries[start_d];
2132 * Code to drop INCOMPLETE entries. Difficult to use as we
2173 * Zero out the entries we just copied.
2177 entry_s = &leaf_s->entries[start_s];
2183 * Move the remaining entries down to fill the hole,
2184 * then zero the entries at the top.
2188 entry_s = &leaf_s->entries[start_s + count];
2189 entry_d = &leaf_s->entries[start_s];
2193 entry_s = &leaf_s->entries[be16_to_cpu(hdr_s->count)];
2229 ((be32_to_cpu(leaf2->entries[0].hashval) <
2230 be32_to_cpu(leaf1->entries[0].hashval)) ||
2231 (be32_to_cpu(leaf2->entries[
2233 be32_to_cpu(leaf1->entries[
2254 return be32_to_cpu(leaf->entries[be16_to_cpu(leaf->hdr.count)-1].hashval);
2269 if (leaf->entries[index].flags & XFS_ATTR_LOCAL) {
2306 * Copy out attribute list entries for attr_list(), for leaf attribute lists.
2327 entry = &leaf->entries[0];
2346 entry = &leaf->entries[0];
2362 continue; /* skip incomplete entries */
2457 entry = &leaf->entries[ args->index ];
2521 entry = &leaf->entries[ args->index ];
2591 entry1 = &leaf1->entries[ args->index ];
2597 entry2 = &leaf2->entries[ args->index2 ];
2845 entry = &leaf->entries[0];
2873 entry = &leaf->entries[0];