/freebsd-13-stable/sys/mips/mips/ |
H A D | fp.S | 1254 xor t0, t0, 1 # reverse sign 1262 xor t0, t0, 1 # reverse sign
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/AST/ |
H A D | ExprConstant.cpp | 5681 for (const CXXBaseSpecifier *Elt : llvm::reverse(ICE->path())) { 5706 llvm::reverse(UnionPathLengths)) { 6177 // We don't have a good way to iterate fields in reverse, so collect all the 6180 for (const FieldDecl *FD : llvm::reverse(Fields)) { 6197 // Destroy base classes in reverse order. 6198 for (const CXXBaseSpecifier &Base : llvm::reverse(RD->bases())) { 6462 std::reverse(Output.begin(), Output.end()); 6468 std::reverse(Input.begin(), Input.end());
|
H A D | Decl.cpp | 1599 for (const DeclContext *DC : llvm::reverse(Contexts)) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | CodeGenPrepare.cpp | 6597 // Use reverse iterator because later select may use the value of the 6672 // uses must come first, so we process the ops in reverse order so as to not 6677 for (Use *U : reverse(OpsToSink)) { 7640 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 2941 // If the candidates are decreasing pressure, reverse priority.
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGOpenMPRuntime.cpp | 11290 llvm::reverse(CGM.getOpenMPRuntime().LastprivateConditionalStack)) { 11423 llvm::reverse(LPM)) { 11442 llvm::reverse(LPM)) { 11614 auto Range = llvm::reverse(LastprivateConditionalStack);
|
H A D | CGOpenMPRuntimeNVPTX.cpp | 2434 llvm::reverse(I->getSecond().EscapedVariableLengthDeclsAddrs)) {
|
/freebsd-13-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | SymbolFileDWARF.cpp | 1000 std::reverse(module.path.begin(), module.path.end());
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Parse/ |
H A D | ParseObjc.cpp | 1210 for (auto &AL : llvm::reverse(from)) {
|
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | RecursiveASTVisitor.h | 601 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
|
/freebsd-13-stable/contrib/googletest/googletest/src/ |
H A D | gtest.cc | 1122 // Reconstruct the best path. We do it in reverse order. 1130 std::reverse(best_path.begin(), best_path.end()); 3439 // This defines a member that forwards the call to all listeners in reverse 4686 // *reverse* order they were registered. 5269 // Tears down all environments in reverse order afterwards.
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstructionCombining.cpp | 3435 // Walk deferred instructions in reverse order, and push them to the 3691 // add them in reverse order. This way instcombine will visit from the top 3696 for (Instruction *Inst : reverse(InstrsForInstCombineWorklist)) { 3697 // DCE instruction if trivially dead. As we iterate in reverse program
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | NewGVN.cpp | 31 /// reverse mapping from value number -> operations with that value number), so 3185 "Representative MemoryAccess does not appear to be reverse " 3189 "Memory member does not appear to be reverse mapped properly"); 3877 for (auto *CC : reverse(CongruenceClasses)) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ConstantFolding.cpp | 697 for (unsigned char C : reverse(Str.bytes())) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
H A D | AsmPrinter.cpp | 1618 for (const GlobalAlias *AncestorAlias : llvm::reverse(AliasStack))
|
H A D | CodeViewDebug.cpp | 338 llvm::reverse(QualifiedNameComponents)) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | APInt.cpp | 2250 // We insert the digits backward, then reverse them to get the right order. 2276 std::reverse(Str.begin()+StartDig, Str.end());
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86FrameLowering.cpp | 3535 std::reverse(ObjectsToAllocate.begin(), ObjectsToAllocate.end());
|
H A D | X86FastISel.cpp | 973 for (const Value *I : reverse(GEPs))
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Format/ |
H A D | TokenAnnotator.cpp | 2186 for (FormatToken *Token : llvm::reverse(Tokens))
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Demangle/ |
H A D | ItaniumDemangle.h | 2138 std::reverse(buf, e);
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaOpenMP.cpp | 273 /// the reverse of our iteration order where new inner levels are pushed at 449 for (const FunctionScopeInfo *FSI : llvm::reverse(SemaRef.FunctionScopes)) { 2152 llvm::reverse(FunctionScopes), 3589 for (const auto &SC : llvm::reverse(StackComponents)) { 4369 for (OpenMPDirectiveKind ThisCaptureRegion : llvm::reverse(CaptureRegions)) {
|
H A D | SemaTemplateDeduction.cpp | 5079 std::reverse(Args2.begin(), Args2.end());
|
H A D | SemaDeclCXX.cpp | 7896 for (Stmt *EAsStmt : llvm::reverse(OldStmts)) { 7915 std::reverse(Stmts.Stmts.begin(), Stmts.Stmts.end()); 10694 for (const DeclaratorChunk &Chunk : llvm::reverse(D.type_objects())) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SimplifyCFG.cpp | 1685 // in a set of blocks in reverse order from the first non-terminator. 1941 for (Instruction &CurI : reverse(BrBB->instructionsWithoutDebug())) {
|