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 5980 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
5991 edge->index()))); | 5991 edge->index()))); |
5992 default: UNREACHABLE(); | 5992 default: UNREACHABLE(); |
5993 } | 5993 } |
5994 return v8::Undefined(); | 5994 return v8::Undefined(); |
5995 } | 5995 } |
5996 | 5996 |
5997 | 5997 |
5998 const HeapGraphNode* HeapGraphEdge::GetFromNode() const { | 5998 const HeapGraphNode* HeapGraphEdge::GetFromNode() const { |
5999 i::Isolate* isolate = i::Isolate::Current(); | 5999 i::Isolate* isolate = i::Isolate::Current(); |
6000 IsDeadCheck(isolate, "v8::HeapGraphEdge::GetFromNode"); | 6000 IsDeadCheck(isolate, "v8::HeapGraphEdge::GetFromNode"); |
6001 const i::HeapEntry* from = ToInternal(this)->from(); | 6001 const i::HeapEntry* from = ToInternal(this)->From(); |
6002 return reinterpret_cast<const HeapGraphNode*>(from); | 6002 return reinterpret_cast<const HeapGraphNode*>(from); |
6003 } | 6003 } |
6004 | 6004 |
6005 | 6005 |
6006 const HeapGraphNode* HeapGraphEdge::GetToNode() const { | 6006 const HeapGraphNode* HeapGraphEdge::GetToNode() const { |
6007 i::Isolate* isolate = i::Isolate::Current(); | 6007 i::Isolate* isolate = i::Isolate::Current(); |
6008 IsDeadCheck(isolate, "v8::HeapGraphEdge::GetToNode"); | 6008 IsDeadCheck(isolate, "v8::HeapGraphEdge::GetToNode"); |
6009 const i::HeapEntry* to = ToInternal(this)->to(); | 6009 const i::HeapEntry* to = ToInternal(this)->to(); |
6010 return reinterpret_cast<const HeapGraphNode*>(to); | 6010 return reinterpret_cast<const HeapGraphNode*>(to); |
6011 } | 6011 } |
(...skipping 367 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
6379 | 6379 |
6380 | 6380 |
6381 char* HandleScopeImplementer::Iterate(ObjectVisitor* v, char* storage) { | 6381 char* HandleScopeImplementer::Iterate(ObjectVisitor* v, char* storage) { |
6382 HandleScopeImplementer* scope_implementer = | 6382 HandleScopeImplementer* scope_implementer = |
6383 reinterpret_cast<HandleScopeImplementer*>(storage); | 6383 reinterpret_cast<HandleScopeImplementer*>(storage); |
6384 scope_implementer->IterateThis(v); | 6384 scope_implementer->IterateThis(v); |
6385 return storage + ArchiveSpacePerThread(); | 6385 return storage + ArchiveSpacePerThread(); |
6386 } | 6386 } |
6387 | 6387 |
6388 } } // namespace v8::internal | 6388 } } // namespace v8::internal |
OLD | NEW |