/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ProfileData/ |
H A D | GCOV.h | 112 std::reverse(str.begin(), str.end());
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DependenceGraphBuilder.cpp | 305 // being '>' we need to reverse the direction of the edge, because 503 for (NodeType *N : reverse(NodesInPO))
|
H A D | LazyCallGraph.cpp | 868 find_if(reverse(PendingSCCStack), [RootDFSNumber](const Node *N) { 1283 auto StackRI = find_if(reverse(PendingRefSCCStack), [&](Node *N) { 1692 find_if(reverse(PendingSCCStack), [RootDFSNumber](const Node *N) { 1753 // The roots will be popped of a stack, so use reverse to get a less 1755 std::reverse(Roots.begin(), Roots.end());
|
/freebsd-13-stable/contrib/lua/src/ |
H A D | lapi.c | 203 static void reverse (lua_State *L, StkId from, StkId to) { function 224 reverse(L, p, m); /* reverse the prefix with length 'n' */ 225 reverse(L, m + 1, t); /* reverse the suffix */ 226 reverse(L, p, t); /* reverse the entire segment */
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyExplicitLocals.cpp | 326 for (MachineOperand &MO : reverse(MI.explicit_uses())) {
|
/freebsd-13-stable/contrib/libpcap/ |
H A D | gencode.c | 1105 * 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-13-stable/contrib/unbound/dns64/ |
H A D | dns64.c | 159 reverse(char* begin, char* end) function 183 reverse(s, ss);
|
/freebsd-13-stable/contrib/bmake/unit-tests/ |
H A D | varmod-subst.mk | 124 @echo ${:U1 2 3:S\2\two\:Q} reverse solidus
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | LoopInfoImpl.h | 497 /// subloop header, add the subloop to its parent in PostOrder, then reverse the 513 std::reverse(Subloop->getSubLoopsVector().begin(), 530 /// 1) Discovered and mapped by a reverse CFG traversal. 569 // order as we walk it. But LoopInfo stores the top level loops in reverse 570 // program order so for here we reverse it to get forward program order. 572 // reverse here. 573 for (LoopT *RootL : reverse(*this)) { 587 // order as we walk it. LoopInfo stores the top level loops in reverse 589 // FIXME: If we change the order of LoopInfo we will want to add a reverse
|
H A D | CGSCCPassManager.h | 238 /// This worklist is in reverse post-order, as we pop off the back in order 240 /// them in reverse post-order. 253 /// This worklist is in reverse post-order, as we pop off the back in order 255 /// in reverse post-order. 829 // Push the initial SCCs in reverse post-order as we'll pop off the 831 for (LazyCallGraph::SCC &C : llvm::reverse(*RC))
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaAttr.cpp | 68 for (auto &PackedInclude : llvm::reverse(PackIncludeStack)) { 380 for (const auto &StackSlot : llvm::reverse(PackStack.Stack)) {
|
/freebsd-13-stable/contrib/ncurses/ncurses/tinfo/ |
H A D | tinfo_driver.c | 811 int reverse, 872 if (reverse) { 808 drv_do_color(TERMINAL_CONTROL_BLOCK * TCB, int old_pair, int pair, int reverse, NCURSES_SP_OUTC outc) argument
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | SimpleLoopUnswitch.cpp | 663 for (unsigned Index : reverse(ExitCaseIndices)) { 716 // We walk in reverse so that we split in the same order as the cases 739 for (auto &ExitCase : reverse(ExitCases)) { 766 // Now add the unswitched cases. We do this in reverse order as we built them 767 // in reverse order. 768 for (auto &ExitCase : reverse(ExitCases)) { 1204 // Build up the loops to clone in reverse order as we'll clone them from the 1206 for (Loop *ChildL : llvm::reverse(OrigRootL)) 1214 for (Loop *ChildL : llvm::reverse(*L)) 1888 // is a predecessor of the header and so reached in the reverse wal [all...] |
H A D | SpeculateAroundPHIs.cpp | 431 // First, establish a reverse mapping from immediate users of the PHI nodes 702 // needs to be in reverse so that we don't think there are users when we'll 705 for (auto *OrigI : llvm::reverse(SpecList)) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | ARMLowOverheadLoops.cpp | 828 // Visit the unknowns in reverse so that we can start at the values being 835 for (auto *MI : reverse(FalseLanesUnknown)) { 1103 for (auto *MBB : reverse(ML->getBlocks())) { 1583 for (auto *MBB : reverse(PostOrder))
|
/freebsd-13-stable/contrib/subversion/subversion/libsvn_client/ |
H A D | diff.c | 600 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 D | patch.c | 3625 /* 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
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Lex/ |
H A D | PPDirectives.cpp | 764 for (IncludeStackInfo &ISEntry : llvm::reverse(IncludeMacroStack)) { 827 for (IncludeStackInfo &ISEntry : llvm::reverse(IncludeMacroStack)) { 1622 for (auto &Component : llvm::reverse(Components)) { 1979 std::reverse(Path.begin(), Path.end());
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Tooling/ |
H A D | InterpolatingCompilationDatabase.cpp | 245 for (StringRef S : llvm::reverse(CmdLine)) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | VirtRegMap.cpp | 449 for (MachineInstr *BundledMI : llvm::reverse(MIs)) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/MCJIT/ |
H A D | MCJIT.cpp | 649 auto I = find(reverse(EventListeners), L);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/ |
H A D | OrcCBindingsStack.h | 439 auto I = find(reverse(EventListeners), L);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LowerSwitch.cpp | 229 // Remove incoming values in the reverse order to prevent invalidating 231 for (unsigned III : llvm::reverse(Indices))
|
/freebsd-13-stable/contrib/llvm-project/llvm/tools/llvm-xray/ |
H A D | xray-account.cpp | 453 for (const auto &Entry : llvm::reverse(ThreadStack.second))
|
H A D | xray-graph.cpp | 472 for (const auto &Entry : llvm::reverse(ThreadStack.second))
|