DescriptionOptimize the equality check case of ICCompare stubs.
This includes specialcasing the generation when we know that the maps
of the two objects are the same. In addition, a new specialized
compare ic known objects cache is created.
The reason for the cache is that we need to have access to the stub
code from the roots; if we do not, the GC will collect the stub. In
this specialized case we use the map pointer as key in the cache, and
we always do a lookup before generating code. Actually hitting
something in the cache will happen very rarely, but we could
potentially overwrite an existing stub, which again will lead to the
GC collecting this old stub (even if it is referenced from other code
objects)
Committed: http://code.google.com/p/v8/source/detail?r=10216
Patch Set 1 #Patch Set 2 : '' #Patch Set 3 : '' #
Total comments: 21
Patch Set 4 : '' #
Total comments: 20
Patch Set 5 : '' #Patch Set 6 : '' #Patch Set 7 : '' #Patch Set 8 : '' #
Total comments: 6
Patch Set 9 : '' #Patch Set 10 : '' #Patch Set 11 : '' #
Total comments: 1
Messages
Total messages: 9 (0 generated)
|