/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | Stmt.h | 1440 for (auto *B : llvm::reverse(body())) {
|
H A D | RecursiveASTVisitor.h | 663 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | BugReporterVisitors.cpp | 720 // Add the regions in the reverse order, then reverse the resulting array. 727 std::reverse(RegionSequence.begin(), RegionSequence.end());
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGRRList.cpp | 1633 std::reverse(Sequence.begin(), Sequence.end()); 1656 // reverse left/right rather than simply !SortFunc(left, right)
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ConstantFolding.cpp | 666 for (unsigned char C : reverse(Str.bytes())) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineBlockPlacement.cpp | 1294 for (MachineBasicBlock *src : reverse(Chain.Edges)) {
|
H A D | CodeGenPrepare.cpp | 6196 // Use reverse iterator because later select may use the value of the 6296 // uses must come first, so we process the ops in reverse order so as to not 6301 for (Use *U : reverse(OpsToSink)) { 7228 for (auto &I : reverse(BB)) {
|
H A D | MachineScheduler.cpp | 508 std::reverse(Regions.begin(), Regions.end()); 860 // Release bottom roots in reverse order so the higher priority nodes appear 2896 // If the candidates are decreasing pressure, reverse priority.
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | RewriteStatepointsForGC.cpp | 2087 std::reverse(ChainToBase.begin(), ChainToBase.end()); 2577 // reverse the transform we're about to do would be slightly complex.
|
H A D | NewGVN.cpp | 31 /// reverse mapping from value number -> operations with that value number), so 3182 "Representative MemoryAccess does not appear to be reverse " 3186 "Memory member does not appear to be reverse mapped properly"); 3873 for (auto *CC : reverse(CongruenceClasses)) {
|
/freebsd-11-stable/contrib/subversion/subversion/include/ |
H A D | svn_client.h | 3167 * merged or reverse merged; otherwise (or if the mergeinfo property values 4156 * order; otherwise, the reverse occurs.) 7621 * If @a reverse is @c TRUE, apply patches in reverse, deleting lines 7650 svn_boolean_t reverse,
|
/freebsd-11-stable/contrib/llvm-project/lld/ELF/ |
H A D | Driver.cpp | 538 for (auto *arg : llvm::reverse(args)) {
|
/freebsd-11-stable/sys/mips/mips/ |
H A D | fp.S | 1254 xor t0, t0, 1 # reverse sign 1262 xor t0, t0, 1 # reverse sign
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/ |
H A D | CFG.cpp | 465 /// the AST in reverse order so that the successor of a basic block is 1519 for (auto *I : llvm::reverse(CD->inits())) { 1522 // We've reached the first virtual base init while iterating in reverse 1781 // We need to perform the scope leaving in reverse order 1836 // We need to append the destructors in reverse order, but any one of them 1838 // this sequence up and replay them in reverse order when appending onto the 2350 // Visit the children in their reverse order so that they appear in 3661 // CFG-land, that means appending them in reverse order. 4736 // When visiting children for destructors we want to visit them in reverse 4753 // before RHS expression. For destructors visit them in reverse orde [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGCall.cpp | 3223 // Iterate in reverse to increase the likelihood of popping the cleanup. 3224 for (const auto &I : llvm::reverse(Cleanups)) { 3448 // to trump the "destruction order is reverse construction order" guarantee. 3470 // If we're emitting args in reverse, be sure to do so with 3522 // Un-reverse the arguments we just evaluated so they match up with the LLVM 3524 std::reverse(Args.begin() + CallArgsStart, Args.end());
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/ |
H A D | ExprConstant.cpp | 5372 for (const CXXBaseSpecifier *Elt : llvm::reverse(ICE->path())) { 5397 llvm::reverse(UnionPathLengths)) { 5868 // We don't have a good way to iterate fields in reverse, so collect all the 5871 for (const FieldDecl *FD : llvm::reverse(Fields)) { 5888 // Destroy base classes in reverse order. 5889 for (const CXXBaseSpecifier &Base : llvm::reverse(RD->bases())) { 6153 std::reverse(Output.begin(), Output.end()); 6159 std::reverse(Input.begin(), Input.end());
|
H A D | Decl.cpp | 1612 for (const DeclContext *DC : llvm::reverse(Contexts)) {
|
/freebsd-11-stable/contrib/gcc/cp/ |
H A D | decl.c | 533 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-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 3849 // Iterate in reverse order to consider insert elements with the high cost. 5754 // Do a quadratic search on all of the given stores in reverse order and find 7017 std::reverse(BuildVectorOpds.begin(), BuildVectorOpds.end()); 7228 for (auto *I : reverse(Instructions)) {
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | SymbolFileDWARF.cpp | 962 std::reverse(module.path.begin(), module.path.end());
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
H A D | AsmPrinter.cpp | 1538 for (const GlobalAlias *AncestorAlias : llvm::reverse(AliasStack))
|
H A D | CodeViewDebug.cpp | 324 llvm::reverse(QualifiedNameComponents)) {
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Parse/ |
H A D | ParseObjc.cpp | 1209 for (auto &AL : llvm::reverse(from)) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | APInt.cpp | 2252 // We insert the digits backward, then reverse them to get the right order. 2278 std::reverse(Str.begin()+StartDig, Str.end());
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstructionCombining.cpp | 3222 for (auto *DII : reverse(DbgUsers)) { 3523 // add them in reverse order. This way instcombine will visit from the top
|