Searched refs:av_ (Results 1 – 2 of 2) sorted by relevance
517 #define bin_at(i) ((mbinptr)((char*)&(av_[2*(i) + 2]) - 2*SIZE_SZ))527 #define top (av_[2]) /* The topmost chunk */544 static mbinptr av_[NAV * 2 + 2] = { variable567 mbinptr *p = &av_[2]; in malloc_bin_reloc()570 for (i = 2; i < ARRAY_SIZE(av_); ++i, ++p) in malloc_bin_reloc()663 #define binblocks_r ((INTERNAL_SIZE_T)av_[1]) /* bitvector of nonempty blocks */664 #define binblocks_w (av_[1])1432 av_[1] = (mbinptr)(binblocks_r & ~block);
1399 The bins, `av_' are an array of pairs of pointers serving as the1407 spaced. (See the table below.) The `av_' array is never mentioned1424 (this is implemented via yet more trickery with the av_ array),1436 #define bin_at(i) ((mbinptr)((char*)&(av_[2*(i) + 2]) - 2*SIZE_SZ))1441 The first 2 bins are never indexed. The corresponding av_ cells are instead1463 static mbinptr av_[NAV * 2 + 2] = {