diff options
| author | Misha Brukman <brukman+llvm@gmail.com> | 2003-05-29 22:12:35 +0000 |
|---|---|---|
| committer | Misha Brukman <brukman+llvm@gmail.com> | 2003-05-29 22:12:35 +0000 |
| commit | d57f3efbc7658ac72b1e2450a8b553ac4841cd25 (patch) | |
| tree | b0a3627acaa672456da889991e0b4197ef4f71ec /runtime | |
| parent | 584dd186c80444b8a8bea2453f09652a48fc2c65 (diff) | |
| download | external_llvm-d57f3efbc7658ac72b1e2450a8b553ac4841cd25.zip external_llvm-d57f3efbc7658ac72b1e2450a8b553ac4841cd25.tar.gz external_llvm-d57f3efbc7658ac72b1e2450a8b553ac4841cd25.tar.bz2 | |
Prevent lines from wrapping.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@6419 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'runtime')
| -rw-r--r-- | runtime/GCCLibraries/libc/qsort.c | 26 |
1 files changed, 13 insertions, 13 deletions
diff --git a/runtime/GCCLibraries/libc/qsort.c b/runtime/GCCLibraries/libc/qsort.c index 1268701..9bfad24 100644 --- a/runtime/GCCLibraries/libc/qsort.c +++ b/runtime/GCCLibraries/libc/qsort.c @@ -28,17 +28,17 @@ #include <string.h> /* Byte-wise swap two items of size SIZE. */ -#define SWAP(a, b, size) \ - do \ - { \ - register size_t __size = (size); \ - register char *__a = (a), *__b = (b); \ - do \ - { \ - char __tmp = *__a; \ - *__a++ = *__b; \ - *__b++ = __tmp; \ - } while (--__size > 0); \ +#define SWAP(a, b, size) \ + do \ + { \ + register size_t __size = (size); \ + register char *__a = (a), *__b = (b); \ + do \ + { \ + char __tmp = *__a; \ + *__a++ = *__b; \ + *__b++ = __tmp; \ + } while (--__size > 0); \ } while (0) /* Discontinue quicksort algorithm when partition gets below this size. @@ -59,8 +59,8 @@ typedef struct bits per byte (CHAR_BIT) * sizeof(size_t). */ #define STACK_SIZE (CHAR_BIT * sizeof(size_t)) #define PUSH(low, high) ((void) ((top->lo = (low)), (top->hi = (high)), ++top)) -#define POP(low, high) ((void) (--top, (low = top->lo), (high = top->hi))) -#define STACK_NOT_EMPTY (stack < top) +#define POP(low, high) ((void) (--top, (low = top->lo), (high = top->hi))) +#define STACK_NOT_EMPTY (stack < top) /* Order size using quicksort. This implementation incorporates |