From eece90e9f7d4ef37058c0a18b7a7e404f799c2c3 Mon Sep 17 00:00:00 2001 From: cloudhead Date: Tue, 30 Apr 2024 14:24:09 +0200 Subject: [PATCH] node: Fix naming/spelling of "limitter" module --- radicle-node/src/service.rs | 8 ++++---- radicle-node/src/service/{limitter.rs => limiter.rs} | 2 +- 2 files changed, 5 insertions(+), 5 deletions(-) rename radicle-node/src/service/{limitter.rs => limiter.rs} (99%) diff --git a/radicle-node/src/service.rs b/radicle-node/src/service.rs index d6bd0a48..2a1eff3e 100644 --- a/radicle-node/src/service.rs +++ b/radicle-node/src/service.rs @@ -5,7 +5,7 @@ pub mod filter; pub mod gossip; pub mod io; -pub mod limitter; +pub mod limiter; pub mod message; pub mod session; @@ -63,7 +63,7 @@ pub use crate::service::session::Session; pub use radicle::node::policy::config as policy; use self::io::Outbox; -use self::limitter::RateLimiter; +use self::limiter::RateLimiter; use self::message::InventoryAnnouncement; use self::policy::NamespacesError; @@ -383,7 +383,7 @@ pub struct Service { fetching: HashMap, /// Fetch queue. queue: VecDeque, - /// Request/connection rate limitter. + /// Request/connection rate limiter. limiter: RateLimiter, /// Current seeded repositories bloom filter. filter: Filter, @@ -1159,7 +1159,7 @@ where .limiter .limit(host.clone(), &self.config.limits.rate.inbound, self.clock) { - trace!(target: "service", "Rate limitting inbound connection from {host}.."); + trace!(target: "service", "Rate limiting inbound connection from {host}.."); return false; } true diff --git a/radicle-node/src/service/limitter.rs b/radicle-node/src/service/limiter.rs similarity index 99% rename from radicle-node/src/service/limitter.rs rename to radicle-node/src/service/limiter.rs index ad30afb6..1975da29 100644 --- a/radicle-node/src/service/limitter.rs +++ b/radicle-node/src/service/limiter.rs @@ -3,7 +3,7 @@ use std::collections::HashMap; use localtime::LocalTime; use radicle::node::{address, config, HostName}; -/// Peer rate limitter. +/// Peer rate limiter. /// /// Uses a token bucket algorithm, where each address starts with a certain amount of tokens, /// and every request from that address consumes one token. Tokens refill at a predefined