Me@0: /* Me@0: * Copyright 2009 OpenSourceStewardshipFoundation.org Me@0: * Licensed under GNU General Public License version 2 Me@0: * Me@0: * Author: seanhalle@yahoo.com Me@0: */ Me@0: Me@0: #ifndef _PRIVATE_QUEUE_H Me@0: #define _PRIVATE_QUEUE_H Me@0: Me@0: #include Me@0: Me@0: #define TRUE 1 Me@0: #define FALSE 0 Me@0: Me@0: #define LOCKED 1 Me@0: #define UNLOCKED 0 Me@0: Me@0: Me@0: /* It is the data that is shared so only need one mutex. */ Me@0: typedef struct Me@0: { void **insertPos; Me@0: void **extractPos; Me@0: void **startOfData; //data is pointers Me@0: void **endOfData; //set when alloc data Me@0: } Me@0: PrivQueueStruc; Me@0: Me@0: Me@0: PrivQueueStruc* makePrivQ ( ); Me@0: void* readPrivQ ( PrivQueueStruc *Q ); Me@6: void writePrivQ( void *in, PrivQueueStruc *Q ); Me@6: int writeIfSpacePrivQ( void * in, PrivQueueStruc* Q ); //return Me@3: // false when full Me@0: Me@0: #endif /* _PRIVATE_QUEUE_H */ Me@0: