Lines Matching refs:stale
209 * If there are stale entries we'll use one for the leaf.
211 if (btp->stale) {
236 if (be16_to_cpu(dup->length) + (be32_to_cpu(btp->stale) - 1) *
239 } else if ((be32_to_cpu(btp->stale) - 1) * (uint)sizeof(*blp) < len)
247 * no stale entries, so just use free space.
297 * Leave the highest-numbered stale entry stale.
314 int highstale; /* high stale index */
332 *lfloglow = toidx + 1 - (be32_to_cpu(btp->stale) - 1);
333 *lfloghigh -= be32_to_cpu(btp->stale) - 1;
334 be32_add_cpu(&btp->count, -(be32_to_cpu(btp->stale) - 1));
337 (xfs_dir2_data_aoff_t)((be32_to_cpu(btp->stale) - 1) * sizeof(*blp)),
339 btp->stale = cpu_to_be32(1);
367 int highstale; /* high stale index */
372 int lowstale; /* low stale index */
399 * Find out if we can reuse stale entries or whether we need extra
442 } else if (btp->stale) {
445 * For the no-stale case they're set explicitly.
467 * No stale entries, will use enddup space to hold new leaf.
469 if (!btp->stale) {
508 * Use a stale leaf for our new entry.
525 * Move entries toward the low-numbered stale entry.
537 * Move entries toward the high-numbered stale entry.
548 be32_add_cpu(&btp->stale, -1);
828 be32_add_cpu(&btp->stale, 1);
831 * Remove the leaf entry by marking it stale.
996 (uint)sizeof(*lep) * (leafhdr.count - leafhdr.stale);
1027 btp->count = cpu_to_be32(leafhdr.count - leafhdr.stale);
1028 btp->stale = 0;
1031 * Initialize the block leaf area. We compact out stale entries.
1156 btp->stale = 0;