xfs/libxfs/xfs_dir2_leaf.c

48 		to->stale = be16_to_cpu(from3->hdr.stale);
58 		to->stale = be16_to_cpu(from->hdr.stale);
82 		to3->hdr.stale = cpu_to_be16(from->stale);
91 		to->hdr.stale = cpu_to_be16(from->stale);
148 	int				stale;
171 	/* Check hash value order, count stale entries.  */
172 	for (i = stale = 0; i < hdr->count; i++) {
179 			stale++;
185 	if (hdr->stale != stale)
438 	leafhdr.stale = be32_to_cpu(btp->stale);
444 	 * after squeezing out stale entries.
499 	 * Find the first stale entry before our index, if any.
508 	 * Find the first stale entry at or after our index, if any.
527 	int			lowstale,	/* index of prev stale leaf */
528 	int			highstale,	/* index of next stale leaf */
532 	if (!leafhdr->stale) {
538 		 * If there are no stale entries, just insert a hole at index.
554 	 * There are stale entries.
559 	 * If we didn't compact before, we need to find the nearest stale
577 		 * Copy entries up to cover the stale entry and make room
587 		leafhdr->stale--;
598 	 * Copy entries down to cover the stale entry and make room for the
607 	leafhdr->stale--;
636 	int			highstale = 0;	/* index of next stale leaf */
642 	int			lowstale = 0;	/* index of prev stale leaf */
708 	if (!leafhdr.stale)
721 	 * by compacting out stale entries, we'll do that.
724 	    leafhdr.stale > 1)
773 	 * Need to compact the leaf entries, removing stale ones.
774 	 * Leave one stale entry behind - the one closest to our
783 	 * There are stale entries, so we'll need log-low and log-high
786 	else if (leafhdr.stale) {
917  * Compact out any stale entries in the leaf.
933 	if (!leafhdr->stale)
937 	 * Compress out the stale entries in place.
956 	ASSERT(leafhdr->stale == from - to);
957 	leafhdr->count -= leafhdr->stale;
958 	leafhdr->stale = 0;
967  * Compact the leaf entries, removing stale ones.
968  * Leave one stale entry behind - the one closest to our
971  * Return new insertion index, where the remaining stale entry is,
979 	int		*lowstalep,	/* out: stale entry before us */
980 	int		*highstalep,	/* out: stale entry after us */
985 	int		highstale;	/* stale entry at/after index */
987 	int		keepstale;	/* source index of kept stale */
988 	int		lowstale;	/* stale entry before index */
992 	ASSERT(leafhdr->stale > 1);
1007 	 * Copy the entries in place, removing all the stale entries
1046 	leafhdr->stale = 1;
1048 	 * Remember the low/high stale value only in the "right"
1263 		 * Skip over stale leaf entries.
1409 	 * We just mark the leaf entry stale by putting a null in it.
1411 	leafhdr.stale++;
1665 	entries = hdr->count - hdr->stale;
1773 	 * If the leaf has any stale entries in it, compress them out.
1775 	if (leafhdr.stale)