Home
last modified time | relevance | path

Searched refs:node1 (Results 1 – 10 of 10) sorted by relevance

/llvm-project-15.0.7/compiler-rt/lib/tsan/tests/unit/
H A Dtsan_ilist_test.cpp19 INode node1; member
26 IList<Node, &Node::node1> list; in TEST()
39 IList<Node, &Node::node1> list; in TEST()
58 IList<Node, &Node::node1> list; in TEST()
85 IList<Node, &Node::node1> list1; in TEST()
/llvm-project-15.0.7/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp173 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addIntraChainConstraint() local
177 &G.getNodeMetadata(node1).getAllowedRegs(); in addIntraChainConstraint()
181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
202 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
207 std::swap(node1, node2); in addIntraChainConstraint()
260 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addInterChainConstraint() local
271 &G.getNodeMetadata(node1).getAllowedRegs(); in addInterChainConstraint()
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
284 std::swap(node1, node2); in addInterChainConstraint()
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Darrow-operator.cpp35 Node** node1; in f() local
36 Line_Segment(node1->Location()); // expected-error {{not a structure or union}} in f()
/llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/
H A Dload.ll65 …i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node1 to %struct.ListNod…
66 @node1 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* null, i32 0, [4…
74 ; CHECK-NEXT: --> %n.01 U: full-set S: full-set Exits: @node1 LoopDispositions: { %for.body: Var…
76 ; CHECK-NEXT: --> (4 + %n.01)<nuw> U: [4,0) S: [4,0) Exits: (4 + @node1)<nuw><nsw> LoopDispositi…
82 ; CHECK-NEXT: --> %n.01 U: full-set S: full-set Exits: @node1 LoopDispositions: { %for.body: Var…
/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_schedule_node.c254 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()
261 n1 = isl_schedule_node_get_tree_depth(node1); in isl_schedule_node_is_equal()
268 if (node1->child_pos[i] != node2->child_pos[i]) in isl_schedule_node_is_equal()
4827 __isl_keep isl_schedule_node *node1, in isl_schedule_node_get_shared_ancestor() argument
4833 n1 = isl_schedule_node_get_tree_depth(node1); in isl_schedule_node_get_shared_ancestor()
4837 if (node1->schedule != node2->schedule) in isl_schedule_node_get_shared_ancestor()
4843 return isl_schedule_node_copy(node1); in isl_schedule_node_get_shared_ancestor()
4845 return isl_schedule_node_copy(node1); in isl_schedule_node_get_shared_ancestor()
[all …]
H A Disl_flow.c2965 isl_schedule_node *node1 = first; in before_node() local
2971 shared = isl_schedule_node_get_shared_ancestor(node1, node2); in before_node()
2981 pos1 = isl_schedule_node_get_ancestor_child_position(node1, in before_node()
3004 isl_schedule_node *node1 = first; in coscheduled_node() local
3007 return isl_bool_ok(node1 == node2); in coscheduled_node()
H A Disl_scheduler.c7191 static void swap_sched(struct isl_sched_node *node1, in swap_sched() argument
7197 sched = node1->sched; in swap_sched()
7198 node1->sched = node2->sched; in swap_sched()
7201 sched_map = node1->sched_map; in swap_sched()
7202 node1->sched_map = node2->sched_map; in swap_sched()
/llvm-project-15.0.7/polly/lib/External/isl/include/isl/
H A Dschedule_node.h28 isl_bool isl_schedule_node_is_equal(__isl_keep isl_schedule_node *node1,
85 __isl_keep isl_schedule_node *node1,
/llvm-project-15.0.7/clang/unittests/Tooling/
H A DStencilTest.cpp686 auto S1 = cat(node("node1")); in TEST()
/llvm-project-15.0.7/polly/lib/External/isl/doc/
H A Duser.pod10063 __isl_keep isl_schedule_node *node1,
10141 __isl_keep isl_schedule_node *node1,