Line data Source code
1 : #include "fd_quic_svc_q.h"
2 : #include "fd_quic_private.h"
3 : #include "fd_quic_conn.h"
4 :
5 : /* PRIVATE ************************************************/
6 :
7 : #define PRQ_NAME fd_quic_svc_queue_prq
8 8347071 : #define PRQ_T fd_quic_svc_event_t
9 8046564 : #define PRQ_TMP_ST(p,t) do { \
10 8046564 : (p)[0] = (t); \
11 8046564 : t.conn->svc_meta.private.prq_idx = (ulong)((p)-heap); \
12 8046564 : } while( 0 )
13 8346531 : #define PRQ_TIMEOUT_T long
14 : #include "../../util/tmpl/fd_prq.c"
15 : typedef fd_quic_svc_event_t fd_quic_svc_queue_prq_t;
16 :
17 :
18 : /* SETUP FUNCTIONS *************************************************/
19 :
20 : ulong
21 456 : fd_quic_svc_timers_footprint( ulong max_conn ) {
22 456 : ulong l = FD_LAYOUT_INIT;
23 456 : l = FD_LAYOUT_APPEND( l, alignof(fd_quic_svc_timers_t), sizeof(fd_quic_svc_timers_t) );
24 456 : l = FD_LAYOUT_APPEND( l, fd_quic_svc_queue_prq_align(), fd_quic_svc_queue_prq_footprint( max_conn ) );
25 456 : l = FD_LAYOUT_FINI( l, fd_quic_svc_timers_align() );
26 456 : return l;
27 456 : }
28 :
29 : ulong
30 1587 : fd_quic_svc_timers_align( void ) {
31 1587 : return fd_ulong_max( alignof( fd_quic_svc_timers_t ),
32 1587 : fd_quic_svc_queue_prq_align() );
33 1587 : }
34 :
35 : fd_quic_svc_timers_t *
36 : fd_quic_svc_timers_init( void * mem,
37 : ulong max_conn,
38 219 : fd_quic_state_t * state ) {
39 219 : if( FD_UNLIKELY( !mem ) ) {
40 0 : FD_LOG_ERR(( "fd_quic_svc_timers_init called with NULL mem" ));
41 0 : return NULL;
42 0 : }
43 :
44 219 : if( FD_UNLIKELY( !fd_ulong_is_aligned( (ulong)mem, fd_quic_svc_timers_align() ) ) ) {
45 0 : FD_LOG_ERR(( "fd_quic_svc_timers_init called with misaligned mem" ));
46 0 : return NULL;
47 0 : }
48 :
49 219 : FD_SCRATCH_ALLOC_INIT( l, mem );
50 219 : fd_quic_svc_timers_t * timers = FD_SCRATCH_ALLOC_APPEND( l,
51 219 : alignof(fd_quic_svc_timers_t),
52 219 : sizeof(fd_quic_svc_timers_t) );
53 219 : uchar * prq_mem = FD_SCRATCH_ALLOC_APPEND( l,
54 219 : fd_quic_svc_queue_prq_align(),
55 219 : fd_quic_svc_queue_prq_footprint( max_conn ) );
56 :
57 :
58 219 : timers->prq = fd_quic_svc_queue_prq_join( fd_quic_svc_queue_prq_new( prq_mem, max_conn ) );
59 219 : if( FD_UNLIKELY( !timers->prq ) ) FD_LOG_ERR(( "fd_quic_svc_timers_init failed to join prq" ));
60 :
61 219 : timers->instant.cnt = 0U;
62 219 : timers->instant.head = FD_QUIC_SVC_DLIST_IDX_INVAL;
63 219 : timers->instant.tail = FD_QUIC_SVC_DLIST_IDX_INVAL;
64 :
65 219 : timers->state = state;
66 :
67 219 : return timers;
68 219 : }
69 :
70 : void
71 8259121 : fd_quic_svc_timers_init_conn( fd_quic_conn_t * conn ) {
72 8259121 : conn->svc_meta.next_timeout = LONG_MAX;
73 8259121 : conn->svc_meta.private.prq_idx = FD_QUIC_SVC_PRQ_IDX_INVAL;
74 8259121 : conn->svc_meta.private.svc_type = FD_QUIC_SVC_CNT;
75 8259121 : }
76 :
77 : /* END SETUP FUNCTIONS *********************************************/
78 :
79 : /* DLIST HELPER FUNCTIONS *******************************************/
80 :
81 : static inline void
82 : fd_quic_svc_dlist_insert_tail( fd_quic_svc_queue_t * queue,
83 : fd_quic_state_t * state,
84 7633393 : fd_quic_conn_t * conn ) {
85 :
86 7633393 : uint conn_idx = conn->conn_idx;
87 7633393 : fd_quic_conn_t * tail_conn = fd_quic_conn_at_idx( state, queue->tail );
88 :
89 7633393 : *fd_ptr_if( !!queue->cnt, &tail_conn->svc_meta.private.dlist.next , &queue->head) = conn_idx ;
90 7633393 : conn->svc_meta.private.dlist.prev = queue->tail;
91 7633393 : conn->svc_meta.private.dlist.next = FD_QUIC_SVC_DLIST_IDX_INVAL;
92 7633393 : queue->tail = conn_idx;
93 7633393 : queue->cnt++;
94 7633393 : }
95 :
96 : static inline void
97 : fd_quic_svc_dlist_remove( fd_quic_svc_queue_t * queue,
98 : fd_quic_state_t * state,
99 7633339 : fd_quic_conn_t * conn ) {
100 7633339 : uint conn_idx = conn->conn_idx;
101 7633339 : uint qhead = queue->head;
102 7633339 : uint qtail = queue->tail;
103 :
104 7633339 : fd_quic_conn_t * prev_conn = fd_quic_conn_at_idx( state, conn->svc_meta.private.dlist.prev );
105 7633339 : fd_quic_conn_t * next_conn = fd_quic_conn_at_idx( state, conn->svc_meta.private.dlist.next );
106 :
107 7633339 : *fd_ptr_if( conn_idx == qhead, &queue->head , &prev_conn->svc_meta.private.dlist.next) = conn->svc_meta.private.dlist.next;
108 7633339 : *fd_ptr_if( conn_idx == qtail, &queue->tail , &next_conn->svc_meta.private.dlist.prev) = conn->svc_meta.private.dlist.prev;
109 :
110 7633339 : conn->svc_meta.private.dlist.next = FD_QUIC_SVC_DLIST_IDX_INVAL;
111 7633339 : conn->svc_meta.private.dlist.prev = FD_QUIC_SVC_DLIST_IDX_INVAL;
112 7633339 : queue->cnt--;
113 7633339 : }
114 :
115 : /* TASK FUNCTIONS *************************************************/
116 :
117 : void
118 : fd_quic_svc_timers_cancel( fd_quic_svc_timers_t * timers,
119 12204 : fd_quic_conn_t * conn ) {
120 :
121 12204 : uint svc_type = conn->svc_meta.private.svc_type;
122 12204 : fd_quic_state_t * state = timers->state;
123 :
124 12204 : if( svc_type == FD_QUIC_SVC_INSTANT ) {
125 63 : fd_quic_svc_dlist_remove( &timers->instant, state, conn );
126 12141 : } else if( svc_type == FD_QUIC_SVC_DYNAMIC ) {
127 93 : fd_quic_svc_queue_prq_remove( timers->prq, conn->svc_meta.private.prq_idx );
128 93 : }
129 12204 : fd_quic_svc_timers_init_conn( conn );
130 12204 : }
131 :
132 : void
133 : fd_quic_svc_timers_schedule( fd_quic_svc_timers_t * timers,
134 : fd_quic_conn_t * conn,
135 30742814 : long now ) {
136 :
137 : /* if conn null or invalid, do not schedule */
138 30742814 : if( FD_UNLIKELY( !conn || conn->state == FD_QUIC_CONN_STATE_INVALID ) ) {
139 : /* cleaner/safer to check in here for now. If function call overhead
140 : becomes a constraint, move check to caller */
141 6009 : return;
142 6009 : }
143 :
144 30736805 : fd_quic_state_t * state = timers->state;
145 30736805 : long const expiry = conn->svc_meta.next_timeout;
146 30736805 : uint const old_svc_type = conn->svc_meta.private.svc_type;
147 :
148 30736805 : uint const new_svc_type = expiry == now ? FD_QUIC_SVC_INSTANT : FD_QUIC_SVC_DYNAMIC;
149 30736805 : int const old_dynamic = old_svc_type==FD_QUIC_SVC_DYNAMIC;
150 30736805 : int const both_dynamic = old_dynamic & (new_svc_type==FD_QUIC_SVC_DYNAMIC);
151 :
152 : /* Speculative is_increase is invalid when !both_dynamic, but safe bc prq_idx==0 */
153 30736805 : ulong const prq_idx = fd_ulong_if( both_dynamic, conn->svc_meta.private.prq_idx, 0 );
154 30736805 : int const is_increase = timers->prq[prq_idx].timeout <= expiry;
155 :
156 : /* No-op if already INSTANT, or if trying to increase/preserve DYNAMIC expiry */
157 30736805 : int noop = (old_svc_type==FD_QUIC_SVC_INSTANT) | (both_dynamic & is_increase);
158 30736805 : if( noop ) return;
159 :
160 : /* Cancel existing DYNAMIC timer if it exists */
161 15679687 : if( old_dynamic ) {
162 7745955 : fd_quic_svc_queue_prq_remove( timers->prq, conn->svc_meta.private.prq_idx );
163 7745955 : }
164 :
165 : /* Schedule in appropriate queue */
166 15679687 : conn->svc_meta.private.svc_type = new_svc_type;
167 :
168 15679687 : if( new_svc_type==FD_QUIC_SVC_INSTANT ) {
169 7633393 : fd_quic_svc_dlist_insert_tail( &timers->instant, state, conn );
170 8046294 : } else {
171 : /* FD_QUIC_SVC_DYNAMIC - use heap */
172 8046294 : fd_quic_svc_event_t e = {
173 8046294 : .conn = conn,
174 8046294 : .timeout = expiry
175 8046294 : };
176 8046294 : fd_quic_svc_queue_prq_insert( timers->prq, &e );
177 8046294 : }
178 15679687 : }
179 :
180 : int
181 : fd_quic_svc_timers_validate( fd_quic_svc_timers_t * timers,
182 126 : fd_quic_t * quic ) {
183 126 : fd_quic_state_t * state = fd_quic_get_state( quic );
184 :
185 : /* Validate DYNAMIC queue (heap) */
186 126 : ulong prq_cnt = fd_quic_svc_queue_prq_cnt( timers->prq );
187 300192 : for( ulong i=0; i<prq_cnt; i++ ) {
188 300066 : fd_quic_svc_event_t * event = timers->prq + i;
189 300066 : fd_quic_conn_t * conn = event->conn;
190 :
191 : /* conn and idx match for dynamic queue */
192 300066 : if( FD_UNLIKELY( conn->svc_meta.private.prq_idx != i ) ) return 0;
193 300066 : if( FD_UNLIKELY( conn->svc_meta.private.svc_type != FD_QUIC_SVC_DYNAMIC ) ) return 0;
194 :
195 : /* conn in prq at most once */
196 300066 : if( FD_UNLIKELY( conn->visited ) ) return 0;
197 300066 : conn->visited = 1U;
198 300066 : }
199 :
200 : /* Validate dlist */
201 126 : ulong instant_cnt = 0U;
202 126 : uint curr = timers->instant.head;
203 180 : while( curr != FD_QUIC_SVC_DLIST_IDX_INVAL ) {
204 54 : fd_quic_conn_t * conn = fd_quic_conn_at_idx( state, curr );
205 54 : if( FD_UNLIKELY( conn->svc_meta.private.svc_type != FD_QUIC_SVC_INSTANT ) ) return 0;
206 54 : if( FD_UNLIKELY( conn->visited ) ) return 0;
207 54 : conn->visited = 1U;
208 54 : curr = conn->svc_meta.private.dlist.next;
209 54 : instant_cnt++;
210 54 : }
211 126 : if( instant_cnt != timers->instant.cnt ) return 0;
212 :
213 : /* connections not in any queue should have INVALID idx */
214 126 : ulong const conn_cnt = quic->limits.conn_cnt;
215 300888 : for( ulong i=0; i<conn_cnt; i++ ) {
216 300762 : fd_quic_conn_t * conn = fd_quic_conn_at_idx( state, i );
217 300762 : if( !conn->visited && conn->svc_meta.private.prq_idx != FD_QUIC_SVC_PRQ_IDX_INVAL ) return 0;
218 300762 : }
219 :
220 126 : return 1;
221 126 : }
222 :
223 : fd_quic_svc_event_t
224 : fd_quic_svc_timers_next( fd_quic_svc_timers_t * timers,
225 : long now,
226 135376832 : int pop ) {
227 135376832 : fd_quic_svc_event_t next = { .timeout = LONG_MAX, .conn = NULL };
228 :
229 : /* Priority: INSTANT > DYNAMIC */
230 :
231 : /* Check INSTANT queue first */
232 135376832 : if( FD_LIKELY( timers->instant.cnt ) ) {
233 7681303 : fd_quic_conn_t * conn = fd_quic_conn_at_idx( timers->state, timers->instant.head );
234 7681303 : next = (fd_quic_svc_event_t){.conn = conn, .timeout = fd_long_min( now, conn->svc_meta.next_timeout )};
235 :
236 7681303 : if( FD_LIKELY( pop ) ) {
237 7633276 : fd_quic_svc_dlist_remove( &timers->instant, timers->state, conn );
238 7633276 : fd_quic_svc_timers_init_conn( conn );
239 7633276 : }
240 :
241 7681303 : return next;
242 7681303 : }
243 :
244 : /* Check DYNAMIC queue (heap) */
245 127695529 : if( !fd_quic_svc_queue_prq_cnt( timers->prq ) ) return next;
246 127692262 : else if( pop && now < timers->prq[0].timeout ) return next;
247 144258 : else {
248 144258 : next = timers->prq[0];
249 144258 : if( FD_LIKELY( pop ) ) {
250 180 : fd_quic_svc_queue_prq_remove_min( timers->prq );
251 180 : fd_quic_svc_timers_init_conn( next.conn );
252 180 : }
253 144258 : return next;
254 144258 : }
255 127695529 : }
256 :
257 : fd_quic_svc_event_t
258 : fd_quic_svc_timers_get_event( fd_quic_svc_timers_t * timers,
259 : fd_quic_conn_t * conn,
260 3 : long now ) {
261 3 : uint svc_type = conn->svc_meta.private.svc_type;
262 :
263 3 : if( svc_type == FD_QUIC_SVC_INSTANT ) {
264 0 : return (fd_quic_svc_event_t){ .timeout = now, .conn = conn };
265 3 : } else if (svc_type == FD_QUIC_SVC_DYNAMIC) {
266 0 : ulong idx = conn->svc_meta.private.prq_idx;
267 0 : return *(timers->prq + idx);
268 0 : }
269 3 : return (fd_quic_svc_event_t){ .timeout = LONG_MAX, .conn = NULL };
270 3 : }
271 :
272 : ulong
273 142852791 : fd_quic_svc_timers_cnt_events( fd_quic_svc_timers_t * timers ) {
274 142852791 : return timers->instant.cnt +
275 142852791 : fd_quic_svc_queue_prq_cnt( timers->prq );
276 142852791 : }
|
