17 ZoneHashMap::Entry* p =
map->Lookup(
name.location(),
name->Hash(),
false,
30 Nesting() { current_ += 2; }
31 ~Nesting() { current_ -= 2; }
32 static int current() {
return current_; }
37 int Nesting::current_ = 0;
42 Zone* zone,
bool* ok) {
47 if (FLAG_print_interface_details) {
48 PrintF(
"%*s# Adding...\n", Nesting::current(),
"");
49 PrintF(
"%*sthis = ", Nesting::current(),
"");
50 this->Print(Nesting::current());
52 PrintF(
"%*s%.*s : ", Nesting::current(),
"", symbol->
length(),
54 interface->Print(Nesting::current());
67 ZoneHashMap::Entry* p =
72 }
else if (p->value ==
NULL) {
82 if (FLAG_print_interface_details) {
83 PrintF(
"%*sthis' = ", Nesting::current(),
"");
84 this->Print(Nesting::current());
85 PrintF(
"%*s# Added.\n", Nesting::current(),
"");
98 if (
this == that)
return;
111 if (FLAG_print_interface_details) {
112 PrintF(
"%*s# Unifying...\n", Nesting::current(),
"");
113 PrintF(
"%*sthis = ", Nesting::current(),
"");
114 this->Print(Nesting::current());
115 PrintF(
"%*sthat = ", Nesting::current(),
"");
116 that->Print(Nesting::current());
129 if (FLAG_print_interface_details) {
130 PrintF(
"%*sthis' = ", Nesting::current(),
"");
131 this->Print(Nesting::current());
132 PrintF(
"%*sthat' = ", Nesting::current(),
"");
133 that->Print(Nesting::current());
134 PrintF(
"%*s# Unified.\n", Nesting::current(),
"");
156 for (ZoneHashMap::Entry* p =
map->Start(); p !=
NULL; p =
map->Next(p)) {
157 this->
DoAdd(p->key, p->hash,
static_cast<Interface*
>(p->value), zone, ok);
165 int that_size =
map ==
NULL ? 0 :
map->occupancy();
166 if (that->
IsFrozen() && this_size > that_size) {
178 void Interface::Print(
int n) {
179 int n0 = n > 0 ? n : 0;
181 if (FLAG_print_interface_details) {
182 PrintF(
"%p",
static_cast<void*
>(
this));
184 PrintF(
"->%p",
static_cast<void*
>(link));
199 }
else if (n < 0 || n0 >= 2 * FLAG_print_interface_depth) {
204 for (ZoneHashMap::Entry* p =
map->Start(); p !=
NULL; p =
map->Next(p)) {
205 String*
name = *
static_cast<String**
>(p->key);
207 PrintF(
"%*s%s : ", n0 + 2,
"",
name->ToAsciiArray());
208 interface->Print(n0 + 2);
const unsigned char * raw_data() const
virtual int length() const OVERRIDE
void DoAdd(const void *name, uint32_t hash, Interface *interface, Zone *zone, bool *ok)
void Unify(Interface *that, Zone *zone, bool *ok)
void MakeModule(bool *ok)
Interface * Lookup(Handle< String > name, Zone *zone)
void DoUnify(Interface *that, bool *ok, Zone *zone)
uint32_t occupancy() const
Entry * Lookup(void *key, uint32_t hash, bool insert, AllocationPolicy allocator=AllocationPolicy())
static const uint32_t kDefaultHashMapCapacity
static bool PointersMatch(void *key1, void *key2)
enable harmony numeric enable harmony object literal extensions Optimize object Array DOM strings and string trace pretenuring decisions of HAllocate instructions Enables optimizations which favor memory size over execution speed maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining trace the tracking of allocation sites deoptimize every n garbage collections perform array bounds checks elimination analyze liveness of environment slots and zap dead values flushes the cache of optimized code for closures on every GC allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms do not emit check maps for constant values that have a leaf map
enable harmony numeric enable harmony object literal extensions Optimize object Array DOM strings and string trace pretenuring decisions of HAllocate instructions Enables optimizations which favor memory size over execution speed maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining trace the tracking of allocation sites deoptimize every n garbage collections perform array bounds checks elimination analyze liveness of environment slots and zap dead values flushes the cache of optimized code for closures on every GC allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes enable context specialization in TurboFan execution budget before interrupt is triggered max percentage of megamorphic generic ICs to allow optimization enable use of SAHF instruction if enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable use of MLS instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long enable alignment of csp to bytes on platforms which prefer the register to always be expose gc extension under the specified name show built in functions in stack traces use random jit cookie to mask large constants minimum length for automatic enable preparsing CPU profiler sampling interval in microseconds trace out of bounds accesses to external arrays default size of stack region v8 is allowed to maximum length of function source code printed in a stack trace min size of a semi the new space consists of two semi spaces print one trace line following each garbage collection do not print trace line after scavenger collection print cumulative GC statistics in name
enable harmony numeric enable harmony object literal extensions Optimize object Array DOM strings and string trace pretenuring decisions of HAllocate instructions Enables optimizations which favor memory size over execution speed maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining trace the tracking of allocation sites deoptimize every n garbage collections perform array bounds checks elimination analyze liveness of environment slots and zap dead values flushes the cache of optimized code for closures on every GC allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes enable context specialization in TurboFan execution budget before interrupt is triggered max percentage of megamorphic generic ICs to allow optimization enable use of SAHF instruction if enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable use of MLS instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long enable alignment of csp to bytes on platforms which prefer the register to always be NULL
#define DCHECK(condition)
TemplateHashMapImpl< ZoneAllocationPolicy > ZoneHashMap
void PrintF(const char *format,...)
Debugger support for the V8 JavaScript engine.