openbsd/src/lib/libc/stdlib, branch OPENBSD_4_7 A mirror of https://github.com/libressl/openbsd.git https://git.lua4.win/openbsd/atom?h=OPENBSD_4_7 2010-03-10T20:46:16+00:00 It's unsetenv() that doesn't like `=' in the argument, not putenv(). 2010-03-10T20:46:16+00:00 kili 2010-03-10T20:46:16+00:00 urn:sha1:a7a853e149f5a2468fd738638c4641dd59d6bc31 ok millert@ Use size_t in appropriate places; fixes sorting of big arrays; 2010-02-08T11:04:07+00:00 otto 2010-02-08T11:04:07+00:00 urn:sha1:f6129285462a0eff1c43458954cfc5ac8b927444 after the diff was written, I made it similar to the freebsd fix of the same code; pr6287 ok millert@ guenther@ use size_t to index arrays; avoids big array bugs; ok millert@ guenther@ 2010-02-08T11:01:52+00:00 otto 2010-02-08T11:01:52+00:00 urn:sha1:51ca5794e1468e2ad153e694158bc7be8a042399 Use MACHINE_CPU instead of MACHINE_ARCH to pick the correct machine dependent 2010-02-03T20:49:00+00:00 miod 2010-02-03T20:49:00+00:00 urn:sha1:aaa0cabd6a83ca6edba4b6122b65033db1337306 files or directories when applicable. The inspiration and name of MACHINE_CPU come from NetBSD, although the way to provide it to Makefiles is completely different. ok kettenis@ stucture -> structure; 2010-01-25T20:14:11+00:00 jmc 2010-01-25T20:14:11+00:00 urn:sha1:8c7079bf6a137a85e4567ee5c8bf073b4e43b1d6 New options 'S', as a shorthand for the options most suitable as an 2010-01-13T12:40:11+00:00 otto 2010-01-13T12:40:11+00:00 urn:sha1:32bffaf97a4c8775ee819b502225c29aa56ef5fe extra safeguard (FGJ). Idea from deraadt@; ok deraadt@ dlg@ save calls to arc4random() by using a nibble at a time; not because 2009-12-16T08:23:53+00:00 otto 2009-12-16T08:23:53+00:00 urn:sha1:c78273410f952558c1d675bfcf90b6852305ccda arc4random() is slow, but it induces getpid() calls; also saves a bit on stirring efforts Make userland malloc use __LDPGSZ granularity on mips, regardless of the 2009-12-07T18:47:38+00:00 miod 2009-12-07T18:47:38+00:00 urn:sha1:66073233547366f9be938315518a5e182a75d3ff actual kernel page size. Switch the chunk_info lists to doubly-linked lists and use the queue 2009-11-27T20:11:01+00:00 otto 2009-11-27T20:11:01+00:00 urn:sha1:2a8fd39cafd30019ffd08560173ae955935d718a macros for them. Avoids walking the lists and greatly enhances speed of freeing chunks in reverse or random order at the cost of a little space. Suggested by Fabien Romano and Jonathan Armani; ok djm@ Don't forget to fill region from the cache with junk if needed in one case; 2009-11-27T20:05:03+00:00 otto 2009-11-27T20:05:03+00:00 urn:sha1:f9b441b4f1b51fd8ca7f43b25fa3bc38fde9ee75 from Fabien Romano and Jonathan Armani