fs/xfs/xfs_dir2_leaf.c

115 	leaf->hdr.stale = cpu_to_be16(be32_to_cpu(btp->stale));
118 	 * after squeezing out stale entries.
175 	int			highstale;	/* index of next stale leaf */
184 	int			lowstale;	/* index of prev stale leaf */
257 		(leaf->hdr.stale ? 0 : (uint)sizeof(leaf->ents[0])) +
267 	 * by compacting out stale entries, we'll do that.
270 	    be16_to_cpu(leaf->hdr.stale) > 1) {
320 	 * Need to compact the leaf entries, removing stale ones.
321 	 * Leave one stale entry behind - the one closest to our
330 	 * There are stale entries, so we'll need log-low and log-high
333 	else if (be16_to_cpu(leaf->hdr.stale)) {
437 	 * If there are no stale entries, we just insert a hole at index.
439 	if (!leaf->hdr.stale) {
454 	 * There are stale entries.
462 		 * stale entries before and after our insertion point.
466 			 * Find the first stale entry before the insertion
476 			 * Find the next stale entry at or after the insertion
499 			 * Copy entries up to cover the stale entry
518 			 * Copy entries down to cover the stale entry
529 		be16_add(&leaf->hdr.stale, -1);
563 	int			stale;		/* count of stale leaves */
581 	 * Check hash value order, count stale entries.
583 	for (i = stale = 0; i < be16_to_cpu(leaf->hdr.count); i++) {
588 			stale++;
590 	ASSERT(be16_to_cpu(leaf->hdr.stale) == stale);
595  * Compact out any stale entries in the leaf.
609 	if (!leaf->hdr.stale) {
613 	 * Compress out the stale entries in place.
631 	ASSERT(be16_to_cpu(leaf->hdr.stale) == from - to);
632 	be16_add(&leaf->hdr.count, -(be16_to_cpu(leaf->hdr.stale)));
633 	leaf->hdr.stale = 0;
640  * Compact the leaf entries, removing stale ones.
641  * Leave one stale entry behind - the one closest to our
644  * Return new insertion index, where the remaining stale entry is,
651 	int		*lowstalep,	/* out: stale entry before us */
652 	int		*highstalep,	/* out: stale entry after us */
657 	int		highstale;	/* stale entry at/after index */
659 	int		keepstale;	/* source index of kept stale */
661 	int		lowstale;	/* stale entry before index */
666 	ASSERT(be16_to_cpu(leaf->hdr.stale) > 1);
669 	 * Find the first stale entry before our index, if any.
677 	 * Find the first stale entry at or after our index, if any.
696 	 * Copy the entries in place, removing all the stale entries
735 	leaf->hdr.stale = cpu_to_be16(1);
737 	 * Remember the low/high stale value only in the "right"
1179 	leaf->hdr.stale = 0;
1380 		 * Skip over stale leaf entries.
1490 	 * We just mark the leaf entry stale by putting a null in it.
1492 	be16_add(&leaf->hdr.stale, 1);
1825 	    (be16_to_cpu(leaf->hdr.count) - be16_to_cpu(leaf->hdr.stale)) * (uint)sizeof(leaf->ents[0]) +
1833 	 * If the leaf has any stale entries in it, compress them out.
1836 	if (be16_to_cpu(leaf->hdr.stale))