Provide a timer implementation (#249)

This patch adds a new crate: tokio-timer. This crate provides an
efficient timer implemeentation designed for use in Tokio based
applications.

The timer users a hierarchical hashed timer wheel algorithm with six
levels, each having 64 slots. This allows the timer to have a resolution
of 1ms while maintaining O(1) complexity for insert, removal, and firing
of timeouts.

There already exists a tokio-timer crate. This is a complete rewrite
which solves the outstanding problems with the existing tokio-timer
library.

Closes #146.
This commit is contained in:
Carl Lerche
2018-03-28 22:26:47 -07:00
committed by GitHub
parent ad189826f4
commit 19500f7df8
24 changed files with 3398 additions and 0 deletions
+87
View File
@@ -0,0 +1,87 @@
//! Implementation of an atomic u64 cell. On 64 bit platforms, this is a wrapper
//! around `AtomicUsize`. On 32 bit platforms, this is implemented using a
//! `Mutex`.
//!
//! This file can be removed if/when `AtomicU64` lands in `std`.
pub use self::imp::AtomicU64;
#[cfg(target_pointer_width = "64")]
mod imp {
use std::sync::atomic::{AtomicUsize, Ordering};
#[derive(Debug)]
pub struct AtomicU64 {
inner: AtomicUsize,
}
impl AtomicU64 {
pub fn new(val: u64) -> AtomicU64 {
AtomicU64 {
inner: AtomicUsize::new(val as usize),
}
}
pub fn load(&self, ordering: Ordering) -> u64 {
self.inner.load(ordering) as u64
}
pub fn store(&self, val: u64, ordering: Ordering) {
self.inner.store(val as usize, ordering)
}
pub fn fetch_or(&self, val: u64, ordering: Ordering) -> u64 {
self.inner.fetch_or(val as usize, ordering) as u64
}
pub fn compare_and_swap(&self, old: u64, new: u64, ordering: Ordering) -> u64 {
self.inner.compare_and_swap(
old as usize, new as usize, ordering) as u64
}
}
}
#[cfg(not(target_pointer_width = "64"))]
mod imp {
use std::sync::Mutex;
#[derive(Debug)]
pub struct AtomicU64 {
inner: Mutex<u64>,
}
impl AtomicU64 {
pub fn new(val: u64) -> AtomicU64 {
AtomicU64 {
inner: Mutex::new(val),
}
}
pub fn load(&self, _: Ordering) -> u64 {
*self.inner.lock().unwrap()
}
pub fn store(&self, val: u64, _: Ordering) {
*self.inner.lock().unwrap() = val;
}
pub fn fetch_or(&self, val: u64, _: Ordering) -> u64 {
let mut lock = self.inner.lock().unwrap();
let prev = *lock;
*lock = prev | val;
prev
}
pub fn compare_and_swap(&self, old: u64, new: u64, _: Ordering) -> u64 {
let mut lock = self.inner.lock().unwrap();
let prev = *lock;
if prev != old {
return prev;
}
*lock = new;
prev
}
}
}