/llvm-project/llvm/test/tools/llvm-profgen/ |
H A D | merge-cold-profile.test | 1 ; Used the data from recursion-compression.test, refer it for the unmerged output 2 …Inputs/recursion-compression-pseudoprobe.perfscript --binary=%S/Inputs/recursion-compression-pseud… 6 …Inputs/recursion-compression-pseudoprobe.perfscript --binary=%S/Inputs/recursion-compression-pseud… 10 …Inputs/recursion-compression-pseudoprobe.perfscript --binary=%S/Inputs/recursion-compression-pseud… 14 …Inputs/recursion-compression-pseudoprobe.perfscript --binary=%S/Inputs/recursion-compression-pseud… 103 ; Copied from recursion-compression.test
|
H A D | cs-extbinary.test | 2 …--format=extbinary --perfscript=%S/Inputs/recursion-compression-noprobe.perfscript --binary=%S/Inp… 4 ; RUN: FileCheck %S/recursion-compression-noprobe.test --input-file %t2 10 …format=extbinary --perfscript=%S/Inputs/recursion-compression-pseudoprobe.perfscript --binary=%S/I… 12 ; RUN: FileCheck %S/recursion-compression-pseudoprobe.test --input-file %t6
|
H A D | recursion-compression-noprobe.test | 1 ; Firstly test uncompression(--compress-recursion=0) 2 …=%S/Inputs/recursion-compression-noprobe.perfscript --binary=%S/Inputs/recursion-compression-nopro… 4 …fgen --format=text --perfscript=%S/Inputs/recursion-compression-noprobe.perfscript --binary=%S/Inp… 6 …=%S/Inputs/recursion-compression-noprobe.perfscript --binary=%S/Inputs/recursion-compression-nopro…
|
H A D | recursion-compression-pseudoprobe.test | 1 ; Firstly test uncompression(--compress-recursion=0) 2 ; RUN: llvm-profgen --format=text --perfscript=%S/Inputs/recursion-compression-pseudoprobe.perfscript --binary=%S/Inputs/recursion-compression-pseudoprobe.perfbin --output=%t --compress-recursion=0 --profile-summary-hot-count=0 --csspgo-preinliner=0 --gen-cs-nested-profile=0 4 ; RUN: llvm-profgen --format=text --perfscript=%S/Inputs/recursion-compression-pseudoprobe.perfscript --binary=%S/Inputs/recursion-compression-pseudoprobe.perfbin --output=%t --skip-symbolization --profile-summary-hot-count=0 6 ; RUN: llvm-profgen --format=text --perfscript=%S/Inputs/recursion-compression-pseudoprobe.perfscript --binary=%S/Inputs/recursion-compression-pseudoprobe.perfbin --output=%t --profile-summary-hot-count=0 --csspgo-preinliner=0 --gen-cs-nested-profile=0 8 ; RUN: llvm-profgen --format=text --perfscript=%S/Inputs/recursion-compression-pseudoprobe-nommap.perfscript --binary=%S/Inputs/recursion [all...] |
/llvm-project/clang-tools-extra/docs/clang-tidy/checks/misc/ |
H A D | no-recursion.rst | 1 .. title:: clang-tidy - misc-no-recursion 3 misc-no-recursion 9 and displays one example of a possible call graph loop (recursion). 14 … the C Programming Language (JPL DOCID D-60411) rule `2.4 Do not use direct or indirect recursion`.
|
/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_mutex.cpp | 144 int recursion; member 171 locked[type].recursion++; in Lock() 182 locked[type].recursion = 1; in Lock() 190 CHECK_GT(locked[type].recursion, 0); in Unlock() 191 if (--locked[type].recursion) in Unlock() 198 for (int i = 0; i < mutex_type_count; i++) CHECK_EQ(locked[i].recursion, 0); in CheckNoLocks()
|
H A D | sanitizer_deadlock_detector2.cpp | 151 m->recursion = 0; in MutexInit() 276 m->recursion++; in MutexAfterLock() 282 CHECK_EQ(m->recursion, 0); in MutexAfterLock() 283 m->recursion = 1; in MutexAfterLock() 307 if (--m->recursion > 0) in MutexBeforeUnlock()
|
H A D | sanitizer_deadlock_detector_interface.h | 40 u32 recursion;
|
/llvm-project/compiler-rt/lib/tsan/rtl/ |
H A D | tsan_rtl_mutex.cpp | 178 first = s->recursion == 0; in MutexPostLock() 181 CHECK_EQ(s->recursion, 0); in MutexPostLock() 185 CHECK_GT(s->recursion, 0); in MutexPostLock() 190 s->recursion += rec; in MutexPostLock() 231 if (!SANITIZER_GO && (s->recursion == 0 || s->owner_tid != thr->tid)) { in MutexUnlock() 237 rec = (flagz & MutexFlagRecursiveUnlock) ? s->recursion : 1; in MutexUnlock() 238 s->recursion -= rec; in MutexUnlock() 239 if (s->recursion == 0) { in MutexUnlock() 247 if (common_flags()->detect_deadlocks && s->recursion == 0 && in MutexUnlock() 348 if (common_flags()->detect_deadlocks && s->recursion == 0) { in MutexReadUnlock() [all …]
|
/llvm-project/mlir/test/mlir-pdll/Parser/ |
H A D | pattern-failure.pdll | 91 // CHECK: pattern recursion metadata has already been specified 93 Pattern with recursion, recursion {}
|
H A D | pattern.pdll | 23 Pattern NamedPattern with benefit(10), recursion {
|
/llvm-project/llvm/docs/ |
H A D | MyFirstTypoFix.rst | 40 Clang has a warning for infinite recursion: 46 test.cc:1:12: warning: all paths through this function will call itself [-Winfinite-recursion] 53 test.cc:1:12: warning: to understand recursion, you must first understand recursion [-Winfinite-recursion] 229 Change the message to "in order to understand recursion, you must first understand recursion". 242 test.cc:1:12: warning: in order to understand recursion, you must first understand recursion [-Winfinite-recursion] [all...] |
/llvm-project/polly/lib/External/isl/test_inputs/codegen/ |
H A D | single_valued.in | 2 # and does not end up in an infinite recursion.
|
/llvm-project/clang/test/Index/ |
H A D | KeepGoingWithLotsOfErrors.mm | 3 // This is the minimized test that triggered an infinite recursion:
|
/llvm-project/llvm/test/Verifier/ |
H A D | recursive-type-3.ll | 7 ; Check that linked-list-style recursive types where the recursion is through
|
H A D | recursive-type-1.ll |
|
H A D | recursive-type-load.ll |
|
H A D | recursive-type-store.ll |
|
H A D | recursive-type-2.ll |
|
/llvm-project/llvm/test/tools/llvm-profgen/Inputs/ |
H A D | recursion-compression-noprobe.perfscript | 1 PERF_RECORD_MMAP2 3019402/3019402: [0x400000(0x1000) @ 0 00:1d 265650677 1451231]: r-xp recursion-c…
|
H A D | recursion-compression-pseudoprobe.perfscript | 1 PERF_RECORD_MMAP2 3367317/3367317: [0x201000(0x1000) @ 0 00:1d 238458915 1121070]: r-xp recursion-c…
|
/llvm-project/llvm/test/CodeGen/AMDGPU/ |
H A D | coalescer-early-clobber-subreg.mir | 5 …anonymous namespace)::JoinVals &): Assertion `Assignments[ValNo] != -1 && "Bad recursion?"' failed. 10 # Register coalescer ran in bad recursion if the early clobbered subreg is
|
H A D | resource-usage-pal.ll | 4 ; indirect calls. The driver knows the max recursion depth, so it can compute
|
/llvm-project/clang/test/AST/Interp/ |
H A D | functions.cpp |
|
/llvm-project/llvm/test/Transforms/PGOProfile/Inputs/ |
H A D | update_memprof_inputs.sh | 66 // in one level of recursion. We should get two stack contexts reflecting the 67 // different levels of recursion and different allocation behavior (since the
|