StructureTransitionTable.h 5.94 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
    AllocateContiguous,
47
48
49
50
    AllocateArrayStorage,
    AllocateSlowPutArrayStorage,
    SwitchToSlowPutArrayStorage,
    AddIndexedAccessors
51
52
53
54
55
56
57
58
59
60
};

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

inline IndexingType newIndexingType(IndexingType oldType, NonPropertyTransition transition)
{
    switch (transition) {
61
62
63
    case AllocateContiguous:
        ASSERT(!(oldType & (HasArrayStorage | HasSlowPutArrayStorage)));
        return oldType | HasContiguous;
64
    case AllocateArrayStorage:
65
        return (oldType & ~HasContiguous) | HasArrayStorage;
66
    case AllocateSlowPutArrayStorage:
67
        return (oldType & ~HasContiguous) | HasSlowPutArrayStorage;
68
69
    case SwitchToSlowPutArrayStorage:
        ASSERT(oldType & HasArrayStorage);
70
        ASSERT(!(oldType & HasContiguous));
71
72
73
        return (oldType & ~HasArrayStorage) | HasSlowPutArrayStorage;
    case AddIndexedAccessors:
        return oldType | MayHaveIndexedAccessors;
74
75
76
77
78
79
    default:
        ASSERT_NOT_REACHED();
        return oldType;
    }
}

80
81
82
83
class StructureTransitionTable {
    static const intptr_t UsingSingleSlotFlag = 1;

    struct Hash {
84
        typedef std::pair<RefPtr<StringImpl>, unsigned> Key;
85
86
        static unsigned hash(const Key& p)
        {
87
88
89
90
            unsigned result = p.second;
            if (p.first)
                result += p.first->existingHash();
            return result;
91
92
93
94
95
96
97
98
99
100
        }

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

        static const bool safeToCompareToEmptyOrDeleted = true;
    };

101
102
103
104
105
106
107
108
109
110
111
112
    struct WeakGCMapFinalizerCallback {
        static void* finalizerContextFor(Hash::Key)
        {
            return 0;
        }

        static inline Hash::Key keyForFinalizer(void* context, Structure* structure)
        {
            return keyForWeakGCMapFinalizer(context, structure);
        }
    };

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

    static Hash::Key keyForWeakGCMapFinalizer(void* context, Structure*);
116

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

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

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

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

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

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

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

    intptr_t m_data;
};

193
194
} // namespace JSC

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