28 #define SWAP(a, b, size)						      \  argument
31       size_t __size = (size);						      \
88 _quicksort (void *const pbase, size_t total_elems, size_t size,  in _quicksort()  argument
93   const size_t max_thresh = MAX_THRESH * size;  in _quicksort()
102       char *hi = &lo[size * (total_elems - 1)];  in _quicksort()
119 	  char *mid = lo + size * ((hi - lo) / size >> 1);  in _quicksort()
122 	    SWAP (mid, lo, size);  in _quicksort()
124 	    SWAP (mid, hi, size);  in _quicksort()
128 	    SWAP (mid, lo, size);  in _quicksort()
131 	  left_ptr  = lo + size;  in _quicksort()
132 	  right_ptr = hi - size;  in _quicksort()
140 		left_ptr += size;  in _quicksort()
143 		right_ptr -= size;  in _quicksort()
147 		  SWAP (left_ptr, right_ptr, size);  in _quicksort()
152 		  left_ptr += size;  in _quicksort()
153 		  right_ptr -= size;  in _quicksort()
157 		  left_ptr += size;  in _quicksort()
158 		  right_ptr -= size;  in _quicksort()
205     char *const end_ptr = &base_ptr[size * (total_elems - 1)];  in _quicksort()
214     for (run_ptr = tmp_ptr + size; run_ptr <= thresh; run_ptr += size)  in _quicksort()
219       SWAP (tmp_ptr, base_ptr, size);  in _quicksort()
223     run_ptr = base_ptr + size;  in _quicksort()
224     while ((run_ptr += size) <= end_ptr)  in _quicksort()
226 	tmp_ptr = run_ptr - size;  in _quicksort()
228 	  tmp_ptr -= size;  in _quicksort()
230 	tmp_ptr += size;  in _quicksort()
235 	    trav = run_ptr + size;  in _quicksort()
241                 for (hi = lo = trav; (lo -= size) >= tmp_ptr; hi = lo)  in _quicksort()