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 get(kElementsTransitionIndex) != Smi::FromInt(0);
  73 }
  74
  75
  76 void TransitionArray::set_elements_transition(Map* transition_map,
  77                                               WriteBarrierMode mode) {
  78   Heap* heap = GetHeap();
  79   WRITE_FIELD(this, kElementsTransitionOffset, transition_map);
  80   CONDITIONAL_WRITE_BARRIER(
  81       heap, this, kElementsTransitionOffset, transition_map, mode);
  82 }
  83
  84
  85 bool TransitionArray::HasPrototypeTransitions() {
  86   Object* prototype_transitions = get(kPrototypeTransitionsIndex);
  87   return prototype_transitions != Smi::FromInt(0);
  88 }
  89
  90
  91 FixedArray* TransitionArray::GetPrototypeTransitions() {
  92   Object* prototype_transitions = get(kPrototypeTransitionsIndex);
  93   return FixedArray::cast(prototype_transitions);
  94 }
  95
  96
  97 HeapObject* TransitionArray::UncheckedPrototypeTransitions() {
  98   Object* prototype_transitions = get(kPrototypeTransitionsIndex);
  99   if (prototype_transitions == Smi::FromInt(0)) return NULL;
 100   return reinterpret_cast<HeapObject*>(prototype_transitions);
 101 }
 102
 103
 104 void TransitionArray::SetPrototypeTransitions(FixedArray* transitions,
 105                                               WriteBarrierMode mode) {
 106   ASSERT(this != NULL);
 107   ASSERT(transitions->IsFixedArray());
 108   Heap* heap = GetHeap();
 109   WRITE_FIELD(this, kPrototypeTransitionsOffset, transitions);
 110   CONDITIONAL_WRITE_BARRIER(
 111       heap, this, kPrototypeTransitionsOffset, transitions, mode);
 112 }
 113
 114
 115 Object** TransitionArray::GetPrototypeTransitionsSlot() {
 116   return HeapObject::RawField(reinterpret_cast<HeapObject*>(this),
 117                               kPrototypeTransitionsOffset);
 118 }
 119
 120
 121 Object** TransitionArray::GetKeySlot(int transition_number) {
 122   ASSERT(transition_number < number_of_transitions());
 123   return HeapObject::RawField(
 124       reinterpret_cast<HeapObject*>(this),
 125       OffsetOfElementAt(ToKeyIndex(transition_number)));
 126 }
 127
 128
 129 String* TransitionArray::GetKey(int transition_number) {
 130   ASSERT(transition_number < number_of_transitions());
 131   return String::cast(get(ToKeyIndex(transition_number)));
 132 }
 133
 134
 135 void TransitionArray::SetKey(int transition_number, String* key) {
 136   ASSERT(transition_number < number_of_transitions());
 137   set(ToKeyIndex(transition_number), key);
 138 }
 139
 140
 141 Map* TransitionArray::GetTarget(int transition_number) {
 142   ASSERT(transition_number < number_of_transitions());
 143   return Map::cast(get(ToTargetIndex(transition_number)));
 144 }
 145
 146
 147 Object** TransitionArray::GetTargetSlot(int transition_number) {
 148   ASSERT(transition_number < number_of_transitions());
 149   return HeapObject::RawField(
 150       reinterpret_cast<HeapObject*>(this),
 151       OffsetOfElementAt(ToTargetIndex(transition_number)));
 152 }
 153
 154
 155 void TransitionArray::SetTarget(int transition_number, Map* value) {
 156   ASSERT(transition_number < number_of_transitions());
 157   set(ToTargetIndex(transition_number), value);
 158 }
 159
 160
 161 PropertyDetails TransitionArray::GetTargetDetails(int transition_number) {
 162   Map* map = GetTarget(transition_number);
 163   DescriptorArray* descriptors = map->instance_descriptors();
 164   int descriptor = map->LastAdded();
 165   ASSERT(descriptor != Map::kNoneAdded);
 166   return descriptors->GetDetails(descriptor);
 167 }
 168
 169
 170 Object** TransitionArray::GetElementsTransitionSlot() {
 171   return HeapObject::RawField(reinterpret_cast<HeapObject*>(this),
 172                               kElementsTransitionOffset);
 173 }
 174
 175
 176 int TransitionArray::Search(String* name) {
 177   return internal::Search(this, name);
 178 }
 179
 180
 181 void TransitionArray::Set(int transition_number,
 182                           String* key,
 183                           Map* target,
 184                           const WhitenessWitness&) {
 185   NoIncrementalWriteBarrierSet(this,
 186                                ToKeyIndex(transition_number),
 187                                key);
 188   NoIncrementalWriteBarrierSet(this,
 189                                ToTargetIndex(transition_number),
 190                                target);
 191 }
 192
 193
 194 #undef FIELD_ADDR
 195 #undef WRITE_FIELD
 196 #undef CONDITIONAL_WRITE_BARRIER
 197
 198
 199 } }  // namespace v8::internal
 200
 201 #endif  // V8_TRANSITIONS_INL_H_