head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.5 netbsd-11-0-RC3:1.1.1.5 netbsd-11-0-RC2:1.1.1.5 netbsd-11-0-RC1:1.1.1.5 perseant-exfatfs-base-20250801:1.1.1.5 netbsd-11:1.1.1.5.0.10 netbsd-11-base:1.1.1.5 netbsd-10-1-RELEASE:1.1.1.5 perseant-exfatfs-base-20240630:1.1.1.5 perseant-exfatfs:1.1.1.5.0.8 perseant-exfatfs-base:1.1.1.5 netbsd-8-3-RELEASE:1.1.1.3 netbsd-9-4-RELEASE:1.1.1.4 netbsd-10-0-RELEASE:1.1.1.5 netbsd-10-0-RC6:1.1.1.5 netbsd-10-0-RC5:1.1.1.5 netbsd-10-0-RC4:1.1.1.5 netbsd-10-0-RC3:1.1.1.5 netbsd-10-0-RC2:1.1.1.5 netbsd-10-0-RC1:1.1.1.5 netbsd-10:1.1.1.5.0.6 netbsd-10-base:1.1.1.5 netbsd-9-3-RELEASE:1.1.1.4 cjep_sun2x:1.1.1.5.0.4 cjep_sun2x-base:1.1.1.5 cjep_staticlib_x-base1:1.1.1.5 netbsd-9-2-RELEASE:1.1.1.4 cjep_staticlib_x:1.1.1.5.0.2 cjep_staticlib_x-base:1.1.1.5 netbsd-9-1-RELEASE:1.1.1.4 phil-wifi-20200421:1.1.1.5 phil-wifi-20200411:1.1.1.5 phil-wifi-20200406:1.1.1.5 netbsd-8-2-RELEASE:1.1.1.3 netbsd-9-0-RELEASE:1.1.1.4 netbsd-9-0-RC2:1.1.1.4 netbsd-9-0-RC1:1.1.1.4 netbsd-9:1.1.1.4.0.2 netbsd-9-base:1.1.1.4 phil-wifi-20190609:1.1.1.4 netbsd-8-1-RELEASE:1.1.1.3 netbsd-8-1-RC1:1.1.1.3 pgoyette-compat-merge-20190127:1.1.1.3.14.1 pgoyette-compat-20190127:1.1.1.4 pgoyette-compat-20190118:1.1.1.4 pgoyette-compat-1226:1.1.1.4 pgoyette-compat-1126:1.1.1.4 pgoyette-compat-1020:1.1.1.4 pgoyette-compat-0930:1.1.1.4 pgoyette-compat-0906:1.1.1.4 netbsd-7-2-RELEASE:1.1.1.2 pgoyette-compat-0728:1.1.1.4 clang-337282:1.1.1.4 netbsd-8-0-RELEASE:1.1.1.3 phil-wifi:1.1.1.3.0.16 phil-wifi-base:1.1.1.3 pgoyette-compat-0625:1.1.1.3 netbsd-8-0-RC2:1.1.1.3 pgoyette-compat-0521:1.1.1.3 pgoyette-compat-0502:1.1.1.3 pgoyette-compat-0422:1.1.1.3 netbsd-8-0-RC1:1.1.1.3 pgoyette-compat-0415:1.1.1.3 pgoyette-compat-0407:1.1.1.3 pgoyette-compat-0330:1.1.1.3 pgoyette-compat-0322:1.1.1.3 pgoyette-compat-0315:1.1.1.3 netbsd-7-1-2-RELEASE:1.1.1.2 pgoyette-compat:1.1.1.3.0.14 pgoyette-compat-base:1.1.1.3 netbsd-7-1-1-RELEASE:1.1.1.2 clang-319952:1.1.1.3 matt-nb8-mediatek:1.1.1.3.0.12 matt-nb8-mediatek-base:1.1.1.3 clang-309604:1.1.1.3 perseant-stdc-iso10646:1.1.1.3.0.10 perseant-stdc-iso10646-base:1.1.1.3 netbsd-8:1.1.1.3.0.8 netbsd-8-base:1.1.1.3 prg-localcount2-base3:1.1.1.3 prg-localcount2-base2:1.1.1.3 prg-localcount2-base1:1.1.1.3 prg-localcount2:1.1.1.3.0.6 prg-localcount2-base:1.1.1.3 pgoyette-localcount-20170426:1.1.1.3 bouyer-socketcan-base1:1.1.1.3 pgoyette-localcount-20170320:1.1.1.3 netbsd-7-1:1.1.1.2.0.10 netbsd-7-1-RELEASE:1.1.1.2 netbsd-7-1-RC2:1.1.1.2 clang-294123:1.1.1.3 netbsd-7-nhusb-base-20170116:1.1.1.2 bouyer-socketcan:1.1.1.3.0.4 bouyer-socketcan-base:1.1.1.3 clang-291444:1.1.1.3 pgoyette-localcount-20170107:1.1.1.3 netbsd-7-1-RC1:1.1.1.2 pgoyette-localcount-20161104:1.1.1.3 netbsd-7-0-2-RELEASE:1.1.1.2 localcount-20160914:1.1.1.3 netbsd-7-nhusb:1.1.1.2.0.8 netbsd-7-nhusb-base:1.1.1.2 clang-280599:1.1.1.3 pgoyette-localcount-20160806:1.1.1.3 pgoyette-localcount-20160726:1.1.1.3 pgoyette-localcount:1.1.1.3.0.2 pgoyette-localcount-base:1.1.1.3 netbsd-7-0-1-RELEASE:1.1.1.2 clang-261930:1.1.1.3 netbsd-7-0:1.1.1.2.0.6 netbsd-7-0-RELEASE:1.1.1.2 netbsd-7-0-RC3:1.1.1.2 netbsd-7-0-RC2:1.1.1.2 netbsd-7-0-RC1:1.1.1.2 clang-237755:1.1.1.2 clang-232565:1.1.1.2 clang-227398:1.1.1.2 tls-maxphys-base:1.1.1.2 tls-maxphys:1.1.1.2.0.4 netbsd-7:1.1.1.2.0.2 netbsd-7-base:1.1.1.2 clang-215315:1.1.1.2 clang-209886:1.1.1.2 yamt-pagecache:1.1.1.1.0.4 yamt-pagecache-base9:1.1.1.1 tls-earlyentropy:1.1.1.1.0.2 tls-earlyentropy-base:1.1.1.2 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.1 riastradh-drm2-base3:1.1.1.1 clang-202566:1.1.1.1 clang-201163:1.1.1.1 clang-199312:1.1.1.1 clang-198450:1.1.1.1 clang-196603:1.1.1.1 clang-195771:1.1.1.1 LLVM:1.1.1; locks; strict; comment @// @; 1.1 date 2013.11.28.14.14.49; author joerg; state Exp; branches 1.1.1.1; next ; commitid ow8OybrawrB1f3fx; 1.1.1.1 date 2013.11.28.14.14.49; author joerg; state Exp; branches 1.1.1.1.2.1 1.1.1.1.4.1; next 1.1.1.2; commitid ow8OybrawrB1f3fx; 1.1.1.2 date 2014.05.30.18.14.39; author joerg; state Exp; branches 1.1.1.2.4.1; next 1.1.1.3; commitid 8q0kdlBlCn09GACx; 1.1.1.3 date 2016.02.27.22.11.52; author joerg; state Exp; branches 1.1.1.3.14.1 1.1.1.3.16.1; next 1.1.1.4; commitid tIimz3oDlh1NpBWy; 1.1.1.4 date 2018.07.17.18.31.26; author joerg; state Exp; branches; next 1.1.1.5; commitid wDzL46ALjrCZgwKA; 1.1.1.5 date 2019.11.13.22.19.19; author joerg; state dead; branches; next ; commitid QD8YATxuNG34YJKB; 1.1.1.1.2.1 date 2014.08.10.07.08.06; author tls; state Exp; branches; next ; commitid t01A1TLTYxkpGMLx; 1.1.1.1.4.1 date 2013.11.28.14.14.49; author yamt; state dead; branches; next 1.1.1.1.4.2; commitid WSrDtL5nYAUyiyBx; 1.1.1.1.4.2 date 2014.05.22.16.18.25; author yamt; state Exp; branches; next ; commitid WSrDtL5nYAUyiyBx; 1.1.1.2.4.1 date 2014.05.30.18.14.39; author tls; state dead; branches; next 1.1.1.2.4.2; commitid jTnpym9Qu0o4R1Nx; 1.1.1.2.4.2 date 2014.08.19.23.47.25; author tls; state Exp; branches; next ; commitid jTnpym9Qu0o4R1Nx; 1.1.1.3.14.1 date 2018.07.28.04.33.15; author pgoyette; state Exp; branches; next ; commitid 1UP1xAIUxv1ZgRLA; 1.1.1.3.16.1 date 2019.06.10.21.45.18; author christos; state Exp; branches; next 1.1.1.3.16.2; commitid jtc8rnCzWiEEHGqB; 1.1.1.3.16.2 date 2020.04.13.07.46.29; author martin; state dead; branches; next ; commitid X01YhRUPVUDaec4C; desc @@ 1.1 log @Initial revision @ text @//===--- TransEmptyStatements.cpp - Transformations to ARC mode -----------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // removeEmptyStatementsAndDealloc: // // Removes empty statements that are leftovers from previous transformations. // e.g for // // [x retain]; // // removeRetainReleaseDealloc will leave an empty ";" that removeEmptyStatements // will remove. // //===----------------------------------------------------------------------===// #include "Transforms.h" #include "Internals.h" #include "clang/AST/ASTContext.h" #include "clang/AST/StmtVisitor.h" #include "clang/Basic/SourceManager.h" using namespace clang; using namespace arcmt; using namespace trans; static bool isEmptyARCMTMacroStatement(NullStmt *S, std::vector &MacroLocs, ASTContext &Ctx) { if (!S->hasLeadingEmptyMacro()) return false; SourceLocation SemiLoc = S->getSemiLoc(); if (SemiLoc.isInvalid() || SemiLoc.isMacroID()) return false; if (MacroLocs.empty()) return false; SourceManager &SM = Ctx.getSourceManager(); std::vector::iterator I = std::upper_bound(MacroLocs.begin(), MacroLocs.end(), SemiLoc, BeforeThanCompare(SM)); --I; SourceLocation AfterMacroLoc = I->getLocWithOffset(getARCMTMacroName().size()); assert(AfterMacroLoc.isFileID()); if (AfterMacroLoc == SemiLoc) return true; int RelOffs = 0; if (!SM.isInSameSLocAddrSpace(AfterMacroLoc, SemiLoc, &RelOffs)) return false; if (RelOffs < 0) return false; // We make the reasonable assumption that a semicolon after 100 characters // means that it is not the next token after our macro. If this assumption // fails it is not critical, we will just fail to clear out, e.g., an empty // 'if'. if (RelOffs - getARCMTMacroName().size() > 100) return false; SourceLocation AfterMacroSemiLoc = findSemiAfterLocation(AfterMacroLoc, Ctx); return AfterMacroSemiLoc == SemiLoc; } namespace { /// \brief Returns true if the statement became empty due to previous /// transformations. class EmptyChecker : public StmtVisitor { ASTContext &Ctx; std::vector &MacroLocs; public: EmptyChecker(ASTContext &ctx, std::vector ¯oLocs) : Ctx(ctx), MacroLocs(macroLocs) { } bool VisitNullStmt(NullStmt *S) { return isEmptyARCMTMacroStatement(S, MacroLocs, Ctx); } bool VisitCompoundStmt(CompoundStmt *S) { if (S->body_empty()) return false; // was already empty, not because of transformations. for (CompoundStmt::body_iterator I = S->body_begin(), E = S->body_end(); I != E; ++I) if (!Visit(*I)) return false; return true; } bool VisitIfStmt(IfStmt *S) { if (S->getConditionVariable()) return false; Expr *condE = S->getCond(); if (!condE) return false; if (hasSideEffects(condE, Ctx)) return false; if (!S->getThen() || !Visit(S->getThen())) return false; if (S->getElse() && !Visit(S->getElse())) return false; return true; } bool VisitWhileStmt(WhileStmt *S) { if (S->getConditionVariable()) return false; Expr *condE = S->getCond(); if (!condE) return false; if (hasSideEffects(condE, Ctx)) return false; if (!S->getBody()) return false; return Visit(S->getBody()); } bool VisitDoStmt(DoStmt *S) { Expr *condE = S->getCond(); if (!condE) return false; if (hasSideEffects(condE, Ctx)) return false; if (!S->getBody()) return false; return Visit(S->getBody()); } bool VisitObjCForCollectionStmt(ObjCForCollectionStmt *S) { Expr *Exp = S->getCollection(); if (!Exp) return false; if (hasSideEffects(Exp, Ctx)) return false; if (!S->getBody()) return false; return Visit(S->getBody()); } bool VisitObjCAutoreleasePoolStmt(ObjCAutoreleasePoolStmt *S) { if (!S->getSubStmt()) return false; return Visit(S->getSubStmt()); } }; class EmptyStatementsRemover : public RecursiveASTVisitor { MigrationPass &Pass; public: EmptyStatementsRemover(MigrationPass &pass) : Pass(pass) { } bool TraverseStmtExpr(StmtExpr *E) { CompoundStmt *S = E->getSubStmt(); for (CompoundStmt::body_iterator I = S->body_begin(), E = S->body_end(); I != E; ++I) { if (I != E - 1) check(*I); TraverseStmt(*I); } return true; } bool VisitCompoundStmt(CompoundStmt *S) { for (CompoundStmt::body_iterator I = S->body_begin(), E = S->body_end(); I != E; ++I) check(*I); return true; } ASTContext &getContext() { return Pass.Ctx; } private: void check(Stmt *S) { if (!S) return; if (EmptyChecker(Pass.Ctx, Pass.ARCMTMacroLocs).Visit(S)) { Transaction Trans(Pass.TA); Pass.TA.removeStmt(S); } } }; } // anonymous namespace static bool isBodyEmpty(CompoundStmt *body, ASTContext &Ctx, std::vector &MacroLocs) { for (CompoundStmt::body_iterator I = body->body_begin(), E = body->body_end(); I != E; ++I) if (!EmptyChecker(Ctx, MacroLocs).Visit(*I)) return false; return true; } static void cleanupDeallocOrFinalize(MigrationPass &pass) { ASTContext &Ctx = pass.Ctx; TransformActions &TA = pass.TA; DeclContext *DC = Ctx.getTranslationUnitDecl(); Selector FinalizeSel = Ctx.Selectors.getNullarySelector(&pass.Ctx.Idents.get("finalize")); typedef DeclContext::specific_decl_iterator impl_iterator; for (impl_iterator I = impl_iterator(DC->decls_begin()), E = impl_iterator(DC->decls_end()); I != E; ++I) { ObjCMethodDecl *DeallocM = 0; ObjCMethodDecl *FinalizeM = 0; for (ObjCImplementationDecl::instmeth_iterator MI = I->instmeth_begin(), ME = I->instmeth_end(); MI != ME; ++MI) { ObjCMethodDecl *MD = *MI; if (!MD->hasBody()) continue; if (MD->getMethodFamily() == OMF_dealloc) { DeallocM = MD; } else if (MD->isInstanceMethod() && MD->getSelector() == FinalizeSel) { FinalizeM = MD; } } if (DeallocM) { if (isBodyEmpty(DeallocM->getCompoundBody(), Ctx, pass.ARCMTMacroLocs)) { Transaction Trans(TA); TA.remove(DeallocM->getSourceRange()); } if (FinalizeM) { Transaction Trans(TA); TA.remove(FinalizeM->getSourceRange()); } } else if (FinalizeM) { if (isBodyEmpty(FinalizeM->getCompoundBody(), Ctx, pass.ARCMTMacroLocs)) { Transaction Trans(TA); TA.remove(FinalizeM->getSourceRange()); } else { Transaction Trans(TA); TA.replaceText(FinalizeM->getSelectorStartLoc(), "finalize", "dealloc"); } } } } void trans::removeEmptyStatementsAndDeallocFinalize(MigrationPass &pass) { EmptyStatementsRemover(pass).TraverseDecl(pass.Ctx.getTranslationUnitDecl()); cleanupDeallocOrFinalize(pass); for (unsigned i = 0, e = pass.ARCMTMacroLocs.size(); i != e; ++i) { Transaction Trans(pass.TA); pass.TA.remove(pass.ARCMTMacroLocs[i]); } } @ 1.1.1.1 log @Import Clang 3.4rc1 r195771. @ text @@ 1.1.1.1.2.1 log @Rebase. @ text @d92 3 a94 2 for (auto *I : S->body()) if (!Visit(I)) d170 3 a172 2 for (auto *I : S->body()) check(I); d192 3 a194 2 for (auto *I : body->body()) if (!EmptyChecker(Ctx, MacroLocs).Visit(I)) d211 6 a216 3 ObjCMethodDecl *DeallocM = nullptr; ObjCMethodDecl *FinalizeM = nullptr; for (auto *MD : I->instance_methods()) { @ 1.1.1.2 log @Import Clang 3.5svn r209886. @ text @d92 3 a94 2 for (auto *I : S->body()) if (!Visit(I)) d170 3 a172 2 for (auto *I : S->body()) check(I); d192 3 a194 2 for (auto *I : body->body()) if (!EmptyChecker(Ctx, MacroLocs).Visit(I)) d211 6 a216 3 ObjCMethodDecl *DeallocM = nullptr; ObjCMethodDecl *FinalizeM = nullptr; for (auto *MD : I->instance_methods()) { @ 1.1.1.3 log @Import Clang 3.8.0rc3 r261930. @ text @d107 3 a109 1 return !S->getElse() || Visit(S->getElse()); @ 1.1.1.3.16.1 log @Sync with HEAD @ text @d76 1 a76 1 /// Returns true if the statement became empty due to previous @ 1.1.1.3.16.2 log @Mostly merge changes from HEAD upto 20200411 @ text @@ 1.1.1.3.14.1 log @Sync with HEAD @ text @d76 1 a76 1 /// Returns true if the statement became empty due to previous @ 1.1.1.4 log @Import clang r337282 from trunk @ text @d76 1 a76 1 /// Returns true if the statement became empty due to previous @ 1.1.1.5 log @Mark old LLVM instance as dead. @ text @@ 1.1.1.2.4.1 log @file TransEmptyStatementsAndDealloc.cpp was added on branch tls-maxphys on 2014-08-19 23:47:25 +0000 @ text @d1 253 @ 1.1.1.2.4.2 log @Rebase to HEAD as of a few days ago. @ text @a0 253 //===--- TransEmptyStatements.cpp - Transformations to ARC mode -----------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // removeEmptyStatementsAndDealloc: // // Removes empty statements that are leftovers from previous transformations. // e.g for // // [x retain]; // // removeRetainReleaseDealloc will leave an empty ";" that removeEmptyStatements // will remove. // //===----------------------------------------------------------------------===// #include "Transforms.h" #include "Internals.h" #include "clang/AST/ASTContext.h" #include "clang/AST/StmtVisitor.h" #include "clang/Basic/SourceManager.h" using namespace clang; using namespace arcmt; using namespace trans; static bool isEmptyARCMTMacroStatement(NullStmt *S, std::vector &MacroLocs, ASTContext &Ctx) { if (!S->hasLeadingEmptyMacro()) return false; SourceLocation SemiLoc = S->getSemiLoc(); if (SemiLoc.isInvalid() || SemiLoc.isMacroID()) return false; if (MacroLocs.empty()) return false; SourceManager &SM = Ctx.getSourceManager(); std::vector::iterator I = std::upper_bound(MacroLocs.begin(), MacroLocs.end(), SemiLoc, BeforeThanCompare(SM)); --I; SourceLocation AfterMacroLoc = I->getLocWithOffset(getARCMTMacroName().size()); assert(AfterMacroLoc.isFileID()); if (AfterMacroLoc == SemiLoc) return true; int RelOffs = 0; if (!SM.isInSameSLocAddrSpace(AfterMacroLoc, SemiLoc, &RelOffs)) return false; if (RelOffs < 0) return false; // We make the reasonable assumption that a semicolon after 100 characters // means that it is not the next token after our macro. If this assumption // fails it is not critical, we will just fail to clear out, e.g., an empty // 'if'. if (RelOffs - getARCMTMacroName().size() > 100) return false; SourceLocation AfterMacroSemiLoc = findSemiAfterLocation(AfterMacroLoc, Ctx); return AfterMacroSemiLoc == SemiLoc; } namespace { /// \brief Returns true if the statement became empty due to previous /// transformations. class EmptyChecker : public StmtVisitor { ASTContext &Ctx; std::vector &MacroLocs; public: EmptyChecker(ASTContext &ctx, std::vector ¯oLocs) : Ctx(ctx), MacroLocs(macroLocs) { } bool VisitNullStmt(NullStmt *S) { return isEmptyARCMTMacroStatement(S, MacroLocs, Ctx); } bool VisitCompoundStmt(CompoundStmt *S) { if (S->body_empty()) return false; // was already empty, not because of transformations. for (auto *I : S->body()) if (!Visit(I)) return false; return true; } bool VisitIfStmt(IfStmt *S) { if (S->getConditionVariable()) return false; Expr *condE = S->getCond(); if (!condE) return false; if (hasSideEffects(condE, Ctx)) return false; if (!S->getThen() || !Visit(S->getThen())) return false; if (S->getElse() && !Visit(S->getElse())) return false; return true; } bool VisitWhileStmt(WhileStmt *S) { if (S->getConditionVariable()) return false; Expr *condE = S->getCond(); if (!condE) return false; if (hasSideEffects(condE, Ctx)) return false; if (!S->getBody()) return false; return Visit(S->getBody()); } bool VisitDoStmt(DoStmt *S) { Expr *condE = S->getCond(); if (!condE) return false; if (hasSideEffects(condE, Ctx)) return false; if (!S->getBody()) return false; return Visit(S->getBody()); } bool VisitObjCForCollectionStmt(ObjCForCollectionStmt *S) { Expr *Exp = S->getCollection(); if (!Exp) return false; if (hasSideEffects(Exp, Ctx)) return false; if (!S->getBody()) return false; return Visit(S->getBody()); } bool VisitObjCAutoreleasePoolStmt(ObjCAutoreleasePoolStmt *S) { if (!S->getSubStmt()) return false; return Visit(S->getSubStmt()); } }; class EmptyStatementsRemover : public RecursiveASTVisitor { MigrationPass &Pass; public: EmptyStatementsRemover(MigrationPass &pass) : Pass(pass) { } bool TraverseStmtExpr(StmtExpr *E) { CompoundStmt *S = E->getSubStmt(); for (CompoundStmt::body_iterator I = S->body_begin(), E = S->body_end(); I != E; ++I) { if (I != E - 1) check(*I); TraverseStmt(*I); } return true; } bool VisitCompoundStmt(CompoundStmt *S) { for (auto *I : S->body()) check(I); return true; } ASTContext &getContext() { return Pass.Ctx; } private: void check(Stmt *S) { if (!S) return; if (EmptyChecker(Pass.Ctx, Pass.ARCMTMacroLocs).Visit(S)) { Transaction Trans(Pass.TA); Pass.TA.removeStmt(S); } } }; } // anonymous namespace static bool isBodyEmpty(CompoundStmt *body, ASTContext &Ctx, std::vector &MacroLocs) { for (auto *I : body->body()) if (!EmptyChecker(Ctx, MacroLocs).Visit(I)) return false; return true; } static void cleanupDeallocOrFinalize(MigrationPass &pass) { ASTContext &Ctx = pass.Ctx; TransformActions &TA = pass.TA; DeclContext *DC = Ctx.getTranslationUnitDecl(); Selector FinalizeSel = Ctx.Selectors.getNullarySelector(&pass.Ctx.Idents.get("finalize")); typedef DeclContext::specific_decl_iterator impl_iterator; for (impl_iterator I = impl_iterator(DC->decls_begin()), E = impl_iterator(DC->decls_end()); I != E; ++I) { ObjCMethodDecl *DeallocM = nullptr; ObjCMethodDecl *FinalizeM = nullptr; for (auto *MD : I->instance_methods()) { if (!MD->hasBody()) continue; if (MD->getMethodFamily() == OMF_dealloc) { DeallocM = MD; } else if (MD->isInstanceMethod() && MD->getSelector() == FinalizeSel) { FinalizeM = MD; } } if (DeallocM) { if (isBodyEmpty(DeallocM->getCompoundBody(), Ctx, pass.ARCMTMacroLocs)) { Transaction Trans(TA); TA.remove(DeallocM->getSourceRange()); } if (FinalizeM) { Transaction Trans(TA); TA.remove(FinalizeM->getSourceRange()); } } else if (FinalizeM) { if (isBodyEmpty(FinalizeM->getCompoundBody(), Ctx, pass.ARCMTMacroLocs)) { Transaction Trans(TA); TA.remove(FinalizeM->getSourceRange()); } else { Transaction Trans(TA); TA.replaceText(FinalizeM->getSelectorStartLoc(), "finalize", "dealloc"); } } } } void trans::removeEmptyStatementsAndDeallocFinalize(MigrationPass &pass) { EmptyStatementsRemover(pass).TraverseDecl(pass.Ctx.getTranslationUnitDecl()); cleanupDeallocOrFinalize(pass); for (unsigned i = 0, e = pass.ARCMTMacroLocs.size(); i != e; ++i) { Transaction Trans(pass.TA); pass.TA.remove(pass.ARCMTMacroLocs[i]); } } @ 1.1.1.1.4.1 log @file TransEmptyStatementsAndDealloc.cpp was added on branch yamt-pagecache on 2014-05-22 16:18:25 +0000 @ text @d1 259 @ 1.1.1.1.4.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 259 //===--- TransEmptyStatements.cpp - Transformations to ARC mode -----------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // removeEmptyStatementsAndDealloc: // // Removes empty statements that are leftovers from previous transformations. // e.g for // // [x retain]; // // removeRetainReleaseDealloc will leave an empty ";" that removeEmptyStatements // will remove. // //===----------------------------------------------------------------------===// #include "Transforms.h" #include "Internals.h" #include "clang/AST/ASTContext.h" #include "clang/AST/StmtVisitor.h" #include "clang/Basic/SourceManager.h" using namespace clang; using namespace arcmt; using namespace trans; static bool isEmptyARCMTMacroStatement(NullStmt *S, std::vector &MacroLocs, ASTContext &Ctx) { if (!S->hasLeadingEmptyMacro()) return false; SourceLocation SemiLoc = S->getSemiLoc(); if (SemiLoc.isInvalid() || SemiLoc.isMacroID()) return false; if (MacroLocs.empty()) return false; SourceManager &SM = Ctx.getSourceManager(); std::vector::iterator I = std::upper_bound(MacroLocs.begin(), MacroLocs.end(), SemiLoc, BeforeThanCompare(SM)); --I; SourceLocation AfterMacroLoc = I->getLocWithOffset(getARCMTMacroName().size()); assert(AfterMacroLoc.isFileID()); if (AfterMacroLoc == SemiLoc) return true; int RelOffs = 0; if (!SM.isInSameSLocAddrSpace(AfterMacroLoc, SemiLoc, &RelOffs)) return false; if (RelOffs < 0) return false; // We make the reasonable assumption that a semicolon after 100 characters // means that it is not the next token after our macro. If this assumption // fails it is not critical, we will just fail to clear out, e.g., an empty // 'if'. if (RelOffs - getARCMTMacroName().size() > 100) return false; SourceLocation AfterMacroSemiLoc = findSemiAfterLocation(AfterMacroLoc, Ctx); return AfterMacroSemiLoc == SemiLoc; } namespace { /// \brief Returns true if the statement became empty due to previous /// transformations. class EmptyChecker : public StmtVisitor { ASTContext &Ctx; std::vector &MacroLocs; public: EmptyChecker(ASTContext &ctx, std::vector ¯oLocs) : Ctx(ctx), MacroLocs(macroLocs) { } bool VisitNullStmt(NullStmt *S) { return isEmptyARCMTMacroStatement(S, MacroLocs, Ctx); } bool VisitCompoundStmt(CompoundStmt *S) { if (S->body_empty()) return false; // was already empty, not because of transformations. for (CompoundStmt::body_iterator I = S->body_begin(), E = S->body_end(); I != E; ++I) if (!Visit(*I)) return false; return true; } bool VisitIfStmt(IfStmt *S) { if (S->getConditionVariable()) return false; Expr *condE = S->getCond(); if (!condE) return false; if (hasSideEffects(condE, Ctx)) return false; if (!S->getThen() || !Visit(S->getThen())) return false; if (S->getElse() && !Visit(S->getElse())) return false; return true; } bool VisitWhileStmt(WhileStmt *S) { if (S->getConditionVariable()) return false; Expr *condE = S->getCond(); if (!condE) return false; if (hasSideEffects(condE, Ctx)) return false; if (!S->getBody()) return false; return Visit(S->getBody()); } bool VisitDoStmt(DoStmt *S) { Expr *condE = S->getCond(); if (!condE) return false; if (hasSideEffects(condE, Ctx)) return false; if (!S->getBody()) return false; return Visit(S->getBody()); } bool VisitObjCForCollectionStmt(ObjCForCollectionStmt *S) { Expr *Exp = S->getCollection(); if (!Exp) return false; if (hasSideEffects(Exp, Ctx)) return false; if (!S->getBody()) return false; return Visit(S->getBody()); } bool VisitObjCAutoreleasePoolStmt(ObjCAutoreleasePoolStmt *S) { if (!S->getSubStmt()) return false; return Visit(S->getSubStmt()); } }; class EmptyStatementsRemover : public RecursiveASTVisitor { MigrationPass &Pass; public: EmptyStatementsRemover(MigrationPass &pass) : Pass(pass) { } bool TraverseStmtExpr(StmtExpr *E) { CompoundStmt *S = E->getSubStmt(); for (CompoundStmt::body_iterator I = S->body_begin(), E = S->body_end(); I != E; ++I) { if (I != E - 1) check(*I); TraverseStmt(*I); } return true; } bool VisitCompoundStmt(CompoundStmt *S) { for (CompoundStmt::body_iterator I = S->body_begin(), E = S->body_end(); I != E; ++I) check(*I); return true; } ASTContext &getContext() { return Pass.Ctx; } private: void check(Stmt *S) { if (!S) return; if (EmptyChecker(Pass.Ctx, Pass.ARCMTMacroLocs).Visit(S)) { Transaction Trans(Pass.TA); Pass.TA.removeStmt(S); } } }; } // anonymous namespace static bool isBodyEmpty(CompoundStmt *body, ASTContext &Ctx, std::vector &MacroLocs) { for (CompoundStmt::body_iterator I = body->body_begin(), E = body->body_end(); I != E; ++I) if (!EmptyChecker(Ctx, MacroLocs).Visit(*I)) return false; return true; } static void cleanupDeallocOrFinalize(MigrationPass &pass) { ASTContext &Ctx = pass.Ctx; TransformActions &TA = pass.TA; DeclContext *DC = Ctx.getTranslationUnitDecl(); Selector FinalizeSel = Ctx.Selectors.getNullarySelector(&pass.Ctx.Idents.get("finalize")); typedef DeclContext::specific_decl_iterator impl_iterator; for (impl_iterator I = impl_iterator(DC->decls_begin()), E = impl_iterator(DC->decls_end()); I != E; ++I) { ObjCMethodDecl *DeallocM = 0; ObjCMethodDecl *FinalizeM = 0; for (ObjCImplementationDecl::instmeth_iterator MI = I->instmeth_begin(), ME = I->instmeth_end(); MI != ME; ++MI) { ObjCMethodDecl *MD = *MI; if (!MD->hasBody()) continue; if (MD->getMethodFamily() == OMF_dealloc) { DeallocM = MD; } else if (MD->isInstanceMethod() && MD->getSelector() == FinalizeSel) { FinalizeM = MD; } } if (DeallocM) { if (isBodyEmpty(DeallocM->getCompoundBody(), Ctx, pass.ARCMTMacroLocs)) { Transaction Trans(TA); TA.remove(DeallocM->getSourceRange()); } if (FinalizeM) { Transaction Trans(TA); TA.remove(FinalizeM->getSourceRange()); } } else if (FinalizeM) { if (isBodyEmpty(FinalizeM->getCompoundBody(), Ctx, pass.ARCMTMacroLocs)) { Transaction Trans(TA); TA.remove(FinalizeM->getSourceRange()); } else { Transaction Trans(TA); TA.replaceText(FinalizeM->getSelectorStartLoc(), "finalize", "dealloc"); } } } } void trans::removeEmptyStatementsAndDeallocFinalize(MigrationPass &pass) { EmptyStatementsRemover(pass).TraverseDecl(pass.Ctx.getTranslationUnitDecl()); cleanupDeallocOrFinalize(pass); for (unsigned i = 0, e = pass.ARCMTMacroLocs.size(); i != e; ++i) { Transaction Trans(pass.TA); pass.TA.remove(pass.ARCMTMacroLocs[i]); } } @