/freebsd-11-stable/contrib/jemalloc/src/ |
H A D | bitmap.c | 19 * progressively work upward through the levels until reaching a level 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); 41 return (binfo->levels[binfo->nlevels].group_offset); 61 bitmap[binfo->levels[1].group_offset - 1] >>= extra; 63 size_t group_count = binfo->levels[ [all...] |
H A D | rtree.c | 37 rtree->levels[0].subtree = NULL; 38 rtree->levels[0].bits = (height > 1) ? RTREE_BITS_PER_LEVEL : 40 rtree->levels[0].cumbits = rtree->levels[0].bits; 41 /* Interior levels. */ 43 rtree->levels[i].subtree = NULL; 44 rtree->levels[i].bits = RTREE_BITS_PER_LEVEL; 45 rtree->levels[i].cumbits = rtree->levels[i-1].cumbits + 50 rtree->levels[heigh [all...] |
/freebsd-11-stable/usr.sbin/bhyve/ |
H A D | acpi.h | 52 void dsdt_indent(int levels); 53 void dsdt_unindent(int levels);
|
H A D | acpi.c | 677 dsdt_indent(int levels) argument 680 dsdt_indent_level += levels; 685 dsdt_unindent(int levels) argument 688 assert(dsdt_indent_level >= levels); 689 dsdt_indent_level -= levels;
|
/freebsd-11-stable/sys/kern/ |
H A D | kern_cpu.c | 57 * Number of levels we can handle. Levels are synthesized from settings 58 * so for M settings and N drivers, there may be M*N levels. 106 static int cf_levels_method(device_t dev, struct cf_level *levels, 139 "Don't provide levels below this frequency."); 192 cpufreq_levels_sysctl, "A", "CPU frequency levels"); 195 * Queue a one-shot broadcast that levels have changed. 252 /* We are going to change levels so notify the pre-change handler. */ 308 /* Reject levels that are below our specified threshold. */ 405 * We changed levels (or attempted to) so notify the post-change 419 struct cf_level *levels; local 520 cf_levels_method(device_t dev, struct cf_level *levels, int *count) argument 865 struct cf_level *levels; local 920 struct cf_level *levels; local [all...] |
/freebsd-11-stable/contrib/jemalloc/include/jemalloc/internal/ |
H A D | bitmap.h | 45 * Assuming the number of levels, number of groups required for a given number 74 /* Maximum number of levels possible. */ 99 /* Number of levels necessary for nbits. */ 103 * Only the first (nlevels+1) elements are used, and levels are ordered 104 * bottom to top (e.g. the bottom level is stored in levels[0]). 106 bitmap_level_t levels[BITMAP_MAX_LEVELS+1]; member in struct:bitmap_info_s 138 size_t rgoff = binfo->levels[binfo->nlevels].group_offset - 1; 188 gp = &bitmap[binfo->levels[i].group_offset + goff]; 212 g = bitmap[binfo->levels[i].group_offset]; 216 g = bitmap[binfo->levels[ [all...] |
H A D | rtree.h | 59 * levels[0] : [<unused> | 0x0001******** | 0x0002******** | ...] 61 * levels[1] : [<unused> | 0x00000001**** | 0x00000002**** | ... ] 63 * levels[2] : [val(0x000000000000) | val(0x000000000001) | ...] 91 rtree_level_t levels[RTREE_HEIGHT_MAX]; member in struct:rtree_s 152 rtree->levels[level].cumbits)) & ((ZU(1) << 153 rtree->levels[level].bits) - 1)); 224 subtree = rtree->levels[level].subtree; 226 subtree = atomic_read_p(&rtree->levels[level].subtree_pun);
|
/freebsd-11-stable/crypto/openssl/crypto/x509v3/ |
H A D | pcy_tree.c | 107 curr = tree->levels + tree->nlevel; 111 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); 112 for (plev = tree->levels; plev != curr; plev++) { 114 plev - tree->levels, plev->flags); 229 tree->levels = OPENSSL_malloc(sizeof(X509_POLICY_LEVEL) * n); 235 if (!tree->levels) { 240 memset(tree->levels, 0, n * sizeof(X509_POLICY_LEVEL)); 244 level = tree->levels; 523 if (curr == tree->levels) { 568 curr = tree->levels [all...] |
H A D | pcy_lib.c | 82 return tree->levels + i;
|
H A D | pcy_int.h | 165 X509_POLICY_LEVEL *levels; member in struct:X509_POLICY_TREE_st
|
/freebsd-11-stable/lib/libc/db/btree/ |
H A D | bt_debug.c | 252 int levels; local 276 /* Count the levels of the tree. */ 277 for (i = P_ROOT, levels = 0 ;; ++levels) { 280 if (levels == 0) 281 levels = 1; 290 levels, levels == 1 ? "" : "s", nkeys);
|
/freebsd-11-stable/sys/dev/acpica/ |
H A D | acpi_thermal.c | 60 #define TZ_NOTIFY_LEVELS 0x81 /* Cooling levels changed. */ 521 * Note that the _ACx levels sort from hot to cold. 1034 struct cf_level *levels; local 1037 levels = malloc(CPUFREQ_MAX_LEVELS * sizeof(*levels), M_TEMP, M_NOWAIT); 1038 if (levels == NULL) 1051 error = CPUFREQ_GET(dev, &levels[0]); 1054 freq = levels[0].total_set.freq; 1056 /* Get the current available frequency levels. */ 1058 error = CPUFREQ_LEVELS(dev, levels, [all...] |
H A D | acpi_video.c | 277 * brightness levels. 571 OID_AUTO, "levels", 574 "supported brightness levels"); 976 int num, i, n, *levels; local 996 levels = AcpiOsAllocate(num * sizeof(*levels)); 997 if (levels == NULL) 1000 if (acpi_PkgInt32(res, i, &levels[n]) == 0) 1003 AcpiOsFree(levels); 1006 *levelp = levels; [all...] |
/freebsd-11-stable/sys/x86/x86/ |
H A D | tsc.c | 655 * When cpufreq levels change, find out about the (new) max frequency. We 662 struct cf_level *levels; local 679 levels = malloc(count * sizeof(*levels), M_TEMP, M_NOWAIT); 680 if (levels == NULL) 682 error = CPUFREQ_LEVELS(cf_dev, levels, &count); 684 max_freq = (uint64_t)levels[0].total_set.freq * 1000000; 688 free(levels, M_TEMP);
|
/freebsd-11-stable/contrib/ofed/opensm/opensm/ |
H A D | osm_qos_parser_l.l | 164 QOS_LEVELS_START qos\-levels 165 QOS_LEVELS_END end\-qos\-levels
|
/freebsd-11-stable/sys/fs/ext2fs/ |
H A D | ext2_htree.c | 108 int levels = 0; local 119 levels++; 128 while (levels > 0) { 129 levels--; 239 uint32_t levels, cnt; local 269 if ((levels = rootp->h_info.h_ind_levels) > 1) 299 if (levels == 0) 301 levels--;
|
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | dt_consume.c | 870 uint16_t step, levels; local 881 levels = DTRACE_LQUANTIZE_LEVELS(arg); 884 last_bin = levels + 1; 886 if (size != sizeof (uint64_t) * (levels + 2)) 889 while (first_bin <= levels + 1 && data[first_bin] == 0) 892 if (first_bin > levels + 1) { 902 if (last_bin < levels + 1) 923 } else if (i == levels + 1) { 925 base + (levels * step)); 949 uint16_t step, levels; local 997 int i, first_bin, last_bin, bin = 1, order, levels; local [all...] |
H A D | dt_aggregate.c | 137 uint16_t levels = DTRACE_LQUANTIZE_LEVELS(arg); local 140 for (i = 0; i <= levels + 1; i++) 150 uint16_t levels = DTRACE_LQUANTIZE_LEVELS(arg), i; local 153 for (i = 0; i < levels; base += step, i++) 156 return (total + (long double)lquanta[levels + 1] * 166 uint16_t levels = DTRACE_LQUANTIZE_LEVELS(arg), i; local 171 for (i = 0; i < levels; base += step, i++) { 179 return (lquanta[levels + 1]);
|
/freebsd-11-stable/contrib/libpcap/ |
H A D | optimize.c | 258 struct block **levels; member in struct:__anon4 379 b->link = opt_state->levels[level]; 380 opt_state->levels[level] = b; 384 * Level graph. The levels go from 0 at the leaves to 385 * N_LEVELS at the root. The opt_state->levels[] array points to the 392 memset((char *)opt_state->levels, 0, opt_state->n_blocks * sizeof(*opt_state->levels)); 421 for (b = opt_state->levels[i]; b; b = b->link) { 460 for (b = opt_state->levels[i]; b != 0; b = b->link) { 488 for (b = opt_state->levels[ [all...] |
/freebsd-11-stable/contrib/sendmail/contrib/ |
H A D | expn.pl | 99 # $levels : -1 131 $levels = $flag_1; 300 print "levels = $levels, level{$u *** $server} = ".$level{"$u *** $server"}."\n" if ($debug > 1); 307 if (&trhost($newmxhost) eq &trhost($server) || ($levels && $level{"$u *** $server"} >= $levels)) { 1275 If you wish to limit the number of levels deep that 1283 will traverse no more than three levels deep.
|
/freebsd-11-stable/contrib/amd/scripts/ |
H A D | expn.1 | 101 # $levels : -1 133 $levels = $flag_1; 310 print "levels = $levels, level{$u *** $server} = ".$level{"$u *** $server"}."\n" if ($debug > 1); 317 if (&trhost($newmxhost) eq &trhost($server) || ($levels && $level{"$u *** $server"} >= $levels)) { 1285 If you wish to limit the number of levels deep that 1293 will traverse no more than three levels deep.
|
H A D | expn.in | 100 # $levels : -1 132 $levels = $flag_1; 309 print "levels = $levels, level{$u *** $server} = ".$level{"$u *** $server"}."\n" if ($debug > 1); 316 if (&trhost($newmxhost) eq &trhost($server) || ($levels && $level{"$u *** $server"} >= $levels)) { 1284 If you wish to limit the number of levels deep that 1292 will traverse no more than three levels deep.
|
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | ui-out.c | 108 struct ui_out_level levels[MAX_UI_OUT_LEVELS]; member in struct:ui_out 118 return &uiout->levels[uiout->level]; 1150 memset (uiout->levels, 0, sizeof (uiout->levels));
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_wc/ |
H A D | wc_db_private.h | 79 /* Number of levels locked (0 for infinity) */ member in struct:svn_wc__db_wclock_t 80 int levels;
|
/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/ |
H A D | kmp_affinity.cpp | 292 // the number of levels in the machine topology tree (zero if 310 // places which support arbitrarily many levels in the machine topology 353 int depth, int *levels) { 362 int level = 1; // iterate over levels 366 if (levels[level++] > 0) 371 if (levels[level++] > 0) 374 if (levels[level++] > 0) 378 if (levels[level++] > 0) 392 // This function removes the topology levels that are radix 1 and don't offer 398 int depth, int *levels) { 352 __kmp_affinity_print_hwloc_tp(AddrUnsPair *addrP, int len, int depth, int *levels) argument 397 __kmp_affinity_remove_radix_one_levels(AddrUnsPair *addrP, int nTh, int depth, int *levels) argument 603 int levels[5] = {0, 1, 2, 3, 4}; // package, [node,] [tile,] core, thread local [all...] |