Lines Matching refs:fragments
50 * 2. Pull the first $target_nr fragments from the list; all of them
52 * Call this subset of fragments the working set.
53 * 3. Until there are no more unprocessed fragments,
54 * a. Find the shortest fragments in the set and remove them.
55 * b. Note the block number of the end of these fragments.
56 * c. Pull the same number of fragments from the list. All of these
57 * fragments should start at the block number recorded in the
59 * d. Put those fragments in the set.
60 * 4. Check that there are $target_nr fragments remaining in the list,
73 struct list_head fragments;
89 * fragments as the refcountbt says we should have.
133 list_add_tail(&frag->list, &refchk->fragments);
140 * Given a bunch of rmap fragments, iterate through them, keeping
174 /* Make sure the fragments actually /are/ in agbno order. */
176 list_for_each_entry(frag, &refchk->fragments, list) {
187 list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
198 * We should have found exactly $target_nr rmap fragments starting
204 while (!list_empty(&refchk->fragments)) {
205 /* Discard any fragments ending at rbno from the worklist. */
221 list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
255 /* Delete fragments and work list. */
260 list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
296 INIT_LIST_HEAD(&refchk.fragments);
307 list_for_each_entry_safe(frag, n, &refchk.fragments, list) {