| OLD | NEW |
| 1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "core/html/parser/TokenizedChunkQueue.h" | 5 #include "core/html/parser/TokenizedChunkQueue.h" |
| 6 | 6 |
| 7 #include "platform/RuntimeEnabledFeatures.h" | 7 #include "platform/RuntimeEnabledFeatures.h" |
| 8 #include <algorithm> | 8 #include <algorithm> |
| 9 #include <memory> | 9 #include <memory> |
| 10 | 10 |
| 11 namespace blink { | 11 namespace blink { |
| 12 | 12 |
| 13 namespace { | 13 TokenizedChunkQueue::TokenizedChunkQueue() {} |
| 14 | |
| 15 // TODO(csharrison): Remove this temporary class when the ParseHTMLOnMainThread | |
| 16 // experiment ends. | |
| 17 class MaybeLocker { | |
| 18 public: | |
| 19 MaybeLocker(Mutex* mutex) : m_mutex(mutex) { | |
| 20 if (m_mutex) | |
| 21 m_mutex->lock(); | |
| 22 } | |
| 23 ~MaybeLocker() { | |
| 24 if (m_mutex) | |
| 25 m_mutex->unlock(); | |
| 26 } | |
| 27 | |
| 28 private: | |
| 29 Mutex* m_mutex; | |
| 30 }; | |
| 31 | |
| 32 } // namespace | |
| 33 | |
| 34 TokenizedChunkQueue::TokenizedChunkQueue() | |
| 35 : m_mutex(RuntimeEnabledFeatures::parseHTMLOnMainThreadEnabled() | |
| 36 ? nullptr | |
| 37 : new Mutex) {} | |
| 38 | 14 |
| 39 TokenizedChunkQueue::~TokenizedChunkQueue() {} | 15 TokenizedChunkQueue::~TokenizedChunkQueue() {} |
| 40 | 16 |
| 41 bool TokenizedChunkQueue::enqueue( | 17 bool TokenizedChunkQueue::enqueue( |
| 42 std::unique_ptr<HTMLDocumentParser::TokenizedChunk> chunk) { | 18 std::unique_ptr<HTMLDocumentParser::TokenizedChunk> chunk) { |
| 43 MaybeLocker locker(m_mutex.get()); | |
| 44 | |
| 45 m_pendingTokenCount += chunk->tokens->size(); | 19 m_pendingTokenCount += chunk->tokens->size(); |
| 46 m_peakPendingTokenCount = | 20 m_peakPendingTokenCount = |
| 47 std::max(m_peakPendingTokenCount, m_pendingTokenCount); | 21 std::max(m_peakPendingTokenCount, m_pendingTokenCount); |
| 48 | 22 |
| 49 bool wasEmpty = m_pendingChunks.isEmpty(); | 23 bool wasEmpty = m_pendingChunks.isEmpty(); |
| 50 m_pendingChunks.push_back(std::move(chunk)); | 24 m_pendingChunks.push_back(std::move(chunk)); |
| 51 m_peakPendingChunkCount = | 25 m_peakPendingChunkCount = |
| 52 std::max(m_peakPendingChunkCount, m_pendingChunks.size()); | 26 std::max(m_peakPendingChunkCount, m_pendingChunks.size()); |
| 53 | 27 |
| 54 return wasEmpty; | 28 return wasEmpty; |
| 55 } | 29 } |
| 56 | 30 |
| 57 void TokenizedChunkQueue::clear() { | 31 void TokenizedChunkQueue::clear() { |
| 58 MaybeLocker locker(m_mutex.get()); | |
| 59 | |
| 60 m_pendingTokenCount = 0; | 32 m_pendingTokenCount = 0; |
| 61 m_pendingChunks.clear(); | 33 m_pendingChunks.clear(); |
| 62 } | 34 } |
| 63 | 35 |
| 64 void TokenizedChunkQueue::takeAll( | 36 void TokenizedChunkQueue::takeAll( |
| 65 Vector<std::unique_ptr<HTMLDocumentParser::TokenizedChunk>>& vector) { | 37 Vector<std::unique_ptr<HTMLDocumentParser::TokenizedChunk>>& vector) { |
| 66 MaybeLocker locker(m_mutex.get()); | |
| 67 | |
| 68 DCHECK(vector.isEmpty()); | 38 DCHECK(vector.isEmpty()); |
| 69 m_pendingChunks.swap(vector); | 39 m_pendingChunks.swap(vector); |
| 70 } | 40 } |
| 71 | 41 |
| 72 size_t TokenizedChunkQueue::peakPendingChunkCount() { | 42 size_t TokenizedChunkQueue::peakPendingChunkCount() { |
| 73 MaybeLocker locker(m_mutex.get()); | |
| 74 return m_peakPendingChunkCount; | 43 return m_peakPendingChunkCount; |
| 75 } | 44 } |
| 76 | 45 |
| 77 size_t TokenizedChunkQueue::peakPendingTokenCount() { | 46 size_t TokenizedChunkQueue::peakPendingTokenCount() { |
| 78 MaybeLocker locker(m_mutex.get()); | |
| 79 return m_peakPendingTokenCount; | 47 return m_peakPendingTokenCount; |
| 80 } | 48 } |
| 81 | 49 |
| 82 } // namespace blink | 50 } // namespace blink |
| OLD | NEW |