Return time (in seconds) spent by the current process in user mode. Returns 0 if not implemented on platform. */

given the code lengths (as stored in the PNG file), generate the tree as defined by Deflate. maxbitlen is the maximum bits that a code in the tree can

if non-zero byte found, returns bad value address plus 1

* aborts with code 0xFF (lock already held) */

Create callable objects to process and pushes them on the work queue. Each work unit is meant to process a slice of iterable

creates a new chain node with the given parameters, from the memory in the lists */

* Note: this code is harmless on little-endian machines. */

Maximum number of allowed elements

Prevents any more tasks from being submitted to the pool. Once all the tasks have been completed the worker processes will exit.

Ensures that initMemoryManager() is called once and only once. Does not return until initMemoryManager() has been completed by a thread. There is

The "free" analogue to discard a previously allocated piece of memory.

Get ith member of set

Get a random number.