Searched refs:reverse (Results 126 - 150 of 268) sorted by relevance

1234567891011

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/
H A DMipsELFObjectWriter.cpp500 // them in reverse order.
502 for (const auto &R : reverse(Sorted))
/freebsd-13-stable/contrib/bmake/mk/
H A Ddpadd.mk145 # in reverse order so that libs end up listed after all that needed them.
/freebsd-13-stable/sys/crypto/openssl/arm/
H A Dkeccak1600-armv4.S549 @ mov r4,r7,ror#32-13 @ [track reverse order below]
620 ldr r1,[sp,#32] @ A[0][4] [in reverse order]
626 ldrd r1,r0,[sp,#32] @ A[0][4] [in reverse order]
672 @ mov r0,r11,ror#32-14 @ [was loaded in reverse order]
1439 @ mov r4,r7,ror#32-13 @ [track reverse order below]
1510 ldr r1,[sp,#272] @ A[0][4] [in reverse order]
1516 ldrd r1,r0,[sp,#272] @ A[0][4] [in reverse order]
1562 @ mov r0,r11,ror#32-14 @ [was loaded in reverse order]
/freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DAsmWriterEmitter.cpp149 std::reverse(OpsToPrint.begin(), OpsToPrint.end());
499 std::reverse(Instructions.begin(), Instructions.end());
809 // A list of MCOperandPredicates for all operands in use, and the reverse map
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Support/Windows/
H A DSignals.inc477 find(reverse(*FilesToRemove), Filename);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/MCTargetDesc/
H A DX86AsmBackend.cpp1299 // register. The list of saved registers is assumed to be in reverse
1343 std::reverse(&SavedRegs[0], &SavedRegs[CU_NUM_SAVED_REGS]);
1545 std::reverse(&SavedRegs[0], &SavedRegs[SavedRegIdx]); member in class:__anon4394::DarwinX86AsmBackend::std
/freebsd-13-stable/contrib/llvm-project/clang/lib/Headers/
H A Daltivec.h3955 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
3957 return vec_perm(mask, mask, reverse);
3972 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
3974 return vec_perm(mask, mask, reverse);
3989 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
3991 return vec_perm(mask, mask, reverse);
4006 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4008 return vec_perm(mask, mask, reverse);
4023 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4025 return vec_perm(mask, mask, reverse);
4040 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4057 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4076 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4093 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4110 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4127 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4144 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4161 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4178 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
[all...]
/freebsd-13-stable/crypto/openssl/
H A DConfigure527 my @list = (reverse @tls);
534 my @list = (reverse @dtls);
2317 my @incs = reverse @{$unified_info{includes}->{$dest}->{$k}};
/freebsd-13-stable/contrib/llvm-project/clang/lib/Lex/
H A DPPMacroExpansion.cpp222 // Our reverse postorder walk found the macros in reverse order.
223 std::reverse(Info.ActiveModuleMacros.begin(), Info.ActiveModuleMacros.end());
447 for (const IncludeStackInfo &Entry : llvm::reverse(IncludeMacroStack)) {
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h115 auto RChildren = reverse(children<NodePtr>(N));
129 // next snapshots by reverse-applying future updates.
136 // reverse-apply the future updates to get the node's children at the
216 // relative to IsPostDom -- using reverse edges for dominators and forward
426 // are reverse-unreachable were not visited by previous DFS walks (i.e. CFG
429 // Accounting for the virtual exit, see if we had any reverse-unreachable
434 // reverse-unreachable blocks, and find the furthest paths we'll be able
446 // follow them in reverse. This gives us some reasonable answer about
474 LLVM_DEBUG(dbgs() << "\t\t\tRunning reverse DFS\n");
503 // We define roots to be some set of CFG nodes where (reverse) DF
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfCompileUnit.cpp837 for (auto Var : reverse(Input)) {
1435 for (auto &Btr : reverse(ExprRefedBaseTypes)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86SpeculativeLoadHardening.cpp357 // Remove both the block and value operand, again in reverse order to
633 for (MachineInstr &MI : llvm::reverse(MBB)) {
1217 for (MachineInstr &MI : llvm::reverse(llvm::make_range(MBB.begin(), I))) {
/freebsd-13-stable/contrib/bmake/unit-tests/
H A DMakefile354 TESTS+= varmod-order-reverse
/freebsd-13-stable/contrib/llvm-project/lldb/source/Target/
H A DStackFrameList.cpp407 for (auto calleeInfo : llvm::reverse(path)) {
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopInfo.h340 // worklist backwards so append them in reverse order.
416 /// interface to reverse Blocks[from, end of loop] in this loop
419 std::reverse(Blocks.begin() + from, Blocks.end());
932 /// reverse postorder.
936 /// nests, with siblings in *reverse* program order.
939 /// reverse postorder.
941 /// Also note that this is *not* a reverse preorder. Only the siblings are in
942 /// reverse program order.
/freebsd-13-stable/contrib/llvm-project/clang/lib/Sema/
H A DSemaAvailability.cpp795 for (const Stmt *S : llvm::reverse(StmtStack)) {
/freebsd-13-stable/contrib/llvm-project/clang/lib/ARCMigrate/
H A DTransformActions.cpp509 for (const CharRange &I : llvm::reverse(Removals)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineOutliner.cpp689 reverse(make_range(Cand.front(), OutlineBB.end())))
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGFast.cpp629 std::reverse(Sequence.begin(), Sequence.end());
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DInliner.cpp866 for (CallBase *ICB : reverse(IFI.InlinedCallSites)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DThreadSanitizer.cpp409 for (Instruction *I : reverse(Local)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVNHoist.cpp622 // Iterate in reverse order to keep lower ranked values on the top.
623 for (std::pair<VNType, Instruction *> &VI : reverse(it1->second)) {
779 // The dominance frontier of a live block X in the reverse
H A DLoopDistribute.cpp233 for (auto *Inst : reverse(Unused)) {
788 // We're done forming the partitions set up the reverse mapping from
H A DMergeICmps.cpp288 for (Instruction *Inst : reverse(OtherInsts)) {
696 // Effectively merge blocks. We go in the reverse direction from the phi block
H A DStructurizeCFG.cpp522 for (RegionNode *RN : reverse(Order)) {

Completed in 355 milliseconds

1234567891011