| /llvm-project-15.0.7/llvm/test/CodeGen/Mips/ |
| H A D | inlineasm-constraint.ll | 22 ; Now J with 0 32 ; Now K with 64 42 ; Now L with 0x00100000 51 ; Now N with -3 60 ; Now O with -3 69 ; Now P with 65535
|
| H A D | inlineasm-constraint-reg.ll | 27 ; Now c with 1024: make sure register $25 is picked 33 ; Now l with 1024: make sure register lo is picked. We do this by checking the instruction
|
| /llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/bugprone/ |
| H A D | lambda-function-name.rst | 16 [] { printf("Now called from %s\n", __FUNCTION__); }(); 22 Now called from operator() 27 Now called from FancyFunction
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | SampleProfileInference.cpp | 210 uint64_t Now = Target; in computeAugmentingPathCapacity() local 211 while (Now != Source) { in computeAugmentingPathCapacity() 219 Now = Pred; in computeAugmentingPathCapacity() 288 uint64_t Now = Target; in augmentFlowAlongPath() local 289 while (Now != Source) { in augmentFlowAlongPath() 297 Now = Pred; in augmentFlowAlongPath() 721 uint64_t Now = Target; in findShortestPath() local 722 while (Now != Source) { in findShortestPath() 723 assert(Now == Parent[Now]->Target && "incorrect parent jump"); in findShortestPath() 724 Result.push_back(Parent[Now]); in findShortestPath() [all …]
|
| /llvm-project-15.0.7/clang-tools-extra/clangd/support/ |
| H A D | Threading.cpp | 130 Rep Now = Stopwatch::now().time_since_epoch().count(); in operator ()() local 132 if (Now < OldNext) in operator ()() 136 Rep NewNext = Now + Period; in operator ()()
|
| /llvm-project-15.0.7/llvm/tools/llvm-cvtres/ |
| H A D | llvm-cvtres.cpp | 94 std::time_t Now = time(nullptr); in getTime() local 95 if (Now < 0 || !isUInt<32>(Now)) in getTime() 97 return static_cast<uint32_t>(Now); in getTime()
|
| /llvm-project-15.0.7/lldb/test/API/api/multithreaded/ |
| H A D | test_stop-hook.cpp.template | 67 // Now add the stop hook: 72 // Now switch the I/O over to a pipe, which will be handled by the 103 // Now run the command interpreter. You have to pass true to 107 // Now issue a stepi, and fetch the running and stopped events:
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopRotate/ |
| H A D | preserve-loop-simplify.ll | 25 ; Now the latch! 31 ; Now the header!
|
| /llvm-project-15.0.7/lldb/source/Host/posix/ |
| H A D | PipePosix.cpp | 52 static std::chrono::time_point<std::chrono::steady_clock> Now() { in Now() function 172 const auto finish_time = Now() + timeout; in OpenAsWriterWithTimeout() 176 const auto dur = duration_cast<microseconds>(finish_time - Now()).count(); in OpenAsWriterWithTimeout()
|
| /llvm-project-15.0.7/llvm/docs/HistoricalNotes/ |
| H A D | 2002-06-25-MegaPatchInfo.txt | 2 * Change the casting code to be const correct. Now, doing this is invalid: 20 Now, instead of having a vector to pointers of objects, the objects are 47 include every .h file that it used. Now things are batched a little bit more
|
| /llvm-project-15.0.7/llvm/test/FileCheck/ |
| H A D | check-dag-not-dag.txt | 5 the first DAG in the following DAG group. Now it ends at the start of the 43 preceding DAG group, so reordering detection wasn't possible. Now, the
|
| /llvm-project-15.0.7/llvm/test/Transforms/GVN/PRE/ |
| H A D | pre-single-pred.ll | 6 ; we were never actually checking that case. Now we actually do perform some 10 ; Now that that faulty assumption is corrected, test that we DON'T incorrectly
|
| /llvm-project-15.0.7/lld/test/ELF/linkerscript/ |
| H A D | wildcards.s | 23 ## Now replace the symbol with '?' and check that results are the same. 30 ## Now see how replacing '?' with '*' will consume whole abcd.
|
| H A D | sections-keep.s | 19 ## Now apply KEEP command to preserve the section.
|
| /llvm-project-15.0.7/llvm/test/Assembler/ |
| H A D | global-addrspace-forwardref.ll | 11 ; Now test with global IDs instead of global names.
|
| /llvm-project-15.0.7/clang/test/Modules/ |
| H A D | validate-system-headers.m | 19 // Now make sure we rebuild the module when -fmodules-validate-system-headers is set. 37 // Now add -fmodules-validate-system-headers and rebuild
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | WritingAnLLVMNewPMPass.rst | 62 Now that we have the build set up for a new pass, we need to write the code 70 Now that the build is setup for a new pass, we just have to write it. 132 That's it for the pass itself. Now in order to "register" the pass, we need 157 Now that you have a brand new shiny pass, we can build :program:`opt` and use
|
| /llvm-project-15.0.7/lldb/test/API/lang/objc/rdar-11355592/ |
| H A D | main.m | 33 my_string = "Now this is a REAL string..."; // Set breakpoint here.
|
| /llvm-project-15.0.7/clang/docs/ |
| H A D | RAVFrontendAction.rst | 60 Now that everything is hooked up, the next step is to implement a 119 Now that the ASTContext is available in the RecursiveASTVisitor, we can 141 Now we can combine all of the above into a small example program:
|
| /llvm-project-15.0.7/llvm/test/Transforms/SimpleLoopUnswitch/ |
| H A D | update-scev.ll | 17 ; Now check that after unswitching and simplifying instructions we get clean 76 ; Now check that after unswitching and simplifying instructions we get clean 137 ; Now check that after unswitching and simplifying instructions we get clean
|
| /llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/ |
| H A D | 2011-03-09-ExactNoMaxBECount.ll | 7 ; Now we have ExactBECount == 0. However, MinStart == 2 and MaxEnd == 4.
|
| /llvm-project-15.0.7/compiler-rt/lib/builtins/ |
| H A D | fp_div_impl.inc | 190 // Now, we should multiply UQ0.HW and UQ1.(HW-1) numbers, naturally 203 // Now, either no overflow occurred or x_UQ0_hw is 0 or 1 in its half_rep_t 336 // Now 1/b - (2*P) * 2^-W < x < 1/b 341 // Now, a/b - 4*P * 2^-W < q < a/b for q=<quotient_UQ1:dummy> in UQ1.(SB+1+W). 362 // Now, q cannot be greater than a/b and can differ by at most 8*P * 2^-W + 2^-SB 386 // Now, quotient_UQ1_SB <= the correctly-rounded result
|
| /llvm-project-15.0.7/libclc/generic/lib/integer/ |
| H A D | mul_hi.cl | 33 //Now add the components back together in the following steps: 61 //Now add the components back together, taking care to respect the fact that:
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopStrengthReduce/X86/ |
| H A D | 2011-07-20-DoubleIV.ll | 30 ; Now check that the computed double constant is correct.
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-objcopy/ELF/ |
| H A D | overlapping-sections.test | 9 ## Now check that the section contents are still correct after the copy.
|