StructureTransitionTable.h 6.39 KB
Newer Older
1
/*
2
 * Copyright (C) 2008, 2009 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/RefPtr.h>
34
#include <wtf/text/StringImpl.h>
35
36
37

namespace JSC {

38
class JSCell;
39
class Structure;
40

41
42
43
44
45
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 {
46
47
48
    AllocateUndecided,
    AllocateInt32,
    AllocateDouble,
49
    AllocateContiguous,
50
51
52
53
    AllocateArrayStorage,
    AllocateSlowPutArrayStorage,
    SwitchToSlowPutArrayStorage,
    AddIndexedAccessors
54
55
56
57
58
59
60
61
62
63
};

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

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

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

    struct Hash {
97
        typedef std::pair<RefPtr<StringImpl>, unsigned> Key;
98
99
        static unsigned hash(const Key& p)
        {
100
101
102
103
            unsigned result = p.second;
            if (p.first)
                result += p.first->existingHash();
            return result;
104
105
106
107
108
109
110
111
112
113
        }

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

        static const bool safeToCompareToEmptyOrDeleted = true;
    };

114
    typedef WeakGCMap<Hash::Key, Structure, Hash> TransitionMap;
115

116
117
118
119
120
121
122
123
public:
    StructureTransitionTable()
        : m_data(UsingSingleSlotFlag)
    {
    }

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

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

135
    inline void add(JSGlobalData&, Structure*);
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
    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);
    }

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

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

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

    intptr_t m_data;
};

192
193
} // namespace JSC

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