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_TOUCH "touch "
60 #define CMD_STATS "stats"
61 #define CMD_JOBSTATS "stats-job "
62 #define CMD_USE "use "
63 #define CMD_WATCH "watch "
64 #define CMD_IGNORE "ignore "
65 #define CMD_LIST_TUBES "list-tubes"
66 #define CMD_LIST_TUBE_USED "list-tube-used"
67 #define CMD_LIST_TUBES_WATCHED "list-tubes-watched"
68 #define CMD_STATS_TUBE "stats-tube "
70 #define CONSTSTRLEN(m) (sizeof(m) - 1)
72 #define CMD_PEEK_READY_LEN CONSTSTRLEN(CMD_PEEK_READY)
73 #define CMD_PEEK_DELAYED_LEN CONSTSTRLEN(CMD_PEEK_DELAYED)
74 #define CMD_PEEK_BURIED_LEN CONSTSTRLEN(CMD_PEEK_BURIED)
75 #define CMD_PEEKJOB_LEN CONSTSTRLEN(CMD_PEEKJOB)
76 #define CMD_RESERVE_LEN CONSTSTRLEN(CMD_RESERVE)
77 #define CMD_RESERVE_TIMEOUT_LEN CONSTSTRLEN(CMD_RESERVE_TIMEOUT)
78 #define CMD_DELETE_LEN CONSTSTRLEN(CMD_DELETE)
79 #define CMD_RELEASE_LEN CONSTSTRLEN(CMD_RELEASE)
80 #define CMD_BURY_LEN CONSTSTRLEN(CMD_BURY)
81 #define CMD_KICK_LEN CONSTSTRLEN(CMD_KICK)
82 #define CMD_TOUCH_LEN CONSTSTRLEN(CMD_TOUCH)
83 #define CMD_STATS_LEN CONSTSTRLEN(CMD_STATS)
84 #define CMD_JOBSTATS_LEN CONSTSTRLEN(CMD_JOBSTATS)
85 #define CMD_USE_LEN CONSTSTRLEN(CMD_USE)
86 #define CMD_WATCH_LEN CONSTSTRLEN(CMD_WATCH)
87 #define CMD_IGNORE_LEN CONSTSTRLEN(CMD_IGNORE)
88 #define CMD_LIST_TUBES_LEN CONSTSTRLEN(CMD_LIST_TUBES)
89 #define CMD_LIST_TUBE_USED_LEN CONSTSTRLEN(CMD_LIST_TUBE_USED)
90 #define CMD_LIST_TUBES_WATCHED_LEN CONSTSTRLEN(CMD_LIST_TUBES_WATCHED)
91 #define CMD_STATS_TUBE_LEN CONSTSTRLEN(CMD_STATS_TUBE)
93 #define MSG_FOUND "FOUND"
94 #define MSG_NOTFOUND "NOT_FOUND\r\n"
95 #define MSG_RESERVED "RESERVED"
96 #define MSG_DEADLINE_SOON "DEADLINE_SOON\r\n"
97 #define MSG_TIMED_OUT "TIMED_OUT\r\n"
98 #define MSG_DELETED "DELETED\r\n"
99 #define MSG_RELEASED "RELEASED\r\n"
100 #define MSG_BURIED "BURIED\r\n"
101 #define MSG_TOUCHED "TOUCHED\r\n"
102 #define MSG_BURIED_FMT "BURIED %llu\r\n"
103 #define MSG_INSERTED_FMT "INSERTED %llu\r\n"
104 #define MSG_NOT_IGNORED "NOT_IGNORED\r\n"
106 #define MSG_NOTFOUND_LEN CONSTSTRLEN(MSG_NOTFOUND)
107 #define MSG_DELETED_LEN CONSTSTRLEN(MSG_DELETED)
108 #define MSG_TOUCHED_LEN CONSTSTRLEN(MSG_TOUCHED)
109 #define MSG_RELEASED_LEN CONSTSTRLEN(MSG_RELEASED)
110 #define MSG_BURIED_LEN CONSTSTRLEN(MSG_BURIED)
111 #define MSG_NOT_IGNORED_LEN CONSTSTRLEN(MSG_NOT_IGNORED)
113 #define MSG_OUT_OF_MEMORY "OUT_OF_MEMORY\r\n"
114 #define MSG_INTERNAL_ERROR "INTERNAL_ERROR\r\n"
115 #define MSG_DRAINING "DRAINING\r\n"
116 #define MSG_BAD_FORMAT "BAD_FORMAT\r\n"
117 #define MSG_UNKNOWN_COMMAND "UNKNOWN_COMMAND\r\n"
118 #define MSG_EXPECTED_CRLF "EXPECTED_CRLF\r\n"
119 #define MSG_JOB_TOO_BIG "JOB_TOO_BIG\r\n"
121 #define STATE_WANTCOMMAND 0
122 #define STATE_WANTDATA 1
123 #define STATE_SENDJOB 2
124 #define STATE_SENDWORD 3
126 #define STATE_BITBUCKET 5
137 #define OP_JOBSTATS 9
138 #define OP_PEEK_BURIED 10
142 #define OP_LIST_TUBES 14
143 #define OP_LIST_TUBE_USED 15
144 #define OP_LIST_TUBES_WATCHED 16
145 #define OP_STATS_TUBE 17
146 #define OP_PEEK_READY 18
147 #define OP_PEEK_DELAYED 19
148 #define OP_RESERVE_TIMEOUT 20
152 #define STATS_FMT "---\n" \
153 "current-jobs-urgent: %u\n" \
154 "current-jobs-ready: %u\n" \
155 "current-jobs-reserved: %u\n" \
156 "current-jobs-delayed: %u\n" \
157 "current-jobs-buried: %u\n" \
160 "cmd-peek-ready: %llu\n" \
161 "cmd-peek-delayed: %llu\n" \
162 "cmd-peek-buried: %llu\n" \
163 "cmd-reserve: %llu\n" \
164 "cmd-reserve-with-timeout: %llu\n" \
165 "cmd-delete: %llu\n" \
166 "cmd-release: %llu\n" \
168 "cmd-watch: %llu\n" \
169 "cmd-ignore: %llu\n" \
172 "cmd-touch: %llu\n" \
173 "cmd-stats: %llu\n" \
174 "cmd-stats-job: %llu\n" \
175 "cmd-stats-tube: %llu\n" \
176 "cmd-list-tubes: %llu\n" \
177 "cmd-list-tube-used: %llu\n" \
178 "cmd-list-tubes-watched: %llu\n" \
179 "job-timeouts: %llu\n" \
180 "total-jobs: %llu\n" \
181 "max-job-size: %zu\n" \
182 "current-tubes: %zu\n" \
183 "current-connections: %u\n" \
184 "current-producers: %u\n" \
185 "current-workers: %u\n" \
186 "current-waiting: %u\n" \
187 "total-connections: %u\n" \
190 "rusage-utime: %d.%06d\n" \
191 "rusage-stime: %d.%06d\n" \
195 #define STATS_TUBE_FMT "---\n" \
197 "current-jobs-urgent: %u\n" \
198 "current-jobs-ready: %u\n" \
199 "current-jobs-reserved: %u\n" \
200 "current-jobs-delayed: %u\n" \
201 "current-jobs-buried: %u\n" \
202 "total-jobs: %llu\n" \
203 "current-using: %u\n" \
204 "current-watching: %u\n" \
205 "current-waiting: %u\n" \
208 #define JOB_STATS_FMT "---\n" \
223 /* this number is pretty arbitrary */
224 #define BUCKET_BUF_SIZE 1024
226 static char bucket
[BUCKET_BUF_SIZE
];
228 static unsigned int ready_ct
= 0;
229 static struct stats global_stat
= {0, 0, 0, 0, 0};
231 static tube default_tube
;
233 static int drain_mode
= 0;
234 static time_t start_time
;
235 static unsigned long long int op_ct
[TOTAL_OPS
], timeout_ct
= 0;
238 /* Doubly-linked list of connections with at least one reserved job. */
239 static struct conn running
= { &running
, &running
, 0 };
242 static const char * op_names
[] = {
259 CMD_LIST_TUBES_WATCHED
,
271 return job_list_any_p(&t
->buried
);
275 reply(conn c
, const char *line
, int len
, int state
)
281 r
= conn_update_evq(c
, EV_WRITE
| EV_PERSIST
);
282 if (r
== -1) return twarnx("conn_update_evq() failed"), conn_close(c
);
288 dprintf("sending reply: %.*s", len
, line
);
291 #define reply_msg(c,m) reply((c),(m),CONSTSTRLEN(m),STATE_SENDWORD)
293 #define reply_serr(c,e) (twarnx("server error: %s",(e)),\
297 reply_line(conn c
, int state
, const char *fmt
, ...)
303 r
= vsnprintf(c
->reply_buf
, LINE_BUF_SIZE
, fmt
, ap
);
306 /* Make sure the buffer was big enough. If not, we have a bug. */
307 if (r
>= LINE_BUF_SIZE
) return reply_serr(c
, MSG_INTERNAL_ERROR
);
309 return reply(c
, c
->reply_buf
, r
, state
);
313 reply_job(conn c
, job j
, const char *word
)
315 /* tell this connection which job to send */
319 return reply_line(c
, STATE_SENDJOB
, "%s %llu %u\r\n",
320 word
, j
->id
, j
->body_size
- 2);
324 remove_waiting_conn(conn c
)
329 if (!conn_waiting(c
)) return NULL
;
331 c
->type
&= ~CONN_TYPE_WAITING
;
332 global_stat
.waiting_ct
--;
333 for (i
= 0; i
< c
->watch
.used
; i
++) {
334 t
= c
->watch
.items
[i
];
335 t
->stat
.waiting_ct
--;
336 ms_remove(&t
->waiting
, c
);
342 reserve_job(conn c
, job j
)
344 j
->deadline
= time(NULL
) + j
->ttr
;
345 global_stat
.reserved_ct
++; /* stats */
346 j
->tube
->stat
.reserved_ct
++;
347 conn_insert(&running
, c
);
348 j
->state
= JOB_STATE_RESERVED
;
349 job_insert(&c
->reserved_jobs
, j
);
351 if (c
->soonest_job
&& j
->deadline
< c
->soonest_job
->deadline
) {
354 return reply_job(c
, j
, MSG_RESERVED
);
362 job j
= NULL
, candidate
;
364 dprintf("tubes.used = %zu\n", tubes
.used
);
365 for (i
= 0; i
< tubes
.used
; i
++) {
367 dprintf("for %s t->waiting.used=%zu t->ready.used=%d\n",
368 t
->name
, t
->waiting
.used
, t
->ready
.used
);
369 if (t
->waiting
.used
&& t
->ready
.used
) {
370 candidate
= pq_peek(&t
->ready
);
371 if (!j
|| candidate
->id
< j
->id
) j
= candidate
;
373 dprintf("i = %zu, tubes.used = %zu\n", i
, tubes
.used
);
384 dprintf("processing queue\n");
385 while ((j
= next_eligible_job())) {
386 dprintf("got eligible job %llu in %s\n", j
->id
, j
->tube
->name
);
387 j
= pq_take(&j
->tube
->ready
);
389 if (j
->pri
< URGENT_THRESHOLD
) {
390 global_stat
.urgent_ct
--;
391 j
->tube
->stat
.urgent_ct
--;
393 reserve_job(remove_waiting_conn(ms_take(&j
->tube
->waiting
)), j
);
404 for (i
= 0; i
< tubes
.used
; i
++) {
406 nj
= pq_peek(&t
->delay
);
408 if (!j
|| nj
->deadline
< j
->deadline
) j
= nj
;
415 set_main_delay_timeout()
419 set_main_timeout((j
= delay_q_peek()) ? j
->deadline
: 0);
423 enqueue_job(job j
, unsigned int delay
)
429 j
->deadline
= time(NULL
) + delay
;
430 r
= pq_give(&j
->tube
->delay
, j
);
432 j
->state
= JOB_STATE_DELAYED
;
433 set_main_delay_timeout();
435 r
= pq_give(&j
->tube
->ready
, j
);
437 j
->state
= JOB_STATE_READY
;
439 if (j
->pri
< URGENT_THRESHOLD
) {
440 global_stat
.urgent_ct
++;
441 j
->tube
->stat
.urgent_ct
++;
452 job_insert(&j
->tube
->buried
, j
);
453 global_stat
.buried_ct
++;
454 j
->tube
->stat
.buried_ct
++;
455 j
->state
= JOB_STATE_BURIED
;
462 enqueue_reserved_jobs(conn c
)
467 while (job_list_any_p(&c
->reserved_jobs
)) {
468 j
= job_remove(c
->reserved_jobs
.next
);
469 r
= enqueue_job(j
, 0);
471 global_stat
.reserved_ct
--;
472 j
->tube
->stat
.reserved_ct
--;
473 c
->soonest_job
= NULL
;
474 if (!job_list_any_p(&c
->reserved_jobs
)) conn_remove(c
);
481 job j
= delay_q_peek();
482 return j
? pq_take(&j
->tube
->delay
) : NULL
;
486 remove_this_buried_job(job j
)
490 global_stat
.buried_ct
--;
491 j
->tube
->stat
.buried_ct
--;
497 kick_buried_job(tube t
)
502 if (!buried_job_p(t
)) return 0;
503 j
= remove_this_buried_job(t
->buried
.next
);
505 r
= enqueue_job(j
, 0);
508 /* ready queue is full, so bury it */
518 unsigned int count
= 0;
520 for (i
= 0; i
< tubes
.used
; i
++) {
522 count
+= pq_used(&t
->delay
);
528 kick_delayed_job(tube t
)
533 j
= pq_take(&t
->delay
);
536 r
= enqueue_job(j
, 0);
539 /* ready queue is full, so delay it again */
540 r
= enqueue_job(j
, j
->delay
);
548 /* return the number of jobs successfully kicked */
550 kick_buried_jobs(tube t
, unsigned int n
)
553 for (i
= 0; (i
< n
) && kick_buried_job(t
); ++i
);
557 /* return the number of jobs successfully kicked */
559 kick_delayed_jobs(tube t
, unsigned int n
)
562 for (i
= 0; (i
< n
) && kick_delayed_job(t
); ++i
);
567 kick_jobs(tube t
, unsigned int n
)
569 if (buried_job_p(t
)) return kick_buried_jobs(t
, n
);
570 return kick_delayed_jobs(t
, n
);
574 find_buried_job(unsigned long long int id
)
576 job j
= job_find(id
);
577 return (j
&& j
->state
== JOB_STATE_BURIED
) ? j
: NULL
;
581 remove_buried_job(unsigned long long int id
)
583 return remove_this_buried_job(find_buried_job(id
));
587 enqueue_waiting_conn(conn c
)
592 global_stat
.waiting_ct
++;
593 c
->type
|= CONN_TYPE_WAITING
;
594 for (i
= 0; i
< c
->watch
.used
; i
++) {
595 t
= c
->watch
.items
[i
];
596 t
->stat
.waiting_ct
++;
597 ms_append(&t
->waiting
, c
);
602 find_reserved_job_in_conn(conn c
, unsigned long long int id
)
604 job j
= job_find(id
);
605 return (j
&& j
->reserver
== c
&& j
->state
== JOB_STATE_RESERVED
) ? j
: NULL
;
609 touch_job(conn c
, unsigned long long int id
)
611 job j
= find_reserved_job_in_conn(c
, id
);
613 j
->deadline
= time(NULL
) + j
->ttr
;
614 c
->soonest_job
= NULL
;
620 peek_job(unsigned long long int id
)
626 check_err(conn c
, const char *s
)
628 if (errno
== EAGAIN
) return;
629 if (errno
== EINTR
) return;
630 if (errno
== EWOULDBLOCK
) return;
637 /* Scan the given string for the sequence "\r\n" and return the line length.
638 * Always returns at least 2 if a match is found. Returns 0 if no match. */
640 scan_line_end(const char *s
, int size
)
644 match
= memchr(s
, '\r', size
- 1);
645 if (!match
) return 0;
647 /* this is safe because we only scan size - 1 chars above */
648 if (match
[1] == '\n') return match
- s
+ 2;
656 return scan_line_end(c
->cmd
, c
->cmd_read
);
659 /* parse the command line */
663 #define TEST_CMD(s,c,o) if (strncmp((s), (c), CONSTSTRLEN(c)) == 0) return (o);
664 TEST_CMD(c
->cmd
, CMD_PUT
, OP_PUT
);
665 TEST_CMD(c
->cmd
, CMD_PEEKJOB
, OP_PEEKJOB
);
666 TEST_CMD(c
->cmd
, CMD_PEEK_READY
, OP_PEEK_READY
);
667 TEST_CMD(c
->cmd
, CMD_PEEK_DELAYED
, OP_PEEK_DELAYED
);
668 TEST_CMD(c
->cmd
, CMD_PEEK_BURIED
, OP_PEEK_BURIED
);
669 TEST_CMD(c
->cmd
, CMD_RESERVE_TIMEOUT
, OP_RESERVE_TIMEOUT
);
670 TEST_CMD(c
->cmd
, CMD_RESERVE
, OP_RESERVE
);
671 TEST_CMD(c
->cmd
, CMD_DELETE
, OP_DELETE
);
672 TEST_CMD(c
->cmd
, CMD_RELEASE
, OP_RELEASE
);
673 TEST_CMD(c
->cmd
, CMD_BURY
, OP_BURY
);
674 TEST_CMD(c
->cmd
, CMD_KICK
, OP_KICK
);
675 TEST_CMD(c
->cmd
, CMD_TOUCH
, OP_TOUCH
);
676 TEST_CMD(c
->cmd
, CMD_JOBSTATS
, OP_JOBSTATS
);
677 TEST_CMD(c
->cmd
, CMD_STATS_TUBE
, OP_STATS_TUBE
);
678 TEST_CMD(c
->cmd
, CMD_STATS
, OP_STATS
);
679 TEST_CMD(c
->cmd
, CMD_USE
, OP_USE
);
680 TEST_CMD(c
->cmd
, CMD_WATCH
, OP_WATCH
);
681 TEST_CMD(c
->cmd
, CMD_IGNORE
, OP_IGNORE
);
682 TEST_CMD(c
->cmd
, CMD_LIST_TUBES_WATCHED
, OP_LIST_TUBES_WATCHED
);
683 TEST_CMD(c
->cmd
, CMD_LIST_TUBE_USED
, OP_LIST_TUBE_USED
);
684 TEST_CMD(c
->cmd
, CMD_LIST_TUBES
, OP_LIST_TUBES
);
688 /* Copy up to body_size trailing bytes into the job, then the rest into the cmd
689 * buffer. If c->in_job exists, this assumes that c->in_job->body is empty.
690 * This function is idempotent(). */
692 fill_extra_data(conn c
)
694 int extra_bytes
, job_data_bytes
= 0, cmd_bytes
;
696 if (!c
->fd
) return; /* the connection was closed */
697 if (!c
->cmd_len
) return; /* we don't have a complete command */
699 /* how many extra bytes did we read? */
700 extra_bytes
= c
->cmd_read
- c
->cmd_len
;
702 /* how many bytes should we put into the job body? */
704 job_data_bytes
= min(extra_bytes
, c
->in_job
->body_size
);
705 memcpy(c
->in_job
->body
, c
->cmd
+ c
->cmd_len
, job_data_bytes
);
706 c
->in_job_read
= job_data_bytes
;
707 } else if (c
->in_job_read
) {
708 /* we are in bit-bucket mode, throwing away data */
709 job_data_bytes
= min(extra_bytes
, c
->in_job_read
);
710 c
->in_job_read
-= job_data_bytes
;
713 /* how many bytes are left to go into the future cmd? */
714 cmd_bytes
= extra_bytes
- job_data_bytes
;
715 memmove(c
->cmd
, c
->cmd
+ c
->cmd_len
+ job_data_bytes
, cmd_bytes
);
716 c
->cmd_read
= cmd_bytes
;
717 c
->cmd_len
= 0; /* we no longer know the length of the new command */
721 enqueue_incoming_job(conn c
)
726 c
->in_job
= NULL
; /* the connection no longer owns this job */
729 /* check if the trailer is present and correct */
730 if (memcmp(j
->body
+ j
->body_size
- 2, "\r\n", 2)) {
732 return reply_msg(c
, MSG_EXPECTED_CRLF
);
737 return reply_serr(c
, MSG_DRAINING
);
740 /* we have a complete job, so let's stick it in the pqueue */
741 r
= enqueue_job(j
, j
->delay
);
742 op_ct
[OP_PUT
]++; /* stats */
743 global_stat
.total_jobs_ct
++;
744 j
->tube
->stat
.total_jobs_ct
++;
746 if (r
) return reply_line(c
, STATE_SENDWORD
, MSG_INSERTED_FMT
, j
->id
);
748 /* out of memory trying to grow the queue, so it gets buried */
750 reply_line(c
, STATE_SENDWORD
, MSG_BURIED_FMT
, j
->id
);
756 return time(NULL
) - start_time
;
760 fmt_stats(char *buf
, size_t size
, void *x
)
762 struct rusage ru
= {{0, 0}, {0, 0}};
763 getrusage(RUSAGE_SELF
, &ru
); /* don't care if it fails */
764 return snprintf(buf
, size
, STATS_FMT
,
765 global_stat
.urgent_ct
,
767 global_stat
.reserved_ct
,
768 get_delayed_job_ct(),
769 global_stat
.buried_ct
,
772 op_ct
[OP_PEEK_READY
],
773 op_ct
[OP_PEEK_DELAYED
],
774 op_ct
[OP_PEEK_BURIED
],
776 op_ct
[OP_RESERVE_TIMEOUT
],
787 op_ct
[OP_STATS_TUBE
],
788 op_ct
[OP_LIST_TUBES
],
789 op_ct
[OP_LIST_TUBE_USED
],
790 op_ct
[OP_LIST_TUBES_WATCHED
],
792 global_stat
.total_jobs_ct
,
796 count_cur_producers(),
798 global_stat
.waiting_ct
,
802 (int) ru
.ru_utime
.tv_sec
, (int) ru
.ru_utime
.tv_usec
,
803 (int) ru
.ru_stime
.tv_sec
, (int) ru
.ru_stime
.tv_usec
,
808 /* Read a priority value from the given buffer and place it in pri.
809 * Update end to point to the address after the last character consumed.
810 * Pri and end can be NULL. If they are both NULL, read_pri() will do the
811 * conversion and return the status code but not update any values. This is an
812 * easy way to check for errors.
813 * If end is NULL, read_pri will also check that the entire input string was
814 * consumed and return an error code otherwise.
815 * Return 0 on success, or nonzero on failure.
816 * If a failure occurs, pri and end are not modified. */
818 read_pri(unsigned int *pri
, const char *buf
, char **end
)
824 while (buf
[0] == ' ') buf
++;
825 if (!isdigit(buf
[0])) return -1;
826 tpri
= strtoul(buf
, &tend
, 10);
827 if (tend
== buf
) return -1;
828 if (errno
&& errno
!= ERANGE
) return -1;
829 if (!end
&& tend
[0] != '\0') return -1;
831 if (pri
) *pri
= tpri
;
832 if (end
) *end
= tend
;
836 /* Read a delay value from the given buffer and place it in delay.
837 * The interface and behavior are the same as in read_pri(). */
839 read_delay(unsigned int *delay
, const char *buf
, char **end
)
841 time_t now
= time(NULL
);
843 result
= read_pri(delay
, buf
, end
);
844 if (result
) return result
;
845 return (now
+ *delay
< now
);
848 /* Read a timeout value from the given buffer and place it in ttr.
849 * The interface and behavior are the same as in read_pri(). */
851 read_ttr(unsigned int *ttr
, const char *buf
, char **end
)
853 return read_pri(ttr
, buf
, end
);
857 wait_for_job(conn c
, int timeout
)
861 c
->state
= STATE_WAIT
;
862 enqueue_waiting_conn(c
);
864 /* Set the pending timeout to the requested timeout amount */
865 c
->pending_timeout
= timeout
;
867 /* this conn is waiting, but we want to know if they hang up */
868 r
= conn_update_evq(c
, EV_READ
| EV_PERSIST
);
869 if (r
== -1) return twarnx("update events failed"), conn_close(c
);
872 typedef int(*fmt_fn
)(char *, size_t, void *);
875 do_stats(conn c
, fmt_fn fmt
, void *data
)
879 /* first, measure how big a buffer we will need */
880 stats_len
= fmt(NULL
, 0, data
) + 16;
882 c
->out_job
= allocate_job(stats_len
); /* fake job to hold stats data */
883 if (!c
->out_job
) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
885 /* now actually format the stats data */
886 r
= fmt(c
->out_job
->body
, stats_len
, data
);
887 /* and set the actual body size */
888 c
->out_job
->body_size
= r
;
889 if (r
> stats_len
) return reply_serr(c
, MSG_INTERNAL_ERROR
);
892 return reply_line(c
, STATE_SENDJOB
, "OK %d\r\n", r
- 2);
896 do_list_tubes(conn c
, ms l
)
902 /* first, measure how big a buffer we will need */
903 resp_z
= 6; /* initial "---\n" and final "\r\n" */
904 for (i
= 0; i
< l
->used
; i
++) {
906 resp_z
+= 3 + strlen(t
->name
); /* including "- " and "\n" */
909 c
->out_job
= allocate_job(resp_z
); /* fake job to hold response data */
910 if (!c
->out_job
) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
912 /* now actually format the response */
913 buf
= c
->out_job
->body
;
914 buf
+= snprintf(buf
, 5, "---\n");
915 for (i
= 0; i
< l
->used
; i
++) {
917 buf
+= snprintf(buf
, 4 + strlen(t
->name
), "- %s\n", t
->name
);
923 return reply_line(c
, STATE_SENDJOB
, "OK %d\r\n", resp_z
- 2);
927 fmt_job_stats(char *buf
, size_t size
, job j
)
932 return snprintf(buf
, size
, JOB_STATS_FMT
,
937 (unsigned int) (t
- j
->creation
),
940 (unsigned int) (j
->deadline
- t
),
948 fmt_stats_tube(char *buf
, size_t size
, tube t
)
950 return snprintf(buf
, size
, STATS_TUBE_FMT
,
957 t
->stat
.total_jobs_ct
,
964 maybe_enqueue_incoming_job(conn c
)
968 /* do we have a complete job? */
969 if (c
->in_job_read
== j
->body_size
) return enqueue_incoming_job(c
);
971 /* otherwise we have incomplete data, so just keep waiting */
972 c
->state
= STATE_WANTDATA
;
977 remove_this_reserved_job(conn c
, job j
)
981 global_stat
.reserved_ct
--;
982 j
->tube
->stat
.reserved_ct
--;
985 c
->soonest_job
= NULL
;
986 if (!job_list_any_p(&c
->reserved_jobs
)) conn_remove(c
);
991 remove_reserved_job(conn c
, unsigned long long int id
)
993 return remove_this_reserved_job(c
, find_reserved_job_in_conn(c
, id
));
997 name_is_ok(const char *name
, size_t max
)
999 size_t len
= strlen(name
);
1000 return len
> 0 && len
<= max
&&
1001 strspn(name
, NAME_CHARS
) == len
&& name
[0] != '-';
1005 prot_remove_tube(tube t
)
1007 ms_remove(&tubes
, t
);
1011 dispatch_cmd(conn c
)
1013 int r
, i
, timeout
= -1;
1017 char *size_buf
, *delay_buf
, *ttr_buf
, *pri_buf
, *end_buf
, *name
;
1018 unsigned int pri
, delay
, ttr
, body_size
;
1019 unsigned long long int id
;
1022 /* NUL-terminate this string so we can use strtol and friends */
1023 c
->cmd
[c
->cmd_len
- 2] = '\0';
1025 /* check for possible maliciousness */
1026 if (strlen(c
->cmd
) != c
->cmd_len
- 2) {
1027 return reply_msg(c
, MSG_BAD_FORMAT
);
1030 type
= which_cmd(c
);
1031 dprintf("got %s command: \"%s\"\n", op_names
[(int) type
], c
->cmd
);
1035 r
= read_pri(&pri
, c
->cmd
+ 4, &delay_buf
);
1036 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1038 r
= read_delay(&delay
, delay_buf
, &ttr_buf
);
1039 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1041 r
= read_ttr(&ttr
, ttr_buf
, &size_buf
);
1042 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1045 body_size
= strtoul(size_buf
, &end_buf
, 10);
1046 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1048 if (body_size
> job_data_size_limit
) {
1049 return reply_msg(c
, MSG_JOB_TOO_BIG
);
1052 /* don't allow trailing garbage */
1053 if (end_buf
[0] != '\0') return reply_msg(c
, MSG_BAD_FORMAT
);
1055 conn_set_producer(c
);
1057 c
->in_job
= make_job(pri
, delay
, ttr
? : 1, body_size
+ 2, c
->use
);
1061 /* throw away the job body and respond with OUT_OF_MEMORY */
1063 /* Invert the meaning of in_job_read while throwing away data -- it
1064 * counts the bytes that remain to be thrown away. */
1065 c
->in_job_read
= body_size
+ 2;
1068 if (c
->in_job_read
== 0) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
1070 c
->state
= STATE_BITBUCKET
;
1076 /* it's possible we already have a complete job */
1077 maybe_enqueue_incoming_job(c
);
1081 /* don't allow trailing garbage */
1082 if (c
->cmd_len
!= CMD_PEEK_READY_LEN
+ 2) {
1083 return reply_msg(c
, MSG_BAD_FORMAT
);
1087 j
= job_copy(pq_peek(&c
->use
->ready
));
1089 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1091 reply_job(c
, j
, MSG_FOUND
);
1093 case OP_PEEK_DELAYED
:
1094 /* don't allow trailing garbage */
1095 if (c
->cmd_len
!= CMD_PEEK_DELAYED_LEN
+ 2) {
1096 return reply_msg(c
, MSG_BAD_FORMAT
);
1100 j
= job_copy(pq_peek(&c
->use
->delay
));
1102 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1104 reply_job(c
, j
, MSG_FOUND
);
1106 case OP_PEEK_BURIED
:
1107 /* don't allow trailing garbage */
1108 if (c
->cmd_len
!= CMD_PEEK_BURIED_LEN
+ 2) {
1109 return reply_msg(c
, MSG_BAD_FORMAT
);
1113 j
= job_copy(buried_job_p(c
->use
)? j
= c
->use
->buried
.next
: NULL
);
1115 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1117 reply_job(c
, j
, MSG_FOUND
);
1121 id
= strtoull(c
->cmd
+ CMD_PEEKJOB_LEN
, &end_buf
, 10);
1122 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1125 /* So, peek is annoying, because some other connection might free the
1126 * job while we are still trying to write it out. So we copy it and
1127 * then free the copy when it's done sending. */
1128 j
= job_copy(peek_job(id
));
1130 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1132 reply_job(c
, j
, MSG_FOUND
);
1134 case OP_RESERVE_TIMEOUT
:
1136 timeout
= strtol(c
->cmd
+ CMD_RESERVE_TIMEOUT_LEN
, &end_buf
, 10);
1137 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1138 case OP_RESERVE
: /* FALLTHROUGH */
1139 /* don't allow trailing garbage */
1140 if (type
== OP_RESERVE
&& c
->cmd_len
!= CMD_RESERVE_LEN
+ 2) {
1141 return reply_msg(c
, MSG_BAD_FORMAT
);
1147 if (conn_has_close_deadline(c
) && !conn_ready(c
)) {
1148 return reply_msg(c
, MSG_DEADLINE_SOON
);
1151 /* try to get a new job for this guy */
1152 wait_for_job(c
, timeout
);
1157 id
= strtoull(c
->cmd
+ CMD_DELETE_LEN
, &end_buf
, 10);
1158 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1161 j
= remove_reserved_job(c
, id
) ? : remove_buried_job(id
);
1163 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1165 j
->state
= JOB_STATE_INVALID
;
1166 binlog_write_job(j
);
1169 reply(c
, MSG_DELETED
, MSG_DELETED_LEN
, STATE_SENDWORD
);
1173 id
= strtoull(c
->cmd
+ CMD_RELEASE_LEN
, &pri_buf
, 10);
1174 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1176 r
= read_pri(&pri
, pri_buf
, &delay_buf
);
1177 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1179 r
= read_delay(&delay
, delay_buf
, NULL
);
1180 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1183 j
= remove_reserved_job(c
, id
);
1185 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1190 r
= enqueue_job(j
, delay
);
1191 if (r
) return reply(c
, MSG_RELEASED
, MSG_RELEASED_LEN
, STATE_SENDWORD
);
1193 /* out of memory trying to grow the queue, so it gets buried */
1195 reply(c
, MSG_BURIED
, MSG_BURIED_LEN
, STATE_SENDWORD
);
1199 id
= strtoull(c
->cmd
+ CMD_BURY_LEN
, &pri_buf
, 10);
1200 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1202 r
= read_pri(&pri
, pri_buf
, NULL
);
1203 if (r
) return reply_msg(c
, MSG_BAD_FORMAT
);
1206 j
= remove_reserved_job(c
, id
);
1208 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1212 reply(c
, MSG_BURIED
, MSG_BURIED_LEN
, STATE_SENDWORD
);
1216 count
= strtoul(c
->cmd
+ CMD_KICK_LEN
, &end_buf
, 10);
1217 if (end_buf
== c
->cmd
+ CMD_KICK_LEN
) {
1218 return reply_msg(c
, MSG_BAD_FORMAT
);
1220 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1224 i
= kick_jobs(c
->use
, count
);
1226 return reply_line(c
, STATE_SENDWORD
, "KICKED %u\r\n", i
);
1229 id
= strtoull(c
->cmd
+ CMD_TOUCH_LEN
, &end_buf
, 10);
1230 if (errno
) return twarn("strtoull"), reply_msg(c
, MSG_BAD_FORMAT
);
1234 j
= touch_job(c
, id
);
1237 reply(c
, MSG_TOUCHED
, MSG_TOUCHED_LEN
, STATE_SENDWORD
);
1239 return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1243 /* don't allow trailing garbage */
1244 if (c
->cmd_len
!= CMD_STATS_LEN
+ 2) {
1245 return reply_msg(c
, MSG_BAD_FORMAT
);
1250 do_stats(c
, fmt_stats
, NULL
);
1254 id
= strtoull(c
->cmd
+ CMD_JOBSTATS_LEN
, &end_buf
, 10);
1255 if (errno
) return reply_msg(c
, MSG_BAD_FORMAT
);
1260 if (!j
) return reply(c
, MSG_NOTFOUND
, MSG_NOTFOUND_LEN
, STATE_SENDWORD
);
1262 if (!j
->tube
) return reply_serr(c
, MSG_INTERNAL_ERROR
);
1263 do_stats(c
, (fmt_fn
) fmt_job_stats
, j
);
1266 name
= c
->cmd
+ CMD_STATS_TUBE_LEN
;
1267 if (!name_is_ok(name
, 200)) return reply_msg(c
, MSG_BAD_FORMAT
);
1271 t
= tube_find(name
);
1272 if (!t
) return reply_msg(c
, MSG_NOTFOUND
);
1274 do_stats(c
, (fmt_fn
) fmt_stats_tube
, t
);
1278 /* don't allow trailing garbage */
1279 if (c
->cmd_len
!= CMD_LIST_TUBES_LEN
+ 2) {
1280 return reply_msg(c
, MSG_BAD_FORMAT
);
1284 do_list_tubes(c
, &tubes
);
1286 case OP_LIST_TUBE_USED
:
1287 /* don't allow trailing garbage */
1288 if (c
->cmd_len
!= CMD_LIST_TUBE_USED_LEN
+ 2) {
1289 return reply_msg(c
, MSG_BAD_FORMAT
);
1293 reply_line(c
, STATE_SENDWORD
, "USING %s\r\n", c
->use
->name
);
1295 case OP_LIST_TUBES_WATCHED
:
1296 /* don't allow trailing garbage */
1297 if (c
->cmd_len
!= CMD_LIST_TUBES_WATCHED_LEN
+ 2) {
1298 return reply_msg(c
, MSG_BAD_FORMAT
);
1302 do_list_tubes(c
, &c
->watch
);
1305 name
= c
->cmd
+ CMD_USE_LEN
;
1306 if (!name_is_ok(name
, 200)) return reply_msg(c
, MSG_BAD_FORMAT
);
1309 TUBE_ASSIGN(t
, tube_find_or_make(name
));
1310 if (!t
) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
1313 TUBE_ASSIGN(c
->use
, t
);
1314 TUBE_ASSIGN(t
, NULL
);
1317 reply_line(c
, STATE_SENDWORD
, "USING %s\r\n", c
->use
->name
);
1320 name
= c
->cmd
+ CMD_WATCH_LEN
;
1321 if (!name_is_ok(name
, 200)) return reply_msg(c
, MSG_BAD_FORMAT
);
1324 TUBE_ASSIGN(t
, tube_find_or_make(name
));
1325 if (!t
) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
1328 if (!ms_contains(&c
->watch
, t
)) r
= ms_append(&c
->watch
, t
);
1329 TUBE_ASSIGN(t
, NULL
);
1330 if (!r
) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
1332 reply_line(c
, STATE_SENDWORD
, "WATCHING %d\r\n", c
->watch
.used
);
1335 name
= c
->cmd
+ CMD_IGNORE_LEN
;
1336 if (!name_is_ok(name
, 200)) return reply_msg(c
, MSG_BAD_FORMAT
);
1340 for (i
= 0; i
< c
->watch
.used
; i
++) {
1341 t
= c
->watch
.items
[i
];
1342 if (strncmp(t
->name
, name
, MAX_TUBE_NAME_LEN
) == 0) break;
1346 if (t
&& c
->watch
.used
< 2) return reply_msg(c
, MSG_NOT_IGNORED
);
1348 if (t
) ms_remove(&c
->watch
, t
); /* may free t if refcount => 0 */
1351 reply_line(c
, STATE_SENDWORD
, "WATCHING %d\r\n", c
->watch
.used
);
1354 return reply_msg(c
, MSG_UNKNOWN_COMMAND
);
1358 /* There are three reasons this function may be called. We need to check for
1361 * 1. A reserved job has run out of time.
1362 * 2. A waiting client's reserved job has entered the safety margin.
1363 * 3. A waiting client's requested timeout has occurred.
1365 * If any of these happen, we must do the appropriate thing. */
1367 h_conn_timeout(conn c
)
1369 int r
, should_timeout
= 0;
1372 /* Check if the client was trying to reserve a job. */
1373 if (conn_waiting(c
) && conn_has_close_deadline(c
)) should_timeout
= 1;
1375 /* Check if any reserved jobs have run out of time. We should do this
1376 * whether or not the client is waiting for a new reservation. */
1377 while ((j
= soonest_job(c
))) {
1378 if (j
->deadline
> time(NULL
)) break;
1379 timeout_ct
++; /* stats */
1381 r
= enqueue_job(remove_this_reserved_job(c
, j
), 0);
1382 if (!r
) bury_job(j
); /* there was no room in the queue, so bury it */
1383 r
= conn_update_evq(c
, c
->evq
.ev_events
);
1384 if (r
== -1) return twarnx("conn_update_evq() failed"), conn_close(c
);
1387 if (should_timeout
) {
1388 dprintf("conn_waiting(%p) = %d\n", c
, conn_waiting(c
));
1389 return reply_msg(remove_waiting_conn(c
), MSG_DEADLINE_SOON
);
1390 } else if (conn_waiting(c
) && c
->pending_timeout
>= 0) {
1391 dprintf("conn_waiting(%p) = %d\n", c
, conn_waiting(c
));
1392 c
->pending_timeout
= -1;
1393 return reply_msg(remove_waiting_conn(c
), MSG_TIMED_OUT
);
1398 enter_drain_mode(int sig
)
1415 r
= conn_update_evq(c
, EV_READ
| EV_PERSIST
);
1416 if (r
== -1) return twarnx("update events failed"), conn_close(c
);
1418 /* was this a peek or stats command? */
1419 if (!has_reserved_this_job(c
, c
->out_job
)) job_free(c
->out_job
);
1422 c
->reply_sent
= 0; /* now that we're done, reset this */
1423 c
->state
= STATE_WANTCOMMAND
;
1431 struct iovec iov
[2];
1434 case STATE_WANTCOMMAND
:
1435 r
= read(c
->fd
, c
->cmd
+ c
->cmd_read
, LINE_BUF_SIZE
- c
->cmd_read
);
1436 if (r
== -1) return check_err(c
, "read()");
1437 if (r
== 0) return conn_close(c
); /* the client hung up */
1439 c
->cmd_read
+= r
; /* we got some bytes */
1441 c
->cmd_len
= cmd_len(c
); /* find the EOL */
1443 /* yay, complete command line */
1444 if (c
->cmd_len
) return do_cmd(c
);
1446 /* c->cmd_read > LINE_BUF_SIZE can't happen */
1448 /* command line too long? */
1449 if (c
->cmd_read
== LINE_BUF_SIZE
) {
1450 c
->cmd_read
= 0; /* discard the input so far */
1451 return reply_msg(c
, MSG_BAD_FORMAT
);
1454 /* otherwise we have an incomplete line, so just keep waiting */
1456 case STATE_BITBUCKET
:
1457 /* Invert the meaning of in_job_read while throwing away data -- it
1458 * counts the bytes that remain to be thrown away. */
1459 to_read
= min(c
->in_job_read
, BUCKET_BUF_SIZE
);
1460 r
= read(c
->fd
, bucket
, to_read
);
1461 if (r
== -1) return check_err(c
, "read()");
1462 if (r
== 0) return conn_close(c
); /* the client hung up */
1464 c
->in_job_read
-= r
; /* we got some bytes */
1466 /* (c->in_job_read < 0) can't happen */
1468 if (c
->in_job_read
== 0) return reply_serr(c
, MSG_OUT_OF_MEMORY
);
1470 case STATE_WANTDATA
:
1473 r
= read(c
->fd
, j
->body
+ c
->in_job_read
, j
->body_size
-c
->in_job_read
);
1474 if (r
== -1) return check_err(c
, "read()");
1475 if (r
== 0) return conn_close(c
); /* the client hung up */
1477 c
->in_job_read
+= r
; /* we got some bytes */
1479 /* (j->in_job_read > j->body_size) can't happen */
1481 maybe_enqueue_incoming_job(c
);
1483 case STATE_SENDWORD
:
1484 r
= write(c
->fd
, c
->reply
+ c
->reply_sent
, c
->reply_len
- c
->reply_sent
);
1485 if (r
== -1) return check_err(c
, "write()");
1486 if (r
== 0) return conn_close(c
); /* the client hung up */
1488 c
->reply_sent
+= r
; /* we got some bytes */
1490 /* (c->reply_sent > c->reply_len) can't happen */
1492 if (c
->reply_sent
== c
->reply_len
) return reset_conn(c
);
1494 /* otherwise we sent an incomplete reply, so just keep waiting */
1499 iov
[0].iov_base
= (void *)(c
->reply
+ c
->reply_sent
);
1500 iov
[0].iov_len
= c
->reply_len
- c
->reply_sent
; /* maybe 0 */
1501 iov
[1].iov_base
= j
->body
+ c
->out_job_sent
;
1502 iov
[1].iov_len
= j
->body_size
- c
->out_job_sent
;
1504 r
= writev(c
->fd
, iov
, 2);
1505 if (r
== -1) return check_err(c
, "writev()");
1506 if (r
== 0) return conn_close(c
); /* the client hung up */
1508 /* update the sent values */
1510 if (c
->reply_sent
>= c
->reply_len
) {
1511 c
->out_job_sent
+= c
->reply_sent
- c
->reply_len
;
1512 c
->reply_sent
= c
->reply_len
;
1515 /* (c->out_job_sent > j->body_size) can't happen */
1518 if (c
->out_job_sent
== j
->body_size
) return reset_conn(c
);
1520 /* otherwise we sent incomplete data, so just keep waiting */
1522 case STATE_WAIT
: /* keep an eye out in case they hang up */
1523 /* but don't hang up just because our buffer is full */
1524 if (LINE_BUF_SIZE
- c
->cmd_read
< 1) break;
1526 r
= read(c
->fd
, c
->cmd
+ c
->cmd_read
, LINE_BUF_SIZE
- c
->cmd_read
);
1527 if (r
== -1) return check_err(c
, "read()");
1528 if (r
== 0) return conn_close(c
); /* the client hung up */
1529 c
->cmd_read
+= r
; /* we got some bytes */
1533 #define want_command(c) ((c)->fd && ((c)->state == STATE_WANTCOMMAND))
1534 #define cmd_data_ready(c) (want_command(c) && (c)->cmd_read)
1537 h_conn(const int fd
, const short which
, conn c
)
1540 twarnx("Argh! event fd doesn't match conn fd.");
1542 return conn_close(c
);
1548 event_add(&c
->evq
, NULL
); /* seems to be necessary */
1551 /* fall through... */
1553 /* fall through... */
1558 while (cmd_data_ready(c
) && (c
->cmd_len
= cmd_len(c
))) do_cmd(c
);
1569 while ((j
= delay_q_peek())) {
1570 if (j
->deadline
> t
) break;
1572 r
= enqueue_job(j
, 0);
1573 if (!r
) bury_job(j
); /* there was no room in the queue, so bury it */
1576 set_main_delay_timeout();
1580 h_accept(const int fd
, const short which
, struct event
*ev
)
1585 struct sockaddr addr
;
1587 if (which
== EV_TIMEOUT
) return h_delay();
1589 addrlen
= sizeof addr
;
1590 cfd
= accept(fd
, &addr
, &addrlen
);
1592 if (errno
!= EAGAIN
&& errno
!= EWOULDBLOCK
) twarn("accept()");
1593 if (errno
== EMFILE
) brake();
1597 flags
= fcntl(cfd
, F_GETFL
, 0);
1598 if (flags
< 0) return twarn("getting flags"), close(cfd
), v();
1600 r
= fcntl(cfd
, F_SETFL
, flags
| O_NONBLOCK
);
1601 if (r
< 0) return twarn("setting O_NONBLOCK"), close(cfd
), v();
1603 c
= make_conn(cfd
, STATE_WANTCOMMAND
, default_tube
, default_tube
);
1604 if (!c
) return twarnx("make_conn() failed"), close(cfd
), brake();
1606 dprintf("accepted conn, fd=%d\n", cfd
);
1607 r
= conn_set_evq(c
, EV_READ
| EV_PERSIST
, (evh
) h_conn
);
1608 if (r
== -1) return twarnx("conn_set_evq() failed"), close(cfd
), brake();
1614 start_time
= time(NULL
);
1615 memset(op_ct
, 0, sizeof(op_ct
));
1617 ms_init(&tubes
, NULL
, NULL
);
1619 TUBE_ASSIGN(default_tube
, tube_find_or_make("default"));
1620 if (!default_tube
) twarnx("Out of memory during startup!");
1624 prot_replay_binlog()
1626 struct job binlog_jobs
;
1630 binlog_jobs
.prev
= binlog_jobs
.next
= &binlog_jobs
;
1631 binlog_read(&binlog_jobs
);
1633 for (j
= binlog_jobs
.next
; j
!= &binlog_jobs
; j
= nj
) {
1638 case JOB_STATE_BURIED
:
1641 case JOB_STATE_DELAYED
:
1642 if (start_time
< j
->deadline
) delay
= j
->deadline
- start_time
;
1645 enqueue_job(j
,delay
);