The following cut-down version of printf() avoids using stdio or ostreams. This is to guarantee no recursive calls into the allocator and to bound the

The following cut-down version of printf() avoids using stdio or ostreams. This is to guarantee no recursive calls into the allocator and to bound the

* Internal. * * Does difference calculations that handle wraparound correctly. Earlier must * be associated with the position earlier in memory.

* Internal. * * A pointer to the position one past the end of the backing array. * * Do not call if racy, because both 'bin->stack_head' and 'bin-

* The current decay time setting. This is the only public access to a decay_t * that's allowed without holding mtx. */

Is data collection currently enabled?

Is data collection currently enabled?

* An implementation detail; find the first bit at position >= min_bit with the * value val. * * Returns the number of bits in the bitmap if no such

Finds the number of set bit in the of length cnt starting at start. */

Get last error code. */

/ API. */

We've seen reports that strstr causes heap-checker crashes in some libc's (?): http://code.google.com/p/gperftools/issues/detail?id=263 It's simple en

We've seen reports that strstr causes heap-checker crashes in some libc's (?): http://code.google.com/p/gperftools/issues/detail?id=263 It's simple en

Trylock: return false if the lock is successfully acquired. */

Convert byte size into pages. This won't overflow, but may return an unreasonably large value if bytes is huge enough.

Must be called with the page lock held.

The "extend chain" is broken when we have a conditional where the variable may not be defined after the block. IE: "a" will be defined after the follo

Accessors

Accessors