job.h

   1 /* job.h - a job in the queue */
   2
   3 /* Copyright (C) 2007 Keith Rarick and Philotic Inc.
   4
   5  * This program is free software: you can redistribute it and/or modify
   6  * it under the terms of the GNU General Public License as published by
   7  * the Free Software Foundation, either version 3 of the License, or
   8  * (at your option) any later version.
   9
  10  * This program is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13  * GNU General Public License for more details.
  14
  15  * You should have received a copy of the GNU General Public License
  16  * along with this program.  If not, see <http://www.gnu.org/licenses/>.
  17  */
  18
  19 #ifndef job_h
  20 #define job_h
  21
  22 #include <time.h>
  23
  24 typedef struct job *job;
  25 typedef int(*job_cmp_fn)(job, job);
  26
  27 #include "tube.h"
  28
  29 #define JOB_STATE_INVALID 0
  30 #define JOB_STATE_READY 1
  31 #define JOB_STATE_RESERVED 2
  32 #define JOB_STATE_BURIED 3
  33 #define JOB_STATE_DELAYED 4
  34
  35 /* If you modify this struct, you MUST increment binlog format version in
  36  * binlog.c. */
  37 struct job {
  38
  39     /* persistent fields; these get written to the binlog */
  40     unsigned long long int id;
  41     unsigned int pri;
  42     unsigned int delay;
  43     unsigned int ttr;
  44     int body_size;
  45     time_t creation;
  46     time_t deadline;
  47     unsigned int timeout_ct;
  48     unsigned int release_ct;
  49     unsigned int bury_ct;
  50     unsigned int kick_ct;
  51     char state;
  52
  53     /* bookeeping fields; these are in-memory only */
  54     char pad[6];
  55     tube tube;
  56     job prev, next; /* linked list of jobs */
  57     job ht_next; /* Next job in a hash table list */
  58     size_t heap_index; /* where is this job in its current heap */
  59     void *binlog;
  60     void *reserver;
  61     size_t reserved_binlog_space;
  62
  63     /* variable-size job data; written separately to the binlog */
  64     char body[];
  65 };
  66
  67 #define make_job(pri,delay,ttr,body_size,tube) make_job_with_id(pri,delay,ttr,body_size,tube,0)
  68
  69 job allocate_job(int body_size);
  70 job make_job_with_id(unsigned int pri, unsigned int delay, unsigned int ttr,
  71              int body_size, tube tube, unsigned long long id);
  72 void job_free(job j);
  73
  74 /* Lookup a job by job ID */
  75 job job_find(unsigned long long int job_id);
  76
  77 int job_pri_cmp(job a, job b);
  78 int job_delay_cmp(job a, job b);
  79
  80 job job_copy(job j);
  81
  82 const char * job_state(job j);
  83
  84 int job_list_any_p(job head);
  85 job job_remove(job j);
  86 void job_insert(job head, job j);
  87
  88 unsigned long long int total_jobs();
  89
  90 void job_init();
  91
  92 #endif /*job_h*/