)]}' { "log": [ { "commit": "8cf9cb386cd9286d67e879f1ee501ec00d72a4e1", "tree": "88e86e214b425e444760fe4e0ffeee677e1558a2", "parents": [ "914b7b6a6c9f399b26b41e9160e9871ef749e0db" ], "author": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Wed Jul 19 09:28:38 2017 -0700" }, "committer": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Mon Jul 24 16:07:10 2017 -0700" }, "message": "ART: Include cleanup\n\nLet clang-format reorder the header includes.\n\nDerived with:\n\n* .clang-format:\n BasedOnStyle: Google\n IncludeIsMainRegex: \u0027(_test|-inl)?$\u0027\n\n* Steps:\n find . -name \u0027*.cc\u0027 -o -name \u0027*.h\u0027 | xargs sed -i.bak -e \u0027s/^#include/ #include/\u0027 ; git commit -a -m \u0027ART: Include cleanup\u0027\n git-clang-format -style\u003dfile HEAD^\n manual inspection\n git commit -a --amend\n\nTest: mmma art\nChange-Id: Ia963a8ce3ce5f96b5e78acd587e26908c7a70d02\n" }, { "commit": "ba118827465d12177f3996e50133960087b1c916", "tree": "f39728cdafc7810004d51c0bef2728b98993daa9", "parents": [ "64a102dde8c5daad83b991710decb418ce43aac5" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon Jun 12 15:41:56 2017 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Jul 20 13:35:06 2017 +0100" }, "message": "ART: Change method lookup to be more consistent to JLS and the RI.\n\nThe method lookup for different invoke types was previously\nwidely different and didn\u0027t work well with the dex cache\nmethod array where we have only a single slot for each\nMethodId. The new behavior is to perform the same lookup for\nall cases, distinguishing only between interface and\nnon-interface referencing class, and to further align the\nbehavior with the JLS and the RI. Where the JLS conflicts\nwith the RI, we follow the JLS semantics.\n\nThe new lookup for class methods first searches the methods\ndeclared in the superclass chain (ignoring \"copied\" methods)\nand only then looks in the \"copied\" methods. If the search\nin the superclass chain finds a method that has not been\ninherited (i.e. either a private method or a package-access\nmethod where one of the classes in the chain does not belong\nto the same package, see JLS 8.4.8), we still search the\n\"copied\" methods as there may actually be a method inherited\nfrom an interface. This follows the JLS semantics where\ninherited methods are included in the search (JLS 15.12.2.1)\nbut conflicts with the RI where the private or\npackage-access method takes precedence over methods\ninherited from interfaces.\n\nNote that this search can find an accessible method that is\nnot inherited by the qualifying type, either for a package\naccess method when the referrer is in the same package but\nthe qualifying type is in another package, or for a private\nmethod where the referrer is in the same class but the\nqualifying type is actually a subclass. For the moment we\nallow such calls and we shall consider whether to throw\nan IncompatibleClassChangeError in this situation in future\nto comply with JLS 15.12.4.3.\n\nThe new lookup for interface methods searches the interface\nclass, then all the superinterfaces and then the\njava.lang.Object class, see implicitly declared methods in\ninterfaces, JLS 9.2. The search for the maximally-specific\nnon-abstract superinterface method is not yet implemented,\nbut the difference should be difficult to observe as the\nusual subsequent call to FindVirtualMethodForInterface()\nshould yield the same result for any matching method.\n\nThe new test 162-method-idx-clash exposes several cases\nwhere we previously completely messed up due to the effects\nof the DexCache, or where we were out of line with the RI.\nIt also tests a case where the JLS and the RI disagree and\nwe follow the JLS.\n\nTest: art/test/run-test --host --jvm 162-method-resolution\nTest: m test-art-host-gtest\nTest: testrunner.py --host\nTest: testrunner.py --host --interp-ac\nTest: Nexus 6P boots.\nTest: testrunner.py --target\nBug: 62855082\nBug: 30627598\nChange-Id: If450c8cff2751369011d649c25d28a482a2c61a3\n" }, { "commit": "6597946d29be9108e2cc51223553d3db9290a3d9", "tree": "cea6647a45cc59fa1423751179e647124f269990", "parents": [ "a654e0378a8d0bb149362399917e4da2959e6991" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri May 19 17:25:12 2017 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon May 22 18:35:05 2017 +0100" }, "message": "Use PC-relative pointer to boot image methods.\n\nIn preparation for adding ArtMethod entries to the .bss\nsection, add direct PC-relative pointers to methods so that\nthe number of needed .bss entries for boot image is small.\n\nTest: m test-art-host-gtest\nTest: testrunner.py --host\nTest: testrunner.py --target on Nexus 6P\nTest: Nexus 6P boots.\nTest: Build aosp_mips64-userdebug\nBug: 30627598\nChange-Id: Ia89f5f9975b741ddac2816e1570077ba4b4c020f\n" }, { "commit": "50e20d54670aecf1a4fdcf37ef1606d5ca990559", "tree": "cb61312693cd392c3f9a569153a55c3eef936714", "parents": [ "e22445fba0e5747ea787429ac64577a9a62aded3" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri May 05 14:07:29 2017 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Tue May 09 10:41:39 2017 -0700" }, "message": "Moved knowledge on masking shift operands to simplifier.\n\nRationale:\nIt is better to have a single place that simplifies shift\nfactors outside the 32-bit or 64-bit distance range, so\nthat other phases (induction variable analysis, loop optimizations,\netc.) do not have to know about that.\n\nTest: test-art-target, test-art-host\nChange-Id: Idfd90259cca085426cc3055eccb90f3c0976036b\n" }, { "commit": "c6ea7d00ad069a2736f603daa3d8eaa9a1f8ea11", "tree": "a6d3332a8592fb806841314d55b206b573d37d86", "parents": [ "d68677c5fde1ace16ea58d65733776c954e7acb4" ], "author": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Wed Feb 01 16:46:28 2017 -0800" }, "committer": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Fri Apr 21 08:40:33 2017 -0700" }, "message": "ART: Clean up art_method.h\n\nClean up the header. Fix up other headers including the -inl file,\nin an effort to prune the include graph. Fix broken transitive\nincludes by making includes explicit. Introduce new -inl files\nfor method handles and reference visiting.\n\nTest: source build/envsetup.sh \u0026\u0026 lunch aosp_angler-userdebug \u0026\u0026 mmma art\nTest: source build/envsetup.sh \u0026\u0026 lunch aosp_mips64-userdebug \u0026\u0026 mmma art\nChange-Id: I8f60f1160c2a702fdf3598149dae38f6fa6bc851\n" }, { "commit": "6f8e2c9913b24f746a154dda700f609cee3095f9", "tree": "463b5925a1c87ef75ceab807e4c238a3e44a555a", "parents": [ "3bd2346db702894ef6c61372e7a83930b1c613ac" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Thu Mar 23 14:37:26 2017 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Mar 27 15:14:40 2017 +0100" }, "message": "Make data dependency around HDeoptimize correct.\n\nWe use HDeoptimize in a few places, but when it comes to data\ndependency we either:\n- don\u0027t have any (BCE, CHA), in which case we should make sure no\n code that the deoptimzation guards moves before the HDeoptimize\n- have one on the receiver (inline cache), in which case we can\n update the dominated users with the HDeoptimize to get the data\n dependency correct.\n\nbug:35661819\nbug:36371709\ntest: 644-checker-deopt\nChange-Id: I4820c6710b06939e7f5a59606971693e995fb958\n" }, { "commit": "c4aa82c5b0aa921c51eaf6f6bbaff36501ea2cee", "tree": "0da77f4e4a0fca7577f4c4c709353465d46c8581", "parents": [ "3a791cee90451dc32d46f1b0a85fecc6f22f62bf" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Mar 06 14:38:52 2017 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Mar 07 14:32:54 2017 +0000" }, "message": "Invoke typed arraycopy for primitive arrays.\n\nApps will always call the Object version of arraycopy. When\nwe can infer the types of the passed arrays, replace the method\nbeing called to be the typed System.arraycopy one.\n\n10% improvement on ExoPlayerBench.\n\nTest: 641-checker-arraycopy\nbug: 7103825\nChange-Id: I872d7a6e163a4614510ef04ae582eb90ec48b5fa\n" }, { "commit": "e761bccf9f0d884cc4d4ec104568cef968296492", "tree": "05a2d20d61c0e91270df2747f0c242433b5ce62b", "parents": [ "b0355130e38034db6b904783a00f74a3524e1881" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Thu Jan 19 08:59:37 2017 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Thu Jan 19 09:32:17 2017 +0000" }, "message": "Revert \"Revert \"Load the array class in the compiler for allocations.\"\"\n\nThis reverts commit fee255039e30c1c3dfc70c426c3d176221c3cdf9.\n\nChange-Id: I02b45f9a659d872feeb35df40b42c1be9878413a\n" }, { "commit": "fee255039e30c1c3dfc70c426c3d176221c3cdf9", "tree": "8207b72cc76513fed9f7b3c01aaa32cd54a87f1c", "parents": [ "cc99df230feb46ba717252f002d0cc2da6828421" ], "author": { "name": "Hiroshi Yamauchi", "email": "yamauchi@google.com", "time": "Thu Jan 19 02:11:15 2017 +0000" }, "committer": { "name": "Hiroshi Yamauchi", "email": "yamauchi@google.com", "time": "Thu Jan 19 02:11:15 2017 +0000" }, "message": "Revert \"Load the array class in the compiler for allocations.\"\n\nlibcore test fails.\n\nThis reverts commit cc99df230feb46ba717252f002d0cc2da6828421.\n\nChange-Id: I5bac595acd2b240886062e8c1f11f9095ff6a9ed\n" }, { "commit": "cc99df230feb46ba717252f002d0cc2da6828421", "tree": "73ac045673e150fa367a8da4d46874f28e928491", "parents": [ "4507fdcb70bd570d5f3968061bf991f0a1233a93" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Jan 17 23:00:24 2017 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Jan 18 15:16:32 2017 +0000" }, "message": "Load the array class in the compiler for allocations.\n\nRemoving one other dependency for needing to pass\nthe current method, and having dex_cache_resolved_types_\nin ArtMethod.\n\noat file increase:\n- x64: 0.25%\n- arm32: 0.30%\n- x86: 0.28%\n\ntest: test-art-host, test-art-target\nChange-Id: Ibca4fa00d3e31954db2ccb1f65a584b8c67cb230\n" }, { "commit": "5e83eb74e8333d254bc2d72a84643249bad67b68", "tree": "693d00c8d8daf3f56ce0824ae88863336e1c6f58", "parents": [ "4cd515521828b1f9ce0d5e2f545cb3376a94e9f3", "c52b26d4fb5b1ca91f34ce4b535b764853e538f6" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Jan 11 09:08:09 2017 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Wed Jan 11 09:08:10 2017 +0000" }, "message": "Merge \"Recognize getClass() in RTP.\"" }, { "commit": "c52b26d4fb5b1ca91f34ce4b535b764853e538f6", "tree": "9b734310200bb70cb42696082a55db70bed51b3c", "parents": [ "b28c8749a52f4f3252fbfe8bfb5f9d7c7f980adf" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Dec 19 09:18:07 2016 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Jan 10 14:11:32 2017 +0000" }, "message": "Recognize getClass() in RTP.\n\nAlso always keep around the resolved field\nin related HInstructions to avoid resolving it again\nand again.\n\nTest: test-art-host, 631-checker-get-class\n\nChange-Id: I3bc6be11f3eb175c635e746006f39865947e0669\n" }, { "commit": "431121fb0e1fab93a550e71e1da22d3bf056bd95", "tree": "90b22140d9f336735530671a79392e899b59490b", "parents": [ "91db41f315f6c2366b7098c531224bee01170364" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Jan 09 14:02:45 2017 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Jan 09 22:10:44 2017 +0000" }, "message": "The HBoundsCheck should be the index input of String.charAt.\n\nOtherwise, the charAt call may be licmed but the bounds check\nstay in the loop.\n\nbug: 33909430\nbug: 28330359\nTest: 632-checker-char-at-bounds\nChange-Id: I3cb749785c26ff8a016a7103899e9b19a24d5022\n" }, { "commit": "ab2270f8f7ecd93c7ba353dd4e300669de3e7aee", "tree": "113e6b264117bc9a3217a2d1685a09bb589075f8", "parents": [ "9538f9e2a5d03f1b1bc07ebfbd93b61dcf8ad604" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Dec 15 09:36:31 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Dec 15 11:03:38 2016 -0800" }, "message": "Fixed signal 11 bug by not testing resolved method first.\n\nTest: test-art-host\nBug: 33656359\n\nChange-Id: Idb1afccf811a2fbf7500fc1d953e118981ad36d4\n" }, { "commit": "9186ced255f2e7402646b5b286deebb540640734", "tree": "833c25fd3bbb47749265947705b4fc0f0c1ba796", "parents": [ "aa2657d6d9dda2e44c6452e5f5901db78ef9b3cc" ], "author": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Mon Dec 12 14:28:21 2016 -0800" }, "committer": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Tue Dec 13 11:43:48 2016 -0800" }, "message": "ART: Clean up utils.h\n\nRemove functionality provided by libbase. Move some single-use\nfunctions to their respective users.\n\nTest: m test-art-host\nChange-Id: I75594035fa975200d638cc29bb9f31bc6e6cb29f\n" }, { "commit": "71bf7b43380eb445973f32a7f789d9670f8cc97d", "tree": "76425f8578b247a845fe61724d71efc63059760f", "parents": [ "52f52361c2ea37941fbda71e3c653bb8096bf516" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Nov 16 10:17:46 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Nov 30 13:21:21 2016 -0800" }, "message": "Optimizations around escape analysis. With tests.\n\nDetails:\n(1) added new intrinsics\n(2) implemented optimizations\n more !can be null information\n more null check removals\n replace return-this uses with incoming parameter\n remove dead StringBuffer/Builder calls (with escape analysis)\n(3) Fixed exposed bug in CanBeMoved()\n\nPerformance gain:\nThis improves CafeineString by about 360%\n(removes null check from first loop, eliminates second loop completely)\n\nTest: test-art-host\n\nChange-Id: Iaf16a1b9cab6a7386f43d71c6b51dd59600e81c1\n" }, { "commit": "ff7d89c0364f6ebd0f0798eb18ef8bd62917de6a", "tree": "9a8401416b499f815731fd38dec219a1e49b623d", "parents": [ "8acdebc1a1b5821d3bb8e9461f7877fc234a37ff" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Nov 07 08:49:28 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Nov 09 09:32:36 2016 -0800" }, "message": "Allow read side effects for removing dead instructions.\n\nRationale:\nInstructions that only have the harmless read side effect may\nbe removed when dead as well, we were too strict previously.\nAs proof of concept, this cl also provides more accurate information\non a few string related intrinsics. This removes the dead indexOf\nfrom CaffeineString (17% performance improvement, big bottleneck\nof the StringBuffer\u0027s toString() still remains in loop).\n\nTest: test-art-host\nChange-Id: Id835a8e287e13e1f09be6b46278a039b8865802e\n" }, { "commit": "2767f4ba2df934fea4c50a016e2955c2cf3f6b19", "tree": "2676ce7b335cc0ce197a4754ed62fc114647ba4d", "parents": [ "77a0e4541a29c26dba21ed8c1ed1c29ef8d0ce4c" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Oct 28 15:03:53 2016 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Nov 02 14:45:36 2016 -0700" }, "message": "New instruction simplifications. Extra dce pass. Allow more per block repeats.\n\nRationale:\nWe were missing some obvious simplifications, which left performance\nat the table for e.g. CaffeineLogic compiled with dx (4200us-\u003e2700us).\nThe constant for allowing a repeat on a BB seemed very low, at the\nvery least it should depend on the BB size.\n\nTest: test-art-host\n\nChange-Id: Ic234566e117593e12c936d556222e4cd4f928105\n" }, { "commit": "2c45bc9137c29f886e69923535aff31a74d90829", "tree": "90c7762c2dcb1105bf5907d6a1d068f172ea6155", "parents": [ "168c58ce18b139d313cbc6131e3bb43539952c55" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Oct 25 16:54:12 2016 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Oct 27 14:30:29 2016 +0100" }, "message": "Remove H[Reverse]PostOrderIterator and HInsertionOrderIterator.\n\nUse range-based loops instead, introducing helper functions\nReverseRange() for iteration in reverse order in containers.\nWhen the contents of the underlying container change inside\nthe loop, use an index-based loop that better exposes the\ncontainer data modifications, compared to the old iterator\ninterface that\u0027s hiding it which may lead to subtle bugs.\n\nTest: m test-art-host\nChange-Id: I2a4e6c508b854c37a697fc4b1e8423a8c92c5ea0\n" }, { "commit": "0795f23920ee9aabf28e45c63cd592dcccf00216", "tree": "ff3f880c5e84f3316532b47d0e9a7729ade848ac", "parents": [ "d1224dce59eb0019507e41da5e10f12dda66bee4" ], "author": { "name": "Mathieu Chartier", "email": "mathieuc@google.com", "time": "Tue Sep 27 18:43:30 2016 -0700" }, "committer": { "name": "Mathieu Chartier", "email": "mathieuc@google.com", "time": "Thu Sep 29 17:31:09 2016 -0700" }, "message": "Clean up ScopedThreadStateChange to use ObjPtr\n\nAlso fixed inclusion of -inl.h files in .h files by adding\nscoped_object_access-inl.h and scoped_fast_natvie_object_access-inl.h\n\nChanged AddLocalReference / Decode to use ObjPtr.\n\nChanged libartbenchmark to be debug to avoid linkage errors.\n\nBug: 31113334\n\nTest: test-art-host\n\nChange-Id: I4d2e160483a29d21e1e0e440585ed328b9811483\n" }, { "commit": "5e4e11e171f90d9a3ea178fc8e72aac909de55d5", "tree": "53314d1139ac797d55258f39097ecfb5cef45920", "parents": [ "ca8bad9136d1389deeebc8652fb17063388de6b2" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Thu Sep 22 13:17:41 2016 +0100" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Fri Sep 23 09:08:00 2016 +0100" }, "message": "Clean-up sharpening and compiler driver.\n\nRemove dependency on compiler driver for sharpening\nand dex2dex (the methods called on the compiler driver were\ndoing unnecessary work), and remove the now unused methods\nin compiler driver.\n\nAlso remove test that is now invalid, as sharpening always\nsucceeds.\n\ntest: m test-art-host m test-art-target\nChange-Id: I54e91c6839bd5b0b86182f2f43ba5d2c112ef908\n" }, { "commit": "9837caff9cbfb61e3dabc6fbecb398d4d659c017", "tree": "b8101227d3987cebbc1c9d13f5d5f23a037a9f9a", "parents": [ "80eb0bc2757274816a014a2997848d288c9ee553" ], "author": { "name": "Sebastien Hertz", "email": "shertz@google.com", "time": "Mon Aug 01 11:09:50 2016 +0200" }, "committer": { "name": "Sebastien Hertz", "email": "shertz@google.com", "time": "Wed Sep 21 13:45:08 2016 +0200" }, "message": "Update art tests\n\nJack generates different code compared to the previous release so\nsome tests need to be updated. For instance, Jack transform \u0027!cond\u0027\ninto \u0027cond xor 1\u0027.\n\nThe test 463-checker-boolean-simplifier still tests the if/else\npattern using smali.\n\n(cherry picked from commit e4d28c502486afe58a0e156b8fefb621a622cec2)\n\nBug: 29493697\nTest: lunch aosp_bullhead-userdebug \u0026\u0026 make -j32\nTest: make -j32 test-art-host \u0026\u0026 make -j32 test-art-target\nTest: art/tools/run-jdwp-tests.sh --mode\u003dhost\nChange-Id: Ief8ac3e9a4bcaa35c99e57161961d630333d3b3c\n" }, { "commit": "d3278bd288aaecd525f931a54f5f2a392f627fd3", "tree": "20a795e7de9ace6fa695e123fcf7beaf4e9ccbb9", "parents": [ "d8f5f56f2dd90e2bcb6d41cb48403320b9eb04b9" ], "author": { "name": "Maxim Kazantsev", "email": "maxim.kazantsev@intel.com", "time": "Tue Jul 12 15:55:33 2016 +0600" }, "committer": { "name": "Maxim Kazantsev", "email": "maxim.kazantsev@intel.com", "time": "Tue Jul 12 11:14:02 2016 +0000" }, "message": "Two more patterns for instruction simplifier\n\nThis patch allows the instruction simplifier to cover\ntwo more cases:\n\n x \u003d a + b and x \u003d a - b\n y \u003d x - b y \u003d x + b\n\nIn both cases y can be replaced with a, if the types\nof arguments are integral.\n\nChange-Id: I4735737f471e31057f1df76ddace5d4d1c79cde6\nTest: New tests in 458-checker-instruction-simplification.\nSigned-off-by: Max Kazantsev \u003cmaxim.kazantsev@intel.com\u003e\n" }, { "commit": "e14dc86d4e84d52426510d0fafbac3d7e04f960c", "tree": "7ec03801e3dd8d4a6f428239308f1f7700c815fc", "parents": [ "1fdb340de4e608a88e8683c857cad5d0da2c16de" ], "author": { "name": "Anton Kirilov", "email": "anton.kirilov@linaro.org", "time": "Fri May 13 17:56:15 2016 +0100" }, "committer": { "name": "Anton Kirilov", "email": "anton.kirilov@linaro.org", "time": "Fri Jul 01 17:45:30 2016 +0100" }, "message": "Simplification for associative and commutative operations on constants\n\nThe purpose of this change is to enable the instruction simplifier\nto recognize patterns such as\n\nOP y, x, const1\nOP z, y, const2\n\nwhere OP is both an associative and a commutative operation on integral\ntypes, and replace them with\n\nOP z, x, const3\n\nSince subtraction on integral types is equivalent to addition with a\nnegated operand, it receives a similar treatment, even though it is\nnot commutative.\n\nChange-Id: I278cac39bd39bc843d250a976931cb000876ea88\n" }, { "commit": "50518449afe8fa7eb741f42c904fb4baf6c34da2", "tree": "e88f92b642b79e136a1c8c20680e9430ed4c1cfb", "parents": [ "105683791e6b3f017a1a5673df22bf2185e19b54" ], "author": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Mon Jun 27 11:39:19 2016 +0100" }, "committer": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Tue Jun 28 09:32:41 2016 +0100" }, "message": "Optimize away useless masking operations on shift amounts.\n\nChange-Id: I90d69757cc45312eda3d57cc2d32bfb4e47963f5" }, { "commit": "87f3fcbd0db352157fc59148e94647ef21b73bce", "tree": "5bdeabb246f5de86704333b3fcbccc6e9146d246", "parents": [ "b94b5706f0b8e2e1c7e1db22274f9f4bae0c4b5a" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Apr 28 15:52:11 2016 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Jun 21 15:17:38 2016 +0100" }, "message": "Replace String.charAt() with HIR.\n\nReplace String.charAt() with HArrayLength, HBoundsCheck and\nHArrayGet. This allows GVN on the HArrayLength and BCE on\nthe HBoundsCheck as well as using the infrastructure for\nHArrayGet, i.e. better handling of constant indexes than\nthe old intrinsic and using the HArm64IntermediateAddress.\n\nBug: 28330359\nChange-Id: I32bf1da7eeafe82537a60416abf6ac412baa80dc\n" }, { "commit": "4248fc46289f9940aa13d22e4f89abed5e74b169", "tree": "aa72b1443c7ed4ff86eb96468c56071df30c89b8", "parents": [ "f3349b5cc7baa06bdc82d3f55e8e57a7e266b809", "372f10e5b0b34e2bb6e2b79aeba6c441e14afd1f" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Jun 03 12:34:22 2016 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Fri Jun 03 12:34:23 2016 +0000" }, "message": "Merge \"Refactor handling of input records.\"" }, { "commit": "372f10e5b0b34e2bb6e2b79aeba6c441e14afd1f", "tree": "1f29c2467c8909ef0e0147f37f176caa1bcd2ccc", "parents": [ "1b66fdf3f33c72dfdda4d31f6f17b6a0d8607402" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue May 17 16:30:10 2016 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Jun 02 19:04:20 2016 +0100" }, "message": "Refactor handling of input records.\n\nIntroduce HInstruction::GetInputRecords(), a new virtual\nfunction that returns an ArrayRef\u003c\u003e to all input records.\nImplement all other functions dealing with input records as\nwrappers around GetInputRecords(). Rewrite functions that\npreviously used multiple virtual calls to deal with input\nrecords, especially in loops, to prefetch the ArrayRef\u003c\u003e\nonly once for each instruction. Besides avoiding all the\nextra calls, this also allows the compiler (clang++) to\nperform additional optimizations.\n\nThis speeds up the Nexus 5 boot image compilation by ~0.5s\n(4% of \"Compile Dex File\", 2% of dex2oat time) on AOSP ToT.\n\nChange-Id: Id8ebe0fb9405e38d918972a11bd724146e4ca578\n" }, { "commit": "c5809c3c31814e80a19c71adca306378281f2ab4", "tree": "2712109d35b5c91542af4c2b72af9c0e69395462", "parents": [ "a21decf759af7dc29f64ff7ee02a758397578cd3" ], "author": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Wed May 25 15:01:06 2016 +0100" }, "committer": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Wed Jun 01 09:14:44 2016 +0100" }, "message": "Add missing calls to `RecordSimplification()`.\n\nNote that not all transformations in the instruction simplifier call\nthis helper. It is used to track a loosely defined category of\ntransformations for which we may benefit from re-running the\nsimplifier.\n\nChange-Id: I14dd841a30c526065cff337627c9156abe3d7c0a\n" }, { "commit": "dce016eab87302f02b0bd903dd2cd86ae512df2d", "tree": "3af3c0e6b9d845e611b560484882e6b438ef439a", "parents": [ "a246510965fc57ec51d1b202649304535adfe9f3" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Apr 28 13:10:02 2016 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon May 09 20:40:32 2016 +0100" }, "message": "Intrinsify String.length() and String.isEmpty() as HIR.\n\nUse HArrayLength for String.length() in anticipation of\nchanging the String.charAt() to HBoundsCheck+HArrayGet to\nallow the existing BCE to seamlessly work for strings.\nUse HArrayLength+HEqual for String.isEmpty().\n\nWe previously relied on inlining but we now want to apply\nthe new intrinsics even when we do not inline, i.e. when\ncompiling debuggable (as is currently the case for boot\nimage) or when we hit inlining limits, i.e. depth, size,\nor the number of accumulated dex registers.\n\nBug: 28330359\nChange-Id: Iab9d2f6d2967bdd930a72eb461f27efe8f37c103\n" }, { "commit": "46817b876ab00d6b78905b80ed12b4344c522b6c", "tree": "6715bee60b0682a10437866c9617cb442146aa2f", "parents": [ "f59149a151ee694484e21da7b3b207920dead5a6" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Mar 29 12:21:58 2016 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Apr 19 18:33:06 2016 +0100" }, "message": "Use iterators \"before\" the use node in HUserRecord\u003c\u003e.\n\nCreate a new template class IntrusiveForwardList\u003c\u003e that\nmimicks std::forward_list\u003c\u003e except that all allocations\nare handled externally. This is essentially the same as\nboost::intrusive::slist\u003c\u003e but since we\u0027re not using Boost\nwe have to reinvent the wheel.\n\nUse the new container to replace the HUseList and use the\niterators to \"before\" use nodes in HUserRecord\u003c\u003e to avoid\nthe extra pointer to the previous node which was used\nexclusively for removing nodes from the list. This reduces\nthe size of the HUseListNode by 25%, 32B to 24B in 64-bit\ncompiler, 16B to 12B in 32-bit compiler. This translates\ndirectly to overall memory savings for the 64-bit compiler\nbut due to rounding up of the arena allocations to 8B, we\ndo not get any improvement in the 32-bit compiler.\n\nCompiling the Nexus 5 boot image with the 64-bit dex2oat\non host this CL reduces the memory used for compiling the\nmost hungry method, BatteryStats.dumpLocked(), by ~3.3MiB:\n\nBefore:\n MEM: used: 47829200, allocated: 48769120, lost: 939920\n Number of arenas allocated: 345,\n Number of allocations: 815492, avg size: 58\n ...\n UseListNode 13744640\n ...\nAfter:\n MEM: used: 44393040, allocated: 45361248, lost: 968208\n Number of arenas allocated: 319,\n Number of allocations: 815492, avg size: 54\n ...\n UseListNode 10308480\n ...\n\nNote that while we do not ship the 64-bit dex2oat to the\ndevice, the JIT compilation for 64-bit processes is using\nthe 64-bit libart-compiler.\n\nBug: 28173563\nChange-Id: I985eabd4816f845372d8aaa825a1489cf9569208\n" }, { "commit": "f355c3ff08710ac2eba3aac2aacc5e65caa06b4c", "tree": "1d9f9487897fabc539f748be881f9c8140c16cef", "parents": [ "6f51d7756a9c66007fe7666b19399e1f60ff6092" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Wed Mar 30 19:09:03 2016 +0100" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Wed Mar 30 19:09:03 2016 +0100" }, "message": "Fix Boolean to integral types conversions.\n\nBug: 27616343\nChange-Id: I050f92045bca1b8b5d6da53547cc617f17be84b1\n" }, { "commit": "0ced281ae6216c29f57ca0f8b7388a722e8da97b", "tree": "b7f8273bb117c8ec8f8546ed937a8c0a96d2e5de", "parents": [ "843a65556616183a36792bbcc1632c6d8d0e78b2", "1a65388f1d86bb232c2e44fecb44cebe13105d2e" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Thu Mar 24 10:25:51 2016 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Thu Mar 24 10:25:51 2016 +0000" }, "message": "Merge \"Clean up art::HConstant predicates.\"" }, { "commit": "63ec32274066da114d733d8d3c5ff389883e403c", "tree": "8ae9f26bc2a1f90d770e9c3c143667a7cfd8e30e", "parents": [ "d6026cde1ef7f2b0abb7a3561510fe83a7dd9de2", "d96a246e5b103bfc167acaa6315bd8abca9de493" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Thu Mar 24 09:38:51 2016 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Thu Mar 24 09:38:52 2016 +0000" }, "message": "Merge \"Optimizing: Do not insert suspend checks on back-edges.\"" }, { "commit": "d96a246e5b103bfc167acaa6315bd8abca9de493", "tree": "3e99f24bc30d53bc9cfc9fb1e0f3dc92c0ce1daf", "parents": [ "3920099f578fd8015777bc3c1c7392a08b1e08e7" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Wed Mar 23 16:01:47 2016 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Wed Mar 23 19:17:51 2016 +0000" }, "message": "Optimizing: Do not insert suspend checks on back-edges.\n\nRely on HGraph::SimplifyLoop() to insert suspend checks.\n\nCodeGenerator\u0027s CheckLoopEntriesCanBeUsedForOsr() checks the\ndex pcs of suspend checks against branch targets to verify\nthat we always have an appropriate point for OSR transition.\nHowever, the HSuspendChecks that were added by HGraphBuilder\nto support the recently removed \"baseline\" interfered with\nthis in a specific case, namely an infinite loop where the\nback-branch jumps to a nop. In that case, the HSuspendCheck\nadded by HGraphBuilder had a dex pc different from the block\nand the branch target but its presence would stop the\nHGraph::SimplifyLoop() from adding a new HSuspendCheck with\nthe correct dex pc.\n\nBug: 27623547\nChange-Id: I83566a260210bc05aea0c44509a39bb490aa7003\n" }, { "commit": "541261e66273857c638677424215de91f3d65a6f", "tree": "8e2dd00e442612e22ba1473a49597a2ae2735e81", "parents": [ "f8a3dea642fe638f54d181b7ca280b79ee519398", "5b5b9319ff970979ed47d41a41283e4faeffb602" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Wed Mar 23 17:10:31 2016 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Wed Mar 23 17:10:31 2016 +0000" }, "message": "Merge \"Fix and improve shift and rotate operations.\"" }, { "commit": "5b5b9319ff970979ed47d41a41283e4faeffb602", "tree": "e7795abf120cf512627786fd6302efd34535724b", "parents": [ "0c25da0276f5b6f6119793ae9d45d1bca8172c2b" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Tue Mar 22 14:57:31 2016 +0000" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Tue Mar 22 14:57:31 2016 +0000" }, "message": "Fix and improve shift and rotate operations.\n\n- Define maximum int and long shift \u0026 rotate distances as\n int32_t constants, as shift \u0026 rotate distances are 32-bit\n integer values.\n- Consider the (long, long) inputs case as invalid for\n static evaluation of shift \u0026 rotate rotations.\n- Add more checks in shift \u0026 rotate operations constructors\n as well as in art::GraphChecker.\n\nChange-Id: I754b326c3a341c9cc567d1720b327dad6fcbf9d6\n" }, { "commit": "937e6cd515bbe7ff2f255c8fcd40bf1a575a9a16", "tree": "90660b3d679cfbd87327e9cda5c783128f1b9a92", "parents": [ "1153282aa91292b740289ab7612a481e5c6bc167" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Tue Mar 22 11:54:37 2016 +0000" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Tue Mar 22 11:54:37 2016 +0000" }, "message": "Tighten art::HNeg type constraints on its input.\n\nEnsure art::HNeg is only passed a type having the kind of\nits input. For a boolean, byte, short, or char input, it\nmeans HNeg\u0027s type should be int.\n\nBug: 27684275\nChange-Id: Ic8442c62090a8ab65590754874a14a0deb7acd8d\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": "22c4922c6b31e154a6814c4abe9015d9ba156911", "tree": "8e871f67e327322d24d0c2e4588b165005414077", "parents": [ "0205b58a0d7a9ce5832393857c19c086c78996e9" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Fri Mar 18 14:04:28 2016 +0000" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Fri Mar 18 14:04:28 2016 +0000" }, "message": "Ensure art::HRor support boolean, byte, short and char inputs.\n\nAlso extend tests covering the IntegerRotateLeft,\nLongRotateLeft, IntegerRotateRight and LongRotateRight\nintrinsics and their translation into an art::HRor\ninstruction.\n\nBug: 27682579\nChange-Id: I89f6ea6a7315659a172482bf09875cfb7e7422a1\n" }, { "commit": "a5c4a4060edd03eda017abebc85f24cffb083ba7", "tree": "85f69512d33c19d82e172a490a241f3a17d66560", "parents": [ "713c519db15aaa8d6f33b744fd28adddb97a07c2" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Tue Mar 15 15:02:50 2016 +0000" }, "committer": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Wed Mar 16 16:49:36 2016 +0000" }, "message": "Make art::HCompare support boolean, byte, short and char inputs.\n\nAlso extend tests covering the IntegerSignum, LongSignum,\nIntegerCompare and LongCompare intrinsics and their\ntranslation into an art::HCompare instruction.\n\nBug: 27629913\nChange-Id: I0afc75ee6e82602b01ec348bbb36a08e8abb8bb8\n" }, { "commit": "1583e624d4c970d8e571b265b9a8f08402d91f82", "tree": "fdde737540eca3e692caa85f98821a0cbef9f840", "parents": [ "532da65d01f13facd261367beb34ee41146671d4", "6915898b28cea6c9836ca1be6814d87e89cc6d76" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Wed Mar 16 14:39:49 2016 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Wed Mar 16 14:39:49 2016 +0000" }, "message": "Merge \"Improve compiler stats\"" }, { "commit": "6915898b28cea6c9836ca1be6814d87e89cc6d76", "tree": "89eb0f498a958b72d78c8aee25b4de212c25348b", "parents": [ "fbc61e19578d281d05728bcd120e1ace57c2fbd8" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Wed Mar 16 11:53:41 2016 +0000" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Wed Mar 16 14:07:22 2016 +0000" }, "message": "Improve compiler stats\n\n- report the max size of arena alloc\n- report how many virtual or interface invokes were inlined\n\nChange-Id: I82f154a8e25b5e3890181a1aa11346cdc3f93e37\n" }, { "commit": "5b1805357b80d780d6afc9e2c70c6544c7ac7e2f", "tree": "696a474d54a35b974d51cefff24d961f98e57e7b", "parents": [ "12af36e09116dc677820f98e33ff2982e07d652a" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Mar 15 18:11:50 2016 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Mar 15 18:11:50 2016 +0000" }, "message": "ART: Fix shift simplification, x \u003e\u003e\u003e 64.\n\nFix braino in\n https://android-review.googlesource.com/208199\n\nBug: 27638111\nChange-Id: I8f12008af8bba943664c8a9eac3f2d2f7c820e79\n" }, { "commit": "164306e779de522efba7df637618a8eeed9e37ac", "tree": "6ceddd6879870272d6bef39026c36212ce6854df", "parents": [ "5681b6638b0001c62d02795b0853e2e82787edf1" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Mar 15 14:57:32 2016 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Mar 15 15:25:39 2016 +0000" }, "message": "Optimizing: Improve shift simplification, x \u003e\u003e\u003e 64.\n\nSimplify shifts by a multiple of bit size, not just 0.\nARM codegen does not expect to see such shifts and it\nis guarding against them with a DCHECK().\n\nBug: 27638111\nChange-Id: I3ae8383d7edefa0facd375ce511e7a226d5468a1\n" }, { "commit": "24bd89559c177af9e342f0d5a64a0a2855dfb887", "tree": "eeacbc6d65b62dc018193b9440112ebbc4e3341e", "parents": [ "51b7e2d08f2bcf528eeec48b42c178b5550f6635" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Mar 15 10:40:33 2016 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Mar 15 10:43:13 2016 +0000" }, "message": "Optimizing: Prevent potential valgrind error.\n\nThis CL preemptively extends the workaround from\n https://android-review.googlesource.com/208230\nto an almost identical bit of code.\n\nBug: 27651442\nChange-Id: I7683d42b46b16f2293916defc6ef1d871dc9af6c\n" }, { "commit": "a65ed3045ec2df95a30994752b3fb0576f479354", "tree": "c566a5bcfdf9ad9717f82aea809c88a253cb6960", "parents": [ "11ad2523557c35acfbf829aa203d14914e61884e" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon Mar 14 21:21:29 2016 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon Mar 14 21:22:49 2016 +0000" }, "message": "Optimizing: Fix valgrind error in image_test64.\n\nBug: 27651442\nChange-Id: Id9b80c6015dbc3b82966766ca4ad010be770f116\n" }, { "commit": "625090fe9bf47d8d735c9a66cbf491de3a3e3765", "tree": "9bf994303cf2491ec9c676d558f3bce97b46cdb7", "parents": [ "70bc6de7e27dd7d82a2bac6685e0f3096df07b83" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon Mar 14 18:00:05 2016 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon Mar 14 19:01:16 2016 +0000" }, "message": "Optimizing: Fix TypeConversion(And(x, const)) simplification.\n\nAvoid introducing implicit conversions when simplifying the\nexpression TypeConversion(And(x, const)). Previously, when\nwe dropped the And, we could end up with a TypeConversion to\nthe same type which should be eliminated on subsequent pass\nof the block\u0027s instructions; however, a subsequent dependent\nTypeConversion in the same block would be processed earlier\nand we would unexpectedly see its input as the conversion to\nthe same type, failing a DCHECK().\n\nBug: 27626509\nChange-Id: I5874a9ceafbf635cf3391beea807ede8468ab5c3\n" }, { "commit": "bdd7935c2adc3ad190ee87958e714a36f33cedae", "tree": "64563d52d699d63c22574dbc97e6d5410df94ac3", "parents": [ "2af7213a4e0d395fe22dcdce6ec10a3bd131023d" ], "author": { "name": "Anton Shamin", "email": "anton.shamin@intel.com", "time": "Mon Feb 15 12:48:36 2016 +0600" }, "committer": { "name": "Anton Shamin", "email": "anton.shamin@intel.com", "time": "Fri Mar 11 18:28:55 2016 +0600" }, "message": "Revert \"Revert \"Revert \"Revert \"Change condition to opposite if lhs is constant\"\"\"\"\n\nThis reverts commit d4aee949b3dd976295201b5310f13aa2df40afa1.\n\nChange-Id: I505b8c9863c310a3a708f580b00d425b750c9541\n" }, { "commit": "1193259cb37c9763a111825aa04718a409d07145", "tree": "80d8fb18d2ea4b1ca367957f9c745f1fef79d059", "parents": [ "2f6ad55a3bfa16867146233e1eb8b822b1daab4b" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Tue Mar 08 12:42:25 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Tue Mar 08 12:42:25 2016 -0800" }, "message": "Implement the 1.8 unsafe memory fences directly in HIR.\n\nRationale:\nMore efficient since it exposes full semantics to\nall operations on the graph and allows for proper\ncode generation for all architectures.\n\nbug\u003d26264765\n\nChange-Id: Ic435886cf0645927a101a8502f0623fa573989ff\n" }, { "commit": "2a6aad9d388bd29bff04aeec3eb9429d436d1873", "tree": "a5fa70df33d410af1be1064c460b6e34f07caf93", "parents": [ "9ec486cc08ad658eee33f9bde405b97502562840" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Feb 25 11:32:32 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Feb 26 09:16:07 2016 -0800" }, "message": "Implement fp to bits methods as intrinsics.\n\nRationale:\nBetter optimization, better performance.\n\nResults on libcore benchmark:\n\nMost gain is from moving the invariant call out of the loop\nafter we detect everything is a side-effect free intrinsic.\nBut generated code in general case is much cleaner too.\n\nBefore:\ntimeFloatToIntBits() in 181 ms.\ntimeFloatToRawIntBits() in 35 ms.\ntimeDoubleToLongBits() in 208 ms.\ntimeDoubleToRawLongBits() in 35 ms.\n\nAfter:\ntimeFloatToIntBits() in 36 ms.\ntimeFloatToRawIntBits() in 35 ms.\ntimeDoubleToLongBits() in 35 ms.\ntimeDoubleToRawLongBits() in 34 ms.\n\nbug\u003d11548336\n\nChange-Id: I6e001bd3708e800bd75a82b8950fb3a0fc01766e\n" }, { "commit": "8ffc1fa556eb92f50a0bd3d5eab56435fff206f6", "tree": "9ab530e9d65f4f91b6c2d278408c01a0d161038d", "parents": [ "f598e2f183f496065597267a6fc142aa9a56e7c4" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Feb 17 15:13:56 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Feb 17 16:01:21 2016 -0800" }, "message": "Set bias on !\u003d comparison for isNaN.\n\nChange-Id: I83969ecf7252b5e001bdd501c4ca31e7d0608854\n" }, { "commit": "75a38b24801bd4d27c95acef969930f626dd11da", "tree": "81a02217dafbc4dd840db8b8ba34cd66abd9c704", "parents": [ "b93c21e83c8fbf0191093c01a8951adb5be9010b" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Feb 17 10:41:50 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Feb 17 13:01:45 2016 -0800" }, "message": "Implement isNaN intrinsic through HIR equivalent.\n\nRationale:\nEfficient implementation on all platforms.\nSubject to better compiler optimizations.\n\nChange-Id: Ie8876bf5943cbe1138491a25d32ee9fee554043c\n" }, { "commit": "8428bd376e660df2ffceee72f797d1cfc6c66433", "tree": "5dc6d17eb70179b4b823d5f6034021ec6574c60b", "parents": [ "b52bbde2870e5ab5d126612961dcb3da8e5236ee" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Feb 12 16:53:57 2016 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon Feb 15 15:09:27 2016 +0000" }, "message": "Optimizing: Remove unnecessary And before TypeConversion.\n\nFor example `(byte) (x \u0026 0xff)` doesn\u0027t need the `\u0026 0xff`.\n\nBug: 23965701\nChange-Id: I5fc8419491aff2cdc7074451e74e873b5f582d41\n" }, { "commit": "b52bbde2870e5ab5d126612961dcb3da8e5236ee", "tree": "3a58d251d8667e7c8447199a799fecba9bd5f918", "parents": [ "1b0755299928221a1dcc5db383bf8fc378d29b60" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Feb 12 12:06:05 2016 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon Feb 15 15:06:44 2016 +0000" }, "message": "Optimizing: Simplify consecutive type conversions.\n\nMerge two consecutive type conversions to one if the result\nof such merged conversion is guaranteed to be the same and\nremove all implicit conversions, not just conversions to the\nsame type. Improve codegens to handle conversions from long\nto integral types smaller than int.\n\nThis will make it easier to simplify `(byte) (x \u0026 0xffL)` to\n`(byte) x` where the conversion from long to byte is done by\ntwo dex instructions, long-to-int and in int-to-byte.\n\nBug: 23965701\nChange-Id: I833f193556671136ad2cd3f5b31cdfbc2d99c19d\n" }, { "commit": "a19616e3363276e7f2c471eb2839fb16f1d43f27", "tree": "ad3e7fd0f53229e95fb0443586fc30eedabe6967", "parents": [ "9fba3f67a0792ad5eeb495e489d11a87211c318f" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Feb 01 18:57:58 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Feb 05 09:26:21 2016 -0800" }, "message": "Implemented compare/signum intrinsics as HCompare\n(with all code generation for all)\n\nRationale:\nAt HIR level, many more optimizations are possible, while ultimately\ngenerated code can take advantage of full semantics.\n\nChange-Id: I6e2ee0311784e5e336847346f7f3c4faef4fd17e\n" }, { "commit": "9f98025ba5541641cfa9abb7b9cf30332d91fad1", "tree": "5f49ea003ee2989f788605bf68b13c2e55db00e8", "parents": [ "f1ea14af52b64adb45ba57ce8c525511c208d0e2" ], "author": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Fri Feb 05 14:00:28 2016 +0000" }, "committer": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Fri Feb 05 14:00:28 2016 +0000" }, "message": "Extend De Morgan factorisation to `HBooleanNot`.\n\nChange-Id: I81aa92277fa136d675e7ef01be8e4acdbd3d3b7c\n" }, { "commit": "ca0e3a0c9f1fd5902dc40043b061d2f9b79ec098", "tree": "e410c21a6f94536a1cc9666f6f017d135a29ca82", "parents": [ "b72923dd4d6e1636163047c960395ed9879e31fc" ], "author": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Wed Feb 03 10:54:07 2016 +0000" }, "committer": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Wed Feb 03 10:54:07 2016 +0000" }, "message": "Revert \"Revert \"Optimizing: double-negated bitwise operations simplifications\"\"\n\nThis reverts commit 737c0a99dfbba306ec1f50e2adf66b5d97805af6 with fixes.\n\nIn the original patch, the new instruction could be inserted before\none of its inputs. A regression test is also added.\n\nChange-Id: Ie49a17ac90ff048355d9cc944b468cd1b1914424\n" }, { "commit": "74eb1b264691c4eb399d0858015a7fc13c476ac6", "tree": "0b6fc4f3003d50bf6c388601013cdfc606e53859", "parents": [ "75fd2a8ab9b4aff59308034da26eb4986d10fa9e" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Mon Dec 14 11:44:01 2015 +0000" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Thu Jan 28 15:50:27 2016 +0000" }, "message": "ART: Implement HSelect\n\nThis patch adds a new HIR instruction to Optimizing. HSelect returns\none of two inputs based on the outcome of a condition.\n\nThis is only initial implementation which:\n - defines the new instruction,\n - repurposes BooleanSimplifier to emit it,\n - extends InstructionSimplifier to statically resolve it,\n - updates existing code and tests accordingly.\n\nCode generators currently emit fallback if/then/else code and will be\nupdated in follow-up CLs to use platform-specific conditional moves\nwhen possible.\n\nChange-Id: Ib61b17146487ebe6b55350c2b589f0b971dcaaee\n" }, { "commit": "737c0a99dfbba306ec1f50e2adf66b5d97805af6", "tree": "155e5e1f0a88f5d5c713f3a248741389bdc8c5b0", "parents": [ "96798493170521691d709be50dd2102ead47b083" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Jan 25 10:17:57 2016 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Jan 25 10:17:57 2016 +0000" }, "message": "Revert \"Optimizing: double-negated bitwise operations simplifications\"\n\nFails compiling the Wallet.apk with:\n\ndex2oatd F 40736 41007 art/compiler/optimizing/optimizing_compiler.cc:194] Error after instruction_simplifier: art::SSAChecker: Instruction Add:59 in block 4 does not dominate use Or:153 in block 4.\n\nThis reverts commit 96798493170521691d709be50dd2102ead47b083.\n\nChange-Id: Ia4b02e62e6133aa104f5db12ba82d5561b6fc090\n" }, { "commit": "96798493170521691d709be50dd2102ead47b083", "tree": "34d03d55e9a2eeaa3f06bc7198c192156aa676b4", "parents": [ "7d9f95f29d07c455c3ab76d89b7952755a3e0a28" ], "author": { "name": "Kevin Brodsky", "email": "kevin.brodsky@linaro.org", "time": "Fri Jan 15 09:49:20 2016 +0000" }, "committer": { "name": "Kevin Brodsky", "email": "kevin.brodsky@linaro.org", "time": "Fri Jan 22 14:43:37 2016 +0000" }, "message": "Optimizing: double-negated bitwise operations simplifications\n\nGeneric instruction simplifications applying to bitwise operations when\nboth inputs are Not\u0027s. And and Or are handled by De Morgan\u0027s laws,\nremoving one instruction:\n~a \u0026 ~b -\u003e ~(a | b)\n~a | ~b -\u003e ~(a \u0026 b)\nXor is handled by this trivial relation, removing two instructions:\n~a ^ ~b \u003d a ^ b\n\nThe simplifications only happen when neither Not is used by other\ninstructions.\n\nChange-Id: I5d5187af2f625c475c3e49466af6bc3e87595f8f\n" }, { "commit": "d30de5b7667843889e38370ec3b8f523e5a128d0", "tree": "6aa3ee28f89a3ec812339b19c003c0d404624aa6", "parents": [ "34513835220e9473662ed1780291c680a5716fd0", "d4aee949b3dd976295201b5310f13aa2df40afa1" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Fri Jan 22 12:36:39 2016 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Fri Jan 22 12:36:39 2016 +0000" }, "message": "Merge \"Revert \"Revert \"Revert \"Change condition to opposite if lhs is constant\"\"\"\"" }, { "commit": "d4aee949b3dd976295201b5310f13aa2df40afa1", "tree": "8ffb80498cd8fdff66a4ab272723cf4d4e69e57b", "parents": [ "884e54c8a45e49b58cb1127c8ed890f79f382601" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Fri Jan 22 12:35:26 2016 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Fri Jan 22 12:35:26 2016 +0000" }, "message": "Revert \"Revert \"Revert \"Change condition to opposite if lhs is constant\"\"\"\n\nFails two checker tests:\n\n458-checker-instruction-simplification\n537-checker-jump-over-jump\n\nThis reverts commit 884e54c8a45e49b58cb1127c8ed890f79f382601.\n\nChange-Id: I22553e4e77662736b8b453d911a2f4e601f3a27e\n" }, { "commit": "45ec0967f1ac09d223e94267c0004dc08670792e", "tree": "bba7deec82b9f7808eff253e2c1177818f9dd918", "parents": [ "c54ec90cc3c7570be2a5a64717cd10c817e246c7", "884e54c8a45e49b58cb1127c8ed890f79f382601" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Fri Jan 22 10:44:39 2016 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Fri Jan 22 10:44:39 2016 +0000" }, "message": "Merge \"Revert \"Revert \"Change condition to opposite if lhs is constant\"\"\"" }, { "commit": "884e54c8a45e49b58cb1127c8ed890f79f382601", "tree": "0be051a729b2f2674c3148d8734e5520713ad546", "parents": [ "a05cacc11fa075246c38497c01b949745fadc54b" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Fri Jan 22 08:59:04 2016 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Fri Jan 22 08:59:04 2016 +0000" }, "message": "Revert \"Revert \"Change condition to opposite if lhs is constant\"\"\n\nThis reverts commit a05cacc11fa075246c38497c01b949745fadc54b.\n\nChange-Id: Ifdc261fd4dfb2c538017fe1d69af723aafd4afef\n" }, { "commit": "6de1938e562b0d06e462512dd806166e754035ea", "tree": "f9df086a73860c20768d17ff7bc5be4139567941", "parents": [ "f5b84ee14a3bc578f799a39dca1ae512b49356ea" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Fri Jan 08 17:37:10 2016 +0000" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Thu Jan 14 16:22:13 2016 +0000" }, "message": "ART: Remove incorrect HFakeString optimization\n\nSimplification of HFakeString assumes that it cannot be used until\nString.\u003cinit\u003e is called which is not true and causes different\nbehaviour between the compiler and the interpreter. This patch\nremoves the optimization together with the HFakeString instruction.\n\nInstead, HNewInstance is generated and an empty String allocated\nuntil it is replaced with the result of the StringFactory call. This\nis consistent with the behaviour of the interpreter but is too\nconservative. A follow-up CL will attempt to optimize out the initial\nallocation when possible.\n\nBug: 26457745\nBug: 26486014\n\nChange-Id: I7139e37ed00a880715bfc234896a930fde670c44\n" }, { "commit": "a05cacc11fa075246c38497c01b949745fadc54b", "tree": "8ffb80498cd8fdff66a4ab272723cf4d4e69e57b", "parents": [ "f9f196c55f3b25c3b09350cd8ed5d7ead31f1757" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Jan 12 14:00:24 2016 +0000" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Jan 12 14:00:24 2016 +0000" }, "message": "Revert \"Change condition to opposite if lhs is constant\"\n\nBreaks arm64\n\nThis reverts commit f9f196c55f3b25c3b09350cd8ed5d7ead31f1757.\n\nChange-Id: Ie1027a218154b8ded6c1c8f0007720f5be68780d\n" }, { "commit": "f9f196c55f3b25c3b09350cd8ed5d7ead31f1757", "tree": "0be051a729b2f2674c3148d8734e5520713ad546", "parents": [ "c3ba07ef76549129705af28173070b88a1c39531" ], "author": { "name": "Anton Shamin", "email": "anton.shamin@intel.com", "time": "Tue Sep 08 17:33:16 2015 +0600" }, "committer": { "name": "Anton Shamin", "email": "anton.shamin@intel.com", "time": "Tue Jan 12 13:07:06 2016 +0000" }, "message": "Change condition to opposite if lhs is constant\n\nSwap operands if lhs is constant. Handeled unsigned comparison\nin insruction simplifier. Fixed NaN comparison: no matter what\nbias is set result of Equal and NotEqual operations should not\ndepend on it. Added checker tests.\n\nChange-Id: I5a9ac25fb10f2705127a52534867cee43368ed1b\nSigned-off-by: Anton Shamin \u003canton.shamin@intel.com\u003e\nSigned-off-by: Serguei Katkov \u003cserguei.i.katkov@intel.com\u003e\n" }, { "commit": "92d9060c0cdff7c726549a9d9494e5655404bed7", "tree": "22c1274193e7f1a3bd9872a2455c758394587dee", "parents": [ "376a6f3dbae7b71a6fc2c339ec416d3407277308" ], "author": { "name": "Alexey Frunze", "email": "Alexey.Frunze@imgtec.com", "time": "Fri Dec 18 18:16:36 2015 -0800" }, "committer": { "name": "Alexey Frunze", "email": "Alexey.Frunze@imgtec.com", "time": "Mon Jan 04 20:53:44 2016 -0800" }, "message": "MIPS: Implement HRor\n\nThis also fixes differentiation between the SRL and ROTR\ninstructions in the disassembler.\n\nChange-Id: Ie19697f8d6ea8fa4e338adde3e3cf8e4a0383eae\n" }, { "commit": "299a93993fb8f3efbf0465cf674d80c3bcfdc66c", "tree": "1ba8d1cd2a34091317af08cbbe5cfa3fa52e549f", "parents": [ "fae1db92d8433d0f75258c190bcf2c940731f036" ], "author": { "name": "Alexey Frunze", "email": "Alexey.Frunze@imgtec.com", "time": "Tue Dec 08 16:08:02 2015 -0800" }, "committer": { "name": "Alexey Frunze", "email": "Alexey.Frunze@imgtec.com", "time": "Thu Dec 17 14:14:26 2015 -0800" }, "message": "MIPS64: Fuse long and FP compare \u0026 condition in Optimizing.\n\nBug: 25559148\n\nChange-Id: I2d14ac75460a76848c71c08cffff6d7a18f5f580\n" }, { "commit": "cd7b0ee296b0462961c63e51d99c9c323e2690df", "tree": "57a9071635389e58a8912d98b99d7e114c1efcc6", "parents": [ "0bbc1727c446ee5f4cc3c28e68127164ef379594" ], "author": { "name": "Alexey Frunze", "email": "Alexey.Frunze@imgtec.com", "time": "Thu Dec 03 16:46:38 2015 -0800" }, "committer": { "name": "Alexey Frunze", "email": "Alexey.Frunze@imgtec.com", "time": "Tue Dec 15 14:29:48 2015 -0800" }, "message": "MIPS32: Fuse long and FP compare \u0026 condition in Optimizing.\n\nThis also does a minor clean-up in the assembler and\nits test.\n\nBug: 25559148\nChange-Id: I9bad3c500b592a09013b56745f70752eb284a842\n" }, { "commit": "351dddf4025f07477161209e374741f089d97cb4", "tree": "d35406fe1e975369acf8f103d0ad5e0cf2313431", "parents": [ "58dcb021c3bd45718d0103844f4e6d55754e6501" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Dec 11 16:34:46 2015 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Dec 11 16:54:42 2015 +0000" }, "message": "Optimizing: Clean up after HRor.\n\nChange-Id: I96bd7fa2e8bdccb87a3380d063dad0dd57fed9d7\n" }, { "commit": "40a04bf64e5837fa48aceaffe970c9984c94084a", "tree": "27aeff3b9492b396050155734d81aba3c57ffbb7", "parents": [ "763fd2d3d131898cad6295a19ae9a30e22ce5f2a" ], "author": { "name": "Scott Wakeling", "email": "scott.wakeling@linaro.org", "time": "Fri Dec 11 09:50:36 2015 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Dec 11 16:13:44 2015 +0000" }, "message": "Replace rotate patterns and invokes with HRor IR.\n\nReplace constant and register version bitfield rotate patterns, and\nrotateRight/Left intrinsic invokes, with new HRor IR.\n\nWhere k is constant and r is a register, with the UShr and Shl on\neither side of a |, +, or ^, the following patterns are replaced:\n\n x \u003e\u003e\u003e #k OP x \u003c\u003c #(reg_size - k)\n x \u003e\u003e\u003e #k OP x \u003c\u003c #-k\n\n x \u003e\u003e\u003e r OP x \u003c\u003c (#reg_size - r)\n x \u003e\u003e\u003e (#reg_size - r) OP x \u003c\u003c r\n\n x \u003e\u003e\u003e r OP x \u003c\u003c -r\n x \u003e\u003e\u003e -r OP x \u003c\u003c r\n\nImplemented for ARM/ARM64 \u0026 X86/X86_64.\n\nTests changed to not be inlined to prevent optimization from folding\nthem out. Additional tests added for constant rotate amounts.\n\nChange-Id: I5847d104c0a0348e5792be6c5072ce5090ca2c34\n" }, { "commit": "f180af0fc0d0bd981dd6356848df2ba237e1a227", "tree": "bea248023c5823bbb28a1864655e3afce9226400", "parents": [ "97cd5bb34ca97e7e87a030b2e1acec004fd26275", "f9d741e32c6f1629ce70eefc68d3363fa1cfd696" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon Nov 23 11:20:35 2015 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Mon Nov 23 11:20:35 2015 +0000" }, "message": "Merge \"Optimizing/ARM: Improve long shifts by 1.\"" }, { "commit": "f652917de5634b30c974c81d35a72871915b352a", "tree": "c50bcaf37c246df633d42a166334c9b6332e5394", "parents": [ "60c4c6ad2b892bb00a6016a147b1cc089ba6bcb5" ], "author": { "name": "Mark Mendell", "email": "mark.p.mendell@intel.com", "time": "Tue Nov 17 11:16:56 2015 -0500" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Fri Nov 20 16:48:04 2015 +0000" }, "message": "Simplify boolean condition compared to 0\n\nCaffeineMarkRR Logic has some boolean flipping which can be helped by\nsome simplification.\n\nSimplify non-FP (A COND_OP B) !\u003d 0 to A OPPOSITE_COND_OP B.\nThis is better than the original code, which would use a HBooleanNot\nafter the condition.\n\nAlso simplify non-FP (A COND_OP B) \u003d\u003d 1 to A OPPOSITE_COND_OP B.\n\nMove GetOppositeCondition to nodes.h/nodes.cc to share with Boolean\nSimplification, renaming it to InsertOppositeCondition, as it inserts\nthe new HInstruction (unless it is a constant).\n\nChange-Id: I34ded7758836e375de0d6fdba9239d2d451928d0\nSigned-off-by: Mark Mendell \u003cmark.p.mendell@intel.com\u003e\n" }, { "commit": "f9d741e32c6f1629ce70eefc68d3363fa1cfd696", "tree": "409005e5b1d01d2830c20421f8466125e110d6af", "parents": [ "beb709a2607a00b5df33f0235f22ccdd876cee22" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Nov 20 15:08:11 2015 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Nov 20 16:18:39 2015 +0000" }, "message": "Optimizing/ARM: Improve long shifts by 1.\n\nImplement long\n Shl(x,1) as LSLS+ADC,\n Shr(x,1) as ASR+RRX and\n UShr(x,1) as LSR+RRX.\n\nRemove the simplification substituting Shl(x,1) with\nADD(x,x) as it interferes with some other optimizations\ninstead of helping them. And since it didn\u0027t help 64-bit\narchitectures anyway, codegen is the correct place for it.\nThis is now implemented for ARM and x86, so only mips32 can\nbe improved.\n\nChange-Id: Idd14f23292198b2260189e1497ca5411b21743b3\n" }, { "commit": "38db785600757a832423e076b3cf0af3bee942d8", "tree": "420b802e0e8e8e02e6bea03808ef8f7aa7850719", "parents": [ "53ced034cd81f35ea9b37ca977cf6634ddaa7cf9" ], "author": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Fri Nov 20 15:02:45 2015 +0000" }, "committer": { "name": "Alexandre Rames", "email": "alexandre.rames@linaro.org", "time": "Fri Nov 20 15:02:45 2015 +0000" }, "message": "Opt compiler: More strength reduction for multiplications.\n\nWe transform code looking like\n\n MUL dst, src, (2^n + 1)\n\ninto\n\n SHL tmp, src, n\n ADD dst, src, tmp\n\nand code looking like\n\n MUL dst, src, (2^n - 1)\n\ninto\n\n SHL tmp, src, n\n SUB dst, tmp, src\n\nChange-Id: Ia620ab68758caa70a01530b88cd65dd0444376d7\n" }, { "commit": "f652cecb984c104d44a0223c3c98400ef8ed8ce2", "tree": "ec0cc193eccdd11a79f42f957a856d2ba57699e1", "parents": [ "b8b44983f861cfeeca66c624dd0f2a3fa71b4992" ], "author": { "name": "Goran Jakovljevic", "email": "Goran.Jakovljevic@imgtec.com", "time": "Tue Aug 25 16:11:42 2015 +0200" }, "committer": { "name": "Goran Jakovljevic", "email": "Goran.Jakovljevic@imgtec.com", "time": "Thu Oct 22 18:51:13 2015 +0200" }, "message": "MIPS: Initial version of optimizing compiler for MIPS32\n\nChange-Id: I370388e8d5de52c7001552b513877ef5833aa621\n" }, { "commit": "bb245d199a5240b4c520263fd2c8c10dba79eadc", "tree": "e16b37485e3e0e34c24e35a71cc8e6986d1e2e70", "parents": [ "d5a69fc429f57bf528aa061618d3ae94ee8deb24" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Oct 19 11:05:03 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Oct 19 11:12:11 2015 -0700" }, "message": "Generalize codegen and simplification of deopt.\n\nRationale: the de-opt instruction is very similar to an if,\n so the existing assumption that it always has a\n conditional \"under the hood\" is very unsafe, since\n optimizations may have replaced conditionals with\n actual values; this CL generalizes handling of deopt.\n\nChange-Id: I1c6cb71fdad2af869fa4714b38417dceed676459\n" }, { "commit": "d5a69fc429f57bf528aa061618d3ae94ee8deb24", "tree": "1a00f22b320afe53c7c02320e78f1a0e538ee5d0", "parents": [ "bdbce4e321b16a14425659fabaa5648f52853d51", "e9f37600e98ba21308ad4f70d9d68cf6c057bdbe" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Oct 15 16:18:05 2015 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Thu Oct 15 16:18:05 2015 +0000" }, "message": "Merge \"Added support for unsigned comparisons\"" }, { "commit": "e9f37600e98ba21308ad4f70d9d68cf6c057bdbe", "tree": "ad7953f41a35eeee68a31b4b567a08c650647bba", "parents": [ "793e6fbdefb092d1dab50bca5618aed110c7e037" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Oct 09 11:15:55 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Oct 14 13:38:22 2015 -0700" }, "message": "Added support for unsigned comparisons\n\nRationale: even though not directly supported in input graph,\n having the ability to express unsigned comparisons\n in HIR is useful for all sorts of optimizations.\n\nChange-Id: I4543c96a8c1895c3d33aaf85685afbf80fe27d72\n" }, { "commit": "439ffb8d4fa25b4ac7518a3bd5cbc3f3769ead48", "tree": "1c4957e89dcd48ac197d06c43e5ee0d9a77d5b5e", "parents": [ "5021883b95d2637f9cc6b4f2c5cf305730e864df", "ee3cf0731d0ef0787bc2947c8e3ca432b513956b" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Oct 12 12:47:06 2015 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Mon Oct 12 12:47:06 2015 +0000" }, "message": "Merge \"Intrinsify System.arraycopy.\"" }, { "commit": "ee3cf0731d0ef0787bc2947c8e3ca432b513956b", "tree": "4146f2c830bdbacdad941e06a0f5979350fe05ad", "parents": [ "5928931541e07b4c98e677cfca3088106b2b9e64" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Oct 06 11:45:02 2015 +0100" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Oct 12 12:16:40 2015 +0100" }, "message": "Intrinsify System.arraycopy.\n\nCurrently on x64, will do the other architectures in\ndifferent changes.\n\nChange-Id: I15fbbadb450dd21787809759a8b14b21b1e42624\n" }, { "commit": "e53fb5582f8f6ece5d0ce3b9c0d5b1cdb654b254", "tree": "c2a31c6b7e3a67255ebcb23cb75ed94278222c46", "parents": [ "09b1d6f749437bdd47f61e7c4f924f6d16b59536" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Wed Oct 07 17:51:52 2015 +0100" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Wed Oct 07 19:13:12 2015 +0100" }, "message": "Don\u0027t remove type checks if we need to perform an access check.\n\nChange-Id: I9b9e07c7524e96ece8dc089c8379631c2f9e3320\n" }, { "commit": "d6ace609ef3c5d37ea4d980a2aaa3a9c31943d3b", "tree": "05e1eca15d908e03233cbf819ba04a26f1497721", "parents": [ "ce18a7f16166dd525dfcf6afaca567d7e82dba0a", "a83a54d7f2322060f08480f8aabac5eb07268912" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Oct 07 09:51:07 2015 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Wed Oct 07 09:51:07 2015 +0000" }, "message": "Merge \"Add support for intrinsic optimizations.\"" }, { "commit": "a83a54d7f2322060f08480f8aabac5eb07268912", "tree": "67b7ecc4d35e7f5cb59f81c3d021fd6e1c10545f", "parents": [ "cc245eab2148547f9df37ddc5f767656dc033b81" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Fri Oct 02 17:30:26 2015 +0100" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Oct 07 10:50:24 2015 +0100" }, "message": "Add support for intrinsic optimizations.\n\nChange-Id: Ib5a4224022f9360e60c09a19ac8642270a7f3b64\n" }, { "commit": "98893e146b0ff0e1fd1d7c29252f1d1e75a163f2", "tree": "a14bb10d039fcee10a7e0cacb494bb60d08b2039", "parents": [ "7b5c395e9a50f988ca2275a429df17b6abbcc475" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Fri Oct 02 21:05:03 2015 +0100" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Tue Oct 06 13:42:55 2015 +0100" }, "message": "Add support for unresolved classes in optimizing.\n\nChange-Id: I0e299a81e560eb9cb0737ec46125dffc99333b54\n" }, { "commit": "e0395dd58454e27fc47c0ca273913929fb658e6c", "tree": "a43acfddd08fe55858b752860b05a3e0a035777f", "parents": [ "6387821209a03c5d873cf9dc6fd11434918bbdf4" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Fri Sep 25 11:04:45 2015 +0100" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Sep 30 18:32:01 2015 +0100" }, "message": "Optimize ArraySet for x86/x64/arm/arm64.\n\nChange-Id: I5bc8c6adf7f82f3b211f0c21067f5bb54dd0c040\n" }, { "commit": "f6860a5f12a8fe974b8f25e67a19a71bf0378d62", "tree": "040cb5be85ad86a6e1e87be7bedb3de70eb0f6d0", "parents": [ "a2d8b187e7b6631692fa1243e86ef16c428fa9da", "452c1b60120aee0883c3339b363f820b8d69c299" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Sep 29 16:33:44 2015 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Tue Sep 29 16:33:44 2015 +0000" }, "message": "Merge \"Optimizing: Simplify UShr+And, Shr+And.\"" }, { "commit": "452c1b60120aee0883c3339b363f820b8d69c299", "tree": "78d0c7134064446dadd86407d353769b939d64f0", "parents": [ "ec7e44f7afe0ff48d4d1ae54a12d375e0392d24c" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Sep 25 14:44:17 2015 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Sep 29 13:40:06 2015 +0100" }, "message": "Optimizing: Simplify UShr+And, Shr+And.\n\nEliminate And from UShr+And if the And-mask contains all the\nbits that can be non-zero after UShr. Transform Shr+And to\nUShr if the And-mask precisely clears the shifted-in sign\nbits.\n\nThis prepares for detecting the Rotate pattern, i.e.\n (x \u003c\u003c N) | (x \u003e\u003e\u003e (SIZE - N))\nin code that unnecessarily masks the UShr, for example\n (x \u003c\u003c 1) | ((x \u003e\u003e\u003e 31) \u0026 1) ,\nor uses Shr, for example\n (x \u003c\u003c 8) | ((x \u003e\u003e 24) \u0026 0xff) .\n\nChange-Id: I684c4b752547d9b1057d0d4c4d44550bb1a3ffb4\n" }, { "commit": "6e7455e90411c77088af5fcbf828219842bd2182", "tree": "739174a530e18aebcc9ebedba906c1de4e541234", "parents": [ "85e5207ef094f99081539333bd868ce721c6fd73" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon Sep 28 16:25:37 2015 +0100" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue Sep 29 10:01:07 2015 +0100" }, "message": "Use dominance information for null optimization in write barrier.\n\nChange-Id: I8b57dafcd321c9afa1bbfc6a0674cbea15cbf10c\n" }, { "commit": "aae9e66a727756bc965121a60ffcef89ed370e6c", "tree": "871d86b73428f998e1099135118c515e3f623fb4", "parents": [ "772cc4a2d4f978888d1b1e5a78c1c16a108260ed" ], "author": { "name": "Serdjuk, Nikolay Y", "email": "nikolay.y.serdjuk@intel.com", "time": "Fri Aug 21 13:26:34 2015 +0600" }, "committer": { "name": "Serdjuk, Nikolay Y", "email": "nikolay.y.serdjuk@intel.com", "time": "Thu Aug 27 10:05:38 2015 +0600" }, "message": "ART: Fix the simplifier for NEGATE add/sub\n\nInstruction simplifier for negate add/sub should not proceed\nwith floats because that might cause the incorrect behavior\nwith signed zero.\n\nChange-Id: I4970694a2b265a3577cde34fee9cd3a437358c0f\n" }, { "commit": "efa8468c78fdd808043dfb664b56541f3f2dd0e8", "tree": "eeec64ba00456b737b43eaf3d9e61f04fafdfa95", "parents": [ "6a6bd17f68c02139630796a615bd38b929c02e7a" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Aug 12 18:28:14 2015 -0700" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed Aug 12 18:32:54 2015 -0700" }, "message": "Small optimization improvements.\n\n- Tune CanBeNull for HBoundType.\n- Remove LoadClass when we know the class is loaded.\n- Tune CanBeNull for StringInit.\n\nChange-Id: I564ed33a506d65e991a514342bdfd1610bed0cf5\n" }, { "commit": "115b53f609e74672fa93eea1845bb17340d5112a", "tree": "a791ed8bcd97c5a97c329e4dc708604e1defed4b", "parents": [ "1339409345cc8b46d64570430ca3197408fda159" ], "author": { "name": "Serguei Katkov", "email": "serguei.i.katkov@intel.com", "time": "Wed Aug 05 17:03:30 2015 +0600" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Thu Aug 06 18:22:02 2015 +0100" }, "message": "ART: Fix the simplifier for add/sub\n\nInstruction simplifier for add/sub should not proceed with floats\nbecause that might cause the incorrect behavior with signed zero.\n\nChange-Id: If0c9bf3931bcbf96b0814f8605a86997aea37145\nSigned-off-by: Serguei Katkov \u003cserguei.i.katkov@intel.com\u003e\n" }, { "commit": "2e76830f0b3f23825677436c0633714402715099", "tree": "71bd6bd7d327ff3ef8a46af2a7514c5434adb5fd", "parents": [ "a5ae3c3f468ffe3a317b498d7fde1f8e9325346a" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Tue Jul 28 14:41:11 2015 +0000" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Wed Jul 29 17:08:28 2015 +0100" }, "message": "Revert \"Revert \"Revert \"Revert \"Use the object class as top in reference type propagation\"\"\"\"\n\nThis reverts commit b734808d0c93af98ec4e3539fdb0a8c0787263b0.\n\nChange-Id: Ifd925f166761bcb9be2268ff0fc9fa3a72f00c6f\n" }, { "commit": "b734808d0c93af98ec4e3539fdb0a8c0787263b0", "tree": "a9a0a67143d5af9c375dbb9db9d874b61586f7e1", "parents": [ "80caa1478cf3df4eac1214d8a63a4da6f4fe622b" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Tue Jul 28 11:52:02 2015 +0000" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Tue Jul 28 11:52:02 2015 +0000" }, "message": "Revert \"Revert \"Revert \"Use the object class as top in reference type propagation\"\"\"\n\nThis reverts commit 80caa1478cf3df4eac1214d8a63a4da6f4fe622b.\n\nChange-Id: I63b51ca418b19b2bfb5ede3f8444f8fbeb8a339d\n" }, { "commit": "80caa1478cf3df4eac1214d8a63a4da6f4fe622b", "tree": "131652877e34099711e7d9fc4f1d840b99d1b5d3", "parents": [ "00e3b38be4b280d6d7a7e843cd336ffbd2ba4365" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Thu Jul 16 16:51:30 2015 +0100" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Mon Jul 27 19:51:48 2015 +0100" }, "message": "Revert \"Revert \"Use the object class as top in reference type propagation\"\"\n\nThis reverts commit 7733bd644ac71f86d4b30a319624b23343882e53.\n\nChange-Id: I7d393a808c01c084c18d632a54e0554b4b455f2c\n" }, { "commit": "7733bd644ac71f86d4b30a319624b23343882e53", "tree": "7f897d8b0545e43da6b6059718685a8e396b3b70", "parents": [ "3fabec7a25d151b26ba7de13615bbead0dd615a6" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Wed Jul 22 17:14:50 2015 +0000" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Wed Jul 22 17:14:50 2015 +0000" }, "message": "Revert \"Use the object class as top in reference type propagation\"\n\nThis reverts commit 3fabec7a25d151b26ba7de13615bbead0dd615a6.\n\nChange-Id: Id8614f6b6e3e0e4c9caeb9f771e4c145d9fec64f\n" }, { "commit": "3fabec7a25d151b26ba7de13615bbead0dd615a6", "tree": "a73af9489665d5b033e961d1aafe7e0935c8af85", "parents": [ "b0d5fc0ac139da4aaa1440263416b9bde05630b0" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Thu Jul 16 16:51:30 2015 +0100" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Tue Jul 21 14:33:42 2015 +0100" }, "message": "Use the object class as top in reference type propagation\n\nThis properly types all instructions, making it safe to query the type\nat any time.\n\nThis also moves a few functions from class.h to class-inl.h to please\ngcc linker when compiling for target.\n\nChange-Id: I6b7ce965c10834c994b95529ab65a548515b4406\n" }, { "commit": "d1665b7a689086ec5b33a69a05313c46ea1a95e4", "tree": "1d46845e8c5734683077357bf18743d5eec466e2", "parents": [ "c6f3439b67962584cfb764133e192c3317f0e1fc", "7f63c52c8e94ed1340b7a1d04b046ff12819d2bc" ], "author": { "name": "Roland Levillain", "email": "rpl@google.com", "time": "Tue Jul 14 09:25:42 2015 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Tue Jul 14 09:25:43 2015 +0000" }, "message": "Merge \"Revert \"Revert \"Fuse long and FP compare \u0026 condition on ARM64 in Optimizing.\"\"\"" } ], "next": "7f63c52c8e94ed1340b7a1d04b046ff12819d2bc" }