* Copyright (c) 1988 Regents of the University of California.
* Redistribution and use in source and binary forms are permitted
* provided that this notice is preserved and that due credit is given
* to the University of California at Berkeley. The name of the University
* may not be used to endorse or promote products derived from this
* software without specific prior written permission. This software
* is provided ``as is'' without express or implied warranty.
* @(#)ring.h 1.7 (Berkeley) %G%
* This defines a structure for a ring buffer.
* The circular buffer has two parts:
* full: [consume, supply)
* empty: [supply, consume)
char *consume
, /* where data comes out of */
*supply
, /* where data comes in to */
*bottom
, /* lowest address in buffer */
*top
, /* highest address+1 in buffer */
*mark
; /* marker (user defined) */
int size
; /* size in bytes of buffer */
u_long consumetime
, /* help us keep straight full, empty, etc. */
/* Here are some functions and macros to deal with the ring buffer */
/* Initialization routine */
ring_init(Ring
*ring
, char *buffer
, int count
);
/* Data movement routines */
ring_supply_data(Ring
*ring
, char *buffer
, int count
),
ring_consume_data(Ring
*ring
, char *buffer
, int count
);
/* Buffer state transition routines */
ring_supplied(Ring
*ring
, int count
),
ring_consumed(Ring
*ring
, int count
);
/* Buffer state query routines */
ring_empty_count(Ring
*ring
),
ring_empty_consecutive(Ring
*ring
),
ring_full_count(Ring
*ring
),
ring_full_consecutive(Ring
*ring
);
ring_empty_consecutive(),
#endif /* defined(LINT_ARGS) */