Lines Matching defs:fragments
67 * 2. Pull the first $target_nr fragments from the list; all of them
69 * Call this subset of fragments the working set.
70 * 3. Until there are no more unprocessed fragments,
71 * a. Find the shortest fragments in the set and remove them.
72 * b. Note the block number of the end of these fragments.
73 * c. Pull the same number of fragments from the list. All of these
74 * fragments should start at the block number recorded in the
76 * d. Put those fragments in the set.
77 * 4. Check that there are $target_nr fragments remaining in the list,
90 struct list_head fragments;
106 * fragments as the refcountbt says we should have.
150 list_add_tail(&frag->list, &refchk->fragments);
157 * Given a bunch of rmap fragments, iterate through them, keeping
191 /* Make sure the fragments actually /are/ in agbno order. */
193 list_for_each_entry(frag, &refchk->fragments, list) {
204 list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
215 * We should have found exactly $target_nr rmap fragments starting
221 while (!list_empty(&refchk->fragments)) {
222 /* Discard any fragments ending at rbno from the worklist. */
238 list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
272 /* Delete fragments and work list. */
277 list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
311 INIT_LIST_HEAD(&refchk.fragments);
324 list_for_each_entry_safe(frag, n, &refchk.fragments, list) {