es 109 bsp/hal/x86/arch/context.c u->ds = u->es = (uint32_t)(USER_DS | 3); es 198 bsp/hal/x86/arch/context.c cur->ss = cur->ds = cur->es = (uint32_t)(USER_DS | 3); es 205 bsp/hal/x86/arch/cpu.c tss.ds = tss.es = tss.ss = tss.fs = tss.gs = (uint32_t)USER_CS | 3; es 174 bsp/hal/x86/arch/trap.c r->cs, ss, r->ds, r->es, tss_get()); es 54 bsp/hal/x86/include/context.h uint32_t es; /* +32 (20) */ es 182 bsp/hal/x86/include/cpu.h uint32_t es, cs, ss, ds, fs, gs; es 57 usr/lib/libc/stdlib/qsort.c #define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \ es 58 usr/lib/libc/stdlib/qsort.c es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1; es 78 usr/lib/libc/stdlib/qsort.c swapfunc(a, b, es, swaptype) es 93 usr/lib/libc/stdlib/qsort.c qsort(a, n, es, cmp) es 95 usr/lib/libc/stdlib/qsort.c size_t n, es; es 101 usr/lib/libc/stdlib/qsort.c loop: SWAPINIT(a, es); es 104 usr/lib/libc/stdlib/qsort.c for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es) es 105 usr/lib/libc/stdlib/qsort.c for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0; es 106 usr/lib/libc/stdlib/qsort.c pl -= es) es 107 usr/lib/libc/stdlib/qsort.c swap(pl, pl - es); es 110 usr/lib/libc/stdlib/qsort.c pm = (char *) a + (n / 2) * es; es 113 usr/lib/libc/stdlib/qsort.c pn = (char *) a + (n - 1) * es; es 115 usr/lib/libc/stdlib/qsort.c d = (n / 8) * es; es 123 usr/lib/libc/stdlib/qsort.c pa = pb = (char *) a + es; es 125 usr/lib/libc/stdlib/qsort.c pc = pd = (char *) a + (n - 1) * es; es 131 usr/lib/libc/stdlib/qsort.c pa += es; es 133 usr/lib/libc/stdlib/qsort.c pb += es; es 139 usr/lib/libc/stdlib/qsort.c pd -= es; es 141 usr/lib/libc/stdlib/qsort.c pc -= es; es 147 usr/lib/libc/stdlib/qsort.c pb += es; es 148 usr/lib/libc/stdlib/qsort.c pc -= es; es 151 usr/lib/libc/stdlib/qsort.c for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es) es 152 usr/lib/libc/stdlib/qsort.c for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0; es 153 usr/lib/libc/stdlib/qsort.c pl -= es) es 154 usr/lib/libc/stdlib/qsort.c swap(pl, pl - es); es 157 usr/lib/libc/stdlib/qsort.c pn = (char *) a + n * es; es 160 usr/lib/libc/stdlib/qsort.c r = min(pd - pc, pn - pd - es); es 162 usr/lib/libc/stdlib/qsort.c if ((r = pb - pa) > es) es 163 usr/lib/libc/stdlib/qsort.c qsort(a, r / es, es, cmp); es 164 usr/lib/libc/stdlib/qsort.c if ((r = pd - pc) > es) { es 167 usr/lib/libc/stdlib/qsort.c n = r / es;