"0" - canceled

  "1" - unassigned

  "2" - assigned to slave

  "3" - completed by slave and uploaded

 Have a script crawl through each job in the arrays, priority-biased, and assign a frame to each slave.

 Then we will need some sort of watchdog to monitor slaves on the main server to check for stales. Maybe not worry about this for now.

*/

struct general_info {

	short int jobs_in_queue; //

	unsigned short int free_clients;

	unsigned short int rendering_clients;//

	unsigned short int total_finished_jobs; //

	unsigned int total_frames_rendered; //

} general_info;

// Stores Blender Job Info

struct blendjob {

  struct blendjob *next; /* next will be NULL unless if there is another blendjob */

  char *name;

  char *submitter;

  char *email;

  unsigned int jobnum;

  int percent_done;

  int completed_frames; // number of completed frames for stats/etc

  int assigned_frames; // number of assigned frames (that are not yet completed) for stats/etc

  int avg_render_time; // average seconds it took to render a frame

  unsigned int time_remaining; // estimated seconds remaining till render is complete (up to 49, 710 days)

							   // we can have the client computer convert it into days, hours, etc if they wish to view it

  struct frameset *frameset;

};

// Frameset Structure

struct frameset {

	int frame_num; // frame number to render

	char slave_name; // user that frame is assigned to

	int frame_status; // status of frame, 0= unassigned, 1= taken, 2= done

	clock_t start_time; // time the frame was started

	int time_to_render; // the total seconds it took to render the frame

} frameset[]; // Frameset array is generated by status_report_generator function

                         // Using this method to save memory, because if animation starts on a high frame number, it would waste a lot of RAM on empty structures

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

void start_data(){

	if(1 == 0){

		// retrieve total_finished_jobs and total_finished_frames from xml file

	}

	else{

		general_info.total_finished_jobs = 0;

		general_info.total_frames_rendered = 0;

	}

}

// **** Finish-Setter: Sets a frame to the "completed" status.

void finish_frame(int jobnum, int frame){

  blendjob[jobnum].frameset[frame].frame_status = 2;

}

// **** Queuer: Adds files to the queue

void queue(int type, char *name, char *submitter, char *email, int priority, int mode, int spp, struct frameset *frameset) {

	// Type: 1 = blender, add more types later

	// jobnum is the next available job number

	if(type == 1){

    blendjob[jobnum].name = name;

    blendjob[jobnum].submitter = submitter;

    blendjob[jobnum].email = email;

    blendjob[jobnum].priority = priority;

    blendjob[jobnum].frameset = frameset;

  }

  else{

    // Throw error.

  }

jobnum++; // Advance the jobnumber for the next queued job

}

// **** Status Report Generator: figures out how much of the job is done, where jobnum corresponds to the job number

// This uses pointers, so when it is run it updates certain values in memory

void status_report_generator(){

			num1++;

			general_info.rendering_clients = workers_working;

		}

		general_info.jobs_in_queue = (highest_jobnum - general_info.total_finished_jobs);

	}

// **** 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 numframes) {

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

	int counter;

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

	if(!job->frameset)

	  fprintf(stderr, "error allocating memory");

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

	job->jobnum = jobnum_new;

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

	  /* This builds the array, with the array starting at zero and the frame_num starting at sframe */

	  job->frameset[counter].frame_num = counter + 1;

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

}

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

int frame_finder(){

	int your_frame = 0;  // your_frame is an interger value that will be given to the client as the frame number to render

	int finder_jobnum = 0;

	int frameset_count = 0; // the frameset number, note* frames in an animation don't start at zero

	short int done = 0;

	short int priority = 10;

	while(priority >= 1){ // start the scan for the next job with the highest priority, decreases priority before it loops

		finder_jobnum = hcfjob + 1; // reset it to start scanning at first uncompleted job for the pass at each priority level

		while(finder_jobnum <= highest_jobnum){  // This keeps increasing the finder_jobnum until it is higher than the highest_jobnum

			if(blendjob[finder_jobnum].priority == priority){  // looks for a job with the current priority value

				done = 1;									  // notice it starts by looking at the oldest job first

				break;

			}

			if((done) == 1)  // If it has found a job with the current priority value, it will break out of the loop

				break;    // If none is found it goes to the next job to see if it is of the current priority value

void blend_frame_watchdog(){

  short int watchdog_forgiveness = 3; // Hours to wait on a frame before re-assigning it

  int num1 = hcfjob + 1;

  while(num1 <= highest_jobnum){  // counts up through all the jobs

    int num2 = 0;

    while(num2 <= blendjob[num1].total_frames){ // Counts up through all the frames

      if((blendjob[num1].frameset[num2].start_time + (watchdog_forgiveness * 3600)) < clock()) // If frame is not completed within the number of hours specified by watchdog_forgiveness

			  blendjob[num1].frameset[num2].frame_status = 0;								   // Then change the frame status to unassigned

      num2++;

    }

    num1++;

  }

}

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

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

{

		   int aflag = 0;

	       int bflag = 0;

	       char *cvalue = NULL;

	       int index;

	       int c;

	       opterr = 0;

	       while ((c = getopt (argc, argv, "abc:")) != -1)

	         switch (c)

	           {

	           case 'a':

	             aflag = 1;

	             break;

	           case 'b':

	             bflag = 1;

	             break;

	           case 'c':

	             cvalue = optarg;

	             break;

	           case '?':

	             if (optopt == 'c')

	               fprintf (stderr, "Option -%c requires an argument.\n", optopt);

	             else if (isprint (optopt))

  "username.rsa", // Key created from registeruser()

  "-p",

  "23",

  "echo",

  "hello", // This should eventually open a non-terminating connection to the server for communication

  (char *)NULL

  };

  size_t readlen;

  fprintf(stderr, "Opening stream:\n", execio_open(&testrem, "ssh", execargv));

  buf[9] = '\0'; // null-terminating the array...

  while(!execio_read(testrem, buf, 9, &readlen)) // What's with the readlen stuff?

    {

      if(readlen > 9) {

	fprintf(stderr, "!!!! Something is terribly wrong!\n");

      }

    buf[readlen] = '\0'; // Null-terminating the end of it again based on how large the data is?

    fprintf(stderr, "read \"%s\"\n", buf);

    }

  execio_close(testrem);

}

// Executors

void exec_blender(char *input, char *output, int frame, int jobnum) {

  char *frame_str;

  int ret;

  char *cmd[] = { "blender", "-b", "-o", output, input, "-f", frame_str, (char *)0 };

  ret = execv("/usr/bin/blender", cmd);

  finish_frame(jobnum, frame);

}