| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 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 5318 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5329 void PathTracer::ProcessResults() { | 5329 void PathTracer::ProcessResults() { |
| 5330 if (found_target_) { | 5330 if (found_target_) { |
| 5331 PrintF("=====================================\n"); | 5331 PrintF("=====================================\n"); |
| 5332 PrintF("==== Path to object ====\n"); | 5332 PrintF("==== Path to object ====\n"); |
| 5333 PrintF("=====================================\n\n"); | 5333 PrintF("=====================================\n\n"); |
| 5334 | 5334 |
| 5335 ASSERT(!object_stack_.is_empty()); | 5335 ASSERT(!object_stack_.is_empty()); |
| 5336 for (int i = 0; i < object_stack_.length(); i++) { | 5336 for (int i = 0; i < object_stack_.length(); i++) { |
| 5337 if (i > 0) PrintF("\n |\n |\n V\n\n"); | 5337 if (i > 0) PrintF("\n |\n |\n V\n\n"); |
| 5338 Object* obj = object_stack_[i]; | 5338 Object* obj = object_stack_[i]; |
| 5339 #ifdef OBJECT_PRINT |
| 5339 obj->Print(); | 5340 obj->Print(); |
| 5341 #else |
| 5342 obj->ShortPrint(); |
| 5343 #endif |
| 5340 } | 5344 } |
| 5341 PrintF("=====================================\n"); | 5345 PrintF("=====================================\n"); |
| 5342 } | 5346 } |
| 5343 } | 5347 } |
| 5344 #endif // DEBUG || LIVE_OBJECT_LIST | 5348 #endif // DEBUG || LIVE_OBJECT_LIST |
| 5345 | 5349 |
| 5346 | 5350 |
| 5347 #ifdef DEBUG | 5351 #ifdef DEBUG |
| 5348 // Triggers a depth-first traversal of reachable objects from roots | 5352 // Triggers a depth-first traversal of reachable objects from roots |
| 5349 // and finds a path to a specific heap object and prints it. | 5353 // and finds a path to a specific heap object and prints it. |
| (...skipping 256 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5606 void ExternalStringTable::TearDown() { | 5610 void ExternalStringTable::TearDown() { |
| 5607 new_space_strings_.Free(); | 5611 new_space_strings_.Free(); |
| 5608 old_space_strings_.Free(); | 5612 old_space_strings_.Free(); |
| 5609 } | 5613 } |
| 5610 | 5614 |
| 5611 | 5615 |
| 5612 List<Object*> ExternalStringTable::new_space_strings_; | 5616 List<Object*> ExternalStringTable::new_space_strings_; |
| 5613 List<Object*> ExternalStringTable::old_space_strings_; | 5617 List<Object*> ExternalStringTable::old_space_strings_; |
| 5614 | 5618 |
| 5615 } } // namespace v8::internal | 5619 } } // namespace v8::internal |
| OLD | NEW |