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->IsInternalizedString());
39 ASSERT(name2->IsInternalizedString());
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(zone->New(sizeof(ZoneHashMap)))
94 ZoneHashMap(Match, ZoneHashMap::kDefaultHashMapCapacity, allocator);
97 ZoneHashMap::Entry* p = (*map)->Lookup(name, hash, !IsFrozen(), allocator);
99 // This didn't have name but was frozen already, that's an error.
101 } else if (p->value == NULL) {
102 p->value = interface;
107 static_cast<Interface*>(p->value)->Unify(interface, zone, ok);
111 if (FLAG_print_interface_details) {
112 PrintF("%*sthis' = ", Nesting::current(), "");
113 this->Print(Nesting::current());
114 PrintF("%*s# Added.\n", Nesting::current(), "");
120 void Interface::Unify(Interface* that, Zone* zone, bool* ok) {
121 if (this->forward_) return this->Chase()->Unify(that, zone, ok);
122 if (that->forward_) return this->Unify(that->Chase(), zone, ok);
123 ASSERT(this->forward_ == NULL);
124 ASSERT(that->forward_ == NULL);
127 if (this == that) return;
128 if (this->IsValue()) {
130 if (*ok && this->IsConst()) that->MakeConst(ok);
133 if (that->IsValue()) {
135 if (*ok && that->IsConst()) this->MakeConst(ok);
140 if (FLAG_print_interface_details) {
141 PrintF("%*s# Unifying...\n", Nesting::current(), "");
142 PrintF("%*sthis = ", Nesting::current(), "");
143 this->Print(Nesting::current());
144 PrintF("%*sthat = ", Nesting::current(), "");
145 that->Print(Nesting::current());
149 // Merge the smaller interface into the larger, for performance.
150 if (this->exports_ != NULL && (that->exports_ == NULL ||
151 this->exports_->occupancy() >= that->exports_->occupancy())) {
152 this->DoUnify(that, ok, zone);
154 that->DoUnify(this, ok, zone);
158 if (FLAG_print_interface_details) {
159 PrintF("%*sthis' = ", Nesting::current(), "");
160 this->Print(Nesting::current());
161 PrintF("%*sthat' = ", Nesting::current(), "");
162 that->Print(Nesting::current());
163 PrintF("%*s# Unified.\n", Nesting::current(), "");
169 void Interface::DoUnify(Interface* that, bool* ok, Zone* zone) {
170 ASSERT(this->forward_ == NULL);
171 ASSERT(that->forward_ == NULL);
172 ASSERT(!this->IsValue());
173 ASSERT(!that->IsValue());
174 ASSERT(this->index_ == -1);
175 ASSERT(that->index_ == -1);
182 // Try to merge all members from that into this.
183 ZoneHashMap* map = that->exports_;
185 for (ZoneHashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) {
186 this->DoAdd(p->key, p->hash, static_cast<Interface*>(p->value), zone, ok);
191 // If the new interface is larger than that's, then there were members in
192 // 'this' which 'that' didn't have. If 'that' was frozen that is an error.
193 int this_size = this->exports_ == NULL ? 0 : this->exports_->occupancy();
194 int that_size = map == NULL ? 0 : map->occupancy();
195 if (that->IsFrozen() && this_size > that_size) {
201 this->flags_ |= that->flags_;
202 that->forward_ = this;
207 void Interface::Print(int n) {
208 int n0 = n > 0 ? n : 0;
210 if (FLAG_print_interface_details) {
211 PrintF("%p", static_cast<void*>(this));
212 for (Interface* link = this->forward_; link != NULL; link = link->forward_)
213 PrintF("->%p", static_cast<void*>(link));
219 } else if (IsConst()) {
221 } else if (IsValue()) {
223 } else if (IsModule()) {
224 PrintF("module %d %s{", Index(), IsFrozen() ? "" : "(unresolved) ");
225 ZoneHashMap* map = Chase()->exports_;
226 if (map == NULL || map->occupancy() == 0) {
228 } else if (n < 0 || n0 >= 2 * FLAG_print_interface_depth) {
229 // Avoid infinite recursion on cyclic types.
233 for (ZoneHashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) {
234 String* name = *static_cast<String**>(p->key);
235 Interface* interface = static_cast<Interface*>(p->value);
236 PrintF("%*s%s : ", n0 + 2, "", name->ToAsciiArray());
237 interface->Print(n0 + 2);
239 PrintF("%*s}\n", n0, "");
245 } } // namespace v8::internal