Home
last modified time | relevance | path

Searched refs:depth (Results 1 – 25 of 364) sorted by relevance

12345678910>>...15

/llvm-project-15.0.7/mlir/test/Transforms/
H A Dmemref-dependence-check.mlir18 // expected-remark@above {{dependence from 0 to 0 at depth 1 = false}}
25 // expected-remark@above {{dependence from 1 to 1 at depth 1 = false}}
26 // expected-remark@above {{dependence from 1 to 1 at depth 2 = false}}
27 // expected-remark@above {{dependence from 1 to 0 at depth 1 = false}}
44 // expected-remark@above {{dependence from 0 to 1 at depth 1 = true}}
63 // expected-remark@above {{dependence from 0 to 0 at depth 1 = false}}
64 // expected-remark@above {{dependence from 0 to 1 at depth 1 = false}}
433 // Dependence from access 0 to 1 is loop carried at depth 1.
464 // Dependence from access 0 to 1 is loop carried at depth 2.
526 // *) loop-independent dependence from access 1 to 2 at depth 2.
[all …]
H A Dloop-fusion-slice-computation.mlir10 …// expected-remark@-1 {{Incorrect slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 1…
14 …// expected-remark@-1 {{slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0) loop bou…
27 …// expected-remark@-1 {{slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 1) loop bou…
31 …// expected-remark@-1 {{Incorrect slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0…
52 …// expected-remark@-1 {{slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0) loop bou…
61 // Slices at loop depth 1 should only slice the loop bounds of the first scf.
62 // Slices at loop depth 2 should slice loop bounds of both loops.
86 // The load at depth 1 in loop nest %i2 prevents slicing loop nest %i0 at depths
88 // depths 1 and 2 because the dependent store in loop nest %i0 is at depth 2.
113 // The store at depth 1 in loop nest %i0 prevents slicing loop nest %i2 at
[all …]
/llvm-project-15.0.7/compiler-rt/test/asan/TestCases/
H A Dheavy_uar_test.cpp34 void RecursiveFunctionWithStackFrame(int depth) { in RecursiveFunctionWithStackFrame() argument
35 if (depth <= 0) return; in RecursiveFunctionWithStackFrame()
37 x[0] = depth; in RecursiveFunctionWithStackFrame()
50 int depth = argc >= 3 ? atoi(argv[2]) : 500; in main() local
52 RecursiveFunctionWithStackFrame<10>(depth); in main()
53 RecursiveFunctionWithStackFrame<100>(depth); in main()
54 RecursiveFunctionWithStackFrame<500>(depth); in main()
55 RecursiveFunctionWithStackFrame<1024>(depth); in main()
56 RecursiveFunctionWithStackFrame<2000>(depth); in main()
60 RecursiveFunctionWithStackFrame<5000>(depth); in main()
[all …]
/llvm-project-15.0.7/compiler-rt/test/hwasan/TestCases/
H A Drich-stack.c14 void BAR(int depth, int err_depth, int offset);
28 if (depth) in FOO()
29 BAR(depth - 1, err_depth, offset); in FOO()
31 if (err_depth == depth) in FOO()
33 if (err_depth == -depth) in FOO()
43 if (depth) in BAR()
44 FOO(depth - 1, err_depth, offset); in BAR()
45 if (err_depth == depth) in BAR()
47 if (err_depth == -depth) in BAR()
55 int depth = atoi(argv[1]); in main() local
[all …]
/llvm-project-15.0.7/llvm/tools/llvm-c-test/
H A Dcalc.c45 int depth = 0; in build_from_tokens() local
58 if (depth < 2) { in build_from_tokens()
64 stack[depth - 1], stack[depth - 2], ""); in build_from_tokens()
65 depth--; in build_from_tokens()
72 if (depth < 1) { in build_from_tokens()
79 stack[depth - 1] = LLVMBuildLoad2(builder, ty, off, ""); in build_from_tokens()
92 if (depth >= MAX_DEPTH) { in build_from_tokens()
97 stack[depth++] = LLVMConstInt(LLVMInt64Type(), val, 1); in build_from_tokens()
103 if (depth < 1) { in build_from_tokens()
108 LLVMBuildRet(builder, stack[depth - 1]); in build_from_tokens()
[all …]
/llvm-project-15.0.7/libcxx/test/std/input.output/filesystems/class.rec.dir.itr/rec.dir.itr.members/
H A Dcopy_assign.pass.cpp43 while (it.depth() != 1) { in TEST_SUITE()
47 TEST_ASSERT(it.depth() == 1); in TEST_SUITE()
66 while (it.depth() != 2) { in createDifferentInterestingIterator()
70 TEST_ASSERT(it.depth() == 2); in createDifferentInterestingIterator()
92 TEST_CHECK(to.depth() == from.depth()); in TEST_CASE()
119 TEST_CHECK(it2.depth() != it.depth()); in TEST_CASE()
126 TEST_CHECK(it2.depth() == it.depth()); in TEST_CASE()
147 TEST_CHECK(it2.depth() == it.depth()); in TEST_CASE()
156 TEST_CHECK(it2.depth() == it.depth()); in TEST_CASE()
H A Dmove_assign.pass.cpp47 while (it.depth() != 1) { in TEST_SUITE()
51 TEST_ASSERT(it.depth() == 1); in TEST_SUITE()
69 while (it.depth() != 2) { in createDifferentInterestingIterator()
73 TEST_ASSERT(it.depth() == 2); in createDifferentInterestingIterator()
99 TEST_CHECK(to.depth() == from_copy.depth()); in TEST_CASE()
129 TEST_CHECK(it2.depth() != it.depth()); in TEST_CASE()
136 TEST_CHECK(it2.depth() == it_copy.depth()); in TEST_CASE()
158 TEST_CHECK(it2.depth() == it.depth()); in TEST_CASE()
164 TEST_CHECK(it2.depth() == it.depth()); in TEST_CASE()
/llvm-project-15.0.7/lldb/test/API/lang/c/recurse/
H A Dmain.c5 recurse_crash (uint32_t depth) in recurse_crash() argument
7 if (depth > 0) in recurse_crash()
8 return recurse_crash (depth - 1); in recurse_crash()
18 uint32_t depth = UINT32_MAX; in main() local
22 depth = strtoul (argv[1], &end, 0); in main()
24 depth = UINT32_MAX; in main()
26 recurse_crash (depth); in main()
/llvm-project-15.0.7/llvm/test/Analysis/CycleInfo/
H A Dbasic.ll5 ; CHECK-NOT: depth
12 ; CHECK: depth=1: entries(loop)
25 ; CHECK: depth=1: entries(loop) loop_next
42 ; CHECK: depth=2: entries(inner)
81 ; CHECK-DAG: depth=1: entries(left)
82 ; CHECK-DAG: depth=1: entries(right)
98 ; CHECK-DAG: depth=1: entries(second)
99 ; CHECK-DAG: depth=1: entries(first)
116 ; CHECK-DAG: depth=2: entries(right)
117 ; CHECK-DAG: depth=2: entries(left)
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/SimpleLoopUnswitch/
H A Dexponential-nontrivial-unswitch-nested2.ll54 ; LOOP1: Loop at depth 1 containing:
55 ; LOOP1-NOT: Loop at depth 1 containing:
56 ; LOOP1: Loop at depth 2 containing:
57 ; LOOP1-NOT: Loop at depth 2 containing:
58 ; LOOP1: Loop at depth 3 containing:
59 ; LOOP1-NOT: Loop at depth 3 containing:
80 ; LOOP-MAX-COUNT-6: Loop at depth 1 containing:
81 ; LOOP-MAX-NOT: Loop at depth 1 containing:
82 ; LOOP-MAX-COUNT-1: Loop at depth 2 containing:
83 ; LOOP-MAX-NOT: Loop at depth 2 containing:
[all …]
H A Dexponential-switch-unswitch.ll56 ; LOOP1: Loop at depth 1 containing:
57 ; LOOP1-NOT: Loop at depth 1 containing:
58 ; LOOP1: Loop at depth 2 containing:
59 ; LOOP1-NOT: Loop at depth 2 containing:
63 ; LOOP-RELAX-NOT: Loop at depth 1 containing:
65 ; LOOP-RELAX-NOT: Loop at depth 2 containing:
69 ; LOOP-RELAX2-NOT: Loop at depth 1 containing:
71 ; LOOP-RELAX-NOT: Loop at depth 2 containing:
74 ; LOOP-MAX-COUNT-56: Loop at depth 1 containing:
75 ; LOOP-MAX-NOT: Loop at depth 1 containing:
[all …]
H A Dexponential-nontrivial-unswitch-nested.ll51 ; LOOP1: Loop at depth 1 containing:
52 ; LOOP1: Loop at depth 2 containing:
53 ; LOOP1: Loop at depth 3 containing:
54 ; LOOP1-NOT: Loop at depth {{[0-9]+}} containing:
58 ; LOOP-UNSCALE4-DIV1-COUNT-6: Loop at depth 1 containing:
59 ; LOOP-UNSCALE4-DIV1-COUNT-19: Loop at depth 2 containing:
60 ; LOOP-UNSCALE4-DIV1-COUNT-29: Loop at depth 3 containing:
71 ; LOOP32-COUNT-32: Loop at depth 1 containing:
72 ; LOOP32-COUNT-32: Loop at depth 2 containing:
73 ; LOOP32-COUNT-32: Loop at depth 3 containing:
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopUnroll/
H A Drevisit.ll42 ; CHECK: LoopFullUnrollPass on Loop at depth 3 containing: %l0.0.0<header>
51 ; CHECK: LoopFullUnrollPass on Loop at depth 3 containing: %l0.0.1<header>
57 ; CHECK: LoopFullUnrollPass on Loop at depth 2 containing: %l0.0
62 ; CHECK: LoopFullUnrollPass on Loop at depth 2 containing: %l0.0.1.1<header>
66 ; CHECK: LoopFullUnrollPass on Loop at depth 2 containing: %l0.0.1<header>
68 ; CHECK: LoopFullUnrollPass on Loop at depth 2 containing: %l0.0.0<header>
73 ; CHECK: LoopFullUnrollPass on Loop at depth 1 containing: %l0<header>
108 ; CHECK: LoopFullUnrollPass on Loop at depth 3 containing: %l0.0.0<header>
117 ; CHECK: LoopFullUnrollPass on Loop at depth 3 containing: %l0.0.1<header>
123 ; CHECK: LoopFullUnrollPass on Loop at depth 2 containing: %l0.0
[all …]
/llvm-project-15.0.7/compiler-rt/test/asan/TestCases/Posix/
H A Ddeep_call_stack.cpp14 void RecursiveFunc(int depth, int *ptr) { in RecursiveFunc() argument
15 if ((depth % 1000) == 0) in RecursiveFunc()
16 printf("[%05d] ptr: %p\n", depth, ptr); in RecursiveFunc()
17 if (depth == 0) in RecursiveFunc()
20 RecursiveFunc(depth - 1, &local); in RecursiveFunc()
/llvm-project-15.0.7/compiler-rt/lib/dfsan/
H A Ddfsan_origin.h74 int depth = prev.isChainedOrigin() ? prev.depth() : -1; in CreateChainedOrigin() local
78 ++depth; in CreateChainedOrigin()
79 if (depth >= flags().origin_history_size || depth > kMaxDepth) in CreateChainedOrigin()
101 return Origin((depth << kDepthShift) | chained_id); in CreateChainedOrigin()
116 int depth() const { in depth() function
/llvm-project-15.0.7/openmp/runtime/src/
H A Dkmp_affinity.h686 int depth; variable
887 int depth;
916 retval->depth = 0; in allocate()
956 depth++; in push_back()
974 depth--; in remove()
1031 kmp_uint32 depth; variable
1077 depth = 1; in init()
1103 depth++; in init()
1117 depth++; in init()
1158 depth++; in resize()
[all …]
/llvm-project-15.0.7/polly/lib/Analysis/
H A DScopGraphPrinter.cpp77 unsigned depth) { in printRegionCluster() argument
78 O.indent(2 * depth) << "subgraph cluster_" << static_cast<const void *>(R) in printRegionCluster()
93 O.indent(2 * (depth + 1)) in printRegionCluster()
97 O.indent(2 * (depth + 1)) << "style = filled;\n"; in printRegionCluster()
100 O.indent(2 * (depth + 1)) << "color = 3"; in printRegionCluster()
102 O.indent(2 * (depth + 1)) << "style = solid;\n"; in printRegionCluster()
110 O.indent(2 * (depth + 1)) << "color = " << color << "\n"; in printRegionCluster()
114 printRegionCluster(SD, SubRegion.get(), O, depth + 1); in printRegionCluster()
120 O.indent(2 * (depth + 1)) in printRegionCluster()
125 O.indent(2 * depth) << "}\n"; in printRegionCluster()
/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_ast_codegen.c1071 if (depth < 0) in for_inc()
1295 if (depth < 0) in refine_generic_split()
1360 if (depth < 0) in create_for()
1505 if (depth < 0) in create_node_scaled()
1582 int depth; member
1719 data.depth = depth; in create_node()
2286 isl_dim_set, depth + 1, dim - (depth + 1)); in explicit_bounds()
2366 int depth; member
3325 isl_dim_set, depth, dim - depth); in has_pure_outer_disjunction()
4703 int depth; member
[all …]
/llvm-project-15.0.7/compiler-rt/lib/msan/
H A Dmsan_origin.h110 int depth = prev.isChainedOrigin() ? prev.depth() : 0; in CreateChainedOrigin() local
114 if (depth + 1 >= flags()->origin_history_size) { in CreateChainedOrigin()
117 ++depth; in CreateChainedOrigin()
118 CHECK(depth < (1 << kDepthBits)); in CreateChainedOrigin()
137 return Origin((1 << kHeapShift) | (depth << kDepthShift) | chained_id); in CreateChainedOrigin()
157 int depth() const { in depth() function
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DRegionPrinter.cpp91 unsigned depth = 0) { in printRegionCluster()
93 O.indent(2 * depth) << "subgraph cluster_" << static_cast<const void*>(&R) in printRegionCluster()
95 O.indent(2 * (depth + 1)) << "label = \"\";\n"; in printRegionCluster()
98 O.indent(2 * (depth + 1)) << "style = filled;\n"; in printRegionCluster()
99 O.indent(2 * (depth + 1)) << "color = " in printRegionCluster()
103 O.indent(2 * (depth + 1)) << "style = solid;\n"; in printRegionCluster()
104 O.indent(2 * (depth + 1)) << "color = " in printRegionCluster()
109 printRegionCluster(*RI, GW, depth + 1); in printRegionCluster()
115 O.indent(2 * (depth + 1)) << "Node" in printRegionCluster()
119 O.indent(2 * depth) << "}\n"; in printRegionCluster()
/llvm-project-15.0.7/mlir/tools/mlir-tblgen/
H A DRewriterGen.cpp113 int depth);
118 int depth);
196 int depth);
380 emitNativeCodeMatch(tree, name, depth); in emitMatch()
385 emitOpMatch(tree, name, depth); in emitMatch()
549 return formatv("castedOp{0}", depth); in emitOpMatch()
562 if (depth == 0) in emitOpMatch()
575 if (depth != 0) in emitOpMatch()
593 depth); in emitOpMatch()
846 int depth = 0; in emitMatchLogic() local
[all …]
/llvm-project-15.0.7/compiler-rt/test/dfsan/
H A Dstack_trace.c13 NOINLINE size_t bar(int depth, char *buf, size_t len) { in bar() argument
14 if (!depth) { in bar()
18 return bar(depth - 1, buf, len); in bar()
21 NOINLINE size_t baz(int depth, char *buf, size_t len) { in baz() argument
22 return bar(depth, buf, len); in baz()
H A Dorigin_id_stack_trace.c17 __attribute__((noinline)) void bar(int depth, void *addr, int size) { in bar() argument
18 if (depth) { in bar()
19 bar(depth - 1, addr, size); in bar()
25 __attribute__((noinline)) void baz(int depth, void *addr, int size) { in baz() argument
26 bar(depth, addr, size); in baz()
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dconstexpr-depth.cpp5 constexpr int depth(int n) { return n > 1 ? depth(n-1) : 0; } // expected-note {{exceeded maximum d… in depth() function
7 constexpr int kBad = depth(MAX + 1); // expected-error {{must be initialized by a constant expressi…
8 constexpr int kGood = depth(MAX);
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dcycle-info.mir19 # CHECK: depth=1: entries(bb.1)
44 # CHECK: depth=1: entries(bb.1) bb.2
76 # CHECK: depth=1: entries(bb.1) bb.3 bb.2
77 # CHECK: depth=2: entries(bb.2)
113 # CHECK: depth=2: entries(bb.2) bb.3
148 # CHECK: depth=1: entries(bb.1)
149 # CHECK: depth=1: entries(bb.2)
185 # CHECK: depth=1: entries(bb.2)
186 # CHECK: depth=1: entries(bb.1)
220 # CHECK: depth=2: entries(bb.2)
[all …]

12345678910>>...15