Home
last modified time | relevance | path

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

12345678910>>...16

/llvm-project/mlir/test/Dialect/Affine/
H A Dmemref-dependence-check.mlir12 // There is no dependence from store 0 to load 1 at depth if we take into account
18 // expected-remark@above {{dependence from 0 to 0 at depth 1 = false}}
19 // expected-remark@above {{dependence from 0 to 0 at depth 2 = false}}
20 // expected-remark@above {{dependence from 0 to 1 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}}
38 // There is a dependence from 0 to 1 at depth 1 (common surrounding loops 0)
42 // expected-remark@above {{dependence from 0 to 0 at depth 1 = false}}
43 // expected-remark@above {{dependence from 0 to 0 at depth 2 = false}}
[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…
47 …// expected-remark@-1 {{Incorrect slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 2…
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.
68 …// expected-remark@-1 {{Incorrect slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 1…
69 …// expected-remark@-2 {{Incorrect slice ( src loop: 1, dst loop: 0, depth: 2 : insert point: (2, 1…
[all …]
/llvm-project/compiler-rt/test/asan/TestCases/
H A Dheavy_uar_test.cpp40 void RecursiveFunctionWithStackFrame(int depth) { in RecursiveFunctionWithStackFrame() argument
41 if (depth <= 0) return; in RecursiveFunctionWithStackFrame()
43 x[0] = depth; in RecursiveFunctionWithStackFrame()
45 RecursiveFunctionWithStackFrame<kFrameSize>(depth - 1); in RecursiveFunctionWithStackFrame()
56 int depth = argc >= 3 ? atoi(argv[2]) : 500; in main() local
58 RecursiveFunctionWithStackFrame<10>(depth); in main()
59 RecursiveFunctionWithStackFrame<100>(depth); in main()
60 RecursiveFunctionWithStackFrame<500>(depth); in main()
61 RecursiveFunctionWithStackFrame<1024>(depth); in main()
62 RecursiveFunctionWithStackFrame<2000>(depth); in main()
[all …]
/llvm-project/compiler-rt/test/hwasan/TestCases/
H A Drich-stack.c14 void BAR(int depth, int err_depth, int offset);
18 void FOO(int depth, int err_depth, int offset) { in FOO() argument
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()
38 void BAR(int depth, int err_depth, int offset) { in BAR() argument
43 if (depth) in BAR()
44 FOO(depth - 1, err_depth, offset); in BAR()
45 if (err_depth == depth) in BAR()
[all …]
/llvm-project/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()
63 stack[depth - 2] = LLVMBuildBinOp(builder, op_to_opcode(tok), 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()
78 off = LLVMBuildGEP2(builder, ty, param, &stack[depth - 1], 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()
[all …]
/llvm-project/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 createInterestingIterator()
47 assert(it.depth() == 1); in createInterestingIterator()
66 while (it.depth() != 2) { in createDifferentInterestingIterator()
70 assert(it.depth() == 2); in createDifferentInterestingIterator()
92 assert(to.depth() == from.depth()); in test_copy_to_end_iterator()
119 assert(it2.depth() != it.depth()); in test_copy_valid_iterator()
126 assert(it2.depth() == it.depth()); in test_copy_valid_iterator()
147 assert(it2.depth() == it.depth()); in test_self_copy()
156 assert(it2.depth() == it.depth()); in test_self_copy()
H A Dmove_assign.pass.cpp47 while (it.depth() != 1) { in createInterestingIterator()
51 assert(it.depth() == 1); in createInterestingIterator()
69 while (it.depth() != 2) { in createDifferentInterestingIterator()
73 assert(it.depth() == 2); in createDifferentInterestingIterator()
99 assert(to.depth() == from_copy.depth()); in test_move_to_end_iterator()
129 assert(it2.depth() != it.depth()); in test_move_valid_iterator()
136 assert(it2.depth() == it_copy.depth()); in test_move_valid_iterator()
158 assert(it2.depth() == it.depth()); in test_self_move()
164 assert(it2.depth() == it.depth()); in test_self_move()
/llvm-project/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
41 ; CHECK: depth=1: entries(outer_header) outer_latch inner
42 ; CHECK: depth=2: entries(inner)
61 ; CHECK: depth=1: entries(outer_header) inner_header inner_latch
62 ; CHECK: depth=2: entries(inner_header) inner_latch
81 ; CHECK-DAG: depth=1: entries(left)
82 ; CHECK-DAG: depth=1: entries(right)
98 ; CHECK-DAG: depth
[all...]
/llvm-project/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/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:
63 ; LOOP-UNSCALE3-DIV1-COUNT-4: Loop at depth 1 containing:
64 ; LOOP-UNSCALE3-DIV1-NOT: Loop at depth 1 containing:
65 ; LOOP-UNSCALE3-DIV1-COUNT-1: Loop at depth 2 containing:
66 ; LOOP-UNSCALE3-DIV1-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:
62 ; LOOP-RELAX-COUNT-5: Loop at depth 1 containing:
63 ; LOOP-RELAX-NOT: Loop at depth 1 containing:
64 ; LOOP-RELAX-COUNT-32: Loop at depth 2 containing:
65 ; LOOP-RELAX-NOT: Loop at depth 2 containing:
68 ; LOOP-RELAX2-COUNT-11: Loop at depth 1 containing:
69 ; LOOP-RELAX2-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:
61 ; LOOP-UNSCALE4-DIV1-NOT: Loop at depth {{[0-9]+}} containing:
65 ; LOOP-UNSCALE4-DIV2-COUNT-11: Loop at depth 1 containing:
66 ; LOOP-UNSCALE4-DIV2-COUNT-22: Loop at depth 2 containing:
[all …]
/llvm-project/mlir/lib/Debug/
H A DExecutionContext.cpp60 int depth = 0; in operator ()() local
62 depth = actionStack->getDepth() + 1; in operator ()()
63 ActionActiveStack info{actionStack, action, depth}; in operator ()()
81 depthToBreak = depth + 1; in operator ()()
84 depthToBreak = depth; in operator ()()
87 depthToBreak = depth - 1; in operator ()()
105 if (breakpoint || (depthToBreak && depth <= depthToBreak)) in operator ()()
121 if (depthToBreak && depth <= depthToBreak) in operator ()()
/llvm-project/mlir/tools/mlir-tblgen/
H A DRewriterGen.cpp88 void emitMatch(DagNode tree, StringRef name, int depth);
98 void emitNativeCodeMatch(DagNode tree, StringRef name, int depth);
102 void emitOpMatch(DagNode tree, StringRef opName, int depth);
116 int depth);
121 int &operandIndex, int depth);
126 int depth);
147 // `depth` is the nesting level of `resultTree`; 0 means top-level result
153 int depth);
157 std::string handleReplaceWithNativeCodeCall(DagNode resultTree, int depth);
164 std::string handleVariadic(DagNode tree, int depth);
395 emitMatch(DagNode tree,StringRef name,int depth) emitMatch() argument
451 emitNativeCodeMatch(DagNode tree,StringRef opName,int depth) emitNativeCodeMatch() argument
561 emitOpMatch(DagNode tree,StringRef opName,int depth) emitOpMatch() argument
729 emitEitherOperandMatch(DagNode tree,DagNode eitherArgTree,StringRef opName,int argIndex,int & operandIndex,int depth) emitEitherOperandMatch() argument
809 emitVariadicOperandMatch(DagNode tree,DagNode variadicArgTree,StringRef opName,int argIndex,int & operandIndex,int depth) emitVariadicOperandMatch() argument
868 emitAttributeMatch(DagNode tree,StringRef opName,int argIndex,int depth) emitAttributeMatch() argument
957 int depth = 0; emitMatchLogic() local
1232 handleResultPattern(DagNode resultTree,int resultIndex,int depth) handleResultPattern() argument
1261 handleVariadic(DagNode tree,int depth) handleVariadic() argument
1348 handleReturnTypeArg(DagNode returnType,int i,int depth) handleReturnTypeArg() argument
1399 handleReplaceWithNativeCodeCall(DagNode tree,int depth) handleReplaceWithNativeCodeCall() argument
1529 handleOpCreation(DagNode tree,int resultIndex,int depth) handleOpCreation() argument
1749 supplyValuesForOpArgs(DagNode node,const ChildNodeIndexNameMap & childNodeNames,int depth) supplyValuesForOpArgs() argument
1791 createAggregateLocalVarsForOpArgs(DagNode node,const ChildNodeIndexNameMap & childNodeNames,int depth) createAggregateLocalVarsForOpArgs() argument
[all...]
/llvm-project/polly/lib/External/isl/
H A Disl_ast_codegen.c415 int *depth = user; in cmp_constraint() local
416 int t1 = constraint_type(a, *depth); in cmp_constraint()
417 int t2 = constraint_type(b, *depth); in cmp_constraint()
738 isl_size depth; in add_implied_guards() local
743 depth = isl_ast_build_get_depth(build); in add_implied_guards()
744 has_stride = isl_ast_build_has_stride(build, depth); in add_implied_guards()
745 if (depth < 0 || has_stride < 0) in add_implied_guards()
756 bounds, isl_dim_set, depth, 1); in add_implied_guards()
766 dom = isl_set_eliminate(dom, isl_dim_set, depth, 1); in add_implied_guards()
1059 isl_size depth; in for_inc() local
[all …]
/llvm-project/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/compiler-rt/test/asan/TestCases/Posix/
H A Ddeep_call_stack.cpp15 void RecursiveFunc(int depth, int *ptr) { in RecursiveFunc()
16 if ((depth % 1000) == 0) in RecursiveFunc()
17 printf("[%05d] ptr: %p\n", depth, ptr); in RecursiveFunc()
18 if (depth == 0) in RecursiveFunc()
21 RecursiveFunc(depth - 1, &local); in RecursiveFunc()
14 RecursiveFunc(int depth,int * ptr) RecursiveFunc() argument
/llvm-project/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/openmp/runtime/src/
H A Dkmp_affinity.h870 int depth;
872 // The following arrays are all 'depth' long and have been
895 // Each hw_thread's ids and sub_ids are depth deep
1018 KMP_DEBUG_ASSERT(level1 >= 0 && level1 < depth); in calculate_ratio()
1019 KMP_DEBUG_ASSERT(level2 >= 0 && level2 < depth); in calculate_ratio()
1026 KMP_DEBUG_ASSERT(level >= 0 && level < depth); in get_type()
1029 int get_depth() const { return depth; }; in get_type()
1031 KMP_DEBUG_ASSERT(level >= 0 && level < depth); in get_level()
1039 for (int i = 0; i < depth; ++i) in get_level()
1045 KMP_DEBUG_ASSERT(level >= 0 && level < depth); in get_ncores_with_attr()
867 int depth; global() variable
1271 kmp_uint32 depth; global() variable
[all...]
/llvm-project/llvm/lib/Analysis/
H A DRegionPrinter.cpp90 unsigned depth = 0) { in printRegionCluster()
92 O.indent(2 * depth) << "subgraph cluster_" << static_cast<const void*>(&R) in printRegionCluster()
94 O.indent(2 * (depth + 1)) << "label = \"\";\n"; in printRegionCluster()
97 O.indent(2 * (depth + 1)) << "style = filled;\n"; in printRegionCluster()
98 O.indent(2 * (depth + 1)) << "color = " in printRegionCluster()
102 O.indent(2 * (depth + 1)) << "style = solid;\n"; in printRegionCluster()
103 O.indent(2 * (depth + 1)) << "color = " in printRegionCluster()
108 printRegionCluster(*RI, GW, depth + 1); in printRegionCluster()
114 O.indent(2 * (depth + 1)) << "Node" in printRegionCluster()
118 O.indent(2 * depth) << "}\n"; in printRegionCluster()
/llvm-project/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)
112 # CHECK: depth=1: entries(bb.1) bb.2 bb.3
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)
[all …]
/llvm-project/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/compiler-rt/test/dfsan/
H A Dstack_trace.c11 NOINLINE size_t bar(int depth, char *buf, size_t len) { in bar() argument
12 if (!depth) { in bar()
16 return bar(depth - 1, buf, len); in bar()
19 NOINLINE size_t baz(int depth, char *buf, size_t len) { in baz() argument
20 return bar(depth, buf, len); in baz()
/llvm-project/lldb/source/Breakpoint/
H A DBreakpointResolverScripted.cpp30 lldb::SearchDepth depth, const StructuredDataImpl &args_data) in BreakpointResolverScripted() argument
32 m_class_name(std::string(class_name)), m_depth(depth), m_args(args_data) { in BreakpointResolverScripted()
73 // The Python function will actually provide the search depth, this is a in CreateFromStructuredData()
75 lldb::SearchDepth depth = lldb::eSearchDepthTarget; in CreateFromStructuredData()
83 depth, args_data_impl); in CreateFromStructuredData()
122 lldb::SearchDepth depth = lldb::eSearchDepthModule; in GetDepth()
125 depth = interp->ScriptedBreakpointResolverSearchDepth( in GetDepth()
128 return depth; in GetDepth()
74 lldb::SearchDepth depth = lldb::eSearchDepthTarget; CreateFromStructuredData() local
121 lldb::SearchDepth depth = lldb::eSearchDepthModule; GetDepth() local
/llvm-project/clang/utils/
H A Danalyze_safe_buffer_debug_notes.py17 def print(self, depth): argument
18 if depth > 0:
20 for i in range(depth):
22 if depth > 0:
26 child.print(depth + 1)

12345678910>>...16