27 	size_t wgap, i, j, k;  in qsort()  local
32 		wgap = 0;  in qsort()
34 			wgap = 3 * wgap + 1;  in qsort()
35 		} while (wgap < (nel-1)/3);  in qsort()
38 		wgap *= width;			/* So this can not overflow if wnel doesn't. */  in qsort()
41 			i = wgap;  in qsort()
48 					j -= wgap;  in qsort()
50 					b = a + wgap;  in qsort()
60 				} while (j >= wgap);  in qsort()
63 			wgap = (wgap - width)/3;  in qsort()
64 		} while (wgap);  in qsort()