OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2012 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2012 The WebRTC project authors. All Rights Reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license | 4 * Use of this source code is governed by a BSD-style license |
5 * that can be found in the LICENSE file in the root of the source | 5 * that can be found in the LICENSE file in the root of the source |
6 * tree. An additional intellectual property rights grant can be found | 6 * tree. An additional intellectual property rights grant can be found |
7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
9 */ | 9 */ |
10 | 10 |
(...skipping 175 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
186 } | 186 } |
187 | 187 |
188 // List of packets, in the order the were enqueued. Since dequeueing may | 188 // List of packets, in the order the were enqueued. Since dequeueing may |
189 // occur out of order, use list instead of vector. | 189 // occur out of order, use list instead of vector. |
190 std::list<Packet> packet_list_; | 190 std::list<Packet> packet_list_; |
191 // Priority queue of the packets, sorted according to Comparator. | 191 // Priority queue of the packets, sorted according to Comparator. |
192 // Use pointers into list, to avoid moving whole struct within heap. | 192 // Use pointers into list, to avoid moving whole struct within heap. |
193 std::priority_queue<Packet*, std::vector<Packet*>, Comparator> prio_queue_; | 193 std::priority_queue<Packet*, std::vector<Packet*>, Comparator> prio_queue_; |
194 // Total number of bytes in the queue. | 194 // Total number of bytes in the queue. |
195 uint64_t bytes_; | 195 uint64_t bytes_; |
196 // Map<ssrc, set<seq_no> >, for checking duplicates. | 196 // Map<ssrc, std::set<seq_no> >, for checking duplicates. |
197 typedef std::map<uint32_t, std::set<uint16_t> > SsrcSeqNoMap; | 197 typedef std::map<uint32_t, std::set<uint16_t> > SsrcSeqNoMap; |
198 SsrcSeqNoMap dupe_map_; | 198 SsrcSeqNoMap dupe_map_; |
199 Clock* const clock_; | 199 Clock* const clock_; |
200 int64_t queue_time_sum_; | 200 int64_t queue_time_sum_; |
201 int64_t time_last_updated_; | 201 int64_t time_last_updated_; |
202 }; | 202 }; |
203 | 203 |
204 class IntervalBudget { | 204 class IntervalBudget { |
205 public: | 205 public: |
206 explicit IntervalBudget(int initial_target_rate_kbps) | 206 explicit IntervalBudget(int initial_target_rate_kbps) |
(...skipping 287 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
494 void PacedSender::UpdateBudgetWithElapsedTime(int64_t delta_time_ms) { | 494 void PacedSender::UpdateBudgetWithElapsedTime(int64_t delta_time_ms) { |
495 media_budget_->IncreaseBudget(delta_time_ms); | 495 media_budget_->IncreaseBudget(delta_time_ms); |
496 padding_budget_->IncreaseBudget(delta_time_ms); | 496 padding_budget_->IncreaseBudget(delta_time_ms); |
497 } | 497 } |
498 | 498 |
499 void PacedSender::UpdateBudgetWithBytesSent(size_t bytes_sent) { | 499 void PacedSender::UpdateBudgetWithBytesSent(size_t bytes_sent) { |
500 media_budget_->UseBudget(bytes_sent); | 500 media_budget_->UseBudget(bytes_sent); |
501 padding_budget_->UseBudget(bytes_sent); | 501 padding_budget_->UseBudget(bytes_sent); |
502 } | 502 } |
503 } // namespace webrtc | 503 } // namespace webrtc |
OLD | NEW |