| 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 348 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 359 MapVerify(); | 359 MapVerify(); |
| 360 CHECK(is_shared()); | 360 CHECK(is_shared()); |
| 361 CHECK(instance_descriptors()->IsEmpty()); | 361 CHECK(instance_descriptors()->IsEmpty()); |
| 362 CHECK_EQ(0, pre_allocated_property_fields()); | 362 CHECK_EQ(0, pre_allocated_property_fields()); |
| 363 CHECK_EQ(0, unused_property_fields()); | 363 CHECK_EQ(0, unused_property_fields()); |
| 364 CHECK_EQ(StaticVisitorBase::GetVisitorId(instance_type(), instance_size()), | 364 CHECK_EQ(StaticVisitorBase::GetVisitorId(instance_type(), instance_size()), |
| 365 visitor_id()); | 365 visitor_id()); |
| 366 } | 366 } |
| 367 | 367 |
| 368 | 368 |
| 369 void Map::VerifyOmittedMapChecks() { | 369 void Map::VerifyOmittedPrototypeChecks() { |
| 370 if (!FLAG_omit_map_checks_for_leaf_maps) return; | 370 if (!FLAG_omit_prototype_checks_for_leaf_maps) return; |
| 371 if (!is_stable() || | 371 if (HasTransitionArray() || is_dictionary_map()) { |
| 372 is_deprecated() || | |
| 373 HasTransitionArray() || | |
| 374 is_dictionary_map()) { | |
| 375 CHECK_EQ(0, dependent_code()->number_of_entries( | 372 CHECK_EQ(0, dependent_code()->number_of_entries( |
| 376 DependentCode::kPrototypeCheckGroup)); | 373 DependentCode::kPrototypeCheckGroup)); |
| 377 } | 374 } |
| 378 } | 375 } |
| 379 | 376 |
| 380 | 377 |
| 381 void CodeCache::CodeCacheVerify() { | 378 void CodeCache::CodeCacheVerify() { |
| 382 VerifyHeapPointer(default_cache()); | 379 VerifyHeapPointer(default_cache()); |
| 383 VerifyHeapPointer(normal_type_cache()); | 380 VerifyHeapPointer(normal_type_cache()); |
| 384 CHECK(default_cache()->IsFixedArray()); | 381 CHECK(default_cache()->IsFixedArray()); |
| (...skipping 783 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1168 for (int i = 0; i < number_of_transitions(); ++i) { | 1165 for (int i = 0; i < number_of_transitions(); ++i) { |
| 1169 if (!CheckOneBackPointer(current_map, GetTarget(i))) return false; | 1166 if (!CheckOneBackPointer(current_map, GetTarget(i))) return false; |
| 1170 } | 1167 } |
| 1171 return true; | 1168 return true; |
| 1172 } | 1169 } |
| 1173 | 1170 |
| 1174 | 1171 |
| 1175 #endif // DEBUG | 1172 #endif // DEBUG |
| 1176 | 1173 |
| 1177 } } // namespace v8::internal | 1174 } } // namespace v8::internal |
| OLD | NEW |