-/*\r
- * waitingQueue.h\r
- *\r
- * Created on: Sep 1, 2010\r
- * Author: stephey\r
- */\r
-#ifndef WAITINGQUEUE_H_\r
-#define WAITINGQUEUE_H_\r
-\r
-#define NUMITEMS_WQ 20\r
-\r
-/* print header */\r
-typedef struct TraverserData_WQ {\r
- void * resumePtr;\r
- int effectType;\r
- int traverserID;\r
-} TraverserResumeDataFromWaitingQ;\r
-\r
-typedef struct BinVector_wq {\r
- struct TraverserData_WQ array[NUMITEMS_WQ];\r
- struct BinVector_wq * next;\r
- int headIndex;\r
- int tailIndex;\r
-} WaitingQueueBinVector;\r
-\r
-\r
-typedef struct BinElement_wq {\r
- struct BinVector_wq * head;\r
- struct BinVector_wq * tail;\r
- int size;\r
-} WaitingQueueBin;\r
-\r
-void putIntoWaitingQueue(int allocSiteID, WaitingQueueBin * queue, int effectType, void * resumePtr, int traverserID);\r
-int isEmptyForWaitingQ(WaitingQueueBin * queue, int allocSiteID);\r
-WaitingQueueBin * mallocWaitingQueue(int size);\r
-WaitingQueueBinVector * returnWaitingQueueBinVectorToFreePool(struct BinVector_wq *ptr);\r
-int removeFromWaitingQueue(WaitingQueueBin * queue, int allocSiteID, int TraverserID);\r
-WaitingQueueBinVector * mallocNewWaitingQueueBinVector();\r
-WaitingQueueBinVector * getUsableWaitingQueueBinVector();\r
+/*
+ * waitingQueue.h
+ *
+ * Created on: Sep 1, 2010
+ * Author: stephey
+ */
+#ifndef WAITINGQUEUE_H_
+#define WAITINGQUEUE_H_
+
+#define NUMITEMS_WQ 20
+
+/* print header */
+typedef struct TraverserData_WQ {
+ void * resumePtr;
+ int effectType;
+ int traverserID;
+} TraverserResumeDataFromWaitingQ;
+
+typedef struct BinVector_wq {
+ struct TraverserData_WQ array[NUMITEMS_WQ];
+ struct BinVector_wq * next;
+ int headIndex;
+ int tailIndex;
+} WaitingQueueBinVector;
+
+
+typedef struct BinElement_wq {
+ struct BinVector_wq * head;
+ struct BinVector_wq * tail;
+ int size;
+} WaitingQueueBin;
+
+void putIntoWaitingQueue(int allocSiteID, WaitingQueueBin * queue, int effectType, void * resumePtr, int traverserID);
+int isEmptyForWaitingQ(WaitingQueueBin * queue, int allocSiteID);
+WaitingQueueBin * mallocWaitingQueue(int size);
+WaitingQueueBinVector * returnWaitingQueueBinVectorToFreePool(struct BinVector_wq *ptr);
+int removeFromWaitingQueue(WaitingQueueBin * queue, int allocSiteID, int TraverserID);
+WaitingQueueBinVector * mallocNewWaitingQueueBinVector();
+WaitingQueueBinVector * getUsableWaitingQueueBinVector();
+
+#endif