Lines Matching refs:e
36 popular systems (e.g. "make posix" for Posix threads). All that is
53 with ties normally decided via FIFO (i.e. least recently used).
98 (i.e., 8 byte alignment with 4byte size_t). This suffices for
115 Even a request for zero bytes (i.e., malloc(0)) returns a
118 The maximum overhead wastage (i.e., number of extra bytes
558 On systems for which this is known to be useful (i.e. most linux
618 It has no effect if p is null. It can have arbitrary (i.e., bad!)
695 smblks: the number of fastbin blocks (i.e., small chunks that
801 corresponding parameter to the argument value if it can (i.e., so
972 maximum heap size and its alignment. Going above 512k (i.e., 1M
1173 described in e.g., Knuth or Standish. (See the paper by Paul
1685 The top-most available chunk (i.e., the one bordering the end of
2237 always true of any allocated chunk; i.e., that each allocated
3177 tcache_entry *e = (tcache_entry *) chunk2mem (chunk);
3181 e->key = tcache_key;
3183 e->next = PROTECT_PTR (&e->next, tcache->entries[tc_idx]);
3184 tcache->entries[tc_idx] = e;
3193 tcache_entry *e = tcache->entries[tc_idx];
3194 if (__glibc_unlikely (!aligned_OK (e)))
3196 tcache->entries[tc_idx] = REVEAL_PTR (e->next);
3198 e->key = 0;
3199 return (void *) e;
3222 tcache_entry *e = tcache_tmp->entries[i];
3223 if (__glibc_unlikely (!aligned_OK (e)))
3226 tcache_tmp->entries[i] = REVEAL_PTR (e->next);
3227 __libc_free (e);
4247 bin. This search is strictly by best-fit; i.e., the smallest
4362 We require that av->top always exists (i.e., has size >=
4453 tcache_entry *e = (tcache_entry *) chunk2mem (p);
4459 if (__glibc_unlikely (e->key == tcache_key))
4463 LIBC_PROBE (memory_tcache_double_free, 2, e, tc_idx);
4472 if (tmp == e)
4537 add (i.e., double free). */
4547 add (i.e., double free). */
5535 else (i.e. If MORECORE_CONTIGUOUS is true):