)]}' { "log": [ { "commit": "430c4f561ec41a59813a17f7e3b4da10996a4774", "tree": "978b9a6bc7c3ce8028347fabe478df6bd98d183f", "parents": [ "ec7e44f7afe0ff48d4d1ae54a12d375e0392d24c" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Sep 25 17:10:15 2015 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Sep 25 17:13:13 2015 +0100" }, "message": "Optimizing: Add comment on DCE\u0027s packed-switch value check.\n\nChange-Id: I0c264d00b889917f88347c16c53e7647d0d8fd0f\n" }, { "commit": "211c2119dc8932bdb264fae858adba6c0541ce3c", "tree": "95dd0a75f9bd6745cf7bee4686dd612e353b5301", "parents": [ "0aeb7599bcd7073a5c849f413fb7a9611f5944eb" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Sep 24 16:52:33 2015 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Sep 25 12:28:37 2015 +0100" }, "message": "Optimizing: Rewrite DCE\u0027s MarkReachableBlocks().\n\nReplace a recursive implementation with a loop using a work\nlist to avoid stack overflow that we would presumably hit\nfor 702-LargeBranchOffset in host debug build with -O0, once\nthe DCE block elimination is enabled for methods containing\ntry-catch.\n\nBug: 24133462\nChange-Id: I41288ba368722bcb5d68259c7c147552c8928099\n" }, { "commit": "fe57faa2e0349418dda38e77ef1c0ac29db75f4d", "tree": "38ba7a406f8a86a1152bd6c9f2d0a6c677423211", "parents": [ "9e30c0e177adabaaf94a66c91130a19a7632fc7c" ], "author": { "name": "Mark Mendell", "email": "mark.p.mendell@intel.com", "time": "Fri Sep 18 09:26:15 2015 -0400" }, "committer": { "name": "Mark Mendell", "email": "mark.p.mendell@intel.com", "time": "Mon Sep 21 07:23:45 2015 -0400" }, "message": "[optimizing] Add basic PackedSwitch support\n\nAdd HPackedSwitch, and generate it from the builder. Code generators\nconvert this to a series of compare/branch tests. Better implementation\nin the code generators as a real jump table will follow as separate CLs.\n\nChange-Id: If14736fa4d62809b6ae95280148c55682e856911\nSigned-off-by: Mark Mendell \u003cmark.p.mendell@intel.com\u003e\n" }, { "commit": "fa6b93c4b69e6d7ddfa2a4ed0aff01b0608c5a3a", "tree": "3528c88e104dac8e58ae5370ab066b8b1dd0218f", "parents": [ "e295be4a95d7861f6ec179edf6565f58cad747cc" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Sep 15 10:15:55 2015 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Wed Sep 16 13:21:33 2015 +0100" }, "message": "Optimizing: Tag arena allocations in HGraph.\n\nReplace GrowableArray with ArenaVector in HGraph and related\nclasses HEnvironment, HLoopInformation, HInvoke and HPhi,\nand tag allocations with new arena allocation types.\n\nChange-Id: I3d79897af405b9a1a5b98bfc372e70fe0b3bc40d\n" }, { "commit": "6058455d486219994921b63a2d774dc9908415a2", "tree": "3d205227f3ff54cd3a50bc5c0e7cb3ad6c175b86", "parents": [ "637ee0b9c10ab7732a7ee7b8335f3fff4ac1549c" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Sep 03 13:35:12 2015 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Sep 08 18:09:49 2015 +0100" }, "message": "Optimizing: Tag basic block allocations with their source.\n\nReplace GrowableArray with ArenaVector in HBasicBlock and,\nto track the source of allocations, assign one new and two\nQuick\u0027s arena allocation types to these vectors. Rename\nkArenaAllocSuccessor to kArenaAllocSuccessors.\n\nBug: 23736311\nChange-Id: Ib52e51698890675bde61f007fe6039338cf1a025\n" }, { "commit": "145acc5361deb769eed998f057bc23abaef6e116", "tree": "3d66a0b44e1ac927156eec6e6488de5fd52b982b", "parents": [ "91e11c0c840193c6822e66846020b6647de243d5" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Sep 03 13:33:25 2015 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Sep 03 13:33:25 2015 +0000" }, "message": "Revert \"Optimizing: Tag basic block allocations with their source.\"\n\nReverting so that we can have more discussion about the STL API.\n\nThis reverts commit 91e11c0c840193c6822e66846020b6647de243d5.\n\nChange-Id: I187fe52f2c16b6e7c5c9d49c42921eb6c7063dba\n" }, { "commit": "91e11c0c840193c6822e66846020b6647de243d5", "tree": "0c5398ef59c464c1848afd0113c74b6aeb75cf42", "parents": [ "f9f6441c665b5ff9004d3ed55014f46d416fb1bb" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Wed Sep 02 17:03:22 2015 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Sep 03 13:09:37 2015 +0100" }, "message": "Optimizing: Tag basic block allocations with their source.\n\nReplace GrowableArray with ArenaVector in HBasicBlock and,\nto track the source of allocations, assign one new and two\nQuick\u0027s arena allocation types to these vectors. Rename\nkArenaAllocSuccessor to kArenaAllocSuccessors.\n\nBug: 23736311\nChange-Id: I984aef6e615ae2380a532f5c6726af21015f43f5\n" }, { "commit": "e418dda75998e0186f7580c2c54705767c3c8f1f", "tree": "49b3183cd1d25b6a5cfb31e0d16678deb023c1e8", "parents": [ "4d786026efaac41acf8278d1c87d842f7ce06fde" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Aug 11 20:03:09 2015 -0700" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Thu Aug 20 11:00:12 2015 +0100" }, "message": "Be more flexible on the code unit size when inlining.\n\nThis change increases the maximum code unit size, and fold\nparameters in the inlinee in the hope to reduce the overall\nsize of the graph. We then make sure we don\u0027t inline methods\nthat have more than N HInstructions.\n\nAlso, remove the kAccDontInline flag on ArtMethod. The compiler\ndoes not need it anymore.\n\nChange-Id: I4cd3da40e551f30ba83b8b274728b87e67f6812e\n" }, { "commit": "bbd733e4ef277eff19bf9a6601032da081e9b68f", "tree": "47c5e9624378d8705e8e448ed951617f680d021f", "parents": [ "a35d4c9d66b372e7ae1014357c48ddfa6104085b" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Tue Aug 18 17:48:17 2015 +0100" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Wed Aug 19 19:55:43 2015 +0100" }, "message": "ART: Enable basic optimizations for try/catch\n\nGenerating code for try/catch methods requires having run at least the\ninstruction simplifier to remove redundant suspend checks. This patch\nenables the first group of optimizations when try/catch is present.\n\nEnabled optimizations:\n1) IntrinsicsRecognizer\nDoes not modify the graph, only sets HInvoke::intrinsic_.\n\n2) ConstantFolding\nDoes not deal with throwing instructions.\n\n3) InstructionSimplifier\nMay remove a throwing instruction (e.g. LoadClass in VisitCheckCast),\nor may turn a throwing instruction into a non-throwing one (ArraySet).\nTheir corresponding catch phi inputs are not removed but correctness\nis preserved.\n\n4) ReferenceTypePropagation\nDoes not modify the graph, only sets type properties. Typing of\nLoadException from catch handler information was added.\n\n5) DeadCodeElimination\nRemoving individual instructions is fine (same as 3). Removal of dead\nblocks was disabled for try/catch.\n\nChange-Id: I2722c3229eb8aaf326391e07f522dbf5186774b8\n" }, { "commit": "78e3ef6bc5f8aa149f2f8bf0c78ce854c2f910fa", "tree": "b8aa83bef462e20e2e7e09650e6c15d3a8d97fa6", "parents": [ "6a5037eb3340e4c981fd7de3ff45167ee5b7fc82" ], "author": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Wed Aug 12 13:43:29 2015 +0100" }, "committer": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Wed Aug 12 13:43:29 2015 +0100" }, "message": "Add a GVN dependency \u0027GC\u0027 for garbage collection.\n\nThis will be used by incoming architecture specific optimizations. The\ndependencies must be conservative. When an HInstruction is created we\nmay not be sure whether it can trigger GC. In that case the\n\u0027ChangesGC\u0027 dependency must be set. We control at code-generation time\nthat HInstructions that can call have the \u0027ChangesGC\u0027 dependency\nset.\n\nChange-Id: Iea6a7f430009f37a9599b0a0039207049906e45d\n" }, { "commit": "854a02b1b488327f80c544ca1119b386b8715c26", "tree": "7f48f01a7624d07b0c24bf589308673dcb05683c", "parents": [ "8ae3588989ea99d8c60f885e3d830e6e0c87ff5f" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Tue Jul 14 16:07:00 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Jul 20 10:25:26 2015 -0700" }, "message": "Improved side effect analysis (field/array write/read).\n\nRationale:\nTypes (int, float etc.) and access type (field vs. array)\ncan be used to disambiguate write/read side-effects analysis.\nThis directly improves e.g. dead code elimination and licm.\n\nChange-Id: I371f6909a3f42bda13190a03f04c4a867bde1d06\n" }, { "commit": "1f82ecc6a0c9f88d03d6d1a6d95eeb8707bd06c1", "tree": "50d71ef83f27827f0acfe6708acdb46e159f7506", "parents": [ "a12f729e7165780e73857e6248af0df00ad6ce2b" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Jun 24 12:20:24 2015 +0100" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Jun 24 12:37:52 2015 +0100" }, "message": "Recompute dominator tree after DCE.\n\nbug:22031382\nChange-Id: Ifebe169897b76872015e3ce0ed7d0a9662f80cef\n" }, { "commit": "f78848f2ced8466b5fb2d7148d608288ee88757b", "tree": "72bfc782c51995b8c9d8ec41fafdae32f5341090", "parents": [ "edb83c606e034d76bed1331f34cdc435df47bb95" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Jun 17 11:57:56 2015 +0100" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Jun 17 22:15:01 2015 +0100" }, "message": "Don\u0027t special case HCurrentMethod in DCE.\n\nInstead, re-create the HCurrentMethod if it is needed\nafter it has been removed.\n\nChange-Id: Id3bf15ae87b00a1d7eb35bf36d58fe96f788fba4\n" }, { "commit": "839188b561d7066f88acfac0a8f5d4b08ae73c45", "tree": "c156e99e3df6bc818cb942554b1778b02ba38df0", "parents": [ "f86808b55b550962c627b50511b98f4de8cd0e60" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Jun 02 10:38:12 2015 +0100" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Jun 02 10:39:49 2015 +0100" }, "message": "Fix a crash due to a combination of dce/inlining.\n\nDead code elimiation was removing HCurrentMethod if\nit ended up not being used, but inlining requires access\nto it. Therefore we should keep the node in the graph.\n\nChange-Id: I2f44f71b4ff3f2c3f9569d8420c1b37f00e694d2\n" }, { "commit": "84daae5ce19038156c0fa0cdbc33d47efdb7e66b", "tree": "5f507470744edd6b1a436c9e4514f0d464ca38eb", "parents": [ "c88b09fc1d67413e814a10d20752e46aa28bc0e4" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Mon May 18 12:06:52 2015 +0100" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Mon May 18 12:06:52 2015 +0100" }, "message": "ART: Removed redundant Phis as part of DCE\n\nRemoving dead blocks can render some phis redundant but they do not\nget removed. This patch adds running SsaRedundantPhiElimination to\nadress that.\n\nChange-Id: Iec9a16f3c20b2d5b5607cd5aaf802917c155a0f1\n" }, { "commit": "a4b8c21dae70ae34aee13628632c39a675c06022", "tree": "3a72a4fcb64d61b7913f6ee3599a46b3248437b6", "parents": [ "faf935eb3a8565de98d9ec1f79c8c43c5c6eb2a7" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Thu May 07 09:59:30 2015 +0100" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Tue May 12 11:37:53 2015 +0100" }, "message": "ART: Rediscover loops after deleting blocks in DCE\n\nThe way DCE currently updates loop information does not cover all\ncases. This patch removes the logic, resets loop information of live\nblocks to pre-SSA state and reanalyzes the affected loops.\n\nChange-Id: I0b996a70235b95a8db0de9a23a03f71db57a21b8\n" }, { "commit": "69a2804c3bb48cf4fd00a66080f613a4fd96c422", "tree": "aab3f079d972bae71bbfa27fdca139738f41dbf0", "parents": [ "f073a36d1ed866e786f7d7784c709c86b00bc58e" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Wed Apr 29 17:16:07 2015 +0100" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Wed Apr 29 17:36:52 2015 +0100" }, "message": "ART: Fix loop information after dead code elimination\n\nCompilation failed when only some blocks of a loop were removed during\ndead code elimination.\n\nBug: 20680703\nChange-Id: If31025169ca493f0d7f7f2788576e98d05f03394\n" }, { "commit": "2d7352ba5311b8f57427b91b7a891e61497373c1", "tree": "3f3426f4f30663ee252ebc1f02ecd0eb114bad85", "parents": [ "c5cb691ca6a746a193bfbe3525aafa7cbb281d40" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Mon Apr 20 14:52:42 2015 +0100" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Fri Apr 24 16:19:31 2015 +0100" }, "message": "ART: Dead block removal\n\nAdds a new pass which finds all unreachable blocks, typically due to\nsimplifying an if-condition to a constant, and removes them from the\ngraph. The patch also slightly generalizes the graph-transforming\noperations.\n\nChange-Id: Iff7c97f1d10b52886f3cd7401689ebe1bfdbf456\n" }, { "commit": "8f20bdb9d3b7516e75a7845e610105d87ce25ae6", "tree": "b55e5b7695e482dc66dda6a0175bb56251294baf", "parents": [ "641547a5f18ca2ea54469cceadcfef64f132e5e0" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Tue Apr 21 14:07:50 2015 +0100" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Wed Apr 22 12:13:44 2015 +0100" }, "message": "Run DCE again after all the other optimizations have run.\n\nOn docs this doubles the amount of instructions removed.\n" }, { "commit": "0cdf6d31b6e8b39b56deba92336383f43fba9c0f", "tree": "21bea01160e2470609405a72e8df8b186456a13d", "parents": [ "7a9c885684c965fe84f91d8ad74f54f869e2a448" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Apr 21 16:04:32 2015 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Apr 21 16:04:32 2015 +0000" }, "message": "Revert \"Run DCE again after all the other optimizations have run.\"\n\nReverting because of libcore failures.\n\nThis reverts commit 7a9c885684c965fe84f91d8ad74f54f869e2a448.\n\nChange-Id: Iafe59b02fe7617243d81533d66e609a3528e7a58\n" }, { "commit": "7a9c885684c965fe84f91d8ad74f54f869e2a448", "tree": "9323e6b4c6a3391f279d1b4837647fcaedc3218f", "parents": [ "2be39e05ea8c4475278fe6a6573c3c8f04e075d4" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Tue Apr 21 14:07:50 2015 +0100" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Tue Apr 21 15:44:29 2015 +0100" }, "message": "Run DCE again after all the other optimizations have run.\n\nOn docs this doubles the amount of instructions removed.\n\nChange-Id: I1712a92c0c0b3b32b111d194b64d8ea81d652822\n" }, { "commit": "27df758e2e7baebb6e3f393f9732fd0d064420c8", "tree": "261207281fd574deffb4dc1c1bc6bea8f150993e", "parents": [ "f8bdd9f3a002970e4b8fdcf6fe6730116f1626c3" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Fri Apr 17 19:12:31 2015 +0100" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Mon Apr 20 14:02:51 2015 +0100" }, "message": "[optimizing] Add memory barriers in constructors when needed\n\nIf a class has final fields we must add a memory barrier before\nreturning from constructor. This makes sure the fields are visible to\nother threads.\n\nBug: 19851497\nChange-Id: If8c485092fc512efb9636cd568cb0543fb27688e\n" }, { "commit": "75be28332b278cff9039b54bfb228ac72f539ccc", "tree": "a01829ba0412d0f6637a833b41694f0d757d8f43", "parents": [ "ffb078ee815a38123581e706099a3bed65a6cb24" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Fri Oct 17 17:02:00 2014 +0100" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Fri Oct 17 17:11:43 2014 +0100" }, "message": "Revert \"Revert \"Introduce a class to implement optimization passes.\"\"\n\nThis reverts commit 1ddbf6d4b37979a9f11a203c12befd5ae8b65df4.\n\nChange-Id: I110a14668d1564ee0604dc958b91394b40da89fc\n" }, { "commit": "e161a2a60c0325793f04be42a0f05228955ecfdd", "tree": "426167496f383ec4343902f01ce0745d4dd1874d", "parents": [ "3a3fd0f8d3981691aa2331077a8fae5feee08dd1" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Fri Oct 03 12:45:18 2014 +0100" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Tue Oct 14 14:44:16 2014 +0100" }, "message": "Do not remove NullChecks \u0026 BoundsChecks in HDeadCodeElimination.\n\nRemoving a NullCheck or a BoundsCheck instruction may change\nthe behavior of a program.\n\nChange-Id: Ib2c9beff0cc98c382210e7cc88b1fa9af3c61887\n" }, { "commit": "1ddbf6d4b37979a9f11a203c12befd5ae8b65df4", "tree": "2bc48925657e791441aa947d4d629994a0696e78", "parents": [ "bf9cd7ba2118a75f5aa9b56241c4d5fa00dedeb8" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Oct 01 14:59:23 2014 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Oct 01 14:59:23 2014 +0000" }, "message": "Revert \"Introduce a class to implement optimization passes.\"\n\nThis reverts commit bf9cd7ba2118a75f5aa9b56241c4d5fa00dedeb8.\n\nChange-Id: I0a483446666c9c24c45925a5fc199debdefd8b3e\n" }, { "commit": "bf9cd7ba2118a75f5aa9b56241c4d5fa00dedeb8", "tree": "0bd049b173d23fcaed5c1b5cb4299e8faef840da", "parents": [ "34bb808affbed7a1db177b9ef4ab5461c2b2106b" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Tue Sep 30 16:15:14 2014 +0100" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Wed Oct 01 11:52:58 2014 +0100" }, "message": "Introduce a class to implement optimization passes.\n\n- Add art::HOptimization.\n- Rename art::ConstantPropagation to art::HConstantFolding in\n compiler/optimizing/constant_folding.h to avoid name\n clashes with a class of the same name in\n compiler/dex/post_opt_passes.h.\n- Rename art::DeadCodeElimination to\n art::HDeadCodeElimination for consistency reasons.\n- Have art::HDeadCodeElimination and art::HConstantFolding\n derive from art::HOptimization.\n- Start to use these optimizations in\n art:OptimizingCompiler::TryCompile.\n\nChange-Id: Iaab350c122d87b2333b3760312b15c0592d7e010\n" }, { "commit": "9ebc72c99e6b703bda611d7c918c9cf3dfb43e55", "tree": "6696e6e51dbe2606d2b2e0c0c60dfec06af97e60", "parents": [ "a72cb229d555a8ca86dca748733ea3791eaeec14" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Thu Sep 25 16:33:42 2014 +0100" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Thu Sep 25 16:33:42 2014 +0100" }, "message": "Make suspend checks note have side effects.\n\nAlso adjust gtests.\n\nChange-Id: I5e1a3e53115812b45ec7f4b6f50ba468fa7ac6b1\n" }, { "commit": "72bceff11a98cc1ecdb64a6fae16c521f99ec6a7", "tree": "d326cc4fd32315735466efbb17ea22adf121395c", "parents": [ "ccc07a9579c554443cd03a306ca9b4f943fd2a93" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Mon Sep 15 18:29:00 2014 +0100" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Wed Sep 17 18:23:21 2014 +0100" }, "message": "Initiate a dead code elimination pass in the optimizing compiler.\n\nChange-Id: Ie9db5d8e2c2c30e34145a0f7d2386b8ec58cfc4e\n" } ] }