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

1234567891011

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/Windows/
H A DSignals.inc477 find(reverse(*FilesToRemove), Filename);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfCompileUnit.cpp746 for (auto Var : reverse(Input)) {
1334 for (auto &Btr : reverse(ExprRefedBaseTypes)) {
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DAsmWriterEmitter.cpp149 std::reverse(OpsToPrint.begin(), OpsToPrint.end());
480 std::reverse(Instructions.begin(), Instructions.end());
791 // A list of MCOperandPredicates for all operands in use, and the reverse map
/freebsd-11-stable/contrib/gcc/config/arm/
H A Darm.c6564 reverse a comparison if necessary. */
9544 output_return_instruction (rtx operand, int really_return, int reverse)
9572 output_asm_insn (reverse ? "bl%D0\t%a1" : "bl%d0\t%a1", ops);
9580 sprintf (conditional, "%%?%%%c0", reverse ? 'D' : 'd');
10634 /* This is the reverse of the soft frame pointer
11138 value is held in the lower number register. The reverse is true
11621 int reverse = 0;
11665 reverse = TRUE;
11678 reverse = TRUE;
11688 gcc_assert (!arm_ccfsm_state || reverse);
9528 output_return_instruction(rtx operand, int really_return, int reverse) argument
11602 int reverse = 0; local
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/Headers/
H A Daltivec.h3899 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
3901 return vec_perm(mask, mask, reverse);
3916 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
3918 return vec_perm(mask, mask, reverse);
3933 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
3935 return vec_perm(mask, mask, reverse);
3950 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
3952 return vec_perm(mask, mask, reverse);
3967 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
3969 return vec_perm(mask, mask, reverse);
3984 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4001 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4020 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4037 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4054 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4071 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4088 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4105 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
4122 vector unsigned char reverse = {15, 14, 13, 12, 11, 10, 9, 8, local
[all...]
/freebsd-11-stable/contrib/gcc/
H A Drtlanal.c4343 If REVERSE is nonzero, then reverse the condition prior to canonizing it.
4359 canonicalize_condition (rtx insn, rtx cond, int reverse, rtx *earliest,
4376 if (reverse)
4626 int reverse;
4637 /* If this branches to JUMP_LABEL when the condition is false, reverse
4639 reverse
4643 return canonicalize_condition (jump, cond, reverse, earliest, NULL_RTX,
4333 canonicalize_condition(rtx insn, rtx cond, int reverse, rtx *earliest, rtx want_reg, int allow_cc_mode, int valid_at_insn_p) argument
4600 int reverse; local
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AVR/
H A DAVRISelLowering.cpp454 // Swap operands and reverse the branching condition.
487 // Swap operands and reverse the branching condition.
515 // Swap operands and reverse the branching condition.
528 // Swap operands and reverse the branching condition.
991 std::reverse(ArgLocs.begin() + pos, ArgLocs.begin() + pos + Size);
1223 // in reverse order in the loop below.
1234 // Second, stack arguments have to walked in reverse order by inserting
1328 std::reverse(RVLocs.begin(), RVLocs.end());
1394 std::reverse(RVLocs.begin(), RVLocs.end());
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSTLExtras.h262 // Returns an iterator_range over the given container which iterates in reverse.
265 auto reverse(ContainerTy &&C,
277 // Returns an iterator_range over the given container which iterates in reverse.
281 auto reverse(
/freebsd-11-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-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h113 auto RChildren = reverse(children<NodePtr>(N));
127 // next snapshots by reverse-applying future updates.
134 // 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-11-stable/contrib/llvm-project/clang/lib/ARCMigrate/
H A DTransformActions.cpp509 for (const CharRange &I : llvm::reverse(Removals)) {
/freebsd-11-stable/contrib/llvm-project/clang/lib/Driver/ToolChains/Arch/
H A DARM.cpp487 auto CryptoIt = llvm::find_if(llvm::reverse(Features), [](const StringRef F) {
/freebsd-11-stable/contrib/llvm-project/lldb/source/Target/
H A DStackFrameList.cpp391 for (Function *callee : llvm::reverse(path)) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopInfo.h333 // worklist backwards so append them in reverse order.
409 /// interface to reverse Blocks[from, end of loop] in this loop
412 std::reverse(Blocks.begin() + from, Blocks.end());
924 /// reverse postorder.
928 /// nests, with siblings in *reverse* program order.
931 /// reverse postorder.
933 /// Also note that this is *not* a reverse preorder. Only the siblings are in
934 /// reverse program order.
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp574 for (Instruction *I : llvm::reverse(InstChain)) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMLowOverheadLoops.cpp625 for (auto *MBB : reverse(ML->getBlocks())) {
H A DARMParallelDSP.cpp522 for (Instruction &I : reverse(BB)) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/TableGen/
H A DTGParser.cpp1942 // first. We'll first read everything in to a vector, then we can reverse
1972 std::reverse(NewBits.begin(), NewBits.end());
2172 std::reverse(Ranges.begin(), Ranges.end());
2632 std::reverse(BitList.begin(), BitList.end());
3086 std::reverse(Bits.begin(), Bits.end());
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsCallLowering.cpp52 std::reverse(VRegs.begin(), VRegs.end());
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGFast.cpp629 std::reverse(Sequence.begin(), Sequence.end());
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Bitcode/Reader/
H A DBitcodeAnalyzer.cpp690 std::reverse(FreqPairs.begin(), FreqPairs.end());
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp341 for (auto &I : reverse(*BB)) {
348 // to keep the last one (i.e. the first found since we for reverse
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DInliner.cpp1099 for (CallSite &CS : reverse(IFI.InlinedCallSites))
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DThreadSanitizer.cpp377 for (Instruction *I : reverse(Local)) {
H A DInstrProfiling.cpp470 for (auto *Loop : llvm::reverse(Loops)) {

Completed in 532 milliseconds

1234567891011