| 1 | /*
|
|---|
| 2 | * Copyright (C) 1999-2000 Harri Porten ([email protected])
|
|---|
| 3 | * Copyright (C) 2003, 2007, 2008 Apple Inc. All rights reserved.
|
|---|
| 4 | *
|
|---|
| 5 | * This library is free software; you can redistribute it and/or
|
|---|
| 6 | * modify it under the terms of the GNU Lesser General Public
|
|---|
| 7 | * License as published by the Free Software Foundation; either
|
|---|
| 8 | * version 2 of the License, or (at your option) any later version.
|
|---|
| 9 | *
|
|---|
| 10 | * This library is distributed in the hope that it will be useful,
|
|---|
| 11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|---|
| 13 | * Lesser General Public License for more details.
|
|---|
| 14 | *
|
|---|
| 15 | * You should have received a copy of the GNU Lesser General Public
|
|---|
| 16 | * License along with this library; if not, write to the Free Software
|
|---|
| 17 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|---|
| 18 | *
|
|---|
| 19 | */
|
|---|
| 20 |
|
|---|
| 21 | #ifndef JSArray_h
|
|---|
| 22 | #define JSArray_h
|
|---|
| 23 |
|
|---|
| 24 | #include "JSObject.h"
|
|---|
| 25 |
|
|---|
| 26 | namespace KJS {
|
|---|
| 27 |
|
|---|
| 28 | typedef HashMap<unsigned, JSValue*> SparseArrayValueMap;
|
|---|
| 29 |
|
|---|
| 30 | struct ArrayStorage {
|
|---|
| 31 | unsigned m_length;
|
|---|
| 32 | unsigned m_vectorLength;
|
|---|
| 33 | unsigned m_numValuesInVector;
|
|---|
| 34 | SparseArrayValueMap* m_sparseValueMap;
|
|---|
| 35 | void* lazyCreationData; // A JSArray subclass can use this to fill the vector lazily.
|
|---|
| 36 | JSValue* m_vector[1];
|
|---|
| 37 | };
|
|---|
| 38 |
|
|---|
| 39 | class JSArray : public JSObject {
|
|---|
| 40 | friend class CTI;
|
|---|
| 41 |
|
|---|
| 42 | public:
|
|---|
| 43 | JSArray(PassRefPtr<StructureID>);
|
|---|
| 44 | JSArray(JSObject* prototype, unsigned initialLength);
|
|---|
| 45 | JSArray(ExecState* exec, JSObject* prototype, const ArgList& initialValues);
|
|---|
| 46 | virtual ~JSArray();
|
|---|
| 47 |
|
|---|
| 48 | virtual bool getOwnPropertySlot(ExecState*, const Identifier& propertyName, PropertySlot&);
|
|---|
| 49 | virtual bool getOwnPropertySlot(ExecState*, unsigned propertyName, PropertySlot&);
|
|---|
| 50 | virtual void put(ExecState*, unsigned propertyName, JSValue*); // FIXME: Make protected and add setItem.
|
|---|
| 51 |
|
|---|
| 52 | static const ClassInfo info;
|
|---|
| 53 |
|
|---|
| 54 | unsigned length() const { return m_storage->m_length; }
|
|---|
| 55 | void setLength(unsigned); // OK to use on new arrays, but not if it might be a RegExpMatchArray.
|
|---|
| 56 |
|
|---|
| 57 | void sort(ExecState*);
|
|---|
| 58 | void sort(ExecState*, JSValue* compareFunction, CallType, const CallData&);
|
|---|
| 59 |
|
|---|
| 60 | bool canGetIndex(unsigned i) { return i < m_fastAccessCutoff; }
|
|---|
| 61 | JSValue* getIndex(unsigned i)
|
|---|
| 62 | {
|
|---|
| 63 | ASSERT(canGetIndex(i));
|
|---|
| 64 | return m_storage->m_vector[i];
|
|---|
| 65 | }
|
|---|
| 66 |
|
|---|
| 67 | bool canSetIndex(unsigned i) { return i < m_fastAccessCutoff; }
|
|---|
| 68 | JSValue* setIndex(unsigned i, JSValue* v)
|
|---|
| 69 | {
|
|---|
| 70 | ASSERT(canSetIndex(i));
|
|---|
| 71 | return m_storage->m_vector[i] = v;
|
|---|
| 72 | }
|
|---|
| 73 |
|
|---|
| 74 | protected:
|
|---|
| 75 | virtual void put(ExecState*, const Identifier& propertyName, JSValue*, PutPropertySlot&);
|
|---|
| 76 | virtual bool deleteProperty(ExecState*, const Identifier& propertyName);
|
|---|
| 77 | virtual bool deleteProperty(ExecState*, unsigned propertyName);
|
|---|
| 78 | virtual void getPropertyNames(ExecState*, PropertyNameArray&);
|
|---|
| 79 | virtual void mark();
|
|---|
| 80 |
|
|---|
| 81 | void* lazyCreationData();
|
|---|
| 82 | void setLazyCreationData(void*);
|
|---|
| 83 |
|
|---|
| 84 | private:
|
|---|
| 85 | virtual const ClassInfo* classInfo() const { return &info; }
|
|---|
| 86 |
|
|---|
| 87 | bool getOwnPropertySlotSlowCase(ExecState*, unsigned propertyName, PropertySlot&);
|
|---|
| 88 | void putSlowCase(ExecState*, unsigned propertyName, JSValue*);
|
|---|
| 89 |
|
|---|
| 90 | bool increaseVectorLength(unsigned newLength);
|
|---|
| 91 |
|
|---|
| 92 | unsigned compactForSorting();
|
|---|
| 93 |
|
|---|
| 94 | enum ConsistencyCheckType { NormalConsistencyCheck, DestructorConsistencyCheck, SortConsistencyCheck };
|
|---|
| 95 | void checkConsistency(ConsistencyCheckType = NormalConsistencyCheck);
|
|---|
| 96 |
|
|---|
| 97 | unsigned m_fastAccessCutoff;
|
|---|
| 98 | ArrayStorage* m_storage;
|
|---|
| 99 | };
|
|---|
| 100 |
|
|---|
| 101 | JSArray* constructEmptyArray(ExecState*);
|
|---|
| 102 | JSArray* constructEmptyArray(ExecState*, unsigned initialLength);
|
|---|
| 103 | JSArray* constructArray(ExecState*, JSValue* singleItemValue);
|
|---|
| 104 | JSArray* constructArray(ExecState*, const ArgList& values);
|
|---|
| 105 |
|
|---|
| 106 | } // namespace KJS
|
|---|
| 107 |
|
|---|
| 108 | #endif // JSArray_h
|
|---|
