| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2009 Google Inc. All rights reserved. | 2 * Copyright (C) 2009 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
| 6 * are met: | 6 * are met: |
| 7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
| 8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
| 9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
| 10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
| (...skipping 64 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 75 return m_templatesForMainWorld; | 75 return m_templatesForMainWorld; |
| 76 return m_templatesForNonMainWorld; | 76 return m_templatesForNonMainWorld; |
| 77 } | 77 } |
| 78 | 78 |
| 79 v8::Handle<v8::FunctionTemplate> toStringTemplate(); | 79 v8::Handle<v8::FunctionTemplate> toStringTemplate(); |
| 80 | 80 |
| 81 StringCache* stringCache() { return m_stringCache.get(); } | 81 StringCache* stringCache() { return m_stringCache.get(); } |
| 82 | 82 |
| 83 v8::Persistent<v8::Value>& ensureLiveRoot(); | 83 v8::Persistent<v8::Value>& ensureLiveRoot(); |
| 84 | 84 |
| 85 DOMDataStoreList& allStores() { return m_domDataStoreList; } | |
| 86 | |
| 87 void registerDOMDataStore(DOMDataStore* domDataStore) | |
| 88 { | |
| 89 ASSERT(m_domDataStoreList.find(domDataStore) == kNotFound); | |
| 90 m_domDataStoreList.append(domDataStore); | |
| 91 } | |
| 92 | |
| 93 void unregisterDOMDataStore(DOMDataStore* domDataStore) | |
| 94 { | |
| 95 ASSERT(m_domDataStoreList.find(domDataStore) != kNotFound); | |
| 96 m_domDataStoreList.remove(m_domDataStoreList.find(domDataStore)); | |
| 97 } | |
| 98 | |
| 99 int recursionLevel() const { return m_recursionLevel; } | 85 int recursionLevel() const { return m_recursionLevel; } |
| 100 int incrementRecursionLevel() { return ++m_recursionLevel; } | 86 int incrementRecursionLevel() { return ++m_recursionLevel; } |
| 101 int decrementRecursionLevel() { return --m_recursionLevel; } | 87 int decrementRecursionLevel() { return --m_recursionLevel; } |
| 102 | 88 |
| 103 bool performingMicrotaskCheckpoint() const { return m_performingMicrotaskChe
ckpoint; } | 89 bool performingMicrotaskCheckpoint() const { return m_performingMicrotaskChe
ckpoint; } |
| 104 void setPerformingMicrotaskCheckpoint(bool performingMicrotaskCheckpoint) {
m_performingMicrotaskCheckpoint = performingMicrotaskCheckpoint; } | 90 void setPerformingMicrotaskCheckpoint(bool performingMicrotaskCheckpoint) {
m_performingMicrotaskCheckpoint = performingMicrotaskCheckpoint; } |
| 105 | 91 |
| 106 #ifndef NDEBUG | 92 #ifndef NDEBUG |
| 107 int internalScriptRecursionLevel() const { return m_internalScriptRecursionL
evel; } | 93 int internalScriptRecursionLevel() const { return m_internalScriptRecursionL
evel; } |
| 108 int incrementInternalScriptRecursionLevel() { return ++m_internalScriptRecur
sionLevel; } | 94 int incrementInternalScriptRecursionLevel() { return ++m_internalScriptRecur
sionLevel; } |
| (...skipping 21 matching lines...) Expand all Loading... |
| 130 v8::Handle<v8::Object> findInstanceInPrototypeChain(const WrapperTypeInfo*,
v8::Handle<v8::Value>, TemplateMap&); | 116 v8::Handle<v8::Object> findInstanceInPrototypeChain(const WrapperTypeInfo*,
v8::Handle<v8::Value>, TemplateMap&); |
| 131 | 117 |
| 132 v8::Isolate* m_isolate; | 118 v8::Isolate* m_isolate; |
| 133 OwnPtr<gin::IsolateHolder> m_isolateHolder; | 119 OwnPtr<gin::IsolateHolder> m_isolateHolder; |
| 134 bool m_isMainThread; // Caches the result of isMainThread() for performance. | 120 bool m_isMainThread; // Caches the result of isMainThread() for performance. |
| 135 TemplateMap m_templatesForMainWorld; | 121 TemplateMap m_templatesForMainWorld; |
| 136 TemplateMap m_templatesForNonMainWorld; | 122 TemplateMap m_templatesForNonMainWorld; |
| 137 ScopedPersistent<v8::FunctionTemplate> m_toStringTemplate; | 123 ScopedPersistent<v8::FunctionTemplate> m_toStringTemplate; |
| 138 OwnPtr<StringCache> m_stringCache; | 124 OwnPtr<StringCache> m_stringCache; |
| 139 | 125 |
| 140 Vector<DOMDataStore*> m_domDataStoreList; | |
| 141 | |
| 142 ScopedPersistent<v8::Value> m_liveRoot; | 126 ScopedPersistent<v8::Value> m_liveRoot; |
| 143 ScopedPersistent<v8::Context> m_regexContext; | 127 ScopedPersistent<v8::Context> m_regexContext; |
| 144 | 128 |
| 145 const char* m_previousSamplingState; | 129 const char* m_previousSamplingState; |
| 146 | 130 |
| 147 bool m_constructorMode; | 131 bool m_constructorMode; |
| 148 friend class ConstructorMode; | 132 friend class ConstructorMode; |
| 149 | 133 |
| 150 int m_recursionLevel; | 134 int m_recursionLevel; |
| 151 | 135 |
| 152 #ifndef NDEBUG | 136 #ifndef NDEBUG |
| 153 int m_internalScriptRecursionLevel; | 137 int m_internalScriptRecursionLevel; |
| 154 #endif | 138 #endif |
| 155 OwnPtr<GCEventData> m_gcEventData; | 139 OwnPtr<GCEventData> m_gcEventData; |
| 156 bool m_performingMicrotaskCheckpoint; | 140 bool m_performingMicrotaskCheckpoint; |
| 157 }; | 141 }; |
| 158 | 142 |
| 159 } // namespace WebCore | 143 } // namespace WebCore |
| 160 | 144 |
| 161 #endif // V8PerIsolateData_h | 145 #endif // V8PerIsolateData_h |
| OLD | NEW |