Lines Matching defs:list1
133 ** The array of elements at list1 will be organized into runs of length 2,
148 ** However, it may also address a singleton element at the end of list1,
149 ** or it may be equal to ``last'', the first element beyond list1.
181 dynprep(pTHX_ gptr *list1, gptr *list2, size_t nmemb, SVCOMPARE_t cmp)
189 b = list1;
283 * # merge $runs runs at offset $offset of list $list1 into $list2.
286 * my ($offset, $runs, $base, $list1, $list2) = @_;
289 * if ($list1 is $base) copy run to $list2
292 * $off2 = mgsort2($offset, $runs-($runs/2), $base, $list2, $list1)
293 * mgsort2($off2, $runs/2, $base, $list2, $list1)
294 * merge the adjacent runs at $offset of $list1 into $list2
345 gptr *aux, *list1, *list2;
368 list1 = which[iwhich]; /* area where runs are now */
372 f1 = p1 = list1 + offset; /* start of first run */
375 f2 = l1 = POTHER(t, list2, list1); /* ... on the other side */
377 l2 = POTHER(t, list2, list1); /* ... on the other side */
463 p1 = NEXT(p1) = POTHER(tp2, list2, list1);
467 t = list1; list1 = list2; list2 = t; /* swap lists */
1246 * indir list1
1261 * During the sort phase, we leave the elements of list1 where they are,
1264 * Because we don't move the elements of list1 around through
1266 * using their address in the list1 array, ensuring stabilty.
1269 * indir list1
1286 * we have to put the elements of list1 into the places
1304 S_qsortsv(pTHX_ gptr *list1, size_t nmemb, SVCOMPARE_t cmp)
1320 for (n = nmemb, pp = indir, q = list1; n--; ) *pp++ = q++;
1329 q = list1;
1370 S_qsortsvu(aTHX_ list1, nmemb, cmp);