diff options
| author | delphij <delphij@FreeBSD.org> | 2017-05-31 05:52:32 +0000 |
|---|---|---|
| committer | delphij <delphij@FreeBSD.org> | 2017-05-31 05:52:32 +0000 |
| commit | 976743b6f3f0324b45804613a26d7f415120913e (patch) | |
| tree | eb05a924b51677616f8da5ac3ef0e6035b4c1ced /kerberos5 | |
| parent | dacb215992be634e8b142df7e9781b5507eb37db (diff) | |
| download | FreeBSD-src-976743b6f3f0324b45804613a26d7f415120913e.zip FreeBSD-src-976743b6f3f0324b45804613a26d7f415120913e.tar.gz | |
MFC r318514-r318515, r318517, r318917
r318514:
Use size_t.
Inspired by: OpenBSD src/lib/libc/stdlib/qsort.c,v 1.11
r318515:
The current qsort(3) implementation ignores the sizes of partitions, and
always perform recursion on the left partition, then use a tail call to
handle the right partition. In the worst case this could require O(N)
levels of recursions.
Reduce the possible recursion level to log2(N) by always recursing on the
smaller partition instead.
Obtained from: PostgreSQL 9d6077abf9d6efd992a59f05ef5aba981ea32096
r318517:
Sync qsort.c with userland r318515.
(Note that MIN macro is removed in favor of sys/param.h's version).
PR: 213922
r318917:
Disconnect heimdal version of qsort.c from build because we are already
using libc's version of qsort.
PR: bin/213922
Diffstat (limited to 'kerberos5')
| -rw-r--r-- | kerberos5/lib/libroken/Makefile | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/kerberos5/lib/libroken/Makefile b/kerberos5/lib/libroken/Makefile index 8bd27e6..95505d2 100644 --- a/kerberos5/lib/libroken/Makefile +++ b/kerberos5/lib/libroken/Makefile @@ -52,7 +52,6 @@ SRCS= base64.c \ parse_bytes.c \ parse_time.c \ parse_units.c \ - qsort.c \ rand.c \ realloc.c \ resolve.c \ |
