zqz/platform-external-webrtc
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Use backticks not vertical bars to denote variables in comments for /modules/rtp_rtcp

Browse Source 
Bug: webrtc:12338
Change-Id: I52eb3b6675c4705e22f51b70799ed6139a3b46bc
Reviewed-on: https://webrtc-review.googlesource.com/c/src/+/227164
Reviewed-by: Harald Alvestrand <hta@webrtc.org>
Commit-Queue: Artem Titov <titovartem@webrtc.org>
Cr-Commit-Position: refs/heads/master@{#34686}
This commit is contained in:
Artem Titov
2021-07-28 23:57:33 +02:00
committed by WebRTC LUCI CQ
parent 7f9ab1aa1b
commit 913cfa76ec
72 changed files with 257 additions and 257 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
modules/rtp_rtcp/source/rtp_sequence_number_map.cc
View File

@ -23,7 +23,7 @@ namespace webrtc {
RtpSequenceNumberMap::RtpSequenceNumberMap(size_t max_entries)
: max_entries_(max_entries) {
RTC_DCHECK_GT(max_entries_, 4); // See code paring down to |max_entries_|.
RTC_DCHECK_GT(max_entries_, 4); // See code paring down to `max_entries_`.
RTC_DCHECK_LE(max_entries_, 1 << 15);
}
@ -42,7 +42,7 @@ void RtpSequenceNumberMap::InsertPacket(uint16_t sequence_number, Info info) {
if (AheadOrAt(sequence_number, associations_.front().sequence_number) &&
AheadOrAt(associations_.back().sequence_number, sequence_number)) {
// The sequence number has wrapped around and is within the range
// currently held by |associations_| - we should invalidate all entries.
// currently held by `associations_` - we should invalidate all entries.
RTC_LOG(LS_WARNING) << "Sequence number wrapped-around unexpectedly.";
associations_.clear();
associations_.emplace_back(sequence_number, info);
@ -59,7 +59,7 @@ void RtpSequenceNumberMap::InsertPacket(uint16_t sequence_number, Info info) {
erase_to = std::next(erase_to, max_entries_ - new_size);
}
// It is guaranteed that |associations_| can be split into two partitions,
// It is guaranteed that `associations_` can be split into two partitions,
// either partition possibly empty, such that:
// * In the first partition, all elements are AheadOf the new element.
// This is the partition of the obsolete elements.