{"commits":[{"author":{"email":"7feb3e8dd65c9e399ae882748f0f5945f7f0ecff@chromium.org","name":"ricow@chromium.org"},"sha":"f855ea6988b4f0ec109d9fa0f5177cbc5f8ddd3f","message":"Optimize the equality check case of ICCompare stubs.\n\nThis includes specialcasing the generation when we know that the maps\nof the two objects are the same. In addition, a new specialized\ncompare ic known objects cache is created.\n\nThe reason for the cache is that we need to have access to the stub\ncode from the roots; if we do not, the GC will collect the stub. In\nthis specialized case we use the map pointer as key in the cache, and\nwe always do a lookup before generating code. Actually hitting\nsomething in the cache will happen very rarely, but we could\npotentially overwrite an existing stub, which again will lead to the\nGC collecting this old stub (even if it is referenced from other code\nobjects)\nReview URL: http://codereview.chromium.org/8520006\n\ngit-svn-id: https://v8.googlecode.com/svn/branches/bleeding_edge@10216 ce2b1a6d-e550-0410-aec6-3dcde31c8c00","url":"https://api.github.com/repos/v8/v8/commits/f855ea6988b4f0ec109d9fa0f5177cbc5f8ddd3f"}],"ref":"refs/heads/bleeding_edge","head":"f855ea6988b4f0ec109d9fa0f5177cbc5f8ddd3f","size":1,"push_id":53143067}