Lines Matching refs:stale
207 * If there are stale entries we'll use one for the leaf.
209 if (btp->stale) {
234 if (be16_to_cpu(dup->length) + (be32_to_cpu(btp->stale) - 1) *
237 } else if ((be32_to_cpu(btp->stale) - 1) * (uint)sizeof(*blp) < len)
245 * no stale entries, so just use free space.
295 * Leave the highest-numbered stale entry stale.
312 int highstale; /* high stale index */
330 *lfloglow = toidx + 1 - (be32_to_cpu(btp->stale) - 1);
331 *lfloghigh -= be32_to_cpu(btp->stale) - 1;
332 be32_add_cpu(&btp->count, -(be32_to_cpu(btp->stale) - 1));
335 (xfs_dir2_data_aoff_t)((be32_to_cpu(btp->stale) - 1) * sizeof(*blp)),
337 btp->stale = cpu_to_be32(1);
365 int highstale; /* high stale index */
370 int lowstale; /* low stale index */
397 * Find out if we can reuse stale entries or whether we need extra
440 } else if (btp->stale) {
443 * For the no-stale case they're set explicitly.
465 * No stale entries, will use enddup space to hold new leaf.
467 if (!btp->stale) {
506 * Use a stale leaf for our new entry.
523 * Move entries toward the low-numbered stale entry.
535 * Move entries toward the high-numbered stale entry.
546 be32_add_cpu(&btp->stale, -1);
826 be32_add_cpu(&btp->stale, 1);
829 * Remove the leaf entry by marking it stale.
994 (uint)sizeof(*lep) * (leafhdr.count - leafhdr.stale);
1025 btp->count = cpu_to_be32(leafhdr.count - leafhdr.stale);
1026 btp->stale = 0;
1029 * Initialize the block leaf area. We compact out stale entries.
1156 btp->stale = 0;