wmhttp 0.3.1

a http server for rust
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
109
110
111
112
113

// Copyright 2022 - 2023 Wenmeng See the COPYRIGHT
// file at the top-level directory of this distribution.
// 
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
// 
// Author: tickbh
// -----
// Created Date: 2023/09/14 09:42:25

use std::{task::{Context, Poll}, collections::HashMap};

use algorithm::buf::Binary;
use rbtree::RBTree;
use tokio::io::{AsyncRead, AsyncWrite};
use webparse::{
    http::http2::{frame::{Frame, Priority, PriorityFrame, StreamIdentifier}, WindowSize},
};

use crate::ProtResult;

use super::{codec::Codec, FlowControl};

#[derive(Debug)]
pub struct PriorityQueue {
    pub send_queue: RBTree<PriorityFrame<Binary>, ()>,
    pub hash_weight: HashMap<StreamIdentifier, u8>,
    pub hash_depend: HashMap<StreamIdentifier, StreamIdentifier>,
    pub flow_control: FlowControl,
}

impl PriorityQueue {
    pub fn new(init_windows_size: WindowSize) -> Self {
        PriorityQueue {
            send_queue: RBTree::new(),
            hash_weight: HashMap::from([
                (StreamIdentifier::zero(), 255),
            ]),
            hash_depend: HashMap::new(),
            flow_control: FlowControl::new(init_windows_size),
        }
    }

    pub fn is_empty(&self) -> bool {
        self.send_queue.is_empty()
    }

    pub fn priority_recv(&mut self, p: Priority) {
        let (id, depend_id, weight) = p.into();
        self.hash_weight.insert(id, weight);
        if !depend_id.is_zero() {
            self.hash_depend.insert(id, depend_id);
            let next = std::cmp::max(weight.wrapping_add(1), 255);
            self.hash_weight.entry(depend_id).and_modify(|v| {
                *v = std::cmp::max(*v, next)
            }).or_insert( next);
        }
    }

    pub fn weight(&self, stream_id: &StreamIdentifier) -> u8 {
        if self.hash_weight.contains_key(stream_id) {
            self.hash_weight[stream_id]
        } else {
            0
        }
    }

    pub fn send_frames(&mut self, stream_id: StreamIdentifier, vec: Vec<Frame<Binary>>) -> ProtResult<()> {
        for v in vec {
            self.send_queue.insert(PriorityFrame::new(v, self.weight(&stream_id)), ());
        }
        Ok(())
    }

    pub fn poll_handle<T>(
        &mut self,
        cx: &mut Context<'_>,
        codec: &mut Codec<T>,
    ) -> Poll<Option<ProtResult<()>>>
    where
        T: AsyncRead + AsyncWrite + Unpin,
    {
        loop {
            if !codec.poll_ready(cx)?.is_ready() || self.send_queue.is_empty() {
                return Poll::Ready(None);
            }
            if self.flow_control.is_available() {
                let first = self.send_queue.pop_first().unwrap();
                let _is_data = first.0.frame.is_data();
                let _size = codec.send_frame(first.0.frame)?;
            } else {
                let first = self.send_queue.get_first().unwrap();
                if first.0.frame.is_data() {
                    return Poll::Ready(None)
                }
                let first = self.send_queue.pop_first().unwrap();
                codec.send_frame(first.0.frame)?;
            }

        }
    }

}

unsafe impl Sync for PriorityQueue {

}

unsafe impl Send for PriorityQueue {

}