inc/queue_d.h File Reference

This graph shows which files directly or indirectly include this file:

Data Structures
struct	queue_d_t
	Circular queue data structure. More...
Functions
int	queue_d_init (queue_d_t *pThis, unsigned int maxSize)
	Initialize a circular queue.
int	queue_d_get (queue_d_t *pThis, void **ppChunk)
	Get chunk from queue.
int	queue_d_put (queue_d_t *pThis, void *pChunk)
	Attach a filled chunk into the queue.
int	queue_d_is_empty (queue_d_t *pThis)
	Check whether queue is empty.
int	queue_d_is_full (queue_d_t *pThis)
	Check whether queue is full.

---

Function Documentation

int queue_d_get	(	queue_d_t *	pThis,
		void **	ppChunk
	)

Get chunk from queue.

Non blocking, returns PASS if success, FAIL if empty

Parameters:

Parameters:

	pqueue	pointer to queue data structure
	ppChunk	pointer pointer to retrieved chunk

Returns:

PASS on success. FAIL value on failure.

int queue_d_init	(	queue_d_t *	pThis,
		unsigned int	maxSize
	)

Initialize a circular queue.

All elements empty.

Parameters:

Parameters:

	pThis	pointer to queue data structure
	maxSize	number of queue elements

Returns:

PASS/Zero on success. FAIL/Negative value on failure.

int queue_d_is_empty

(

queue_d_t *

pThis

)

Check whether queue is empty.

Parameters:

Parameters:

pqueue

pointer to queue data structure

Returns:

non zero if queue is empty zero if queue contains at least one element

int queue_d_is_full

(

queue_d_t *

pThis

)

Check whether queue is full.

Parameters:

Parameters:

pqueue

pointer to queue data structure

Returns:

non zero if queue is full zero if queue has least one free element

int queue_d_put	(	queue_d_t *	pThis,
		void *	pChunk
	)

Attach a filled chunk into the queue.

Non blocking, will return FAIL if queue already full

Parameters:

Parameters:

	pThis	pointer to queue data structure
	pChunk	pointer to filled chunk

Returns:

PASS on success. FAIL value on failure.

---