mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 11:37:35 +00:00
957c61cbbf
This change upgrades to GCC 12.3 and GNU binutils 2.42. The GNU linker appears to have changed things so that only a single de-duplicated str table is present in the binary, and it gets placed wherever the linker wants, regardless of what the linker script says. To cope with that we need to stop using .ident to embed licenses. As such, this change does significant work to revamp how third party licenses are defined in the codebase, using `.section .notice,"aR",@progbits`. This new GCC 12.3 toolchain has support for GNU indirect functions. It lets us support __target_clones__ for the first time. This is used for optimizing the performance of libc string functions such as strlen and friends so far on x86, by ensuring AVX systems favor a second codepath that uses VEX encoding. It shaves some latency off certain operations. It's a useful feature to have for scientific computing for the reasons explained by the test/libcxx/openmp_test.cc example which compiles for fifteen different microarchitectures. Thanks to the upgrades, it's now also possible to use newer instruction sets, such as AVX512FP16, VNNI. Cosmo now uses the %gs register on x86 by default for TLS. Doing it is helpful for any program that links `cosmo_dlopen()`. Such programs had to recompile their binaries at startup to change the TLS instructions. That's not great, since it means every page in the executable needs to be faulted. The work of rewriting TLS-related x86 opcodes, is moved to fixupobj.com instead. This is great news for MacOS x86 users, since we previously needed to morph the binary every time for that platform but now that's no longer necessary. The only platforms where we need fixup of TLS x86 opcodes at runtime are now Windows, OpenBSD, and NetBSD. On Windows we morph TLS to point deeper into the TIB, based on a TlsAlloc assignment, and on OpenBSD/NetBSD we morph %gs back into %fs since the kernels do not allow us to specify a value for the %gs register. OpenBSD users are now required to use APE Loader to run Cosmo binaries and assimilation is no longer possible. OpenBSD kernel needs to change to allow programs to specify a value for the %gs register, or it needs to stop marking executable pages loaded by the kernel as mimmutable(). This release fixes __constructor__, .ctor, .init_array, and lastly the .preinit_array so they behave the exact same way as glibc. We no longer use hex constants to define math.h symbols like M_PI.
363 lines
13 KiB
C
363 lines
13 KiB
C
/*-*- mode:c;indent-tabs-mode:t;c-basic-offset:8;tab-width:8;coding:utf-8 -*-│
|
|
│ vi: set noet ft=c ts=8 sw=8 fenc=utf-8 :vi │
|
|
╚──────────────────────────────────────────────────────────────────────────────╝
|
|
│ │
|
|
│ Musl Libc │
|
|
│ Copyright © 2005-2014 Rich Felker, et al. │
|
|
│ │
|
|
│ Permission is hereby granted, free of charge, to any person obtaining │
|
|
│ a copy of this software and associated documentation files (the │
|
|
│ "Software"), to deal in the Software without restriction, including │
|
|
│ without limitation the rights to use, copy, modify, merge, publish, │
|
|
│ distribute, sublicense, and/or sell copies of the Software, and to │
|
|
│ permit persons to whom the Software is furnished to do so, subject to │
|
|
│ the following conditions: │
|
|
│ │
|
|
│ The above copyright notice and this permission notice shall be │
|
|
│ included in all copies or substantial portions of the Software. │
|
|
│ │
|
|
│ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, │
|
|
│ EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF │
|
|
│ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. │
|
|
│ IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY │
|
|
│ CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, │
|
|
│ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE │
|
|
│ SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. │
|
|
│ │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "libc/calls/calls.h"
|
|
#include "libc/calls/struct/timespec.h"
|
|
#include "libc/calls/weirdtypes.h"
|
|
#include "libc/dce.h"
|
|
#include "libc/errno.h"
|
|
#include "libc/sock/sock.h"
|
|
#include "libc/sock/sock.h"
|
|
#include "libc/sock/struct/msghdr.h"
|
|
#include "libc/sock/struct/pollfd.h"
|
|
#include "libc/str/str.h"
|
|
#include "libc/sysv/consts/af.h"
|
|
#include "libc/sysv/consts/clock.h"
|
|
#include "libc/sysv/consts/ipproto.h"
|
|
#include "libc/sysv/consts/ipv6.h"
|
|
#include "libc/sysv/consts/msg.h"
|
|
#include "libc/sysv/consts/poll.h"
|
|
#include "libc/sysv/consts/sock.h"
|
|
#include "libc/sysv/consts/tcp.h"
|
|
#include "libc/thread/thread.h"
|
|
#include "lookup.internal.h"
|
|
__static_yoink("musl_libc_notice");
|
|
|
|
static void cleanup(void *p)
|
|
{
|
|
struct pollfd *pfd = p;
|
|
for (int i=0; pfd[i].fd >= -1; i++)
|
|
if (pfd[i].fd >= 0)
|
|
close(pfd[i].fd);
|
|
}
|
|
|
|
static unsigned long mtime()
|
|
{
|
|
struct timespec ts;
|
|
if (clock_gettime(CLOCK_MONOTONIC, &ts) < 0 && errno == ENOSYS)
|
|
clock_gettime(CLOCK_REALTIME, &ts);
|
|
return (unsigned long)ts.tv_sec * 1000
|
|
+ ts.tv_nsec / 1000000;
|
|
}
|
|
|
|
static int start_tcp(struct pollfd *pfd, int family, const void *sa, socklen_t sl, const unsigned char *q, int ql)
|
|
{
|
|
struct msghdr mh = {
|
|
.msg_name = (void *)sa,
|
|
.msg_namelen = sl,
|
|
.msg_iovlen = 2,
|
|
.msg_iov = (struct iovec [2]){
|
|
{ .iov_base = (uint8_t[]){ ql>>8, ql }, .iov_len = 2 },
|
|
{ .iov_base = (void *)q, .iov_len = ql } }
|
|
};
|
|
int r;
|
|
int fd = socket(family, SOCK_STREAM|SOCK_CLOEXEC|SOCK_NONBLOCK, 0);
|
|
pfd->fd = fd;
|
|
pfd->events = POLLOUT;
|
|
if (IsLinux() &&
|
|
!setsockopt(fd, IPPROTO_TCP, TCP_FASTOPEN_CONNECT,
|
|
&(int){1}, sizeof(int))) {
|
|
r = sendmsg(fd, &mh, MSG_FASTOPEN|MSG_NOSIGNAL);
|
|
if (r == ql+2) pfd->events = POLLIN;
|
|
if (r >= 0) return r;
|
|
if (errno == EINPROGRESS) return 0;
|
|
}
|
|
r = connect(fd, sa, sl);
|
|
if (!r || errno == EINPROGRESS) return 0;
|
|
close(fd);
|
|
pfd->fd = -1;
|
|
return -1;
|
|
}
|
|
|
|
static void step_mh(struct msghdr *mh, size_t n)
|
|
{
|
|
/* Adjust iovec in msghdr to skip first n bytes. */
|
|
while (mh->msg_iovlen && n >= mh->msg_iov->iov_len) {
|
|
n -= mh->msg_iov->iov_len;
|
|
mh->msg_iov++;
|
|
mh->msg_iovlen--;
|
|
}
|
|
if (!mh->msg_iovlen) return;
|
|
mh->msg_iov->iov_base = (char *)mh->msg_iov->iov_base + n;
|
|
mh->msg_iov->iov_len -= n;
|
|
}
|
|
|
|
/* Internal contract for __res_msend[_rc]: asize must be >=512, nqueries
|
|
* must be sufficiently small to be safe as VLA size. In practice it's
|
|
* either 1 or 2, anyway. */
|
|
|
|
int __res_msend_rc(int nqueries, const unsigned char *const *queries,
|
|
const int *qlens, unsigned char *const *answers, int *alens, int asize,
|
|
const struct resolvconf *conf)
|
|
{
|
|
int fd;
|
|
int timeout, attempts, retry_interval, servfail_retry = 0;
|
|
union {
|
|
struct sockaddr_in sin;
|
|
struct sockaddr_in6 sin6;
|
|
} sa = {0}, ns[MAXNS] = {0};
|
|
socklen_t sl = sizeof sa.sin;
|
|
int nns = 0;
|
|
int family = AF_INET;
|
|
int rlen;
|
|
int next;
|
|
int i, j;
|
|
int cs;
|
|
struct pollfd pfd[nqueries+2];
|
|
int qpos[nqueries], apos[nqueries];
|
|
unsigned char alen_buf[nqueries][2];
|
|
int r;
|
|
unsigned long t0, t1, t2;
|
|
|
|
pthread_setcancelstate(PTHREAD_CANCEL_DISABLE, &cs);
|
|
|
|
timeout = 1000*conf->timeout;
|
|
attempts = conf->attempts;
|
|
|
|
for (nns=0; nns<conf->nns; nns++) {
|
|
const struct address *iplit = &conf->ns[nns];
|
|
if (iplit->family == AF_INET) {
|
|
memcpy(&ns[nns].sin.sin_addr, iplit->addr, 4);
|
|
ns[nns].sin.sin_port = htons(53);
|
|
ns[nns].sin.sin_family = AF_INET;
|
|
} else {
|
|
sl = sizeof sa.sin6;
|
|
memcpy(&ns[nns].sin6.sin6_addr, iplit->addr, 16);
|
|
ns[nns].sin6.sin6_port = htons(53);
|
|
ns[nns].sin6.sin6_scope_id = iplit->scopeid;
|
|
ns[nns].sin6.sin6_family = family = AF_INET6;
|
|
}
|
|
}
|
|
|
|
/* Get local address and open/bind a socket */
|
|
fd = socket(family, SOCK_DGRAM|SOCK_CLOEXEC|SOCK_NONBLOCK, 0);
|
|
|
|
/* Handle case where system lacks IPv6 support */
|
|
if (fd < 0 && family == AF_INET6 && errno == EAFNOSUPPORT) {
|
|
for (i=0; i<nns && conf->ns[nns].family == AF_INET6; i++);
|
|
if (i==nns) {
|
|
pthread_setcancelstate(cs, 0);
|
|
return -1;
|
|
}
|
|
fd = socket(AF_INET, SOCK_DGRAM|SOCK_CLOEXEC|SOCK_NONBLOCK, 0);
|
|
family = AF_INET;
|
|
sl = sizeof sa.sin;
|
|
}
|
|
|
|
/* Convert any IPv4 addresses in a mixed environment to v4-mapped */
|
|
if (fd >= 0 && family == AF_INET6) {
|
|
setsockopt(fd, IPPROTO_IPV6, IPV6_V6ONLY, &(int){0}, sizeof 0);
|
|
for (i=0; i<nns; i++) {
|
|
if (ns[i].sin.sin_family != AF_INET) continue;
|
|
memcpy(ns[i].sin6.sin6_addr.s6_addr+12,
|
|
&ns[i].sin.sin_addr, 4);
|
|
memcpy(ns[i].sin6.sin6_addr.s6_addr,
|
|
"\0\0\0\0\0\0\0\0\0\0\xff\xff", 12);
|
|
ns[i].sin6.sin6_family = AF_INET6;
|
|
ns[i].sin6.sin6_flowinfo = 0;
|
|
ns[i].sin6.sin6_scope_id = 0;
|
|
}
|
|
}
|
|
|
|
sa.sin.sin_family = family;
|
|
if (fd < 0 || bind(fd, (void *)&sa, sl) < 0) {
|
|
if (fd >= 0) close(fd);
|
|
pthread_setcancelstate(cs, 0);
|
|
return -1;
|
|
}
|
|
|
|
/* Past this point, there are no errors. Each individual query will
|
|
* yield either no reply (indicated by zero length) or an answer
|
|
* packet which is up to the caller to interpret. */
|
|
|
|
for (i=0; i<nqueries; i++) pfd[i].fd = -1;
|
|
pfd[nqueries].fd = fd;
|
|
pfd[nqueries].events = POLLIN;
|
|
pfd[nqueries+1].fd = -2;
|
|
|
|
pthread_cleanup_push(cleanup, pfd);
|
|
pthread_setcancelstate(cs, 0);
|
|
|
|
memset(alens, 0, sizeof *alens * nqueries);
|
|
|
|
retry_interval = timeout / attempts;
|
|
next = 0;
|
|
t0 = t2 = mtime();
|
|
t1 = t2 - retry_interval;
|
|
|
|
for (; t2-t0 < timeout; t2=mtime()) {
|
|
/* This is the loop exit condition: that all queries
|
|
* have an accepted answer. */
|
|
for (i=0; i<nqueries && alens[i]>0; i++);
|
|
if (i==nqueries) break;
|
|
|
|
if (t2-t1 >= retry_interval) {
|
|
/* Query all configured namservers in parallel */
|
|
for (i=0; i<nqueries; i++)
|
|
if (!alens[i])
|
|
for (j=0; j<nns; j++)
|
|
sendto(fd, queries[i],
|
|
qlens[i], MSG_NOSIGNAL,
|
|
(void *)&ns[j], sl);
|
|
t1 = t2;
|
|
servfail_retry = 2 * nqueries;
|
|
}
|
|
|
|
/* Wait for a response, or until time to retry */
|
|
if (poll(pfd, nqueries+1, t1+retry_interval-t2) <= 0) continue;
|
|
|
|
while (next < nqueries) {
|
|
struct msghdr mh = {
|
|
.msg_name = (void *)&sa,
|
|
.msg_namelen = sl,
|
|
.msg_iovlen = 1,
|
|
.msg_iov = (struct iovec []){
|
|
{ .iov_base = (void *)answers[next],
|
|
.iov_len = asize }
|
|
}
|
|
};
|
|
rlen = recvmsg(fd, &mh, 0);
|
|
if (rlen < 0) break;
|
|
|
|
/* Ignore non-identifiable packets */
|
|
if (rlen < 4) continue;
|
|
|
|
/* Ignore replies from addresses we didn't send to */
|
|
for (j=0; j<nns && memcmp(ns+j, &sa, sl); j++);
|
|
if (j==nns) continue;
|
|
|
|
/* Find which query this answer goes with, if any */
|
|
for (i=next; i<nqueries && (
|
|
answers[next][0] != queries[i][0] ||
|
|
answers[next][1] != queries[i][1] ); i++);
|
|
if (i==nqueries) continue;
|
|
if (alens[i]) continue;
|
|
|
|
/* Only accept positive or negative responses;
|
|
* retry immediately on server failure, and ignore
|
|
* all other codes such as refusal. */
|
|
switch (answers[next][3] & 15) {
|
|
case 0:
|
|
case 3:
|
|
break;
|
|
case 2:
|
|
if (servfail_retry && servfail_retry--)
|
|
sendto(fd, queries[i],
|
|
qlens[i], MSG_NOSIGNAL,
|
|
(void *)&ns[j], sl);
|
|
default:
|
|
continue;
|
|
}
|
|
|
|
/* Store answer in the right slot, or update next
|
|
* available temp slot if it's already in place. */
|
|
alens[i] = rlen;
|
|
if (i == next)
|
|
for (; next<nqueries && alens[next]; next++);
|
|
else
|
|
memcpy(answers[i], answers[next], rlen);
|
|
|
|
/* Ignore further UDP if all slots full or TCP-mode */
|
|
if (next == nqueries) pfd[nqueries].events = 0;
|
|
|
|
/* If answer is truncated (TC bit), fallback to TCP */
|
|
if ((answers[i][2] & 2) || (mh.msg_flags & MSG_TRUNC)) {
|
|
alens[i] = -1;
|
|
pthread_setcancelstate(PTHREAD_CANCEL_DISABLE, 0);
|
|
r = start_tcp(pfd+i, family, ns+j, sl, queries[i], qlens[i]);
|
|
pthread_setcancelstate(cs, 0);
|
|
if (r >= 0) {
|
|
qpos[i] = r;
|
|
apos[i] = 0;
|
|
}
|
|
continue;
|
|
}
|
|
}
|
|
|
|
for (i=0; i<nqueries; i++) {
|
|
if (pfd[i].revents & POLLOUT) {
|
|
struct msghdr mh = {
|
|
.msg_iovlen = 2,
|
|
.msg_iov = (struct iovec [2]){
|
|
{ .iov_base = (uint8_t[]){ qlens[i]>>8, qlens[i] }, .iov_len = 2 },
|
|
{ .iov_base = (void *)queries[i], .iov_len = qlens[i] } }
|
|
};
|
|
step_mh(&mh, qpos[i]);
|
|
r = sendmsg(pfd[i].fd, &mh, MSG_NOSIGNAL);
|
|
if (r < 0) goto out;
|
|
qpos[i] += r;
|
|
if (qpos[i] == qlens[i]+2)
|
|
pfd[i].events = POLLIN;
|
|
}
|
|
}
|
|
|
|
for (i=0; i<nqueries; i++) {
|
|
if (pfd[i].revents & POLLIN) {
|
|
struct msghdr mh = {
|
|
.msg_iovlen = 2,
|
|
.msg_iov = (struct iovec [2]){
|
|
{ .iov_base = alen_buf[i], .iov_len = 2 },
|
|
{ .iov_base = answers[i], .iov_len = asize } }
|
|
};
|
|
step_mh(&mh, apos[i]);
|
|
r = recvmsg(pfd[i].fd, &mh, 0);
|
|
if (r <= 0) goto out;
|
|
apos[i] += r;
|
|
if (apos[i] < 2) continue;
|
|
int alen = alen_buf[i][0]*256 + alen_buf[i][1];
|
|
if (alen < 13) goto out;
|
|
if (apos[i] < alen+2 && apos[i] < asize+2)
|
|
continue;
|
|
int rcode = answers[i][3] & 15;
|
|
if (rcode != 0 && rcode != 3)
|
|
goto out;
|
|
|
|
/* Storing the length here commits the accepted answer.
|
|
* Immediately close TCP socket so as not to consume
|
|
* resources we no longer need. */
|
|
alens[i] = alen;
|
|
close(pfd[i].fd);
|
|
pfd[i].fd = -1;
|
|
}
|
|
}
|
|
}
|
|
out:
|
|
pthread_cleanup_pop(1);
|
|
|
|
/* Disregard any incomplete TCP results */
|
|
for (i=0; i<nqueries; i++) if (alens[i]<0) alens[i] = 0;
|
|
|
|
return 0;
|
|
}
|
|
|
|
int __res_msend(int nqueries, const unsigned char *const *queries,
|
|
const int *qlens, unsigned char *const *answers, int *alens, int asize)
|
|
{
|
|
struct resolvconf conf;
|
|
if (__get_resolv_conf(&conf, 0, 0) < 0) return -1;
|
|
return __res_msend_rc(nqueries, queries, qlens, answers, alens, asize, &conf);
|
|
}
|