1
// Copyright 2012 the V8 project authors. All rights reserved.
2
// Redistribution and use in source and binary forms, with or without
3
// modification, are permitted provided that the following conditions are
6
// * Redistributions of source code must retain the above copyright
7
// notice, this list of conditions and the following disclaimer.
8
// * Redistributions in binary form must reproduce the above
9
// copyright notice, this list of conditions and the following
10
// disclaimer in the documentation and/or other materials provided
11
// with the distribution.
12
// * Neither the name of Google Inc. nor the names of its
13
// contributors may be used to endorse or promote products derived
14
// from this software without specific prior written permission.
16
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30
#include "interface.h"
35
static bool Match(void* key1, void* key2) {
36
String* name1 = *static_cast<String**>(key1);
37
String* name2 = *static_cast<String**>(key2);
38
ASSERT(name1->IsSymbol());
39
ASSERT(name2->IsSymbol());
40
return name1 == name2;
44
Interface* Interface::Lookup(Handle<String> name, Zone* zone) {
46
ZoneHashMap* map = Chase()->exports_;
47
if (map == NULL) return NULL;
48
ZoneAllocationPolicy allocator(zone);
49
ZoneHashMap::Entry* p = map->Lookup(name.location(), name->Hash(), false,
51
if (p == NULL) return NULL;
52
ASSERT(*static_cast<String**>(p->key) == *name);
53
ASSERT(p->value != NULL);
54
return static_cast<Interface*>(p->value);
59
// Current nesting depth for debug output.
62
Nesting() { current_ += 2; }
63
~Nesting() { current_ -= 2; }
64
static int current() { return current_; }
69
int Nesting::current_ = 0;
73
void Interface::DoAdd(
74
void* name, uint32_t hash, Interface* interface, Zone* zone, bool* ok) {
79
if (FLAG_print_interface_details) {
80
PrintF("%*s# Adding...\n", Nesting::current(), "");
81
PrintF("%*sthis = ", Nesting::current(), "");
82
this->Print(Nesting::current());
83
PrintF("%*s%s : ", Nesting::current(), "",
84
(*static_cast<String**>(name))->ToAsciiArray());
85
interface->Print(Nesting::current());
89
ZoneHashMap** map = &Chase()->exports_;
90
ZoneAllocationPolicy allocator(zone);
93
*map = new ZoneHashMap(Match, ZoneHashMap::kDefaultHashMapCapacity,
96
ZoneHashMap::Entry* p = (*map)->Lookup(name, hash, !IsFrozen(), allocator);
98
// This didn't have name but was frozen already, that's an error.
100
} else if (p->value == NULL) {
101
p->value = interface;
106
static_cast<Interface*>(p->value)->Unify(interface, zone, ok);
110
if (FLAG_print_interface_details) {
111
PrintF("%*sthis' = ", Nesting::current(), "");
112
this->Print(Nesting::current());
113
PrintF("%*s# Added.\n", Nesting::current(), "");
119
void Interface::Unify(Interface* that, Zone* zone, bool* ok) {
120
if (this->forward_) return this->Chase()->Unify(that, zone, ok);
121
if (that->forward_) return this->Unify(that->Chase(), zone, ok);
122
ASSERT(this->forward_ == NULL);
123
ASSERT(that->forward_ == NULL);
126
if (this == that) return;
127
if (this->IsValue()) {
129
if (*ok && this->IsConst()) that->MakeConst(ok);
132
if (that->IsValue()) {
134
if (*ok && that->IsConst()) this->MakeConst(ok);
139
if (FLAG_print_interface_details) {
140
PrintF("%*s# Unifying...\n", Nesting::current(), "");
141
PrintF("%*sthis = ", Nesting::current(), "");
142
this->Print(Nesting::current());
143
PrintF("%*sthat = ", Nesting::current(), "");
144
that->Print(Nesting::current());
148
// Merge the smaller interface into the larger, for performance.
149
if (this->exports_ != NULL && (that->exports_ == NULL ||
150
this->exports_->occupancy() >= that->exports_->occupancy())) {
151
this->DoUnify(that, ok, zone);
153
that->DoUnify(this, ok, zone);
157
if (FLAG_print_interface_details) {
158
PrintF("%*sthis' = ", Nesting::current(), "");
159
this->Print(Nesting::current());
160
PrintF("%*sthat' = ", Nesting::current(), "");
161
that->Print(Nesting::current());
162
PrintF("%*s# Unified.\n", Nesting::current(), "");
168
void Interface::DoUnify(Interface* that, bool* ok, Zone* zone) {
169
ASSERT(this->forward_ == NULL);
170
ASSERT(that->forward_ == NULL);
171
ASSERT(!this->IsValue());
172
ASSERT(!that->IsValue());
179
// Try to merge all members from that into this.
180
ZoneHashMap* map = that->exports_;
182
for (ZoneHashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) {
183
this->DoAdd(p->key, p->hash, static_cast<Interface*>(p->value), zone, ok);
188
// If the new interface is larger than that's, then there were members in
189
// 'this' which 'that' didn't have. If 'that' was frozen that is an error.
190
int this_size = this->exports_ == NULL ? 0 : this->exports_->occupancy();
191
int that_size = map == NULL ? 0 : map->occupancy();
192
if (that->IsFrozen() && this_size > that_size) {
198
if (!that->instance_.is_null()) {
199
if (!this->instance_.is_null() && *this->instance_ != *that->instance_) {
203
this->instance_ = that->instance_;
207
this->flags_ |= that->flags_;
208
that->forward_ = this;
213
void Interface::Print(int n) {
214
int n0 = n > 0 ? n : 0;
216
if (FLAG_print_interface_details) {
217
PrintF("%p", static_cast<void*>(this));
218
for (Interface* link = this->forward_; link != NULL; link = link->forward_)
219
PrintF("->%p", static_cast<void*>(link));
225
} else if (IsConst()) {
227
} else if (IsValue()) {
229
} else if (IsModule()) {
230
PrintF("module %s{", IsFrozen() ? "" : "(unresolved) ");
231
ZoneHashMap* map = Chase()->exports_;
232
if (map == NULL || map->occupancy() == 0) {
234
} else if (n < 0 || n0 >= 2 * FLAG_print_interface_depth) {
235
// Avoid infinite recursion on cyclic types.
239
for (ZoneHashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) {
240
String* name = *static_cast<String**>(p->key);
241
Interface* interface = static_cast<Interface*>(p->value);
242
PrintF("%*s%s : ", n0 + 2, "", name->ToAsciiArray());
243
interface->Print(n0 + 2);
245
PrintF("%*s}\n", n0, "");
251
} } // namespace v8::internal