8 int atoi(const char *str)
10 return strtol(str, 0, 10);
13 long atol(const char *str)
15 return strtol(str, 0, 10);
18 long strtol(const char *str, char **endp, int base)
23 const char *start = str;
25 while(isspace(*str)) str++;
29 if(str[1] == 'x' || str[1] == 'X') {
41 } else if(*str == '-') {
48 char c = tolower(*str);
52 } else if(c >= 'a' && c <= 'f') {
62 acc = acc * base + val;
67 *endp = (char*)(valid ? str : start);
70 return sign > 0 ? acc : -acc;
73 void itoa(int val, char *buf, int base)
79 if(base <= 0) base = 10;
91 int digit = val % base;
92 *ptr++ = digit < 10 ? (digit + '0') : (digit - 10 + 'a');
108 void xtoa(unsigned int val, char *buf)
118 unsigned int digit = val & 0xf;
119 *ptr++ = digit < 10 ? (digit + '0') : (digit - 10 + 'a');
131 void utoa(unsigned int val, char *buf, int base)
133 static char rbuf[16];
141 if(base <= 0) base = 10;
148 unsigned int digit = val % base;
149 *ptr++ = digit < 10 ? (digit + '0') : (digit - 10 + 'a');
161 #define QSORT_THRESHOLD 4
162 #define ITEM(idx) ((char*)arr + (idx) * itemsz)
176 static void ins_sort(void *arr, size_t count, size_t itemsz, int (*cmp)(const void*, const void*))
181 if(count <= 1) return;
183 it = (char*)arr + itemsz;
184 for(i=1; i<count; i++) {
187 while(a > (char*)arr && cmp(a, (b = a - itemsz)) < 0) {
194 void qsort(void *arr, size_t count, size_t itemsz, int (*cmp)(const void*, const void*))
196 char *ma, *mb, *mc, *left, *right;
197 size_t sepidx, nleft, nright;
199 if(count <= 1) return;
201 if(count < QSORT_THRESHOLD) {
202 ins_sort(arr, count, itemsz, cmp);
207 mb = ITEM(count / 2);
208 mc = ITEM(count - 1);
209 if(cmp(ma, mb) < 0) SWAP(ma, mb);
210 if(cmp(mc, ma) < 0) SWAP(mc, ma);
215 while(cmp(left, ma) < 0) left += itemsz;
216 while(cmp(ma, right) < 0) right -= itemsz;
217 if(left >= right) break;
221 sepidx = (right - (char*)arr) / itemsz;
223 nright = count - nleft - 1;
225 qsort(ma, nleft, itemsz, cmp);
226 qsort(right + itemsz, nright, itemsz, cmp);