openbsd/src/lib/libc, branch libressl-v2.6.0

update the little endian processor list to give it a chance of matching

2017-07-08T21:45:35+00:00

what the reader is using.

Only access offset if canaries are enabled and size > 0, otherwise offset

2017-07-07T19:14:46+00:00

is not initialized. Problem spotted by Carlin Bingham; ok phessler@ tedu@

The 0x (or 0X) prefix in base 16 is optional so only skip over the

2017-07-06T16:23:11+00:00

prefix if the character following it is a valid hex char. The C99 standard is clear that given the string "0xy" zero should be returned and endptr set to point to the "x". OK deraadt@ espie@

void functions don't return 0

2017-07-05T11:44:35+00:00

From Klemens Nanni

port the RBT code to userland by making it part of libc.

2017-06-19T03:06:26+00:00

src/lib/libc/gen/tree.c is a copy of src/sys/kern/subr_tree.c, but with annotations for symbol visibility. changes to one should be reflected in the other. the malloc debug code that uses RB code is ported to RBT. because libc provides the RBT code, procmap doesn't have to reach into the kernel and build subr_tree.c itself now. mild enthusiasm from many ok guenther@

Don't fall back to heapsort() if we would otherwise switch to

2017-05-30T14:54:09+00:00

insertion sort (when the number of elements is < 7).

Support swapping 32-bit aligned elements on 64-bit platforms.

2017-05-24T21:18:25+00:00

Previously they would be swapped a byte at a time when sizeof(int) != sizeof(long). Idea from FreeBSD.

Document that qsort falls back to heapsort() if the recursion depth

2017-05-20T13:09:01+00:00

exceeds 2 lg N and add a reference to the introsort paper.

Use David Musser's introsort algorithm to fall back to heapsort(3)

2017-05-20T12:48:56+00:00

when the recursion depth reaches 2*lg(n + 1). This avoids quicksort's quadratic behavior for pathological input without appreciably changing the average run time.

The BSD qsort() performs tail recursion elimination on the second

2017-05-17T16:58:20+00:00

side of the array being partitioned to save on stack space. Greater savings can be gained by choosing recursion for the smaller side of the partition and eliminating recursion for the larger side. This also results in a small but measurable performance gain. OK otto@ schwarze@