Lines Matching defs:left
119 char *left,
995 /* rotate the three elements to the left */
1027 char *left,
1036 if (left + eltsize - 1 >= right) {
1041 sameleft = left + (((right - left) / eltsize) / 2) * eltsize;
1044 i = left;
1057 * Shift the left part of the "same" partition to
1058 * the left, so that "same" elements stay in their
1065 * Stay in the "left" partition.
1090 * Move to the "left" partition.
1094 * Unfortunately, the "left" partition
1097 * to the right to free a "left" element.
1108 * Swap with the "left" partition element
1133 * Let's shift the "same" zone to the left.
1149 if (sameleft - left >= right - (sameright + eltsize)) {
1155 * "left" partition.
1160 qsort_recur(left, sameleft, eltsize, compfun);
1162 * The "left" partition is now completely sorted.
1167 left = sameright + eltsize;
1206 register char *left, *right;
1211 oleft = left = *start;
1215 while (left < right) {
1217 part = left + (((right - left) / eltsize) / 2) * eltsize;
1220 oleft = left;
1222 left = part;
1223 if (left == oleft)
1226 printf(" [ Moved left from 0x%x to 0x%x]\n",
1227 oleft, left);
1230 oleft = left;
1237 printf(" [ FOUND! left=0x%x right=0x%x]\n",
1238 left, right);
1239 for (left = part;
1240 left > *start && (*compfun)(left, part) == 0;
1241 left -= eltsize);
1246 oleft = left;