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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
|
/* Message Queue data structure -- functions
* Copyright (C) 2009 Chris Hall (GMCH), Highwayman
*
* This file is part of GNU Zebra.
*
* GNU Zebra is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published
* by the Free Software Foundation; either version 2, or (at your
* option) any later version.
*
* GNU Zebra is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GNU Zebra; see the file COPYING. If not, write to the
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*/
#include <string.h>
#include "memory.h"
#include "mqueue.h"
#include "zassert.h"
/*==============================================================================
* These message queues are designed for inter-qpthread communication.
*
* A message queue carries messages from one or more qpthreads to one or more
* other qpthreads.
*
* A message queue has one ordinary priority queue and one high priority
* queue.
*
* There are four types of queue, depending on how qpthreads wait and how they
* are woken up:
*
* mqt_cond_unicast -- wait on condition variable, one waiter kicked
* mqt_cond_broadcast -- wait on condition variable, all waiters kicked
* mqt_signal_unicast -- wait for signal, one waiter kicked
* mqt_signal_broadcast -- wait for signal, all waiters kicked
*
* For condition variables there is a timeout mechanism so that waiters
* are woken up at least every now and then. The message queue maintains
* current timeout time and timeout interval variables. Each time a waiter
* waits it will do:
*
* next = now + interval
* if (now > current) || (next <= current)
* current = next and return (don't wait)
* else
* wait until current
*
* If the wait times out, the current is set to current + interval.
*
* The effect of this is to return at least at regular intervals from the wait,
* provided the queue is waited on within the timeout period. If the queue is
* waited on after the current timeout time, it returns immediately, updating
* the current timeout time -- the "clock" slips.
*
* There is a default timeout period. The period may be set "infinite".
*
* For waiters kicked by signal, the wait does not occur within the message
* queue code, but the need for a signal is recorded in the message queue.
*
* Messages take the form of a small block of information which contains:
*
* * flags -- used by the message handler
* * context -- identifies the context of the message (see revoke)
*
* * action -- void action(mqueue_block) message dispatch
* * arg_0 -- *void/uintptr_t/intptr_t ) standard arguments
* * arg_1 -- *void/uintptr_t/intptr_t )
*
* (see struct mqueue_block).
*
* To send a message, first allocate a message block (see mqueue_block_new),
* then fill in the arguments and enqueue it.
*
*
*/
/*==============================================================================
* Initialisation etc. for Message Queues.
*
* TODO: how to shut down a message queue... for reset/exit ?
*/
/* Initialise new Message Queue, if required (mq == NULL) allocating it.
*
* For mqt_cond_xxx type queues, sets the default timeout interval and the
* initial timeout time to now + that interval.
*/
mqueue_queue
mqueue_init_new(mqueue_queue mq, enum mqueue_queue_type type)
{
if (mq == NULL)
mq = XCALLOC(MTYPE_MQUEUE_QUEUE, sizeof(struct mqueue_queue)) ;
else
memset(mq, 0, sizeof(struct mqueue_queue)) ;
qpt_mutex_init(&mq->mutex, qpt_mutex_quagga) ;
/* head, tail and tail_priority set NULL already */
/* waiters set zero already */
mq->type = type ;
switch (type)
{
case mqt_cond_unicast:
case mqt_cond_broadcast:
qpt_cond_init(&mq->kick.cond.wait_here, qpt_cond_quagga) ;
if (MQUEUE_DEFAULT_INTERVAL != 0)
{
mq->kick.cond.interval = MQUEUE_DEFAULT_INTERVAL ;
mq->kick.cond.timeout =
qpt_cond_get_timeout_time(MQUEUE_DEFAULT_INTERVAL) ;
} ;
break;
case mqt_signal_unicast:
case mqt_signal_broadcast:
/* head/tail pointers set NULL already */
break;
default:
zabort("Invalid mqueue queue type") ;
} ;
return mq ;
} ;
/* Set new timeout interval (or unset by setting <= 0)
*
* Sets the next timeout to be the time now + new interval (or never).
*/
void
mqueue_set_timeout_interval(mqueue_queue mq, qtime_t interval)
{
qpt_mutex_lock(&mq->mutex) ;
dassert( (mq->type == mqt_cond_unicast) ||
(mq->type == mqt_cond_broadcast) ) ;
mq->kick.cond.interval = interval ;
mq->kick.cond.timeout = (interval > 0) ? qpt_cond_get_timeout_time(interval)
: 0 ;
qpt_mutex_unlock(&mq->mutex) ;
} ;
/*==============================================================================
* Message Block memory management.
*
* Allocates message_block structures in lots of 256. Uses first message_block
* in each lot to keep track of the lots.
*
* mqueue_initialise MUST be called before the first message block is allocated.
*/
static pthread_mutex_t* p_mb_mutex ; /* NULL => no mutex (yet) */
static pthread_mutex_t mb_mutex ;
#define MB_LOT_SIZE 256
static mqueue_block mb_lot_list = NULL ;
static mqueue_block mb_free_list = NULL ;
static mqueue_block mqueue_block_new_lot(void) ;
/* Get an empty message block
*/
mqueue_block
mqueue_block_new(void)
{
mqueue_block mb ;
qpt_mutex_lock(&mb_mutex) ;
mb = mb_free_list ;
if (mb == NULL)
mb = mqueue_block_new_lot() ;
mb_free_list = mb->next ;
qpt_mutex_unlock(&mb_mutex) ;
memset(mb, 0, sizeof(struct mqueue_block)) ;
return mb ;
} ;
/* Free message block when done with it.
*/
void
mqueue_block_free(mqueue_block mb)
{
qpt_mutex_lock(&mb_mutex) ;
mb->next = mb_free_list ;
mb_free_list = mb ;
qpt_mutex_unlock(&mb_mutex) ;
} ;
/* Make a new lot of empty message_block structures.
*
* NB: caller MUST hold the mb_mutex.
*
*/
static mqueue_block
mqueue_block_new_lot(void)
{
mqueue_block first, last, this ;
mqueue_block new = XCALLOC(MTYPE_MQUEUE_BLOCKS,
SIZE(struct mqueue_block, MB_LOT_SIZE)) ;
first = &new[1] ;
last = &new[MB_LOT_SIZE - 1] ;
new->next = mb_lot_list ; /* add to list of lots */
mb_lot_list = new ;
/* String all the new message_blocks together. */
this = last ;
while (this > first)
{
mqueue_block prev = this-- ;
this->next = prev ;
} ;
assert(this == first) ;
last->next = mb_free_list ; /* point last at old free list */
mb_free_list = first ; /* new blocks at head of free list */
return mb_free_list ;
} ;
/*==============================================================================
* Enqueue and dequeue messages.
*/
static void mqueue_kick_signal(mqueue_queue mq, int n) ;
static void mqueue_dequeue_signal(mqueue_queue mq, mqueue_thread_signal mtsig) ;
/* Enqueue message.
*
* If priority != 0, will enqueue after any previously enqueued priority
* messages.
*
* If there are any waiters, then we kick one or all of them.
*
* Note that we decrement or zero the waiters count here -- because if the
* waiter did it, they might not run before something else is enqueued.
* Similarly, if the kick uses a signal, the signal block is dequeued here.
*
* The waiter count is only incremented when a dequeue is attempted and the
* queue is empty, then:
*
* for a broadcast type message queue, the first message that arrives will
* kick all the waiters into action.
*
* for a signal type message queue, each message that arrives will kick one
* waiter.
*/
void
mqueue_enqueue(mqueue_queue mq, mqueue_block mb, int priority)
{
qpt_mutex_lock(&mq->mutex) ;
if (mq->head == NULL)
{
mb->next = NULL ;
mq->head = mb ;
mq->tail_priority = priority ? mb : NULL ;
mq->tail = mb ;
}
else if (priority)
{
mqueue_block after = mq->tail_priority ;
if (after == NULL)
{
mb->next = mq->head ;
mq->head = mb ;
}
else
{
mb->next = after->next ;
after->next = mb ;
}
mq->tail_priority = mb ;
}
else
{
dassert(mq->tail != NULL) ;
mb->next = NULL ;
mq->tail->next = mb ;
mq->tail = mb ;
} ;
if (mq->waiters != 0)
{
switch (mq->type)
{
case mqt_cond_unicast:
qpt_cond_signal(&mq->kick.cond.wait_here) ;
--mq->waiters ;
break ;
case mqt_cond_broadcast:
qpt_cond_broadcast(&mq->kick.cond.wait_here) ;
mq->waiters = 0 ;
break ;
case mqt_signal_unicast:
mqueue_kick_signal(mq, 1) ; /* pick off first and kick it (MUST be */
/* one) and decrement the waiters count */
break ;
case mqt_signal_broadcast:
mqueue_kick_signal(mq, mq->waiters) ;
dassert(mq->kick.signal.head == NULL) ;
break;
default:
zabort("Invalid mqueue queue type") ;
} ;
} ;
qpt_mutex_unlock(&mq->mutex) ;
} ;
/* Dequeue message.
*
* If the queue is empty and wait != 0, will wait for a message. In which
* case for:
*
* * mqt_cond_xxxx type message queues, will wait on the condition variable,
* and may time-out. (mtsig argument MUST be NULL.)
*
* * mqt_signal_xxxx type message queues, will register the given signal
* (mtsig argument MUST be provided), and return immediately.
*
* Returns a message block if one is available. (And not otherwise.)
*/
mqueue_block
mqueue_dequeue(mqueue_queue mq, int wait, mqueue_thread_signal mtsig)
{
mqueue_block mb ;
mqueue_thread_signal last ;
qpt_mutex_lock(&mq->mutex) ;
while (1)
{
mb = mq->head ;
if (mb != NULL)
break ; /* Easy if queue not empty */
if (!wait)
goto done ; /* Easy if not waiting ! mb == NULL */
++mq->waiters ; /* Another waiter */
switch (mq->type)
{
case mqt_cond_unicast: /* Now wait here */
case mqt_cond_broadcast:
dassert(mtsig == NULL) ;
if (mq->kick.cond.interval <= 0)
qpt_cond_wait(&mq->kick.cond.wait_here, &mq->mutex) ;
else
{
qtime_t now = qpt_cond_get_timeout_time(0) ;
#if QPT_COND_CLOCK_MONOTONIC
dassert(now >= (mq->kick.cond.timeout - mq->kick.cond.interval)) ;
if (now > mq->kick.cond.timeout)
#else
if ( (now > mq->kick.cond.timeout)
|| (now < (mq->kick.cond.timeout - mq->kick.cond.interval)) )
#endif
{
/* the "clock" has slipped. Reset it and return now. */
mq->kick.cond.timeout = now + mq->kick.cond.interval ;
goto done ; /* immediate return. mb == NULL */
}
else
{
if (qpt_cond_timedwait(&mq->kick.cond.wait_here, &mq->mutex,
mq->kick.cond.timeout) == 0)
mq->kick.cond.timeout += mq->kick.cond.interval ;
} ;
} ;
break ;
case mqt_signal_unicast: /* Register desire for signal */
case mqt_signal_broadcast:
dassert(mtsig != NULL) ;
last = mq->kick.signal.tail ;
if (last == NULL)
{
mq->kick.signal.head = mtsig ;
mtsig->prev = (void*)mq ;
}
else
{
last->next = mtsig ;
mtsig->prev = last ;
}
mtsig->next = NULL ;
mq->kick.signal.tail = mtsig ;
goto done ; /* BUT do not wait ! mb == NULL */
default:
zabort("Invalid mqueue queue type") ;
} ;
} ;
/* Have something to pull off the queue */
mq->head = mb->next ;
if (mb == mq->tail_priority)
mq->tail_priority = NULL ;
done:
qpt_mutex_unlock(&mq->mutex) ;
return mb ;
} ;
/* No longer waiting for a signal.
*
* Returns true <=> signal has been kicked.
*/
int
mqueue_done_waiting(mqueue_queue mq, mqueue_thread_signal mtsig)
{
int kicked ;
qpt_mutex_lock(&mq->mutex) ;
dassert( (mq->type == mqt_signal_unicast) ||
(mq->type == mqt_signal_broadcast) ) ;
dassert(mtsig != NULL) ;
/* When the thread is signalled, the prev entry is set NULL and the */
/* waiters count is decremented. */
/* */
/* So, only need to do something here if the prev is not NULL (ie the */
/* mqueue_thread_signal is still on the list. */
kicked = (mtsig->prev == NULL) ;
if (!kicked)
mqueue_dequeue_signal(mq, mtsig) ;
qpt_mutex_unlock(&mq->mutex) ;
return kicked ;
} ;
/*==============================================================================
* Message queue signal handling
*/
/* Initialise a message queue signal structure (struct mqueue_thread_signal).
* Allocate one if required.
*
* Returns address of the structure.
*/
mqueue_thread_signal
mqueue_thread_signal_init(mqueue_thread_signal mqt, qpt_thread_t thread,
int signum)
{
if (mqt == NULL)
mqt = XCALLOC(MTYPE_MQUEUE_THREAD_SIGNAL,
sizeof(struct mqueue_thread_signal)) ;
else
memset(mqt, 0, sizeof(struct mqueue_thread_signal)) ;
/* next and prev fields set to NULL already. */
mqt->qpthread = thread ;
mqt->signum = signum ;
return mqt ;
} ;
/* Signal the first 'n' threads on the to be signalled list.
*
* Removes the threads from the list and reduces the waiters count.
*
* NB: sets the prev entry in the mqueue_thread_signal block to NULL, so that
* the thread can tell that its signal has been kicked.
*
* NB: *** MUST own the mqueue_queue mutex. ***
*/
static void
mqueue_kick_signal(mqueue_queue mq, int n)
{
mqueue_thread_signal mtsig ;
while (n--)
{
mqueue_dequeue_signal(mq, mtsig = mq->kick.signal.head) ;
qpt_thread_signal(mtsig->qpthread, mtsig->signum) ;
} ;
} ;
/* Remove given signal from given message queue.
*
* NB: *** MUST own the mqueue_queue mutex. ***
*/
static void
mqueue_dequeue_signal(mqueue_queue mq, mqueue_thread_signal mtsig)
{
mqueue_thread_signal next ;
mqueue_thread_signal prev ;
dassert((mq->kick.signal.head != NULL) && (mq->waiters != 0)) ;
next = mtsig->next ;
prev = mtsig->prev ;
if (prev == (void*)mq) /* marker for head of list */
{
dassert(mq->kick.signal.head == mtsig) ;
mq->kick.signal.head = next ;
}
else
{
dassert((prev != NULL) && (prev->next == mtsig)) ;
prev->next = next ;
} ;
if (next != NULL)
next->prev = prev ;
mtsig->next = NULL ;
mtsig->prev = NULL ; /* essential to show signal kicked */
--mq->waiters ; /* one fewer waiter */
dassert( ((mq->kick.signal.head == NULL) && (mq->waiters == 0)) ||
((mq->kick.signal.head != NULL) && (mq->waiters != 0)) ) ;
} ;
/*==============================================================================
* Initialise Message Queue handling
*
* Must be called before any qpt_threads are started.
*
* TODO: how do we shut down message queue handling ?
*/
void
mqueue_initialise(int qpthreads)
{
if (qpthreads)
p_mb_mutex = qpt_mutex_init(&mb_mutex, qpt_mutex_quagga) ;
} ;
|