Lines Matching refs:right
120 char *right,
1028 char *right,
1036 if (left + eltsize - 1 >= right) {
1041 sameleft = left + (((right - left) / eltsize) / 2) * eltsize;
1045 j = right - eltsize;
1070 * Should be moved to the "right" partition.
1084 * Move to the right of the "same" partition.
1097 * to the right to free a "left" element.
1099 * to the right of the "same" partition.
1109 * waiting to be moved to the "right"
1122 * Stay in the "right" partition.
1130 * The second loop completed (the"right" partition is ok),
1132 * the element waiting for a place in the "right" partition.
1149 if (sameleft - left >= right - (sameright + eltsize)) {
1150 qsort_recur(sameright + eltsize, right, eltsize, compfun);
1152 * The "right" partition is now completely sorted.
1157 right = sameleft;
1165 * "right" partition.
1206 register char *left, *right;
1212 oright = right = *db_end;
1215 while (left < right) {
1217 part = left + (((right - left) / eltsize) / 2) * eltsize;
1221 oright = right;
1229 oright = right;
1231 right = part;
1233 printf(" [ Moved right from 0x%x to 0x%x]\n",
1234 oright, right);
1237 printf(" [ FOUND! left=0x%x right=0x%x]\n",
1238 left, right);
1242 for (right = part + eltsize;
1243 right < *db_end && (*compfun)(right, part) == 0;
1244 right += eltsize);
1245 oright = right;