mysql_async 0.36.2

Tokio based asynchronous MySql client library.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108

// Copyright (c) 2019 Anatoly Ikorsky
//
// Licensed under the Apache License, Version 2.0
// <LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0> or the MIT
// license <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. All files in the project carrying such notice may not be copied,
// modified, or distributed except according to those terms.

use futures_util::future::{ok, FutureExt};
use tokio::time::{self, Interval};

use std::{
    collections::VecDeque,
    future::Future,
    sync::{atomic::Ordering, Arc},
};

use super::Inner;
use crate::PoolOpts;
use futures_core::task::{Context, Poll};
use std::pin::Pin;

/// Idling connections TTL check interval.
///
/// The purpose of this interval is to remove idling connections that both:
/// * overflows min bound of the pool;
/// * idles longer then `inactive_connection_ttl`.
pub(crate) struct TtlCheckInterval {
    inner: Arc<Inner>,
    interval: Interval,
    pool_opts: PoolOpts,
}

impl TtlCheckInterval {
    /// Creates new `TtlCheckInterval`.
    pub fn new(pool_opts: PoolOpts, inner: Arc<Inner>) -> Self {
        let interval = time::interval(pool_opts.ttl_check_interval());
        Self {
            inner,
            interval,
            pool_opts,
        }
    }

    /// Perform the check.
    pub fn check_ttl(&self) {
        let to_be_dropped = {
            let mut exchange = self.inner.exchange.lock().unwrap();

            let num_to_drop = exchange
                .available
                .len()
                .saturating_sub(self.pool_opts.constraints().min());

            let mut to_be_dropped = Vec::<_>::with_capacity(exchange.available.len());
            let mut kept_available =
                VecDeque::<_>::with_capacity(self.pool_opts.constraints().max());

            while let Some(conn) = exchange.available.pop_front() {
                if conn.expired()
                    || (to_be_dropped.len() < num_to_drop
                        && conn.elapsed() > self.pool_opts.inactive_connection_ttl())
                {
                    to_be_dropped.push(conn);
                } else {
                    kept_available.push_back(conn);
                }
            }
            exchange.available = kept_available;
            self.inner
                .metrics
                .connections_in_pool
                .store(exchange.available.len(), Ordering::Relaxed);
            to_be_dropped
        };

        for idling_conn in to_be_dropped {
            assert!(idling_conn.conn.inner.pool.is_none());
            let inner = self.inner.clone();
            tokio::spawn(idling_conn.conn.disconnect().then(move |_| {
                let mut exchange = inner.exchange.lock().unwrap();
                exchange.exist -= 1;
                inner
                    .metrics
                    .connection_count
                    .store(exchange.exist, Ordering::Relaxed);
                ok::<_, ()>(())
            }));
        }
    }
}

impl Future for TtlCheckInterval {
    type Output = ();

    fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {
        loop {
            let _ = futures_core::ready!(Pin::new(&mut self.interval).poll_tick(cx));
            let close = self.inner.close.load(Ordering::Acquire);

            if !close {
                self.check_ttl();
            } else {
                return Poll::Ready(());
            }
        }
    }
}