wireguard-openbsd/lib/libc, branch master WireGuard implementation for the OpenBSD kernel https://git.zx2c4.com/wireguard-openbsd/atom/lib/libc?h=master 2021-04-02T07:00:30Z swap rname and mname in debug output, and handle the USE_CD flag 2021-04-02T07:00:30Z eric eric@openbsd.org 2021-04-02T07:00:30Z urn:sha1:e6029de668dca0b152b977dcfb59dc86d3340856 from Boudewijn Dijkstra For the snprintf range check demo, add a (size_t) cast in the right place 2021-04-01T14:27:47Z deraadt deraadt@openbsd.org 2021-04-01T14:27:47Z urn:sha1:4af6ccb13c0b15884de7ae705671083a7b06d335 which will satisfy the toughest compiler options Type-cast getpagesize() from int to size_t for the comparison with d. 2021-03-18T11:16:58Z claudio claudio@openbsd.org 2021-03-18T11:16:58Z urn:sha1:2cb7cdfc213f61a57def00eb11d6dce9bd9d43ed getpagesize() will only return positive numbers (there is no negative page size system) and it can not fail. Should fix some compiler warnings seen in -portable projects. OK otto@ Early daemons like dhcpleased(8), slaacd(8), unwind(8), resolvd(8) 2021-03-09T15:08:23Z bluhm bluhm@openbsd.org 2021-03-09T15:08:23Z urn:sha1:5fc6fc53eed51b106058ed08dbfbec744f12aebd are started before syslogd(8). This resulted in ugly sendsyslog(2) dropped logs and the real message was lost. Create a temporary stash for log messages within the kernel. It has a limited size of 100 messages, and each message is truncated to 8192 bytes. When the stash is exhausted, the well-known dropped message is generated with a counter. After syslogd(8) has setup everything, it sends a debug line through libc to flush the kernel stash. Then syslogd receives all messages from the kernel before the usual logs. OK deraadt@ visa@ Change the implementation of the malloc cache to keep lists of 2021-03-09T07:39:28Z otto otto@openbsd.org 2021-03-09T07:39:28Z urn:sha1:c9c2a8bced2637f49891a0cc87ce149229a8c70e regions of a given size. In snaps for a while, committing since no issues were reported and a wider audience is good. ok deraadt@ document ENOTSUP wxallowed/wxneeded behaviour more clearly; ok kurt 2021-03-02T17:43:04Z deraadt deraadt@openbsd.org 2021-03-02T17:43:04Z urn:sha1:fd874303f21d95e37c4b1c2e7e2d403ce351bd90 - Make use of the fact that we know how the chunks are aligned, and 2021-02-25T15:20:18Z otto otto@openbsd.org 2021-02-25T15:20:18Z urn:sha1:19aed9fc1bc211bc77ba2c7c4b875067ff9ef027 write 8 bytes at the time by using a uint64_t pointer. For an allocation a max of 4 such uint64_t's are written spread over the allocation. For pages sized and larger, the first page is junked in such a way. - Delayed free of a small chunk checks the corresponiding way. - Pages ending up in the cache are validated upon unmapping or re-use. In snaps for a while Some people still argue that rand(3) and random(3) have suitable deterministic 2021-02-12T17:03:51Z deraadt deraadt@openbsd.org 2021-02-12T17:03:51Z urn:sha1:70d9094f4044ec4d667009ef66d835cce8e9a22a use cases, so explain the situation a bit more. Since the 80's, I estimate around 5 algorithm changes, so any chosen seed is unrepeatable UB. +The deterministic sequence algorithm changed a number of times since +original development, is underspecified, and should not be relied upon to +remain consistent between platforms and over time. ok jmc kettenis Referece trpt(8) from the SO_DEBUG section of getsockopt(2). 2021-02-04T18:51:01Z bluhm bluhm@openbsd.org 2021-02-04T18:51:01Z urn:sha1:25c653a31002f33b0f9f406fd0ae4377b1a9959a OK claudio@ visa@ Adding a hard-trap instruction after the __threxit syscall instruction 2021-02-03T13:00:39Z kurt kurt@openbsd.org 2021-02-03T13:00:39Z urn:sha1:05b039f4dc11d7662dcf95ccc48b62a2745a5111 broke pthreads on hppa. Reverting. Ok deraadt@