| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 2160 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2171 SetPropertyReference(js_obj, entry, descs->GetKey(i), | 2171 SetPropertyReference(js_obj, entry, descs->GetKey(i), |
| 2172 setter, "set-%s"); | 2172 setter, "set-%s"); |
| 2173 } | 2173 } |
| 2174 } | 2174 } |
| 2175 break; | 2175 break; |
| 2176 } | 2176 } |
| 2177 case NORMAL: // only in slow mode | 2177 case NORMAL: // only in slow mode |
| 2178 case HANDLER: // only in lookup results, not in descriptors | 2178 case HANDLER: // only in lookup results, not in descriptors |
| 2179 case INTERCEPTOR: // only in lookup results, not in descriptors | 2179 case INTERCEPTOR: // only in lookup results, not in descriptors |
| 2180 case MAP_TRANSITION: // we do not care about transitions here... | 2180 case MAP_TRANSITION: // we do not care about transitions here... |
| 2181 case ELEMENTS_TRANSITION: | |
| 2182 case CONSTANT_TRANSITION: | 2181 case CONSTANT_TRANSITION: |
| 2183 case NULL_DESCRIPTOR: // ... and not about "holes" | 2182 case NULL_DESCRIPTOR: // ... and not about "holes" |
| 2184 break; | 2183 break; |
| 2185 } | 2184 } |
| 2186 } | 2185 } |
| 2187 } else { | 2186 } else { |
| 2188 StringDictionary* dictionary = js_obj->property_dictionary(); | 2187 StringDictionary* dictionary = js_obj->property_dictionary(); |
| 2189 int length = dictionary->Capacity(); | 2188 int length = dictionary->Capacity(); |
| 2190 for (int i = 0; i < length; ++i) { | 2189 for (int i = 0; i < length; ++i) { |
| 2191 Object* k = dictionary->KeyAt(i); | 2190 Object* k = dictionary->KeyAt(i); |
| (...skipping 1332 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3524 | 3523 |
| 3525 | 3524 |
| 3526 void HeapSnapshotJSONSerializer::SortHashMap( | 3525 void HeapSnapshotJSONSerializer::SortHashMap( |
| 3527 HashMap* map, List<HashMap::Entry*>* sorted_entries) { | 3526 HashMap* map, List<HashMap::Entry*>* sorted_entries) { |
| 3528 for (HashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) | 3527 for (HashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) |
| 3529 sorted_entries->Add(p); | 3528 sorted_entries->Add(p); |
| 3530 sorted_entries->Sort(SortUsingEntryValue); | 3529 sorted_entries->Sort(SortUsingEntryValue); |
| 3531 } | 3530 } |
| 3532 | 3531 |
| 3533 } } // namespace v8::internal | 3532 } } // namespace v8::internal |
| OLD | NEW |