From 3bb314fb04ab1ae70e2eea91e69306e7cb8e0349 Mon Sep 17 00:00:00 2001
From: stephey <stephey>
Date: Fri, 1 Oct 2010 08:05:32 +0000
Subject: [PATCH] forgot an #endif at the end of the file

---
 Robust/src/Runtime/oooJava/WaitingQueue.h | 80 ++++++++++++-----------
 1 file changed, 41 insertions(+), 39 deletions(-)

diff --git a/Robust/src/Runtime/oooJava/WaitingQueue.h b/Robust/src/Runtime/oooJava/WaitingQueue.h
index 2fac31a6..c805acb7 100644
--- a/Robust/src/Runtime/oooJava/WaitingQueue.h
+++ b/Robust/src/Runtime/oooJava/WaitingQueue.h
@@ -1,39 +1,41 @@
-/*
- * 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();
+/*
+ * 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
-- 
2.34.1