openbsd/src/lib/libc/stdlib, branch OPENBSD_7_0_BASE A mirror of https://github.com/libressl/openbsd.git https://git.lua4.win/openbsd/atom?h=OPENBSD_7_0_BASE 2021-09-19T09:15:22+00:00 Switch two calls from memset() to explicit_bzero() 2021-09-19T09:15:22+00:00 tb 2021-09-19T09:15:22+00:00 urn:sha1:f7454b8bede1be416adc77267c65bdcb40ee9f98 This matches the documented behavior more obviously and ensures that these aren't optimized away, although this is unlikely. Discussed with deraadt and otto * add the missing STANDARDS section as noticed by tb@ 2021-09-03T16:51:47+00:00 schwarze 2021-09-03T16:51:47+00:00 urn:sha1:d0878530a6d50e4c0bf556299601688b6c952ea9 * mention that the *optionp input string will be modified * clarify that the array of tokens is expected to be NULL-terminated OK millert@ tb@, and the first half of STANDARDS also OK jmc@ Make MALLOC_STATS compile again; noted by Omar Polo and Joe Nelson 2021-07-23T18:04:28+00:00 otto 2021-07-23T18:04:28+00:00 urn:sha1:fe9237f5520de95970a7adf9f41f4a41ea3e156a An extra internal consistency check and a missing stats adjustment. ok tb@ 2021-04-09T06:05:21+00:00 otto 2021-04-09T06:05:21+00:00 urn:sha1:b4499c43f4b32d2e5e054187f8f0e5bfd8299e02 Cache implementation has changed, we do not hold on to an exact number 2021-04-09T06:04:15+00:00 otto 2021-04-09T06:04:15+00:00 urn:sha1:e3d1ed16d000aa151144fb4a5e41cd02144b2cc2 of pages anymore, but also cache larger regions; ok tb@ Type-cast getpagesize() from int to size_t for the comparison with d. 2021-03-18T11:16:58+00:00 claudio 2021-03-18T11:16:58+00:00 urn:sha1:62d150ce3c8b026a91593f3e9531a4b37dc681a9 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@ Change the implementation of the malloc cache to keep lists of 2021-03-09T07:39:28+00:00 otto 2021-03-09T07:39:28+00:00 urn:sha1:d659aeb4a4d7e639792e25febcf5bfce6c61e31e regions of a given size. In snaps for a while, committing since no issues were reported and a wider audience is good. ok deraadt@ - Make use of the fact that we know how the chunks are aligned, and 2021-02-25T15:20:18+00:00 otto 2021-02-25T15:20:18+00:00 urn:sha1:052d36f8658e248c066384b08c925f65e7074586 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:51+00:00 deraadt 2021-02-12T17:03:51+00:00 urn:sha1:96694adb26fa7287b876515de64c63e787de5007 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 mapalign() only handles allocations >= a page; problem found by and ok semarie@ 2020-11-23T15:42:11+00:00 otto 2020-11-23T15:42:11+00:00 urn:sha1:c77e1ca5ca01ce42fde26161844ab04c5c3ae055