1// Copyright 2011 the V8 project authors. All rights reserved. 2// Redistribution and use in source and binary forms, with or without 3// modification, are permitted provided that the following conditions are 4// met: 5// 6// * Redistributions of source code must retain the above copyright 7// notice, this list of conditions and the following disclaimer. 8// * Redistributions in binary form must reproduce the above 9// copyright notice, this list of conditions and the following 10// disclaimer in the documentation and/or other materials provided 11// with the distribution. 12// * Neither the name of Google Inc. nor the names of its 13// contributors may be used to endorse or promote products derived 14// from this software without specific prior written permission. 15// 16// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 28#ifndef V8_LIVEOBJECTLIST_INL_H_ 29#define V8_LIVEOBJECTLIST_INL_H_ 30 31#include "v8.h" 32 33#include "liveobjectlist.h" 34 35namespace v8 { 36namespace internal { 37 38#ifdef LIVE_OBJECT_LIST 39 40void LiveObjectList::GCEpilogue() { 41 if (!NeedLOLProcessing()) return; 42 GCEpiloguePrivate(); 43} 44 45 46void LiveObjectList::GCPrologue() { 47 if (!NeedLOLProcessing()) return; 48#ifdef VERIFY_LOL 49 if (FLAG_verify_lol) { 50 Verify(); 51 } 52#endif 53} 54 55 56void LiveObjectList::IterateElements(ObjectVisitor* v) { 57 if (!NeedLOLProcessing()) return; 58 IterateElementsPrivate(v); 59} 60 61 62void LiveObjectList::ProcessNonLive(HeapObject* obj) { 63 // Only do work if we have at least one list to process. 64 if (last()) DoProcessNonLive(obj); 65} 66 67 68void LiveObjectList::UpdateReferencesForScavengeGC() { 69 if (LiveObjectList::NeedLOLProcessing()) { 70 UpdateLiveObjectListVisitor update_visitor; 71 LiveObjectList::IterateElements(&update_visitor); 72 } 73} 74 75 76LiveObjectList* LiveObjectList::FindLolForId(int id, 77 LiveObjectList* start_lol) { 78 if (id != 0) { 79 LiveObjectList* lol = start_lol; 80 while (lol != NULL) { 81 if (lol->id() == id) { 82 return lol; 83 } 84 lol = lol->prev_; 85 } 86 } 87 return NULL; 88} 89 90 91// Iterates the elements in every lol and returns the one that matches the 92// specified key. If no matching element is found, then it returns NULL. 93template <typename T> 94inline LiveObjectList::Element* 95LiveObjectList::FindElementFor(T (*GetValue)(LiveObjectList::Element*), T key) { 96 LiveObjectList* lol = last(); 97 while (lol != NULL) { 98 Element* elements = lol->elements_; 99 for (int i = 0; i < lol->obj_count_; i++) { 100 Element* element = &elements[i]; 101 if (GetValue(element) == key) { 102 return element; 103 } 104 } 105 lol = lol->prev_; 106 } 107 return NULL; 108} 109 110 111inline int LiveObjectList::GetElementId(LiveObjectList::Element* element) { 112 return element->id_; 113} 114 115 116inline HeapObject* 117LiveObjectList::GetElementObj(LiveObjectList::Element* element) { 118 return element->obj_; 119} 120 121#endif // LIVE_OBJECT_LIST 122 123} } // namespace v8::internal 124 125#endif // V8_LIVEOBJECTLIST_INL_H_ 126 127