blob: 94cce93bb72fffbe084f1e3446a757ed13d4c852 (
plain)
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
|
/* Sequence number synchronization routines for pager library
Copyright (C) 1994 Free Software Foundation
This program 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.
This program 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 this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include "priv.h"
#include <assert.h>
/* The message with seqno SEQNO has just been dequeued for pager P;
wait until all preceding messages have had a chance and then
return. */
void
_pager_wait_for_seqno (struct pager *p,
int seqno)
{
while (seqno != p->seqno + 1)
{
p->waitingforseqno = 1;
condition_wait (&p->wakeup, &p->interlock);
}
}
/* Allow the next message for pager P (potentially blocked in
_pager_wait_for_seqno) to be handled. */
void
_pager_release_seqno (struct pager *p,
int seqno)
{
assert (seqno == p->seqno + 1);
p->seqno = seqno;
if (p->waitingforseqno)
{
p->waitingforseqno = 0;
condition_broadcast (&p->wakeup);
}
}
|
