Quick Change: Moved some misplaced comments.

diff --git a/Robust/src/Runtime/oooJava/WaitingQueue.c b/Robust/src/Runtime/oooJava/WaitingQueue.c
index e05a253567eecf40befda9871a5555905393d6f4..c42ebcab86850a8b6f0b4998e5d4f89931b2d605 100644 (file)
--- a/Robust/src/Runtime/oooJava/WaitingQueue.c
+++ b/Robust/src/Runtime/oooJava/WaitingQueue.c
@@ -7,7 +7,9 @@
 struct BinVector * freeBinVectors = NULL;\r
 \r
 //TODO perhaps print a map of allocsites to arrayIndex?\r
-//Unique queue for each hashtable\r
+\r
+\r
+//NOTE: Only the HashTable calls this function\r
 struct WaitingQueue * mallocWaitingQueue(int size) {\r
   //TODO perhaps in the future get rid of the WaitingQueue object all together to improve performance (but reduce clarity)\r
   struct WaitingQueue * q = (struct WaitingQueue *) malloc(sizeof(struct WaitingQueue));\r
@@ -59,7 +61,7 @@ int check(struct WaitingQueue * queue, int allocSiteID) {
   return ((queue->array)[allocSiteID]).size == 0;\r
 }\r
 \r
-//NOTE: Only the HashTable calls this function\r
+//NOTE: Only the traverser should be able to call this function and it clears the entire chain.\r
 void resolveChain(struct WaitingQueue * queue, int allocSiteID) {\r
   struct BinVector * head;\r
   struct BinVector * next;\r
@@ -97,7 +99,6 @@ void resolveChain(struct WaitingQueue * queue, int allocSiteID) {
   }\r
 }\r
 \r
-//NOTE: Only the traverser should be able to call this function and it clears the entire chain.\r
 void returnVectorToFreePool(struct BinVector *ptr) {\r
   struct BinVector * freeHead;\r
   do {\r