xfs/scrub/rtrefcount.c

81  * 2. Pull the first $target_nr fragments from the list; all of them
83  *    Call this subset of fragments the working set.
84  * 3. Until there are no more unprocessed fragments,
85  *    a. Find the shortest fragments in the set and remove them.
86  *    b. Note the block number of the end of these fragments.
87  *    c. Pull the same number of fragments from the list.  All of these
88  *       fragments should start at the block number recorded in the
90  *    d. Put those fragments in the set.
91  * 4. Check that there are $target_nr fragments remaining in the list,
104 	struct list_head	fragments;
120  * fragments as the rtrefcountbt says we should have.
164 		list_add_tail(&frag->list, &refchk->fragments);
171  * Given a bunch of rmap fragments, iterate through them, keeping
205 	/* Make sure the fragments actually /are/ in bno order. */
207 	list_for_each_entry(frag, &refchk->fragments, list) {
218 	list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
229 	 * We should have found exactly $target_nr rmap fragments starting
235 	while (!list_empty(&refchk->fragments)) {
236 		/* Discard any fragments ending at rbno from the worklist. */
252 		list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
286 	/* Delete fragments and work list. */
291 	list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
325 	INIT_LIST_HEAD(&refchk.fragments);
336 	list_for_each_entry_safe(frag, n, &refchk.fragments, list) {