openssl - Mirror of https://github.com/openssl/openssl

diff options

author	Matt Caswell <matt@openssl.org>	2018-06-20 15:25:43 +0100
committer	Matt Caswell <matt@openssl.org>	2018-06-20 15:29:23 +0100
commit	fd38836ba8158cb30f0731f8a61780ed4b5a6825 (patch)
tree	809399f68c671a882f98d35dd4e348658313106e /crypto/chacha/asm
parent	c4a8eb624f8966846dc462c4bb10314674566952 (diff)

Update copyright year

Reviewed-by: Richard Levitte <levitte@openssl.org> (Merged from https://github.com/openssl/openssl/pull/6538)

Diffstat (limited to 'crypto/chacha/asm')

-rwxr-xr-x

crypto/chacha/asm/chacha-x86.pl

1 files changed, 1 insertions, 1 deletions

/* * A fast, small, non-recursive O(nlog n) sort for the Linux kernel * * Jan 23 2005 Matt Mackall <mpm@selenic.com> */ #include <linux/kernel.h> #include <linux/module.h> #include <linux/sort.h> #include <linux/slab.h> static void u32_swap(void *a, void *b, int size) { u32 t = *(u32 *)a; *(u32 *)a = *(u32 *)b; *(u32 *)b = t; } static void generic_swap(void *a, void *b, int size) { char t; do { t = *(char *)a; *(char *)a++ = *(char *)b; *(char *)b++ = t; } while (--size > 0); } /** * sort - sort an array of elements * @base: pointer to data to sort * @num: number of elements * @size: size of each element * @cmp_func: pointer to comparison function * @swap_func: pointer to swap function or NULL * * This function does a heapsort on the given array. You may provide a * swap_func function optimized to your element type. * * Sorting time is O(n log n) both on average and worst-case. While * qsort is about 20% faster on average, it suffers from exploitable * O(n*n) worst-case behavior and extra memory requirements that make * it less suitable for kernel use. */ void sort(void *base, size_t num, size_t size, int (*cmp_func)(const void *, const void *), void (*swap_func)(void *, void *, int size)) { /* pre-scale counters for performance */ int i = (num/2 - 1) * size, n = num * size, c, r; if (!swap_func) swap_func = (size == 4 ? u32_swap : generic_swap); /* heapify */ for ( ; i >= 0; i -= size) { for (r = i; r * 2 + size < n; r = c) { c = r * 2 + size; if (c < n - size && cmp_func(base + c, base + c + size) < 0) c += size; if (cmp_func(base + r, base + c) >= 0) break; swap_func(base + r, base + c, size); } } /* sort */ for (i = n - size; i > 0; i -= size) { swap_func(base, base + i, size); for (r = 0; r * 2 + size < i; r = c) { c = r * 2 + size; if (c < i - size && cmp_func(base + c, base + c + size) < 0) c += size; if (cmp_func(base + r, base + c) >= 0) break; swap_func(base + r, base + c, size); } } } EXPORT_SYMBOL(sort); #if 0 /* a simple boot-time regression test */ int cmpint(const void *a, const void *b) { return *(int *)a - *(int *)b; } static int sort_test(void) { int *a, i, r = 1; a = kmalloc(1000 * sizeof(int), GFP_KERNEL); BUG_ON(!a); printk("testing sort()\n"); for (i = 0; i < 1000; i++) { r = (r * 725861) % 6599; a[i] = r; } sort(a, 1000, sizeof(int), cmpint, NULL); for (i = 0; i < 999; i++) if (a[i] > a[i+1]) { printk("sort() failed!\n"); break; } kfree(a); return 0; } module_init(sort_test); #endif


context:
space:
mode: