Stop using LOG macros in favor of RTC_ prefixed macros.
This CL has been generated with the following script: for m in PLOG \ LOG_TAG \ LOG_GLEM \ LOG_GLE_EX \ LOG_GLE \ LAST_SYSTEM_ERROR \ LOG_ERRNO_EX \ LOG_ERRNO \ LOG_ERR_EX \ LOG_ERR \ LOG_V \ LOG_F \ LOG_T_F \ LOG_E \ LOG_T \ LOG_CHECK_LEVEL_V \ LOG_CHECK_LEVEL \ LOG do git grep -l $m | xargs sed -i "s,\b$m\b,RTC_$m,g" done git checkout rtc_base/logging.h git cl format Bug: webrtc:8452 Change-Id: I1a53ef3e0a5ef6e244e62b2e012b864914784600 Reviewed-on: https://webrtc-review.googlesource.com/21325 Reviewed-by: Niels Moller <nisse@webrtc.org> Reviewed-by: Karl Wiberg <kwiberg@webrtc.org> Commit-Queue: Mirko Bonadei <mbonadei@webrtc.org> Cr-Commit-Position: refs/heads/master@{#20617}
This commit is contained in:

committed by
Commit Bot

parent
34fa309129
commit
675513b96a
@ -605,7 +605,7 @@ VCMFrameBufferEnum VCMJitterBuffer::GetFrame(const VCMPacket& packet,
|
||||
*frame = GetEmptyFrame();
|
||||
if (*frame == NULL) {
|
||||
// No free frame! Try to reclaim some...
|
||||
LOG(LS_WARNING) << "Unable to get empty frame; Recycling.";
|
||||
RTC_LOG(LS_WARNING) << "Unable to get empty frame; Recycling.";
|
||||
bool found_key_frame = RecycleFramesUntilKeyFrame();
|
||||
*frame = GetEmptyFrame();
|
||||
RTC_CHECK(*frame);
|
||||
@ -655,7 +655,7 @@ VCMFrameBufferEnum VCMJitterBuffer::InsertPacket(const VCMPacket& packet,
|
||||
FindAndInsertContinuousFramesWithState(last_decoded_state_);
|
||||
|
||||
if (num_consecutive_old_packets_ > kMaxConsecutiveOldPackets) {
|
||||
LOG(LS_WARNING)
|
||||
RTC_LOG(LS_WARNING)
|
||||
<< num_consecutive_old_packets_
|
||||
<< " consecutive old packets received. Flushing the jitter buffer.";
|
||||
Flush();
|
||||
@ -996,9 +996,9 @@ std::vector<uint16_t> VCMJitterBuffer::GetNackList(bool* request_key_frame) {
|
||||
int non_continuous_incomplete_duration =
|
||||
NonContinuousOrIncompleteDuration();
|
||||
if (non_continuous_incomplete_duration > 90 * max_incomplete_time_ms_) {
|
||||
LOG_F(LS_WARNING) << "Too long non-decodable duration: "
|
||||
<< non_continuous_incomplete_duration << " > "
|
||||
<< 90 * max_incomplete_time_ms_;
|
||||
RTC_LOG_F(LS_WARNING) << "Too long non-decodable duration: "
|
||||
<< non_continuous_incomplete_duration << " > "
|
||||
<< 90 * max_incomplete_time_ms_;
|
||||
FrameList::reverse_iterator rit = find_if(
|
||||
incomplete_frames_.rbegin(), incomplete_frames_.rend(), IsKeyFrame);
|
||||
if (rit == incomplete_frames_.rend()) {
|
||||
@ -1052,12 +1052,13 @@ bool VCMJitterBuffer::UpdateNackList(uint16_t sequence_number) {
|
||||
"seqnum", i);
|
||||
}
|
||||
if (TooLargeNackList() && !HandleTooLargeNackList()) {
|
||||
LOG(LS_WARNING) << "Requesting key frame due to too large NACK list.";
|
||||
RTC_LOG(LS_WARNING) << "Requesting key frame due to too large NACK list.";
|
||||
return false;
|
||||
}
|
||||
if (MissingTooOldPacket(sequence_number) &&
|
||||
!HandleTooOldPackets(sequence_number)) {
|
||||
LOG(LS_WARNING) << "Requesting key frame due to missing too old packets";
|
||||
RTC_LOG(LS_WARNING)
|
||||
<< "Requesting key frame due to missing too old packets";
|
||||
return false;
|
||||
}
|
||||
} else {
|
||||
@ -1075,9 +1076,9 @@ bool VCMJitterBuffer::TooLargeNackList() const {
|
||||
bool VCMJitterBuffer::HandleTooLargeNackList() {
|
||||
// Recycle frames until the NACK list is small enough. It is likely cheaper to
|
||||
// request a key frame than to retransmit this many missing packets.
|
||||
LOG_F(LS_WARNING) << "NACK list has grown too large: "
|
||||
<< missing_sequence_numbers_.size() << " > "
|
||||
<< max_nack_list_size_;
|
||||
RTC_LOG_F(LS_WARNING) << "NACK list has grown too large: "
|
||||
<< missing_sequence_numbers_.size() << " > "
|
||||
<< max_nack_list_size_;
|
||||
bool key_frame_found = false;
|
||||
while (TooLargeNackList()) {
|
||||
key_frame_found = RecycleFramesUntilKeyFrame();
|
||||
@ -1101,9 +1102,9 @@ bool VCMJitterBuffer::HandleTooOldPackets(uint16_t latest_sequence_number) {
|
||||
bool key_frame_found = false;
|
||||
const uint16_t age_of_oldest_missing_packet =
|
||||
latest_sequence_number - *missing_sequence_numbers_.begin();
|
||||
LOG_F(LS_WARNING) << "NACK list contains too old sequence numbers: "
|
||||
<< age_of_oldest_missing_packet << " > "
|
||||
<< max_packet_age_to_nack_;
|
||||
RTC_LOG_F(LS_WARNING) << "NACK list contains too old sequence numbers: "
|
||||
<< age_of_oldest_missing_packet << " > "
|
||||
<< max_packet_age_to_nack_;
|
||||
while (MissingTooOldPacket(latest_sequence_number)) {
|
||||
key_frame_found = RecycleFramesUntilKeyFrame();
|
||||
}
|
||||
@ -1163,7 +1164,7 @@ bool VCMJitterBuffer::RecycleFramesUntilKeyFrame() {
|
||||
}
|
||||
TRACE_EVENT_INSTANT0("webrtc", "JB::RecycleFramesUntilKeyFrame");
|
||||
if (key_frame_found) {
|
||||
LOG(LS_INFO) << "Found key frame while dropping frames.";
|
||||
RTC_LOG(LS_INFO) << "Found key frame while dropping frames.";
|
||||
// Reset last decoded state to make sure the next frame decoded is a key
|
||||
// frame, and start NACKing from here.
|
||||
last_decoded_state_.Reset();
|
||||
@ -1195,7 +1196,7 @@ void VCMJitterBuffer::CountFrame(const VCMFrameBuffer& frame) {
|
||||
if (frame.FrameType() == kVideoFrameKey) {
|
||||
++receive_statistics_.key_frames;
|
||||
if (receive_statistics_.key_frames == 1) {
|
||||
LOG(LS_INFO) << "Received first complete key frame";
|
||||
RTC_LOG(LS_INFO) << "Received first complete key frame";
|
||||
}
|
||||
} else {
|
||||
++receive_statistics_.delta_frames;
|
||||
|
Reference in New Issue
Block a user