Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 25 of 459) sorted by relevance

12345678910>>...19

/llvm-project-15.0.7/compiler-rt/lib/tsan/tests/unit/
H A Dtsan_ilist_test.cpp59 Node nodes[3]; in TEST() local
61 list.PushBack(&nodes[1]); in TEST()
62 list.PushBack(&nodes[0]); in TEST()
70 EXPECT_EQ(list.Prev(&nodes[0]), &nodes[1]); in TEST()
72 EXPECT_EQ(list.Next(&nodes[1]), &nodes[0]); in TEST()
73 EXPECT_EQ(list.Prev(&nodes[1]), &nodes[2]); in TEST()
75 EXPECT_EQ(list.Next(&nodes[2]), &nodes[1]); in TEST()
87 Parent nodes[3]; in TEST() local
105 EXPECT_EQ(list1.Next(&nodes[1]), &nodes[0]); in TEST()
106 EXPECT_EQ(list1.Prev(&nodes[1]), &nodes[2]); in TEST()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DSpillPlacement.cpp217 delete[] nodes; in releaseMemory()
218 nodes = nullptr; in releaseMemory()
228 nodes[n].clear(Threshold); in activate()
240 nodes[n].BiasP = 0; in activate()
306 nodes[ib].addLink(ob, Freq); in addLinks()
307 nodes[ob].addLink(ib, Freq); in addLinks()
317 if (nodes[n].mustSpill()) in scanActiveBundles()
319 if (nodes[n].preferReg()) in scanActiveBundles()
326 if (!nodes[n].update(nodes, Threshold)) in update()
328 nodes[n].getDissentingNeighbors(TodoList, nodes); in update()
[all …]
/llvm-project-15.0.7/llvm/utils/
H A DDSAextract.py37 <output_file> [list of nodes to extract]')
100 nodes = arrowexp.split(buffer) variable
101 nodes[0] = string.strip(nodes[0])
102 nodes[1] = string.strip(nodes[1])
103 if nodes[0][:13] in node_set and \
104 nodes[1][:13] in node_set:
/llvm-project-15.0.7/llvm/test/TableGen/
H A Ddag-functional.td56 class Aint<list<int> nodes, list<string> names> {
57 dag ret = !dag(ops, nodes, names);
60 class Adag<list<dag> nodes, list<string> names> {
61 dag ret = !dag(ops, nodes, names);
74 class Anode<list<NodeBase> nodes, list<string> names> {
75 dag ret = !dag(ops, nodes, names);
78 class B<list<Node> nodes> {
79 dag ret = !foldl((ops), nodes, lhs, rhs, !con(lhs, !dag(ops, [rhs.Val], [rhs.Name])));
100 class C<list<int> nodes, list<string> names> {
102 dag ret2 = !dag(ops, nodes, ?);
[all …]
/llvm-project-15.0.7/llvm/docs/DependenceGraphs/
H A Dindex.rst25 It is also possible to combine some atomic nodes that have a simple
26 def-use dependency between them into larger nodes that contain multiple-
29 As described in [1]_ the DDG uses graph abstraction to group nodes
31 into special nodes called pi-blocks. pi-blocks represent cycles of data
33 connected component of the graph is a maximal subgraph of all the nodes
55 all the nodes participating in the cycle, as shown below:
114 …- DDG nodes and edges are completely disjoint from PDG nodes and edges allowing them to change eas…
119 …- There are some similarities between DDG nodes and edges compared to PDG nodes and edges, but the…
132 …nodes in the paper represent three main program components, namely *assignment statements*, *for l…
133 …2. The paper describes five types of dependency edges between nodes namely *loop dependency*, *flo…
[all …]
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DMetadata.def27 // Handler for leaf nodes in the class hierarchy.
32 // Handler for non-leaf nodes in the class hierarchy.
37 // Handler for specialized and uniquable leaf nodes under MDNode. Defers to
50 // Handler for leaf nodes under MDNode.
55 // Handler for leaf nodes under MDNode.
60 // Handler for non-leaf nodes under MDNode.
65 // Handler for specialized leaf nodes under MDNode.
70 // Handler for specialized non-leaf nodes under MDNode.
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_stackdepotbase.h51 nodes.MemoryUsage() + Node::allocated(), in GetStats()
60 nodes.TestOnlyUnmap(); in TestOnlyUnmap()
73 TwoLevelMap<Node, kNodesSize1, kNodesSize2> nodes; variable
83 const Node &node = nodes[s]; in find()
142 Node &new_node = nodes[s]; in Put()
156 if (!nodes.contains(id)) in Get()
158 const Node &node = nodes[id]; in Get()
184 const Node &node = nodes[s]; in PrintAll()
/llvm-project-15.0.7/mlir/lib/Analysis/
H A DCallGraph.cpp111 std::unique_ptr<CallGraphNode> &node = nodes[region]; in getOrAddNode()
134 auto it = nodes.find(region); in lookupNode()
135 return it == nodes.end() ? nullptr : it->second.get(); in lookupNode()
161 for (auto &it : nodes) { in eraseNode()
166 nodes.erase(node->getCallableRegion()); in eraseNode()
193 for (auto &nodeIt : nodes) { in print()
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A D2008-02-05-ISelCrash.ll4 @nodes = external dso_local global i64 ; <ptr> [#uses=2]
8 %tmp1 = load i64, ptr @nodes, align 8 ; <i64> [#uses=1]
10 store i64 %tmp2, ptr @nodes, align 8
/llvm-project-15.0.7/clang/utils/analyzer/
H A Dexploded-graph-rewriter.py373 if len(self.nodes) == 0:
902 for node in sorted(graph.nodes):
907 visitor.visit_edge(graph.nodes[node], graph.nodes[succ])
925 node = graph.nodes[node_id]
936 graph.nodes = {node_id: graph.nodes[node_id]
951 assert ret in graph.nodes
954 for other_id in graph.nodes:
971 node = graph.nodes[node_id]
975 graph.nodes = {node_id: graph.nodes[node_id]
977 for node_id in graph.nodes:
[all …]
/llvm-project-15.0.7/llvm/test/Bitcode/
H A Dmdnodes-distinct-nodes-break-cycles.ll2 ; Check that distinct nodes break uniquing cycles, so that uniqued subgraphs
6 ; are three nodes in a cycle, and one of them (!1) is distinct. Because the
11 ; uniqued nodes don't need any forward references at all.
29 ; Note: named metadata nodes are not cannot reference null so their operands
H A Dmdnodes-distinct-nodes-first.ll2 ; Check that distinct nodes are emitted before uniqued nodes, even if that
18 ; Note: named metadata nodes are not cannot reference null so their operands
H A Dmetadata-function-blocks.ll5 ; In order to make the bitcode records easy to follow, nodes in this testcase
19 ; Each node gets a new number. Bottom-up traversal of nodes.
48 ; Function-local nodes start at 9 (strings at 8).
68 ; Function-local nodes start at 9 (strings at 8).
/llvm-project-15.0.7/llvm/utils/gn/secondary/clang/include/clang/AST/
H A DBUILD.gn29 args = [ "-gen-clang-stmt-nodes" ]
34 args = [ "-gen-clang-decl-nodes" ]
39 args = [ "-gen-clang-type-nodes" ]
64 args = [ "-gen-clang-comment-nodes" ]
/llvm-project-15.0.7/llvm/test/Linker/
H A Dunique-fwd-decl-order.ll4 ; 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.
/llvm-project-15.0.7/llvm/docs/
H A DAddingConstrainedIntrinsics.rst35 DAG nodes::
54 The function SelectionDAGBuilder::visitConstrainedFPIntrinsic builds DAG nodes
65 Most of the STRICT nodes get legalized the same as their matching non-STRICT
73 Be careful of the chain since STRICT nodes use it but their counterparts
79 careful updating this function since some nodes have the same return type
86 registered in TargetLoweringBase::initActions(). By default all strict nodes are
H A DCycleTerminology.rst33 cycles in the subgraph induced on the set of nodes (C - H). C is
40 a reducible cycle (an LLVM loop) L dominates all its other nodes, and
43 irreducible cycle, no one entry dominates the nodes of the cycle. One
183 This graph does not contain any natural loops --- the nodes ``A``,
195 A *closed path* in a CFG is a connected sequence of nodes and edges in
198 1. If a node D dominates one or more nodes in a closed path P and P
206 2. If a node D dominates one or more nodes in a closed path P and P
210 **Proof:** From the above property, D dominates all the nodes in P.
219 3. If a closed path P contains nodes U1 and U2 but not their
/llvm-project-15.0.7/clang/include/clang/AST/
H A DCMakeLists.txt21 clang_tablegen(StmtNodes.inc -gen-clang-stmt-nodes
25 clang_tablegen(DeclNodes.inc -gen-clang-decl-nodes
29 clang_tablegen(TypeNodes.inc -gen-clang-type-nodes
49 clang_tablegen(CommentNodes.inc -gen-clang-comment-nodes
/llvm-project-15.0.7/clang/docs/
H A DRAVFrontendAction.rst9 a RecursiveASTVisitor to find CXXRecordDecl AST nodes with a specified
49 // will visit all nodes in the AST.
64 VisitNodeType(NodeType \*) for most AST nodes; the exception are TypeLoc
65 nodes, which are passed by-value. We only need to implement the methods
77 // For debugging, dumping the AST nodes will show which nodes are already
104 identifier information, are not stored in the AST nodes themselves, but
120 do more interesting things with AST nodes, like looking up their source
H A DLibASTMatchers.rst6 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
H A DIntroductionToTheClangAST.rst25 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
/llvm-project-15.0.7/llvm/test/tools/UpdateTestChecks/update_llc_test_checks/Inputs/
H A Dx86_isel.ll.expected7 ; PIC: SelectionDAG has 12 nodes:
16 ; WIN: SelectionDAG has 12 nodes:
31 ; PIC: SelectionDAG has 15 nodes:
41 ; WIN: SelectionDAG has 15 nodes:
58 ; PIC: SelectionDAG has 18 nodes:
70 ; WIN: SelectionDAG has 16 nodes:
88 ; PIC: SelectionDAG has 18 nodes:
100 ; WIN: SelectionDAG has 16 nodes:
/llvm-project-15.0.7/clang/test/Misc/
H A Dloop-opt-setup.c18 const int *nodes[5]; in Helper() local
24 if (nodes[i]) in Helper()
/llvm-project-15.0.7/llvm/test/Transforms/SimplifyCFG/
H A Dcleanup-phis.ll7 ; make_early_inc_range() in a for loop while deleting phi nodes.
27 ; These two phi nodes were originally in ehcleanup. Both phi nodes should be
/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A Dconstructor-template.cpp17 A nodes; member
39 List<BinomialNode<T>*> nodes; member in BinomialNode

12345678910>>...19