Searched refs:reverse (Results 151 - 175 of 268) sorted by relevance

1234567891011

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopUnrollAndJam.cpp182 for (Instruction *I : reverse(Visited)) {
342 // reverse postorder so that LastValueMap contains the correct value at each
/freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DGICombinerEmitter.cpp261 (*EI)->reverse();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMParallelDSP.cpp522 for (Instruction &I : reverse(BB)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsCallLowering.cpp52 std::reverse(VRegs.begin(), VRegs.end());
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp632 for (Instruction *I : llvm::reverse(InstChain)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Bitcode/Reader/
H A DBitcodeAnalyzer.cpp692 std::reverse(FreqPairs.begin(), FreqPairs.end());
/freebsd-13-stable/contrib/llvm-project/llvm/lib/TableGen/
H A DTGParser.cpp1911 // first. We'll first read everything in to a vector, then we can reverse
1941 std::reverse(NewBits.begin(), NewBits.end());
2136 std::reverse(Ranges.begin(), Ranges.end());
2584 std::reverse(BitList.begin(), BitList.end());
3027 std::reverse(Bits.begin(), Bits.end());
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVFrameLowering.cpp703 // Manually restore values not restored by libcall. Insert in reverse order.
706 for (auto &CS : reverse(NonLibcallCSI)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/XCore/
H A DXCoreFrameLowering.cpp278 // We want the nearest (negative) offsets first, so reverse list.
279 std::reverse(SpillList.begin(), SpillList.end());
466 // Insert in reverse order. loadRegFromStackSlot can insert multiple
/freebsd-13-stable/usr.bin/bmake/unit-tests/
H A DMakefile358 TESTS+= varmod-order-reverse
/freebsd-13-stable/contrib/llvm-project/lld/ELF/
H A DWriter.cpp1517 llvm::find_if(llvm::reverse(script->sectionCommands), isSection).base(),
1855 for (InputSectionBase *s : llvm::reverse(inputSections)) {
H A DInputSection.cpp861 for (const auto &patAndValue : llvm::reverse(config->deadRelocInNonAlloc))
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSTLExtras.h338 // Returns an iterator_range over the given container which iterates in reverse.
341 auto reverse(ContainerTy &&C, function in namespace:llvm
352 // Returns an iterator_range over the given container which iterates in reverse.
356 auto reverse(ContainerTy &&C, function in namespace:llvm
/freebsd-13-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DCStringChecker.cpp481 SVal reverse = local
484 reverse.getAs<DefinedOrUnknownSVal>();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DModuloSchedule.cpp1424 // chain is in reverse order).
1750 // Push out the epilogs, again in reverse order.
1823 // Iterate in reverse order over all instructions, remapping as we go.
1824 for (MachineBasicBlock *B : reverse(Blocks)) {
1839 for (MachineBasicBlock *B : reverse(Blocks))
H A DMachineBasicBlock.cpp81 std::reverse(Prefix.begin(), Prefix.end());
648 // We can't reverse the condition, add an unconditional branch.
/freebsd-13-stable/contrib/llvm-project/llvm/lib/DWARFLinker/
H A DDWARFLinker.cpp576 // Add children in reverse order to the worklist to effectively process them
578 for (auto Child : reverse(Die.children())) {
647 // Add referenced DIEs in reverse order to the worklist to effectively
649 for (auto &P : reverse(ReferencedDIEs)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp1657 // Do reverse-CFG DFS, computing the reverse-CFG PostOrder.
1690 // Use reverse-postorder traversals, because we magically know that loops
1693 // class here because we want the reverse-CFG postorder to consider each
1701 // Use reverse-postorder on the reverse CFG for bottom-up.
1703 for (BasicBlock *BB : llvm::reverse(ReverseCFGPostOrder)) {
1709 // Use reverse-postorder for top-down.
1711 for (BasicBlock *BB : llvm::reverse(PostOrder)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp477 for (Instruction &I : reverse(*BB)) {
2965 for (auto *Inst : reverse(ToRemove)) {
H A DLICM.cpp447 /// the specified block, and that are in the current loop) in reverse depth
467 // before their children in the worklist and process the worklist in reverse
472 for (DomTreeNode *DTN : reverse(Worklist)) {
774 // We can do this by iterating through the blocks in the loop in reverse
893 // immediate dominator. We iterate through the instructions in reverse order
899 for (Instruction *I : reverse(HoistedInstructions)) {
/freebsd-13-stable/tools/sched/
H A Dschedgraph.py819 # at the beginning. As a result, we add events in reverse order
822 self.events.reverse()
1489 sources.sort(cmp=source_cmp_start, reverse=True)
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h181 /// This is a simple wrapper around an index into the reverse-post-order
726 /// reverse-post order. This gives two advantages: it's easy to compare the
737 /// Run a single post-order traversal and save it (in reverse) in RPOT.
745 /// in reverse post-order.
756 /// Distributing mass in a loop is a reverse-post-order traversal through
869 // All blocks in reverse postorder.
893 /// Saves a reverse post-order traversal of all the nodes in \a F.
900 /// loop, we store in reverse post-order its "immediate" members, defined as
916 /// reverse post-order, distribute mass to its successors. Only visits nodes
925 /// Assign mass to the entry block, and then for each block in reverse
[all...]
/freebsd-13-stable/contrib/llvm-project/clang/lib/Parse/
H A DParseTemplate.cpp1653 for (DeclContext *DC : reverse(DeclContextsToReenter)) {
/freebsd-13-stable/contrib/libxo/xohtml/external/
H A Djquery.qtip.js2129 return y ? result : result.reverse();
2354 if(precedance === X) { corners.reverse(); }
/freebsd-13-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DExprEngineC.cpp829 for (CFGElement CE : llvm::reverse(*SrcBlock)) {

Completed in 317 milliseconds

1234567891011