!!!!!!!!!!IT WORKS!!!!!!!!! - really

allocate.c

@@ -42,6 +42,8 @@ void advanceProcessQueue(llist *processQueue, int currentTime, int deltaTime, ll
 
 void printQEntry(process *p);
 
+void headNULL(llist * p);
+
 int leastTimeRemaining(process *p, process *q);
 
 int leastExecutionTime(process *p, process *q);
@@ -69,8 +71,10 @@ int main(int argc, char *argv[]) {
     float averageTurnaroundTime = 0;
     llist *completedProcesses, paralellizedProcesses, arrivalLounge;
     completedProcesses = llist_create(NULL);// is making list
+    //headNULL(completedProcesses);
     paralellizedProcesses = llist_create(NULL);
 
+
     process *newProcess;
     float maxOverhead = 0.0;
     float averageOverhead = 0.0;
@@ -174,14 +178,13 @@ int main(int argc, char *argv[]) {
                 exit(1);
             }
             //  Log finished processes.
-            struct node * currNode  = ((struct node *) completedProcesses);
-            process * currProc;
-            if (currNode) currProc = currNode->data;
+            struct node * currNode  =  *completedProcesses; //(struct node *)
+            headData(completedProcesses);
+            process * currProc = currNode->data;
             while ( currNode ){
                 if ( currProc!= NULL &&  currProc->timeCompleted >= currentTime  ) {
                     printf("%d,FINISHED,pid=%s,proc_remaining=%d\n",
                            currProc->timeCompleted, currProc->processID, numProcessesLeft);
-
                 }
                 currNode = currNode->next;
                 if (currNode) currProc = currNode->data;