Lines Matching defs:index
75 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
987 error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */
1377 * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the
1418 ASSERT(args->index >= 0 && args->index <= ichdr.count);
1499 ASSERT(args->index >= 0 && args->index <= ichdr->count);
1504 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
1505 if (args->index < ichdr->count) {
1506 tmp = ichdr->count - args->index;
1537 (args->index2 <= args->index)) {
1543 ASSERT((args->index == 0) ||
1545 ASSERT((args->index == ichdr->count - 1) ||
1556 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
1563 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
1575 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
1576 xfs_attr_leaf_entsize(leaf, args->index)));
1597 ichdr->usedbytes += xfs_attr_leaf_entsize(leaf, args->index);
1706 * This code adjusts the args->index/blkno and args->index2/blkno2 fields
1846 * Adjust the expected index for insertion.
1851 * the index. We must also track the entry just following the
1854 * inserting. The index/blkno fields refer to the "old" entry,
1857 if (blk1->index > ichdr1.count) {
1859 blk2->index = blk1->index - ichdr1.count;
1860 args->index = args->index2 = blk2->index;
1862 } else if (blk1->index == ichdr1.count) {
1864 args->index = blk1->index;
1874 blk2->index = blk1->index - ichdr1.count;
1875 args->index = blk2->index;
1883 args->index2 = blk2->index;
1889 args->index = args->index2 = blk1->index;
1916 int index;
1934 for (count = index = 0; count < max; entry++, index++, count++) {
1940 if (count == blk1->index) {
1956 index = 0;
1963 index);
2150 ASSERT(args->index >= 0 && args->index < ichdr.count);
2154 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2170 entsize = xfs_attr_leaf_entsize(leaf, args->index);
2228 memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize);
2231 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
2234 tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t);
2400 * Return in args->index the index into the entry[] array of either
2468 args->index = probe;
2485 args->index = probe;
2492 args->index = probe;
2501 args->index = probe;
2527 ASSERT(args->index < ichdr.count);
2529 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2531 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
2539 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2623 * may also need to change the insertion index. Code turned
2633 result++; /* insertion index adjustment */
2725 xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index)
2733 if (entries[index].flags & XFS_ATTR_LOCAL) {
2734 name_loc = xfs_attr3_leaf_name_local(leaf, index);
2738 name_rmt = xfs_attr3_leaf_name_remote(leaf, index);
2801 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2806 ASSERT(args->index < ichdr.count);
2807 ASSERT(args->index >= 0);
2810 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
2814 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2829 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2867 ASSERT(args->index < ichdr.count);
2868 ASSERT(args->index >= 0);
2870 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2877 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2889 * given by args->blkno/index and set the INCOMPLETE flag on the leaf
2936 entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index];
2943 ASSERT(args->index < ichdr1.count);
2944 ASSERT(args->index >= 0);
2951 name_loc = xfs_attr3_leaf_name_local(leaf1, args->index);
2955 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
2981 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);