| /llvm-project-15.0.7/llvm/lib/Target/AArch64/ |
| H A D | AArch64PBQPRegAlloc.cpp | 174 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); in addIntraChainConstraint() local
179 &G.getNodeMetadata(node2).getAllowedRegs(); in addIntraChainConstraint()
181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
202 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
206 if (G.getEdgeNode1Id(edge) == node2) { in addIntraChainConstraint()
207 std::swap(node1, node2); in addIntraChainConstraint()
273 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); in addInterChainConstraint() local
275 &G.getNodeMetadata(node2).getAllowedRegs(); in addInterChainConstraint()
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
283 if (G.getEdgeNode1Id(edge) == node2) { in addInterChainConstraint()
[all …]
|
| /llvm-project-15.0.7/compiler-rt/lib/tsan/tests/unit/ |
| H A D | tsan_ilist_test.cpp | 20 INode node2; member
86 IList<Node, &Node::node2, Parent> list2; in TEST()
|
| /llvm-project-15.0.7/llvm/test/Transforms/GVN/PRE/ |
| H A D | 2018-06-08-pre-load-dbgloc-no-null-opt.ll | 53 %node2 = getelementptr inbounds %struct.desc, %struct.desc* %desc, i64 0, i32 0
54 %4 = load %struct.node*, %struct.node** %node2, align 8, !dbg !10
|
| H A D | 2017-06-28-pre-load-dbgloc.ll | 51 %node2 = getelementptr inbounds %struct.desc, %struct.desc* %desc, i64 0, i32 0
52 %4 = load %struct.node*, %struct.node** %node2, align 8, !dbg !10
|
| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_schedule_node.c | 249 __isl_keep isl_schedule_node *node2) in isl_schedule_node_is_equal() argument
254 if (!node1 || !node2) in isl_schedule_node_is_equal()
256 if (node1 == node2) in isl_schedule_node_is_equal()
258 if (node1->schedule != node2->schedule) in isl_schedule_node_is_equal()
262 n2 = isl_schedule_node_get_tree_depth(node2); in isl_schedule_node_is_equal()
4548 isl_schedule_node *node2; in isl_schedule_node_order_before_or_after() local
4585 node2 = isl_schedule_node_copy(node); in isl_schedule_node_order_before_or_after()
4587 node2 = isl_schedule_node_gist(node2, isl_union_set_copy(filter)); in isl_schedule_node_order_before_or_after()
4592 isl_schedule_node_free(node2); in isl_schedule_node_order_before_or_after()
4828 __isl_keep isl_schedule_node *node2) in isl_schedule_node_get_shared_ancestor() argument
[all …]
|
| H A D | isl_flow.c | 2966 isl_schedule_node *node2 = second; in before_node() local
2971 shared = isl_schedule_node_get_shared_ancestor(node1, node2); in before_node()
2983 pos2 = isl_schedule_node_get_ancestor_child_position(node2, in before_node()
3005 isl_schedule_node *node2 = second; in coscheduled_node() local
3007 return isl_bool_ok(node1 == node2); in coscheduled_node()
|
| H A D | isl_scheduler.c | 7192 struct isl_sched_node *node2) in swap_sched() argument
7198 node1->sched = node2->sched; in swap_sched()
7199 node2->sched = sched; in swap_sched()
7202 node1->sched_map = node2->sched_map; in swap_sched()
7203 node2->sched_map = sched_map; in swap_sched()
|
| /llvm-project-15.0.7/polly/lib/External/isl/include/isl/ |
| H A D | schedule_node.h | 29 __isl_keep isl_schedule_node *node2);
86 __isl_keep isl_schedule_node *node2);
|
| H A D | isl-noexceptions.h | 3596 inline boolean is_equal(const isl::schedule_node &node2) const;
3618 inline isl::schedule_node shared_ancestor(const isl::schedule_node &node2) const;
3619 inline isl::schedule_node get_shared_ancestor(const isl::schedule_node &node2) const;
17674 boolean schedule_node::is_equal(const isl::schedule_node &node2) const in is_equal() argument
17676 auto res = isl_schedule_node_is_equal(get(), node2.get()); in is_equal()
17808 isl::schedule_node schedule_node::shared_ancestor(const isl::schedule_node &node2) const in shared_ancestor() argument
17810 auto res = isl_schedule_node_get_shared_ancestor(get(), node2.get()); in shared_ancestor()
17814 isl::schedule_node schedule_node::get_shared_ancestor(const isl::schedule_node &node2) const in get_shared_ancestor() argument
17816 return shared_ancestor(node2); in get_shared_ancestor()
|
| /llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/ |
| H A D | load.ll | 64 …i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node2 to %struct.ListNod…
65 @node2 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %str…
|
| /llvm-project-15.0.7/polly/lib/External/isl/doc/ |
| H A D | user.pod | 10064 __isl_keep isl_schedule_node *node2);
10142 __isl_keep isl_schedule_node *node2);
|