/*

  Copyright 2008 Nathan Phillip Brink, Ethan Zonca

  This file is a part of DistRen.

  DistRen is free software: you can redistribute it and/or modify

  it under the terms of the GNU Affero General Public License as published by

  the Free Software Foundation, either version 3 of the License, or

  (at your option) any later version.

  DistRen is distributed in the hope that it will be useful,

  but WITHOUT ANY WARRANTY; without even the implied warranty of

  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

  GNU Affero General Public License for more details.

  You should have received a copy of the GNU Affero General Public License

  along with DistRen.  If not, see <http://www.gnu.org/licenses/>.

*/

/* This file contains the code which both processes (renders) jobs as a slave, and the code which distributes frames to slaves after receiving them from the client portion of the codebase. */

 /* Just some notes -- Ethan Zonca

 * ++ Make data availible for other apps to parse

 * Server<==>Client Communication

 * Upload while rendering

 */

#include "execio.h"

#include "options.h"

#include <confuse.h>

#include <stdio.h>

#include <malloc.h>

#define MAX_BLENDJOBS 100 // maximum number of stored jobs in memory, per job type (lux/blend). Eventually we can dump this data to disk, or atleast the remainder not in memory...

/* internally defined funcs */

void status_report_generator();

// Global Vars, try to cut down on these

int 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

/* ******************* Structs ************************ */

// Stores config info? editmycomment

struct distrend_config

{

  cfg_t *mycfg;

  struct options_common *options;

  struct distrend_listen **listens; /*< Null terminated array of structs */

};

/*

 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.

*/

// 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

	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

			else

				finder_jobnum++;

		} // End of increasing finder_jobnum

		if(done == 1) // if job has been found, it lets it out of the priority changer loop

			break;

		priority--; // end of decreasing priority

	}

	while(your_frame < blendjob[finder_jobnum].total_frames){ // Finds the frameset number with a frame that needs to be rendered

		if (blendjob[finder_jobnum].frameset[frameset_count].frame_status == 0)  // If frame that is not assigned has been found, frameset_count is not changed

			break;																// and frameset_count is used to give the frame number later in this funciton

		frameset_count++;  // If frame is assigned or done, it goes to next frame

	}

blendjob[jobnum].frameset[frameset_count].frame_status++; // sets the value of the frame to 2, which means its taken

your_frame = blendjob[jobnum].frameset[frameset_count].frame_num; //  Takes the frameset found in the while statement above, and extracts the frame number from it and assigns it to the int your_frame

if(your_frame == 0)  // If that job had no open frames for some reason, run the status report generator so that

	status_report_generator();  //the job priority can be changed to 0

return your_frame; // your_frame is returned as the frame to be rendered

}

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

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

{

// Begin non-working framework?

	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_END()

	    };

	  config = malloc(sizeof(struct distrend_config));

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

	  return 0;

	}

	int distrend_config_free(struct distrend_config *config)

	{

	  options_free(config->options);

	  free(config);

	  return 0;

	}

// End non-working framework?

  int cont = 1;

  struct distrend_listenset *listenset;

  struct distrend_config *config;

  distrend_do_config(argc, argv, config);

  distrend_listen(&listenset, config);

  /* This is called the ``main loop'' */

  while(cont)

    {

      struct distren_action *action;

      distrend_accept(&action);