Making FakeNetworkPipe demux audio and video packets.

webrtc/test/fake_network_pipe.h

 /*
  *  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.
  */
 
 #ifndef WEBRTC_TEST_FAKE_NETWORK_PIPE_H_
 #define WEBRTC_TEST_FAKE_NETWORK_PIPE_H_
 
+#include <string.h>
+#include <map>
 #include <memory>
+#include <queue>
 #include <set>
-#include <string.h>
-#include <queue>
 
 #include "webrtc/base/constructormagic.h"
 #include "webrtc/base/criticalsection.h"
 #include "webrtc/base/random.h"
+#include "webrtc/common_types.h"
 #include "webrtc/typedefs.h"
 
 namespace webrtc {
 
 class Clock;
 class PacketReceiver;
 enum class MediaType;
 
 class NetworkPacket {
  public:
@@ skipping 20 matching lines @@
   // The packet data.
   std::unique_ptr<uint8_t[]> data_;
   // Length of data_.
   size_t data_length_;
   // The time the packet was sent out on the network.
   const int64_t send_time_;
   // The time the packet should arrive at the receiver.
   int64_t arrival_time_;
 };
 
+class Demuxer {
+ public:
+  virtual ~Demuxer() = default;
+  virtual void SetReceiver(PacketReceiver* receiver) = 0;
+  virtual void DeliverPacket(const NetworkPacket* packet,
+                             const PacketTime& packet_time) = 0;
+};
+
+class DemuxerImpl final : public Demuxer {
+ public:
+  explicit DemuxerImpl(const std::map<uint8_t, MediaType>& payload_type_map);
+
+  void SetReceiver(PacketReceiver* receiver) override;
+  void DeliverPacket(const NetworkPacket* packet,
+                     const PacketTime& packet_time) override;
+
+ private:
+  PacketReceiver* packet_receiver_;
+  const std::map<uint8_t, MediaType> payload_type_map_;
+  RTC_DISALLOW_COPY_AND_ASSIGN(DemuxerImpl);
+};
+
 // Class faking a network link. This is a simple and naive solution just faking
 // capacity and adding an extra transport delay in addition to the capacity
 // introduced delay.
 
 class FakeNetworkPipe {
  public:
   struct Config {
     Config() {}
     // Queue length in number of packets.
     size_t queue_length_packets = 0;
     // Delay in addition to capacity induced delay.
     int queue_delay_ms = 0;
     // Standard deviation of the extra delay.
     int delay_standard_deviation_ms = 0;
     // Link capacity in kbps.
     int link_capacity_kbps = 0;
     // Random packet loss.
     int loss_percent = 0;
     // If packets are allowed to be reordered.
     bool allow_reordering = false;
     // The average length of a burst of lost packets.
     int avg_burst_loss_length = -1;
   };
 
-  FakeNetworkPipe(Clock* clock, const FakeNetworkPipe::Config& config,
-                  MediaType media_type);
   FakeNetworkPipe(Clock* clock,
-                  const FakeNetworkPipe::Config& config, MediaType media_type,
+                  const FakeNetworkPipe::Config& config,
+                  std::unique_ptr<Demuxer> demuxer);
+  FakeNetworkPipe(Clock* clock,
+                  const FakeNetworkPipe::Config& config,
+                  std::unique_ptr<Demuxer> demuxer,
                   uint64_t seed);
   ~FakeNetworkPipe();
 
-  // Must not be called in parallel with SendPacket or Process.
-  void SetReceiver(PacketReceiver* receiver);
 
   // Sets a new configuration. This won't affect packets already in the pipe.
   void SetConfig(const FakeNetworkPipe::Config& config);
 
   // Sends a new packet to the link.
   void SendPacket(const uint8_t* packet, size_t packet_length);
 
+  // Must not be called in parallel with SendPacket or Process.
+  void SetReceiver(PacketReceiver* receiver);
+
   // Processes the network queues and trigger PacketReceiver::IncomingPacket for
   // packets ready to be delivered.
   void Process();
   int64_t TimeUntilNextProcess() const;
 
   // Get statistics.
   float PercentageLoss();
   int AverageDelay();
   size_t dropped_packets() { return dropped_packets_; }
   size_t sent_packets() { return sent_packets_; }
 
  private:
   Clock* const clock_;
-  const MediaType media_type_;
   rtc::CriticalSection lock_;
-  PacketReceiver* packet_receiver_;
+  const std::unique_ptr<Demuxer> demuxer_;
   std::queue<NetworkPacket*> capacity_link_;
   Random random_;
 
   // Since we need to access both the packet with the earliest and latest
   // arrival time we need to use a multiset to keep all packets sorted,
   // hence, we cannot use a priority queue.
   struct PacketArrivalTimeComparator {
     bool operator()(const NetworkPacket* p1, const NetworkPacket* p2) {
       return p1->arrival_time() < p2->arrival_time();
     }
@@ skipping 21 matching lines @@
   int64_t next_process_time_;
 
   int64_t last_log_time_;
 
   RTC_DISALLOW_COPY_AND_ASSIGN(FakeNetworkPipe);
 };
 
 }  // namespace webrtc
 
 #endif  // WEBRTC_TEST_FAKE_NETWORK_PIPE_H_