Lines Matching refs:index
45 static int xfs_dir2_leafn_add(xfs_dabuf_t *bp, xfs_da_args_t *args, int index);
58 int index, xfs_da_state_blk_t *dblk,
115 int i; /* leaf freespace index */
185 int index) /* insertion pt for new entry */
198 trace_xfs_dir2_leafn_add(args, index);
206 * Quick check just to make sure we are not going to index
209 if (index < 0)
225 ASSERT(index == 0 || be32_to_cpu(leaf->ents[index - 1].hashval) <= args->hashval);
226 ASSERT(index == be16_to_cpu(leaf->hdr.count) ||
227 be32_to_cpu(leaf->ents[index].hashval) >= args->hashval);
234 * the entry closest to index.
237 xfs_dir2_leaf_compact_x1(bp, &index, &lowstale, &highstale,
251 lep = &leaf->ents[index];
252 if (index < be16_to_cpu(leaf->hdr.count))
254 (be16_to_cpu(leaf->hdr.count) - index) * sizeof(*lep));
255 lfloglow = index;
271 for (lowstale = index - 1;
282 for (highstale = index;
287 index - lowstale - 1 >= highstale - index);
297 index - lowstale - 1 < highstale - index)) {
300 ASSERT(index - lowstale - 1 >= 0);
301 if (index - lowstale - 1 > 0)
304 (index - lowstale - 1) * sizeof(*lep));
305 lep = &leaf->ents[index - 1];
307 lfloghigh = MAX(index - 1, lfloghigh);
316 ASSERT(highstale - index >= 0);
317 if (highstale - index > 0)
318 memmove(&leaf->ents[index + 1],
319 &leaf->ents[index],
320 (highstale - index) * sizeof(*lep));
321 lep = &leaf->ents[index];
322 lfloglow = MIN(index, lfloglow);
332 args->blkno, args->index));
348 int i; /* leaf index */
397 int *indexp, /* out: leaf entry index */
405 int fi; /* free entry index */
407 int index; /* leaf entry index */
428 index = xfs_dir2_leaf_search_hash(args, bp);
443 for (lep = &leaf->ents[index]; index < be16_to_cpu(leaf->hdr.count) &&
445 lep++, index++) {
497 * Get the index for our entry.
523 state->extrablk.index = fi;
530 * Return the index, that will be the insertion point.
532 *indexp = index;
544 int *indexp, /* out: leaf entry index */
552 int index; /* leaf entry index */
572 index = xfs_dir2_leaf_search_hash(args, bp);
583 for (lep = &leaf->ents[index]; index < be16_to_cpu(leaf->hdr.count) &&
585 lep++, index++) {
645 *indexp = index;
649 state->extrablk.index = (int)((char *)dep -
656 ASSERT(index == be16_to_cpu(leaf->hdr.count) ||
663 state->extrablk.index = -1;
674 *indexp = index;
687 int *indexp, /* out: leaf entry index */
704 int start_s, /* source leaf index */
706 int start_d, /* destination leaf index */
726 * If the destination index is not the end of the current
742 int i; /* temp leaf index */
821 int mid; /* midpoint leaf index */
888 swap ^ (blk1->index <= be16_to_cpu(leaf1->hdr.count));
890 * Adjust the expected index for insertion.
893 blk2->index = blk1->index - be16_to_cpu(leaf1->hdr.count);
897 * negative index
899 if(blk2->index < 0) {
901 blk2->index = 0;
904 "blk1->index %d\n",
905 blk1->index);
918 int index, /* leaf entry index */
936 trace_xfs_dir2_leafn_remove(args, index);
946 lep = &leaf->ents[index];
953 ASSERT(dblk->index == off);
961 xfs_dir2_leaf_log_ents(tp, bp, index, index);
990 int findex; /* index in freeblock entries */
1053 int i; /* free entry index */
1167 error = xfs_dir2_leafn_add(oldblk->bp, args, oldblk->index);
1169 error = xfs_dir2_leafn_add(newblk->bp, args, newblk->index);
1401 rval = xfs_dir2_leafn_add(blk->bp, args, blk->index);
1445 int findex; /* freespace entry index */
1474 findex = fblk->index;
1656 "index %d magic 0x%x\n",
1659 fblk->index,
1697 * Set the freespace block index from the data block number.
1808 args->index = be16_to_cpu(*tagp);
1848 data + state->extrablk.index);
1911 error = xfs_dir2_leafn_remove(args, blk->bp, blk->index,
1980 lep = &leaf->ents[blk->index];