distrenjob->priority = priority;

  distrenjob->width = width;

  distrenjob->height = height;

  distrenjob->total_frames = (end_frame - start_frame + 1); /* sets the total number of frames in animation for status purposes */

  distrenjob->frameset = malloc(sizeof(struct frameset) * distrenjob->total_frames);

  if(!distrenjob->frameset)

    {

      distrenjob_free(&distrenjob);

      return 1;

    }

  /* prepares all the frames by setting that status to "unassigned" */

  counter2 = start_frame;

  for(counter = 0; counter < distrenjob->total_frames; counter++){

    distrenjob->frameset[counter].num = counter2;

    distrenjob->frameset[counter].status = FRAMESETSTATUS_UNASSIGNED;

    counter2++;

  }

  _distren_asprintf(&path_with_num, "stor/job%d/out/", distrenjob->jobnum);

  fprintf(stderr, "creating dir '%s'", path_with_num);

  /* add job to queue */

  fprintf(stderr, "\nprepare_distrenjob: attempting makeJobDataXML()\n");

  makeJobDataXML(distrenjob);

  fprintf(stderr, "\nprepare_distrenjob: attempting distrenjob_enqueue()\n");

  distrenjob_enqueue(head, distrenjob);

  general_info.jobs_in_queue++;

  fprintf(stderr, "\nprepare_distrenjob: attempting updateJobListXML()\n");

  updateJobListXML(head);

  fprintf(stderr, "\nprepare_distrenjob: attempting updateGeneralInfo()\n");

  updateGeneralInfo();

  fprintf(stderr, "\nprepare_distrenjob: attempting updateJobStatsXML()\n");

  updateJobStatsXML(distrenjob);

  return 0;

}

/** distrenjob_enqueue: This function adds the job to the queue based on its priority */

void distrenjob_enqueue(struct distrenjob *head, struct distrenjob *job)

{

  struct distrenjob *prev_job = head; // create pointer to previous job

  struct distrenjob *current_job;     // create pointer to current_job (which job is being compared to)

  // iterate through linked list of jobs

    if(current_job == NULL){ // if it has reached the end of the list, add job there

      prev_job->next = job;

      break;

    }

    else if(job->priority < current_job->priority){ // if job's priority is less than current_job's priority, insert job

      prev_job->next = job;                        // keep in mind 1 is the highest priority given to jobs, head has a

      job->next = current_job;                     // priority of zero so it will always be before other jobs

      break;

    }

    prev_job = current_job;

  } /* for(current_job) */

}

/** Changes the priority of an existing (and maybe running) job. @arg head I may end up changing the head if job == head */

void change_job_priority(struct distrenjob *head, struct distrenjob *job, int new_priority){

  distrenjob_remove(head, job);

  job->priority = new_priority;

  struct distrenjob *current_job;

  struct distrenjob *prev_job = head;

  if(job->frameset[0].status == FRAMESETSTATUS_UNASSIGNED)

    /* if job was not yet started */

    distrenjob_enqueue(head, job);

  else{ // if job has already been started, place it before the jobs with the same priority

    // iterate through linked list of jobs

    for(current_job = head; current_job != NULL; current_job = current_job->next){

      if(current_job == NULL){ // if it has reached the end of the list, add job there

        current_job = job;

        break;

      }

      else if(job->priority <= current_job->priority){ // if job's priority is less than or equal to current_job's priority, insert job

        prev_job->next = job;                        // keep in mind 1 is the highest priority given to jobs, head has a

        job->next = current_job;                     // priority of zero so it will always be before other jobs

        break;

      }

      prev_job = current_job;

    }

  }

  updateJobListXML(head);

  makeJobDataXML(job); // because priority is changed

}

/**

  Frame Finder: matches your computer up with a lovely frame to render, starts looking at oldest job first

  @TODO: We must return both jobnum and framenum

  @TODO: Add calls in main()

  @return 0 success, other: error

*/

int find_jobframe(struct distrenjob *head, struct distrenjob **job, struct frameset **frame)

{

  if(general_info.hibernate)

    return 1;

  reCreateQueueFromXML(head, doc, cur);

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

  while(cur != NULL)

    {

      tmp = xmlNodeListGetString(doc, cur->xmlChildrenNode, 1);

      fprintf(stderr, "adding job: %s", tmp);

      // add job from job number @TODO create function with parameters (struct distrenjob *head, int job_number)

      // LordOfWar calls dibs on above todo

      xmlFree(tmp);

      cur = cur->next; // go to next child element of job_list element

    }*/

  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;

  int job_num;

  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_num = atoi((char*)tmp);

  job = createJobFromXML(job_num);

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

  // insert job at front of the queue

  head->next = job;

  job->next = holder;

  return 1;

}

/* ************************** Test Functions ************************* */

{

  char *status;

  status = NULL;

  switch(frame->status)

  {

    case FRAMESETSTATUS_UNASSIGNED:

      _distren_asprintf(&status, "%s", "unassigned");

      break;

    case FRAMESETSTATUS_ASSIGNED:

      _distren_asprintf(&status, "%s", "assigned");

      break;

    case FRAMESETSTATUS_DONE:

      _distren_asprintf(&status, "%s", "completed");

      break;

    case FRAMESETSTATUS_CANCELED:

      _distren_asprintf(&status, "%s", "canceled");

  }

}

{

  int counter;

  for(counter = 0; counter < job->total_frames; counter++)

    {

      printFrameInfo(&job->frameset[counter]);

    }

}

{

}

{

  struct distrenjob *current_job;

  int total_jobs;

  total_jobs = 0;

    {

      total_jobs++;

    }

}

/* ************************** Main ************************* */

int main(int argc, char *argv[])

{

  /* Argument-parser */

  int counter;

  int test; // Have some fun if-ness that does fun stuff when this is 1

  struct distrenjob head;

  int cont;

  struct distrend_listenset *listenset;

  struct distrend_config *config;

  enum clientstatus

  {

    CLIENTSTATUS_UNINITIALIZED = 0,

    CLIENTSTATUS_BUSY = 1,

    CLIENTSTATUS_IDLE = 2

  } clientstatus;

  // initialize general_info struct, this should be done by start_data()

  general_info.jobs_in_queue = 0;

  general_info.free_clients = 0;

  general_info.rendering_clients = 0;

  general_info.total_finished_jobs = 0;

  general_info.total_frames_rendered = 0;

  general_info.highest_jobnum = 0;

  general_info.hibernate = 0;

  int command;

  jobnum_t jobnum;

  struct distrenjob *tmp_job;

  struct frameset *tmp_frame;

  int type;

  char *name;

  char *submitter;

  char *email;

  int priority;

  int width;

  int height;

  int start_frame;

  int end_frame;

  size_t read_buf;