Searched refs:reverse (Results 101 - 125 of 127) sorted by relevance

123456

/freebsd-11.0-release/contrib/ncurses/ncurses/win32con/
H A Dwin_driver.c1060 int reverse GCC_UNUSED,
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/CodeGen/
H A DCGCall.cpp2643 // Iterate in reverse to increase the likelihood of popping the cleanup.
2644 for (const auto &I : llvm::reverse(Cleanups)) {
2872 // Un-reverse the arguments we just evaluated so they match up with the LLVM
2874 std::reverse(Args.begin() + CallArgsStart, Args.end());
H A DCodeGenModule.cpp1205 // Add link options for all of the imported modules in reverse topological
1213 std::reverse(MetadataArgs.begin(), MetadataArgs.end());
/freebsd-11.0-release/contrib/llvm/tools/lldb/source/Core/
H A DCxaDemangle.cpp224 std::reverse(buf, e);
/freebsd-11.0-release/contrib/subversion/subversion/include/
H A Dsvn_client.h3988 * order; otherwise, the reverse occurs.)
6560 * If @a reverse is @c TRUE, apply patches in reverse, deleting lines
6589 svn_boolean_t reverse,
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Sema/
H A DAnalysisBasedWarnings.cpp1104 for (const CFGBlock *B : llvm::reverse(*Cfg)) {
H A DSemaTemplate.cpp1742 std::reverse(NestedTypes.begin(), NestedTypes.end());
H A DSemaDecl.cpp8847 for (const FieldDecl *I : llvm::reverse(Fields))
11785 // Once we have all the namespaces, reverse them to go outermost first, and
11791 std::reverse(Namespaces.begin(), Namespaces.end());
14394 // reverse the list.
/freebsd-11.0-release/contrib/llvm/lib/Support/
H A DAPInt.cpp2228 // We insert the digits backward, then reverse them to get the right order.
2259 std::reverse(Str.begin()+StartDig, Str.end());
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DRewriteStatepointsForGC.cpp2178 std::reverse(ChainToBase.begin(), ChainToBase.end());
2650 // reverse the transform we're about to do would be slightly complex.
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/AST/
H A DRecursiveASTVisitor.h562 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
/freebsd-11.0-release/sys/mips/mips/
H A Dfp.S1254 xor t0, t0, 1 # reverse sign
1262 xor t0, t0, 1 # reverse sign
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DScalarEvolution.cpp6132 for (auto &LS : reverse(ValuesAtScopes[V]))
8913 std::reverse(Subscripts.begin(), Subscripts.end());
9464 for (auto *R : reverse(*L))
/freebsd-11.0-release/contrib/gcc/cp/
H A Ddecl.c533 If REVERSE is nonzero, reverse the order of decls before putting
537 poplevel (int keep, int reverse, int functionbody)
540 /* The chain of decls was accumulated in reverse order.
580 Usually current_binding_level->names is in reverse order.
583 if (reverse)
10711 /* We built up the VALUES in reverse order. */
11574 for each of these. We must do them in reverse order so that
534 poplevel(int keep, int reverse, int functionbody) argument
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Analysis/
H A DCFG.cpp362 /// the AST in reverse order so that the successor of a basic block is
1046 for (auto *I : llvm::reverse(CD->inits())) {
1221 // We need to append the destructors in reverse order, but any one of them
1223 // this sequence up and replay them in reverse order when appending onto the
1620 // Visit the children in their reverse order so that they appear in
2710 // CFG-land, that means appending them in reverse order.
3704 // When visiting children for destructors we want to visit them in reverse
3738 // before RHS expression. For destructors visit them in reverse order.
3745 // LHS expression (order of children). For destructors visit them in reverse
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp1534 std::reverse(Sequence.begin(), Sequence.end());
1562 // reverse left/right rather than simply !SortFunc(left, right)
H A DSelectionDAGBuilder.cpp452 std::reverse(Parts + RoundParts, Parts + NumParts);
486 std::reverse(Parts, Parts + OrigNumParts);
7863 // reverse order to make it easier to reconstruct the partitions in ascending
H A DLegalizeIntegerTypes.cpp833 std::reverse(Parts.begin(), Parts.end());
H A DSelectionDAG.cpp1156 // big-endian order then reverse it now.
1158 std::reverse(EltParts.begin(), EltParts.end());
2703 // Get reverse index (starting from 1), Op1 value indexes elements from
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Serialization/
H A DASTReader.cpp1634 for (auto &I : llvm::reverse(ModuleMgr)) {
1820 // Module macros are listed in reverse dependency order.
1822 std::reverse(ModuleMacros.begin(), ModuleMacros.end());
1844 // Deserialize the macro directives history in reverse source-order.
2003 // Build a list of the PCH imports that got us here (in reverse).
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp5249 for (auto &I : reverse(BB)) {
/freebsd-11.0-release/contrib/llvm/lib/Bitcode/Reader/
H A DBitcodeReader.cpp3310 // If this is the first function body we've seen, reverse the
3313 std::reverse(FunctionsWithBodies.begin(), FunctionsWithBodies.end());
/freebsd-11.0-release/contrib/libc++/src/
H A Dlocale.cpp4416 reverse(__g, __g_end);
/freebsd-11.0-release/contrib/libxo/xohtml/external/
H A Djquery.js5600 ret = ret.reverse();
/freebsd-11.0-release/contrib/gcc/config/i386/
H A Di386.c7775 put_condition_code (enum rtx_code code, enum machine_mode mode, int reverse,
7788 if (reverse)
8243 /* Like above, but reverse condition */
8825 derived assemblers, confusingly reverse the direction of
7754 put_condition_code(enum rtx_code code, enum machine_mode mode, int reverse, int fp, FILE *file) argument

Completed in 610 milliseconds

123456