reCreateQueueFromXML(doc, cur);

  /* scans the list of all jobs that were in queue before DistRen shutdown

    }*/

  xmlFreeDoc(doc);

  return 1;

// inserts jobs at front of queue, starting with the last job in the job_list xml file

// to preserve the order of the queue

int reCreateQueueFromXML(struct distrenjob *head, xmlDocPtr doc, xmlNodePtr current)

{

  struct distrenjob *holder; // holds the job that "was" after head, so that the new struct can be inserted after head

  struct distrenjob *job; // job to be added

  xmlChar *tmp;

  if(current == NULL) // base case, if element doesn't exist then don't do anything

    return 0;

  // recursively call itself so that the next job in the queue is added to the front before the current one

  reCreateQueueFromXML(head, doc, current->next);

  // now actual work is done, adding the job to the front of the queue

  holder = head->next; // initialize holder

  tmp = xmlNodeListGetString(doc, current->xmlChildrenNode, 1); // get job number

  // job = another function that reads data from xml for that job, prepares the job, and returns a pointer to the job

  xmlFree(tmp); // free xml char (that holds the job number)

  // insert job at front of the queue

  head->next = job;

  job->next = holder;