0a49dd1c28
Store bytecode property lookup caches as tiered handles instead of eagerly allocating four entries for every cache slot. Each slot starts empty, grows to one monomorphic entry after the first cacheable lookup, and promotes to the existing four-entry table when another cache key appears. Global variable caches keep one inline property entry because they usually warm up as global object property accesses. This keeps common global access allocation-free while still avoiding the inherited polymorphic cache cost. Generated asm offsets now point at the lazy property-cache storage and the inline global entry, and asm fast paths bail out for empty property cache slots. |
||
|---|---|---|
| .. | ||
| asmint.asm | ||
| AsmInterpreter.cpp | ||
| AsmInterpreter.h | ||
| gen_asm_offsets.cpp | ||