mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-02-01 12:03:41 +00:00
23e235b7a5
This change integrates e58abc1110b335a3341e8ad5821ad8e3880d9bb2 from https://github.com/ahgamut/musl-cross-make/ which fixes the issues we were having with our C language extension for symbolic constants. This change also performs some code cleanup and bug fixes to getaddrinfo(). It's now possible to compile projects like ncurses, readline and python without needing to patch anything upstream, except maybe a line or two. Pretty soon it should be possible to build a Linux distro on Cosmo.
86 lines
4.2 KiB
C
86 lines
4.2 KiB
C
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
│ Copyright 2021 Justine Alexandra Roberts Tunney │
|
|
│ │
|
|
│ Permission to use, copy, modify, and/or distribute this software for │
|
|
│ any purpose with or without fee is hereby granted, provided that the │
|
|
│ above copyright notice and this permission notice appear in all copies. │
|
|
│ │
|
|
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │
|
|
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │
|
|
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │
|
|
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL │
|
|
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR │
|
|
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER │
|
|
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR │
|
|
│ PERFORMANCE OF THIS SOFTWARE. │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "libc/intrin/bits.h"
|
|
#include "libc/zip.h"
|
|
|
|
typedef char v16qi __attribute__((__vector_size__(16)));
|
|
typedef short v8hi __attribute__((__vector_size__(16)));
|
|
typedef long long v2di __attribute__((__vector_size__(16), __aligned__(1)));
|
|
|
|
/**
|
|
* Locates End Of Central Directory record in ZIP file.
|
|
*
|
|
* The ZIP spec says this header can be anywhere in the last 64kb. We
|
|
* search it backwards for the ZIP-64 "PK♠•" magic number. If that's not
|
|
* found, then we search again for the original "PK♣♠" magnum. The
|
|
* caller needs to check the first four bytes of the returned value to
|
|
* determine whether to use ZIP_CDIR_xxx() or ZIP_CDIR64_xxx() macros.
|
|
*
|
|
* @param p points to file memory
|
|
* @param n is byte size of file
|
|
* @param e may receive error code when null is returned
|
|
* @return pointer to EOCD64 or EOCD, otherwise null
|
|
*/
|
|
void *GetZipEocd(const uint8_t *p, size_t n, int *e) {
|
|
v2di x;
|
|
int err;
|
|
size_t i, j;
|
|
uint32_t magic;
|
|
i = n - 4;
|
|
err = kZipErrorEocdNotFound;
|
|
do {
|
|
#ifdef __x86_64__
|
|
v8hi pk = {READ16LE("PK"), READ16LE("PK"), READ16LE("PK"), READ16LE("PK"),
|
|
READ16LE("PK"), READ16LE("PK"), READ16LE("PK"), READ16LE("PK")};
|
|
asm("" : "+x"(pk));
|
|
if (i >= 14) {
|
|
x = *(const v2di *)(p + i - 14);
|
|
if (!(__builtin_ia32_pmovmskb128(
|
|
(v16qi)__builtin_ia32_pcmpeqw128((v8hi)x, pk)) |
|
|
__builtin_ia32_pmovmskb128((v16qi)__builtin_ia32_pcmpeqw128(
|
|
(v8hi)__builtin_ia32_psrldqi128(x, 8), pk)))) {
|
|
i -= 13;
|
|
continue;
|
|
}
|
|
}
|
|
#endif
|
|
while (magic = READ32LE(p + i), magic != kZipCdir64LocatorMagic &&
|
|
magic != kZipCdirHdrMagic &&
|
|
i + 0x10000 + 0x1000 >= n && i > 0) {
|
|
--i;
|
|
}
|
|
if (magic == kZipCdir64LocatorMagic && i + kZipCdir64LocatorSize <= n &&
|
|
(err = IsZipEocd64(p, n, ZIP_LOCATE64_OFFSET(p + i))) == kZipOk) {
|
|
return p + ZIP_LOCATE64_OFFSET(p + i);
|
|
} else if (magic == kZipCdirHdrMagic &&
|
|
(err = IsZipEocd32(p, n, i)) == kZipOk) {
|
|
j = i;
|
|
do {
|
|
if (READ32LE(p + j) == kZipCdir64LocatorMagic &&
|
|
j + kZipCdir64LocatorSize <= n &&
|
|
IsZipEocd64(p, n, ZIP_LOCATE64_OFFSET(p + j)) == kZipOk) {
|
|
return p + ZIP_LOCATE64_OFFSET(p + j);
|
|
}
|
|
} while (j-- && i - j < 128);
|
|
return p + i;
|
|
}
|
|
} while (i > 0 && i-- + 0x10000 + 0x1000 >= n);
|
|
if (e) *e = err;
|
|
return 0;
|
|
}
|