| OLD | NEW |
| 1 // Copyright 2006-2009 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2009 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 2837 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2848 // Attempt to use lookup cache. | 2848 // Attempt to use lookup cache. |
| 2849 Map* receiver_map = receiver->map(); | 2849 Map* receiver_map = receiver->map(); |
| 2850 int offset = KeyedLookupCache::Lookup(receiver_map, key); | 2850 int offset = KeyedLookupCache::Lookup(receiver_map, key); |
| 2851 if (offset != -1) { | 2851 if (offset != -1) { |
| 2852 Object* value = receiver->FastPropertyAt(offset); | 2852 Object* value = receiver->FastPropertyAt(offset); |
| 2853 return value->IsTheHole() ? Heap::undefined_value() : value; | 2853 return value->IsTheHole() ? Heap::undefined_value() : value; |
| 2854 } | 2854 } |
| 2855 // Lookup cache miss. Perform lookup and update the cache if appropriate. | 2855 // Lookup cache miss. Perform lookup and update the cache if appropriate. |
| 2856 LookupResult result; | 2856 LookupResult result; |
| 2857 receiver->LocalLookup(key, &result); | 2857 receiver->LocalLookup(key, &result); |
| 2858 if (result.IsProperty() && result.IsLoaded() && result.type() == FIELD) { | 2858 if (result.IsProperty() && result.type() == FIELD) { |
| 2859 int offset = result.GetFieldIndex(); | 2859 int offset = result.GetFieldIndex(); |
| 2860 KeyedLookupCache::Update(receiver_map, key, offset); | 2860 KeyedLookupCache::Update(receiver_map, key, offset); |
| 2861 return receiver->FastPropertyAt(offset); | 2861 return receiver->FastPropertyAt(offset); |
| 2862 } | 2862 } |
| 2863 } else { | 2863 } else { |
| 2864 // Attempt dictionary lookup. | 2864 // Attempt dictionary lookup. |
| 2865 StringDictionary* dictionary = receiver->property_dictionary(); | 2865 StringDictionary* dictionary = receiver->property_dictionary(); |
| 2866 int entry = dictionary->FindEntry(key); | 2866 int entry = dictionary->FindEntry(key); |
| 2867 if ((entry != StringDictionary::kNotFound) && | 2867 if ((entry != StringDictionary::kNotFound) && |
| 2868 (dictionary->DetailsAt(entry).type() == NORMAL)) { | 2868 (dictionary->DetailsAt(entry).type() == NORMAL)) { |
| (...skipping 5313 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 8182 } else { | 8182 } else { |
| 8183 // Handle last resort GC and make sure to allow future allocations | 8183 // Handle last resort GC and make sure to allow future allocations |
| 8184 // to grow the heap without causing GCs (if possible). | 8184 // to grow the heap without causing GCs (if possible). |
| 8185 Counters::gc_last_resort_from_js.Increment(); | 8185 Counters::gc_last_resort_from_js.Increment(); |
| 8186 Heap::CollectAllGarbage(false); | 8186 Heap::CollectAllGarbage(false); |
| 8187 } | 8187 } |
| 8188 } | 8188 } |
| 8189 | 8189 |
| 8190 | 8190 |
| 8191 } } // namespace v8::internal | 8191 } } // namespace v8::internal |
| OLD | NEW |