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);
146 int stale;
165 /* Check hash value order, count stale entries. */
166 for (i = stale = 0; i < hdr->count; i++) {
173 stale++;
175 if (hdr->stale != stale)
428 leafhdr.stale = be32_to_cpu(btp->stale);
434 * after squeezing out stale entries.
489 * Find the first stale entry before our index, if any.
498 * Find the first stale entry at or after our index, if any.
517 int lowstale, /* index of prev stale leaf */
518 int highstale, /* index of next stale leaf */
522 if (!leafhdr->stale) {
528 * If there are no stale entries, just insert a hole at index.
544 * There are stale entries.
549 * If we didn't compact before, we need to find the nearest stale
567 * Copy entries up to cover the stale entry and make room
577 leafhdr->stale--;
588 * Copy entries down to cover the stale entry and make room for the
597 leafhdr->stale--;
626 int highstale = 0; /* index of next stale leaf */
632 int lowstale = 0; /* index of prev stale leaf */
698 if (!leafhdr.stale)
711 * by compacting out stale entries, we'll do that.
714 leafhdr.stale > 1)
763 * Need to compact the leaf entries, removing stale ones.
764 * Leave one stale entry behind - the one closest to our
773 * There are stale entries, so we'll need log-low and log-high
776 else if (leafhdr.stale) {
907 * Compact out any stale entries in the leaf.
923 if (!leafhdr->stale)
927 * Compress out the stale entries in place.
946 ASSERT(leafhdr->stale == from - to);
947 leafhdr->count -= leafhdr->stale;
948 leafhdr->stale = 0;
957 * Compact the leaf entries, removing stale ones.
958 * Leave one stale entry behind - the one closest to our
961 * Return new insertion index, where the remaining stale entry is,
969 int *lowstalep, /* out: stale entry before us */
970 int *highstalep, /* out: stale entry after us */
975 int highstale; /* stale entry at/after index */
977 int keepstale; /* source index of kept stale */
978 int lowstale; /* stale entry before index */
982 ASSERT(leafhdr->stale > 1);
997 * Copy the entries in place, removing all the stale entries
1036 leafhdr->stale = 1;
1038 * Remember the low/high stale value only in the "right"
1253 * Skip over stale leaf entries.
1397 * We just mark the leaf entry stale by putting a null in it.
1399 leafhdr.stale++;
1653 entries = hdr->count - hdr->stale;
1761 * If the leaf has any stale entries in it, compress them out.
1763 if (leafhdr.stale)