/minix/external/bsd/llvm/dist/llvm/lib/CodeGen/ |
H A D | SpillPlacement.cpp | 201 delete[] nodes; in releaseMemory() 202 nodes = nullptr; in releaseMemory() 210 nodes[n].clear(Threshold); in activate() 222 nodes[n].BiasP = 0; in activate() 291 if (nodes[ib].Links.empty() && !nodes[ib].mustSpill()) in addLinks() 293 if (nodes[ob].Links.empty() && !nodes[ob].mustSpill()) in addLinks() 305 nodes[n].update(nodes, Threshold); in scanActiveBundles() 308 if (nodes[n].mustSpill()) in scanActiveBundles() 325 nodes[RecentPositive.pop_back_val()].update(nodes, Threshold); in iterate() 344 if (nodes[n].update(nodes, Threshold)) { in iterate() [all …]
|
H A D | SpillPlacement.h | 49 Node *nodes; variable 72 SpillPlacement() : MachineFunctionPass(ID), nodes(nullptr) {} in SpillPlacement()
|
/minix/external/bsd/llvm/dist/llvm/utils/ |
H A D | DSAextract.py | 35 <output_file> [list of nodes to extract]' 98 nodes = arrowexp.split(buffer) variable 99 nodes[0] = string.strip(nodes[0]) 100 nodes[1] = string.strip(nodes[1]) 101 if nodes[0][:13] in node_set and \ 102 nodes[1][:13] in node_set:
|
/minix/crypto/external/bsd/openssl/dist/crypto/x509v3/ |
H A D | pcy_node.c | 77 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes, in tree_find_sk() argument 87 idx = sk_X509_POLICY_NODE_find(nodes, &l); in tree_find_sk() 91 return sk_X509_POLICY_NODE_value(nodes, idx); in tree_find_sk() 101 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) { in level_find_node() 102 node = sk_X509_POLICY_NODE_value(level->nodes, i); in level_find_node() 130 if (!level->nodes) in level_add_node() 131 level->nodes = policy_node_cmp_new(); in level_add_node() 132 if (!level->nodes) in level_add_node() 134 if (!sk_X509_POLICY_NODE_push(level->nodes, node)) in level_add_node()
|
H A D | pcy_tree.c | 116 node = sk_X509_POLICY_NODE_value(plev->nodes, i); in tree_print() 314 node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_matching_nodes() 440 node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_any() 490 STACK_OF(X509_POLICY_NODE) *nodes; in tree_prune() 493 nodes = curr->nodes; in tree_prune() 496 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune() 508 nodes = curr->nodes; in tree_prune() 510 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune() 707 if (curr->nodes) in X509_policy_tree_free() 736 STACK_OF(X509_POLICY_NODE) *nodes, *auth_nodes = NULL; in X509_policy_check() [all …]
|
H A D | pcy_lib.c | 117 if (level->nodes) in X509_policy_level_node_count() 118 n += sk_X509_POLICY_NODE_num(level->nodes); in X509_policy_level_node_count() 131 return sk_X509_POLICY_NODE_value(level->nodes, i); in X509_policy_level_get0_node()
|
/minix/bin/sh/ |
H A D | Makefile | 12 GENSRCS=arith.c arith_lex.c builtins.c init.c nodes.c 13 GENHDRS=arith.h builtins.h nodes.h token.h 73 .ORDER: nodes.h nodes.c 74 nodes.c nodes.h: mknodes.sh nodetypes nodes.c.pat 77 [ -f nodes.h ]
|
/minix/minix/servers/mib/ |
H A D | remote.c | 47 endpts[i].nodes = NULL; in mib_remote_init() 61 assert(endpts[eid].nodes != NULL); in mib_down() 73 endpts[eid].nodes = NULL; in mib_down() 133 assert(endpts[eid].nodes == NULL); in mib_do_register() 174 endpts[eid].nodes = NULL; in mib_do_register() 183 if (endpts[eid].nodes == NULL) in mib_do_register() 190 node->node_next = endpts[eid].nodes; in mib_do_register() 191 endpts[eid].nodes = node; in mib_do_register() 257 for (nodep = &endpts[eid].nodes; *nodep != NULL; in mib_do_deregister() 279 if (endpts[eid].nodes == NULL) { in mib_do_deregister() [all …]
|
/minix/external/bsd/llvm/dist/llvm/test/CodeGen/X86/ |
H A D | 2014-05-30-CombineAddNSW.ll | 7 ; actually generate two different nodes. 12 ; needs to keep the add + sub nodes, because the two nodes result as different 13 ; nodes and so cannot assume that the subtraction of the two nodes
|
H A D | 2008-02-05-ISelCrash.ll | 4 @nodes = external global i64 ; <i64*> [#uses=2] 8 %tmp1 = load i64* @nodes, align 8 ; <i64> [#uses=1] 10 store i64 %tmp2, i64* @nodes, align 8
|
/minix/external/bsd/llvm/dist/llvm/include/llvm/IR/ |
H A D | Metadata.def | 25 // Handler for leaf nodes in the class hierarchy. 30 // Handler for non-leaf nodes in the class hierarchy. 35 // Handler for leaf nodes under UniquableMDNode. 40 // Handler for non-leaf nodes under UniquableMDNode.
|
/minix/external/bsd/llvm/dist/llvm/test/Linker/ |
H A D | unique-fwd-decl-order.ll | 4 ; This test exercises MDNode hashing. For the nodes to be correctly uniqued, 8 ; Note that these two assembly files number the nodes identically, even though 9 ; the nodes are in a different order. This is for the reader's convenience.
|
/minix/external/bsd/llvm/dist/clang/test/CodeGenCXX/ |
H A D | constructor-template.cpp | 17 A nodes; member 39 List<BinomialNode<T>*> nodes; member in BinomialNode
|
/minix/crypto/external/bsd/libsaslc/dist/src/ |
H A D | dict.c | 56 LIST_ENTRY(saslc__dict_node_t) nodes; 141 LIST_REMOVE(node, nodes); in saslc__dict_list_node_destroy() 157 LIST_FOREACH(node, dict, nodes) { in saslc__dict_get_node_by_key() 306 LIST_INSERT_HEAD(dict, node, nodes); in saslc__dict_insert()
|
H A D | mech.c | 121 LIST_INSERT_HEAD(head, node, nodes); in saslc__mech_list_create() 142 LIST_FOREACH(node, list, nodes) { in saslc__mech_list_get() 160 LIST_REMOVE(node, nodes); in saslc__mech_list_destroy()
|
/minix/external/bsd/llvm/dist/clang/include/clang/AST/ |
H A D | CMakeLists.txt | 21 clang_tablegen(StmtNodes.inc -gen-clang-stmt-nodes 25 clang_tablegen(DeclNodes.inc -gen-clang-decl-nodes 29 clang_tablegen(CommentNodes.inc -gen-clang-comment-nodes
|
H A D | Makefile | 42 $(Verb) $(ClangTableGen) -gen-clang-stmt-nodes -o $(call SYSPATH, $@) $< 47 $(Verb) $(ClangTableGen) -gen-clang-decl-nodes -o $(call SYSPATH, $@) $< 52 $(Verb) $(ClangTableGen) -gen-clang-comment-nodes -o $(call SYSPATH, $@) $<
|
/minix/crypto/external/bsd/openssl/dist/util/ |
H A D | mkcerts.sh | 23 -out pca-req.pem -nodes >/dev/null <<EOF 59 -out ca-req.pem -nodes >/dev/null <<EOF 96 -out s512-req.pem -nodes >/dev/null <<EOF 133 -out s1024req.pem -nodes >/dev/null <<EOF 170 -out c512-req.pem -nodes >/dev/null <<EOF
|
/minix/external/bsd/llvm/dist/clang/docs/ |
H A D | RAVFrontendAction.rst | 9 a RecursiveASTVisitor to find CXXRecordDecl AST nodes with a specified 50 // will visit all nodes in the AST. 65 VisitNodeType(NodeType \*) for most AST nodes; the exception are TypeLoc 66 nodes, which are passed by-value. We only need to implement the methods 78 // For debugging, dumping the AST nodes will show which nodes are already 105 identifier information, are not stored in the AST nodes themselves, but 122 do more interesting things with AST nodes, like looking up their source
|
H A D | IntroductionToTheClangAST.rst | 25 Documentation for all Clang AST nodes is available via the generated 75 whose child nodes are a `declaration 95 Clang's AST nodes are modeled on a class hierarchy that does not have a 100 important AST nodes derive from 107 There are also a multitude of nodes in the AST that are not part of a 108 larger hierarchy, and are only reachable from specific other nodes, like 120 The two most basic nodes in the Clang AST are statements
|
H A D | LibASTMatchers.rst | 6 nodes of the AST and execute code that uses the matched nodes. Combined with 21 to write a single program to both match AST nodes and access the node's C++ 25 AST matchers are predicates on nodes in the AST. Matchers are created by 73 Binding nodes in match expressions 77 for a certain task. Often you will want to then do something with the nodes 80 To that end, matchers that match specific AST nodes (so called node matchers) 98 Those match all nodes of type *Base* if they can be dynamically casted to
|
/minix/external/bsd/llvm/dist/llvm/test/Transforms/SimplifyCFG/ |
H A D | PhiBlockMerge2.ll | 1 ; Test merging of blocks that only have PHI nodes in them. This tests the case 2 ; where the mergedinto block doesn't have any PHI nodes, and is in fact
|
H A D | PhiEliminate.ll | 2 ; be able to fold PHI nodes into computation in common cases. Folding the PHI 3 ; nodes away allows the branches to be eliminated, performing a simple form of
|
/minix/external/bsd/bind/dist/lib/dns/ |
H A D | masterdump.c | 215 unsigned int nodes; member 1356 dctx->nodes = 0; in dumpctx_create() 1555 nodes = dctx->nodes; in dumptostreaminc() 1557 while (result == ISC_R_SUCCESS && (dctx->nodes == 0 || nodes--)) { in dumptostreaminc() 1611 dctx->nodes = dctx->nodes * 2; in dumptostreaminc() 1615 nodes = dctx->nodes * interval; in dumptostreaminc() 1617 if (nodes == 0) in dumptostreaminc() 1618 nodes = 1; in dumptostreaminc() 1620 nodes = 1000; in dumptostreaminc() 1623 dctx->nodes = (nodes + dctx->nodes * 7) / 8; in dumptostreaminc() [all …]
|
/minix/crypto/external/bsd/openssl/dist/demos/ssltest-ecc/ |
H A D | RSAcertgen.sh | 49 $OPENSSL_CMD req $OPENSSL_CNF -nodes -subj "$TEST_CA_DN" \ 75 $OPENSSL_CMD req $OPENSSL_CNF -nodes -subj "$TEST_SERVER_DN" \ 100 $OPENSSL_CMD req $OPENSSL_CNF -nodes -subj "$TEST_CLIENT_DN" \
|