| 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 4651 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 4662 } | 4662 } |
| 4663 | 4663 |
| 4664 | 4664 |
| 4665 Handle<Value> HeapGraphEdge::GetName() const { | 4665 Handle<Value> HeapGraphEdge::GetName() const { |
| 4666 IsDeadCheck("v8::HeapGraphEdge::GetName"); | 4666 IsDeadCheck("v8::HeapGraphEdge::GetName"); |
| 4667 i::HeapGraphEdge* edge = ToInternal(this); | 4667 i::HeapGraphEdge* edge = ToInternal(this); |
| 4668 switch (edge->type()) { | 4668 switch (edge->type()) { |
| 4669 case i::HeapGraphEdge::kContextVariable: | 4669 case i::HeapGraphEdge::kContextVariable: |
| 4670 case i::HeapGraphEdge::kInternal: | 4670 case i::HeapGraphEdge::kInternal: |
| 4671 case i::HeapGraphEdge::kProperty: | 4671 case i::HeapGraphEdge::kProperty: |
| 4672 case i::HeapGraphEdge::kShortcut: |
| 4672 return Handle<String>(ToApi<String>(i::Factory::LookupAsciiSymbol( | 4673 return Handle<String>(ToApi<String>(i::Factory::LookupAsciiSymbol( |
| 4673 edge->name()))); | 4674 edge->name()))); |
| 4674 case i::HeapGraphEdge::kElement: | 4675 case i::HeapGraphEdge::kElement: |
| 4676 case i::HeapGraphEdge::kHidden: |
| 4675 return Handle<Number>(ToApi<Number>(i::Factory::NewNumberFromInt( | 4677 return Handle<Number>(ToApi<Number>(i::Factory::NewNumberFromInt( |
| 4676 edge->index()))); | 4678 edge->index()))); |
| 4677 default: UNREACHABLE(); | 4679 default: UNREACHABLE(); |
| 4678 } | 4680 } |
| 4679 return ImplementationUtilities::Undefined(); | 4681 return ImplementationUtilities::Undefined(); |
| 4680 } | 4682 } |
| 4681 | 4683 |
| 4682 | 4684 |
| 4683 const HeapGraphNode* HeapGraphEdge::GetFromNode() const { | 4685 const HeapGraphNode* HeapGraphEdge::GetFromNode() const { |
| 4684 IsDeadCheck("v8::HeapGraphEdge::GetFromNode"); | 4686 IsDeadCheck("v8::HeapGraphEdge::GetFromNode"); |
| (...skipping 318 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5003 | 5005 |
| 5004 | 5006 |
| 5005 char* HandleScopeImplementer::Iterate(ObjectVisitor* v, char* storage) { | 5007 char* HandleScopeImplementer::Iterate(ObjectVisitor* v, char* storage) { |
| 5006 HandleScopeImplementer* thread_local = | 5008 HandleScopeImplementer* thread_local = |
| 5007 reinterpret_cast<HandleScopeImplementer*>(storage); | 5009 reinterpret_cast<HandleScopeImplementer*>(storage); |
| 5008 thread_local->IterateThis(v); | 5010 thread_local->IterateThis(v); |
| 5009 return storage + ArchiveSpacePerThread(); | 5011 return storage + ArchiveSpacePerThread(); |
| 5010 } | 5012 } |
| 5011 | 5013 |
| 5012 } } // namespace v8::internal | 5014 } } // namespace v8::internal |
| OLD | NEW |