| /llvm-project/clang-tools-extra/test/clang-tidy/checkers/altera/ |
| H A D | unroll-loops.cpp | 14 …:[[@LINE-1]]:3: warning: loop likely has a large number of iterations and thus cannot be fully unr… in for_loop_mult_div_increments()
24 …:[[@LINE-1]]:3: warning: loop likely has a large number of iterations and thus cannot be fully unr… in for_loop_mult_div_increments()
103 …:[[@LINE-1]]:3: warning: loop likely has a large number of iterations and thus cannot be fully unr… in cxx_for_loops()
187 …:[[@LINE-1]]:3: warning: loop likely has a large number of iterations and thus cannot be fully unr… in for_loops()
207 …:[[@LINE-1]]:3: warning: loop likely has a large number of iterations and thus cannot be fully unr… in for_loop_increments()
217 …:[[@LINE-1]]:3: warning: loop likely has a large number of iterations and thus cannot be fully unr… in for_loop_increments()
227 …:[[@LINE-1]]:3: warning: loop likely has a large number of iterations and thus cannot be fully unr… in for_loop_increments()
237 …:[[@LINE-1]]:3: warning: loop likely has a large number of iterations and thus cannot be fully unr… in for_loop_increments()
443 …:[[@LINE-1]]:5: warning: loop likely has a large number of iterations and thus cannot be fully unr… in unrolled_nested_simple_loops_large_num_iterations()
452 …:[[@LINE-1]]:5: warning: loop likely has a large number of iterations and thus cannot be fully unr… in unrolled_nested_simple_loops_large_num_iterations()
[all …]
|
| /llvm-project/llvm/test/Transforms/Inline/AArch64/ |
| H A D | gep-cost.ll | 23 ; Thus, both the gep and ret can be simplified.
33 ; AArch64. Thus, only the ret can be simplified and not the gep.
43 ; callsite. This case is a legal addressing mode for AArch64. Thus, both the
|
| /llvm-project/clang/lib/Headers/cuda_wrappers/ |
| H A D | algorithm | 34 // stdlib has constexpr std::min/max. Thus we have to unconditionally define
45 // an internal header that is included *before* <algorithm>. Thus by the time
47 // thus we can't prevent them from becoming host+device if they're constexpr.
60 // <complex>). Thus the ugliness below.
|
| /llvm-project/llvm/test/tools/llvm-exegesis/X86/ |
| H A D | analysis-cluster-stabilization.test | 7 # and thus will be be in the same cluster. But the second SQRTSSr measurement
8 # is different from the first SQRTSSr measurement, and thus it will be in it's
9 # own cluster. We do reclusterization, and thus since there is more than one
|
| /llvm-project/llvm/lib/Transforms/ObjCARC/ |
| H A D | ProvenanceAnalysis.h | 13 /// of an object. Thus ``Provenance Analysis'' is an analysis which attempts to
47 /// ownership. Thus ``Provenance Analysis'' is defined by using the notion of
49 /// not two pointers have the same provenance source and thus could
|
| /llvm-project/clang/test/Driver/ |
| H A D | cc1-spawnprocess.c | 31 // Only one TU, one job, thus integrated-cc1 is enabled.
34 // Only one TU, but we're linking, two jobs, thus integrated-cc1 is disabled.
41 // Three jobs, thus integrated-cc1 is disabled.
|
| /llvm-project/offload/DeviceRTL/include/ |
| H A D | Mapping.h | 72 /// Return the warp size, thus number of threads in the warp.
84 /// Return the block size, thus number of threads in the block.
93 /// Return the kernel size, thus number of threads in the kernel.
|
| /llvm-project/llvm/test/Transforms/SimplifyCFG/ |
| H A D | preserve-branchweights-partial.ll | 4 ; -simplifycfg. Thus we don't actually want to check the output, just that
5 ; -passes=simplifycfg -simplifycfg-require-and-preserve-domtree=1 ran successfully. Thus we only c…
|
| /llvm-project/clang/test/CXX/class/class.init/class.copy.elision/ |
| H A D | p1.cpp | 7 // operation instead of copy operation. Thus should call the copy constructor
11 // elision. Thus the copy constructor A(const volatile A &) cannot be elided.
|
| /llvm-project/clang-tools-extra/clang-tidy/readability/ |
| H A D | FunctionCognitiveComplexityCheck.cpp | 137 "Thus, it is good to minimize the size of the Detail struct.");
140 // upper limit for function cognitive complexity. Thus it would make sense
168 // Criteria is a bitset, thus a few helpers are needed.
217 // the new sequence, thus it is a stack.
327 // We might encounter a function call, which starts a new sequence, thus in TraverseBinaryOperator()
343 // operator sequence, thus let's make sure that it creates a new stack frame.
460 // increased. Thus that parameter is there and is used to fall-through
|
| /llvm-project/clang-tools-extra/docs/clang-tidy/checks/openmp/ |
| H A D | use-default-none.rst | 12 thus making it obvious which variables are referenced, and what is their
13 data sharing attribute, thus increasing readability and possibly making errors
|
| /llvm-project/polly/test/DependenceInfo/ |
| H A D | reduction_only_reduction_like_access.ll | 8 ; location, thus we won't find the RAW and WAW dependences of a reduction,
9 ; thus we should not find Reduction dependences.
|
| /llvm-project/clang-tools-extra/docs/clang-tidy/checks/altera/ |
| H A D | struct-pack-align.rst | 20 // The following struct is originally aligned to 4 bytes, and thus takes up
31 // However, it is aligned to 4 bytes instead of 8, and thus needs to be
|
| /llvm-project/libclc/generic/lib/integer/ |
| H A D | add_sat.cl | |
| /llvm-project/lld/test/ELF/linkerscript/ |
| H A D | section-align2.test | 38 ## The input section has a larger alignment and is thus preceded by a gap.
41 ## The input section has a larger alignment and is thus preceded by a gap.
|
| /llvm-project/clang/test/Analysis/ |
| H A D | stack-capture-leak-no-arc.mm | 46 // The block literal captures nothing thus is treated as a constant.
68 // A block captures nothing is a constant thus never leaks.
|
| /llvm-project/mlir/docs/ |
| H A D | OwnershipBasedBufferDeallocation.md | 95 needed at a later point and should thus not be deallocated (e.g., yielded or
163 thus the 'in' set of this block is a subset of the 'out' sets of each
238 'retained' list (since it has uses in a later basic block) and thus the
241 * The `cf.cond_br` operation has more than one successor and thus has to
245 some MemRefs remain *live* for one branch but not the other (thus set
253 take all the semantics of this particular operation into account and thus
564 function and thus unnecessary memory load and store operations and function
587 thus be optimized away entirely by the canonicalizer pass.
|
| /llvm-project/llvm/lib/Transforms/HipStdPar/ |
| H A D | HipStdPar.cpp | 15 // to execute. Thus, we identify the set of all functions reachable from
20 // thus can lead to mis-compilation. The degenerate case of this is when a
25 // call is otherwise unreachable and thus is removed; this
31 // transparent on-demand paging. Thus, they would only be able to access
|
| /llvm-project/mlir/lib/Analysis/DataFlow/ |
| H A D | LivenessAnalysis.cpp | 65 /// computed in the absence of `A`. Thus, in this implementation, we say that
85 // op. Thus, if at least one result is live, each operand is live. in visitOperation()
106 // the forwarded branch operands or the non-branch operands. Thus they need in visitBranchOperand()
184 // forwarded call operands or the non-call operands. Thus they need to be in visitCallOperand()
|
| /llvm-project/llvm/test/Transforms/LoopVectorize/X86/ |
| H A D | interleave_short_tc.ll | 5 ; Thus the resulting step is 4.
9 ; Thus the resulting step is 4.
|
| /llvm-project/llvm/test/CodeGen/BPF/preserve-static-offset/ |
| H A D | store-chain-u8.ll | 4 ; The GEP chain in this example has type mismatch and thus is
38 ; these types do not match, thus GEP chain is folded as an offset
|
| H A D | load-chain-u8-type-mismatch.ll | 4 ; The GEP chain in this example has unexpected shape and thus is
40 ; these types do not match, thus GEP chain is folded as an offset
|
| /llvm-project/llvm/docs/Frontend/ |
| H A D | PerformanceTips.rst | 168 difference in code placement and thus the performance of tight loops.
174 may not know such a load is safe to speculatively execute and thus can't
222 variables and thus generating more optimal code for loops.
268 structures (thus allowing dead store elimination) and for describing
269 life times of allocas (thus allowing smaller stack sizes).
|
| /llvm-project/mlir/lib/Transforms/Utils/ |
| H A D | CommutativityUtils.cpp | 105 /// Thus, the "key" associated with operand `A` is:
129 /// directly reflects the BFS and thus needs to be refreshed during the
190 /// Thus, the sorted `foo.commutative` is:
228 /// Thus, the sorted `foo.commutative` is:
|
| /llvm-project/compiler-rt/lib/asan/ |
| H A D | asan_fake_stack.h | 38 // and thus can not be a constant.
43 // stack_size bytes and thus can allocate
51 // Allocate() flips the appropriate allocation flag atomically, thus achieving
|