struct stat buffer;

  isJobDone = 1; // set isJobDone to true

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

    {

      _distren_asprintf(&path_and_number, "stor/job%d/out/%d.%s", job->jobnum, job->frameset[counter].num, job->output_format);

      if(stat(path_and_number, &buffer) == -1)

        {

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

          job->completed_frames--;

          general_info.total_frames_rendered--;

          isJobDone = 0; // if a missing frame is found, set isJobDone to false

        }

    }

  if(isJobDone) // if all frames were accounted for

    {

      distrenjob_remove(head, job);

      distrenjob_free(&job);

      general_info.jobs_in_queue--;

      updateJobListXML(head);

    }

  else{

    job->prev_frame_index = 0; // if the job isn't done, have frame_finder() start from the first frame, allowing it to see the frames that are now unassigned

  }

  updateGeneralInfo();

}

/** scans the frames of a job to initialize a job after server */

/* returns 1 if the job is completely done and there are no missing frames */

/* returns 0 if a missing frame is found */

int restoreJobState(struct distrenjob *job)

{

  short int isJobDone;

  int counter;

  char *path_and_number;

  struct stat buffer;

  isJobDone = 1;

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

    {

      _distren_asprintf(&path_and_number, "stor/job%d/out/%d.%s", job->jobnum, job->frameset[counter].num, job->output_format);

      if(stat(path_and_number, &buffer) == 0)

        {

          job->frameset[counter].status = FRAMESETSTATUS_ASSIGNED;

          job->completed_frames++;

        }

      else

        isJobDone = 0;

    }

  return isJobDone;

}

/** creates a structure from starting data, then calls another function to actually add that struct to the queue */

int prepare_distrenjob(struct distrenjob *head, int type, char *name, char *submitter, char *email, int priority, int start_frame, int end_frame, int width, int height)

{

  int counter2;

  int counter;

  int tmp;

  char *path_with_num;

  struct distrenjob *distrenjob;

  tmp = distrenjob_new(&distrenjob);

  if(tmp)

    return 1;

  general_info.highest_jobnum++;

  distrenjob->jobnum = general_info.highest_jobnum;

  distrenjob->type = 1;

  distrenjob->name = name;

  distrenjob->submitter = submitter;

  distrenjob->email = email;

  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

  for(current_job = head->next; 1; current_job = current_job->next)

  {

	fprintf(stderr, "enqueue loop iteration\n");

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

      prev_job->next = job;

      fprintf(stderr, "adding job at end of queue\n");

      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

      fprintf(stderr, "adding job before jobname: %s\n", current_job->name);

      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;

  unsigned int frame_counter;

  short int your_job_type;

  unsigned short int found;

  struct distrenjob *distrenjob_ptr;

  your_job_type = 0;

  found = 0;

  /* iterate through jobs from first to last */

    for(frame_counter = (distrenjob_ptr->prev_frame_index + 1); !found && frame_counter < distrenjob_ptr->total_frames; frame_counter ++)

      if(distrenjob_ptr->frameset[frame_counter].status == FRAMESETSTATUS_UNASSIGNED) // jobframe found

	{

	  found = 1;

	  your_job_type = distrenjob_ptr->type;

	  distrenjob_ptr->frameset[frame_counter].status = FRAMESETSTATUS_ASSIGNED;

	  distrenjob_ptr->frameset[frame_counter].start_time = clock();

	  distrenjob_ptr->assigned_frames++;

	  distrenjob_ptr->prev_frame_index = frame_counter;

	  updateJobStatsXML(distrenjob_ptr);

	}

  if(!found)

    {

      fprintf(stderr, "No more jobs to render\n");

      sleep(1); /*< @todo eliminate the need for this line*/

      return 1;

    }

  *job = distrenjob_ptr;

  *frame = &distrenjob_ptr->frameset[frame_counter];

  return 0;

}

/** Checks for dead, latent, or stale slaves */

void frame_watchdog(struct distrenjob *distrenjob_head)

{

  struct distrenjob *distrenjob_ptr;

  unsigned int counter;

  for(distrenjob_ptr = distrenjob_head->next; distrenjob_ptr; distrenjob_ptr = distrenjob_ptr->next)

  /* iterate through jobs */

  {

    /* if the job has been started, checks by seeing if either to first or second frame has been started */

    if(distrenjob_ptr->frameset[0].status != FRAMESETSTATUS_UNASSIGNED || distrenjob_ptr->frameset[1].status != FRAMESETSTATUS_UNASSIGNED)

      /* iterate through all frames for this job: */

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

	    /*watchdog_forgiveness = seconds of forgiveness before frame is re-assigned: */

        if((distrenjob_ptr->frameset[counter].start_time + distrenjob_ptr->watchdog_forgiveness) < clock())

        {

            /*

            If frame is not completed within the number of seconds specified by watchdog_forgiveness

            Then change the frame status to unassigned

            */

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

            distrenjob_ptr->assigned_frames--;

        }

    updateJobStatsXML(distrenjob_ptr);

  }

}

/**

   Finds a distrenjob struct based on the jobnum

   @arg jobnum job number to search for

   @return NULL on job doesn't exist

 */

struct distrenjob *distrenjob_get(struct distrenjob *head, jobnum_t jobnum)

{

  struct distrenjob *distrenjob_ptr;

  /*

    The conditions of the for loop will leave distrenjob_ptr at NULL if the end of the list is reached. It will leave it pointing to the correct job if it is found.

   */

  for(distrenjob_ptr = head;

      distrenjob_ptr

        && distrenjob_ptr->jobnum != jobnum;

      distrenjob_ptr = distrenjob_ptr->next);

  return distrenjob_ptr;

}

/**

   Removes a distrenjob from the distrenjob linked list. It does not free the distrenjob, however. You should do that with distrenjob_free() from distrenjob.h

   @arg head pointer to the head of the linkedlist of distrenjobs

 */

void distrenjob_remove(struct distrenjob *head, struct distrenjob *bj)

{

  struct distrenjob *previous_distrenjob;

  for(previous_distrenjob = head;

      previous_distrenjob

	&& previous_distrenjob->next != bj; /*< stop on the distrenjob that comes before bj */

      previous_distrenjob = previous_distrenjob->next)

    /* all of the action is in the definition of the for loop itself */;

  /*

    This removes references to bj from the linked list. I.E., we now skip bj when iterating through the list

  */

  previous_distrenjob->next = bj->next;

  general_info.jobs_in_queue--;

}

/* Grabs config info from confs */

int distrend_do_config(int argc, char *argv[], struct distrend_config **config)

{

  cfg_opt_t myopts_listen[] =

    {

      CFG_SIMPLE_STR("type", NULL),

      CFG_SIMPLE_STR("path", NULL),

      CFG_SIMPLE_INT("port", NULL),

      CFG_END()

    };

  cfg_opt_t myopts[] =

    {

      CFG_SEC("listen",  /* this must be imported into struct listens (which must still be declared) */

          myopts_listen,

          CFGF_MULTI),

      CFG_SIMPLE_STR("datadir", NULL),

      CFG_END()

    };

  struct distrenjob *distrenjob;

  int tmp;

  /*

   * test xml2distrenjob()

   */

  tmp = xml2distrenjob(&distrenjob, "distrenjob.xml.example");

  if(tmp)

    fprintf(stderr, "xml2distrenjob() returned %d. Try to cd to distren/doc if you want to test out the xml2distrenjob() function. (This will only fix this error if the error is due to an inability of the xml library to access distrenjob.xml.example)\n\n", tmp);

  else

    fprintf(stderr, "using email ``%s'' for user ``%s'' -- reading in XML files and pulling data from them using libxml2+XPath works!!!\n", distrenjob->email, distrenjob->submitter);

  fprintf(stderr, "%s:%d running config\n", __FILE__, __LINE__);

  *config = malloc(sizeof(struct distrend_config));

  myopts[1].simple_value = &(*config)->datadir;

  options_init(argc, argv, &(*config)->mycfg, myopts, "daemon", &(*config)->options);

  fprintf(stderr, "using %s as datadir\n", (*config)->datadir);

  return 0;

}

int distrend_config_free(struct distrend_config *config)

{

  options_free(config->options);

  free(config);

  return 0;

}

/* ************************** XML Functions ************************* */

// writes the general_info.xml file which is a copy of the general_info structure

// except that it doesn't hold free_clients and rendering_clients

void updateGeneralInfo()

{

  xmlTextWriterPtr writer;

  char *tmp;

  writer = xmlNewTextWriterFilename("general_info.xml", 0);

  xmlTextWriterStartDocument(writer, NULL, "utf-8", NULL);

  xmlTextWriterStartElement(writer, (xmlChar*)"general_info");

  _distren_asprintf(&tmp, "%d", general_info.jobs_in_queue);

  xmlTextWriterWriteElement(writer, (xmlChar*)"jobs_in_queue", (xmlChar*)tmp);

  _distren_asprintf(&tmp, "%d", general_info.total_finished_jobs);

  xmlTextWriterWriteElement(writer, (xmlChar*)"total_finished_jobs", (xmlChar*)tmp);

  _distren_asprintf(&tmp, "%d", general_info.total_frames_rendered);

  xmlTextWriterWriteElement(writer, (xmlChar*)"total_frames_rendered", (xmlChar*)tmp);

  _distren_asprintf(&tmp, "%d", general_info.highest_jobnum);

  xmlTextWriterWriteElement(writer, (xmlChar*)"highest_jobnum", (xmlChar*)tmp);

  xmlTextWriterEndDocument(writer);

  xmlFreeTextWriter(writer);

}

// this reads the information from general_info.xml to the general_info structure

void importGeneralInfo()

{

  xmlDocPtr doc;

  xmlNodePtr cur;

  doc = xmlParseFile("general_info.xml");

  cur = xmlDocGetRootElement(doc);

  if (xmlStrcmp(cur->name, (xmlChar*)"general_info"))

    {

      fprintf(stderr, "xml document is wrong type");

      xmlFreeDoc(doc);

      return;

    }

  cur = cur->xmlChildrenNode;

  general_info.jobs_in_queue = atoi((char*)xmlNodeListGetString(doc, cur->xmlChildrenNode, 1));