Home
last modified time | relevance | path

Searched full:nodes (Results 1 – 25 of 2548) sorted by relevance

12345678910>>...102

/freebsd-src/contrib/llvm-project/llvm/lib/Support/
H A DBalancedPartitioning.cpp78 void BalancedPartitioning::run(std::vector<BPFunctionNode> &Nodes) const { in run()
81 "Partitioning %d nodes using depth %d and %d iterations per split\n", in run()
82 Nodes.size(), Config.SplitDepth, Config.IterationsPerSplit)); in run()
91 for (unsigned I = 0; I < Nodes.size(); I++) in run()
92 Nodes[I].InputOrderIndex = I; in run()
94 auto NodesRange = llvm::make_range(Nodes.begin(), Nodes.end()); in run()
112 void BalancedPartitioning::bisect(const FunctionNodeRange Nodes, in bisect() argument
116 unsigned NumNodes = std::distance(Nodes.begin(), Nodes in bisect()
165 runIterations(const FunctionNodeRange Nodes,unsigned RecDepth,unsigned LeftBucket,unsigned RightBucket,std::mt19937 & RNG) const runIterations() argument
208 runIteration(const FunctionNodeRange Nodes,unsigned LeftBucket,unsigned RightBucket,SignaturesT & Signatures,std::mt19937 & RNG) const runIteration() argument
301 split(const FunctionNodeRange Nodes,unsigned StartBucket) const split() argument
[all...]
/freebsd-src/contrib/llvm-project/clang/lib/Analysis/
H A DIntervalPartition.cpp26 // number of nodes, vector should be sufficiently efficient. Elements must not
28 std::vector<const Node *> Nodes; member
43 Interval.Nodes.push_back(Header); in buildInterval()
46 // FIXME: Compare performance against using RPO to consider nodes, rather than in buildInterval()
79 return llvm::is_contained(Interval.Nodes, P); in buildInterval()
82 Interval.Nodes.push_back(B); in buildInterval()
98 if (!llvm::is_contained(Interval.Nodes, B)) in buildInterval()
115 // Index the nodes of the new interval. The index maps nodes from the input in fillIntervalNode()
116 // graph (specifically, `Result.Nodes`) to identifiers of nodes in the output in fillIntervalNode()
118 // nodes (`Result.Nodes`) map to `ID`. in fillIntervalNode()
[all …]
/freebsd-src/contrib/ofed/librdmacm/examples/
H A Dcmtime.c102 static struct node *nodes; variable
171 if (!zero_time(&nodes[c].times[i][0]) && in show_perf()
172 !zero_time(&nodes[c].times[i][1])) { in show_perf()
173 us = diff_us(&nodes[c].times[i][1], &nodes[c].times[i][0]); in show_perf()
355 nodes = calloc(sizeof *nodes, connections); in alloc_nodes()
356 if (!nodes) in alloc_nodes()
362 start_perf(&nodes[i], STEP_CREATE_ID); in alloc_nodes()
364 ret = rdma_create_id(channel, &nodes[i].id, &nodes[i], in alloc_nodes()
369 end_perf(&nodes[i], STEP_CREATE_ID); in alloc_nodes()
376 rdma_destroy_id(nodes[i].id); in alloc_nodes()
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDirectedGraph.h116 /// a given pair of nodes.
170 /// The graph is represented by a table of nodes.
183 explicit DirectedGraph(NodeType &N) : Nodes() { addNode(N); } in DirectedGraph()
184 DirectedGraph(const DGraphType &G) : Nodes(G.Nodes) {} in DirectedGraph()
185 DirectedGraph(DGraphType &&RHS) : Nodes(std::move(RHS.Nodes)) {} in DirectedGraph()
187 Nodes = G.Nodes;
191 Nodes = std::move(G.Nodes);
195 const_iterator begin() const { return Nodes.begin(); } in begin()
196 const_iterator end() const { return Nodes.end(); } in end()
197 iterator begin() { return Nodes.begin(); } in begin()
[all …]
/freebsd-src/sys/contrib/device-tree/Bindings/usb/
H A Dusb-device.txt7 Four types of device-tree nodes are defined: "host-controller nodes"
8 representing USB host controllers, "device nodes" representing USB devices,
9 "interface nodes" representing USB interfaces and "combined nodes"
20 Required properties for device nodes:
30 Required properties for device nodes with interface nodes:
35 Required properties for interface nodes:
49 Required properties for combined nodes:
59 Required properties for hub nodes with device nodes:
64 Required properties for host-controller nodes with device nodes:
H A Dusb-device.yaml17 Four types of device-tree nodes are defined: "host-controller nodes"
18 representing USB host controllers, "device nodes" representing USB devices,
19 "interface nodes" representing USB interfaces and "combined nodes"
32 description: Device nodes or combined nodes.
46 description: should be 1 for hub nodes with device nodes,
47 should be 2 for device nodes with interface nodes.
56 description: USB interface nodes.
63 description: Interface nodes.
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDependenceGraphBuilder.h49 /// creating nodes in increasing order of granularity and then
51 /// also creates pi-block nodes to facilitate codegen in transformations
55 /// is the number of vertecies (nodes) and I is the number of instructions in
72 /// in turn used to order nodes that are part of a cycle.
76 /// Create fine grained nodes. These are typically atomic nodes that
80 /// Analyze the def-use chains and create edges from the nodes containing
81 /// definitions to the nodes containing the uses.
85 /// in the graph nodes and create edges between them.
92 /// Apply graph abstraction to groups of nodes that belong to a strongly
93 /// connected component of the graph to create larger compound nodes
[all …]
H A DInterval.h
/freebsd-src/sys/contrib/device-tree/Bindings/cpu/
H A Dcpu-topology.txt20 For instance in a system where CPUs support SMT, "cpu" nodes represent all
22 In systems where SMT is not supported "cpu" nodes represent all cores present
25 CPU topology bindings allow one to associate cpu nodes with hierarchical groups
27 tree nodes.
32 The cpu nodes, as per bindings defined in [4], represent the devices that
35 A topology description containing phandles to cpu nodes that are not compliant
44 nodes are listed.
60 The cpu-map node's child nodes can be:
62 - one or more cluster nodes or
63 - one or more socket nodes in a multi-socket system
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/
H A DSpillPlacement.cpp70 /// value can change when linked nodes change, but convergence is very fast
95 // Undecided nodes (Value==0) go on the stack. in preferReg()
151 bool update(const Node nodes[], BlockFrequency Threshold) { in update()
156 if (nodes[L.second].Value == -1) in update()
158 else if (nodes[L.second].Value == 1) in update()
181 const Node nodes[]) const { in getDissentingNeighbors()
186 if (Value != nodes[n].Value) in getDissentingNeighbors()
196 assert(!nodes && "Leaking node array"); in runOnMachineFunction()
197 nodes = new Node[bundles->getNumBundles()]; in runOnMachineFunction()
215 delete[] nodes; in releaseMemory()
[all...]
/freebsd-src/sys/netpfil/ipfilter/netinet/
H A Dradix_ipf.c33 ipf_rdx_node_t nodes[2], int *);
92 /* nodes(O) - pair of ipf_rdx_node_t's to initialise with data */
95 /* Initialise the fields in a pair of radix tree nodes according to the */
101 buildnodes(addrfamily_t *addr, addrfamily_t *mask, ipf_rdx_node_t nodes[2]) in buildnodes()
118 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2); in buildnodes()
119 nodes[0].maskbitcount = maskbits; in buildnodes()
120 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits); in buildnodes()
121 nodes[0].addrkey = (u_32_t *)addr; in buildnodes()
122 nodes[0].maskkey = (u_32_t *)mask; in buildnodes()
123 nodes[0].addroff = nodes[0].addrkey + masklen; in buildnodes()
[all …]
/freebsd-src/bin/sh/
H A DMakefile18 GENSRCS= builtins.c nodes.c syntax.c
19 GENHDRS= builtins.h nodes.h syntax.h token.h
47 nodes.c nodes.h: mknodes
56 .ORDER: nodes.c nodes.h
57 nodes.h: .NOMETA
58 nodes.c nodes.h: nodetypes nodes
[all...]
/freebsd-src/share/man/man4/
H A Dnetgraph.450 .Em nodes ,
52 Nodes have
54 which are used to connect two nodes together, forming the edges in the graph.
55 Nodes communicate along the edges to process data, implement protocols, etc.
73 .Ss Nodes and Types
78 All nodes implement a number of predefined methods which allow them
79 to interact with other nodes in a well defined manner.
88 to other nodes.
90 In object-oriented language, types are classes, and nodes are instances
98 Nodes may be assigned a globally unique
[all …]
/freebsd-src/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h79 /// common case in an ExplodedGraph, where most nodes have only one
83 /// empty and no nodes may be added.
87 // for the nodes in the group.
268 /// Trivial nodes may be skipped while printing exploded graph.
316 /// The nodes in the simulation graph which have been
320 /// Nodes - The nodes in the graph.
321 llvm::FoldingSet<ExplodedNode> Nodes; variable
323 /// BVC - Allocator and context for allocating nodes and their predecessor
327 /// NumNodes - The number of nodes in the graph.
330 /// A list of recently allocated nodes that can potentially be recycled.
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Analysis/
H A DDependenceGraphBuilder.cpp27 STATISTIC(TotalFineGrainedNodes, "Number of fine-grained nodes created.");
28 STATISTIC(TotalPiBlockNodes, "Number of pi-block nodes created.");
30 "Number of confused memory dependencies between two nodes.");
71 // root node and N (if N is not yet visited). All the nodes reachable from N in createAndConnectRootNode()
72 // are marked as visited and are skipped in the DFS of subsequent nodes. in createAndConnectRootNode()
77 // root node is added to both nodes if B is visited before A. While it does in createAndConnectRootNode()
99 // the nodes in that SCC. in createPiBlocks()
100 // 2. Identify incoming edges incident to the nodes inside of the SCC and in createPiBlocks()
102 // 3. Identify outgoing edges from the nodes inside of the SCC to nodes in createPiBlocks()
106 // Adding nodes as we iterate through the SCCs cause the SCC in createPiBlocks()
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp84 /// of nodes (source and sink). The output is the flow along each edge of the
95 Nodes = std::vector<Node>(NodeCount); in initialize()
104 LLVM_DEBUG(dbgs() << "Starting profi for " << Nodes.size() << " nodes\n"); in run()
113 for (uint64_t Src = 0; Src < Nodes.size(); Src++) { in run()
131 /// Multiple edges between a pair of nodes are allowed but self-edges
171 /// Get the total flow between a pair of nodes.
220 uint64_t Pred = Nodes[Now].ParentNode; in computeAugmentingPathCapacity()
221 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex]; in computeAugmentingPathCapacity()
235 for (auto &Node : Nodes) { in findAugmentingPath()
571 std::vector<Node> Nodes; global() member in __anoncacc37820111::MinCostMaxFlow
[all...]
H A DCodeLayout.cpp12 // The algorithm tries to find a layout of nodes (basic blocks) of a given CFG
15 // frequently executed nodes together. The name follows the underlying
259 /// An arc in the graph, typically corresponding to a jump between two nodes.
281 /// A chain (ordered sequence) of nodes in the graph.
290 Nodes(1, Node) {} in ChainT()
292 size_t numBlocks() const { return Nodes.size(); } in numBlocks()
296 bool isEntry() const { return Nodes[0]->Index == 0; } in isEntry()
299 for (NodeT *Node : Nodes) { in isCold()
330 Nodes = std::move(MergedBlocks); in merge()
334 Id = Nodes[0]->Index; in merge()
[all …]
/freebsd-src/sys/contrib/device-tree/Bindings/pinctrl/
H A Dmeson,pinctrl.txt22 === GPIO sub-nodes ===
27 Required properties for sub-nodes are:
36 === Other sub-nodes ===
38 Child nodes without the "gpio-controller" represent some desired
39 configuration for a pin or a group. Those nodes can be pinmux nodes or
40 configuration nodes.
42 Required properties for pinmux nodes are:
49 Required properties for configuration nodes:
52 Configuration nodes support the following generic properties, as
/freebsd-src/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DIntervalPartition.h10 // building a weak topological order (WTO) of the nodes, based on the
29 /// A _weak topological ordering_ (WTO) of CFG nodes provides a total order over
31 /// to visit nodes in fixpoint computations over the CFG.
34 /// their bodies and any nodes they dominate after the loop and b) orders the
36 /// ordered such that all nodes in loop `i` are earlier in the order than nodes
79 CFGIntervalNode(unsigned ID, std::vector<const CFGBlock *> Nodes) in CFGIntervalNode()
80 : ID(ID), Nodes(std::move(Nodes)) {} in CFGIntervalNode()
93 std::vector<const CFGBlock *> Nodes; member
106 // Since graphs are built from pointers to nodes, we use a deque to ensure
113 // based on the edges between nodes in these intervals.
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DRDFDeadCode.cpp118 // This function works by first finding all live nodes. The dead nodes in collect()
119 // are then the complement of the set of live nodes. in collect()
121 // Assume that all nodes are dead. Identify instructions which must be in collect()
144 dbgs() << "Live nodes:\n"; in collect()
177 // Erase the nodes given in the Nodes set from DFG. In addition to removing
180 bool DeadCodeElimination::erase(const SetVector<NodeId> &Nodes) { in erase() argument
181 if (Nodes.empty()) in erase()
184 // Prepare the actual set of ref nodes to remove: ref nodes from Nodes in erase()
185 // are included directly, for each InstrNode in Nodes, include the set in erase()
188 for (auto I : Nodes) { in erase()
[all …]
/freebsd-src/sys/contrib/openzfs/include/sys/
H A Dbtree.h44 * The B-Tree has two types of nodes: core nodes, and leaf nodes. Core
45 * nodes have an array of children pointing to other nodes, and an array of
47 * at its children. Leaf nodes only contain data elements, and form the bottom
49 * elements in the core nodes are not copies of or references to leaf node
76 * Set to -1 to indicate core nodes. Other values represent first
77 * valid element offset for leaf nodes.
81 * For both leaf and core nodes, represents the number of elements in
82 * the node. For core nodes, they will have bth_count + 1 children.
138 * COMP - A comparator to compare two nodes, it must return exactly: -1, 0,
173 * Allocate and deallocate caches for btree nodes.
[all …]
/freebsd-src/crypto/openssl/demos/certs/apps/
H A Dmkxcerts.sh7 -config apps.cnf -extensions usr_cert -x509 -nodes \
10 -config apps.cnf -extensions usr_cert -x509 -nodes \
13 -config apps.cnf -extensions usr_cert -x509 -nodes \
22 -config apps.cnf -extensions ec_cert -x509 -nodes \
23 -nodes -keyout tecp256.pem -out tecp256.pem -newkey ec:ecp256.pem \
27 -config apps.cnf -extensions ec_cert -x509 -nodes \
28 -nodes -keyout tecp384.pem -out tecp384.pem -newkey ec:ecp384.pem \
/freebsd-src/crypto/openssl/crypto/x509/
H A Dpcy_node.c28 X509_POLICY_NODE *ossl_policy_tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes, in ossl_policy_tree_find_sk() argument
38 idx = sk_X509_POLICY_NODE_find(nodes, &l); in ossl_policy_tree_find_sk()
39 return sk_X509_POLICY_NODE_value(nodes, idx); in ossl_policy_tree_find_sk()
49 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) { in ossl_policy_level_find_node()
50 node = sk_X509_POLICY_NODE_value(level->nodes, i); in ossl_policy_level_find_node()
85 if (level->nodes == NULL) in ossl_policy_level_add_node()
86 level->nodes = ossl_policy_node_cmp_new(); in ossl_policy_level_add_node()
87 if (level->nodes == NULL) { in ossl_policy_level_add_node()
91 if (!sk_X509_POLICY_NODE_push(level->nodes, node)) { in ossl_policy_level_add_node()
122 (void) sk_X509_POLICY_NODE_pop(level->nodes); in ossl_policy_level_add_node()
H A Dpcy_tree.c18 * If the maximum number of nodes in the policy tree isn't defined, set it to
19 * a generous default of 1000 nodes.
72 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) { in tree_print()
74 sk_X509_POLICY_NODE_value(plev->nodes, i); in tree_print()
264 /* Iterate through all in nodes linking matches */ in tree_link_matching_nodes()
265 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_matching_nodes()
266 X509_POLICY_NODE *node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_matching_nodes()
296 /* Look for matching nodes in previous level */ in tree_link_nodes()
358 /* Locate unmatched nodes */ in tree_link_unmatched()
382 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_any()
[all …]
/freebsd-src/sbin/devfs/
H A Ddevfs.878 the attributes of DEVFS nodes.
89 of certain nodes.
90 For example, one might want to hide all disk nodes in a
126 have their conditions checked against all nodes
153 The conditions determine which DEVFS nodes the rule matches
195 Nodes may later be revived manually with
200 Hiding a directory node effectively hides all of its child nodes.
225 all parent directory nodes must be visible to be able to access the node.
277 (this only matters for things that might change the properties of nodes).
285 Add a rule that causes all nodes that have a path that matches
[all …]

12345678910>>...102