Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright (c) 2013 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2013 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 "net/spdy/spdy_write_queue.h" | 5 #include "net/spdy/spdy_write_queue.h" |
| 6 | 6 |
| 7 #include <cstddef> | 7 #include <cstddef> |
| 8 #include <utility> | 8 #include <utility> |
| 9 #include <vector> | 9 #include <vector> |
| 10 | 10 |
| (...skipping 137 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 148 | 148 |
| 149 for (int i = MINIMUM_PRIORITY; i <= MAXIMUM_PRIORITY; ++i) { | 149 for (int i = MINIMUM_PRIORITY; i <= MAXIMUM_PRIORITY; ++i) { |
| 150 for (auto it = queue_[i].begin(); it != queue_[i].end(); ++it) { | 150 for (auto it = queue_[i].begin(); it != queue_[i].end(); ++it) { |
| 151 erased_buffer_producers.push_back(std::move(it->frame_producer)); | 151 erased_buffer_producers.push_back(std::move(it->frame_producer)); |
| 152 } | 152 } |
| 153 queue_[i].clear(); | 153 queue_[i].clear(); |
| 154 } | 154 } |
| 155 removing_writes_ = false; | 155 removing_writes_ = false; |
| 156 } | 156 } |
| 157 | 157 |
| 158 size_t SpdyWriteQueue::EstimateMemoryUsage() const { | |
| 159 // TODO(xunjieli): https://crbug.com/669108. return allocation from |queue_| | |
| 160 // once memory_usage_estimator.h supports std::deque. | |
| 161 return 0; | |
|
DmitrySkiba
2017/02/06 18:02:34
std::deque is supported now, so this should be EMU
xunjieli
2017/02/08 15:42:50
Done.
| |
| 162 } | |
| 163 | |
| 158 } // namespace net | 164 } // namespace net |
| OLD | NEW |