1 /*

2 * Copyright 2009 OpenSourceStewardshipFoundation.org

3 * Licensed under GNU General Public License version 2

4 *

5 * Author: seanhalle@yahoo.com

6 */

7

8 #ifndef _PRIVATE_QUEUE_H

9 #define _PRIVATE_QUEUE_H

10

11

12 #include "VMS_impl/VMS_primitive_data_types.h"

13 #include "VMS_impl/Services_Offered_by_VMS/Memory_Handling/vmalloc.h"

14

15

16 #define TRUE 1

17 #define FALSE 0

18

19 #define LOCKED 1

20 #define UNLOCKED 0

21

22

23 /* It is the data that is shared so only need one mutex. */

24 typedef struct

25 { void **insertPos;

26 void **extractPos;

27 void **startOfData; //data is pointers

28 void **endOfData; //set when alloc data

29 }

30 PrivQueueStruc;

31

32 typedef void (*DynArrayFnPtr) ( void * ); //fn has to cast void *

33

34 PrivQueueStruc* makePrivQ ( );

35 void* readPrivQ ( PrivQueueStruc *Q );

36 void writePrivQ( void *in, PrivQueueStruc *Q );

37 int writeIfSpacePrivQ( void * in, PrivQueueStruc* Q ); //return

38 int numInPrivQ( PrivQueueStruc *Q );

39 // false when full

40

41

42 #endif /* _PRIVATE_QUEUE_H */

43