/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 746 for (unsigned i : reverse(IncomingVals))
|
H A D | LoopUtils.cpp | 593 // NOTE! We need to remove Incoming Values in the reverse order as done 1495 /// Loops are added in preorder (analogous for reverse postorder for trees), 1504 // We walk the initial sequence of loops in reverse because we generally want 1525 appendReversedLoopsToWorklist(reverse(Loops), Worklist);
|
/freebsd-13-stable/contrib/llvm-project/llvm/tools/llvm-profdata/ |
H A D | llvm-profdata.cpp | 1002 for (auto &hotfunc : llvm::reverse(SortedHottestFuncs))
|
/freebsd-13-stable/contrib/llvm-project/openmp/runtime/src/ |
H A D | z_Windows_NT-586_asm.asm | 1267 push r8 ; push p_argv[rcx-1] onto stack (reverse order)
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64FrameLowering.cpp | 170 ReverseCSRRestoreSeq("reverse-csr-restore-seq", 171 cl::desc("reverse the CSR restore sequence"), 2474 // SVE objects are always restored in reverse order. 2475 for (const RegPairInfo &RPI : reverse(RegPairs)) 2480 for (const RegPairInfo &RPI : reverse(RegPairs))
|
/freebsd-13-stable/sys/contrib/openzfs/cmd/zfs/ |
H A D | zfs_main.c | 2745 boolean_t reverse = sortcol->sc_reverse; local 2795 return (reverse ? 1 : -1); 2797 return (reverse ? -1 : 1); 7388 * reverse to make sure to get any snapshots first. 7498 * Walk the AVL tree in reverse, unmounting each filesystem and
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 3940 // Iterate in reverse order to consider insert elements with the high cost. 5831 // Do a quadratic search on all of the given stores in reverse order and find 7138 std::reverse(BuildVectorOpds.begin(), BuildVectorOpds.end()); 7139 std::reverse(InsertElts.begin(), InsertElts.end()); 7354 for (auto *I : reverse(Instructions)) {
|
/freebsd-13-stable/contrib/subversion/subversion/include/ |
H A D | svn_client.h | 3167 * merged or reverse merged; otherwise (or if the mergeinfo property values 4156 * order; otherwise, the reverse occurs.) 7621 * If @a reverse is @c TRUE, apply patches in reverse, deleting lines 7650 svn_boolean_t reverse,
|
/freebsd-13-stable/contrib/llvm-project/lld/ELF/ |
H A D | Driver.cpp | 582 for (auto *arg : llvm::reverse(args)) {
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Frontend/ |
H A D | CompilerInstance.cpp | 2160 std::reverse(Path.begin(), Path.end());
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | AnalysisBasedWarnings.cpp | 1278 for (const CFGBlock *B : llvm::reverse(*Cfg)) {
|
H A D | Sema.cpp | 2005 for (auto *Scope : llvm::reverse(FunctionScopes)) {
|
H A D | SemaCast.cpp | 1205 // C++ 5.2.9p6: May apply the reverse of any standard conversion, except 1211 // care of reverse qualification conversions. 1237 // The exception is the reverse of enum->integer, i.e. integer->enum (and 1239 // The same goes for reverse floating point promotion/conversion and 1522 // that it builds the paths in reverse order. 1537 for (CXXBasePathElement &PE : llvm::reverse(Path))
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | BugReporterVisitors.cpp | 719 // Add the regions in the reverse order, then reverse the resulting array. 726 std::reverse(RegionSequence.begin(), RegionSequence.end());
|
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | Stmt.h | 1457 for (auto *B : llvm::reverse(body())) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineBlockPlacement.cpp | 1308 for (MachineBasicBlock *src : reverse(Chain.Edges)) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGRRList.cpp | 1633 std::reverse(Sequence.begin(), Sequence.end()); 1656 // reverse left/right rather than simply !SortFunc(left, right)
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LowerMatrixIntrinsics.cpp | 733 for (Instruction *Inst : reverse(ToRemove))
|
H A D | RewriteStatepointsForGC.cpp | 2147 std::reverse(ChainToBase.begin(), ChainToBase.end()); 2636 // reverse the transform we're about to do would be slightly complex.
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | ARMConstantIslandPass.cpp | 1874 // target of Br. So now we need to reverse the condition. 1894 for (ImmBranch &Br : reverse(ImmBranches)) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAGHVX.cpp | 96 // a reverse delta network. 1484 for (SDNode *S : reverse(Queue)) 1741 // with the largest group size, vshuffvdd will do them in the reverse order. 1968 // Try reverse delta.
|
/freebsd-13-stable/contrib/ncurses/ncurses/win32con/ |
H A D | win_driver.c | 1297 int reverse GCC_UNUSED,
|
/freebsd-13-stable/contrib/ncurses/progs/ |
H A D | tic.c | 2050 * Check for DEC VT100 private mode for reverse video. 2152 * Check for missing delay when using VT100 reverse-video. 2443 DATA(reverse),
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIRegisterInfo.cpp | 1710 for (MCRegister Reg : reverse(*RC))
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Analysis/ |
H A D | CFG.cpp | 463 /// the AST in reverse order so that the successor of a basic block is 1517 for (auto *I : llvm::reverse(CD->inits())) { 1520 // We've reached the first virtual base init while iterating in reverse 1779 // We need to perform the scope leaving in reverse order 1834 // We need to append the destructors in reverse order, but any one of them 1836 // this sequence up and replay them in reverse order when appending onto the 2348 // Visit the children in their reverse order so that they appear in 3680 // CFG-land, that means appending them in reverse order. 4760 // When visiting children for destructors we want to visit them in reverse 4777 // before RHS expression. For destructors visit them in reverse orde [all...] |