| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (c) 2014 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2014 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 |
| 11 #include <limits> | 11 #include <limits> |
| 12 | 12 |
| 13 #include "webrtc/modules/pacing/bitrate_prober.h" | 13 #include "webrtc/modules/pacing/bitrate_prober.h" |
| 14 #include "webrtc/test/gtest.h" | 14 #include "webrtc/test/gtest.h" |
| 15 | 15 |
| 16 namespace webrtc { | 16 namespace webrtc { |
| 17 | 17 |
| 18 TEST(BitrateProberTest, VerifyStatesAndTimeBetweenProbes) { | 18 TEST(BitrateProberTest, VerifyStatesAndTimeBetweenProbes) { |
| 19 BitrateProber prober; | 19 BitrateProber prober; |
| 20 EXPECT_FALSE(prober.IsProbing()); | 20 EXPECT_FALSE(prober.IsProbing()); |
| 21 int64_t now_ms = 0; | 21 int64_t now_ms = 0; |
| 22 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); | 22 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); |
| 23 | 23 |
| 24 const int kTestBitrate1 = 900000; | 24 prober.CreateProbeCluster(900000); |
| 25 const int kTestBitrate2 = 1800000; | 25 prober.CreateProbeCluster(1800000); |
| 26 const int kClusterSize = 5; | |
| 27 const int kProbeSize = 1000; | |
| 28 const int kMinProbeDurationMs = 15; | |
| 29 | |
| 30 prober.CreateProbeCluster(kTestBitrate1); | |
| 31 prober.CreateProbeCluster(kTestBitrate2); | |
| 32 EXPECT_FALSE(prober.IsProbing()); | 26 EXPECT_FALSE(prober.IsProbing()); |
| 33 | 27 |
| 34 prober.OnIncomingPacket(kProbeSize); | 28 prober.OnIncomingPacket(1000); |
| 35 EXPECT_TRUE(prober.IsProbing()); | 29 EXPECT_TRUE(prober.IsProbing()); |
| 36 EXPECT_EQ(0, prober.CurrentClusterId()); | 30 EXPECT_EQ(0, prober.CurrentClusterId()); |
| 37 | 31 |
| 38 // First packet should probe as soon as possible. | 32 // First packet should probe as soon as possible. |
| 39 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); | 33 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); |
| 34 prober.ProbeSent(now_ms, 1000); |
| 40 | 35 |
| 41 for (int i = 0; i < kClusterSize; ++i) { | 36 for (int i = 0; i < 4; ++i) { |
| 42 now_ms += prober.TimeUntilNextProbe(now_ms); | 37 EXPECT_EQ(8, prober.TimeUntilNextProbe(now_ms)); |
| 38 now_ms += 4; |
| 39 EXPECT_EQ(4, prober.TimeUntilNextProbe(now_ms)); |
| 40 now_ms += 4; |
| 43 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); | 41 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); |
| 44 EXPECT_EQ(0, prober.CurrentClusterId()); | 42 EXPECT_EQ(0, prober.CurrentClusterId()); |
| 45 prober.ProbeSent(now_ms, kProbeSize); | 43 prober.ProbeSent(now_ms, 1000); |
| 46 } | 44 } |
| 47 | 45 for (int i = 0; i < 5; ++i) { |
| 48 EXPECT_GE(now_ms, kMinProbeDurationMs); | 46 EXPECT_EQ(4, prober.TimeUntilNextProbe(now_ms)); |
| 49 // Verify that the actual bitrate is withing 10% of the target. | 47 now_ms += 4; |
| 50 double bitrate = kProbeSize * (kClusterSize - 1) * 8 * 1000.0 / now_ms; | |
| 51 EXPECT_GT(bitrate, kTestBitrate1 * 0.9); | |
| 52 EXPECT_LT(bitrate, kTestBitrate1 * 1.1); | |
| 53 | |
| 54 now_ms += prober.TimeUntilNextProbe(now_ms); | |
| 55 int64_t probe2_started = now_ms; | |
| 56 | |
| 57 for (int i = 0; i < kClusterSize; ++i) { | |
| 58 now_ms += prober.TimeUntilNextProbe(now_ms); | |
| 59 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); | 48 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); |
| 60 EXPECT_EQ(1, prober.CurrentClusterId()); | 49 EXPECT_EQ(1, prober.CurrentClusterId()); |
| 61 prober.ProbeSent(now_ms, kProbeSize); | 50 prober.ProbeSent(now_ms, 1000); |
| 62 } | 51 } |
| 63 | 52 |
| 64 // Verify that the actual bitrate is withing 10% of the target. | |
| 65 int duration = now_ms - probe2_started; | |
| 66 EXPECT_GE(duration, kMinProbeDurationMs); | |
| 67 bitrate = kProbeSize * (kClusterSize - 1) * 8 * 1000.0 / duration; | |
| 68 EXPECT_GT(bitrate, kTestBitrate2 * 0.9); | |
| 69 EXPECT_LT(bitrate, kTestBitrate2 * 1.1); | |
| 70 | |
| 71 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); | 53 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); |
| 72 EXPECT_FALSE(prober.IsProbing()); | 54 EXPECT_FALSE(prober.IsProbing()); |
| 73 } | 55 } |
| 74 | 56 |
| 75 TEST(BitrateProberTest, DoesntProbeWithoutRecentPackets) { | 57 TEST(BitrateProberTest, DoesntProbeWithoutRecentPackets) { |
| 76 BitrateProber prober; | 58 BitrateProber prober; |
| 77 EXPECT_FALSE(prober.IsProbing()); | 59 EXPECT_FALSE(prober.IsProbing()); |
| 78 int64_t now_ms = 0; | 60 int64_t now_ms = 0; |
| 79 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); | 61 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); |
| 80 | 62 |
| (...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 149 while (bytes_sent < kExpectedBytesSent) { | 131 while (bytes_sent < kExpectedBytesSent) { |
| 150 EXPECT_TRUE(prober.IsProbing()); | 132 EXPECT_TRUE(prober.IsProbing()); |
| 151 prober.ProbeSent(0, kPacketSizeBytes); | 133 prober.ProbeSent(0, kPacketSizeBytes); |
| 152 bytes_sent += kPacketSizeBytes; | 134 bytes_sent += kPacketSizeBytes; |
| 153 } | 135 } |
| 154 | 136 |
| 155 EXPECT_FALSE(prober.IsProbing()); | 137 EXPECT_FALSE(prober.IsProbing()); |
| 156 } | 138 } |
| 157 | 139 |
| 158 } // namespace webrtc | 140 } // namespace webrtc |
| OLD | NEW |