finished_frames = 0;

	  pending_frames = 0;

	  percent_frames_finished = 0;

	  total_time = 0;

	  while(framecounter < blendjob_ptr->total_frames)

	    /* scans through frames, based on their status it runs a statement(s) */

	    {

	      if(blendjob_ptr->frameset[framecounter].status == 2)

		/* If the frame is done */

		{

		  finished_frames ++;

		  total_time += blendjob_ptr->frameset[framecounter].time_to_render;

		}

	      if(blendjob_ptr->frameset[framecounter].status == 1)

		/* If the frame is assigned */

		{

		  pending_frames ++;

		  workers_working ++;

		}

	      framecounter ++;

	    } /* while(framecounter < blendjob_ptr->total_frames) */

	  // find the percent of completed frames

	  percent_frames_finished = (finished_frames / blendjob_ptr->total_frames) * 100; /*< @LordofWar: extraneous parentheses! */

	  /* updates values in the blendjob struct */

	  blendjob_ptr->completed_frames = finished_frames;

	  blendjob_ptr->assigned_frames = pending_frames;

	  blendjob_ptr->percent_done = percent_frames_finished;

	  blendjob_ptr->avg_render_time = (total_time / finished_frames); /*< extraneous parentheses! */

	  blendjob_ptr->time_remaining = (blendjob_ptr->avg_render_time * (blendjob_ptr->total_frames - finished_frames)); /*< extraneous parentheses! */

	  if(finished_frames == blendjob_ptr->total_frames)

	    /* If all frames are complete */

	    {

	      blendjob_ptr->priority = 0; /*< set priority to zero to indicate job is complete */

	      blendjob_remove(blendjobs_head, blendjob_ptr); /*< remove this job from the linkedlist */

	      general_info.total_finished_jobs++; /*< add one to the total finished jobs */

	    }

	  else if (finished_frames > blendjob_ptr->total_frames)

	    /* just in case ;-) */

	    {

	      fprintf(stderr, "%s:%d: finished_frames (%lu) > blendjob_ptr->total_frames (%d)",

		      __FILE__, __LINE__,

		      finished_frames,

		      blendjob_ptr->total_frames);

	      abort();

	    }

	}

      general_info.rendering_clients = workers_working; /*< should this be a +=? */

      blendjob_ptr = blendjob_ptr->next; /*< This is the essence of linked lists and iterating through them */

      numjobs ++;

    } /* while(blendjob_ptr) */

  general_info.jobs_in_queue = (highest_jobnum - general_info.total_finished_jobs); /*< extraneous parentheses! */

}

// **** Structure Builder: This function creates frame array based on the total number of frames to be rendered, which will then be parsed by function frame_farmer.

void frame_num_struct_builder(struct blendjob *job, unsigned int startframe, unsigned int numframes) {

  int jobnum_new = highest_jobnum + 1; /* global vars will someday leave us  */

  unsigned int counter;

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

	if(!job->frameset)

	  fprintf(stderr, "error allocating memory");

	job->total_frames = numframes; // sets the total number of frames in animation for status purposes

	job->jobnum = jobnum_new;

	for(counter = 0; counter < numframes; counter ++)

	  /* This builds the array, with the array starting at zero and the frameset.num starting at sframe */

	  job->frameset[counter].num = counter + startframe;

	highest_jobnum++; // After it has created the job, it adds one to the highest_jobnum interger

}

/**

  Frame Finder: matches your computer up with a lovely frame to render

  TODO: Major issue here, the client needs to know the frame number, AND the job number!

  Notice that this function starts by looking at the oldest job first

	TODO: Link this up with the main() function to check if there are frames available or not and provide jobnum/framenum to the client

  @return 0 success, other: error

*/

int frame_finder(struct blendjob *head, struct blendjob **job, struct frameset **frame)

{

  unsigned short int found;

  unsigned short int priority;

  struct blendjob *blendjob_ptr;

  found = 0;

  while(!found)

    {

      /* enumerate through priority levels */

      for(priority = 10;

	  priority > 0

	    && !found;

	  priority --)

	/* Find the job with the highest priority */

	for(blendjob_ptr = head;

	    blendjob_ptr != NULL

	      && !found;

	    blendjob_ptr = blendjob_ptr->next)

	  if(blendjob_ptr->priority == priority)

	    found = 1;

      if(!found)

	{

	  fprintf(stderr, "out of jobs to render\n");

	  return 1;

	}

      found = 0;

      for(your_frame = 0;

	  your_frame < blendjob_ptr->total_frames;

	  your_frame ++)

	if(blendjob_ptr->frameset[your_frame].status == 0)

	  found = 1;

      if(!found)

	{

	  /* there are no frames left in this job */

	  blendjob_ptr->priority --;

	  /* If that job had no open frames for some reason, run the status report generator so that */

	  status_report_generator(&head);

	  /* should the job be removed now? */

	  fprintf(stderr, "Job %d is finished, this is probably the place to call the job-removal function\n", blendjob_ptr->jobnum);

	}

    } /* while(!found) */

  fprintf(stderr, "Missing apostrophe !!!!!!!!!!!!!!\n"); abort();

  /* sets the value of the frame to 1, which means its taken !!!!!! MISSSING APOSTROPHE!!!!!!! */

  blendjob_ptr->frameset[your_frame].status++;

  blendjob_ptr->frameset[your_frame].start_time = clock();

  *job = blendjob_ptr;

  *frame =  &blendjob_ptr->frameset[your_frame];

  return 0;

}

void blend_frame_watchdog(struct blendjob *blendjob_head)

{

  unsigned short int watchdog_forgiveness; /*< seconds to wait on a frame before re-assigning it */

  struct blendjob *blendjob_ptr;

  unsigned int counter;

  watchdog_forgiveness = 3; /*< hours of forgiveness before frame is re-assigned */

  blendjob_ptr = blendjob_head;

  for(blendjob_ptr = blendjob_head; blendjob_ptr; blendjob_ptr = blendjob_ptr->next)

    /* iterate through jobs */

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

      /* iterate through all frames for this job*/

      {

	if((blendjob_ptr->frameset[counter].start_time + (watchdog_forgiveness * 3600)) < clock())

	  /*

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

	    Then change the frame status to unassigned

	  */

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

      }

}

/**

   Finds a blendjob struct based on the jobnum

   @arg jobnum job number to search for

   @return NULL on job doesn't exist

 */

struct blendjob *blendjob_get(struct blendjob *head, jobnum_t jobnum)

{

  struct blendjob *blendjob_ptr;

  /*

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