'Fast' because it's allowed to change item order

add a custom dic. word to the hash table (public)

Allocate memory. Randomly choose between malloc() or posix_memalign().

Convenience accessor for call_stack[0], i.e. (the program counter of) the immediate caller of this region's allocation function, but it also returns N

Convenience accessor for call_stack[0], i.e. (the program counter of) the immediate caller of this region's allocation function, but it also returns N

* Sets *dst + *src non-atomically. This is safe, since everything is * synchronized by the ctl mutex. */

* We don't officially support reentrancy from wtihin the extent hooks. But * various people who sit within throwing distance of the jemalloc team wa

return the forbidden words control flag

return FULLSTRIP option

return the onlyincompound flag

Returns the errno-style error code of the allocation. */

We could maybe use VirtualAlloc for sbrk as well, but no need */

Check that at least one of the callbacks from Ranges() contains the specified address with the specified type, and has size >= min_size.

Check that at least one of the callbacks from Ranges() contains the specified address with the specified type, and has size >= min_size.

Delays processing by the specified number of nano seconds. 'delay_ns' must be less than the number of nano seconds in a second (1000000000).

Delays processing by the specified number of nano seconds. 'delay_ns' must be less than the number of nano seconds in a second (1000000000).

Ensure that the map contains initialized entries "x .. x+n-1". Returns true if successful, false if we could not allocate memory.

Ensure that the map contains initialized entries "x .. x+n-1". Returns true if successful, false if we could not allocate memory.

64-bit implementations of memory barrier can be simpler, because it "mfence" is guaranteed to exist.

64-bit implementations of memory barrier can be simpler, because it "mfence" is guaranteed to exist.