Lines Matching refs:fragments
55 * 2. Pull the first $target_nr fragments from the list; all of them
57 * Call this subset of fragments the working set.
58 * 3. Until there are no more unprocessed fragments,
59 * a. Find the shortest fragments in the set and remove them.
60 * b. Note the block number of the end of these fragments.
61 * c. Pull the same number of fragments from the list. All of these
62 * fragments should start at the block number recorded in the
64 * d. Put those fragments in the set.
65 * 4. Check that there are $target_nr fragments remaining in the list,
78 struct list_head fragments;
94 * fragments as the refcountbt says we should have.
138 list_add_tail(&frag->list, &refchk->fragments);
145 * Given a bunch of rmap fragments, iterate through them, keeping
179 /* Make sure the fragments actually /are/ in agbno order. */
181 list_for_each_entry(frag, &refchk->fragments, list) {
192 list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
203 * We should have found exactly $target_nr rmap fragments starting
209 while (!list_empty(&refchk->fragments)) {
210 /* Discard any fragments ending at rbno from the worklist. */
226 list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
260 /* Delete fragments and work list. */
265 list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
299 INIT_LIST_HEAD(&refchk.fragments);
312 list_for_each_entry_safe(frag, n, &refchk.fragments, list) {