/freebsd-11-stable/crypto/openssl/crypto/asn1/ |
H A D | x_x509a.c | 193 ASN1_EXP_OPT(X509_CERT_PAIR, reverse, X509, 1)
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 295 auto RChildren = reverse(children<NodePtr>(N)); 325 auto RChildren = reverse(children<NodePtr>(N));
|
H A D | ThreadSafetyUtil.h | 206 llvm::iterator_range<reverse_iterator> reverse() { 210 llvm::iterator_range<const_reverse_iterator> reverse() const {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | LoopPass.cpp | 131 for (Loop *I : reverse(*L)) 174 // Populate the loop queue in reverse program order. There is no clear need to 175 // process sibling loops in either forward or reverse order. There may be some 180 // Note that LoopInfo::iterator visits loops in reverse program 183 for (Loop *L : reverse(*LI))
|
H A D | CGSCCPassManager.cpp | 408 for (SCC &NewC : llvm::reverse(make_range(std::next(NewSCCRange.begin()), 560 // The RC worklist is in reverse postorder, so we enqueue the new ones in 565 for (RefSCC *NewRC : llvm::reverse(make_range(std::next(NewRefSCCs.begin()), 687 // Enqueue in reverse order as we pop off the back of the worklist. 688 for (SCC &MovedC : llvm::reverse(make_range(RC->begin() + InitialSCCIndex,
|
/freebsd-11-stable/contrib/ofed/opensm/opensm/ |
H A D | osm_mesh.c | 1029 "no reverse link\n"); 1406 int *reverse; local 1411 reverse = malloc(num_switches * sizeof(int)); 1413 if (!comp || !reverse || !switches) { 1428 reverse[comp[i].index] = i; 1436 reverse[s->node->links[j]->switch_id]; 1447 if (reverse) 1448 free(reverse);
|
/freebsd-11-stable/contrib/libstdc++/include/bits/ |
H A D | stl_list.h | 88 reverse(); 624 * Returns a read/write reverse iterator that points to the last 625 * element in the %list. Iteration is done in reverse element 633 * Returns a read-only (constant) reverse iterator that points to 634 * the last element in the %list. Iteration is done in reverse 642 * Returns a read/write reverse iterator that points to one 644 * reverse element order. 651 * Returns a read-only (constant) reverse iterator that points to one 652 * before the first element in the %list. Iteration is done in reverse 1086 reverse() function in class:list [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Core/ |
H A D | SourceManager.cpp | 251 Stream *s, uint32_t count, bool reverse, const SymbolContextList *bp_locs) { 265 if (reverse && m_last_line == 1) 274 if (reverse) { 275 // If this is the first time we've done a reverse, then back up one 250 DisplayMoreWithLineNumbers( Stream *s, uint32_t count, bool reverse, const SymbolContextList *bp_locs) argument
|
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/zfs/ |
H A D | zfs_iter.c | 157 boolean_t reverse) 169 col->sc_reverse = reverse; 156 zfs_add_sort_column(zfs_sort_column_t **sc, const char *name, boolean_t reverse) argument
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/Refactoring/ |
H A D | ASTSelection.cpp | 424 for (const auto &Parent : llvm::reverse(Parents)) { 442 for (const auto &Parent : llvm::reverse(Parents)) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | Float2Int.cpp | 182 // - walkForwards: Iterate over SeenInsts in reverse order, so we visit 243 for (auto &It : reverse(SeenInsts)) { 514 for (auto &I : reverse(ConvertedInsts))
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/XRay/ |
H A D | Profile.cpp | 147 auto RootToLeafPath = reverse(P); 359 transform(reverse(TSD), std::back_inserter(Path),
|
/freebsd-11-stable/contrib/subversion/subversion/include/ |
H A D | svn_diff.h | 1091 * If the @a hunk is being interpreted in reverse (i.e. the reverse 1286 * Indicates whether the patch is being interpreted in reverse. 1289 svn_boolean_t reverse; 1293 * forward merges and one for reverse merges. 1356 * If @a reverse is TRUE, invert the patch while parsing it. 1366 svn_boolean_t reverse, 1281 svn_boolean_t reverse; member in struct:svn_patch_t
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/ |
H A D | trie_policy.hpp | 89 reverse = Reverse enumerator in enum:pb_ds::string_trie_e_access_traits::__anon2091
|
/freebsd-11-stable/usr.bin/tail/ |
H A D | reverse.c | 35 static char sccsid[] = "@(#)reverse.c 8.1 (Berkeley) 6/6/93"; 40 __FBSDID("$FreeBSD: stable/11/usr.bin/tail/reverse.c 332600 2018-04-16 16:20:39Z asomers $"); 62 * reverse -- display input in reverse order by line. 80 reverse(FILE *fp, const char *fn, enum STYLE style, off_t off, struct stat *sbp) function 106 * r_reg -- display a regular file in reverse order by line. 181 * r_buf -- display a non-regular file in reverse order by line. 184 * doubly linked list of buffers and then displays them in reverse order. 239 * Now print the lines in reverse order
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/ |
H A D | ContinuationRecordBuilder.cpp | 221 // sequence that we return to the caller contains the records in reverse 232 for (uint32_t Offset : reverse(SO)) {
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | ScopeInfo.cpp | 212 llvm::find(llvm::reverse(Uses->second), WeakUseTy(E, true));
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/Process/gdb-remote/ |
H A D | GDBRemoteCommunicationReplayServer.cpp | 198 // We want to manipulate the vector like a stack so we need to reverse the 200 std::reverse(m_packet_history.begin(), m_packet_history.end());
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUAnnotateKernelFeatures.cpp | 217 for (auto *Node : reverse(NodeList)) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | Automaton.h | 67 /// traversed path is stored in reverse order with the latest state as the 149 std::reverse(P.begin(), P.end());
|
/freebsd-11-stable/contrib/llvm-project/lld/ELF/ |
H A D | SymbolTable.cpp | 242 // definitions in the reverse order. 243 for (VersionDefinition &v : llvm::reverse(config->versionDefinitions))
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyRegStackify.cpp | 661 Worklist.push_back(reverse(Range)); 682 Worklist.push_back(reverse(Range)); 691 Worklist.back() = reverse(Instr->explicit_uses()); 799 // Iterate through the inputs in reverse order, since we'll be pulling 915 for (MachineOperand &MO : reverse(MI.explicit_operands())) {
|
/freebsd-11-stable/contrib/gcc/ |
H A D | expr.c | 104 int reverse; member in struct:move_by_pieces 120 int reverse; member in struct:store_by_pieces 894 data.reverse 903 data.reverse = 1; 905 data.reverse = 0; 917 if (data.reverse) data.offset = len; 932 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from) 946 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to) 952 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to) 1006 gcc_assert (!data.reverse); 2198 int reverse; local [all...] |
H A D | cfganal.c | 631 /* Perform depth-first search in the reverse graph to find nodes 653 /* Compute reverse top sort order. 726 REV_POST_ORDER is nonzero, return the reverse completion number for each 732 rev_post_order is really a reverse postorder numbering of the graph. 797 its reverse completion number. */ 805 so assign its reverse completion number. */ 861 reverse graph. If INITIALIZE_STACK is nonzero, the exit block is 893 /* Continue the depth-first search through the reverse graph starting with the 925 reverse graph. */ 938 dfs_enumerate_from (basic_block bb, int reverse, 933 dfs_enumerate_from(basic_block bb, int reverse, bool (*predicate) (basic_block, void *), basic_block *rslt, int rslt_max, void *data) argument [all...] |
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libuutil/common/ |
H A D | uu_list.c | 502 int reverse = (flags & UU_WALK_REVERSE); local 519 if (!reverse) {
|