Lines Matching refs:stale
47 to->stale = be16_to_cpu(from3->hdr.stale);
57 to->stale = be16_to_cpu(from->hdr.stale);
81 to3->hdr.stale = cpu_to_be16(from->stale);
90 to->hdr.stale = cpu_to_be16(from->stale);
147 int stale;
170 /* Check hash value order, count stale entries. */
171 for (i = stale = 0; i < hdr->count; i++) {
178 stale++;
184 if (hdr->stale != stale)
437 leafhdr.stale = be32_to_cpu(btp->stale);
443 * after squeezing out stale entries.
498 * Find the first stale entry before our index, if any.
507 * Find the first stale entry at or after our index, if any.
526 int lowstale, /* index of prev stale leaf */
527 int highstale, /* index of next stale leaf */
531 if (!leafhdr->stale) {
537 * If there are no stale entries, just insert a hole at index.
553 * There are stale entries.
558 * If we didn't compact before, we need to find the nearest stale
576 * Copy entries up to cover the stale entry and make room
586 leafhdr->stale--;
597 * Copy entries down to cover the stale entry and make room for the
606 leafhdr->stale--;
635 int highstale = 0; /* index of next stale leaf */
641 int lowstale = 0; /* index of prev stale leaf */
707 if (!leafhdr.stale)
720 * by compacting out stale entries, we'll do that.
723 leafhdr.stale > 1)
772 * Need to compact the leaf entries, removing stale ones.
773 * Leave one stale entry behind - the one closest to our
782 * There are stale entries, so we'll need log-low and log-high
785 else if (leafhdr.stale) {
916 * Compact out any stale entries in the leaf.
932 if (!leafhdr->stale)
936 * Compress out the stale entries in place.
955 ASSERT(leafhdr->stale == from - to);
956 leafhdr->count -= leafhdr->stale;
957 leafhdr->stale = 0;
966 * Compact the leaf entries, removing stale ones.
967 * Leave one stale entry behind - the one closest to our
970 * Return new insertion index, where the remaining stale entry is,
978 int *lowstalep, /* out: stale entry before us */
979 int *highstalep, /* out: stale entry after us */
984 int highstale; /* stale entry at/after index */
986 int keepstale; /* source index of kept stale */
987 int lowstale; /* stale entry before index */
991 ASSERT(leafhdr->stale > 1);
1006 * Copy the entries in place, removing all the stale entries
1045 leafhdr->stale = 1;
1047 * Remember the low/high stale value only in the "right"
1262 * Skip over stale leaf entries.
1406 * We just mark the leaf entry stale by putting a null in it.
1408 leafhdr.stale++;
1662 entries = hdr->count - hdr->stale;
1770 * If the leaf has any stale entries in it, compress them out.
1772 if (leafhdr.stale)