Lines Matching refs:i
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
1541 #define bin_at(m, i) \
1542 (mbinptr) (((char *) &((m)->bins[((i) - 1) * 2])) \
1685 The top-most available chunk (i.e., the one bordering the end of
1719 #define idx2block(i) ((i) >> BINMAPSHIFT)
1720 #define idx2bit(i) ((1U << ((i) & ((1U << BINMAPSHIFT) - 1))))
1722 #define mark_bin(m, i) ((m)->binmap[idx2block (i)] |= idx2bit (i))
1723 #define unmark_bin(m, i) ((m)->binmap[idx2block (i)] &= ~(idx2bit (i)))
1724 #define get_binmap(m, i) ((m)->binmap[idx2block (i)] & idx2bit (i))
1962 int i;
1966 for (i = 1; i < NBINS; ++i)
1968 bin = bin_at (av, i);
2237 always true of any allocated chunk; i.e., that each allocated
2263 int i;
2300 for (i = 0; i < NFASTBINS; ++i)
2302 p = fastbin (av, i);
2316 if (av == &main_arena && i > max_fast_bin)
2328 assert (fastbin_index (chunksize (p)) == i);
2334 for (i = 1; i < NBINS; ++i)
2336 b = bin_at (av, i);
2339 if (i >= 2)
2341 unsigned int binbit = get_binmap (av, i);
2355 if (i >= 2)
2359 assert (idx == i);
3205 int i;
3218 for (i = 0; i < TCACHE_MAX_BINS; ++i)
3220 while (tcache_tmp->entries[i])
3222 tcache_entry *e = tcache_tmp->entries[i];
3226 tcache_tmp->entries[i] = REVEAL_PTR (e->next);
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 >=
4537 add (i.e., double free). */
4547 add (i.e., double free). */
5048 for (int i = 1; i < NBINS; ++i)
5049 if (i == 1 || i >= psindex)
5051 mbinptr bin = bin_at (av, i);
5152 size_t i;
5170 for (i = 0; i < NFASTBINS; ++i)
5172 for (p = fastbin (av, i);
5187 for (i = 1; i < NBINS; ++i)
5189 b = bin_at (av, i);
5266 int i;
5275 for (i = 0, ar_ptr = &main_arena;; i++)
5282 fprintf (stderr, "Arena %d:\n", i);
5286 if (i > 0)
5535 else (i.e. If MORECORE_CONTIGUOUS is true):
5755 for (size_t i = 0; i < NFASTBINS; ++i)
5757 mchunkptr p = fastbin (ar_ptr, i);
5774 sizes[i].from = thissize - (MALLOC_ALIGNMENT - 1);
5775 sizes[i].to = thissize;
5776 sizes[i].count = nthissize;
5779 sizes[i].from = sizes[i].to = sizes[i].count = 0;
5781 sizes[i].total = sizes[i].count * sizes[i].to;
5788 for (size_t i = 1; i < NBINS; ++i)
5790 bin = bin_at (ar_ptr, i);
5792 sizes[NFASTBINS - 1 + i].from = ~((size_t) 0);
5793 sizes[NFASTBINS - 1 + i].to = sizes[NFASTBINS - 1 + i].total
5794 = sizes[NFASTBINS - 1 + i].count = 0;
5800 ++sizes[NFASTBINS - 1 + i].count;
5801 sizes[NFASTBINS - 1 + i].total += r_size;
5802 sizes[NFASTBINS - 1 + i].from
5803 = MIN (sizes[NFASTBINS - 1 + i].from, r_size);
5804 sizes[NFASTBINS - 1 + i].to = MAX (sizes[NFASTBINS - 1 + i].to,
5810 if (sizes[NFASTBINS - 1 + i].count == 0)
5811 sizes[NFASTBINS - 1 + i].from = 0;
5812 nblocks += sizes[NFASTBINS - 1 + i].count;
5813 avail += sizes[NFASTBINS - 1 + i].total;
5841 for (size_t i = 0; i < nsizes; ++i)
5842 if (sizes[i].count != 0 && i != NFASTBINS)
5845 sizes[i].from, sizes[i].to, sizes[i].total, sizes[i].count);