1 /* prot.c - protocol implementation */
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/>.
24 #include <sys/resource.h>
40 /* job body cannot be greater than this many bytes long */
41 size_t job_data_size_limit
= JOB_DATA_SIZE_LIMIT_DEFAULT
;
44 "ABCDEFGHIJKLMNOPQRSTUVWXYZ" \
45 "abcdefghijklmnopqrstuvwxyz" \
48 #define CMD_PUT "put "
49 #define CMD_PEEKJOB "peek "
50 #define CMD_PEEK_READY "peek-ready"
51 #define CMD_PEEK_DELAYED "peek-delayed"
52 #define CMD_PEEK_BURIED "peek-buried"
53 #define CMD_RESERVE "reserve"
54 #define CMD_RESERVE_TIMEOUT "reserve-with-timeout "
55 #define CMD_DELETE "delete "
56 #define CMD_RELEASE "release "
57 #define CMD_BURY "bury "
58 #define CMD_KICK "kick "
59 #define CMD_STATS "stats"
60 #define CMD_JOBSTATS "stats-job "
61 #define CMD_USE "use "
62 #define CMD_WATCH "watch "
63 #define CMD_IGNORE "ignore "
64 #define CMD_LIST_TUBES "list-tubes"
65 #define CMD_LIST_TUBE_USED "list-tube-used"
66 #define CMD_LIST_TUBES_WATCHED "list-tubes-watched"
67 #define CMD_STATS_TUBE "stats-tube "
69 #define CONSTSTRLEN(m) (sizeof(m) - 1)
71 #define CMD_PEEK_READY_LEN CONSTSTRLEN(CMD_PEEK_READY)
72 #define CMD_PEEK_DELAYED_LEN CONSTSTRLEN(CMD_PEEK_DELAYED)
73 #define CMD_PEEK_BURIED_LEN CONSTSTRLEN(CMD_PEEK_BURIED)
74 #define CMD_PEEKJOB_LEN CONSTSTRLEN(CMD_PEEKJOB)
75 #define CMD_RESERVE_LEN CONSTSTRLEN(CMD_RESERVE)
76 #define CMD_RESERVE_TIMEOUT_LEN CONSTSTRLEN(CMD_RESERVE_TIMEOUT)
77 #define CMD_DELETE_LEN CONSTSTRLEN(CMD_DELETE)
78 #define CMD_RELEASE_LEN CONSTSTRLEN(CMD_RELEASE)
79 #define CMD_BURY_LEN CONSTSTRLEN(CMD_BURY)
80 #define CMD_KICK_LEN CONSTSTRLEN(CMD_KICK)
81 #define CMD_STATS_LEN CONSTSTRLEN(CMD_STATS)
82 #define CMD_JOBSTATS_LEN CONSTSTRLEN(CMD_JOBSTATS)
83 #define CMD_USE_LEN CONSTSTRLEN(CMD_USE)
84 #define CMD_WATCH_LEN CONSTSTRLEN(CMD_WATCH)
85 #define CMD_IGNORE_LEN CONSTSTRLEN(CMD_IGNORE)
86 #define CMD_LIST_TUBES_LEN CONSTSTRLEN(CMD_LIST_TUBES)
87 #define CMD_LIST_TUBE_USED_LEN CONSTSTRLEN(CMD_LIST_TUBE_USED)
88 #define CMD_LIST_TUBES_WATCHED_LEN CONSTSTRLEN(CMD_LIST_TUBES_WATCHED)
89 #define CMD_STATS_TUBE_LEN CONSTSTRLEN(CMD_STATS_TUBE)
91 #define MSG_FOUND "FOUND"
92 #define MSG_NOTFOUND "NOT_FOUND\r\n"
93 #define MSG_RESERVED "RESERVED"
94 #define MSG_DEADLINE_SOON "DEADLINE_SOON\r\n"
95 #define MSG_TIMED_OUT "TIMED_OUT\r\n"
96 #define MSG_DELETED "DELETED\r\n"
97 #define MSG_RELEASED "RELEASED\r\n"
98 #define MSG_BURIED "BURIED\r\n"
99 #define MSG_BURIED_FMT "BURIED %llu\r\n"
100 #define MSG_INSERTED_FMT "INSERTED %llu\r\n"
101 #define MSG_NOT_IGNORED "NOT_IGNORED\r\n"
103 #define MSG_NOTFOUND_LEN CONSTSTRLEN(MSG_NOTFOUND)
104 #define MSG_DELETED_LEN CONSTSTRLEN(MSG_DELETED)
105 #define MSG_RELEASED_LEN CONSTSTRLEN(MSG_RELEASED)
106 #define MSG_BURIED_LEN CONSTSTRLEN(MSG_BURIED)
107 #define MSG_NOT_IGNORED_LEN CONSTSTRLEN(MSG_NOT_IGNORED)
109 #define MSG_OUT_OF_MEMORY "OUT_OF_MEMORY\r\n"
110 #define MSG_INTERNAL_ERROR "INTERNAL_ERROR\r\n"
111 #define MSG_DRAINING "DRAINING\r\n"
112 #define MSG_BAD_FORMAT "BAD_FORMAT\r\n"
113 #define MSG_UNKNOWN_COMMAND "UNKNOWN_COMMAND\r\n"
114 #define MSG_EXPECTED_CRLF "EXPECTED_CRLF\r\n"
115 #define MSG_JOB_TOO_BIG "JOB_TOO_BIG\r\n"
117 #define STATE_WANTCOMMAND 0
118 #define STATE_WANTDATA 1
119 #define STATE_SENDJOB 2
120 #define STATE_SENDWORD 3
122 #define STATE_BITBUCKET 5
133 #define OP_JOBSTATS 9
134 #define OP_PEEK_BURIED 10
138 #define OP_LIST_TUBES 14
139 #define OP_LIST_TUBE_USED 15
140 #define OP_LIST_TUBES_WATCHED 16
141 #define OP_STATS_TUBE 17
142 #define OP_PEEK_READY 18
143 #define OP_PEEK_DELAYED 19
144 #define OP_RESERVE_TIMEOUT 20
147 #define STATS_FMT "---\n" \
148 "current-jobs-urgent: %u\n" \
149 "current-jobs-ready: %u\n" \
150 "current-jobs-reserved: %u\n" \
151 "current-jobs-delayed: %u\n" \
152 "current-jobs-buried: %u\n" \
155 "cmd-peek-ready: %llu\n" \
156 "cmd-peek-delayed: %llu\n" \
157 "cmd-peek-buried: %llu\n" \
158 "cmd-reserve: %llu\n" \
159 "cmd-reserve-with-timeout: %llu\n" \
160 "cmd-delete: %llu\n" \
161 "cmd-release: %llu\n" \
163 "cmd-watch: %llu\n" \
164 "cmd-ignore: %llu\n" \
167 "cmd-stats: %llu\n" \
168 "cmd-stats-job: %llu\n" \
169 "cmd-stats-tube: %llu\n" \
170 "cmd-list-tubes: %llu\n" \
171 "cmd-list-tube-used: %llu\n" \
172 "cmd-list-tubes-watched: %llu\n" \
173 "job-timeouts: %llu\n" \
174 "total-jobs: %llu\n" \
175 "max-job-size: %zu\n" \
176 "current-tubes: %zu\n" \
177 "current-connections: %u\n" \
178 "current-producers: %u\n" \
179 "current-workers: %u\n" \
180 "current-waiting: %u\n" \
181 "total-connections: %u\n" \
184 "rusage-utime: %d.%06d\n" \
185 "rusage-stime: %d.%06d\n" \
189 #define STATS_TUBE_FMT "---\n" \
191 "current-jobs-urgent: %u\n" \
192 "current-jobs-ready: %u\n" \
193 "current-jobs-reserved: %u\n" \
194 "current-jobs-delayed: %u\n" \
195 "current-jobs-buried: %u\n" \
196 "total-jobs: %llu\n" \
197 "current-using: %u\n" \
198 "current-watching: %u\n" \
199 "current-waiting: %u\n" \
202 #define JOB_STATS_FMT "---\n" \
217 /* this number is pretty arbitrary */
218 #define BUCKET_BUF_SIZE 1024
220 static char bucket
[BUCKET_BUF_SIZE
];
222 static unsigned int ready_ct
= 0;
223 static struct stats global_stat
= {0, 0, 0, 0, 0};
225 static tube default_tube
;
227 static int drain_mode
= 0;
228 static time_t start_time
;
229 static unsigned long long int op_ct
[TOTAL_OPS
], timeout_ct
= 0;
232 /* Doubly-linked list of connections with at least one reserved job. */
233 static struct conn running
= { &running
, &running
, 0 };
236 static const char * op_names
[] = {
253 CMD_LIST_TUBES_WATCHED
,
264 return job_list_any_p(&t
->buried
);
268 reply(conn c
, const char *line
, int len
, int state
)
274 r
= conn_update_evq(c
, EV_WRITE
| EV_PERSIST
);
275 if (r
== -1) return twarnx("conn_update_evq() failed"), conn_close(c
);
281 dprintf("sending reply: %.*s", len
, line
);
284 #define reply_msg(c,m) reply((c),(m),CONSTSTRLEN(m),STATE_SENDWORD)
286 #define reply_serr(c,e) (twarnx("server error: %s",(e)),\
290 reply_line(conn c
, int state
, const char *fmt
, ...)
296 r
= vsnprintf(c
->reply_buf
, LINE_BUF_SIZE
, fmt
, ap
);
299 /* Make sure the buffer was big enough. If not, we have a bug. */
300 if (r
>= LINE_BUF_SIZE
) return reply_serr(c
, MSG_INTERNAL_ERROR
);
302 return reply(c
, c
->reply_buf
, r
, state
);
306 reply_job(conn c
, job j
, const char *word
)
308 /* tell this connection which job to send */
312 return reply_line(c
, STATE_SENDJOB
, "%s %llu %u\r\n",
313 word
, j
->id
, j
->body_size
- 2);
317 remove_waiting_conn(conn c
)
322 if (!conn_waiting(c
)) return NULL
;
324 c
->type
&= ~CONN_TYPE_WAITING
;
325 global_stat
.waiting_ct
--;
326 for (i
= 0; i
< c
->watch
.used
; i
++) {
327 t
= c
->watch
.items
[i
];
328 t
->stat
.waiting_ct
--;
329 ms_remove(&t
->waiting
, c
);
335 reserve_job(conn c
, job j
)
337 j
->deadline
= time(NULL
) + j
->ttr
;
338 global_stat
.reserved_ct
++; /* stats */
339 j
->tube
->stat
.reserved_ct
++;
340 conn_insert(&running
, c
);
341 j
->state
= JOB_STATE_RESERVED
;
342 job_insert(&c
->reserved_jobs
, j
);
344 if (c
->soonest_job
&& j
->deadline
< c
->soonest_job
->deadline
) {
347 return reply_job(c
, j
, MSG_RESERVED
);
355 job j
= NULL
, candidate
;
357 dprintf("tubes.used = %zu\n", tubes
.used
);
358 for (i
= 0; i
< tubes
.used
; i
++) {
360 dprintf("for %s t->waiting.used=%zu t->ready.used=%d\n",
361 t
->name
, t
->waiting
.used
, t
->ready
.used
);
362 if (t
->waiting
.used
&& t
->ready
.used
) {
363 candidate
= pq_peek(&t
->ready
);
364 if (!j
|| candidate
->id
< j
->id
) j
= candidate
;
366 dprintf("i = %zu, tubes.used = %zu\n", i
, tubes
.used
);
377 dprintf("processing queue\n");
378 while ((j
= next_eligible_job())) {
379 dprintf("got eligible job %llu in %s\n", j
->id
, j
->tube
->name
);
380 j
= pq_take(&j
->tube
->ready
);
382 if (j
->pri
< URGENT_THRESHOLD
) {
383 global_stat
.urgent_ct
--;
384 j
->tube
->stat
.urgent_ct
--;
386 reserve_job(remove_waiting_conn(ms_take(&j
->tube
->waiting
)), j
);
397 for (i
= 0; i
< tubes
.used
; i
++) {
399 nj
= pq_peek(&t
->delay
);
401 if (!j
|| nj
->deadline
< j
->deadline
) j
= nj
;
408 set_main_delay_timeout()
412 set_main_timeout((j
= delay_q_peek()) ? j
->deadline
: 0);
416 enqueue_job(job j
, unsigned int delay
)
422 j
->deadline
= time(NULL
) + delay
;
423 r
= pq_give(&j
->tube
->delay
, j
);
425 j
->state
= JOB_STATE_DELAYED
;
426 set_main_delay_timeout();
428 r
= pq_give(&j
->tube
->ready
, j
);
430 j
->state
= JOB_STATE_READY
;
432 if (j
->pri
< URGENT_THRESHOLD
) {
433 global_stat
.urgent_ct
++;
434 j
->tube
->stat
.urgent_ct
++;
445 job_insert(&j
->tube
->buried
, j
);
446 global_stat
.buried_ct
++;
447 j
->tube
->stat
.buried_ct
++;
448 j
->state
= JOB_STATE_BURIED
;
455 enqueue_reserved_jobs(conn c
)
460 while (job_list_any_p(&c
->reserved_jobs
)) {
461 j
= job_remove(c
->reserved_jobs
.next
);
462 r
= enqueue_job(j
, 0);
464 global_stat
.reserved_ct
--;
465 j
->tube
->stat
.reserved_ct
--;
466 c
->soonest_job
= NULL
;
467 if (!job_list_any_p(&c
->reserved_jobs
)) conn_remove(c
);
474 job j
= delay_q_peek();
475 return j
? pq_take(&j
->tube
->delay
) : NULL
;
479 remove_this_buried_job(job j
)
483 global_stat
.buried_ct
--;
484 j
->tube
->stat
.buried_ct
--;
490 kick_buried_job(tube t
)
495 if (!buried_job_p(t
)) return 0;
496 j
= remove_this_buried_job(t
->buried
.next
);
498 r
= enqueue_job(j
, 0);
501 /* ready queue is full, so bury it */
511 unsigned int count
= 0;
513 for (i
= 0; i
< tubes
.used
; i
++) {
515 count
+= pq_used(&t
->delay
);
521 kick_delayed_job(tube t
)
526 j
= pq_take(&t
->delay
);
529 r
= enqueue_job(j
, 0);
532 /* ready queue is full, so delay it again */
533 r
= enqueue_job(j
, j
->delay
);
541 /* return the number of jobs successfully kicked */
543 kick_buried_jobs(tube t
, unsigned int n
)
546 for (i
= 0; (i
< n
) && kick_buried_job(t
); ++i
);
550 /* return the number of jobs successfully kicked */
552 kick_delayed_jobs(tube t
, unsigned int n
)
555 for (i
= 0; (i
< n
) && kick_delayed_job(t
); ++i
);
560 kick_jobs(tube t
, unsigned int n
)
562 if (buried_job_p(t
)) return kick_buried_jobs(t
, n
);
563 return kick_delayed_jobs(t
, n
);
567 find_buried_job(unsigned long long int id
)
569 job j
= job_find(id
);
570 return (j
&& j
->state
== JOB_STATE_BURIED
) ? j
: NULL
;
574 remove_buried_job(unsigned long long int id
)
576 return remove_this_buried_job(find_buried_job(id
));
580 enqueue_waiting_conn(conn c
)
585 global_stat
.waiting_ct
++;
586 c
->type
|= CONN_TYPE_WAITING
;
587 for (i
= 0; i
< c
->watch
.used
; i
++) {
588 t
= c
->watch
.items
[i
];
589 t
->stat
.waiting_ct
++;
590 ms_append(&t
->waiting
, c
);
595 find_reserved_job_in_conn(conn c
, unsigned long long int id
)
597 job j
= job_find(id
);
598 return (j
&& j
->reserver
== c
&& j
->state
== JOB_STATE_RESERVED
) ? j
: NULL
;
602 peek_job(unsigned long long int id
)
608 check_err(conn c
, const char *s
)
610 if (errno
== EAGAIN
) return;
611 if (errno
== EINTR
) return;
612 if (errno
== EWOULDBLOCK
) return;
619 /* Scan the given string for the sequence "\r\n" and return the line length.
620 * Always returns at least 2 if a match is found. Returns 0 if no match. */
622 scan_line_end(const char *s
, int size
)
626 match
= memchr(s
, '\r', size
- 1);
627 if (!match
) return 0;
629 /* this is safe because we only scan size - 1 chars above */
630 if (match
[1] == '\n') return match
- s
+ 2;
638 return scan_line_end(c
->cmd
, c
->cmd_read
);
641 /* parse the command line */
645 #define TEST_CMD(s,c,o) if (strncmp((s), (c), CONSTSTRLEN(c)) == 0) return (o);
646 TEST_CMD(c
->cmd
, CMD_PUT
, OP_PUT
);
647 TEST_CMD(c
->cmd
, CMD_PEEKJOB
, OP_PEEKJOB
);
648 TEST_CMD(c
->cmd
, CMD_PEEK_READY
, OP_PEEK_READY
);
649 TEST_CMD(c
->cmd
, CMD_PEEK_DELAYED
, OP_PEEK_DELAYED
);
650 TEST_CMD(c
->cmd
, CMD_PEEK_BURIED
, OP_PEEK_BURIED
);
651 TEST_CMD(c
->cmd
, CMD_RESERVE_TIMEOUT
, OP_RESERVE_TIMEOUT
);
652 TEST_CMD(c
->cmd
, CMD_RESERVE
, OP_RESERVE
);
653 TEST_CMD(c
->cmd
, CMD_DELETE
, OP_DELETE
);
654 TEST_CMD(c
->cmd
, CMD_RELEASE
, OP_RELEASE
);
655 TEST_CMD(c
->cmd
, CMD_BURY
, OP_BURY
);
656 TEST_CMD(c
->cmd
, CMD_KICK
, OP_KICK
);
657 TEST_CMD(c
->cmd
, CMD_JOBSTATS
, OP_JOBSTATS
);
658 TEST_CMD(c
->cmd
, CMD_STATS_TUBE
, OP_STATS_TUBE
);
659 TEST_CMD(c
->cmd
, CMD_STATS
, OP_STATS
);
660 TEST_CMD(c
->cmd
, CMD_USE
, OP_USE
);
661 TEST_CMD(c
->cmd
, CMD_WATCH
, OP_WATCH
);
662 TEST_CMD(c
->cmd
, CMD_IGNORE
, OP_IGNORE
);
663 TEST_CMD(c
->cmd
, CMD_LIST_TUBES_WATCHED
, OP_LIST_TUBES_WATCHED
);
664 TEST_CMD(c
->cmd
, CMD_LIST_TUBE_USED
, OP_LIST_TUBE_USED
);
665 TEST_CMD(c
->cmd
, CMD_LIST_TUBES
, OP_LIST_TUBES
);
669 /* Copy up to body_size trailing bytes into the job, then the rest into the cmd
670 * buffer. If c->in_job exists, this assumes that c->in_job->body is empty.
671 * This function is idempotent(). */
673 fill_extra_data(conn c
)
675 int extra_bytes
, job_data_bytes
= 0, cmd_bytes
;
677 if (!c
->fd
) return; /* the connection was closed */
678 if (!c
->cmd_len
) return; /* we don't have a complete command */
680 /* how many extra bytes did we read? */
681 extra_bytes
= c
->cmd_read
- c
->cmd_len
;
683 /* how many bytes should we put into the job body? */
685 job_data_bytes
= min(extra_bytes
, c
->in_job
->body_size
);
686 memcpy(c
->in_job
->body
, c
->cmd
+ c
->cmd_len
, job_data_bytes
);
687 c
->in_job_read
= job_data_bytes
;
688 } else if (c
->in_job_read
) {
689 /* we are in bit-bucket mode, throwing away data */
690 job_data_bytes
= min(extra_bytes
, c
->in_job_read
);
691 c
->in_job_read
-= job_data_bytes
;
694 /* how many bytes are left to go into the future cmd? */
695 cmd_bytes
= extra_bytes
- job_data_bytes
;
696 memmove(c
->cmd
, c
->cmd
+ c
->cmd_len
+ job_data_bytes
, cmd_bytes
);
697 c
->cmd_read
= cmd_bytes
;
698 c
->cmd_len
= 0; /* we no longer know the length of the new command */
702 enqueue_incoming_job(conn c
)
707 c
->in_job
= NULL
; /* the connection no longer owns this job */
710 /* check if the trailer is present and correct */
711 if (memcmp(j
->body
+ j
->body_size
- 2, "\r\n", 2)) {
713 return reply_msg(c
, MSG_EXPECTED_CRLF
);
718 return reply_serr(c
, MSG_DRAINING
);
721 /* we have a complete job, so let's stick it in the pqueue */
722 r
= enqueue_job(j
, j
->delay
);
723 op_ct
[OP_PUT
]++; /* stats */
724 global_stat
.total_jobs_ct
++;
725 j
->tube
->stat
.total_jobs_ct
++;
727 if (r
) return reply_line(c
, STATE_SENDWORD
, MSG_INSERTED_FMT
, j
->id
);
729 /* out of memory trying to grow the queue, so it gets buried */
731 reply_line(c
, STATE_SENDWORD
, MSG_BURIED_FMT
, j
->id
);
737 return time(NULL
) - start_time
;
741 fmt_stats(char *buf
, size_t size
, void *x
)
743 struct rusage ru
= {{0, 0}, {0, 0}};
744 getrusage(RUSAGE_SELF
, &ru
); /* don't care if it fails */
745 return snprintf(buf
, size
, STATS_FMT
,
746 global_stat
.urgent_ct
,
748 global_stat
.reserved_ct
,
749 get_delayed_job_ct(),
750 global_stat
.buried_ct
,
753 op_ct
[OP_PEEK_READY
],
754 op_ct
[OP_PEEK_DELAYED
],
755 op_ct
[OP_PEEK_BURIED
],
757 op_ct
[OP_RESERVE_TIMEOUT
],
767 op_ct
[OP_STATS_TUBE
],
768 op_ct
[OP_LIST_TUBES
],
769 op_ct
[OP_LIST_TUBE_USED
],
770 op_ct
[OP_LIST_TUBES_WATCHED
],
772 global_stat
.total_jobs_ct
,
776 count_cur_producers(),
778 global_stat
.waiting_ct
,
782 (int) ru
.ru_utime
.tv_sec
, (int) ru
.ru_utime
.tv_usec
,
783 (int) ru
.ru_stime
.tv_sec
, (int) ru
.ru_stime
.tv_usec
,
788 /* Read a priority value from the given buffer and place it in pri.
789 * Update end to point to the address after the last character consumed.
790 * Pri and end can be NULL. If they are both NULL, read_pri() will do the
791 * conversion and return the status code but not update any values. This is an
792 * easy way to check for errors.
793 * If end is NULL, read_pri will also check that the entire input string was
794 * consumed and return an error code otherwise.
795 * Return 0 on success, or nonzero on failure.
796 * If a failure occurs, pri and end are not modified. */
798 read_pri(unsigned int *pri
, const char *buf
, char **end
)
804 tpri
= strtoul(buf
, &tend
, 10);
805 if (tend
== buf
) return -1;
806 if (errno
&& errno
!= ERANGE
) return -1;
807 if (!end
&& tend
[0] != '\0') return -1;
809 if (pri
) *pri
= tpri
;
810 if (end
) *end
= tend
;
814 /* Read a delay value from the given buffer and place it in delay.
815 * The interface and behavior are the same as in read_pri(). */
817 read_delay(unsigned int *delay
, const char *buf
, char **end
)
819 return read_pri(delay
, buf
, end
);
822 /* Read a timeout value from the given buffer and place it in ttr.
823 * The interface and behavior are the same as in read_pri(). */
825 read_ttr(unsigned int *ttr
, const char *buf
, char **end
)
827 return read_pri(ttr
, buf
, end
);
831 wait_for_job(conn c
, int timeout
)
835 c
->state
= STATE_WAIT
;
836 enqueue_waiting_conn(c
);
838 /* Set the pending timeout to the requested timeout amount */
839 c
->pending_timeout
= timeout
;
841 /* this conn is waiting, but we want to know if they hang up */
842 r
= conn_update_evq(c
, EV_READ
| EV_PERSIST
);
843 if (r
== -1) return twarnx("update events failed"), conn_close(c
);
846 typedef int(*fmt_fn
)(char *, size_t, void *);
849 do_stats(conn c
, fmt_fn fmt
, void *data
)
853 /* first, measure how big a buffer we will need */
854 stats_len
= fmt(NULL
, 0, data
) + 16;
856 c
->out_job
= allocate_job(stats_len
); /* fake job to hold stats data */
857 if (!c
->out_job
) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
859 /* now actually format the stats data */
860 r
= fmt(c
->out_job
->body
, stats_len
, data
);
861 /* and set the actual body size */
862 c
->out_job
->body_size
= r
;
863 if (r
> stats_len
) return reply_serr(c
, MSG_INTERNAL_ERROR
);
866 return reply_line(c
, STATE_SENDJOB
, "OK %d\r\n", r
- 2);
870 do_list_tubes(conn c
, ms l
)
876 /* first, measure how big a buffer we will need */
877 resp_z
= 6; /* initial "---\n" and final "\r\n" */
878 for (i
= 0; i
< l
->used
; i
++) {
880 resp_z
+= 3 + strlen(t
->name
); /* including "- " and "\n" */
883 c
->out_job
= allocate_job(resp_z
); /* fake job to hold response data */
884 if (!c
->out_job
) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
886 /* now actually format the response */
887 buf
= c
->out_job
->body
;
888 buf
+= snprintf(buf
, 5, "---\n");
889 for (i
= 0; i
< l
->used
; i
++) {
891 buf
+= snprintf(buf
, 4 + strlen(t
->name
), "- %s\n", t
->name
);
897 return reply_line(c
, STATE_SENDJOB
, "OK %d\r\n", resp_z
- 2);
901 fmt_job_stats(char *buf
, size_t size
, job j
)
906 return snprintf(buf
, size
, JOB_STATS_FMT
,
911 (unsigned int) (t
- j
->creation
),
914 (unsigned int) (j
->deadline
- t
),
922 fmt_stats_tube(char *buf
, size_t size
, tube t
)
924 return snprintf(buf
, size
, STATS_TUBE_FMT
,
931 t
->stat
.total_jobs_ct
,
938 maybe_enqueue_incoming_job(conn c
)
942 /* do we have a complete job? */
943 if (c
->in_job_read
== j
->body_size
) return enqueue_incoming_job(c
);
945 /* otherwise we have incomplete data, so just keep waiting */
946 c
->state
= STATE_WANTDATA
;
951 remove_this_reserved_job(conn c
, job j
)
955 global_stat
.reserved_ct
--;
956 j
->tube
->stat
.reserved_ct
--;
959 c
->soonest_job
= NULL
;
960 if (!job_list_any_p(&c
->reserved_jobs
)) conn_remove(c
);
965 remove_reserved_job(conn c
, unsigned long long int id
)
967 return remove_this_reserved_job(c
, find_reserved_job_in_conn(c
, id
));
971 name_is_ok(const char *name
, size_t max
)
973 size_t len
= strlen(name
);
974 return len
> 0 && len
<= max
&&
975 strspn(name
, NAME_CHARS
) == len
&& name
[0] != '-';
979 prot_remove_tube(tube t
)
981 ms_remove(&tubes
, t
);
987 int r
, i
, timeout
= -1;
991 char *size_buf
, *delay_buf
, *ttr_buf
, *pri_buf
, *end_buf
, *name
;
992 unsigned int pri
, delay
, ttr
, body_size
;
993 unsigned long long int id
;
996 /* NUL-terminate this string so we can use strtol and friends */
997 c
->cmd
[c
->cmd_len
- 2] = '\0';
999 /* check for possible maliciousness */
1000 if (strlen(c
->cmd
) != c
->cmd_len
- 2) {
1001 return reply_msg(c
, MSG_BAD_FORMAT
);
1004 type
= which_cmd(c
);
1005 dprintf("got %s command: \"%s\"\n", op_names
[(int) type
], c
->cmd
);
1009 r
= read_pri(&pri
, c
->cmd
+ 4, &delay_buf
);
1010 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1012 r
= read_delay(&delay
, delay_buf
, &ttr_buf
);
1013 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1015 r
= read_ttr(&ttr
, ttr_buf
, &size_buf
);
1016 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1019 body_size
= strtoul(size_buf
, &end_buf
, 10);
1020 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1022 if (body_size
> job_data_size_limit
) {
1023 return reply_msg(c
, MSG_JOB_TOO_BIG
);
1026 /* don't allow trailing garbage */
1027 if (end_buf
[0] != '\0') return reply_msg(c
, MSG_BAD_FORMAT
);
1029 conn_set_producer(c
);
1031 c
->in_job
= make_job(pri
, delay
, ttr
? : 1, body_size
+ 2, c
->use
);
1035 /* throw away the job body and respond with OUT_OF_MEMORY */
1037 /* Invert the meaning of in_job_read while throwing away data -- it
1038 * counts the bytes that remain to be thrown away. */
1039 c
->in_job_read
= body_size
+ 2;
1042 if (c
->in_job_read
== 0) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
1044 c
->state
= STATE_BITBUCKET
;
1050 /* it's possible we already have a complete job */
1051 maybe_enqueue_incoming_job(c
);
1055 /* don't allow trailing garbage */
1056 if (c
->cmd_len
!= CMD_PEEK_READY_LEN
+ 2) {
1057 return reply_msg(c
, MSG_BAD_FORMAT
);
1061 j
= job_copy(pq_peek(&c
->use
->ready
));
1063 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1065 reply_job(c
, j
, MSG_FOUND
);
1067 case OP_PEEK_DELAYED
:
1068 /* don't allow trailing garbage */
1069 if (c
->cmd_len
!= CMD_PEEK_DELAYED_LEN
+ 2) {
1070 return reply_msg(c
, MSG_BAD_FORMAT
);
1074 j
= job_copy(pq_peek(&c
->use
->delay
));
1076 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1078 reply_job(c
, j
, MSG_FOUND
);
1080 case OP_PEEK_BURIED
:
1081 /* don't allow trailing garbage */
1082 if (c
->cmd_len
!= CMD_PEEK_BURIED_LEN
+ 2) {
1083 return reply_msg(c
, MSG_BAD_FORMAT
);
1087 j
= job_copy(buried_job_p(c
->use
)? j
= c
->use
->buried
.next
: NULL
);
1089 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1091 reply_job(c
, j
, MSG_FOUND
);
1095 id
= strtoull(c
->cmd
+ CMD_PEEKJOB_LEN
, &end_buf
, 10);
1096 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1099 /* So, peek is annoying, because some other connection might free the
1100 * job while we are still trying to write it out. So we copy it and
1101 * then free the copy when it's done sending. */
1102 j
= job_copy(peek_job(id
));
1104 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1106 reply_job(c
, j
, MSG_FOUND
);
1108 case OP_RESERVE_TIMEOUT
:
1110 timeout
= strtol(c
->cmd
+ CMD_RESERVE_TIMEOUT_LEN
, &end_buf
, 10);
1111 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1112 case OP_RESERVE
: /* FALLTHROUGH */
1113 /* don't allow trailing garbage */
1114 if (type
== OP_RESERVE
&& c
->cmd_len
!= CMD_RESERVE_LEN
+ 2) {
1115 return reply_msg(c
, MSG_BAD_FORMAT
);
1121 if (conn_has_close_deadline(c
) && !conn_ready(c
)) {
1122 return reply_msg(c
, MSG_DEADLINE_SOON
);
1125 /* try to get a new job for this guy */
1126 wait_for_job(c
, timeout
);
1131 id
= strtoull(c
->cmd
+ CMD_DELETE_LEN
, &end_buf
, 10);
1132 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1135 j
= remove_reserved_job(c
, id
) ? : remove_buried_job(id
);
1137 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1139 j
->state
= JOB_STATE_INVALID
;
1140 binlog_write_job(j
);
1143 reply(c
, MSG_DELETED
, MSG_DELETED_LEN
, STATE_SENDWORD
);
1147 id
= strtoull(c
->cmd
+ CMD_RELEASE_LEN
, &pri_buf
, 10);
1148 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1150 r
= read_pri(&pri
, pri_buf
, &delay_buf
);
1151 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1153 r
= read_delay(&delay
, delay_buf
, NULL
);
1154 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1157 j
= remove_reserved_job(c
, id
);
1159 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1164 r
= enqueue_job(j
, delay
);
1165 if (r
) return reply(c
, MSG_RELEASED
, MSG_RELEASED_LEN
, STATE_SENDWORD
);
1167 /* out of memory trying to grow the queue, so it gets buried */
1169 reply(c
, MSG_BURIED
, MSG_BURIED_LEN
, STATE_SENDWORD
);
1173 id
= strtoull(c
->cmd
+ CMD_BURY_LEN
, &pri_buf
, 10);
1174 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1176 r
= read_pri(&pri
, pri_buf
, NULL
);
1177 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1180 j
= remove_reserved_job(c
, id
);
1182 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1186 reply(c
, MSG_BURIED
, MSG_BURIED_LEN
, STATE_SENDWORD
);
1190 count
= strtoul(c
->cmd
+ CMD_KICK_LEN
, &end_buf
, 10);
1191 if (end_buf
== c
->cmd
+ CMD_KICK_LEN
) {
1192 return reply_msg(c
, MSG_BAD_FORMAT
);
1194 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1198 i
= kick_jobs(c
->use
, count
);
1200 return reply_line(c
, STATE_SENDWORD
, "KICKED %u\r\n", i
);
1202 /* don't allow trailing garbage */
1203 if (c
->cmd_len
!= CMD_STATS_LEN
+ 2) {
1204 return reply_msg(c
, MSG_BAD_FORMAT
);
1209 do_stats(c
, fmt_stats
, NULL
);
1213 id
= strtoull(c
->cmd
+ CMD_JOBSTATS_LEN
, &end_buf
, 10);
1214 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1219 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1221 if (!j
->tube
) return reply_serr(c
, MSG_INTERNAL_ERROR
);
1222 do_stats(c
, (fmt_fn
) fmt_job_stats
, j
);
1225 name
= c
->cmd
+ CMD_STATS_TUBE_LEN
;
1226 if (!name_is_ok(name
, 200)) return reply_msg(c
, MSG_BAD_FORMAT
);
1230 t
= tube_find(name
);
1231 if (!t
) return reply_msg(c
, MSG_NOTFOUND
);
1233 do_stats(c
, (fmt_fn
) fmt_stats_tube
, t
);
1237 /* don't allow trailing garbage */
1238 if (c
->cmd_len
!= CMD_LIST_TUBES_LEN
+ 2) {
1239 return reply_msg(c
, MSG_BAD_FORMAT
);
1243 do_list_tubes(c
, &tubes
);
1245 case OP_LIST_TUBE_USED
:
1246 /* don't allow trailing garbage */
1247 if (c
->cmd_len
!= CMD_LIST_TUBE_USED_LEN
+ 2) {
1248 return reply_msg(c
, MSG_BAD_FORMAT
);
1252 reply_line(c
, STATE_SENDWORD
, "USING %s\r\n", c
->use
->name
);
1254 case OP_LIST_TUBES_WATCHED
:
1255 /* don't allow trailing garbage */
1256 if (c
->cmd_len
!= CMD_LIST_TUBES_WATCHED_LEN
+ 2) {
1257 return reply_msg(c
, MSG_BAD_FORMAT
);
1261 do_list_tubes(c
, &c
->watch
);
1264 name
= c
->cmd
+ CMD_USE_LEN
;
1265 if (!name_is_ok(name
, 200)) return reply_msg(c
, MSG_BAD_FORMAT
);
1268 TUBE_ASSIGN(t
, tube_find_or_make(name
));
1269 if (!t
) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
1272 TUBE_ASSIGN(c
->use
, t
);
1273 TUBE_ASSIGN(t
, NULL
);
1276 reply_line(c
, STATE_SENDWORD
, "USING %s\r\n", c
->use
->name
);
1279 name
= c
->cmd
+ CMD_WATCH_LEN
;
1280 if (!name_is_ok(name
, 200)) return reply_msg(c
, MSG_BAD_FORMAT
);
1283 TUBE_ASSIGN(t
, tube_find_or_make(name
));
1284 if (!t
) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
1287 if (!ms_contains(&c
->watch
, t
)) r
= ms_append(&c
->watch
, t
);
1288 TUBE_ASSIGN(t
, NULL
);
1289 if (!r
) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
1291 reply_line(c
, STATE_SENDWORD
, "WATCHING %d\r\n", c
->watch
.used
);
1294 name
= c
->cmd
+ CMD_IGNORE_LEN
;
1295 if (!name_is_ok(name
, 200)) return reply_msg(c
, MSG_BAD_FORMAT
);
1299 for (i
= 0; i
< c
->watch
.used
; i
++) {
1300 t
= c
->watch
.items
[i
];
1301 if (strncmp(t
->name
, name
, MAX_TUBE_NAME_LEN
) == 0) break;
1305 if (t
&& c
->watch
.used
< 2) return reply_msg(c
, MSG_NOT_IGNORED
);
1307 if (t
) ms_remove(&c
->watch
, t
); /* may free t if refcount => 0 */
1310 reply_line(c
, STATE_SENDWORD
, "WATCHING %d\r\n", c
->watch
.used
);
1313 return reply_msg(c
, MSG_UNKNOWN_COMMAND
);
1317 /* There are three reasons this function may be called. We need to check for
1320 * 1. A reserved job has run out of time.
1321 * 2. A waiting client's reserved job has entered the safety margin.
1322 * 3. A waiting client's requested timeout has occurred.
1324 * If any of these happen, we must do the appropriate thing. */
1326 h_conn_timeout(conn c
)
1328 int r
, should_timeout
= 0;
1331 /* Check if the client was trying to reserve a job. */
1332 if (conn_waiting(c
) && conn_has_close_deadline(c
)) should_timeout
= 1;
1334 /* Check if any reserved jobs have run out of time. We should do this
1335 * whether or not the client is waiting for a new reservation. */
1336 while ((j
= soonest_job(c
))) {
1337 if (j
->deadline
> time(NULL
)) break;
1338 timeout_ct
++; /* stats */
1340 r
= enqueue_job(remove_this_reserved_job(c
, j
), 0);
1341 if (!r
) bury_job(j
); /* there was no room in the queue, so bury it */
1342 r
= conn_update_evq(c
, c
->evq
.ev_events
);
1343 if (r
== -1) return twarnx("conn_update_evq() failed"), conn_close(c
);
1346 if (should_timeout
) {
1347 dprintf("conn_waiting(%p) = %d\n", c
, conn_waiting(c
));
1348 return reply_msg(remove_waiting_conn(c
), MSG_DEADLINE_SOON
);
1349 } else if (conn_waiting(c
) && c
->pending_timeout
>= 0) {
1350 dprintf("conn_waiting(%p) = %d\n", c
, conn_waiting(c
));
1351 c
->pending_timeout
=-1;
1352 return reply_msg(remove_waiting_conn(c
), MSG_TIMED_OUT
);
1357 enter_drain_mode(int sig
)
1374 r
= conn_update_evq(c
, EV_READ
| EV_PERSIST
);
1375 if (r
== -1) return twarnx("update events failed"), conn_close(c
);
1377 /* was this a peek or stats command? */
1378 if (!has_reserved_this_job(c
, c
->out_job
)) job_free(c
->out_job
);
1381 c
->reply_sent
= 0; /* now that we're done, reset this */
1382 c
->state
= STATE_WANTCOMMAND
;
1390 struct iovec iov
[2];
1393 case STATE_WANTCOMMAND
:
1394 r
= read(c
->fd
, c
->cmd
+ c
->cmd_read
, LINE_BUF_SIZE
- c
->cmd_read
);
1395 if (r
== -1) return check_err(c
, "read()");
1396 if (r
== 0) return conn_close(c
); /* the client hung up */
1398 c
->cmd_read
+= r
; /* we got some bytes */
1400 c
->cmd_len
= cmd_len(c
); /* find the EOL */
1402 /* yay, complete command line */
1403 if (c
->cmd_len
) return do_cmd(c
);
1405 /* c->cmd_read > LINE_BUF_SIZE can't happen */
1407 /* command line too long? */
1408 if (c
->cmd_read
== LINE_BUF_SIZE
) {
1409 c
->cmd_read
= 0; /* discard the input so far */
1410 return reply_msg(c
, MSG_BAD_FORMAT
);
1413 /* otherwise we have an incomplete line, so just keep waiting */
1415 case STATE_BITBUCKET
:
1416 /* Invert the meaning of in_job_read while throwing away data -- it
1417 * counts the bytes that remain to be thrown away. */
1418 to_read
= min(c
->in_job_read
, BUCKET_BUF_SIZE
);
1419 r
= read(c
->fd
, bucket
, to_read
);
1420 if (r
== -1) return check_err(c
, "read()");
1421 if (r
== 0) return conn_close(c
); /* the client hung up */
1423 c
->in_job_read
-= r
; /* we got some bytes */
1425 /* (c->in_job_read < 0) can't happen */
1427 if (c
->in_job_read
== 0) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
1429 case STATE_WANTDATA
:
1432 r
= read(c
->fd
, j
->body
+ c
->in_job_read
, j
->body_size
-c
->in_job_read
);
1433 if (r
== -1) return check_err(c
, "read()");
1434 if (r
== 0) return conn_close(c
); /* the client hung up */
1436 c
->in_job_read
+= r
; /* we got some bytes */
1438 /* (j->in_job_read > j->body_size) can't happen */
1440 maybe_enqueue_incoming_job(c
);
1442 case STATE_SENDWORD
:
1443 r
= write(c
->fd
, c
->reply
+ c
->reply_sent
, c
->reply_len
- c
->reply_sent
);
1444 if (r
== -1) return check_err(c
, "write()");
1445 if (r
== 0) return conn_close(c
); /* the client hung up */
1447 c
->reply_sent
+= r
; /* we got some bytes */
1449 /* (c->reply_sent > c->reply_len) can't happen */
1451 if (c
->reply_sent
== c
->reply_len
) return reset_conn(c
);
1453 /* otherwise we sent an incomplete reply, so just keep waiting */
1458 iov
[0].iov_base
= (void *)(c
->reply
+ c
->reply_sent
);
1459 iov
[0].iov_len
= c
->reply_len
- c
->reply_sent
; /* maybe 0 */
1460 iov
[1].iov_base
= j
->body
+ c
->out_job_sent
;
1461 iov
[1].iov_len
= j
->body_size
- c
->out_job_sent
;
1463 r
= writev(c
->fd
, iov
, 2);
1464 if (r
== -1) return check_err(c
, "writev()");
1465 if (r
== 0) return conn_close(c
); /* the client hung up */
1467 /* update the sent values */
1469 if (c
->reply_sent
>= c
->reply_len
) {
1470 c
->out_job_sent
+= c
->reply_sent
- c
->reply_len
;
1471 c
->reply_sent
= c
->reply_len
;
1474 /* (c->out_job_sent > j->body_size) can't happen */
1477 if (c
->out_job_sent
== j
->body_size
) return reset_conn(c
);
1479 /* otherwise we sent incomplete data, so just keep waiting */
1481 case STATE_WAIT
: /* keep an eye out in case they hang up */
1482 /* but don't hang up just because our buffer is full */
1483 if (LINE_BUF_SIZE
- c
->cmd_read
< 1) break;
1485 r
= read(c
->fd
, c
->cmd
+ c
->cmd_read
, LINE_BUF_SIZE
- c
->cmd_read
);
1486 if (r
== -1) return check_err(c
, "read()");
1487 if (r
== 0) return conn_close(c
); /* the client hung up */
1488 c
->cmd_read
+= r
; /* we got some bytes */
1492 #define want_command(c) ((c)->fd && ((c)->state == STATE_WANTCOMMAND))
1493 #define cmd_data_ready(c) (want_command(c) && (c)->cmd_read)
1496 h_conn(const int fd
, const short which
, conn c
)
1499 twarnx("Argh! event fd doesn't match conn fd.");
1501 return conn_close(c
);
1507 event_add(&c
->evq
, NULL
); /* seems to be necessary */
1510 /* fall through... */
1512 /* fall through... */
1517 while (cmd_data_ready(c
) && (c
->cmd_len
= cmd_len(c
))) do_cmd(c
);
1528 while ((j
= delay_q_peek())) {
1529 if (j
->deadline
> t
) break;
1531 r
= enqueue_job(j
, 0);
1532 if (!r
) bury_job(j
); /* there was no room in the queue, so bury it */
1535 set_main_delay_timeout();
1539 h_accept(const int fd
, const short which
, struct event
*ev
)
1544 struct sockaddr addr
;
1546 if (which
== EV_TIMEOUT
) return h_delay();
1548 addrlen
= sizeof addr
;
1549 cfd
= accept(fd
, &addr
, &addrlen
);
1551 if (errno
!= EAGAIN
&& errno
!= EWOULDBLOCK
) twarn("accept()");
1552 if (errno
== EMFILE
) brake();
1556 flags
= fcntl(cfd
, F_GETFL
, 0);
1557 if (flags
< 0) return twarn("getting flags"), close(cfd
), v();
1559 r
= fcntl(cfd
, F_SETFL
, flags
| O_NONBLOCK
);
1560 if (r
< 0) return twarn("setting O_NONBLOCK"), close(cfd
), v();
1562 c
= make_conn(cfd
, STATE_WANTCOMMAND
, default_tube
, default_tube
);
1563 if (!c
) return twarnx("make_conn() failed"), close(cfd
), brake();
1565 dprintf("accepted conn, fd=%d\n", cfd
);
1566 r
= conn_set_evq(c
, EV_READ
| EV_PERSIST
, (evh
) h_conn
);
1567 if (r
== -1) return twarnx("conn_set_evq() failed"), close(cfd
), brake();
1573 start_time
= time(NULL
);
1574 memset(op_ct
, 0, sizeof(op_ct
));
1576 ms_init(&tubes
, NULL
, NULL
);
1578 TUBE_ASSIGN(default_tube
, tube_find_or_make("default"));
1579 if (!default_tube
) twarnx("Out of memory during startup!");
1583 prot_replay_binlog()
1585 struct job binlog_jobs
;
1589 binlog_jobs
.prev
= binlog_jobs
.next
= &binlog_jobs
;
1590 binlog_read(&binlog_jobs
);
1592 for(j
= binlog_jobs
.next
; j
!= &binlog_jobs
; j
= nj
) {
1597 case JOB_STATE_BURIED
:
1600 case JOB_STATE_DELAYED
:
1601 if (start_time
< j
->deadline
) delay
= j
->deadline
- start_time
;
1603 enqueue_job(j
,delay
);