diff options
author | Joseph Myers <joseph@codesourcery.com> | 2013-06-07 22:24:35 +0000 |
---|---|---|
committer | Joseph Myers <joseph@codesourcery.com> | 2013-06-07 22:24:35 +0000 |
commit | 2e09a79ada1f6d92809a037d41895e3d9302ad59 (patch) | |
tree | 999c9d18279a7de289937116273ae4016356aa3a /stdlib/qsort.c | |
parent | 8e254d8e0d0820716e0ccf5f2b89c4fd1325f051 (diff) | |
download | glibc-2e09a79ada1f6d92809a037d41895e3d9302ad59.tar.gz |
Avoid use of "register" as optimization hint.
Diffstat (limited to 'stdlib/qsort.c')
-rw-r--r-- | stdlib/qsort.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/stdlib/qsort.c b/stdlib/qsort.c index ccbdccc7b5..471c66217f 100644 --- a/stdlib/qsort.c +++ b/stdlib/qsort.c @@ -29,8 +29,8 @@ #define SWAP(a, b, size) \ do \ { \ - register size_t __size = (size); \ - register char *__a = (a), *__b = (b); \ + size_t __size = (size); \ + char *__a = (a), *__b = (b); \ do \ { \ char __tmp = *__a; \ @@ -89,7 +89,7 @@ void _quicksort (void *const pbase, size_t total_elems, size_t size, __compar_d_fn_t cmp, void *arg) { - register char *base_ptr = (char *) pbase; + char *base_ptr = (char *) pbase; const size_t max_thresh = MAX_THRESH * size; @@ -206,7 +206,7 @@ _quicksort (void *const pbase, size_t total_elems, size_t size, char *const end_ptr = &base_ptr[size * (total_elems - 1)]; char *tmp_ptr = base_ptr; char *thresh = min(end_ptr, base_ptr + max_thresh); - register char *run_ptr; + char *run_ptr; /* Find smallest element in first threshold and place it at the array's beginning. This is the smallest array element, |