HomeSort by: relevance | last modified time | path
    Searched defs:nlevels (Results 1 - 9 of 9) sorted by relevancy

  /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/
bitmap.h 112 /* nlevels. */ \
157 unsigned nlevels; member in struct:bitmap_info_s
160 * Only the first (nlevels+1) elements are used, and levels are ordered
177 size_t rgoff = binfo->levels[binfo->nlevels].group_offset - 1;
223 for (i = 1; i < binfo->nlevels; i++) {
246 for (unsigned level = binfo->nlevels; level--;) {
308 i = binfo->nlevels - 1;
350 for (i = 1; i < binfo->nlevels; i++) {
  /src/external/bsd/jemalloc.old/include/jemalloc/internal/
bitmap.h 112 /* nlevels. */ \
157 unsigned nlevels; member in struct:bitmap_info_s
160 * Only the first (nlevels+1) elements are used, and levels are ordered
177 size_t rgoff = binfo->levels[binfo->nlevels].group_offset - 1;
223 for (i = 1; i < binfo->nlevels; i++) {
246 for (unsigned level = binfo->nlevels; level--;) {
308 i = binfo->nlevels - 1;
350 for (i = 1; i < binfo->nlevels; i++) {
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
bitmap.h 110 nbits, /* nlevels. */ \
166 unsigned nlevels; member in struct:bitmap_info_s
169 * Only the first (nlevels+1) elements are used, and levels are ordered
186 size_t rgoff = binfo->levels[binfo->nlevels].group_offset - 1;
232 for (i = 1; i < binfo->nlevels; i++) {
255 for (unsigned level = binfo->nlevels; level--;) {
321 i = binfo->nlevels - 1;
363 for (i = 1; i < binfo->nlevels; i++) {
  /src/external/bsd/jemalloc/include/jemalloc/internal/
bitmap.h 110 nbits, /* nlevels. */ \
166 unsigned nlevels; member in struct:bitmap_info_s
169 * Only the first (nlevels+1) elements are used, and levels are ordered
186 size_t rgoff = binfo->levels[binfo->nlevels].group_offset - 1;
232 for (i = 1; i < binfo->nlevels; i++) {
255 for (unsigned level = binfo->nlevels; level--;) {
321 i = binfo->nlevels - 1;
363 for (i = 1; i < binfo->nlevels; i++) {
  /src/sys/external/bsd/drm2/dist/drm/radeon/
radeon_r600_cs.c 1421 unsigned nlevels = llevel - blevel + 1; local
1429 for(i = 0, offset = 0, level = blevel; i < nlevels; i++, level++) {
1608 w0, h0, format, blevel, nlevels, word3, mipmap_size, radeon_bo_size(texture));*/
  /src/external/cddl/osnet/dist/lib/libdtrace/common/
dt_cc.c 1292 uint64_t nlevels, step = 1, oarg; local
1338 nlevels = (limitval - baseval) / step;
1340 if (nlevels == 0) {
1346 if (nlevels > UINT16_MAX) {
1353 (nlevels << DTRACE_LQUANTIZE_LEVELSHIFT) |
1386 if (onlevels * ostep != nlevels * step) {
1391 (int)baseval + (int)nlevels * (int)step);
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
dbuf.c 2145 int nlevels, epbs; local
2166 nlevels = 1;
2168 nlevels = dn->dn_phys->dn_nlevels;
2174 if (level >= nlevels ||
2178 } else if (level < nlevels-1) {
2196 ASSERT3U(level, ==, nlevels-1);
2407 int epbs, nlevels, curlevel; local
2423 nlevels = dn->dn_phys->dn_nlevels;
2424 if (level >= nlevels || dn->dn_phys->dn_nblkptr == 0)
2449 while (curlevel < nlevels - 1)
    [all...]
  /src/external/gpl2/gmake/dist/
read.c 1329 int nlevels = 1;
1371 ++nlevels;
1384 if (--nlevels == 0)
1324 int nlevels = 1; local
  /src/external/mit/lua/dist/src/
lstrlib.c 745 int nlevels = (ms->level == 0 && s) ? 1 : ms->level; local
746 luaL_checkstack(ms->L, nlevels, "too many captures");
747 for (i = 0; i < nlevels; i++)
749 return nlevels; /* number of strings pushed */

Completed in 34 milliseconds