| /external/jemalloc/src/ |
| bitmap.c | 9 bitmap_info_init(bitmap_info_t *binfo, size_t nbits)
22 binfo->levels[0].group_offset = 0;
26 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset
30 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset
32 assert(binfo->levels[i].group_offset <= BITMAP_GROUPS_MAX);
33 binfo->nlevels = i;
34 binfo->nbits = nbits;
38 bitmap_info_ngroups(const bitmap_info_t *binfo)
[all...] |
| /external/jemalloc/test/unit/ |
| bitmap.c | 9 bitmap_info_t binfo; local
12 bitmap_info_init(&binfo, i);
13 size = bitmap_size(&binfo);
26 bitmap_info_t binfo; local
27 bitmap_info_init(&binfo, i);
31 bitmap_size(&binfo));
32 bitmap_init(bitmap, &binfo);
35 assert_false(bitmap_get(bitmap, &binfo, j),
49 bitmap_info_t binfo; local
50 bitmap_info_init(&binfo, i)
72 bitmap_info_t binfo; local
101 bitmap_info_t binfo; local
[all...] |
| /external/jemalloc/include/jemalloc/internal/ |
| bitmap.h | 117 void bitmap_info_init(bitmap_info_t *binfo, size_t nbits);
118 void bitmap_init(bitmap_t *bitmap, const bitmap_info_t *binfo);
119 size_t bitmap_size(const bitmap_info_t *binfo);
126 bool bitmap_full(bitmap_t *bitmap, const bitmap_info_t *binfo);
127 bool bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
128 void bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
129 size_t bitmap_sfu(bitmap_t *bitmap, const bitmap_info_t *binfo);
130 void bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
135 bitmap_full(bitmap_t *bitmap, const bitmap_info_t *binfo)
138 size_t rgoff = binfo->levels[binfo->nlevels].group_offset - 1
[all...] |
| /external/e2fsprogs/debugfs/ |
| icheck.c | 58 struct block_info *binfo; local
158 for (i=0, binfo = bw.barray; i < bw.num_blocks; i++, binfo++) {
159 if (binfo->ino == 0) {
160 printf("%llu\t<block not found>\n", binfo->blk);
163 printf("%llu\t%u\n", binfo->blk, binfo->ino);
|
| /external/iw/ |
| link.c | 118 struct nlattr *binfo[NL80211_STA_BSS_PARAM_MAX + 1]; local
173 if (nla_parse_nested(binfo, NL80211_STA_BSS_PARAM_MAX,
180 if (binfo[NL80211_STA_BSS_PARAM_CTS_PROT]) {
184 if (binfo[NL80211_STA_BSS_PARAM_SHORT_PREAMBLE]) {
188 if (binfo[NL80211_STA_BSS_PARAM_SHORT_SLOT_TIME])
191 nla_get_u8(binfo[NL80211_STA_BSS_PARAM_DTIM_PERIOD]));
193 nla_get_u16(binfo[NL80211_STA_BSS_PARAM_BEACON_INTERVAL]));
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| tree.h | 2438 tree binfo; variable
[all...] |
| /external/opencv3/modules/highgui/src/ |
| window_w32.cpp | 1137 BITMAPINFO* binfo = (BITMAPINFO*)buffer; local
1146 FillBitmapInfo( binfo, size.cx, size.cy, channels*8, 1 );
1148 window->image = SelectObject( window->dc, CreateDIBSection(window->dc, binfo,
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/cp/ |
| cp-tree.h | 167 For a binfo, this is a TREE_LIST. There is an entry for each
168 virtual function declared either in BINFO or its direct and
348 /* The BINFO indicating the base in which lookup found the
351 (((struct tree_baselink*) BASELINK_CHECK (NODE))->binfo)
356 /* The BINFO in which the search for the functions indicated by this baselink
374 tree binfo;
373 tree binfo; variable
5579 tree binfo; member in struct:deferred_access_check
[all...] |
