Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(132)

Side by Side Diff: src/heap/objects-visiting.h

Issue 1488593003: Optimize clearing of map transitions. (Closed) Base URL: https://chromium.googlesource.com/v8/v8.git@master
Patch Set: base Created 5 years ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 // Copyright 2012 the V8 project authors. All rights reserved. 1 // Copyright 2012 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be 2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file. 3 // found in the LICENSE file.
4 4
5 #ifndef V8_OBJECTS_VISITING_H_ 5 #ifndef V8_OBJECTS_VISITING_H_
6 #define V8_OBJECTS_VISITING_H_ 6 #define V8_OBJECTS_VISITING_H_
7 7
8 #include "src/allocation.h" 8 #include "src/allocation.h"
9 #include "src/heap/heap.h" 9 #include "src/heap/heap.h"
10 #include "src/heap/spaces.h" 10 #include "src/heap/spaces.h"
(...skipping 356 matching lines...) Expand 10 before | Expand all | Expand 10 after
367 INLINE(static void VisitCode(Map* map, HeapObject* object)); 367 INLINE(static void VisitCode(Map* map, HeapObject* object));
368 INLINE(static void VisitSharedFunctionInfo(Map* map, HeapObject* object)); 368 INLINE(static void VisitSharedFunctionInfo(Map* map, HeapObject* object));
369 INLINE(static void VisitAllocationSite(Map* map, HeapObject* object)); 369 INLINE(static void VisitAllocationSite(Map* map, HeapObject* object));
370 INLINE(static void VisitWeakCollection(Map* map, HeapObject* object)); 370 INLINE(static void VisitWeakCollection(Map* map, HeapObject* object));
371 INLINE(static void VisitJSFunction(Map* map, HeapObject* object)); 371 INLINE(static void VisitJSFunction(Map* map, HeapObject* object));
372 INLINE(static void VisitJSRegExp(Map* map, HeapObject* object)); 372 INLINE(static void VisitJSRegExp(Map* map, HeapObject* object));
373 INLINE(static void VisitJSArrayBuffer(Map* map, HeapObject* object)); 373 INLINE(static void VisitJSArrayBuffer(Map* map, HeapObject* object));
374 INLINE(static void VisitNativeContext(Map* map, HeapObject* object)); 374 INLINE(static void VisitNativeContext(Map* map, HeapObject* object));
375 INLINE(static void VisitBytecodeArray(Map* map, HeapObject* object)); 375 INLINE(static void VisitBytecodeArray(Map* map, HeapObject* object));
376 376
377 // Mark pointers in a Map and its TransitionArray together, possibly 377 // Mark pointers in a Map treating some elements of the descriptor array weak.
378 // treating transitions or back pointers weak.
379 static void MarkMapContents(Heap* heap, Map* map); 378 static void MarkMapContents(Heap* heap, Map* map);
380 static void MarkTransitionArray(Heap* heap, TransitionArray* transitions);
381 379
382 // Mark pointers in the optimized code map that should act as strong 380 // Mark pointers in the optimized code map that should act as strong
383 // references, possibly treating some entries weak. 381 // references, possibly treating some entries weak.
384 static void MarkOptimizedCodeMap(Heap* heap, FixedArray* code_map); 382 static void MarkOptimizedCodeMap(Heap* heap, FixedArray* code_map);
385 383
386 // Mark non-optimized code for functions inlined into the given optimized 384 // Mark non-optimized code for functions inlined into the given optimized
387 // code. This will prevent it from being flushed. 385 // code. This will prevent it from being flushed.
388 static void MarkInlinedFunctionsCode(Heap* heap, Code* code); 386 static void MarkInlinedFunctionsCode(Heap* heap, Code* code);
389 387
390 // Code flushing support. 388 // Code flushing support.
(...skipping 42 matching lines...) Expand 10 before | Expand all | Expand 10 after
433 // the next element. Given the head of the list, this function removes dead 431 // the next element. Given the head of the list, this function removes dead
434 // elements from the list and if requested records slots for next-element 432 // elements from the list and if requested records slots for next-element
435 // pointers. The template parameter T is a WeakListVisitor that defines how to 433 // pointers. The template parameter T is a WeakListVisitor that defines how to
436 // access the next-element pointers. 434 // access the next-element pointers.
437 template <class T> 435 template <class T>
438 Object* VisitWeakList(Heap* heap, Object* list, WeakObjectRetainer* retainer); 436 Object* VisitWeakList(Heap* heap, Object* list, WeakObjectRetainer* retainer);
439 } // namespace internal 437 } // namespace internal
440 } // namespace v8 438 } // namespace v8
441 439
442 #endif // V8_OBJECTS_VISITING_H_ 440 #endif // V8_OBJECTS_VISITING_H_
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698