)]}' { "log": [ { "commit": "5573c37e795668eca81a8488078f798d977685c3", "tree": "5e7675d6c1ca9ed1c31834e52282bfb9f73dc2a4", "parents": [ "1598a77ca3559c8a59902f26ee887504b8159859" ], "author": { "name": "Igor Murashkin", "email": "iam@google.com", "time": "Thu Nov 16 13:34:30 2017 -0800" }, "committer": { "name": "Igor Murashkin", "email": "iam@google.com", "time": "Thu Nov 16 14:42:49 2017 -0800" }, "message": "cpplint: Remove many unnecessary NOLINT\n\nNow that we updated to upstream cpplint, a lot of these NOLINTs are no\nlonger necessary.\n\nBug: 68951293\nChange-Id: If8ed5ffe89727f313f907a214b6d8fd2a2eddbad\n" }, { "commit": "2ffb703bf431d74326c88266b4ddaf225eb3c6ad", "tree": "0552c3c76a42b18f9e7460d501fb71a6dc2e7f33", "parents": [ "c4b6f3116f15c8e4fdf2e4f604ababdee12d8923" ], "author": { "name": "Igor Murashkin", "email": "iam@google.com", "time": "Wed Nov 08 13:35:21 2017 -0800" }, "committer": { "name": "Igor Murashkin", "email": "iam@google.com", "time": "Wed Nov 08 15:15:52 2017 -0800" }, "message": "cpplint: Cleanup errors\n\nCleanup errors from upstream cpplint in preparation\nfor moving art\u0027s cpplint fork to upstream tip-of-tree cpplint.\n\nTest: cd art \u0026\u0026 mm\nBug: 68951293\nChange-Id: I15faed4594cbcb8399850f8bdee39d42c0c5b956\n" }, { "commit": "ca6fff898afcb62491458ae8bcd428bfb3043da1", "tree": "195a6b16d3a4b34acc2faf91ce56f448efb15e07", "parents": [ "aa7273e56fbafc2692c8d20a31b50d2f4bdd2aa1" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue Oct 03 14:49:14 2017 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Oct 06 17:53:50 2017 +0100" }, "message": "ART: Use ScopedArenaAllocator for pass-local data.\n\nPasses using local ArenaAllocator were hiding their memory\nusage from the allocation counting, making it difficult to\ntrack down where memory was used. Using ScopedArenaAllocator\nreveals the memory usage.\n\nThis changes the HGraph constructor which requires a lot of\nchanges in tests. Refactor these tests to limit the amount\nof work needed the next time we change that constructor.\n\nTest: m test-art-host-gtest\nTest: testrunner.py --host\nTest: Build with kArenaAllocatorCountAllocations \u003d true.\nBug: 64312607\nChange-Id: I34939e4086b500d6e827ff3ef2211d1a421ac91a\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": "d9911eeca13f609c885e0f6a5ce81af9b6340bfa", "tree": "f850510643ee120dba140bf0bb3e1c1b9c9ce4db", "parents": [ "46bfb7c047a590ac5c24b658f31c170631556bb6" ], "author": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Mon Mar 27 13:27:24 2017 -0700" }, "committer": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Mon Mar 27 13:53:48 2017 -0700" }, "message": "ART: Clean up field initialization\n\nAdd explicit field initialization to default value where necessary.\nAlso clean up interpreter intrinsics header.\n\nTest: m\nChange-Id: I7a850ac30dcccfb523a5569fb8400b9ac892c8e5\n" }, { "commit": "e6bd0272b43bf73faabc64abc9c51ab8ed128308", "tree": "d75a15baadf77a859cec6540d7cd10ce998e955a", "parents": [ "2c43590dc2bb7fb4a3a015b1b65543bb8705ffe8" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Dec 16 13:57:52 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Dec 19 10:57:37 2016 -0800" }, "message": "Improved induction var and range analysis around types.\n\nRationale:\nLots of code should not depend on int only. This CL generalizes\nthe kinds of types that can be optimized after analysis. As part\nof the CL, however, a minor cleanup regarding type safety of the\nstored induction var analysis results is required. This further\nimproved our int benchmark, and brings the long benchmark up-to-par.\n\nTest: m test-art-host-run-test\nChange-Id: I5dfb623dabf9113de90c2f6da99328dda8f8b60b\n" }, { "commit": "d0a022d76db4b79d105608e7bafab4c17e8ba510", "tree": "28fe73f251041ea8dd2ddfbb801d780fbce6968c", "parents": [ "ea63e4d1c3473d1115c1aef674056d035cf67472" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Tue Dec 13 11:22:31 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Dec 15 11:31:12 2016 -0800" }, "message": "Fine tuning the induction analysis.\n\nRationale:\nBased on some self-imposed \"blind\" testing, improved\nthe induction variable analysis for typical cases\nthat provide a bit more elaborate HIR.\n\nTest: test-art-host\nChange-Id: I6e6bbf99928c29973178fa48f3942b14bf069944\n" }, { "commit": "df7822ecf033cecf48d950f3ae34f7043c8df738", "tree": "f392a69377e1e281bcd85d811b656c6d14280ab4", "parents": [ "6746874b84a44ab8dff18457eec546a1ebb22e93" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Tue Dec 06 10:05:30 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Dec 09 08:42:18 2016 -0800" }, "message": "Added polynomial induction variables analysis. With tests.\n\nRationale:\nInformation on polynomial sequences is nice to further enhance\nBCE and last-value assignment. In this case, this CL enables more\nloop optimizations for benchpress\u0027 Sum (80 x speedup). Also\nchanged rem-based geometric induction to wrap-around induction.\n\nTest: test-art-host\n\nChange-Id: Ie4d2659edefb814edda2c971c1f70ba400c31111\n" }, { "commit": "c071a01a26013ab6e3dbfc4131efa95a65aeb4ed", "tree": "bbe75527b8ee94483e4d797c6b2372adaabd81cf", "parents": [ "5eb1e1e7341f4e7febf77c04f8649a9566b31c03" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Dec 01 10:22:31 2016 -0800" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Dec 05 16:16:42 2016 -0800" }, "message": "Added geometric induction variables analysis.\n\nRationale:\nInformation on geometric and polynomial (coming soon) sequences\nare nice to have to further enhance BCE and last-value assignment.\n\nTest: test-art-host\nChange-Id: Ib5e2998c3eb1009def6fd00b82935da7c3ba7c6e\n" }, { "commit": "a5b09a67034e57a6e10231dd4bd92f4cb50b824c", "tree": "304be738f4fa528b7ad2676103eecc84c79eaeeb", "parents": [ "dac7ad17c78387d15d7aefae0f852dddf5f37e34" ], "author": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Thu Nov 17 15:21:22 2016 -0800" }, "committer": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Mon Nov 21 10:57:00 2016 -0800" }, "message": "ART: Add dex::TypeIndex\n\nAdd abstraction for uint16_t type index.\n\nTest: m test-art-host\nChange-Id: I47708741c7c579cbbe59ab723c1e31c5fe71f83a\n" }, { "commit": "cc42be074ed15235426cdbcb34f357ead2be2caf", "tree": "d0ac4dca432e1bb26e21634f21ffc3e05db5020e", "parents": [ "a8188191477b7b5b01a3c4426c51c48cd55f6678" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Oct 20 16:14:16 2016 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Oct 24 12:55:48 2016 -0700" }, "message": "Improved induction variable analysis and loop optimizations.\n\nRationale:\nRather than half-baked reconstructing cycles during loop optimizations,\nthis CL passes the SCC computed during induction variable analysis\nto the loop optimizer (trading some memory for more optimizations).\nThis further improves CaffeineLogic from 6000us down to 4200us (dx)\nand 2200us to 1690us (jack). Note that this is on top of prior\nimprovements in previous CLs. Also, some narrowing type concerns\nare taken care of during transfer operations.\n\nTest: test-art-host\nChange-Id: Ice2764811a70073c5014b3a05fb51f39fd2f4c3c\n" }, { "commit": "639cc8c7bbb7d8c341173bcf24604ccb4328acb8", "tree": "ae8181b94ddd145edaff141a2b351478161f1559", "parents": [ "3941c882ea7b54772dec36a9a1b33e0b8a7474f7" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Tue Oct 18 13:03:31 2016 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Oct 20 14:14:17 2016 -0700" }, "message": "Improve recognition of select-based period induction.\n\nRationale:\nSimilar to the previous CL, this helps to eliminate more dead induction.\nNow, CaffeineLogic, when compiled with dx (rather than jack) improves\nby a 1.5 speedup (9000us -\u003e 6000us).\n\nNote:\nWe need to run the simplifier before induction analysis to trigger\nthe select simplification first. Although a bit of a compile-time hit,\nit seems a good idea to run a simplifier here again anyway.\n\nTest: test-art-host\nChange-Id: I93b91ca40a4d64385c64393028e8d213f0c904a8\n" }, { "commit": "7dc96932491dde6b5b58998254d5837dbcbbde03", "tree": "b2b0c7a133738823eb61871e5482aa657f2f8a2a", "parents": [ "f0ab2ec6008bbd495e59bb9bf81ac399d864f38b" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Oct 12 10:01:05 2016 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Oct 12 14:10:11 2016 -0700" }, "message": "Recognize XOR-based periodic induction.\n\nRationale:\nThis is a commonly used construct (e.g. x \u003d !x for booleans\nand x ^\u003d 1 for integers). This CL prepares some upcoming\noptimizations that exploit such inductions.\n\nChange-Id: I46edffb9de1075a836995daf5c2dfff7891f3034\nTest: 530-checker-loops2 and induction_var_analysis_test\n" }, { "commit": "009cace65f649000e46a33db26d14b2af8b5aee4", "tree": "47d32693b615e35b3cb60ddd54a47e18cccf8200", "parents": [ "be3a3ee02f148345ba6e1a0361532a3f7e8c0002" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Sep 16 10:15:19 2016 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Sep 16 14:33:00 2016 -0700" }, "message": "Minor induction variable analysis changes.\n\nRationale:\nFew extra comments, added replacement of loop control functionality.\nAll in preparation of bigger loop optimizations CL.\n\nChange-Id: Ie2243c3c8b57b2901654b05fb200e9d80a0cb641\nTest: test-art\n" }, { "commit": "7829691e27c528ca52753dd98bcb4785e328388a", "tree": "5bbb034b0795a0533ce6da6cd83f44c66f36caac", "parents": [ "b0b38596a4f28725b71f17e13c7b544d926f0d3e" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Mar 25 13:14:53 2016 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Mar 25 15:35:21 2016 -0700" }, "message": "Fix bug not accounting for type in induction comparison.\nExtended unit tests.\n\nRationale:\nNow that inductions are typed, comparisons should take\nthe type into account as well.\n\nChange-Id: Ie533bb728d2006390646657573fa743e6fc37ff2\n" }, { "commit": "0d345cf8db01f40db250f80de5104e0df24234fa", "tree": "ebeac7adff399e908e5dcd3c855505ed02fe72b8", "parents": [ "4485c6964ad414d5c6d0535622cfad1c0a6b640f" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Mar 16 10:49:38 2016 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Mar 21 12:53:33 2016 -0700" }, "message": "Generalize induction and range analysis across type conversions.\n\nRationale:\nThis changelist implements allowing narrowing conversions within\ninductions and loop control. More induction and loops recognized,\nmore bounds eliminated. We all win. The basic idea is pretty simple\n(record type with detected induction) but one has to get all the\ndetails right, as illustrated by the many new unit tests.\n\nBUG\u003d27151098\n\nChange-Id: I254020bfa5fa623799b31bbbb5ccc97d4d5a0100\n" }, { "commit": "6dd10fa29e47d9041f5dee85a43a9615299e22c2", "tree": "88c26fc6047199fc3aeda0e0adb9661ed65d384b", "parents": [ "26962cc2a1e773e99c1711bef9b36e199fdc8989" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Mon Feb 15 17:14:31 2016 +0000" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Mon Feb 15 17:14:40 2016 +0000" }, "message": "Fix lint error\n\nChange-Id: I6f7785abece7ead31b4737fc6b54712c26582e2b\n" }, { "commit": "badd826664896d4a9628a5a89b78016894aa414b", "tree": "a30e8b3e62126ae1e1df1152ac643cfc5f2b074a", "parents": [ "47a2a45a6673ddf3322115ff5058763f82a9368f" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Tue Feb 02 16:28:56 2016 +0000" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Mon Feb 15 10:21:07 2016 +0000" }, "message": "ART: Run SsaBuilder from HGraphBuilder\n\nFirst step towards merging the two passes, which will later result in\nHGraphBuilder directly producing SSA form. This CL mostly just updates\ntests broken by not being able to inspect the pre-SSA form.\n\nUsing HLocals outside the HGraphBuilder is now deprecated.\n\nBug: 27150508\nChange-Id: I00fb6050580f409dcc5aa5b5aa3a536d6e8d759e\n" }, { "commit": "15693bfdf9fa3ec79327a77b7e10315614d716cc", "tree": "918208d60ec2a5595a2b5e42791865fefdbf9692", "parents": [ "87bafaf563d35616804dd0cc0dbde176aac87817" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Wed Dec 16 10:30:45 2015 +0000" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Wed Jan 06 12:44:42 2016 +0000" }, "message": "ART: Resolve ambiguous ArraySets\n\nJust like aget(-wide), the value operand of aput(-wide) bytecode\ninstructions can be both int/long and float/double. This patch builds\non the previous mechanism for resolving type of ArrayGets to type the\nvalues of ArraySets based on the reference type of the array.\n\nBug: 22538329\n\nChange-Id: Ic86abbb58de146692de04476b555010b6fcdd8b6\n" }, { "commit": "4833f5a1990c76bc2be89504225fb13cca22bedf", "tree": "8e096f222368f30bf821b154bc78bac12d5cd2e5", "parents": [ "bb41b250153308ef51664d7a6cc26c6a2e588fb7" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Wed Dec 16 10:37:39 2015 +0000" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Thu Dec 31 09:58:33 2015 +0000" }, "message": "ART: Refactor SsaBuilder for more precise typing info\n\nThis reverts commit 68289a531484d26214e09f1eadd9833531a3bc3c.\n\nNow uses Primitive::Is64BitType instead of Primitive::ComponentSize\nbecause it was incorrectly optimized by GCC.\n\nBug: 26208284\nBug: 24252151\nBug: 24252100\nBug: 22538329\nBug: 25786318\n\nChange-Id: Ib39f3da2b92bc5be5d76f4240a77567d82c6bebe\n" }, { "commit": "68289a531484d26214e09f1eadd9833531a3bc3c", "tree": "6f87852b9d14e479ea2c7ef92de35c3118a0fd1e", "parents": [ "bc90a0538e56f98b8e138cb622e6b9d834244ad9" ], "author": { "name": "Alex Light", "email": "allight@google.com", "time": "Tue Dec 15 17:30:30 2015 -0800" }, "committer": { "name": "Alex Light", "email": "allight@google.com", "time": "Tue Dec 15 17:40:08 2015 -0800" }, "message": "Revert \"ART: Refactor SsaBuilder for more precise typing info\"\n\nThis reverts commit d9510dfc32349eeb4f2145c801f7ba1d5bccfb12.\n\nBug: 26208284\n\nBug: 24252151\nBug: 24252100\nBug: 22538329\nBug: 25786318\n\nChange-Id: I5f491becdf076ff51d437d490405ec4e1586c010\n" }, { "commit": "d9510dfc32349eeb4f2145c801f7ba1d5bccfb12", "tree": "9f4e4ffb5fae25c4f14059fd1d772726e9d96170", "parents": [ "ceec5a3c81925cf80a18954b2e585316450c575c" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Wed Nov 04 23:30:22 2015 +0000" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Mon Dec 14 13:03:19 2015 +0000" }, "message": "ART: Refactor SsaBuilder for more precise typing info\n\nThis patch refactors the SsaBuilder to do the following:\n\n1) All phis are constructed live and marked dead if not used or proved\nto be conflicting.\n\n2) Primitive type propagation, now not a separate pass, identifies\nconflicting types and marks corresponding phis dead.\n\n3) When compiling --debuggable, DeadPhiHandling used to revive phis\nwhich had only environmental uses but did not attempt to resolve\nconflicts. This pass was removed as obsolete and is now superseded\nby primitive type propagation (identifying conflicting phis) and\nSsaDeadPhiEliminiation (keeping phis live if debuggable + env use).\n\n4) Resolving conflicts requires correct primitive type information\non all instructions. This was not the case for ArrayGet instructions\nwhich can have ambiguous types in the bytecode. To this end,\nSsaBuilder now runs reference type propagation and types ArrayGets\nfrom the type of the input array.\n\n5) With RTP being run inside the SsaBuilder, it is not necessary to\nrun it as a separate optimization pass. Optimizations can now assume\nthat all instructions of type kPrimNot have reference type info after\nSsaBuilder (with the exception of NullConstant).\n\n6) Graph now contains a reference type to be assigned to NullConstant.\nAll reference type instructions therefore have RTI, as now enforced\nby the SsaChecker.\n\nBug: 24252151\nBug: 24252100\nBug: 22538329\nBug: 25786318\n\nChange-Id: I7a3aee1ff66c82d64b4846611c547af17e91d260\n" }, { "commit": "db51efb3617d15f1cd9e5ff0cc2d934777014e9a", "tree": "fa70acb9f8d090def2cae550db8c2e1f630f31c4", "parents": [ "2649cba0fb7cdbd8fa60cb4f2fb320fb2b18ee37" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Fri Nov 06 01:36:20 2015 +0000" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Mon Nov 09 10:27:08 2015 +0000" }, "message": "ART: Fix critical edge splitting under try/catch\n\nA critical edge would not be split if the predecessor ends with\nTryBoundary. This would eventually trip liveness analysis because\na back edge block would have smaller liveness position than a nested\nloop.\n\nAnother implication of this change is that an edge between a loop\u0027s\npre-header ending with TryBoundary and the header will be split,\nguaranteeing that a pre-header always has just one successor.\n\nBug: 25493695\nBug: 25454012\nChange-Id: I5a13b8bb74509b48f5d628906f7158af007f99ae\n" }, { "commit": "22f058726d35dd8f40b3763649e61740b3d22535", "tree": "987dd5df7627c2c3e8c798089083cb797627daed", "parents": [ "3dca4c04170bb4c7b26609e55f3f4966d46b681a" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Tue Oct 27 15:56:28 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Oct 28 13:57:14 2015 -0700" }, "message": "Generate taken-test during trip-count analysis.\n\nRationale: for loops that may not be taken, this taken-test\n can be used by clients of the induction variable\n analysis to ensure trip-count evaluation is valid.\n\nChange-Id: Ia64749e2389b7224e69d6a49bb604b1964c11068\n" }, { "commit": "7cf979b02fa0f2546f3f1b648487ac8df359acf7", "tree": "bc6ede4d4e8278e21ea451fe26af47446bdbe3f0", "parents": [ "e033ea69bcd1f343c3cf944d78beec726faf348f", "e6e3beaf2d35d18a79f5e7b60a21e75fac9fd15d" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Tue Oct 20 09:38:07 2015 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Tue Oct 20 09:38:07 2015 +0000" }, "message": "Merge \"Revert \"Revert \"optimizing: propagate type information of arguments\"\"\"" }, { "commit": "aec3cce52009afe436a6db0280d6d5aee9b8d4d4", "tree": "9fa409750d89871863b10396a2278ebd48f0b5b9", "parents": [ "f69f56e7d4a1e31dfce2a77558c9b7047f82092b" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Oct 14 17:44:55 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Oct 19 12:44:55 2015 -0700" }, "message": "Added ability to generate induction range code.\n\nRationale: used by dynamic BCE (done in another CL).\n\nChange-Id: Ia6ce75da57b5298fba74622822ae0bae69c74188\n" }, { "commit": "e6e3beaf2d35d18a79f5e7b60a21e75fac9fd15d", "tree": "b4164b3862e372a8fb83a1910bb669dedc8664ca", "parents": [ "c05aca78fad20901ae17902a3671ccfca9071758" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Wed Oct 14 13:53:10 2015 +0000" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Wed Oct 14 13:53:10 2015 +0000" }, "message": "Revert \"Revert \"optimizing: propagate type information of arguments\"\"\n\nThis reverts commit 89c0d32437011bbe492fe14c766cd707046ce043.\n\nChange-Id: I603a49794e155cc97410b8836c8ea425bfdc98eb\n" }, { "commit": "c05aca78fad20901ae17902a3671ccfca9071758", "tree": "b17f003a121f0b1a27bd237dfbc83c2514538f99", "parents": [ "2c1ffc3a06e9ed0411e29e7dc2558b5d657ede7a" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Tue Oct 13 13:10:33 2015 +0000" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Tue Oct 13 13:10:33 2015 +0000" }, "message": "Revert \"optimizing: propagate type information of arguments\"\n\nThis reverts commit 2c1ffc3a06e9ed0411e29e7dc2558b5d657ede7a.\n\nChange-Id: I3291070c373e661fa578f5a38becbb5a502baf94\n" }, { "commit": "2c1ffc3a06e9ed0411e29e7dc2558b5d657ede7a", "tree": "b4164b3862e372a8fb83a1910bb669dedc8664ca", "parents": [ "89792b9c5ed09dda2937944b69b1b2016807b6aa" ], "author": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Mon Oct 12 15:01:58 2015 +0100" }, "committer": { "name": "Calin Juravle", "email": "calin@google.com", "time": "Mon Oct 12 18:01:14 2015 +0100" }, "message": "optimizing: propagate type information of arguments\n\nThis helps inlining and type check elimination.\n\ne.g:\n\nvoid foo(ArrayList a) {\nint size \u003d a.size(); // this can be inlined now.\n}\n\nChange-Id: I3ffeaa79d9df444aa19511c83c544cb5f9d9ab20\n" }, { "commit": "9401f5397128ddc8dc36de923dd5e6bd4e4b5be4", "tree": "4ff8052307da80baa89dfa80a446f48752c0e95c", "parents": [ "931e26843bbb688eacfa67b40414c6b8f221a56a" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Sep 28 16:25:56 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Sep 30 09:58:53 2015 -0700" }, "message": "Implemented trip-count safety information.\n\nAs shown in the induction analysis presentation, trip-counts need to\ndeal with potential taken/not-taken situations (so that trip-count\nis either valid in the full loop or just in the loop-body proper)\nand potential finite/infinite situations (the latter can still be\nanalyzed but may need to run-time test later to guard against the\ninfinite conditions). This CL provides that information.\n\nChange-Id: I0445d8e836b80a3614af217ce3e39d766e77b986\n" }, { "commit": "f475bee067ae0f6dd2a022c823c642265f97b065", "tree": "a411acce47e6b60ef87bc2f873604aad1d31c318", "parents": [ "15ed726eae70a479f3179de68a643ef30c777cbb" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Sep 16 12:50:25 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Sep 23 16:20:53 2015 -0700" }, "message": "Various improvements in finding induction variables.\n\nRationale:\n(1) Analyze multi-way phis (requested by Nicolas, Igor, and Mingyao).\n(2) Analyze trip count for restricted !\u003d loops\n(3) Added unit test for public API of range analysis (static methods\n were already well-tested).\n\nChange-Id: I9285d22d3bb927f141204cc4697ea6fe5120994d\n" }, { "commit": "d14c59564870c910bdc823081f0ed1101f599231", "tree": "36a831f8c786823129bebbf03a4ca48ff6ed3c23", "parents": [ "e6576390f957c82c2aede438834d028066757368" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Tue Sep 08 15:25:15 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Sep 10 10:16:04 2015 -0700" }, "message": "Induction variable range analysis.\n\nRationale: by computing an upper bound on the trip count of each\n loop after induction var analysis has completed, a\n\t simple range analysis yields lower and upper bounds on\n\t all induced expressions in a loop; this analysis\n\t plugs directly into BCE (follow-up CL).\n\nChange-Id: I46a3fe48721ca372547199b39a3498c47992597d\n" }, { "commit": "471a2034171346dda4539b985b95aa6370531171", "tree": "9f04b5dd3169909953ac4e38c106287f12e0bbef", "parents": [ "6b79454092582bea4a72872d04e4bc9f0a48a4b8" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Sep 04 18:22:11 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Mon Sep 07 10:35:55 2015 -0700" }, "message": "Simplify loop invariant operations during induction analysis.\n\nRationale:\nSaves some memory for nodes that are not really required, and\nyields slightly more readable debugging strings.\n\nChange-Id: I95b64b48869699137b5d49e26eb20091e264de7a\n" }, { "commit": "e609b7cf9996389e6e693f149489737436172a2c", "tree": "14f1c83ea83d1b9133272af1dc6f3ad314f1fef3", "parents": [ "fb32aca04cc1b5f5e8325d79664882f25f253881" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Aug 27 13:46:58 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Fri Sep 04 17:03:39 2015 -0700" }, "message": "Further development of induction variable analysis.\n\nVarious improvements:\n(1) Introduced period sequences.\n(2) Extended all transfer functions to deal with all cases;\n also refactored these to read more compactly.\n(3) Improved debugging output for constants for readability.\n(4) Used direct pointer in mappings for clarify.\n(5) Several induction info \"constructors\" for readability.\n(6) Various other changes suggested in earlier code reviews.\n\nChange-Id: I9d5381f1676b63d30cea6f5e304d4b7bda7acb96\n" }, { "commit": "30efb4e00c2a9aa318d44486b5eacaa7178d20ef", "tree": "90c4e84b5473def182fa443191ba8de80fa62d63", "parents": [ "574d75597013cb12a961c0d4365d1618d8ef6977" ], "author": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Thu Jul 30 12:14:31 2015 -0700" }, "committer": { "name": "Aart Bik", "email": "ajcbik@google.com", "time": "Wed Aug 26 17:20:28 2015 +0000" }, "message": "Induction variable analysis (with unit tests).\n\nRationale:\nInduction variable analysis forms the basis of a wide\nvariety of compiler optimizations. This implementation\nfinds induction variables using the elegant SSA-based\nalgorithm defined by [Gerlek et al.].\n\nChange-Id: I79b8dce33ffb8b283c179699a8dff5bd196f75b2\n" } ] }