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 522 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
533 void set_retained_size(int value) { retained_size_ = value; } | 533 void set_retained_size(int value) { retained_size_ = value; } |
534 int ordered_index() { return ordered_index_; } | 534 int ordered_index() { return ordered_index_; } |
535 void set_ordered_index(int value) { ordered_index_ = value; } | 535 void set_ordered_index(int value) { ordered_index_ = value; } |
536 | 536 |
537 Vector<HeapGraphEdge> children() { | 537 Vector<HeapGraphEdge> children() { |
538 return Vector<HeapGraphEdge>(children_arr(), children_count_); } | 538 return Vector<HeapGraphEdge>(children_arr(), children_count_); } |
539 Vector<HeapGraphEdge*> retainers() { | 539 Vector<HeapGraphEdge*> retainers() { |
540 return Vector<HeapGraphEdge*>(retainers_arr(), retainers_count_); } | 540 return Vector<HeapGraphEdge*>(retainers_arr(), retainers_count_); } |
541 List<HeapGraphPath*>* GetRetainingPaths(); | 541 List<HeapGraphPath*>* GetRetainingPaths(); |
542 HeapEntry* dominator() { return dominator_; } | 542 HeapEntry* dominator() { return dominator_; } |
543 void set_dominator(HeapEntry* entry) { dominator_ = entry; } | 543 void set_dominator(HeapEntry* entry) { |
| 544 ASSERT(entry != NULL); |
| 545 dominator_ = entry; |
| 546 } |
544 | 547 |
545 void clear_paint() { painted_ = kUnpainted; } | 548 void clear_paint() { painted_ = kUnpainted; } |
546 bool painted_reachable() { return painted_ == kPainted; } | 549 bool painted_reachable() { return painted_ == kPainted; } |
547 void paint_reachable() { | 550 void paint_reachable() { |
548 ASSERT(painted_ == kUnpainted); | 551 ASSERT(painted_ == kUnpainted); |
549 painted_ = kPainted; | 552 painted_ = kPainted; |
550 } | 553 } |
551 bool not_painted_reachable_from_others() { | 554 bool not_painted_reachable_from_others() { |
552 return painted_ != kPaintedReachableFromOthers; | 555 return painted_ != kPaintedReachableFromOthers; |
553 } | 556 } |
(...skipping 522 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1076 }; | 1079 }; |
1077 | 1080 |
1078 | 1081 |
1079 String* GetConstructorNameForHeapProfile(JSObject* object); | 1082 String* GetConstructorNameForHeapProfile(JSObject* object); |
1080 | 1083 |
1081 } } // namespace v8::internal | 1084 } } // namespace v8::internal |
1082 | 1085 |
1083 #endif // ENABLE_LOGGING_AND_PROFILING | 1086 #endif // ENABLE_LOGGING_AND_PROFILING |
1084 | 1087 |
1085 #endif // V8_PROFILE_GENERATOR_H_ | 1088 #endif // V8_PROFILE_GENERATOR_H_ |
OLD | NEW |