Home
last modified time | relevance | path

Searched refs:root (Results 1 – 25 of 1465) sorted by relevance

12345678910>>...59

/llvm-project/libcxx/test/libcxx/containers/associative/
H A Dtree_remove.pass.cpp42 Node root; in test1()
49 root.__left_ = &b; in test1()
51 b.__parent_ = &root; in test1()
76 std::__tree_remove(root.__left_, &y); in test1()
77 assert(std::__tree_invariant(root.__left_)); in test1()
79 assert(root.__parent_ == 0); in test1()
80 assert(root.__left_ == &d); in test1()
81 assert(root.__right_ == 0); in test1()
82 assert(root.__is_black_ == false); in test1()
84 assert(d.__parent_ == &root); in test1()
40 Node root; test1() local
105 Node root; test1() local
170 Node root; test1() local
246 Node root; test1() local
325 Node root; test2() local
390 Node root; test2() local
455 Node root; test2() local
520 Node root; test2() local
585 Node root; test2() local
650 Node root; test2() local
715 Node root; test2() local
780 Node root; test2() local
845 Node root; test2() local
910 Node root; test2() local
975 Node root; test2() local
1040 Node root; test2() local
1109 Node root; test3() local
1379 Node root; test4() local
[all...]
H A Dtree_balance_after_insert.pass.cpp40 Node root; in test1()
46 root.__left_ = &c; in test1()
48 c.__parent_ = &root; in test1()
68 std::__tree_balance_after_insert(root.__left_, &a); in test1()
70 assert(std::__tree_invariant(root.__left_)); in test1()
72 assert(root.__left_ == &c); in test1()
74 assert(c.__parent_ == &root); in test1()
95 Node root; in test1()
101 root.__left_ = &c; in test1()
103 c.__parent_ = &root; in test1()
38 Node root; test1() local
93 Node root; test1() local
148 Node root; test1() local
203 Node root; test1() local
258 Node root; test1() local
333 Node root; test1() local
408 Node root; test1() local
483 Node root; test1() local
563 Node root; test2() local
607 Node root; test2() local
651 Node root; test2() local
723 Node root; test2() local
800 Node root; test3() local
844 Node root; test3() local
888 Node root; test3() local
960 Node root; test3() local
1036 Node root; test4() local
1326 Node root; test5() local
[all...]
H A Dtree_left_rotate.pass.cpp38 Node root; in test1()
41 root.__left_ = &x; in test1()
44 x.__parent_ = &root; in test1()
49 assert(root.__parent_ == 0); in test1()
50 assert(root.__left_ == &y); in test1()
51 assert(root.__right_ == 0); in test1()
52 assert(y.__parent_ == &root); in test1()
63 Node root; in test2()
69 root.__left_ = &x; in test2()
72 x.__parent_ = &root; in test2()
36 Node root; test1() local
61 Node root; test2() local
[all...]
H A Dtree_right_rotate.pass.cpp38 Node root; in test1()
41 root.__left_ = &x; in test1()
44 x.__parent_ = &root; in test1()
49 assert(root.__parent_ == 0); in test1()
50 assert(root.__left_ == &y); in test1()
51 assert(root.__right_ == 0); in test1()
52 assert(y.__parent_ == &root); in test1()
63 Node root; in test2()
69 root.__left_ = &x; in test2()
72 x.__parent_ = &root; in test2()
36 Node root; test1() local
61 Node root; test2() local
[all...]
/llvm-project/llvm/include/llvm/Target/GlobalISel/
H A DCombine.td25 /// Declare a root node. There must be at least one of these in every combine
27 def root : GIDefKind;
72 /// * The names of the root nodes (requires at least one)
101 // Out operands can only be of type "root" or "gi_mo", and they must be defined
164 // Apply action that erases the match root.
171 // - The root cannot have any output operands.
172 // - The root must be a CodeGenInstruction
215 (defs root:$d),
225 (outs root:$dst, $src), (ins),
230 (defs root
[all...]
/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64Combine.td15 (defs root:$root),
16 (match (G_FCONSTANT $dst, $src):$root,
17 [{ return matchFConstantToConstant(*${root}, MRI); }]),
18 (apply [{ applyFConstantToConstant(*${root}); }])>;
22 (defs root:$root, icmp_redundant_trunc_matchdata:$matchinfo),
23 (match (G_ICMP $dst, $tst, $src1, $src2):$root,
24 [{ return matchICmpRedundantTrunc(*${root}, MRI, Helper.getKnownBits(), ${matchinfo}); }]),
25 (apply [{ applyICmpRedundantTrunc(*${root}, MR
[all...]
/llvm-project/polly/lib/External/isl/imath/tests/
H A Droot.tc3 # Square root tests
21 root:0,1,0:0
22 root:0,1,=1:0
23 root:0,5,0:0
24 root:0,5,=1:0
25 root:-1,5,0:-1
26 root:-1,4,0:$MP_UNDEF
27 root:-1,3,=1:-1
28 root:-8,3,0:-2
29 root:-8,3,=1:-2
[all …]
/llvm-project/mlir/test/Rewrite/
H A Dpdl-bytecode.mlir13 pdl_interp.func @matcher(%root : !pdl.operation) {
14 …pdl_interp.apply_constraint "multi_entity_constraint"(%root, %root : !pdl.operation, !pdl.operatio…
17 pdl_interp.apply_constraint "single_entity_constraint"(%root : !pdl.operation) -> ^pat2, ^end
20 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(1), loc([%root]) ->…
27 pdl_interp.func @success(%root : !pdl.operation) {
29 pdl_interp.erase %root
44 pdl_interp.func @matcher(%root : !pdl.operation) {
45 %results = pdl_interp.get_results of %root : !pdl.range<value>
50 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(1), loc([%root]) ->…
57 pdl_interp.func @success(%root : !pdl.operation) {
[all …]
/llvm-project/mlir/test/Dialect/Polynomial/
H A Dcanonicalization.mlir4 #root = #polynomial.primitive_root<value=31:i32, degree=8:index>
14 %t0 = polynomial.ntt %p0 {root=#root} : !ntt_poly_ty -> !tensor_ty
15 %p1 = polynomial.intt %t0 {root=#root} : !tensor_ty -> !ntt_poly_ty
27 %p0 = polynomial.intt %t0 {root=#root} : !tensor_ty -> !ntt_poly_ty
28 %t1 = polynomial.ntt %p0 {root=#root} : !ntt_poly_ty -> !tensor_ty
/llvm-project/lldb/examples/scripting/
H A Dtree_utils.py22 def DFS(root, word, cur_path): argument
38 root_word_ptr = root.GetChildMemberWithName("word")
39 left_child_ptr = root.GetChildMemberWithName("left")
40 right_child_ptr = root.GetChildMemberWithName("right")
75 def tree_size(root): argument
84 if root.GetValue is None:
87 if int(root.GetValue(), 16) == 0:
90 left_size = tree_size(root.GetChildAtIndex(1))
91 right_size = tree_size(root.GetChildAtIndex(2))
97 def print_tree(root): argument
[all …]
/llvm-project/mlir/test/python/dialects/
H A Dpdl_ops.py37 root = OperationOp(args=[op0_result, input])
38 RewriteOp(root, "rewriter")
53 root = OperationOp(args=[input])
54 RewriteOp(root, "rewriter", args=[input])
135 root = OperationOp(types=[ty1, ty2])
136 rewrite = RewriteOp(root)
140 ReplaceOp(root, with_op=newOp)
159 root = OperationOp(types=[ty1, ty2])
160 rewrite = RewriteOp(root)
180 root = OperationOp(types=[types])
[all …]
/llvm-project/mlir/test/Dialect/PDL/
H A Dops.mlir15 %root = operation(%op0_result, %input : !pdl.value, !pdl.value)
16 rewrite %root with "rewriter"
23 %root = operation(%input : !pdl.value)
24 rewrite %root with "rewriter"(%input : !pdl.value)
64 %root = operation -> (%type1, %type2 : !pdl.type, !pdl.type)
65 rewrite %root {
68 replace %root with %newOp
79 %root = operation -> (%type1, %type2 : !pdl.type, !pdl.type)
80 rewrite %root {
91 %root = operation -> (%types : !pdl.range<type>)
[all …]
/llvm-project/mlir/test/Conversion/PDLToPDLInterp/
H A Dpdl-to-pdl-interp-rewriter.mlir12 %root = operation "foo.op"(%input : !pdl.value)
13 rewrite %root with "rewriter"(%input : !pdl.value)
26 %root = operation "foo.op"
27 rewrite %root {
28 erase %root
43 %root = operation "foo.op" {"attr" = %attr}
44 rewrite %root {
47 erase %root
63 %root = operation "foo.op"(%operand : !pdl.value)
64 rewrite %root {
[all …]
H A Dpdl-to-pdl-interp-matcher.mlir23 // CHECK-SAME: benefit(1), loc([%[[ROOT]]]), root("foo.op") -> ^bb1
30 %root = operation "foo.op"
31 rewrite %root with "rewriter"
54 %root = operation {"attr" = %attr, "attr1" = %attr1}
55 rewrite %root with "rewriter"
72 %root = operation(%input0, %input1 : !pdl.value, !pdl.value)
73 %result0 = result 0 of %root
76 rewrite %root with "rewriter"
88 %root = operation
89 …%attr = pdl.apply_native_constraint "check_op_and_get_attr_constr"(%root : !pdl.operation) : !pdl.…
[all …]
/llvm-project/llvm/docs/GlobalISel/
H A DMIRPatterns.rst80 patterns. e.g. the following is valid: ``(G_FOO $root, (i32 0):$cst):$mypat``.
91 // %root = G_MUL %x, %imp
93 (G_MUL $root, $x, $imp))
100 (match (G_AND $root, $x, $x))
102 (apply (COPY $root, $x))
132 (defs root:$root),
141 (defs root:$dst),
182 (defs root:$root),
[all...]
/llvm-project/llvm/test/TableGen/GlobalISelCombinerEmitter/
H A Dpatfrag-errors.td25 (defs root:$dst),
42 (defs root:$dst),
48 // CHECK: :[[@LINE+2]]:{{[0-9]+}}: error: GICombinePatFrag must have one root in its 'out' operands
58 (defs root:$dst),
64 // CHECK: :[[@LINE+2]]:{{[0-9]+}}: error: output parameter 'bar' must be 'root' or 'gi_mo'
67 (outs root:$foo, gi_imm:$bar),
74 (defs root:$dst),
80 …CK: :[[@LINE+1]]:{{[0-9]+}}: error: pattern 'dbg' ('G_FPEXT') is unreachable from the pattern root!
82 (outs root:$foo, $bar),
88 (defs root:$dst),
[all …]
H A Dpattern-errors.td13 // CHECK: :[[@LINE+1]]:{{[0-9]+}}: error: Cannot find root 'missing' in match patterns!
15 (defs root:$missing),
19 …error: apply pattern 'd' is supposed to be a root but it does not redefine any of the defs of the …
21 (defs root:$d),
26 // CHECK: :[[@LINE+1]]:{{[0-9]+}}: error: C++ code cannot be the root of a rule!
28 (defs root:$a),
32 // CHECK: :[[@LINE+1]]:{{[0-9]+}}: error: Cannot use live-in operand 'b' as match pattern root!
34 (defs root:$b),
41 (defs root:$d),
48 (defs root:$d),
[all …]
/llvm-project/mlir/lib/TableGen/
H A DPredicate.cpp161 buildPredicateTree(const Pred &root, in buildPredicateTree()
166 rootNode->kind = getPredCombinerKind(root); in buildPredicateTree()
167 rootNode->predicate = &root; in buildPredicateTree()
168 if (!root.isCombined()) { in buildPredicateTree()
169 rootNode->expr = root.getCondition(); in buildPredicateTree()
178 const auto &substPred = static_cast<const SubstLeavesPred &>(root); in buildPredicateTree()
184 const auto &concatPred = static_cast<const ConcatPred &>(root); in buildPredicateTree()
192 auto combined = static_cast<const CombinedPred &>(root); in buildPredicateTree()
328 static std::string getCombinedCondition(const PredNode &root) { in getCombinedCondition()
330 if (root in getCombinedCondition()
158 buildPredicateTree(const Pred & root,llvm::SpecificBumpPtrAllocator<PredNode> & allocator,ArrayRef<Subst> substitutions) buildPredicateTree() argument
315 getCombinedCondition(const PredNode & root) getCombinedCondition() argument
[all...]
/llvm-project/lldb/test/API/functionalities/recursion/
H A Dmain.cpp13 void make_tree(node* root, int count) in make_tree() argument
16 if (!root) in make_tree()
18 root->value = countdown; in make_tree()
21 root->next = new node(++countdown); in make_tree()
22 root = root->next; in make_tree()
29 node root(1); in main() local
30 make_tree(&root,25000); in main()
/llvm-project/libcxxabi/test/configs/
H A Dapple-libc++abi-backdeployment.cfg.in
/llvm-project/libunwind/test/configs/
H A Dapple-libunwind-backdeployment.cfg.in
/llvm-project/libcxx/test/configs/
H A Dapple-libc++-backdeployment.cfg.in
/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUCombine.td17 (defs root:$select, fmin_fmax_legacy_matchdata:$matchinfo),
25 (defs root:$itofp),
32 (defs root:$rcp, build_fn_matchinfo:$matchinfo),
38 (defs root:$root),
40 (G_FDIV f16:$dst, $y, $sqrt, (MIFlags FmContract)):$root,
41 [{ return matchFDivSqrtToRsqF16(*${root}); }]),
42 (apply [{ applyFDivSqrtToRsqF16(*${root}, ${x}.getReg()); }])>;
47 (defs root:$cvt_f32_ubyteN, cvt_f32_ubyteN_matchdata:$matchinfo),
58 (defs root
[all...]
/llvm-project/llvm/test/CodeGen/AMDGPU/GlobalISel/
H A Dpostlegalizer-combiner-buildvector-identities.mir20 %root:_(<2 x s16>) = G_BUILD_VECTOR_TRUNC %bitcast, %lshr
21 $vgpr0 = COPY %root
41 %root:_(<2 x s16>) = G_BUILD_VECTOR_TRUNC %bitcast0, %lshr
42 $vgpr0 = COPY %root
59 ; CHECK-NEXT: %root:_(<2 x s16>) = G_BUILD_VECTOR_TRUNC %bitcast(s32), %lshr(s32)
60 ; CHECK-NEXT: $vgpr0 = COPY %root(<2 x s16>)
65 %root:_(<2 x s16>) = G_BUILD_VECTOR_TRUNC %bitcast, %lshr
66 $vgpr0 = COPY %root
87 %root:_(<2 x s16>) = G_BUILD_VECTOR %trunclo, %trunchi
88 $vgpr0 = COPY %root
[all …]
/llvm-project/lldb/unittests/Host/
H A DXMLTest.cpp16 static void assertGetElement(XMLNode &root, const char *element_name, in assertGetElement() argument
20 XMLNode node = root.FindFirstChildElementWithName(element_name); in assertGetElement()
33 XMLNode attr_node = root.FindFirstChildElementWithName("attr"); in assertGetElement()
45 assertGetElement(root, element_name, __VA_ARGS__); \
76 XMLNode root = doc.GetRootElement(); in TEST() local
77 ASSERT_TRUE(root.IsValid()); in TEST()
102 XMLNode root = doc.GetRootElement(); in TEST() local
103 EXPECT_FALSE(root.IsValid()); in TEST()
105 XMLNode node = root.FindFirstChildElementWithName("text"); in TEST()

12345678910>>...59