BadVPN – Blame information for rev 1
?pathlinks?
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 1 | office | 1 | /** |
| 2 | * @file bsort.h |
||
| 3 | * @author Ambroz Bizjak <ambrop7@gmail.com> |
||
| 4 | * |
||
| 5 | * @section LICENSE |
||
| 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 | * 1. Redistributions of source code must retain the above copyright |
||
| 10 | * notice, this list of conditions and the following disclaimer. |
||
| 11 | * 2. Redistributions in binary form must reproduce the above copyright |
||
| 12 | * notice, this list of conditions and the following disclaimer in the |
||
| 13 | * documentation and/or other materials provided with the distribution. |
||
| 14 | * 3. Neither the name of the author nor the |
||
| 15 | * names of its contributors may be used to endorse or promote products |
||
| 16 | * derived from this software without specific prior written permission. |
||
| 17 | * |
||
| 18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
||
| 19 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
||
| 20 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
||
| 21 | * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY |
||
| 22 | * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
||
| 23 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
||
| 24 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
||
| 25 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
| 26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
||
| 27 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
| 28 | * |
||
| 29 | * @section DESCRIPTION |
||
| 30 | * |
||
| 31 | * Sorting functions. |
||
| 32 | */ |
||
| 33 | |||
| 34 | #ifndef BADVPN_MISC_BSORT_H |
||
| 35 | #define BADVPN_MISC_BSORT_H |
||
| 36 | |||
| 37 | #include <stddef.h> |
||
| 38 | #include <stdint.h> |
||
| 39 | #include <string.h> |
||
| 40 | |||
| 41 | #include <misc/debug.h> |
||
| 42 | #include <misc/balloc.h> |
||
| 43 | |||
| 44 | typedef int (*BSort_comparator) (const void *e1, const void *e2); |
||
| 45 | |||
| 46 | static void BInsertionSort (void *arr, size_t count, size_t esize, BSort_comparator compatator, void *temp); |
||
| 47 | |||
| 48 | void BInsertionSort (void *arr, size_t count, size_t esize, BSort_comparator compatator, void *temp) |
||
| 49 | { |
||
| 50 | ASSERT(esize > 0) |
||
| 51 | |||
| 52 | for (size_t i = 0; i < count; i++) { |
||
| 53 | size_t j = i; |
||
| 54 | while (j > 0) { |
||
| 55 | uint8_t *x = (uint8_t *)arr + (j - 1) * esize; |
||
| 56 | uint8_t *y = (uint8_t *)arr + j * esize; |
||
| 57 | int c = compatator(x, y); |
||
| 58 | if (c <= 0) { |
||
| 59 | break; |
||
| 60 | } |
||
| 61 | memcpy(temp, x, esize); |
||
| 62 | memcpy(x, y, esize); |
||
| 63 | memcpy(y, temp, esize); |
||
| 64 | j--; |
||
| 65 | } |
||
| 66 | } |
||
| 67 | } |
||
| 68 | |||
| 69 | #endif |