1 /* job.c - a job in the queue */
3 /* Copyright (C) 2007 Keith Rarick and Philotic Inc.
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.
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.
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/>.
27 static unsigned long long int next_id
= 1;
29 static int cur_prime
= 0;
31 static job
*all_jobs
= NULL
;
32 static size_t all_jobs_cap
= 12289; /* == primes[0] */
33 static size_t all_jobs_used
= 0;
35 static int hash_table_was_oom
= 0;
40 _get_job_hash_index(unsigned long long int job_id
)
42 return job_id
% all_jobs_cap
;
50 index
= _get_job_hash_index(j
->id
);
52 j
->ht_next
= all_jobs
[index
];
56 /* accept a load factor of 4 */
57 if (all_jobs_used
> (all_jobs_cap
<< 2)) rehash();
64 size_t old_cap
= all_jobs_cap
, old_used
= all_jobs_used
, i
;
66 if (cur_prime
>= NUM_PRIMES
) return;
67 if (hash_table_was_oom
) return;
69 all_jobs_cap
= primes
[++cur_prime
];
70 all_jobs
= calloc(all_jobs_cap
, sizeof(job
));
72 twarnx("Failed to allocate %d new hash buckets", all_jobs_cap
);
73 hash_table_was_oom
= 1;
76 all_jobs_cap
= old_cap
;
77 all_jobs_used
= old_used
;
82 for (i
= 0; i
< old_cap
; i
++) {
93 job_find(unsigned long long int job_id
)
96 int index
= _get_job_hash_index(job_id
);
98 for (jh
= all_jobs
[index
]; jh
&& jh
->id
!= job_id
; jh
= jh
->ht_next
);
104 allocate_job(int body_size
)
108 j
= malloc(sizeof(struct job
) + body_size
);
109 if (!j
) return twarnx("OOM"), NULL
;
112 j
->state
= JOB_STATE_INVALID
;
113 j
->creation
= time(NULL
);
114 j
->timeout_ct
= j
->release_ct
= j
->bury_ct
= j
->kick_ct
= 0;
115 j
->body_size
= body_size
;
116 j
->next
= j
->prev
= j
; /* not in a linked list */
125 make_job_with_id(unsigned int pri
, unsigned int delay
, unsigned int ttr
,
126 int body_size
, tube tube
, unsigned long long id
)
130 j
= allocate_job(body_size
);
131 if (!j
) return twarnx("OOM"), NULL
;
135 if (id
>= next_id
) next_id
= id
+ 1;
145 TUBE_ASSIGN(j
->tube
, tube
);
153 int index
= _get_job_hash_index(j
->id
);
154 job jh
= all_jobs
? all_jobs
[index
] : NULL
;
158 /* Special case the first */
159 all_jobs
[index
] = jh
->ht_next
;
162 while (jh
->ht_next
&& jh
->ht_next
!= j
) jh
= jh
->ht_next
;
165 jh
->ht_next
= jh
->ht_next
->ht_next
;
177 TUBE_ASSIGN(j
->tube
, NULL
);
184 /* We can't substrct any of these values because there are too many bits */
186 job_pri_cmp(job a
, job b
)
188 if (a
->pri
> b
->pri
) return 1;
189 if (a
->pri
< b
->pri
) return -1;
190 if (a
->id
> b
->id
) return 1;
191 if (a
->id
< b
->id
) return -1;
195 /* We can't substrct any of these values because there are too many bits */
197 job_delay_cmp(job a
, job b
)
199 if (a
->deadline
> b
->deadline
) return 1;
200 if (a
->deadline
< b
->deadline
) return -1;
201 if (a
->id
> b
->id
) return 1;
202 if (a
->id
< b
->id
) return -1;
213 n
= malloc(sizeof(struct job
) + j
->body_size
);
214 if (!n
) return twarnx("OOM"), NULL
;
216 memcpy(n
, j
, sizeof(struct job
) + j
->body_size
);
217 n
->next
= n
->prev
= n
; /* not in a linked list */
219 n
->tube
= 0; /* Don't use memcpy for the tube, which we must refcount. */
220 TUBE_ASSIGN(n
->tube
, j
->tube
);
228 if (j
->state
== JOB_STATE_READY
) return "ready";
229 if (j
->state
== JOB_STATE_RESERVED
) return "reserved";
230 if (j
->state
== JOB_STATE_BURIED
) return "buried";
231 if (j
->state
== JOB_STATE_DELAYED
) return "delayed";
236 job_list_any_p(job head
)
238 return head
->next
!= head
|| head
->prev
!= head
;
245 if (!job_list_any_p(j
)) return NULL
; /* not in a doubly-linked list */
247 j
->next
->prev
= j
->prev
;
248 j
->prev
->next
= j
->next
;
250 j
->prev
= j
->next
= j
;
256 job_insert(job head
, job j
)
258 if (job_list_any_p(j
)) return; /* already in a linked list */
260 j
->prev
= head
->prev
;
262 head
->prev
->next
= j
;
266 unsigned long long int
275 all_jobs
= calloc(all_jobs_cap
, sizeof(job
));
277 twarnx("Failed to allocate %d hash buckets", all_jobs_cap
);