mirror of
https://github.com/klzgrad/naiveproxy.git
synced 2024-12-01 09:46:09 +03:00
63 lines
1.8 KiB
C++
63 lines
1.8 KiB
C++
// Copyright (c) 2016 The Chromium Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file.
|
|
|
|
#include "net/quic/test_tools/simulator/traffic_policer.h"
|
|
|
|
#include <algorithm>
|
|
|
|
using std::string;
|
|
|
|
namespace net {
|
|
namespace simulator {
|
|
|
|
TrafficPolicer::TrafficPolicer(Simulator* simulator,
|
|
string name,
|
|
QuicByteCount initial_bucket_size,
|
|
QuicByteCount max_bucket_size,
|
|
QuicBandwidth target_bandwidth,
|
|
Endpoint* input)
|
|
: PacketFilter(simulator, name, input),
|
|
initial_bucket_size_(initial_bucket_size),
|
|
max_bucket_size_(max_bucket_size),
|
|
target_bandwidth_(target_bandwidth),
|
|
last_refill_time_(clock_->Now()) {}
|
|
|
|
TrafficPolicer::~TrafficPolicer() {}
|
|
|
|
void TrafficPolicer::Refill() {
|
|
QuicTime::Delta time_passed = clock_->Now() - last_refill_time_;
|
|
QuicByteCount refill_size = time_passed * target_bandwidth_;
|
|
|
|
for (auto& bucket : token_buckets_) {
|
|
bucket.second = std::min(bucket.second + refill_size, max_bucket_size_);
|
|
}
|
|
|
|
last_refill_time_ = clock_->Now();
|
|
}
|
|
|
|
bool TrafficPolicer::FilterPacket(const Packet& packet) {
|
|
// Refill existing buckets.
|
|
Refill();
|
|
|
|
// Create a new bucket if one does not exist.
|
|
if (token_buckets_.count(packet.destination) == 0) {
|
|
token_buckets_.insert(
|
|
std::make_pair(packet.destination, initial_bucket_size_));
|
|
}
|
|
|
|
auto bucket = token_buckets_.find(packet.destination);
|
|
DCHECK(bucket != token_buckets_.end());
|
|
|
|
// Silently drop the packet on the floor if out of tokens
|
|
if (bucket->second < packet.size) {
|
|
return false;
|
|
}
|
|
|
|
bucket->second -= packet.size;
|
|
return true;
|
|
}
|
|
|
|
} // namespace simulator
|
|
} // namespace net
|