unsigned int total_frames_rendered; //

  unsigned int highest_jobnum;

} general_info;

/*

  internally defined funcs's prototypes

*/

void status_report_generator(struct distrenjob **distrenjobs_head);

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

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

/* Global Vars, try to cut down on these */

jobnum_t jobnum = 0; // The next job number to create in the queue

int hcfjob; // Highest consecutively finished job

int highest_jobnum; // The job number of the most recently created job, this is used when creating new jobs

/* ********************** Functions ************************* */

/** Dumps all data in RAM to an xml file (such as current jobs, etc) which is parsed by start_data. Remember to invoke this before shutting down! */

int xml_dump()

{

  general_info.total_frames_rendered++; // Increase total frames var for stats

}

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

void queue(int type, char *name, char *submitter, char *email, int priority, int start_frame, int end_frame){

  struct distrenjob *distrenjob;

  distrenjob->type = 1; /*@TODO: add type to blendjob struct*/

  distrenjob->name = name;

  distrenjob->submitter = submitter;

  distrenjob->email = email;

  distrenjob->priority = priority;

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

  /* @TODO: what does this do? frameset array is declared above */

  /*

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

  if(!job->frameset)

    fprintf(stderr, "Error allocating memory\n");

  */

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

  int counter2 = start_frame;

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

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

    counter2++;

  }

  /* @TODO: change frame_num_struct_builder to add_blendjob_to_queue */

  add_job_to_queue(distrenjob);

  general_info.jobs_in_queue++;

}

    }

    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 lowest priority

      job->next = current_job;

      break;

    }

    prev_job = current_job;

  } // end of for statement

}

void change_job_priority(int jobnum, int new_priority){

  job->priority = new_priority;

  add_job_to_queue(job);

}

  struct distrenjob *job;

  struct distrenjob *prev_job = head;

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

    if(job == NULL){

      return NULL;

    }

    if(job->jobnum = jobnum_t){

      prev_job = job->next;

      return job;

    }