)]}' { "log": [ { "commit": "492a7fa6df3b197a24099a50f5abf624164f3842", "tree": "1c02e48c0a16c8ff91f189946a39a3f14c1048dc", "parents": [ "f7e1ab5224e16a47a410a788915422c73abfffac" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Wed Jun 01 18:38:43 2016 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Jun 03 10:52:22 2016 +0100" }, "message": "Delay dex-to-dex compilation until Optimizing is done.\n\nThis fixes a race between inlining in the Optimizing\nbackend and dex-to-dex quickening where the Optimizing can\nread the non-quickened opcode and then the quickened field\nindex or vtable index and look up the wrong field or method.\nEven if we such tearing of the dex instruction does not\nhappen, the possible reordering of dex-to-dex and Optimizing\ncompilation makes the final oat file non-deterministic.\n\nAlso, remove VerificationResults::RemoveVerifiedMethod() as\nwe have only the Optimizing backend now and as such it was\ndead code and would have interfered with this change.\n\nBug: 29043547\nBug: 29089975\nChange-Id: I8389927d35dcacaf2f99c2153f055857036c8129\n" }, { "commit": "1bbdfd73a98b149c31f8a80888c7ee9ab2587630", "tree": "f23816b520fd4b2a9b47642ac16bf37c5cec512f", "parents": [ "7dc11782ff0a5dffcd8108f256f8975f0b3e8076" ], "author": { "name": "David Srbecky", "email": "dsrbecky@google.com", "time": "Wed Feb 24 16:39:26 2016 +0000" }, "committer": { "name": "David Srbecky", "email": "dsrbecky@google.com", "time": "Thu Feb 25 14:40:21 2016 +0000" }, "message": "Verify encoded stack maps in debug builds.\n\nRead all stack map data back after we write it and DCHECK the content.\n\nChange-Id: Ia679594ac9e5805f6d4c56686030af153b45ea8b\n" }, { "commit": "067f1ed7816cf4eb5d6258ca31b387ddb2073ab7", "tree": "2f1cff344eea6d7792e375f43578bf73095e02d4", "parents": [ "4b2e98fc8c257a27a95fecbc859fcc617e2fa827" ], "author": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Fri Aug 07 08:29:13 2015 -0700" }, "committer": { "name": "Andreas Gampe", "email": "agampe@google.com", "time": "Fri Aug 07 16:40:25 2015 -0700" }, "message": "ART: Remove TODO in BitVector\n\nRefactor the BitVector constructor: split it up to remove the\npossibility to provide contradicting parameters, and add a custom\ncopying constructor.\n\nChange-Id: Ie943f279baa007db578aea0f2f33fa93311612ee\n" }, { "commit": "f10a25f961eb8029c01c84fe8eabd405055cca37", "tree": "a0fd9dfa459689fa2929a89310ebcd3a45607e5f", "parents": [ "1682e1aa3463c2e6a8e5f4a9d3f4d13a0e31e3da" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Tue Jun 02 14:29:52 2015 +0100" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Tue Jun 02 14:36:09 2015 +0100" }, "message": "ART: Fast copy stack mask\n\nStackMap::SetStackMask will currently copy a BitVector into a Memory-\nRegion bit by bit. This patch adds a new function for copying the data\nwith memcpy.\n\nThis is resubmission of CL I28d45a590b35a4a854cca2f57db864cf8a081487\nbut with a fix for a broken test which it revealed.\n\nChange-Id: Ib65aa614d3ab7b5c99c6719fdc8e436466a4213d\n" }, { "commit": "d84b4384bc14a6bc256ad85955eca0582e6b2364", "tree": "c6b4bb107841320abbaa1402484df67c3f4a0a3b", "parents": [ "6b10c9b2c0e62193ab9df4d63aedea1d0798e742" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Tue Jun 02 12:42:40 2015 +0000" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Tue Jun 02 12:42:40 2015 +0000" }, "message": "Revert \"ART: Fast copy stack mask\"\n\nDCHECK failure, need to investigate\n\nThis reverts commit 6b10c9b2c0e62193ab9df4d63aedea1d0798e742.\n\nChange-Id: Ie1d1cc6fb71367bc5ac5d6a260af8de316a758dd\n" }, { "commit": "6b10c9b2c0e62193ab9df4d63aedea1d0798e742", "tree": "9930b839777184008b38e5504f1274c4cbfd87e1", "parents": [ "f86808b55b550962c627b50511b98f4de8cd0e60" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Fri May 29 16:33:09 2015 +0100" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Tue Jun 02 12:30:46 2015 +0100" }, "message": "ART: Fast copy stack mask\n\nStackMap::SetStackMask will currently copy a BitVector into a Memory-\nRegion bit by bit. This patch adds a new function for copying the data\nwith memcpy.\n\nChange-Id: I28d45a590b35a4a854cca2f57db864cf8a081487\n" }, { "commit": "80afd02024d20e60b197d3adfbb43cc303cf29e0", "tree": "ef054c7b4f2a739f7cf063e0bc4c501c2c7e41b5", "parents": [ "559b178e34c5d92e7932f92e5d8a981ac334606f" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue May 19 18:08:00 2015 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue May 26 15:59:02 2015 +0100" }, "message": "ART: Clean up arm64 kNumberOfXRegisters usage.\n\nAvoid undefined behavior for arm64 stemming from 1u \u003c\u003c 32 in\nloops with upper bound kNumberOfXRegisters.\n\nCreate iterators for enumerating bits in an integer either\nfrom high to low or from low to high and use them for\n\u003carch\u003eContext::FillCalleeSaves() on all architectures.\n\nRefactor runtime/utils.{h,cc} by moving all bit-fiddling\nfunctions to runtime/base/bit_utils.{h,cc} (together with\nthe new bit iterators) and all time-related functions to\nruntime/base/time_utils.{h,cc}. Improve test coverage and\nfix some corner cases for the bit-fiddling functions.\n\nBug: 13925192\nChange-Id: I704884dab15b41ecf7a1c47d397ab1c3fc7ee0f7\n" }, { "commit": "83d46ef1eaa8fdecadfdb9564d80e50b42646c37", "tree": "c009b65e982a72c78cbfe6b203c3e942275c8531", "parents": [ "f3962119654ac1f02e7ec891e1526ca8045542aa" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue May 12 18:27:20 2015 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Tue May 12 18:37:17 2015 +0100" }, "message": "Quick: Fix DCE to mark wide register overlaps correctly.\n\nPreviously we missed some cases of overlap with registers\ncoming from previous blocks.\n\nBug: 20640451\nChange-Id: I4b32a7aaea2dea1b0b9560ae3459a4d903683f20\n" }, { "commit": "7d275379bf490a87805852129e3fe2e8afe961e7", "tree": "d0bbe856872c92773931c62e6881b0305a916236", "parents": [ "223f2f5b2a20ca8246da1523494900a2424d5956" ], "author": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Tue Apr 21 16:36:35 2015 +0100" }, "committer": { "name": "David Brazdil", "email": "dbrazdil@google.com", "time": "Tue Apr 21 17:17:11 2015 +0100" }, "message": "ART: Update loop info of all nested loops when inlining\n\nWhen inlining into a nested loop, the inliner would only add the new\nblocks into the innermost loop info object. This patch fixes that and\nmodifies SsaChecker to verify the property.\n\nChange-Id: I21d343a6f7d972f5b7420701f816c65ab3f20566\n" }, { "commit": "040719630f33019693b5c4d9b573311b2f935c39", "tree": "5c3a389dd63773d21f3e7e9abdd47c7d3572d1b8", "parents": [ "1ab1502093940ecc03b1be5d5e7e50b69df42165" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Jan 02 17:00:44 2015 +0000" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Jan 23 11:35:05 2015 +0000" }, "message": "Fix BitVector::IndexIterator::operator*() to return uint32_t.\n\nChange-Id: I3cfc028b1c3744ec85ea00eadcbccfdde6fd51d3\n" }, { "commit": "e77493c7217efdd1a0ecef521a6845a13da0305b", "tree": "3055cb7aaea8b9edc498b2e209d74af36c32e0fd", "parents": [ "41cba7c66cbc441b00fca48dfb2501181b1f2a53" ], "author": { "name": "Ian Rogers", "email": "irogers@google.com", "time": "Wed Aug 20 15:08:45 2014 -0700" }, "committer": { "name": "Ian Rogers", "email": "irogers@google.com", "time": "Wed Aug 20 15:09:20 2014 -0700" }, "message": "Make common BitVector operations inline-able.\n\nChange-Id: Ie25de4fae56c6712539f04172c42e3eff57df7ca\n" }, { "commit": "014d77a2107fec8ba978a7428fd4d04e0bf8e168", "tree": "af30717fb54eedf6af9d931cb89656f29f701134", "parents": [ "e4283be97047a26d3476acd3863dcc386498be17" ], "author": { "name": "Jean Christophe Beyler", "email": "jean.christophe.beyler@intel.com", "time": "Mon Jun 02 11:21:21 2014 -0700" }, "committer": { "name": "Jean Christophe Beyler", "email": "jean.christophe.beyler@intel.com", "time": "Mon Jun 02 15:17:03 2014 -0700" }, "message": "ART: BitVector not calculating number_of_bits correctly\n\nThe number_of_bits_ field has an unclear intent. Instead, using\n storage_size_ * kWordBits when relevant.\n\nChange-Id: I8c13be0d6643de37813fb154296d451f22c298c8\nSigned-off-by: Jean Christophe Beyler \u003cjean.christophe.beyler@intel.com\u003e\n" }, { "commit": "ec23021ceb9f91a424c524fbfbcc9de6fb21f2b1", "tree": "f357f025008f6b3bac1c4881ee77ff4999bbd951", "parents": [ "ccddc49852a69094aecf9eb7c7de67a9c2c5c31a", "520f37bb5c34c5d86ad0091cb84a84c163a2fa9c" ], "author": { "name": "Ian Rogers", "email": "irogers@google.com", "time": "Fri May 23 18:03:11 2014 +0000" }, "committer": { "name": "Gerrit Code Review", "email": "noreply-gerritcodereview@google.com", "time": "Fri May 23 18:03:11 2014 +0000" }, "message": "Merge \"ART: Added print indices back to BitVector Dumper\"" }, { "commit": "920be0b27c72ceb3d40b5f2775cd1950f7c65b5f", "tree": "e1ebbec3ec4b2a73d08f798a318ecde9be888ede", "parents": [ "e24580a135aa6e85cdc49426ec74d2ae1e326243" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri May 23 18:43:51 2014 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri May 23 18:43:51 2014 +0100" }, "message": "Fix style issue.\n\nChange-Id: I2044e01c68265c33e7fa6057efa7b6c7ac41ada4\n" }, { "commit": "520f37bb5c34c5d86ad0091cb84a84c163a2fa9c", "tree": "8c1ebd76a690dfa328821cd26b78d48531848cfa", "parents": [ "b8033db2a8dc6f7c7e29b1552177542964f56e44" ], "author": { "name": "Jean Christophe Beyler", "email": "jean.christophe.beyler@intel.com", "time": "Thu May 22 15:43:50 2014 -0700" }, "committer": { "name": "Jean Christophe Beyler", "email": "jean.christophe.beyler@intel.com", "time": "Fri May 23 09:31:27 2014 -0700" }, "message": "ART: Added print indices back to BitVector Dumper\n\n- Added an API to get the indices set instead of 001...0 format\n\nChange-Id: I75841e41ca9b7ef77a0717715669dbe12506d6a1\nSigned-Off-By: Jean Christophe Beyler \u003cjean.christophe.beyler@intel.com\u003e\n" }, { "commit": "a5b8fde2d2bc3167078694fad417fddfe442a6fd", "tree": "287942554467eb8566291f7d021549f65763f53e", "parents": [ "567e9dbc65ee183cda2a052dbf224c8c4a8f9423" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri May 23 15:16:44 2014 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri May 23 17:12:15 2014 +0100" }, "message": "Rewrite BitVector index iterator.\n\nThe BitVector::Iterator was not iterating over the bits but\nrather over indexes of the set bits. Therefore, we rename it\nto IndexIterator and provide a BitVector::Indexes() to get\na container-style interface with begin() and end() for range\nbased for loops.\n\nAlso, simplify InsertPhiNodes where the tmp_blocks isn\u0027t\nneeded since the phi_nodes and input_blocks cannot lose any\nblocks in subsequent iterations, so we can do the Union()\ndirectly in those bit vectors and we need to repeat the loop\nonly if we have new input_blocks, rather than on phi_nodes\nchange. And move the temporary bit vectors to scoped arena.\n\nChange-Id: I6cb87a2f60724eeef67c6aaa34b36ed5acde6d43\n" }, { "commit": "622d9c31febd950255b36a48b47e1f630197c5fe", "tree": "8a7f14ce3c6c087955ad5fe91a3ce7d5b5a82461", "parents": [ "98a8a542f95e41c09d214a329a940b270f08f5b3" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Mon May 12 16:11:02 2014 +0100" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Tue May 13 09:06:14 2014 +0100" }, "message": "Add loop recognition and CFG simplifications in new compiler.\n\nWe do three simplifications:\n- Split critical edges, for code generation from SSA (new).\n- Ensure one back edge per loop, to simplify loop recognition (new).\n- Ensure only one pre header for a loop, to simplify SSA creation (existing).\n\nChange-Id: I9bfccd4b236a00486a261078627b091c8a68be33\n" }, { "commit": "804d09372cc3d80d537da1489da4a45e0e19aa5d", "tree": "b226350fdf3dc0c55a11e1615010c8475f167f90", "parents": [ "0095e0b8380a8802f40a21928800b9df6e11f1d7" ], "author": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Fri May 02 08:46:00 2014 +0100" }, "committer": { "name": "Nicolas Geoffray", "email": "ngeoffray@google.com", "time": "Wed May 07 10:32:11 2014 +0100" }, "message": "Build live-in, live-out and kill sets for each block.\n\nThis information will be used when computing live ranges of\ninstructions.\n\nChange-Id: I345ee833c1ccb4a8e725c7976453f6d58d350d74\n" }, { "commit": "5afa08f95d43dd24fb4b3d7a08aa1ec23386ad54", "tree": "28d388989be9ccdfce387728f63820689c29e9ca", "parents": [ "1c17753ca9cf125ffd1fa47f34650fb6f4005409" ], "author": { "name": "Jean Christophe Beyler", "email": "jean.christophe.beyler@intel.com", "time": "Tue Apr 15 15:54:35 2014 -0700" }, "committer": { "name": "Jean Christophe Beyler", "email": "jean.christophe.beyler@intel.com", "time": "Thu Apr 24 12:20:40 2014 -0700" }, "message": "ART: Bitvector extensions for dumping and size handling\n\n- Added dumping functions and the ensure size and clear function.\n- Fixed a bug in union where if a bit is not set in the source, an buffer\n overflow can occur later down.\n\nChange-Id: Iff40529f3a8970a1ce2dd5c591f659f71924dea3\nSigned-off-by: Jean Christophe Beyler \u003cjean.christophe.beyler@intel.com\u003e\nSigned-off-by: Razvan A Lupusoru \u003crazvan.a.lupusoru@intel.com\u003e\nSigned-off-by: Yixin Shou \u003cyixin.shou@intel.com\u003e\nSigned-off-by: Chao-ying Fu \u003cchao-ying.fu@intel.com\u003e\nSigned-off-by: Udayan Banerji \u003cudayan.banerji@intel.com\u003e\n" }, { "commit": "d3c5bebcb52a67cb06e7ab303eaf45f230c08b60", "tree": "85df477ba745b1e2c85ab1d167b0297236060f2f", "parents": [ "043a7a6182870964021476484b1534106ff20600" ], "author": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Fri Apr 11 16:32:51 2014 +0100" }, "committer": { "name": "Vladimir Marko", "email": "vmarko@google.com", "time": "Mon Apr 14 18:03:41 2014 +0100" }, "message": "Avoid allocating OatFile::OatClass on the heap.\n\nAvoid allocating a BitVector for OatFile::OatClass::bitmap_\nwith kOatClassSomeCompiled methods. That makes the OatClass\ncopy-constructible as it doesn\u0027t own any memory. We use that\nin OatFile::OatDexFile::GetOatClass() to return the result\nby value thus avoiding one or two heap allocations per call.\n\nChange-Id: Ic7098109028a5b49e39ef626f877de86e732ed18\n" }, { "commit": "ad0d30a2a2141aa0e9da9e97993ce20e4d8e056e", "tree": "90af62fbfc9a05b8d29bdf54d96f128183bce92b", "parents": [ "1776f50b5b99782278d7f3d354fa956d9066c903" ], "author": { "name": "Jean Christophe Beyler", "email": "jean.christophe.beyler@intel.com", "time": "Thu Jan 16 09:00:18 2014 -0800" }, "committer": { "name": "Jean Christophe Beyler", "email": "jean.christophe.beyler@intel.com", "time": "Fri Jan 17 13:37:14 2014 -0800" }, "message": "Update to the BitVector Implementation\n\nIsBitSet:\n- If the index requested is above the size, return false.\n\nClearBit:\n- If the index requested is above the size, ignore.\n\nAdded SameBitsSet:\n- Check the bits set disregarding size and expandable.\n\nIntersect and Union:\n- removed the requirement of same size.\n- handles case where the sizes are not the same.\n\nAdded Subtract between BitVectors.\n\nSetInitialBits:\n- Now requests expansion if above the bits available.\n- Clears upper bits.\n\nAdded GetHighestBitSet.\n\nClearBit:\n- If we clear above the size, it is fine, it has not been set yet.\n\nCopy:\n- Supposes it is well allocated.\n- It used to just copy what was available in destination without checking source\u0027s size.\n- Now actually allocate the destination to make sure it holds enough space.\n- Set parameter to const.\n\nGeneral:\n- Moved sizeof(uint32_t) to sizeof(*storage_) for future maintenance.\n\nChange-Id: Iebb214632482c46807deca957f5b6dc892a61a84\n" }, { "commit": "ba150c37d582eeeb8c11ba5245edc281cf31793c", "tree": "ca12cf82602e4b78b2a6ca463e9d0e35fc5e3ff6", "parents": [ "3c2a6e2468e3e519ade6c3cfcaad7cd34243cdf1" ], "author": { "name": "Brian Carlstrom", "email": "bdc@google.com", "time": "Tue Aug 27 17:31:03 2013 -0700" }, "committer": { "name": "Brian Carlstrom", "email": "bdc@google.com", "time": "Mon Oct 28 00:06:03 2013 -0700" }, "message": "Omit OatMethodOffsets for classes without compiled code\n\nChange-Id: If0d290f4aebc778ff12d8fed017c270ad2ac3220\n" }, { "commit": "413e89f277ec6ba1bdf2040f5b5611f29a27a447", "tree": "41fb703df7e0f208bbfa0d94919efae9630e7d1c", "parents": [ "79b4f38dd35b83206e8166aaafb94bd75c3318b3" ], "author": { "name": "Brian Carlstrom", "email": "bdc@google.com", "time": "Mon Oct 21 23:53:49 2013 -0700" }, "committer": { "name": "Brian Carlstrom", "email": "bdc@google.com", "time": "Thu Oct 24 14:43:30 2013 -0700" }, "message": "Refactor ArenaBitVector to create more general BitVector\n\nChange-Id: Ib26f2884de9ce7d620048bdf5ed6dec639622e41\n" } ] }