mirrors/cosmopolitan
1
0
Fork 0
mirror of https://github.com/jart/cosmopolitan.git synced 2025-07-24 19:40:28 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Make fatcosmocc good enough to build ncurses 6.4

Browse source
This commit is contained in:
Justine Tunney 2023-08-12 22:30:05 -07:00
parent 399d14aadf
commit 3f2f0e3a74
No known key found for this signature in database
GPG key ID: BE714B4575D6E328
20 changed files with 295 additions and 139 deletions
Download patch file Download diff file Expand all files Collapse all files

4
libc/mem/alg.h
View file

@ -29,8 +29,8 @@ int mergesort_r(void *, size_t, size_t,
#define __algalloc returnspointerwithnoaliases dontthrow nocallback dontdiscard
bool radix_sort_int32(int32_t *, size_t);
bool radix_sort_int64(int64_t *, size_t);
int radix_sort_int32(int32_t *, size_t);
int radix_sort_int64(int64_t *, size_t);
COSMOPOLITAN_C_END_
#endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */

10
libc/mem/radix_sort_int32.c
View file

@ -29,22 +29,22 @@
#define get_byte_1(v) (((v) >> 11) & 0x7FF)
#define get_byte_2_flip_sign(v) (((unsigned)(v) >> 22) ^ 0x200)
bool radix_sort_int32(int32_t *A, size_t n) {
int radix_sort_int32(int32_t *A, size_t n) {
int32_t *T, *reader, *writer;
size_t i, pos, sum0, sum1, sum2, tsum, *b0, *b1, *b2;
if (n < HIST_SIZE) {
_intsort(A, n);
return true;
return 0;
}
if (!(T = (int32_t *)malloc(n * sizeof(int32_t)))) {
return false;
return -1;
}
if (!(b0 = (size_t *)calloc(HIST_SIZE * 3, sizeof(size_t)))) {
free(T);
return false;
return -1;
}
b1 = b0 + HIST_SIZE;
@ -97,5 +97,5 @@ bool radix_sort_int32(int32_t *A, size_t n) {
free(b0);
free(T);
return true;
return 0;
}

10
libc/mem/radix_sort_int64.c
View file

@ -34,23 +34,23 @@
#define get_byte_2_flip_sign(v) (((unsigned)(v) >> 22) ^ 0x200)
#define get_byte_5_flip_sign(v) ((((v) >> 55) & 0x7FF) ^ 0x400)
bool radix_sort_int64(int64_t *A, size_t n) {
int radix_sort_int64(int64_t *A, size_t n) {
int64_t *T, *reader, *writer;
size_t *b0, *b1, *b2, *b3, *b4, *b5;
size_t i, pos, sum0, sum1, sum2, sum3, sum4, sum5, tsum;
if (n < HIST_SIZE) {
_longsort(A, n);
return true;
return 0;
}
if (!(T = (int64_t *)malloc(n * sizeof(int64_t)))) {
return false;
return -1;
}
if (!(b0 = (size_t *)calloc(HIST_SIZE * 6, sizeof(size_t)))) {
free(T);
return false;
return -1;
}
b1 = b0 + HIST_SIZE;
@ -140,5 +140,5 @@ bool radix_sort_int64(int64_t *A, size_t n) {
free(b0);
free(T);
return true;
return 0;
}