/*

 frame[frame] Status Assignments:

  "NULL" - don't render me

  "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 {

  char *name;

  char *submitter;

  char *email;

  int priority;  // 1 is lowest, 10 is highest, 0 is done

  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 total_frames; // how many frames are in the animation 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;

				// updates values in the blendjob struct for jobnum held by the variable num1

				blendjob[num1].completed_frames = finished_frames;

				blendjob[num1].assigned_frames = pending_frames;

				blendjob[num1].percent_done = percent;

				blendjob[num1].avg_render_time = (total_time / finished_frames);

				blendjob[num1].time_remaining = (blendjob[num1].avg_render_time * (blendjob[num1].total_frames - finished_frames));

				if(finished_frames == blendjob[num1].total_frames){  // If all frames are complete

					blendjob[num1].priority = 0;					//set priority to zero to indicate job is complete

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

				}

			}

			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.

	blendjob[jobnum_new].total_frames = total; // sets the total number of frames in animation for status purposes

	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