StructureTransitionTable.h 6.28 KB
Newer Older
1
/*
2
 * Copyright (C) 2008, 2009, 2013 Apple Inc. All rights reserved.
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL APPLE COMPUTER, INC. OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 
 */

darin@apple.com's avatar
darin@apple.com committed
26
27
#ifndef StructureTransitionTable_h
#define StructureTransitionTable_h
28

29
#include "IndexingType.h"
30
#include "WeakGCMap.h"
31
#include <wtf/HashFunctions.h>
32
#include <wtf/OwnPtr.h>
33
#include <wtf/text/StringImpl.h>
34
35
36

namespace JSC {

37
class JSCell;
38
class Structure;
39

40
41
42
43
44
static const unsigned FirstInternalAttribute = 1 << 6; // Use for transitions that don't have to do with property additions.

// Support for attributes used to indicate transitions not related to properties.
// If any of these are used, the string portion of the key should be 0.
enum NonPropertyTransition {
45
46
47
    AllocateUndecided,
    AllocateInt32,
    AllocateDouble,
48
    AllocateContiguous,
49
50
51
52
    AllocateArrayStorage,
    AllocateSlowPutArrayStorage,
    SwitchToSlowPutArrayStorage,
    AddIndexedAccessors
53
54
55
56
57
58
59
60
61
62
};

inline unsigned toAttributes(NonPropertyTransition transition)
{
    return transition + FirstInternalAttribute;
}

inline IndexingType newIndexingType(IndexingType oldType, NonPropertyTransition transition)
{
    switch (transition) {
63
    case AllocateUndecided:
64
        ASSERT(!hasIndexedProperties(oldType));
65
66
67
68
69
70
71
72
73
74
        return oldType | UndecidedShape;
    case AllocateInt32:
        ASSERT(!hasIndexedProperties(oldType) || hasUndecided(oldType));
        return (oldType & ~IndexingShapeMask) | Int32Shape;
    case AllocateDouble:
        ASSERT(!hasIndexedProperties(oldType) || hasUndecided(oldType) || hasInt32(oldType));
        return (oldType & ~IndexingShapeMask) | DoubleShape;
    case AllocateContiguous:
        ASSERT(!hasIndexedProperties(oldType) || hasUndecided(oldType) || hasInt32(oldType) || hasDouble(oldType));
        return (oldType & ~IndexingShapeMask) | ContiguousShape;
75
    case AllocateArrayStorage:
76
        ASSERT(!hasIndexedProperties(oldType) || hasUndecided(oldType) || hasInt32(oldType) || hasDouble(oldType) || hasContiguous(oldType));
77
        return (oldType & ~IndexingShapeMask) | ArrayStorageShape;
78
    case AllocateSlowPutArrayStorage:
79
        ASSERT(!hasIndexedProperties(oldType) || hasUndecided(oldType) || hasInt32(oldType) || hasDouble(oldType) || hasContiguous(oldType) || hasContiguous(oldType));
80
        return (oldType & ~IndexingShapeMask) | SlowPutArrayStorageShape;
81
    case SwitchToSlowPutArrayStorage:
82
83
        ASSERT(hasFastArrayStorage(oldType));
        return (oldType & ~IndexingShapeMask) | SlowPutArrayStorageShape;
84
85
    case AddIndexedAccessors:
        return oldType | MayHaveIndexedAccessors;
86
    default:
87
        RELEASE_ASSERT_NOT_REACHED();
88
89
90
91
        return oldType;
    }
}

92
93
94
class StructureTransitionTable {
    static const intptr_t UsingSingleSlotFlag = 1;

95
    
96
    struct Hash {
97
98
        typedef std::pair<StringImpl*, unsigned> Key;
        
99
100
        static unsigned hash(const Key& p)
        {
101
            return PtrHash<StringImpl*>::hash(p.first) + p.second;
102
103
104
105
106
107
108
109
110
111
        }

        static bool equal(const Key& a, const Key& b)
        {
            return a == b;
        }

        static const bool safeToCompareToEmptyOrDeleted = true;
    };

112
    typedef WeakGCMap<Hash::Key, Structure, Hash> TransitionMap;
113

114
115
116
117
118
119
120
121
public:
    StructureTransitionTable()
        : m_data(UsingSingleSlotFlag)
    {
    }

    ~StructureTransitionTable()
    {
122
        if (!isUsingSingleSlot()) {
123
            delete map();
124
125
126
            return;
        }

127
128
        WeakImpl* impl = this->weakImpl();
        if (!impl)
129
            return;
ggaren@apple.com's avatar
Renamed    
ggaren@apple.com committed
130
        WeakSet::deallocate(impl);
131
132
    }

ggaren@apple.com's avatar
ggaren@apple.com committed
133
    inline void add(VM&, Structure*);
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
    inline bool contains(StringImpl* rep, unsigned attributes) const;
    inline Structure* get(StringImpl* rep, unsigned attributes) const;

private:
    bool isUsingSingleSlot() const
    {
        return m_data & UsingSingleSlotFlag;
    }

    TransitionMap* map() const
    {
        ASSERT(!isUsingSingleSlot());
        return reinterpret_cast<TransitionMap*>(m_data);
    }

149
    WeakImpl* weakImpl() const
150
151
    {
        ASSERT(isUsingSingleSlot());
152
        return reinterpret_cast<WeakImpl*>(m_data & ~UsingSingleSlotFlag);
153
154
    }

155
156
157
    void setMap(TransitionMap* map)
    {
        ASSERT(isUsingSingleSlot());
158
        
159
        if (WeakImpl* impl = this->weakImpl())
ggaren@apple.com's avatar
Renamed    
ggaren@apple.com committed
160
            WeakSet::deallocate(impl);
161
162
163
164
165
166
167
168
169
170

        // This implicitly clears the flag that indicates we're using a single transition
        m_data = reinterpret_cast<intptr_t>(map);

        ASSERT(!isUsingSingleSlot());
    }

    Structure* singleTransition() const
    {
        ASSERT(isUsingSingleSlot());
171
172
173
        if (WeakImpl* impl = this->weakImpl()) {
            if (impl->state() == WeakImpl::Live)
                return reinterpret_cast<Structure*>(impl->jsValue().asCell());
174
175
        }
        return 0;
176
    }
177
    
ggaren@apple.com's avatar
ggaren@apple.com committed
178
    void setSingleTransition(VM&, Structure* structure)
179
180
    {
        ASSERT(isUsingSingleSlot());
181
        if (WeakImpl* impl = this->weakImpl())
ggaren@apple.com's avatar
Renamed    
ggaren@apple.com committed
182
            WeakSet::deallocate(impl);
183
        WeakImpl* impl = WeakSet::allocate(reinterpret_cast<JSCell*>(structure));
184
        m_data = reinterpret_cast<intptr_t>(impl) | UsingSingleSlotFlag;
185
186
187
188
189
    }

    intptr_t m_data;
};

190
191
} // namespace JSC

darin@apple.com's avatar
darin@apple.com committed
192
#endif // StructureTransitionTable_h