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

1234567891011

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopUnrollAndJamPass.cpp450 internal::appendLoopsToWorklist(reverse(LI), Worklist);
H A DStructurizeCFG.cpp339 // The reverse post-order traversal of the list gives us an ordering close
379 // the list in reverse. Now that we are using a reverse post-order traversal
381 // we just reverse the list and continue to operate on it in reverse.
382 std::reverse(Order.begin(), Order.end());
520 for (RegionNode *RN : reverse(Order)) {
H A DSimpleLoopUnswitch.cpp646 for (unsigned Index : reverse(ExitCaseIndices)) {
699 // We walk in reverse so that we split in the same order as the cases
722 for (auto &ExitCase : reverse(ExitCases)) {
749 // Now add the unswitched cases. We do this in reverse order as we built them
750 // in reverse order.
751 for (auto &ExitCase : reverse(ExitCases)) {
1187 // Build up the loops to clone in reverse order as we'll clone them from the
1189 for (Loop *ChildL : llvm::reverse(OrigRootL))
1197 for (Loop *ChildL : llvm::reverse(*L))
1866 // is a predecessor of the header and so reached in the reverse wal
[all...]
H A DSpeculateAroundPHIs.cpp427 // First, establish a reverse mapping from immediate users of the PHI nodes
698 // needs to be in reverse so that we don't think there are users when we'll
701 for (auto *OrigI : llvm::reverse(SpecList)) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyExplicitLocals.cpp315 for (MachineOperand &MO : reverse(MI.explicit_uses())) {
/freebsd-11-stable/contrib/libpcap/
H A Dgencode.c1105 * with the test specified by "jtype"; if "reverse" is true, the test
1110 bpf_u_int32 size, bpf_u_int32 mask, bpf_u_int32 jtype, int reverse,
1127 if (reverse && (jtype == BPF_JGT || jtype == BPF_JGE))
9483 bpf_int32 jvalue, bpf_u_int32 jtype, int reverse)
9495 reverse, jvalue);
9504 reverse, jvalue);
9511 reverse, jvalue);
9518 0xffffffff, jtype, reverse, jvalue);
9527 jtype, reverse, jvalue);
9570 bpf_int32 jvalue, bpf_u_int32 jtype, int reverse)
1109 gen_ncmp(compiler_state_t *cstate, enum e_offrel offrel, bpf_u_int32 offset, bpf_u_int32 size, bpf_u_int32 mask, bpf_u_int32 jtype, int reverse, bpf_int32 v) argument
9482 gen_atmfield_code_internal(compiler_state_t *cstate, int atmfield, bpf_int32 jvalue, bpf_u_int32 jtype, int reverse) argument
9569 gen_atmfield_code(compiler_state_t *cstate, int atmfield, bpf_int32 jvalue, bpf_u_int32 jtype, int reverse) argument
9770 gen_mtp3field_code(compiler_state_t *cstate, int mtp3field, bpf_u_int32 jvalue_arg, bpf_u_int32 jtype, int reverse) argument
[all...]
/freebsd-11-stable/contrib/ncurses/ncurses/tinfo/
H A Dtinfo_driver.c737 int reverse,
804 if (reverse) {
734 drv_do_color(TERMINAL_CONTROL_BLOCK * TCB, int old_pair, int pair, int reverse, NCURSES_SP_OUTC outc) argument
/freebsd-11-stable/contrib/bmake/mk/
H A Ddpadd.mk82 # in reverse order so that libs end up listed after all that needed them.
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h498 /// subloop header, add the subloop to its parent in PostOrder, then reverse the
514 std::reverse(Subloop->getSubLoopsVector().begin(),
531 /// 1) Discovered and mapped by a reverse CFG traversal.
570 // order as we walk it. But LoopInfo stores the top level loops in reverse
571 // program order so for here we reverse it to get forward program order.
573 // reverse here.
574 for (LoopT *RootL : reverse(*this)) {
588 // order as we walk it. LoopInfo stores the top level loops in reverse
590 // FIXME: If we change the order of LoopInfo we will want to add a reverse
H A DCGSCCPassManager.h239 /// This worklist is in reverse post-order, as we pop off the back in order
241 /// them in reverse post-order.
254 /// This worklist is in reverse post-order, as we pop off the back in order
256 /// in reverse post-order.
798 // Push the initial SCCs in reverse post-order as we'll pop off the
800 for (LazyCallGraph::SCC &C : llvm::reverse(*RC))
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/MCTargetDesc/
H A DX86AsmBackend.cpp979 std::reverse(&SavedRegs[0], &SavedRegs[SavedRegIdx]);
1017 // register. The list of saved registers is assumed to be in reverse
1061 std::reverse(&SavedRegs[0], &SavedRegs[CU_NUM_SAVED_REGS]);
/freebsd-11-stable/contrib/unbound/dns64/
H A Ddns64.c159 reverse(char* begin, char* end) function
183 reverse(s, ss);
/freebsd-11-stable/contrib/groff/src/roff/troff/
H A Denv.cpp2052 static int reverse = 0; local
2053 if (force_reverse || reverse)
2065 if (force_reverse || reverse)
2068 reverse = !reverse;
/freebsd-11-stable/contrib/gcc/
H A Difcvt.c356 reverse the condition. */
1485 int reverse;
1496 reverse
1602 cond = canonicalize_condition (if_info->jump, cond, reverse,
2023 bool reverse;
2031 reverse the condition. */
2032 reverse = (GET_CODE (XEXP (SET_SRC (set), 2)) == LABEL_REF
2043 if (reverse)
2051 return canonicalize_condition (jump, cond, reverse, earliest,
1482 int reverse; local
2020 bool reverse; local
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/
H A DMipsELFObjectWriter.cpp525 // them in reverse order.
527 for (const auto &R : reverse(Sorted))
/freebsd-11-stable/contrib/llvm-project/clang/lib/Lex/
H A DPPDirectives.cpp764 for (IncludeStackInfo &ISEntry : llvm::reverse(IncludeMacroStack)) {
827 for (IncludeStackInfo &ISEntry : llvm::reverse(IncludeMacroStack)) {
1622 for (auto &Component : llvm::reverse(Components)) {
1991 std::reverse(Path.begin(), Path.end());
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/
H A DInterpolatingCompilationDatabase.cpp242 for (StringRef S : llvm::reverse(CmdLine)) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/MCJIT/
H A DMCJIT.cpp643 auto I = find(reverse(EventListeners), L);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DOrcCBindingsStack.h439 auto I = find(reverse(EventListeners), L);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DVirtRegMap.cpp449 for (MachineInstr *BundledMI : llvm::reverse(MIs)) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp236 // Remove incoming values in the reverse order to prevent invalidating
238 for (unsigned III : llvm::reverse(Indices))
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-account.cpp453 for (const auto &Entry : llvm::reverse(ThreadStack.second))
H A Dxray-graph.cpp447 for (const auto &Entry : llvm::reverse(ThreadStack.second))
/freebsd-11-stable/contrib/subversion/subversion/libsvn_client/
H A Ddiff.c600 merged or reverse merged; otherwise (or if the mergeinfo property values
2080 If REVERSE is TRUE, the diff will be reported in reverse.
2098 svn_boolean_t reverse,
2247 if (!reverse)
2273 if (reverse)
2286 reverse,
2336 diffs in reverse. :-) */
2088 diff_repos_wc(struct diff_driver_info_t *ddi, const char *path_or_url1, const svn_opt_revision_t *revision1, const svn_opt_revision_t *peg_revision1, const char *path2, enum svn_opt_revision_kind revision2_kind, svn_boolean_t reverse, svn_depth_t depth, svn_boolean_t ignore_ancestry, const apr_array_header_t *changelists, const svn_diff_tree_processor_t *diff_processor, svn_client_ctx_t *ctx, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument
H A Dpatch.c3625 /* Whether to apply the patch in reverse. */
3626 svn_boolean_t reverse,
3658 reverse, ignore_whitespace,
3735 svn_boolean_t reverse,
3781 reverse, ignore_whitespace, remove_tempfiles,
3616 apply_patches( const char *patch_abspath, const char *root_abspath, svn_boolean_t dry_run, int strip_count, svn_boolean_t reverse, svn_boolean_t ignore_whitespace, svn_boolean_t remove_tempfiles, svn_client_patch_func_t patch_func, void *patch_baton, svn_client_ctx_t *ctx, apr_pool_t *scratch_pool) argument
3730 svn_client_patch(const char *patch_abspath, const char *wc_dir_abspath, svn_boolean_t dry_run, int strip_count, svn_boolean_t reverse, svn_boolean_t ignore_whitespace, svn_boolean_t remove_tempfiles, svn_client_patch_func_t patch_func, void *patch_baton, svn_client_ctx_t *ctx, apr_pool_t *scratch_pool) argument

Completed in 703 milliseconds

1234567891011