Make FakeNetworkPipe not busy loop any more.

webrtc/test/fake_network_pipe.cc

 /*
  *  Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.
  *
  *  Use of this source code is governed by a BSD-style license
  *  that can be found in the LICENSE file in the root of the source
  *  tree. An additional intellectual property rights grant can be found
  *  in the file PATENTS.  All contributing project authors may
  *  be found in the AUTHORS file in the root of the source tree.
  */
 
 #include "webrtc/test/fake_network_pipe.h"
 
 #include <assert.h>
 #include <math.h>
 #include <string.h>
 
 #include <algorithm>
 #include <cmath>
 
 #include "webrtc/base/logging.h"
 #include "webrtc/call/call.h"
 #include "webrtc/system_wrappers/include/clock.h"
 
 namespace webrtc {
 
+namespace {
+constexpr int64_t kDefaultProcessIntervalMs = 5;
+}
+
 FakeNetworkPipe::FakeNetworkPipe(Clock* clock,
                                  const FakeNetworkPipe::Config& config)
     : FakeNetworkPipe(clock, config, 1) {}
 
 FakeNetworkPipe::FakeNetworkPipe(Clock* clock,
                                  const FakeNetworkPipe::Config& config,
                                  uint64_t seed)
     : clock_(clock),
       packet_receiver_(NULL),
       random_(seed),
@@ skipping 132 matching lines @@
 
       // If reordering is not allowed then adjust arrival_time_jitter
       // to make sure all packets are sent in order.
       if (!config_.allow_reordering && !delay_link_.empty() &&
           packet->arrival_time() + arrival_time_jitter <
               (*delay_link_.rbegin())->arrival_time()) {
         arrival_time_jitter =
             (*delay_link_.rbegin())->arrival_time() - packet->arrival_time();
       }
       packet->IncrementArrivalTime(arrival_time_jitter);
-      if (packet->arrival_time() < next_process_time_)
-        next_process_time_ = packet->arrival_time();
       delay_link_.insert(packet);
     }
 
     // Check the extra delay queue.
     while (!delay_link_.empty() &&
            time_now >= (*delay_link_.begin())->arrival_time()) {
       // Deliver this packet.
       NetworkPacket* packet = *delay_link_.begin();
       packets_to_deliver.push(packet);
       delay_link_.erase(delay_link_.begin());
       // |time_now| might be later than when the packet should have arrived, due
       // to NetworkProcess being called too late. For stats, use the time it
       // should have been on the link.
       total_packet_delay_ += packet->arrival_time() - packet->send_time();
     }
     sent_packets_ += packets_to_deliver.size();
   }
   while (!packets_to_deliver.empty()) {
     NetworkPacket* packet = packets_to_deliver.front();
     packets_to_deliver.pop();
     packet_receiver_->DeliverPacket(MediaType::ANY, packet->data(),
                                     packet->data_length(), PacketTime());
     delete packet;
   }
+
+  next_process_time_ = !delay_link_.empty()
+                           ? (*delay_link_.begin())->arrival_time()
+                           : time_now + kDefaultProcessIntervalMs;
 }
 
 int64_t FakeNetworkPipe::TimeUntilNextProcess() const {
   rtc::CritScope crit(&lock_);
-  const int64_t kDefaultProcessIntervalMs = 5;
-  if (capacity_link_.empty() || delay_link_.empty())
-    return kDefaultProcessIntervalMs;
   return std::max<int64_t>(next_process_time_ - clock_->TimeInMilliseconds(),
                            0);
 }
 
 }  // namespace webrtc