| 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 are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 14 matching lines...) Expand all Loading... |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #ifndef DefaultSharedWorkerRepository_h | 31 #ifndef DefaultSharedWorkerRepository_h |
| 32 #define DefaultSharedWorkerRepository_h | 32 #define DefaultSharedWorkerRepository_h |
| 33 | 33 |
| 34 #include "core/page/ContentSecurityPolicy.h" | 34 #include "core/page/ContentSecurityPolicy.h" |
| 35 #include <wtf/Forward.h> | 35 #include "wtf/Forward.h" |
| 36 #include <wtf/HashMap.h> | 36 #include "wtf/HashMap.h" |
| 37 #include <wtf/Noncopyable.h> | 37 #include "wtf/Noncopyable.h" |
| 38 #include <wtf/PassOwnPtr.h> | 38 #include "wtf/PassOwnPtr.h" |
| 39 #include <wtf/PassRefPtr.h> | 39 #include "wtf/PassRefPtr.h" |
| 40 #include <wtf/RefPtr.h> | 40 #include "wtf/RefPtr.h" |
| 41 #include <wtf/text/StringHash.h> | 41 #include "wtf/Threading.h" |
| 42 #include <wtf/Threading.h> | 42 #include "wtf/text/StringHash.h" |
| 43 | 43 |
| 44 namespace WebCore { | 44 namespace WebCore { |
| 45 | 45 |
| 46 class Document; | 46 class Document; |
| 47 class ExceptionState; | 47 class ExceptionState; |
| 48 class KURL; | 48 class KURL; |
| 49 class MessagePortChannel; | 49 class MessagePortChannel; |
| 50 class ScriptExecutionContext; | 50 class ScriptExecutionContext; |
| 51 class SharedWorker; | 51 class SharedWorker; |
| 52 class SharedWorkerProxy; | 52 class SharedWorkerProxy; |
| (...skipping 26 matching lines...) Expand all Loading... |
| 79 Mutex m_lock; | 79 Mutex m_lock; |
| 80 | 80 |
| 81 // List of shared workers. Expectation is that there will be a limited n
umber of shared workers, and so tracking them in a Vector is more efficient than
nested HashMaps. | 81 // List of shared workers. Expectation is that there will be a limited n
umber of shared workers, and so tracking them in a Vector is more efficient than
nested HashMaps. |
| 82 typedef Vector<RefPtr<SharedWorkerProxy> > SharedWorkerProxyRepository; | 82 typedef Vector<RefPtr<SharedWorkerProxy> > SharedWorkerProxyRepository; |
| 83 SharedWorkerProxyRepository m_proxies; | 83 SharedWorkerProxyRepository m_proxies; |
| 84 }; | 84 }; |
| 85 | 85 |
| 86 } // namespace WebCore | 86 } // namespace WebCore |
| 87 | 87 |
| 88 #endif // DefaultSharedWorkerRepository_h | 88 #endif // DefaultSharedWorkerRepository_h |
| OLD | NEW |