)]}' { "log": [ { "commit": "bbc6e7edb5fca4a61ac53dd9bce79cb4f0bb3403", "tree": "0fbce767bc383358cf4cd65aafc74140e1850982", "parents": [ "19379b58bd433da91230e4fe6cd96e7416d16adc" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Fri Aug 24 16:58:47 2018 +0100" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Tue Aug 28 11:06:07 2018 +0100" }, "message": "Use \u0027final\u0027 and \u0027override\u0027 specifiers directly in ART.\n\nRemove all uses of macros \u0027FINAL\u0027 and \u0027OVERRIDE\u0027 and replace them with\n\u0027final\u0027 and \u0027override\u0027 specifiers. Remove all definitions of these\nmacros as well, which were located in these files:\n- libartbase/base/macros.h\n- test/913-heaps/heaps.cc\n- test/ti-agent/ti_macros.h\n\nART is now using C++14; the \u0027final\u0027 and \u0027override\u0027 specifiers have\nbeen introduced in C++11.\n\nTest: mmma art\nChange-Id: I256c7758155a71a2940ef2574925a44076feeebf\n" }, { "commit": "2477320a8d9de58ede68e2645ea53c10f71dcd57", "tree": "f428a6856e10d8ebaff0bb2da544a8d41c35ab77", "parents": [ "5a87e19e4bf1b6719c2aad3effde1b38d2c3085c" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Apr 26 10:28:51 2018 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Apr 26 10:28:51 2018 -0700" }, "message": "Step 1 of 2: conditional passes.\n\nRationale:\nThe change adds a return value to Run() in preparation of\nconditional pass execution. The value returned by Run() is\nbest effort, returning false means no optimizations were\napplied or no useful information was obtained. I filled\nin a few cases with more exact information, others\nstill just return true. In addition, it integrates inlining\nas a regular pass, avoiding the ugly \"break\" into\noptimizations1 and optimziations2.\n\nBug: b/78171933, b/74026074\n\nTest: test-art-host,target\nChange-Id: Ia39c5c83c01dcd79841e4b623917d61c754cf075\n" }, { "commit": "75bb2f3c85330b2aeba9e0a4a25f7eb059bcd754", "tree": "2e9c2884dc546540c66b057374822a45f7d9a414", "parents": [ "1f541bf57dfdfe4faf169b811aadb91298a886ca" ], "author": { "name": "Mingyao Yang", "email": "mingyao@google.com", "time": "Thu Nov 30 14:45:44 2017 -0800" }, "committer": { "name": "Mingyao Yang", "email": "mingyao@google.com", "time": "Thu Nov 30 14:45:44 2017 -0800" }, "message": "Type conversion elimination of constants\n\nA better way of eliminating type conversion for constants.\n\nTest: run-test on host. 711-checker-type-conversion.\nChange-Id: I457bc091542a5ac4cc4e77cadb012ee7cb040ce8\n" }, { "commit": "0ebe0d83138bba1996e9c8007969b5381d972b32", "tree": "a5ee66ebc5b587ade97e56ac8fc7d832fbbed4af", "parents": [ "e1e347dace0ded83774999bb26c37527dcdb1d5a" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Sep 21 22:50:39 2017 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon Sep 25 15:45:01 2017 +0100" }, "message": "ART: Introduce compiler data type.\n\nReplace most uses of the runtime\u0027s Primitive in compiler\nwith a new class DataType. This prepares for introducing\nnew types, such as Uint8, that the runtime does not need\nto know about.\n\nTest: m test-art-host-gtest\nTest: testrunner.py --host\nBug: 23964345\nChange-Id: Iec2ad82454eec678fffcd8279a9746b90feb9b0c\n" }, { "commit": "a341f352ca944d848ebf39b54d0ad353ff9ebaff", "tree": "420808c337e434e9af678942cb29c60ecf7b0dcc", "parents": [ "081e7a16c4fcbdb014441a236e12f58eb89ff99a" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Wed Aug 31 12:18:20 2016 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Wed Aug 31 16:47:12 2016 +0100" }, "message": "Constant fold Equal/NotEqual between null and non-null.\n\nTest: Add new test cases to 442-checker-constant-folding.\nTest: m test-art-host\nChange-Id: I14509d5e13d30a66b3c2ac3d76d514f58501c9ab\n" }, { "commit": "1a65388f1d86bb232c2e44fecb44cebe13105d2e", "tree": "515e3000b3ad6d195101f20f33f3c9498e536593", "parents": [ "f808e8a0cc218c2b98023ef0e91f3c5b74ad2962" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Fri Mar 18 18:05:57 2016 +0000" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Fri Mar 18 18:05:57 2016 +0000" }, "message": "Clean up art::HConstant predicates.\n\n- Make the difference between arithmetic zero and zero-bit\n pattern non ambiguous.\n- Introduce Boolean predicates in art::HIntConstant for when\n they are used as Booleans.\n- Introduce aritmetic positive and negative zero predicates\n for floating-point constants.\n\nBug: 27639313\nChange-Id: Ia04ecc6f6aa7450136028c5362ed429760c883bd\n" }, { "commit": "1252e976b972231a84b36e4bb73cf513bb7799d1", "tree": "ec1e75f145fd1ebe50f1c411f9338443e65ea715", "parents": [ "f0b04803ec4cdd8d76aadb6f02ae2511c46b20b5" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Thu Aug 06 15:46:02 2015 +0100" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Wed Feb 17 18:05:40 2016 +0000" }, "message": "Implement Optimizing\u0027s constant folding as a visitor.\n\nRefactor the logic of art::HConstantFolding::Run into a new\nvisitor, art::HConstantFoldingVisitor.\n\nChange-Id: Id8d3c3826f6dff6cc2d18a01f6c48d79bde483b3\n" }, { "commit": "31dd3d60491148d345c1edae1ccd090a1b67dd2b", "tree": "57e6fc0663a39dd5abd6284adc822e8782c4bdf0", "parents": [ "88f38e9b4e9ba0aca3d6fd4823be3a7226c87f33" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Tue Feb 16 12:21:02 2016 +0000" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Wed Feb 17 13:52:33 2016 +0000" }, "message": "Extend constant folding to float and double operations.\n\nChange-Id: I2837064b2ceea587bc171fc520507f13355292c6\n" }, { "commit": "e34648dec914453f7e8b6c517dd272823319cd6d", "tree": "b192c4698c4889ae90db6abe2652199802213fe6", "parents": [ "06241b1b07fb031b7d2cf55f4b78d3444d07cc2d" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Nov 23 08:59:07 2015 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Nov 23 08:59:07 2015 +0000" }, "message": "Revert \"Add stats support for existing optimizations\"\n\nBreaks the build. Please ensure your changes build.\n\nThis reverts commit 06241b1b07fb031b7d2cf55f4b78d3444d07cc2d.\n\nChange-Id: I68b18f99a9882719bf6654d3313531a7965b8483\n" }, { "commit": "06241b1b07fb031b7d2cf55f4b78d3444d07cc2d", "tree": "6ea5ce36c3b1ff575f1f1c380b9cd2c5c73c2e21", "parents": [ "d83b9042d67f2a7d5ca5a1f63819c97940033336" ], "author": { "name": "Jean-Philippe Halimi", "email": "jean-philippe.halimi@intel.com", "time": "Thu Sep 03 17:28:38 2015 +0200" }, "committer": { "name": "Jean-Philippe Halimi", "email": "jean-philippe.halimi@intel.com", "time": "Sun Nov 22 16:33:40 2015 +0100" }, "message": "Add stats support for existing optimizations\n\nThis patch adds support for the --dump-stats facility with existing\noptimizations.\n\nChange-Id: I68751b119a030952a11057cb651a3c63e87e73ea\nSigned-off-by: Jean-Philippe Halimi \u003cjean-philippe.halimi@intel.com\u003e\n" }, { "commit": "96709f17347cb7a6aae15816244d2200ca95a649", "tree": "c193a1378acb0968318a47ade5eb63121e6c9b3d", "parents": [ "f7b7f9984da66149e5fe05713845961d7b069a23" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Oct 28 17:49:07 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Oct 29 11:04:13 2015 -0700" }, "message": "Simplify unsigned comparisons against zero (with unit tests).\n\nRationale: Such cases occurs a lot after dynamic\n bound check optimization (where the lower bound\n is test against upper bound). Removing this\n unnecessary test improves quality of code.\n\nChange-Id: I3e4dc9f9d799aad342e1c344013ac60fcc3073ac\n" }, { "commit": "00d597a7e192b5d9ccf5a4bcb3783e688af7301f", "tree": "5acf2ed1968599aaf2e638fa68e24d225b014528", "parents": [ "ac87001cbbd44b436cc7866f7a41037ca83b17f1" ], "author": { "name": "Kenny Root", "email": "kroot@google.com", "time": "Wed Sep 30 13:09:51 2015 -0700" }, "committer": { "name": "Kenny Root", "email": "kroot@google.com", "time": "Wed Sep 30 13:09:53 2015 -0700" }, "message": "Tidy up spelling\n\nTo match the directory \"compiler/optimizing\" change the spelling of\ncomments.\n\nChange-Id: I816da4836ce86f4a44ddd2754d8e788d77a27de3\n" }, { "commit": "e82549b14c7def0a45461183964f7e6a34cbb70c", "tree": "9293e5bf58657883923fe08ff1964e92e81e8851", "parents": [ "c3912c8a2db109a15603554fd456f56cd0a69ad0" ], "author": { "name": "Mark Mendell", "email": "mark.p.mendell@intel.com", "time": "Wed May 06 10:55:34 2015 -0400" }, "committer": { "name": "Mark Mendell", "email": "mark.p.mendell@intel.com", "time": "Wed May 13 16:20:48 2015 -0400" }, "message": "[optimizing] Fold HTypeConversion of constants\n\nWhile looking into optimizing long shifts on x86, I found that the\ncompiler wasn\u0027t folding HTypeConversion of constants. Add simple\nconversions of constants, taking care of float/double values\nwith NaNs and small/large values, ensuring Java conversion semantics.\n\nAdd checker cases to see that constant folding of HTypeConversion is\ndone.\n\nEnsure 422-type-conversion type conversion routiness don\u0027t get\ninlined to avoid compile time folding.\n\nChange-Id: I5a4eb376b64bc4e41bf908af5875bed312efb228\nSigned-off-by: Mark Mendell \u003cmark.p.mendell@intel.com\u003e\n" }, { "commit": "3b55ebb22156e1f3496cd1ee4a05e03b4780e579", "tree": "a358c1f6338828068bdd6df0eab3aba71eb2d7ab", "parents": [ "2e8da8ecb94134081c3ea18a217294db367888a3" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Fri May 08 13:13:19 2015 +0100" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Fri May 08 13:13:19 2015 +0100" }, "message": "Simplify floating-point comparisons with NaN in Optimizing.\n\nThis change was suggested by Ian.\n\nAlso, simplify some art::HFloatConstant and\nart::HDoubleConstant methods.\n\nChange-Id: I7908df23581a7f61c8ec79c290fe5f70798ac3be\n" }, { "commit": "8d5b8b295930aaa43255c4f0b74ece3ee8b43a47", "tree": "c26fc49bbc74615e7f0b9657aaf3757a8282d7a9", "parents": [ "c8924c6ea9e83ba3832dd5551df38ab06f4aaca9" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Tue Mar 24 10:51:52 2015 +0000" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Thu Mar 26 14:10:03 2015 +0000" }, "message": "ART: Force constants into the entry block\n\nOptimizations such as GVN and BCE make the assumption that all\nconstants are located in the entry block of the CFG, but not all\npasses adhere to this rule.\n\nThis patch makes constructors of constants private and only accessible\nto friend classes - HGraph for int/long constants and SsaBuilder for\nfloat/double - which ensure that they are placed correctly and not\nduplicated.\n\nNote that the ArenaAllocatorAdapter was modified to not increment\nthe ArenaAllocator\u0027s internal reference counter in order to allow\nfor use of ArenaSafeMap inside an arena-allocated objects. Because\ntheir destructor is not called, the counter does not get decremented.\n\nChange-Id: I36a4fa29ae34fb905cdefd482ccbf386cff14166\n" }, { "commit": "b2fd7bca70b580921eebf7c45769c39d2dfd8a5a", "tree": "c5dae29519df73f889ba14495eb79d545cd7d6e5", "parents": [ "356286f989941ac495417195e4129aaceaf36a83" ], "author": { "name": "Alexandre Rames", "email": "alexandre.rames@arm.com", "time": "Wed Mar 11 16:48:16 2015 +0000" }, "committer": { "name": "Alexandre Rames", "email": "alexandre.rames@arm.com", "time": "Wed Mar 11 16:48:16 2015 +0000" }, "message": "Opt compiler: Basic simplification for arithmetic operations.\n\nThe optimisations in this patch do not look further than the\ninputs of each operation.\n\nChange-Id: Iddd0ab6b360b9e7bb042db22086d51a31be85530\n" }, { "commit": "277ccbd200ea43590dfc06a93ae184a765327ad0", "tree": "d89712e93da5fb2748989353c9ee071102cf3f33", "parents": [ "ad17d41841ba1fb177fb0bf175ec0e9f5e1412b3" ], "author": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Mon Nov 03 21:36:10 2014 -0800" }, "committer": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Tue Nov 04 18:40:08 2014 -0800" }, "message": "ART: More warnings\n\nEnable -Wno-conversion-null, -Wredundant-decls and -Wshadow in general,\nand -Wunused-but-set-parameter for GCC builds.\n\nChange-Id: I81bbdd762213444673c65d85edae594a523836e5\n" }, { "commit": "9240d6a2baa9ed1e18ee08744b461fe49a1ee269", "tree": "0adc27979a1c30defa16de4142b1d54fac6f93dc", "parents": [ "88cb1755e1d6acaed0f66ce65d7a2a4465053342" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Mon Oct 20 16:47:04 2014 +0100" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Tue Oct 21 13:48:41 2014 +0100" }, "message": "Constant folding on unary operations in the optimizing compiler.\n\nChange-Id: I4b77afa2a89f5ad2eedd4d6c0c6c382585419349\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": "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": "556c3d193134f6461f3e1fe17c032b087c5931a0", "tree": "436660c7155d0864c37f8aeabbc0f52e889a0cc2", "parents": [ "6aa606c9284ac31961f4c5b20c3645ac78acfaad" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Thu Sep 18 15:25:07 2014 +0100" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Thu Sep 18 15:25:07 2014 +0100" }, "message": "Initiate a constant propagation pass in the optimizing compiler.\n\n- Perform constant folding on int and long additions and subtractions in\n the optimizing compiler.\n- Apply constant folding to conditions and comparisons.\n\nChange-Id: Ic88783a3c975fda777c74c531e257fa777be42eb\n" } ] }