| 1 | /* |
| 2 | * librdkafka - Apache Kafka C library |
| 3 | * |
| 4 | * Copyright (c) 2016 Magnus Edenhill |
| 5 | * All rights reserved. |
| 6 | * |
| 7 | * Redistribution and use in source and binary forms, with or without |
| 8 | * modification, are permitted provided that the following conditions are met: |
| 9 | * |
| 10 | * 1. Redistributions of source code must retain the above copyright notice, |
| 11 | * this list of conditions and the following disclaimer. |
| 12 | * 2. Redistributions in binary form must reproduce the above copyright notice, |
| 13 | * this list of conditions and the following disclaimer in the documentation |
| 14 | * and/or other materials provided with the distribution. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 26 | * POSSIBILITY OF SUCH DAMAGE. |
| 27 | */ |
| 28 | |
| 29 | /** |
| 30 | * System portability |
| 31 | */ |
| 32 | |
| 33 | #include "rd.h" |
| 34 | |
| 35 | |
| 36 | #include <stdlib.h> |
| 37 | |
| 38 | /** |
| 39 | * qsort_r substitute |
| 40 | * This nicely explains why we wont bother with the native implementation |
| 41 | * on Win32 (qsort_s), OSX/FreeBSD (qsort_r with diff args): |
| 42 | * http://forum.theorex.tech/t/different-declarations-of-qsort-r-on-mac-and-linux/93/2 |
| 43 | */ |
| 44 | static RD_TLS int (*rd_qsort_r_cmp) (const void *, const void *, void *); |
| 45 | static RD_TLS void *rd_qsort_r_arg; |
| 46 | |
| 47 | static RD_UNUSED |
| 48 | int rd_qsort_r_trampoline (const void *a, const void *b) { |
| 49 | return rd_qsort_r_cmp(a, b, rd_qsort_r_arg); |
| 50 | } |
| 51 | |
| 52 | void rd_qsort_r (void *base, size_t nmemb, size_t size, |
| 53 | int (*compar)(const void *, const void *, void *), |
| 54 | void *arg) { |
| 55 | rd_qsort_r_cmp = compar; |
| 56 | rd_qsort_r_arg = arg; |
| 57 | qsort(base, nmemb, size, rd_qsort_r_trampoline); |
| 58 | rd_qsort_r_cmp = NULL; |
| 59 | rd_qsort_r_arg = NULL; |
| 60 | } |
| 61 | |