Searched refs:reverse (Results 176 - 200 of 268) sorted by relevance

1234567891011

/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineLICM.cpp750 // Add children in reverse order as then the next popped worklist node is
753 for (MachineDomTreeNode *Child : reverse(Node->children())) {
H A DPrologEpilogInserter.cpp575 for (const CalleeSavedInfo &CI : reverse(CSI)) {
585 // Insert in reverse order. loadRegFromStackSlot can insert
/freebsd-13-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DLLJIT.cpp279 for (auto *JD : llvm::reverse(DFSLinkOrder))
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp1587 // it in reverse. This is simpler than using the RPO iterator infrastructure
1604 for (auto *F : llvm::reverse(Worklist))
H A DSampleProfile.cpp1817 std::reverse(FunctionOrderList.begin(), FunctionOrderList.end());
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DInstrProfiling.cpp501 for (auto *Loop : llvm::reverse(Loops)) {
H A DPGOInstrumentation.cpp1269 for (auto &BB : reverse(F)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp860 llvm::reverse(InnerLoopLatch->instructionsWithoutDebug())) {
H A DMemCpyOptimizer.cpp496 for (auto *I : llvm::reverse(ToLift)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp367 for (auto &I : reverse(*BB)) {
374 // to keep the last one (i.e. the first found since we for reverse
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DThumb1FrameLowering.cpp870 // These are in reverse order so that in the case where we need to use
920 for (unsigned Reg : llvm::reverse(RegsToPush))
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DMemoryDependenceAnalysis.cpp105 assert(Found && "Invalid reverse map!");
932 // Eliminating the dirty entry from 'Cache', so update the reverse info.
955 // the value), remember the reverse association because we just added it
1411 for (NonLocalDepEntry &I : llvm::reverse(*Cache)) {
1465 // instructions from the reverse map.
1474 // Eliminating the dirty entry from 'Cache', so update the reverse info.
1513 // Remove us from DepInst's reverse set now that the local dep info is gone.
1577 // Add new reverse deps after scanning the set, to avoid invalidating the
1609 // Add new reverse deps after scanning the set, to avoid invalidating 'Set'
/freebsd-13-stable/usr.bin/patch/
H A Dpch.c1182 if (reverse) /* backwards patch? */
/freebsd-13-stable/contrib/llvm-project/clang/lib/Sema/
H A DSemaLookup.cpp4426 for (DeclContext *C : llvm::reverse(CurContextChain)) {
4455 for (DeclContext *C : llvm::reverse(DeclChain)) {
4476 for (DeclContext *C : llvm::reverse(CurContextChain)) {
/freebsd-13-stable/contrib/llvm-project/clang/utils/TableGen/
H A DClangAttrEmitter.cpp1345 // Search in reverse order so that the most-derived type is handled first.
1347 for (const auto &Base : llvm::reverse(Bases)) {
1494 for (const auto &arg : llvm::reverse(Args)) {
2290 for (const auto &Super : llvm::reverse(Supers)) {
2838 // in reverse.
/freebsd-13-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DCGCall.cpp2981 std::reverse(TmpBits.begin(), TmpBits.end());
3537 // Iterate in reverse to increase the likelihood of popping the cleanup.
3538 for (const auto &I : llvm::reverse(Cleanups)) {
3762 // to trump the "destruction order is reverse construction order" guarantee.
3784 // If we're emitting args in reverse, be sure to do so with
3836 // Un-reverse the arguments we just evaluated so they match up with the LLVM
3838 std::reverse(Args.begin() + CallArgsStart, Args.end());
H A DCoverageMappingGen.cpp740 for (SourceMappingRegion &I : llvm::reverse(RegionStack)) {
/freebsd-13-stable/sys/dev/ice/
H A Dice_flex_pipe.c2710 u8 reverse; /* reverse FV order */ member in struct:ice_blk_size_details
3803 es->reverse = blk_sizes[i].reverse;
H A Dice_flow.c696 if (hw->blk[params->blk].es.reverse)
/freebsd-13-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/NativePDB/
H A DSymbolFileNativePDB.cpp981 // Search the matches in reverse. This way if there are multiple matches
984 for (const auto &match : llvm::reverse(matches)) {
/freebsd-13-stable/contrib/llvm-project/lld/COFF/
H A DPDB.cpp1073 for (const auto &tsi : reverse(tsis)) {
/freebsd-13-stable/contrib/llvm-project/clang/lib/AST/
H A DDeclBase.cpp1302 std::reverse(Contexts.begin(), Contexts.end());
2036 // TODO: Maybe we shouldn't reverse the order during insertion.
/freebsd-13-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/
H A DExecutionEngine.cpp223 // If we are using the reverse mapping, add it too.
269 // If we are using the reverse mapping, add it too.
305 // If we haven't computed the reverse mapping yet, do so first.
1073 // Host and target are different endian - reverse the stored bytes.
1074 std::reverse((uint8_t*)Ptr, StoreBytes + (uint8_t*)Ptr);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Linker/
H A DIRMover.cpp1458 std::reverse(Worklist.begin(), Worklist.end());
/freebsd-13-stable/contrib/llvm-project/llvm/lib/MC/
H A DELFObjectWriter.cpp923 std::reverse(Relocs.begin(), Relocs.end());

Completed in 266 milliseconds

1234567891011