src/transitions-inl.h

   1 // Copyright 2012 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_TRANSITIONS_INL_H_
  29 #define V8_TRANSITIONS_INL_H_
  30
  31 #include "objects-inl.h"
  32 #include "transitions.h"
  33
  34 namespace v8 {
  35 namespace internal {
  36
  37
  38 #define FIELD_ADDR(p, offset) \
  39   (reinterpret_cast<byte*>(p) + offset - kHeapObjectTag)
  40
  41 #define WRITE_FIELD(p, offset, value) \
  42   (*reinterpret_cast<Object**>(FIELD_ADDR(p, offset)) = value)
  43
  44 #define CONDITIONAL_WRITE_BARRIER(heap, object, offset, value, mode)    \
  45   if (mode == UPDATE_WRITE_BARRIER) {                                   \
  46     heap->incremental_marking()->RecordWrite(                           \
  47       object, HeapObject::RawField(object, offset), value);             \
  48     if (heap->InNewSpace(value)) {                                      \
  49       heap->RecordWrite(object->address(), offset);                     \
  50     }                                                                   \
  51   }
  52
  53
  54 TransitionArray* TransitionArray::cast(Object* object) {
  55   ASSERT(object->IsTransitionArray());
  56   return reinterpret_cast<TransitionArray*>(object);
  57 }
  58
  59
  60 Map* TransitionArray::elements_transition() {
  61   Object* transition_map = get(kElementsTransitionIndex);
  62   return Map::cast(transition_map);
  63 }
  64
  65
  66 void TransitionArray::ClearElementsTransition() {
  67   WRITE_FIELD(this, kElementsTransitionOffset, Smi::FromInt(0));
  68 }
  69
  70
  71 bool TransitionArray::HasElementsTransition() {
  72   return IsFullTransitionArray() &&
  73       get(kElementsTransitionIndex) != Smi::FromInt(0);
  74 }
  75
  76
  77 void TransitionArray::set_elements_transition(Map* transition_map,
  78                                               WriteBarrierMode mode) {
  79   ASSERT(IsFullTransitionArray());
  80   Heap* heap = GetHeap();
  81   WRITE_FIELD(this, kElementsTransitionOffset, transition_map);
  82   CONDITIONAL_WRITE_BARRIER(
  83       heap, this, kElementsTransitionOffset, transition_map, mode);
  84 }
  85
  86
  87 Object** TransitionArray::GetDescriptorsSlot() {
  88   return HeapObject::RawField(reinterpret_cast<HeapObject*>(this),
  89                               kDescriptorsOffset);
  90 }
  91
  92
  93 DescriptorArray* TransitionArray::descriptors() {
  94   return DescriptorArray::cast(get(kDescriptorsIndex));
  95 }
  96
  97
  98 void TransitionArray::set_descriptors(DescriptorArray* descriptors) {
  99   ASSERT(descriptors->IsDescriptorArray());
 100   set(kDescriptorsIndex, descriptors);
 101 }
 102
 103
 104 Object* TransitionArray::back_pointer_storage() {
 105   return get(kBackPointerStorageIndex);
 106 }
 107
 108
 109 void TransitionArray::set_back_pointer_storage(Object* back_pointer,
 110                                                WriteBarrierMode mode) {
 111   Heap* heap = GetHeap();
 112   WRITE_FIELD(this, kBackPointerStorageOffset, back_pointer);
 113   CONDITIONAL_WRITE_BARRIER(
 114       heap, this, kBackPointerStorageOffset, back_pointer, mode);
 115 }
 116
 117
 118 bool TransitionArray::HasPrototypeTransitions() {
 119   return IsFullTransitionArray() &&
 120       get(kPrototypeTransitionsIndex) != Smi::FromInt(0);
 121 }
 122
 123
 124 FixedArray* TransitionArray::GetPrototypeTransitions() {
 125   ASSERT(IsFullTransitionArray());
 126   Object* prototype_transitions = get(kPrototypeTransitionsIndex);
 127   return FixedArray::cast(prototype_transitions);
 128 }
 129
 130
 131 HeapObject* TransitionArray::UncheckedPrototypeTransitions() {
 132   ASSERT(HasPrototypeTransitions());
 133   return reinterpret_cast<HeapObject*>(get(kPrototypeTransitionsIndex));
 134 }
 135
 136
 137 void TransitionArray::SetPrototypeTransitions(FixedArray* transitions,
 138                                               WriteBarrierMode mode) {
 139   ASSERT(IsFullTransitionArray());
 140   ASSERT(transitions->IsFixedArray());
 141   Heap* heap = GetHeap();
 142   WRITE_FIELD(this, kPrototypeTransitionsOffset, transitions);
 143   CONDITIONAL_WRITE_BARRIER(
 144       heap, this, kPrototypeTransitionsOffset, transitions, mode);
 145 }
 146
 147
 148 Object** TransitionArray::GetPrototypeTransitionsSlot() {
 149   return HeapObject::RawField(reinterpret_cast<HeapObject*>(this),
 150                               kPrototypeTransitionsOffset);
 151 }
 152
 153
 154 Object** TransitionArray::GetKeySlot(int transition_number) {
 155   ASSERT(!IsSimpleTransition());
 156   ASSERT(transition_number < number_of_transitions());
 157   return HeapObject::RawField(
 158       reinterpret_cast<HeapObject*>(this),
 159       OffsetOfElementAt(ToKeyIndex(transition_number)));
 160 }
 161
 162
 163 String* TransitionArray::GetKey(int transition_number) {
 164   if (IsSimpleTransition()) {
 165     Map* target = GetTarget(kSimpleTransitionIndex);
 166     int descriptor = target->LastAdded();
 167     String* key = target->instance_descriptors()->GetKey(descriptor);
 168     return key;
 169   }
 170   ASSERT(transition_number < number_of_transitions());
 171   return String::cast(get(ToKeyIndex(transition_number)));
 172 }
 173
 174
 175 void TransitionArray::SetKey(int transition_number, String* key) {
 176   ASSERT(!IsSimpleTransition());
 177   ASSERT(transition_number < number_of_transitions());
 178   set(ToKeyIndex(transition_number), key);
 179 }
 180
 181
 182 Map* TransitionArray::GetTarget(int transition_number) {
 183   if (IsSimpleTransition()) {
 184     ASSERT(transition_number == kSimpleTransitionIndex);
 185     return Map::cast(get(kSimpleTransitionTarget));
 186   }
 187   ASSERT(transition_number < number_of_transitions());
 188   return Map::cast(get(ToTargetIndex(transition_number)));
 189 }
 190
 191
 192 void TransitionArray::SetTarget(int transition_number, Map* value) {
 193   if (IsSimpleTransition()) {
 194     ASSERT(transition_number == kSimpleTransitionIndex);
 195     return set(kSimpleTransitionTarget, value);
 196   }
 197   ASSERT(transition_number < number_of_transitions());
 198   set(ToTargetIndex(transition_number), value);
 199 }
 200
 201
 202 PropertyDetails TransitionArray::GetTargetDetails(int transition_number) {
 203   Map* map = GetTarget(transition_number);
 204   DescriptorArray* descriptors = map->instance_descriptors();
 205   int descriptor = map->LastAdded();
 206   return descriptors->GetDetails(descriptor);
 207 }
 208
 209
 210 int TransitionArray::Search(String* name) {
 211   return internal::Search<ALL_ENTRIES>(this, name);
 212 }
 213
 214
 215 void TransitionArray::NoIncrementalWriteBarrierSet(int transition_number,
 216                                                    String* key,
 217                                                    Map* target) {
 218   FixedArray::NoIncrementalWriteBarrierSet(
 219       this, ToKeyIndex(transition_number), key);
 220   FixedArray::NoIncrementalWriteBarrierSet(
 221       this, ToTargetIndex(transition_number), target);
 222 }
 223
 224
 225 #undef FIELD_ADDR
 226 #undef WRITE_FIELD
 227 #undef CONDITIONAL_WRITE_BARRIER
 228
 229
 230 } }  // namespace v8::internal
 231
 232 #endif  // V8_TRANSITIONS_INL_H_