| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 470 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 481 void CpuProfile::Print() { | 481 void CpuProfile::Print() { |
| 482 OS::Print("[Top down]:\n"); | 482 OS::Print("[Top down]:\n"); |
| 483 top_down_.Print(); | 483 top_down_.Print(); |
| 484 OS::Print("[Bottom up]:\n"); | 484 OS::Print("[Bottom up]:\n"); |
| 485 bottom_up_.Print(); | 485 bottom_up_.Print(); |
| 486 } | 486 } |
| 487 | 487 |
| 488 | 488 |
| 489 CodeEntry* const CodeMap::kSharedFunctionCodeEntry = NULL; | 489 CodeEntry* const CodeMap::kSharedFunctionCodeEntry = NULL; |
| 490 const CodeMap::CodeTreeConfig::Key CodeMap::CodeTreeConfig::kNoKey = NULL; | 490 const CodeMap::CodeTreeConfig::Key CodeMap::CodeTreeConfig::kNoKey = NULL; |
| 491 const CodeMap::CodeTreeConfig::Value CodeMap::CodeTreeConfig::kNoValue = | |
| 492 CodeMap::CodeEntryInfo(NULL, 0); | |
| 493 | 491 |
| 494 | 492 |
| 495 void CodeMap::AddCode(Address addr, CodeEntry* entry, unsigned size) { | 493 void CodeMap::AddCode(Address addr, CodeEntry* entry, unsigned size) { |
| 496 DeleteAllCoveredCode(addr, addr + size); | 494 DeleteAllCoveredCode(addr, addr + size); |
| 497 CodeTree::Locator locator; | 495 CodeTree::Locator locator; |
| 498 tree_.Insert(addr, &locator); | 496 tree_.Insert(addr, &locator); |
| 499 locator.set_value(CodeEntryInfo(entry, size)); | 497 locator.set_value(CodeEntryInfo(entry, size)); |
| 500 } | 498 } |
| 501 | 499 |
| 502 | 500 |
| (...skipping 2892 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3395 | 3393 |
| 3396 | 3394 |
| 3397 void HeapSnapshotJSONSerializer::SortHashMap( | 3395 void HeapSnapshotJSONSerializer::SortHashMap( |
| 3398 HashMap* map, List<HashMap::Entry*>* sorted_entries) { | 3396 HashMap* map, List<HashMap::Entry*>* sorted_entries) { |
| 3399 for (HashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) | 3397 for (HashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) |
| 3400 sorted_entries->Add(p); | 3398 sorted_entries->Add(p); |
| 3401 sorted_entries->Sort(SortUsingEntryValue); | 3399 sorted_entries->Sort(SortUsingEntryValue); |
| 3402 } | 3400 } |
| 3403 | 3401 |
| 3404 } } // namespace v8::internal | 3402 } } // namespace v8::internal |
| OLD | NEW |