193 static void auxsort (lua_State *L, int l, int u) {  in auxsort()  argument
194   while (l < u) {  /* for tail recursion */  in auxsort()
198     lua_rawgeti(L, 1, u);  in auxsort()
200       set2(L, l, u);  /* swap a[l] - a[u] */  in auxsort()
203     if (u-l == 1) break;  /* only 2 elements */  in auxsort()
204     i = (l+u)/2;  in auxsort()
211       lua_rawgeti(L, 1, u);  in auxsort()
213         set2(L, i, u);  in auxsort()
217     if (u-l == 2) break;  /* only 3 elements */  in auxsort()
220     lua_rawgeti(L, 1, u-1);  in auxsort()
221     set2(L, i, u-1);  in auxsort()
223     i = l; j = u-1;  in auxsort()
227         if (i>u) luaL_error(L, "invalid order function for sorting");  in auxsort()
241     lua_rawgeti(L, 1, u-1);  in auxsort()
243     set2(L, u-1, i);  /* swap pivot (a[u-1]) with a[i] */  in auxsort()
246     if (i-l < u-i) {  in auxsort()
250       j=i+1; i=u; u=j-2;  in auxsort()