| 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 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 88 StringCache* stringCache() { return m_stringCache.get(); } | 88 StringCache* stringCache() { return m_stringCache.get(); } |
| 89 | 89 |
| 90 v8::Persistent<v8::Value>& ensureLiveRoot(); | 90 v8::Persistent<v8::Value>& ensureLiveRoot(); |
| 91 | 91 |
| 92 DOMDataList& allStores() { return m_domDataList; } | 92 DOMDataList& allStores() { return m_domDataList; } |
| 93 | 93 |
| 94 V8HiddenPropertyName* hiddenPropertyName() { return m_hiddenPropertyName.get
(); } | 94 V8HiddenPropertyName* hiddenPropertyName() { return m_hiddenPropertyName.get
(); } |
| 95 | 95 |
| 96 void registerDOMDataStore(DOMDataStore* domDataStore) | 96 void registerDOMDataStore(DOMDataStore* domDataStore) |
| 97 { | 97 { |
| 98 ASSERT(m_domDataList.find(domDataStore) == notFound); | 98 ASSERT(m_domDataList.find(domDataStore) == kNotFound); |
| 99 m_domDataList.append(domDataStore); | 99 m_domDataList.append(domDataStore); |
| 100 } | 100 } |
| 101 | 101 |
| 102 void unregisterDOMDataStore(DOMDataStore* domDataStore) | 102 void unregisterDOMDataStore(DOMDataStore* domDataStore) |
| 103 { | 103 { |
| 104 ASSERT(m_domDataList.find(domDataStore) != notFound); | 104 ASSERT(m_domDataList.find(domDataStore) != kNotFound); |
| 105 m_domDataList.remove(m_domDataList.find(domDataStore)); | 105 m_domDataList.remove(m_domDataList.find(domDataStore)); |
| 106 } | 106 } |
| 107 | 107 |
| 108 // DOMDataStore is owned outside V8PerIsolateData. | 108 // DOMDataStore is owned outside V8PerIsolateData. |
| 109 DOMDataStore* workerDOMDataStore() { return m_workerDomDataStore; } | 109 DOMDataStore* workerDOMDataStore() { return m_workerDomDataStore; } |
| 110 void setWorkerDOMDataStore(DOMDataStore* store) { m_workerDomDataStore = sto
re; } | 110 void setWorkerDOMDataStore(DOMDataStore* store) { m_workerDomDataStore = sto
re; } |
| 111 | 111 |
| 112 int recursionLevel() const { return m_recursionLevel; } | 112 int recursionLevel() const { return m_recursionLevel; } |
| 113 int incrementRecursionLevel() { return ++m_recursionLevel; } | 113 int incrementRecursionLevel() { return ++m_recursionLevel; } |
| 114 int decrementRecursionLevel() { return --m_recursionLevel; } | 114 int decrementRecursionLevel() { return --m_recursionLevel; } |
| (...skipping 58 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 173 #ifndef NDEBUG | 173 #ifndef NDEBUG |
| 174 int m_internalScriptRecursionLevel; | 174 int m_internalScriptRecursionLevel; |
| 175 #endif | 175 #endif |
| 176 OwnPtr<GCEventData> m_gcEventData; | 176 OwnPtr<GCEventData> m_gcEventData; |
| 177 bool m_shouldCollectGarbageSoon; | 177 bool m_shouldCollectGarbageSoon; |
| 178 }; | 178 }; |
| 179 | 179 |
| 180 } // namespace WebCore | 180 } // namespace WebCore |
| 181 | 181 |
| 182 #endif // V8PerIsolateData_h | 182 #endif // V8PerIsolateData_h |
| OLD | NEW |