Changeset - 0b46b7cc6eab
Parent rev.
Child rev.
[Not reviewed]
default
0 1 0
LordOfWar - 16 years ago 2009-10-09 14:31:18

a little taste of recursion for re-creating the queue from an xml file
1 file changed with 30 insertions and 2 deletions:
src/server/distrend.c
30
2
0 comments (0 inline, 0 general)
src/server/distrend.c
➞
Show inline comments
 
@@ -487,209 +487,237 @@ int makeSlaveDataXML(struct distrenjob *
 
  xmlTextWriterStartDocument(writer, NULL, "UTF-8", NULL);
 

			




	
	
	
		
 
  // write resolution element and add its attributes

			




	
	
	
		
 
  xmlTextWriterStartElement(writer, (xmlChar*)"distrenjob");

			




	
	
	
		
 
  xmlTextWriterWriteAttribute(writer, (xmlChar*)"name", (xmlChar*)job->name);

			




	
	
	
		
 
  xmlTextWriterWriteAttribute(writer, (xmlChar*)"submitter", (xmlChar*)job->submitter);

			




	
	
	
		
 
  _distren_asprintf(&tmp, "%d", job->priority);

			




	
	
	
		
 
  xmlTextWriterWriteAttribute(writer, (xmlChar*)"priority", (xmlChar*)tmp);

			




	
	
	
		
 

			




	
	
	
		
 
  // write resolution element and add its attributes

			




	
	
	
		
 
  xmlTextWriterStartElement(writer, (xmlChar*)"resolution");

			




	
	
	
		
 
  _distren_asprintf(&tmp, "%d", job->width);

			




	
	
	
		
 
  xmlTextWriterWriteAttribute(writer, (xmlChar*)"width", (xmlChar*)tmp);

			




	
	
	
		
 
  _distren_asprintf(&tmp, "%d", job->height);

			




	
	
	
		
 
  xmlTextWriterWriteAttribute(writer, (xmlChar*)"height", (xmlChar*)tmp);

			




	
	
	
		
 
  xmlTextWriterEndElement(writer);

			




	
	
	
		
 

			




	
	
	
		
 
  // end document

			




	
	
	
		
 
  xmlTextWriterEndDocument(writer);

			




	
	
	
		
 

			




	
	
	
		
 
  // free writer and save xml file to disk

			




	
	
	
		
 
  xmlFreeTextWriter(writer);

			




	
	
	
		
 

			




	
	
	
		
 
  return 1;

			




	
	
	
		
 
}

			




	
	
	
		
 

			




	
	
	
		
 
// returns 1 if successful

			




	
	
	
		
 
// updates job_list.xml which lists all the jobs in the queue

			




	
	
	
		
 
int updateJobListXML(struct distrenjob *head)

			




	
	
	
		
 
{

			




	
	
	
		
 
  struct distrenjob *job;

			




	
	
	
		
 
  xmlTextWriterPtr writer;

			




	
	
	
		
 
  char *tmp;

			




	
	
	
		
 
  char *tmp2;

			




	
	
	
		
 
  int counter;

			




	
	
	
		
 

			




	
	
	
		
 
  _distren_asprintf(&tmp, "job_list.xml");

			




	
	
	
		
 
  writer = xmlNewTextWriterFilename(tmp, 0);

			




	
	
	
		
 
  xmlTextWriterStartDocument(writer, NULL, "utf-8", NULL);

			




	
	
	
		
 

			




	
	
	
		
 
  // create root element job_list

			




	
	
	
		
 
  xmlTextWriterStartElement(writer, (xmlChar*)"job_list");

			




	
	
	
		
 

			




	
	
	
		
 
  _distren_asprintf(&tmp, "%d", general_info.jobs_in_queue);

			




	
	
	
		
 
  xmlTextWriterWriteAttribute(writer, (xmlChar*)"amount", (xmlChar*)tmp);

			




	
	
	
		
 

			




	
	
	
		
 
  counter = 0;

			




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

			




	
	
	
		
 
    {

			




	
	
	
		
 
      _distren_asprintf(&tmp, "jobnum%d", counter);

			




	
	
	
		
 
      _distren_asprintf(&tmp2, "%d", job->jobnum);

			




	
	
	
		
 
      xmlTextWriterWriteElement(writer, (xmlChar*)tmp, (xmlChar*)tmp2);

			




	
	
	
		
 
      counter++;

			




	
	
	
		
 
    }

			




	
	
	
		
 

			




	
	
	
		
 
  // close elements and end document

			




	
	
	
		
 
  xmlTextWriterEndDocument(writer);

			




	
	
	
		
 

			




	
	
	
		
 
  // free writer and save xml file to disk

			




	
	
	
		
 
  xmlFreeTextWriter(writer);

			




	
	
	
		
 
  return 1;

			




	
	
	
		
 
}

			




	
	
	
		
 

			




	
	
	
		
 
// returns 1 if completed successfully, 0 if not

			




	
	
	
		
 
// this reads a list of jobs in the queue before DistRen was shut down

			




	
	
	
		
 
// and then adds the jobs to the queue, as if it were never shut down

			




	
	
	
		
 
int createQueueFromXML(struct distrenjob *head)

			




	
	
	
		
 
{

			




	
	
	
		
 
  xmlChar *tmp;

			




	
	
	
		
 
  xmlDocPtr doc;  // holds xml document in memory

			




	
	
	
		
 
  xmlNodePtr cur; // points to the current xml element node

			




	
	
	
		
 

			




	
	
	
		
 
  // load xml document

			




	
	
	
		
 
  doc = xmlParseFile("job_list.xml");

			




	
	
	
		
 
  if(doc == NULL)

			




	
	
	
		
 
    {

			




	
	
	
		
 
      fprintf(stderr, "createQueueFromXML: document not found\n");

			




	
	
	
		
 
      return 0;

			




	
	
	
		
 
    }

			




	
	
	
		
 

			




	
	
	
		
 
  // have cur point to the root element of the xml document pointed to by doc

			




	
	
	
		
 
  cur = xmlDocGetRootElement(doc);

			




	
	
	
		
 
  if(cur == NULL)

			




	
	
	
		
 
    {

			




	
	
	
		
 
      fprintf(stderr, "createQueueFromXML: document empty\n");

			




	
	
	
		
 
      return 0;

			




	
	
	
		
 
    }

			




	
	
	
		
 

			




	
	
	
		
 
  if(xmlStrcmp(cur->name, (const xmlChar*)"job_list"))

			




	
	
	
		
 
    {

			




	
	
	
		
 
      fprintf(stderr, "createQueueFromXML: incorrect root element (%s)", (char*)cur->name);

			




	
	
	
		
 
    }

			




	
	
	
		
 

			




	
	
	
		
 
  // moves into the children elements of job_list

			




	
	
	
		
 
  cur = cur->xmlChildrenNode;

			




	
	
	
		
 

			




	
	
	
		
 
  // scans the list of all jobs that were in queue before DistRen shutdown

			




	
	
	
		
 
  reCreateQueueFromXML(doc, cur);

			




	
	
	
		
 
  /* scans the list of all jobs that were in queue before DistRen shutdown

			




	
	
	
		
 
  while(cur != NULL)

			




	
	
	
		
 
    {

			




	
	
	
		
 
      tmp = xmlNodeListGetString(doc, cur->xmlChildrenNode, 1);

			




	
	
	
		
 
      fprintf(stderr, "adding job: %s", tmp);

			




	
	
	
		
 
      // add job from job number @TODO create function with parameters (struct distrenjob *head, int job_number)

			




	
	
	
		
 
      // LordOfWar calls dibs on above todo

			




	
	
	
		
 

			




	
	
	
		
 

			




	
	
	
		
 
      xmlFree(tmp);

			




	
	
	
		
 
      cur = cur->next; // go to next child element of job_list element

			




	
	
	
		
 
    }

			




	
	
	
		
 
    }*/

			




	
	
	
		
 

			




	
	
	
		
 
  xmlFreeDoc(doc);

			




	
	
	
		
 

			




	
	
	
		
 
  return 1;

			




	
	
	
		
 
}

			




	
	
	
		
 

			




	
	
	
		
 
// inserts jobs at front of queue, starting with the last job in the job_list xml file

			




	
	
	
		
 
// to preserve the order of the queue

			




	
	
	
		
 
int reCreateQueueFromXML(struct distrenjob *head, xmlDocPtr doc, xmlNodePtr current)

			




	
	
	
		
 
{

			




	
	
	
		
 
  struct distrenjob *holder; // holds the job that "was" after head, so that the new struct can be inserted after head

			




	
	
	
		
 
  struct distrenjob *job; // job to be added

			




	
	
	
		
 
  xmlChar *tmp;

			




	
	
	
		
 
  if(current == NULL) // base case, if element doesn't exist then don't do anything

			




	
	
	
		
 
    return 0;

			




	
	
	
		
 

			




	
	
	
		
 
  // recursively call itself so that the next job in the queue is added to the front before the current one

			




	
	
	
		
 
  reCreateQueueFromXML(head, doc, current->next);

			




	
	
	
		
 

			




	
	
	
		
 
  // now actual work is done, adding the job to the front of the queue

			




	
	
	
		
 
  holder = head->next; // initialize holder

			




	
	
	
		
 
  tmp = xmlNodeListGetString(doc, current->xmlChildrenNode, 1); // get job number

			




	
	
	
		
 
  // job = another function that reads data from xml for that job, prepares the job, and returns a pointer to the job

			




	
	
	
		
 
  xmlFree(tmp); // free xml char (that holds the job number)

			




	
	
	
		
 

			




	
	
	
		
 
  // insert job at front of the queue

			




	
	
	
		
 
  head->next = job;

			




	
	
	
		
 
  job->next = holder;

			




	
	
	
		
 

			




	
	
	
		
 
  return 1;

			




	
	
	
		
 
}

			




	
	
	
		
 

			




	
	
	
		
 
/* ************************** Test Functions ************************* */

			




	
	
	
		
 
void printFrameInfo(struct frameset *frame)

			




	
	
	
		
 
{

			




	
	
	
		
 
  char *status;

			




	
	
	
		
 

			




	
	
	
		
 
  status = NULL;

			




	
	
	
		
 

			




	
	
	
		
 
  switch(frame->status)

			




	
	
	
		
 
  {

			




	
	
	
		
 
    case FRAMESETSTATUS_UNASSIGNED:

			




	
	
	
		
 
      _distren_asprintf(&status, "%s", "unassigned");

			




	
	
	
		
 
      break;

			




	
	
	
		
 
    case FRAMESETSTATUS_ASSIGNED:

			




	
	
	
		
 
      _distren_asprintf(&status, "%s", "assigned");

			




	
	
	
		
 
      break;

			




	
	
	
		
 
    case FRAMESETSTATUS_DONE:

			




	
	
	
		
 
      _distren_asprintf(&status, "%s", "completed");

			




	
	
	
		
 
      break;

			




	
	
	
		
 
    case FRAMESETSTATUS_CANCELED:

			




	
	
	
		
 
      _distren_asprintf(&status, "%s", "canceled");

			




	
	
	
		
 
  }

			




	
	
	
		
 

			




	
	
	
		
 
  printf("frame #: %d --> %s", frame->num, status);

			




	
	
	
		
 
}

			




	
	
	
		
 

			




	
	
	
		
 
void printJob(struct distrenjob *job)

			




	
	
	
		
 
{

			




	
	
	
		
 
  int counter;

			




	
	
	
		
 
  printf("frame_num: status");

			




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

			




	
	
	
		
 
    {

			




	
	
	
		
 
      printFrameInfo(&job->frameset[counter]);

			




	
	
	
		
 
    }

			




	
	
	
		
 
}

			




	
	
	
		
 

			




	
	
	
		
 
void printJobInfo(struct distrenjob *job)

			




	
	
	
		
 
{

			




	
	
	
		
 
  printf("type: %d", job->type);

			




	
	
	
		
 
  printf("name: %s", job->email);

			




	
	
	
		
 
  printf("submitter: %s", job->submitter);

			




	
	
	
		
 
  printf("e-mail: %s", job->email);

			




	
	
	
		
 
  printf("priority, %d", job->priority);

			




	
	
	
		
 
  printf("completed: %d", job->completed_frames);

			




	
	
	
		
 
  printf("assigned: %d", job->assigned_frames);

			




	
	
	
		
 
  printf("total: %d", job->total_frames);

			




	
	
	
		
 
  printf("watchdog: %d", job->watchdog_forgiveness);

			




	
	
	
		
 
  printf("hibernate: %d", job->hibernate);

			




	
	
	
		
 
  printf("prev_frame: %d", job->prev_frame_index);

			




	
	
	
		
 
}

			




	
	
	
		
 

			




	
	
	
		
 
void printAllJobnums(struct distrenjob *head)

			




	
	
	
		
 
{

			




	
	
	
		
 
  struct distrenjob *current_job;

			




	
	
	
		
 
  int total_jobs;

			




	
	
	
		
 
  printf("job numbers in the order they will be processed:");

			




	
	
	
		
 

			




	
	
	
		
 
  total_jobs = 0;

			




	
	
	
		
 
  for(current_job = head; !current_job; current_job = current_job->next)

			




	
	
	
		
 
    {

			




	
	
	
		
 
      printf("%d", current_job->jobnum);

			




	
	
	
		
 
      total_jobs++;

			




	
	
	
		
 
    }

			




	
	
	
		
 

			




	
	
	
		
 
  printf("%d jobs in queue", total_jobs);

			




	
	
	
		
 
}

			




	
	
	
		
 

			




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

			




	
	
	
		
 

			




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

			




	
	
	
		
 
{

			




	
	
	
		
 

			




	
	
	
		
 
  /* Argument-parser */

			




	
	
	
		
 
  int counter = 0;

			




	
	
	
		
 
  int test = 0; // Have some fun if-ness that does fun stuff when this is 1

			




	
	
	
		
 

			




	
	
	
		
 
  for(counter=0; counter<argc; counter++){

			




	
	
	
		
 
         if(strcmp(argv[counter], "-h") == 0) {

			




	
	
	
		
 
           fprintf(stderr, "Usage: distrend [option] \nStarts the distrend server\n\t-h\tshow this help\n\t-t\tlaunches queue testing interface \n");

			




	
	
	
		
 
           return 2;

			




	
	
	
		
 
          }

			




	
	
	
		
 

			




	
	
	
		
 
          else if(strcmp(argv[counter], "-t") == 0) {

			




	
	
	
		
 
            fprintf(stderr, "Entering into test mode...\n\n");

			




	
	
	
		
 
            test=1;

			




	
	
	
		
 
          }

			




	
	
	
		
 
  }

			




	
	
	
		
 

			




	
	
	
		
 

			




	
	
	
		
 
  struct distrenjob head;

			




	
	
	
		
 
  head.priority = 0; // make head have the highest priority

			




	
	
	
		
 

			




	
	
	
		
 
  int cont;

			




	
	
	
		
 
  struct distrend_listenset *listenset;

			




	
	
	
		
 
  struct distrend_config *config;

			




	
	
	
		
 

			




	
	
	
		
 
  enum clientstatus

			




        

    



    


    



    



      

      





    
    0 comments (0 inline, 0 general)
    





    


  

  







  


    




    








    
        Server instance: zserverv-307515
    
    
        This site is powered by
            Kallithea,
        which is
        © 2010–2021 by various authors & licensed under GPLv3.
            – Support