/freebsd-current/sys/x86/iommu/ |
H A D | intel_idpgtbl.c | 86 int leaf; /* The last materialized page table member in struct:idpgtbl 125 if (lvl != tbl->leaf) { 131 if (lvl == tbl->leaf) { 169 int leaf, i; local 171 leaf = 0; /* silence gcc */ 178 leaf = i; 186 * supported by the DMAR and leaf should be equal to the 195 tbl->leaf == leaf) { 214 tbl->leaf [all...] |
/freebsd-current/contrib/processor-trace/libipt/src/ |
H A D | pt_packet.c | 290 uint8_t payload, mode, leaf; local 299 leaf = payload & pt_mom_leaf; 302 packet->leaf = (enum pt_mode_leaf) leaf; 303 switch (leaf) {
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 199 // Both leaf and branch nodes store vectors of pairs. 441 // Compute the leaf node branching factor that makes a node fit in three 455 // Now that we have the leaf branching factor, compute the actual allocation 464 /// Allocator - The recycling allocator used for both branch and leaf nodes. 485 // A NodeRef doesn't know whether it references a leaf node or a branch node. 696 // When all of the leaf nodes from all the subtrees are concatenated, they must 697 // satisfy the same constraints as a single leaf node. They must be sorted, 792 /// path - The path entries, path[0] is the root node, path.back() is a leaf. 805 template <typename NodeT> NodeT &leaf() const { 970 RootLeaf leaf; [all...] |
/freebsd-current/contrib/bsnmp/gensnmptree/ |
H A D | gensnmptree.c | 47 * leaf := head type STRING ACCESS ')' 67 * element := tree | leaf | column 198 struct leaf { struct in union:node::__anon259 199 enum snmp_syntax syntax; /* syntax for this leaf */ 202 } leaf; member in union:node::__anon259 840 node->u.leaf.func = savetok(); 841 node->u.leaf.syntax = syntax; 842 node->u.leaf.subtype = subtype; 975 /* leaf or column */ 990 syntax = np->u.leaf [all...] |
/freebsd-current/sys/contrib/openzfs/lib/libspl/include/sys/ |
H A D | simd.h | 111 uint32_t leaf; /* CPUID leaf */ member in struct:cpuid_feature_desc 112 uint32_t subleaf; /* CPUID sub-leaf */ 122 #define _AVX512VBMI_BIT (1U << 1) /* AVX512F_BIT is on another leaf */ 186 if (__get_cpuid_max(0, NULL) >= desc->leaf) { 192 __cpuid_count(desc->leaf, desc->subleaf,
|
/freebsd-current/sys/dev/irdma/ |
H A D | irdma_pble.h | 73 struct irdma_pble_info *leaf; member in struct:irdma_pble_level2
|
/freebsd-current/lib/libc/tests/stdlib/ |
H A D | tsearch_test.c | 65 if (v == postorder || v == leaf)
|
/freebsd-current/sys/contrib/openzfs/module/icp/algs/skein/ |
H A D | skein_impl.h | 125 #define SKEIN_CFG_TREE_INFO(leaf, node, maxLvl) \ 126 ((((uint64_t)(leaf)) << SKEIN_CFG_TREE_LEAF_SIZE_POS) | \
|
/freebsd-current/share/mk/ |
H A D | local.init.mk | 8 # we only want leaf dirs to build in meta mode... and we are not one
|
/freebsd-current/crypto/openssl/test/ |
H A D | crltest.c | 241 * Verify |leaf| certificate (chained up to |root|). |crls| if 246 static int verify(X509 *leaf, X509 *root, STACK_OF(X509_CRL) *crls, argument 264 || !TEST_true(X509_STORE_CTX_init(ctx, store, leaf, NULL)))
|
/freebsd-current/sys/x86/x86/ |
H A D | identcpu.c | 123 u_int cpu_power_eax; /* 06H: Power management leaf, %eax */ 124 u_int cpu_power_ebx; /* 06H: Power management leaf, %ebx */ 125 u_int cpu_power_ecx; /* 06H: Power management leaf, %ecx */ 126 u_int cpu_power_edx; /* 06H: Power management leaf, %edx */ 1379 u_int leaf, regs[4]; local 1394 for (leaf = 0x40000000; leaf < 0x40010000; leaf += 0x100) { 1395 do_cpuid(leaf, regs); 1402 * highest supported leaf i [all...] |
H A D | mp_x86.c | 403 u_int leaf; local 409 /* Prefer leaf 1Fh (V2 Extended Topology Enumeration). */ 411 leaf = 0x1f; 412 cpuid_count(leaf, 0, p); 414 /* Fall back to leaf 0Bh (Extended Topology Enumeration). */ 416 leaf = 0x0b; 417 cpuid_count(leaf, 0, p); 419 /* Fall back to leaf 04h (Deterministic Cache Parameters). */ 427 cpuid_count(leaf, i, p); 469 * via CPUID leaf [all...] |
/freebsd-current/contrib/wpa/src/utils/ |
H A D | xml-utils.c | 210 static char * add_path(const char *prev, const char *leaf) argument 218 len = os_strlen(prev) + 1 + os_strlen(leaf) + 1; 221 os_snprintf(new_uri, len, "%s/%s", prev, leaf);
|
/freebsd-current/crypto/heimdal/lib/roken/ |
H A D | tsearch.c | 82 (*action)(root, leaf, level);
|
/freebsd-current/sys/contrib/libfdt/ |
H A D | fdt_ro.c | 249 * give only the leaf name (after all /). The actual tree 252 const char *leaf; local 253 leaf = strrchr(nameptr, '/'); 254 if (leaf == NULL) { 258 nameptr = leaf+1;
|
/freebsd-current/sys/contrib/xen/arch-x86/ |
H A D | xen.h | 337 uint32_t leaf, subleaf; member in struct:xen_cpuid_leaf
|
/freebsd-current/sys/kern/ |
H A D | subr_pctrie.c | 196 * Returns TRUE if the specified node is a leaf and FALSE otherwise. 206 * Returns val with leaf bit set. 271 * insertion if it replaces a null leaf. Return the insertion location if the 444 * 'node' is not a leaf, this stores into 'newind' the 'owner' field, 795 * Prune all the leaves of 'node' before its first non-leaf child, make child 797 * non-leaf child into 'node'. Repeat until a node has been stripped of all 869 struct pctrie_node *leaf, *parent, *node; local 874 leaf = pctrie_toleaf(newval); 882 ptree->pt_root = leaf; 885 &parent->pn_child[slot], leaf, [all...] |
/freebsd-current/sys/crypto/skein/ |
H A D | skein.h | 215 #define SKEIN_CFG_TREE_INFO(leaf,node,maxLvl) \ 216 ( (((u64b_t)(leaf )) << SKEIN_CFG_TREE_LEAF_SIZE_POS) | \
|
/freebsd-current/crypto/openssh/ |
H A D | xmss_fast.c | 109 * Computes a leaf from a WOTS public key using an L-tree. 111 static void l_tree(unsigned char *leaf, unsigned char *wots_pk, const xmss_params *params, const unsigned char *pub_seed, uint32_t addr[8]) argument 146 memcpy(leaf, wots_pk, n); 150 * Computes the leaf at a given address. First generates the WOTS key pair, then computes leaf using l_tree. As this happens position independent, we only require that addr encodes the right ltree-address. 152 static void gen_leaf_wots(unsigned char *leaf, const unsigned char *sk_seed, const xmss_params *params, const unsigned char *pub_seed, uint32_t ltree_addr[8], uint32_t ots_addr[8]) argument 160 l_tree(leaf, pk, params, pub_seed, ltree_addr); 294 * Computes a root node given a leaf and an authapth 296 static void validate_authpath(unsigned char *root, const unsigned char *leaf, unsigned long leafidx, const unsigned char *authpath, const xmss_params *params, const unsigned char *pub_seed, uint32_t addr[8]) argument 307 buffer[n+j] = leaf[ [all...] |
/freebsd-current/contrib/processor-trace/libipt/test/src/ |
H A D | ptunit-packet.c | 282 pfix->packet[0].payload.mode.leaf = pt_mol_exec; 294 pfix->packet[0].payload.mode.leaf = pt_mol_tsx; 526 enum pt_mode_leaf leaf) 531 pfix->packet[0].payload.mode.leaf = leaf; 525 cutoff_mode(struct packet_fixture *pfix, enum pt_mode_leaf leaf) argument
|
/freebsd-current/contrib/ncurses/progs/ |
H A D | tset.c | 705 char *leaf; local 711 && ((len = (int) strlen(leaf = _nc_basename(var))) >= 3) 712 && !strcmp(leaf + len - 3, "csh"))
|
/freebsd-current/sys/geom/union/ |
H A D | g_union.c | 319 * We totally populate the leaf nodes rather than allocating them 1077 uint64_t **leaf; local 1092 leaf = &sc->sc_writemap_root[root_idx]; 1093 wordp = &(*leaf) 1115 uint64_t *leaf, word; local 1132 /* Check first if the leaf records any written sectors */ 1149 leaf = sc->sc_writemap_root[root_idx]; 1150 word = leaf[(start % sc->sc_bits_per_leaf) / BITS_PER_ENTRY];
|
/freebsd-current/contrib/tcpdump/ |
H A D | print-slow.c | 161 nd_uint16_t leaf; member in struct:slow_oam_variablerequest_t 166 nd_uint16_t leaf; member in struct:slow_oam_variableresponse_t
|
/freebsd-current/sys/contrib/xen/ |
H A D | vm_event.h | 351 uint32_t leaf; member in struct:vm_event_cpuid
|
/freebsd-current/sys/net/ |
H A D | radix.c | 78 static int rn_satisfies_leaf(const char *trial, struct radix_node *leaf, 111 * a key satisfies a normal route, and also in remembering the unique leaf 250 rn_satisfies_leaf(const char *trial, struct radix_node *leaf, int skip) argument 252 const char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask; 297 * match and the leaf we have is the most specific one anyway; 333 * we may match if the leaf we wound up at is 393 * Whenever we add a new leaf to the tree, we also add a parent node, 395 * the leaf (see RNTORT() in route.c), the second one is the parent. 397 * the leaf i [all...] |