Commit | Line | Data |
---|---|---|
059ec3d9 PH |
1 | /************************************************* |
2 | * Exim - an Internet mail transport agent * | |
3 | *************************************************/ | |
4 | ||
f9ba5e22 | 5 | /* Copyright (c) University of Cambridge 1995 - 2018 */ |
059ec3d9 PH |
6 | /* See the file NOTICE for conditions of use and distribution. */ |
7 | ||
8 | /* Functions that operate on the input queue. */ | |
9 | ||
10 | ||
11 | #include "exim.h" | |
12 | ||
13 | ||
14 | ||
41313d92 JH |
15 | |
16 | ||
17 | ||
18 | ||
19 | #ifndef COMPILE_UTILITY | |
0971ec06 JH |
20 | |
21 | /* The number of nodes to use for the bottom-up merge sort when a list of queue | |
22 | items is to be ordered. The code for this sort was contributed as a patch by | |
23 | Michael Haardt. */ | |
24 | ||
25 | #define LOG2_MAXNODES 32 | |
26 | ||
27 | ||
28 | ||
059ec3d9 PH |
29 | /************************************************* |
30 | * Helper sort function for queue_get_spool_list * | |
31 | *************************************************/ | |
32 | ||
33 | /* This function is used when sorting the queue list in the function | |
34 | queue_get_spool_list() below. | |
35 | ||
36 | Arguments: | |
37 | a points to an ordered list of queue_filename items | |
38 | b points to another ordered list | |
39 | ||
40 | Returns: a pointer to a merged ordered list | |
41 | */ | |
42 | ||
43 | static queue_filename * | |
44 | merge_queue_lists(queue_filename *a, queue_filename *b) | |
45 | { | |
46 | queue_filename *first = NULL; | |
47 | queue_filename **append = &first; | |
48 | ||
40c90bca | 49 | while (a && b) |
2540f2f8 JH |
50 | { |
51 | int d; | |
52 | if ((d = Ustrncmp(a->text, b->text, 6)) == 0) | |
53 | d = Ustrcmp(a->text + 14, b->text + 14); | |
54 | if (d < 0) | |
059ec3d9 PH |
55 | { |
56 | *append = a; | |
57 | append= &a->next; | |
58 | a = a->next; | |
59 | } | |
60 | else | |
61 | { | |
62 | *append = b; | |
63 | append= &b->next; | |
64 | b = b->next; | |
65 | } | |
2540f2f8 | 66 | } |
059ec3d9 | 67 | |
40c90bca | 68 | *append = a ? a : b; |
059ec3d9 PH |
69 | return first; |
70 | } | |
71 | ||
72 | ||
73 | ||
74 | ||
75 | ||
76 | /************************************************* | |
77 | * Get list of spool files * | |
78 | *************************************************/ | |
79 | ||
80 | /* Scan the spool directory and return a list of the relevant file names | |
81 | therein. Single-character sub-directories are handled as follows: | |
82 | ||
83 | If the first argument is > 0, a sub-directory is scanned; the letter is | |
84 | taken from the nth entry in subdirs. | |
85 | ||
86 | If the first argument is 0, sub-directories are not scanned. However, a | |
87 | list of them is returned. | |
88 | ||
89 | If the first argument is < 0, sub-directories are scanned for messages, | |
90 | and a single, unified list is created. The returned data blocks contain the | |
91 | identifying character of the subdirectory, if any. The subdirs vector is | |
92 | still required as an argument. | |
93 | ||
94 | If the randomize argument is TRUE, messages are returned in "randomized" order. | |
95 | Actually, the order is anything but random, but the algorithm is cheap, and the | |
96 | point is simply to ensure that the same order doesn't occur every time, in case | |
97 | a particular message is causing a remote MTA to barf - we would like to try | |
98 | other messages to that MTA first. | |
99 | ||
100 | If the randomize argument is FALSE, sort the list according to the file name. | |
101 | This should give the order in which the messages arrived. It is normally used | |
102 | only for presentation to humans, in which case the (possibly expensive) sort | |
103 | that it does is not part of the normal operational code. However, if | |
104 | queue_run_in_order is set, sorting has to take place for queue runs as well. | |
105 | When randomize is FALSE, the first argument is normally -1, so all messages are | |
106 | included. | |
107 | ||
108 | Arguments: | |
109 | subdiroffset sub-directory character offset, or 0 or -1 (see above) | |
110 | subdirs vector to store list of subdirchars | |
111 | subcount pointer to int in which to store count of subdirs | |
112 | randomize TRUE if the order of the list is to be unpredictable | |
113 | ||
114 | Returns: pointer to a chain of queue name items | |
115 | */ | |
116 | ||
117 | static queue_filename * | |
118 | queue_get_spool_list(int subdiroffset, uschar *subdirs, int *subcount, | |
119 | BOOL randomize) | |
120 | { | |
121 | int i; | |
122 | int flags = 0; | |
123 | int resetflags = -1; | |
124 | int subptr; | |
125 | queue_filename *yield = NULL; | |
126 | queue_filename *last = NULL; | |
127 | struct dirent *ent; | |
128 | DIR *dd; | |
129 | uschar buffer[256]; | |
130 | queue_filename *root[LOG2_MAXNODES]; | |
131 | ||
132 | /* When randomizing, the file names are added to the start or end of the list | |
133 | according to the bits of the flags variable. Get a collection of bits from the | |
134 | current time. Use the bottom 16 and just keep re-using them if necessary. When | |
135 | not randomizing, initialize the sublists for the bottom-up merge sort. */ | |
136 | ||
40c90bca JH |
137 | if (randomize) |
138 | resetflags = time(NULL) & 0xFFFF; | |
139 | else | |
140 | for (i = 0; i < LOG2_MAXNODES; i++) | |
141 | root[i] = NULL; | |
059ec3d9 PH |
142 | |
143 | /* If processing the full queue, or just the top-level, start at the base | |
144 | directory, and initialize the first subdirectory name (as none). Otherwise, | |
145 | start at the sub-directory offset. */ | |
146 | ||
147 | if (subdiroffset <= 0) | |
148 | { | |
149 | i = 0; | |
150 | subdirs[0] = 0; | |
151 | *subcount = 0; | |
152 | } | |
40c90bca JH |
153 | else |
154 | i = subdiroffset; | |
059ec3d9 PH |
155 | |
156 | /* Set up prototype for the directory name. */ | |
157 | ||
41313d92 | 158 | spool_pname_buf(buffer, sizeof(buffer)); |
a2da3176 | 159 | buffer[sizeof(buffer) - 3] = 0; |
059ec3d9 PH |
160 | subptr = Ustrlen(buffer); |
161 | buffer[subptr+2] = 0; /* terminator for lengthened name */ | |
162 | ||
163 | /* This loop runs at least once, for the main or given directory, and then as | |
164 | many times as necessary to scan any subdirectories encountered in the main | |
165 | directory, if they are to be scanned at this time. */ | |
166 | ||
167 | for (; i <= *subcount; i++) | |
168 | { | |
169 | int count = 0; | |
170 | int subdirchar = subdirs[i]; /* 0 for main directory */ | |
171 | ||
172 | if (subdirchar != 0) | |
173 | { | |
174 | buffer[subptr] = '/'; | |
175 | buffer[subptr+1] = subdirchar; | |
176 | } | |
177 | ||
41313d92 | 178 | DEBUG(D_queue_run) debug_printf("looking in %s\n", buffer); |
a2da3176 JH |
179 | if (!(dd = opendir(CS buffer))) |
180 | continue; | |
059ec3d9 PH |
181 | |
182 | /* Now scan the directory. */ | |
183 | ||
40c90bca | 184 | while ((ent = readdir(dd))) |
059ec3d9 PH |
185 | { |
186 | uschar *name = US ent->d_name; | |
187 | int len = Ustrlen(name); | |
188 | ||
189 | /* Count entries */ | |
190 | ||
191 | count++; | |
192 | ||
193 | /* If we find a single alphameric sub-directory in the base directory, | |
194 | add it to the list for subsequent scans. */ | |
195 | ||
196 | if (i == 0 && len == 1 && isalnum(*name)) | |
197 | { | |
198 | *subcount = *subcount + 1; | |
199 | subdirs[*subcount] = *name; | |
200 | continue; | |
201 | } | |
202 | ||
203 | /* Otherwise, if it is a header spool file, add it to the list */ | |
204 | ||
205 | if (len == SPOOL_NAME_LENGTH && | |
206 | Ustrcmp(name + SPOOL_NAME_LENGTH - 2, "-H") == 0) | |
207 | { | |
208 | queue_filename *next = | |
f3ebb786 | 209 | store_get(sizeof(queue_filename) + Ustrlen(name), is_tainted(name)); |
059ec3d9 PH |
210 | Ustrcpy(next->text, name); |
211 | next->dir_uschar = subdirchar; | |
212 | ||
213 | /* Handle the creation of a randomized list. The first item becomes both | |
214 | the top and bottom of the list. Subsequent items are inserted either at | |
215 | the top or the bottom, randomly. This is, I argue, faster than doing a | |
216 | sort by allocating a random number to each item, and it also saves having | |
217 | to store the number with each item. */ | |
218 | ||
219 | if (randomize) | |
40c90bca | 220 | if (!yield) |
059ec3d9 PH |
221 | { |
222 | next->next = NULL; | |
223 | yield = last = next; | |
224 | } | |
225 | else | |
226 | { | |
40c90bca JH |
227 | if (flags == 0) |
228 | flags = resetflags; | |
059ec3d9 PH |
229 | if ((flags & 1) == 0) |
230 | { | |
231 | next->next = yield; | |
232 | yield = next; | |
233 | } | |
234 | else | |
235 | { | |
236 | next->next = NULL; | |
237 | last->next = next; | |
238 | last = next; | |
239 | } | |
240 | flags = flags >> 1; | |
241 | } | |
059ec3d9 PH |
242 | |
243 | /* Otherwise do a bottom-up merge sort based on the name. */ | |
244 | ||
245 | else | |
246 | { | |
059ec3d9 | 247 | next->next = NULL; |
d7978c0f | 248 | for (int j = 0; j < LOG2_MAXNODES; j++) |
40c90bca | 249 | if (root[j]) |
059ec3d9 PH |
250 | { |
251 | next = merge_queue_lists(next, root[j]); | |
2540f2f8 | 252 | root[j] = j == LOG2_MAXNODES - 1 ? next : NULL; |
059ec3d9 PH |
253 | } |
254 | else | |
255 | { | |
256 | root[j] = next; | |
257 | break; | |
258 | } | |
059ec3d9 PH |
259 | } |
260 | } | |
261 | } | |
262 | ||
263 | /* Finished with this directory */ | |
264 | ||
265 | closedir(dd); | |
266 | ||
267 | /* If we have just scanned a sub-directory, and it was empty (count == 2 | |
268 | implies just "." and ".." entries), and Exim is no longer configured to | |
269 | use sub-directories, attempt to get rid of it. At the same time, try to | |
270 | get rid of any corresponding msglog subdirectory. These are just cosmetic | |
271 | tidying actions, so just ignore failures. If we are scanning just a single | |
272 | sub-directory, break the loop. */ | |
273 | ||
274 | if (i != 0) | |
275 | { | |
276 | if (!split_spool_directory && count <= 2) | |
277 | { | |
41313d92 JH |
278 | uschar subdir[2]; |
279 | ||
059ec3d9 | 280 | rmdir(CS buffer); |
41313d92 JH |
281 | subdir[0] = subdirchar; subdir[1] = 0; |
282 | rmdir(CS spool_dname(US"msglog", subdir)); | |
059ec3d9 PH |
283 | } |
284 | if (subdiroffset > 0) break; /* Single sub-directory */ | |
285 | } | |
286 | ||
287 | /* If we have just scanned the base directory, and subdiroffset is 0, | |
288 | we do not want to continue scanning the sub-directories. */ | |
289 | ||
40c90bca JH |
290 | else if (subdiroffset == 0) |
291 | break; | |
059ec3d9 PH |
292 | } /* Loop for multiple subdirectories */ |
293 | ||
294 | /* When using a bottom-up merge sort, do the final merging of the sublists. | |
295 | Then pass back the final list of file items. */ | |
296 | ||
297 | if (!randomize) | |
298 | for (i = 0; i < LOG2_MAXNODES; ++i) | |
299 | yield = merge_queue_lists(yield, root[i]); | |
300 | ||
301 | return yield; | |
302 | } | |
303 | ||
304 | ||
305 | ||
306 | ||
307 | /************************************************* | |
308 | * Perform a queue run * | |
309 | *************************************************/ | |
310 | ||
311 | /* The arguments give the messages to start and stop at; NULL means start at | |
312 | the beginning or stop at the end. If the given start message doesn't exist, we | |
313 | start at the next lexically greater one, and likewise we stop at the after the | |
314 | previous lexically lesser one if the given stop message doesn't exist. Because | |
315 | a queue run can take some time, stat each file before forking, in case it has | |
316 | been delivered in the meantime by some other means. | |
317 | ||
318 | The global variables queue_run_force and queue_run_local may be set to cause | |
319 | forced deliveries or local-only deliveries, respectively. | |
320 | ||
321 | If deliver_selectstring[_sender] is not NULL, skip messages whose recipients do | |
322 | not contain the string. As this option is typically used when a machine comes | |
323 | back online, we want to ensure that at least one delivery attempt takes place, | |
324 | so force the first one. The selecting string can optionally be a regex, or | |
325 | refer to the sender instead of recipients. | |
326 | ||
327 | If queue_2stage is set, the queue is scanned twice. The first time, queue_smtp | |
328 | is set so that routing is done for all messages. Thus in the second run those | |
329 | that are routed to the same host should go down the same SMTP connection. | |
330 | ||
331 | Arguments: | |
332 | start_id message id to start at, or NULL for all | |
333 | stop_id message id to end at, or NULL for all | |
334 | recurse TRUE if recursing for 2-stage run | |
335 | ||
336 | Returns: nothing | |
337 | */ | |
338 | ||
339 | void | |
340 | queue_run(uschar *start_id, uschar *stop_id, BOOL recurse) | |
341 | { | |
8768d548 | 342 | BOOL force_delivery = f.queue_run_force || deliver_selectstring != NULL || |
059ec3d9 PH |
343 | deliver_selectstring_sender != NULL; |
344 | const pcre *selectstring_regex = NULL; | |
345 | const pcre *selectstring_regex_sender = NULL; | |
346 | uschar *log_detail = NULL; | |
347 | int subcount = 0; | |
059ec3d9 | 348 | uschar subdirs[64]; |
4c2efd7a | 349 | pid_t qpid[4] = {0}; /* Parallelism factor for q2stage 1st phase */ |
059ec3d9 | 350 | |
9f01e50d JH |
351 | #ifdef MEASURE_TIMING |
352 | report_time_since(×tamp_startup, US"queue_run start"); | |
353 | #endif | |
354 | ||
059ec3d9 PH |
355 | /* Cancel any specific queue domains. Turn off the flag that causes SMTP |
356 | deliveries not to happen, unless doing a 2-stage queue run, when the SMTP flag | |
357 | gets set. Save the queue_runner's pid and the flag that indicates any | |
358 | deliveries run directly from this process. Deliveries that are run by handing | |
359 | on TCP/IP channels have queue_run_pid set, but not queue_running. */ | |
360 | ||
361 | queue_domains = NULL; | |
362 | queue_smtp_domains = NULL; | |
8768d548 | 363 | f.queue_smtp = f.queue_2stage; |
059ec3d9 PH |
364 | |
365 | queue_run_pid = getpid(); | |
8768d548 | 366 | f.queue_running = TRUE; |
059ec3d9 PH |
367 | |
368 | /* Log the true start of a queue run, and fancy options */ | |
369 | ||
370 | if (!recurse) | |
371 | { | |
372 | uschar extras[8]; | |
373 | uschar *p = extras; | |
374 | ||
8768d548 JH |
375 | if (f.queue_2stage) *p++ = 'q'; |
376 | if (f.queue_run_first_delivery) *p++ = 'i'; | |
377 | if (f.queue_run_force) *p++ = 'f'; | |
378 | if (f.deliver_force_thaw) *p++ = 'f'; | |
379 | if (f.queue_run_local) *p++ = 'l'; | |
059ec3d9 PH |
380 | *p = 0; |
381 | ||
382 | p = big_buffer; | |
5976eb99 | 383 | p += sprintf(CS p, "pid=%d", (int)queue_run_pid); |
059ec3d9 PH |
384 | |
385 | if (extras[0] != 0) | |
5976eb99 | 386 | p += sprintf(CS p, " -q%s", extras); |
059ec3d9 | 387 | |
5976eb99 | 388 | if (deliver_selectstring) |
8768d548 | 389 | p += sprintf(CS p, " -R%s %s", f.deliver_selectstring_regex? "r" : "", |
059ec3d9 | 390 | deliver_selectstring); |
059ec3d9 | 391 | |
5976eb99 | 392 | if (deliver_selectstring_sender) |
8768d548 | 393 | p += sprintf(CS p, " -S%s %s", f.deliver_selectstring_sender_regex? "r" : "", |
059ec3d9 | 394 | deliver_selectstring_sender); |
059ec3d9 PH |
395 | |
396 | log_detail = string_copy(big_buffer); | |
6073ad45 JH |
397 | if (*queue_name) |
398 | log_write(L_queue_run, LOG_MAIN, "Start '%s' queue run: %s", | |
399 | queue_name, log_detail); | |
400 | else | |
401 | log_write(L_queue_run, LOG_MAIN, "Start queue run: %s", log_detail); | |
059ec3d9 PH |
402 | } |
403 | ||
404 | /* If deliver_selectstring is a regex, compile it. */ | |
405 | ||
8768d548 | 406 | if (deliver_selectstring && f.deliver_selectstring_regex) |
059ec3d9 PH |
407 | selectstring_regex = regex_must_compile(deliver_selectstring, TRUE, FALSE); |
408 | ||
8768d548 | 409 | if (deliver_selectstring_sender && f.deliver_selectstring_sender_regex) |
059ec3d9 PH |
410 | selectstring_regex_sender = |
411 | regex_must_compile(deliver_selectstring_sender, TRUE, FALSE); | |
412 | ||
413 | /* If the spool is split into subdirectories, we want to process it one | |
414 | directory at a time, so as to spread out the directory scanning and the | |
415 | delivering when there are lots of messages involved, except when | |
416 | queue_run_in_order is set. | |
417 | ||
418 | In the random order case, this loop runs once for the main directory (handling | |
419 | any messages therein), and then repeats for any subdirectories that were found. | |
420 | When the first argument of queue_get_spool_list() is 0, it scans the top | |
421 | directory, fills in subdirs, and sets subcount. The order of the directories is | |
422 | then randomized after the first time through, before they are scanned in | |
4c04137d | 423 | subsequent iterations. |
059ec3d9 PH |
424 | |
425 | When the first argument of queue_get_spool_list() is -1 (for queue_run_in_ | |
426 | order), it scans all directories and makes a single message list. */ | |
427 | ||
d7978c0f | 428 | for (int i = queue_run_in_order ? -1 : 0; |
2540f2f8 | 429 | i <= (queue_run_in_order ? -1 : subcount); |
059ec3d9 PH |
430 | i++) |
431 | { | |
f3ebb786 | 432 | rmark reset_point1 = store_mark(); |
059ec3d9 PH |
433 | |
434 | DEBUG(D_queue_run) | |
435 | { | |
436 | if (i == 0) | |
437 | debug_printf("queue running main directory\n"); | |
438 | else if (i == -1) | |
439 | debug_printf("queue running combined directories\n"); | |
440 | else | |
441 | debug_printf("queue running subdirectory '%c'\n", subdirs[i]); | |
442 | } | |
443 | ||
d7978c0f JH |
444 | for (queue_filename * fq = queue_get_spool_list(i, subdirs, &subcount, |
445 | !queue_run_in_order); | |
446 | fq; fq = fq->next) | |
059ec3d9 PH |
447 | { |
448 | pid_t pid; | |
449 | int status; | |
450 | int pfd[2]; | |
451 | struct stat statbuf; | |
452 | uschar buffer[256]; | |
453 | ||
454 | /* Unless deliveries are forced, if deliver_queue_load_max is non-negative, | |
455 | check that the load average is low enough to permit deliveries. */ | |
456 | ||
8768d548 | 457 | if (!f.queue_run_force && deliver_queue_load_max >= 0) |
40c90bca | 458 | if ((load_average = os_getloadavg()) > deliver_queue_load_max) |
059ec3d9 | 459 | { |
3eef829e PH |
460 | log_write(L_queue_run, LOG_MAIN, "Abandon queue run: %s (load %.2f, max %.2f)", |
461 | log_detail, | |
059ec3d9 PH |
462 | (double)load_average/1000.0, |
463 | (double)deliver_queue_load_max/1000.0); | |
464 | i = subcount; /* Don't process other directories */ | |
465 | break; | |
466 | } | |
467 | else | |
059ec3d9 PH |
468 | DEBUG(D_load) debug_printf("load average = %.2f max = %.2f\n", |
469 | (double)load_average/1000.0, | |
470 | (double)deliver_queue_load_max/1000.0); | |
059ec3d9 | 471 | |
92562f63 JH |
472 | /* If initial of a 2-phase run, maintain a set of child procs |
473 | to get disk parallelism */ | |
474 | ||
475 | if (f.queue_2stage && !queue_run_in_order) | |
476 | { | |
477 | int i; | |
478 | if (qpid[nelem(qpid) - 1]) | |
479 | { | |
480 | DEBUG(D_queue_run) debug_printf("q2stage waiting for child\n"); | |
481 | waitpid(qpid[0], NULL, 0); | |
482 | DEBUG(D_queue_run) debug_printf("q2stage reaped child %d\n", (int)qpid[0]); | |
483 | for (i = 0; i < nelem(qpid) - 1; i++) qpid[i] = qpid[i+1]; | |
484 | qpid[i] = 0; | |
485 | } | |
486 | else | |
487 | for (i = 0; qpid[i]; ) i++; | |
488 | DEBUG(D_queue_run) debug_printf("q2stage forking\n"); | |
489 | if ((qpid[i] = fork())) | |
490 | continue; /* parent loops around */ | |
491 | DEBUG(D_queue_run) debug_printf("q2stage child\n"); | |
492 | } | |
493 | ||
059ec3d9 PH |
494 | /* Skip this message unless it's within the ID limits */ |
495 | ||
8768d548 | 496 | if (stop_id && Ustrncmp(fq->text, stop_id, MESSAGE_ID_LENGTH) > 0) |
92562f63 | 497 | goto go_around; |
8768d548 | 498 | if (start_id && Ustrncmp(fq->text, start_id, MESSAGE_ID_LENGTH) < 0) |
92562f63 | 499 | goto go_around; |
059ec3d9 PH |
500 | |
501 | /* Check that the message still exists */ | |
502 | ||
8768d548 JH |
503 | message_subdir[0] = fq->dir_uschar; |
504 | if (Ustat(spool_fname(US"input", message_subdir, fq->text, US""), &statbuf) < 0) | |
92562f63 | 505 | goto go_around; |
059ec3d9 PH |
506 | |
507 | /* There are some tests that require the reading of the header file. Ensure | |
508 | the store used is scavenged afterwards so that this process doesn't keep | |
509 | growing its store. We have to read the header file again when actually | |
510 | delivering, but it's cheaper than forking a delivery process for each | |
511 | message when many are not going to be delivered. */ | |
512 | ||
40c90bca | 513 | if (deliver_selectstring || deliver_selectstring_sender || |
8768d548 | 514 | f.queue_run_first_delivery) |
059ec3d9 PH |
515 | { |
516 | BOOL wanted = TRUE; | |
8768d548 | 517 | BOOL orig_dont_deliver = f.dont_deliver; |
f3ebb786 | 518 | rmark reset_point2 = store_mark(); |
059ec3d9 PH |
519 | |
520 | /* Restore the original setting of dont_deliver after reading the header, | |
521 | so that a setting for a particular message doesn't force it for any that | |
522 | follow. If the message is chosen for delivery, the header is read again | |
523 | in the deliver_message() function, in a subprocess. */ | |
524 | ||
92562f63 | 525 | if (spool_read_header(fq->text, FALSE, TRUE) != spool_read_OK) goto go_around; |
8768d548 | 526 | f.dont_deliver = orig_dont_deliver; |
059ec3d9 PH |
527 | |
528 | /* Now decide if we want to deliver this message. As we have read the | |
529 | header file, we might as well do the freeze test now, and save forking | |
530 | another process. */ | |
531 | ||
8768d548 | 532 | if (f.deliver_freeze && !f.deliver_force_thaw) |
059ec3d9 PH |
533 | { |
534 | log_write(L_skip_delivery, LOG_MAIN, "Message is frozen"); | |
535 | wanted = FALSE; | |
536 | } | |
537 | ||
538 | /* Check first_delivery in the case when there are no message logs. */ | |
539 | ||
8768d548 | 540 | else if (f.queue_run_first_delivery && !f.deliver_firsttime) |
059ec3d9 | 541 | { |
8768d548 | 542 | DEBUG(D_queue_run) debug_printf("%s: not first delivery\n", fq->text); |
059ec3d9 PH |
543 | wanted = FALSE; |
544 | } | |
545 | ||
40c90bca | 546 | /* Check for a matching address if deliver_selectstring[_sender] is set. |
059ec3d9 PH |
547 | If so, we do a fully delivery - don't want to omit other addresses since |
548 | their routing might trigger re-writing etc. */ | |
549 | ||
550 | /* Sender matching */ | |
551 | ||
40c90bca | 552 | else if ( deliver_selectstring_sender |
8768d548 | 553 | && !(f.deliver_selectstring_sender_regex |
40c90bca JH |
554 | ? (pcre_exec(selectstring_regex_sender, NULL, |
555 | CS sender_address, Ustrlen(sender_address), 0, PCRE_EOPT, | |
556 | NULL, 0) >= 0) | |
557 | : (strstric(sender_address, deliver_selectstring_sender, FALSE) | |
558 | != NULL) | |
559 | ) ) | |
059ec3d9 PH |
560 | { |
561 | DEBUG(D_queue_run) debug_printf("%s: sender address did not match %s\n", | |
8768d548 | 562 | fq->text, deliver_selectstring_sender); |
059ec3d9 PH |
563 | wanted = FALSE; |
564 | } | |
565 | ||
566 | /* Recipient matching */ | |
567 | ||
40c90bca | 568 | else if (deliver_selectstring) |
059ec3d9 PH |
569 | { |
570 | int i; | |
571 | for (i = 0; i < recipients_count; i++) | |
572 | { | |
573 | uschar *address = recipients_list[i].address; | |
8768d548 | 574 | if ( (f.deliver_selectstring_regex |
40c90bca JH |
575 | ? (pcre_exec(selectstring_regex, NULL, CS address, |
576 | Ustrlen(address), 0, PCRE_EOPT, NULL, 0) >= 0) | |
577 | : (strstric(address, deliver_selectstring, FALSE) != NULL) | |
578 | ) | |
579 | && tree_search(tree_nonrecipients, address) == NULL | |
580 | ) | |
059ec3d9 PH |
581 | break; |
582 | } | |
583 | ||
584 | if (i >= recipients_count) | |
585 | { | |
586 | DEBUG(D_queue_run) | |
587 | debug_printf("%s: no recipient address matched %s\n", | |
8768d548 | 588 | fq->text, deliver_selectstring); |
059ec3d9 PH |
589 | wanted = FALSE; |
590 | } | |
591 | } | |
592 | ||
593 | /* Recover store used when reading the header */ | |
594 | ||
4b4856ff | 595 | spool_clear_header_globals(); |
059ec3d9 | 596 | store_reset(reset_point2); |
92562f63 | 597 | if (!wanted) goto go_around; /* With next message */ |
059ec3d9 PH |
598 | } |
599 | ||
600 | /* OK, got a message we want to deliver. Create a pipe which will | |
601 | serve as a means of detecting when all the processes created by the | |
602 | delivery process are finished. This is relevant when the delivery | |
603 | process passes one or more SMTP channels on to its own children. The | |
604 | pipe gets passed down; by reading on it here we detect when the last | |
605 | descendent dies by the unblocking of the read. It's a pity that for | |
606 | most of the time the pipe isn't used, but creating a pipe should be | |
607 | pretty cheap. */ | |
608 | ||
609 | if (pipe(pfd) < 0) | |
059ec3d9 PH |
610 | log_write(0, LOG_MAIN|LOG_PANIC_DIE, "failed to create pipe in queue " |
611 | "runner process %d: %s", queue_run_pid, strerror(errno)); | |
059ec3d9 PH |
612 | queue_run_pipe = pfd[pipe_write]; /* To ensure it gets passed on. */ |
613 | ||
614 | /* Make sure it isn't stdin. This seems unlikely, but just to be on the | |
615 | safe side... */ | |
616 | ||
617 | if (queue_run_pipe == 0) | |
618 | { | |
619 | queue_run_pipe = dup(queue_run_pipe); | |
f1e894f3 | 620 | (void)close(0); |
059ec3d9 PH |
621 | } |
622 | ||
623 | /* Before forking to deliver the message, ensure any open and cached | |
624 | lookup files or databases are closed. Otherwise, closing in the subprocess | |
625 | can make the next subprocess have problems. There won't often be anything | |
626 | open here, but it is possible (e.g. if spool_directory is an expanded | |
627 | string). A single call before this loop would probably suffice, but just in | |
628 | case expansions get inserted at some point, I've taken the heavy-handed | |
629 | approach. When nothing is open, the call should be cheap. */ | |
630 | ||
631 | search_tidyup(); | |
632 | ||
633 | /* Now deliver the message; get the id by cutting the -H off the file | |
634 | name. The return of the process is zero if a delivery was attempted. */ | |
635 | ||
8768d548 JH |
636 | set_process_info("running queue: %s", fq->text); |
637 | fq->text[SPOOL_NAME_LENGTH-2] = 0; | |
9f01e50d JH |
638 | #ifdef MEASURE_TIMING |
639 | report_time_since(×tamp_startup, US"queue msg selected"); | |
640 | #endif | |
641 | ||
059ec3d9 PH |
642 | if ((pid = fork()) == 0) |
643 | { | |
644 | int rc; | |
9f01e50d | 645 | testharness_pause_ms(100); |
059ec3d9 | 646 | (void)close(pfd[pipe_read]); |
8768d548 | 647 | rc = deliver_message(fq->text, force_delivery, FALSE); |
f3ebb786 | 648 | exim_underbar_exit(rc == DELIVER_NOT_ATTEMPTED); |
059ec3d9 PH |
649 | } |
650 | if (pid < 0) | |
651 | log_write(0, LOG_MAIN|LOG_PANIC_DIE, "fork of delivery process from " | |
652 | "queue runner %d failed\n", queue_run_pid); | |
653 | ||
654 | /* Close the writing end of the synchronizing pipe in this process, | |
655 | then wait for the first level process to terminate. */ | |
656 | ||
f1e894f3 | 657 | (void)close(pfd[pipe_write]); |
8768d548 | 658 | set_process_info("running queue: waiting for %s (%d)", fq->text, pid); |
059ec3d9 PH |
659 | while (wait(&status) != pid); |
660 | ||
661 | /* A zero return means a delivery was attempted; turn off the force flag | |
662 | for any subsequent calls unless queue_force is set. */ | |
663 | ||
aa81ee14 | 664 | if (!(status & 0xffff)) force_delivery = f.queue_run_force; |
059ec3d9 PH |
665 | |
666 | /* If the process crashed, tell somebody */ | |
667 | ||
aa81ee14 | 668 | else if (status & 0x00ff) |
059ec3d9 PH |
669 | log_write(0, LOG_MAIN|LOG_PANIC, |
670 | "queue run: process %d crashed with signal %d while delivering %s", | |
8768d548 | 671 | (int)pid, status & 0x00ff, fq->text); |
059ec3d9 PH |
672 | |
673 | /* Before continuing, wait till the pipe gets closed at the far end. This | |
674 | tells us that any children created by the delivery to re-use any SMTP | |
675 | channels have all finished. Since no process actually writes to the pipe, | |
676 | the mere fact that read() unblocks is enough. */ | |
677 | ||
678 | set_process_info("running queue: waiting for children of %d", pid); | |
847a015a JH |
679 | if ((status = read(pfd[pipe_read], buffer, sizeof(buffer))) != 0) |
680 | log_write(0, LOG_MAIN|LOG_PANIC, status > 0 ? | |
681 | "queue run: unexpected data on pipe" : "queue run: error on pipe: %s", | |
aa81ee14 | 682 | strerror(errno)); |
059ec3d9 PH |
683 | (void)close(pfd[pipe_read]); |
684 | set_process_info("running queue"); | |
685 | ||
92562f63 JH |
686 | /* If initial of a 2-phase run, we are a child - so just exit */ |
687 | if (f.queue_2stage && !queue_run_in_order) | |
688 | exim_exit(EXIT_SUCCESS, US"2-phase child"); | |
689 | ||
059ec3d9 PH |
690 | /* If we are in the test harness, and this is not the first of a 2-stage |
691 | queue run, update fudged queue times. */ | |
692 | ||
8768d548 | 693 | if (f.running_in_test_harness && !f.queue_2stage) |
059ec3d9 | 694 | { |
44416341 JH |
695 | uschar * fqtnext = Ustrchr(fudged_queue_times, '/'); |
696 | if (fqtnext) fudged_queue_times = fqtnext + 1; | |
059ec3d9 | 697 | } |
92562f63 JH |
698 | |
699 | ||
700 | continue; | |
701 | ||
702 | go_around: | |
703 | /* If initial of a 2-phase run, we are a child - so just exit */ | |
704 | if (f.queue_2stage && !queue_run_in_order) | |
705 | exim_exit(EXIT_SUCCESS, US"2-phase child"); | |
059ec3d9 PH |
706 | } /* End loop for list of messages */ |
707 | ||
ce93c6d8 | 708 | tree_nonrecipients = NULL; |
059ec3d9 PH |
709 | store_reset(reset_point1); /* Scavenge list of messages */ |
710 | ||
711 | /* If this was the first time through for random order processing, and | |
712 | sub-directories have been found, randomize their order if necessary. */ | |
713 | ||
714 | if (i == 0 && subcount > 1 && !queue_run_in_order) | |
d7978c0f JH |
715 | for (int j = 1; j <= subcount; j++) |
716 | { | |
717 | int r; | |
f267271d | 718 | if ((r = random_number(100)) >= 50) |
059ec3d9 PH |
719 | { |
720 | int k = (r % subcount) + 1; | |
721 | int x = subdirs[j]; | |
722 | subdirs[j] = subdirs[k]; | |
723 | subdirs[k] = x; | |
724 | } | |
d7978c0f | 725 | } |
059ec3d9 PH |
726 | } /* End loop for multiple directories */ |
727 | ||
728 | /* If queue_2stage is true, we do it all again, with the 2stage flag | |
729 | turned off. */ | |
730 | ||
8768d548 | 731 | if (f.queue_2stage) |
059ec3d9 | 732 | { |
92562f63 JH |
733 | |
734 | /* wait for last children */ | |
735 | for (int i = 0; i < nelem(qpid); i++) | |
736 | if (qpid[i]) | |
737 | { | |
738 | DEBUG(D_queue_run) debug_printf("q2stage reaped child %d\n", (int)qpid[i]); | |
739 | waitpid(qpid[i], NULL, 0); | |
740 | } | |
741 | else break; | |
742 | ||
743 | #ifdef MEASURE_TIMING | |
744 | report_time_since(×tamp_startup, US"queue_run 1st phase done"); | |
745 | #endif | |
8768d548 | 746 | f.queue_2stage = FALSE; |
059ec3d9 PH |
747 | queue_run(start_id, stop_id, TRUE); |
748 | } | |
749 | ||
750 | /* At top level, log the end of the run. */ | |
751 | ||
6073ad45 JH |
752 | if (!recurse) |
753 | if (*queue_name) | |
754 | log_write(L_queue_run, LOG_MAIN, "End '%s' queue run: %s", | |
755 | queue_name, log_detail); | |
756 | else | |
757 | log_write(L_queue_run, LOG_MAIN, "End queue run: %s", log_detail); | |
059ec3d9 PH |
758 | } |
759 | ||
760 | ||
761 | ||
762 | ||
763 | /************************************************ | |
764 | * Count messages on the queue * | |
765 | ************************************************/ | |
766 | ||
767 | /* Called as a result of -bpc | |
768 | ||
769 | Arguments: none | |
04403ab0 | 770 | Returns: count |
059ec3d9 PH |
771 | */ |
772 | ||
04403ab0 | 773 | unsigned |
059ec3d9 PH |
774 | queue_count(void) |
775 | { | |
776 | int subcount; | |
04403ab0 | 777 | unsigned count = 0; |
059ec3d9 | 778 | uschar subdirs[64]; |
d7978c0f | 779 | |
04403ab0 | 780 | for (queue_filename * f = queue_get_spool_list( |
d7978c0f JH |
781 | -1, /* entire queue */ |
782 | subdirs, /* for holding sub list */ | |
783 | &subcount, /* for subcount */ | |
784 | FALSE); /* not random */ | |
785 | f; f = f->next) count++; | |
04403ab0 | 786 | return count; |
059ec3d9 PH |
787 | } |
788 | ||
789 | ||
04403ab0 JH |
790 | #define QUEUE_SIZE_AGE 60 /* update rate for queue_size */ |
791 | ||
792 | unsigned | |
793 | queue_count_cached(void) | |
794 | { | |
795 | time_t now; | |
796 | if ((now = time(NULL)) >= queue_size_next) | |
797 | { | |
798 | queue_size = queue_count(); | |
799 | queue_size_next = now + (f.running_in_test_harness ? 3 : QUEUE_SIZE_AGE); | |
800 | } | |
801 | return queue_size; | |
802 | } | |
059ec3d9 PH |
803 | |
804 | /************************************************ | |
805 | * List extra deliveries * | |
806 | ************************************************/ | |
807 | ||
808 | /* This is called from queue_list below to print out all addresses that | |
809 | have received a message but which were not primary addresses. That is, all | |
810 | the addresses in the tree of non-recipients that are not primary addresses. | |
811 | The tree has been scanned and the data field filled in for those that are | |
812 | primary addresses. | |
813 | ||
814 | Argument: points to the tree node | |
815 | Returns: nothing | |
816 | */ | |
817 | ||
e5903596 JH |
818 | static void |
819 | queue_list_extras(tree_node *p) | |
059ec3d9 | 820 | { |
e5903596 | 821 | if (p->left) queue_list_extras(p->left); |
059ec3d9 | 822 | if (!p->data.val) printf(" +D %s\n", p->name); |
e5903596 | 823 | if (p->right) queue_list_extras(p->right); |
059ec3d9 PH |
824 | } |
825 | ||
826 | ||
827 | ||
828 | /************************************************ | |
829 | * List messages on the queue * | |
830 | ************************************************/ | |
831 | ||
832 | /* Or a given list of messages. In the "all" case, we get a list of file names | |
833 | as quickly as possible, then scan each one for information to output. If any | |
834 | disappear while we are processing, just leave them out, but give an error if an | |
835 | explicit list was given. This function is a top-level function that is obeyed | |
836 | as a result of the -bp argument. As there may be a lot of messages on the | |
837 | queue, we must tidy up the store after reading the headers for each one. | |
838 | ||
839 | Arguments: | |
840 | option 0 => list top-level recipients, with "D" for those delivered | |
841 | 1 => list only undelivered top-level recipients | |
842 | 2 => as 0, plus any generated delivered recipients | |
843 | If 8 is added to any of these values, the queue is listed in | |
844 | random order. | |
845 | list => first of any message ids to list | |
846 | count count of message ids; 0 => all | |
847 | ||
848 | Returns: nothing | |
849 | */ | |
850 | ||
851 | void | |
852 | queue_list(int option, uschar **list, int count) | |
853 | { | |
059ec3d9 PH |
854 | int subcount; |
855 | int now = (int)time(NULL); | |
f3ebb786 | 856 | rmark reset_point; |
8768d548 | 857 | queue_filename * qf = NULL; |
059ec3d9 PH |
858 | uschar subdirs[64]; |
859 | ||
860 | /* If given a list of messages, build a chain containing their ids. */ | |
861 | ||
862 | if (count > 0) | |
863 | { | |
864 | queue_filename *last = NULL; | |
d7978c0f | 865 | for (int i = 0; i < count; i++) |
059ec3d9 PH |
866 | { |
867 | queue_filename *next = | |
f3ebb786 | 868 | store_get(sizeof(queue_filename) + Ustrlen(list[i]) + 2, is_tainted(list[i])); |
059ec3d9 PH |
869 | sprintf(CS next->text, "%s-H", list[i]); |
870 | next->dir_uschar = '*'; | |
871 | next->next = NULL; | |
8768d548 | 872 | if (i == 0) qf = next; else last->next = next; |
059ec3d9 PH |
873 | last = next; |
874 | } | |
875 | } | |
876 | ||
877 | /* Otherwise get a list of the entire queue, in order if necessary. */ | |
878 | ||
879 | else | |
8768d548 | 880 | qf = queue_get_spool_list( |
059ec3d9 PH |
881 | -1, /* entire queue */ |
882 | subdirs, /* for holding sub list */ | |
883 | &subcount, /* for subcount */ | |
884 | option >= 8); /* randomize if required */ | |
885 | ||
886 | if (option >= 8) option -= 8; | |
887 | ||
888 | /* Now scan the chain and print information, resetting store used | |
889 | each time. */ | |
890 | ||
f3ebb786 JH |
891 | for (; |
892 | qf && (reset_point = store_mark()); | |
8768d548 | 893 | spool_clear_header_globals(), store_reset(reset_point), qf = qf->next |
c232fc99 | 894 | ) |
059ec3d9 PH |
895 | { |
896 | int rc, save_errno; | |
897 | int size = 0; | |
898 | BOOL env_read; | |
899 | ||
059ec3d9 | 900 | message_size = 0; |
8768d548 JH |
901 | message_subdir[0] = qf->dir_uschar; |
902 | rc = spool_read_header(qf->text, FALSE, count <= 0); | |
c232fc99 JH |
903 | if (rc == spool_read_notopen && errno == ENOENT && count <= 0) |
904 | continue; | |
059ec3d9 PH |
905 | save_errno = errno; |
906 | ||
907 | env_read = (rc == spool_read_OK || rc == spool_read_hdrerror); | |
908 | ||
909 | if (env_read) | |
910 | { | |
d7978c0f | 911 | int i, ptr; |
059ec3d9 PH |
912 | FILE *jread; |
913 | struct stat statbuf; | |
8768d548 | 914 | uschar * fname = spool_fname(US"input", message_subdir, qf->text, US""); |
059ec3d9 | 915 | |
41313d92 JH |
916 | ptr = Ustrlen(fname)-1; |
917 | fname[ptr] = 'D'; | |
059ec3d9 PH |
918 | |
919 | /* Add the data size to the header size; don't count the file name | |
920 | at the start of the data file, but add one for the notional blank line | |
921 | that precedes the data. */ | |
922 | ||
41313d92 | 923 | if (Ustat(fname, &statbuf) == 0) |
059ec3d9 | 924 | size = message_size + statbuf.st_size - SPOOL_DATA_START_OFFSET + 1; |
32dfdf8b | 925 | i = (now - received_time.tv_sec)/60; /* minutes on queue */ |
059ec3d9 PH |
926 | if (i > 90) |
927 | { | |
928 | i = (i + 30)/60; | |
929 | if (i > 72) printf("%2dd ", (i + 12)/24); else printf("%2dh ", i); | |
930 | } | |
931 | else printf("%2dm ", i); | |
932 | ||
933 | /* Collect delivered addresses from any J file */ | |
934 | ||
41313d92 | 935 | fname[ptr] = 'J'; |
90341c71 | 936 | if ((jread = Ufopen(fname, "rb"))) |
059ec3d9 PH |
937 | { |
938 | while (Ufgets(big_buffer, big_buffer_size, jread) != NULL) | |
939 | { | |
940 | int n = Ustrlen(big_buffer); | |
941 | big_buffer[n-1] = 0; | |
942 | tree_add_nonrecipient(big_buffer); | |
943 | } | |
f1e894f3 | 944 | (void)fclose(jread); |
059ec3d9 PH |
945 | } |
946 | } | |
947 | ||
948 | fprintf(stdout, "%s ", string_format_size(size, big_buffer)); | |
d7978c0f | 949 | for (int i = 0; i < 16; i++) fputc(qf->text[i], stdout); |
059ec3d9 | 950 | |
90341c71 | 951 | if (env_read && sender_address) |
059ec3d9 PH |
952 | { |
953 | printf(" <%s>", sender_address); | |
8768d548 | 954 | if (f.sender_set_untrusted) printf(" (%s)", originator_login); |
059ec3d9 PH |
955 | } |
956 | ||
957 | if (rc != spool_read_OK) | |
958 | { | |
959 | printf("\n "); | |
960 | if (save_errno == ERRNO_SPOOLFORMAT) | |
961 | { | |
962 | struct stat statbuf; | |
8768d548 | 963 | uschar * fname = spool_fname(US"input", message_subdir, qf->text, US""); |
41313d92 JH |
964 | |
965 | if (Ustat(fname, &statbuf) == 0) | |
b1c749bb PH |
966 | printf("*** spool format error: size=" OFF_T_FMT " ***", |
967 | statbuf.st_size); | |
059ec3d9 PH |
968 | else printf("*** spool format error ***"); |
969 | } | |
970 | else printf("*** spool read error: %s ***", strerror(save_errno)); | |
971 | if (rc != spool_read_hdrerror) | |
972 | { | |
973 | printf("\n\n"); | |
c232fc99 | 974 | continue; |
059ec3d9 PH |
975 | } |
976 | } | |
977 | ||
8768d548 | 978 | if (f.deliver_freeze) printf(" *** frozen ***"); |
059ec3d9 PH |
979 | |
980 | printf("\n"); | |
981 | ||
90341c71 | 982 | if (recipients_list) |
059ec3d9 | 983 | { |
d7978c0f | 984 | for (int i = 0; i < recipients_count; i++) |
059ec3d9 PH |
985 | { |
986 | tree_node *delivered = | |
987 | tree_search(tree_nonrecipients, recipients_list[i].address); | |
988 | if (!delivered || option != 1) | |
c232fc99 JH |
989 | printf(" %s %s\n", |
990 | delivered ? "D" : " ", recipients_list[i].address); | |
90341c71 | 991 | if (delivered) delivered->data.val = TRUE; |
059ec3d9 | 992 | } |
90341c71 | 993 | if (option == 2 && tree_nonrecipients) |
059ec3d9 PH |
994 | queue_list_extras(tree_nonrecipients); |
995 | printf("\n"); | |
996 | } | |
997 | } | |
998 | } | |
999 | ||
1000 | ||
1001 | ||
1002 | /************************************************* | |
1003 | * Act on a specific message * | |
1004 | *************************************************/ | |
1005 | ||
a96603a0 PH |
1006 | /* Actions that require a list of addresses make use of argv/argc/ |
1007 | recipients_arg. Other actions do not. This function does its own | |
1008 | authority checking. | |
059ec3d9 PH |
1009 | |
1010 | Arguments: | |
1011 | id id of the message to work on | |
1012 | action which action is required (MSG_xxx) | |
1013 | argv the original argv for Exim | |
1014 | argc the original argc for Exim | |
1015 | recipients_arg offset to the list of recipients in argv | |
1016 | ||
1017 | Returns: FALSE if there was any problem | |
1018 | */ | |
1019 | ||
1020 | BOOL | |
1021 | queue_action(uschar *id, int action, uschar **argv, int argc, int recipients_arg) | |
1022 | { | |
059ec3d9 PH |
1023 | BOOL yield = TRUE; |
1024 | BOOL removed = FALSE; | |
1025 | struct passwd *pw; | |
1026 | uschar *doing = NULL; | |
1027 | uschar *username; | |
1028 | uschar *errmsg; | |
41313d92 | 1029 | uschar spoolname[32]; |
059ec3d9 PH |
1030 | |
1031 | /* Set the global message_id variable, used when re-writing spool files. This | |
1032 | also causes message ids to be added to log messages. */ | |
1033 | ||
1034 | Ustrcpy(message_id, id); | |
1035 | ||
1036 | /* The "actions" that just list the files do not require any locking to be | |
1037 | done. Only admin users may read the spool files. */ | |
1038 | ||
1039 | if (action >= MSG_SHOW_BODY) | |
1040 | { | |
d7978c0f | 1041 | int fd, rc; |
059ec3d9 PH |
1042 | uschar *subdirectory, *suffix; |
1043 | ||
8768d548 | 1044 | if (!f.admin_user) |
059ec3d9 PH |
1045 | { |
1046 | printf("Permission denied\n"); | |
1047 | return FALSE; | |
1048 | } | |
1049 | ||
1050 | if (recipients_arg < argc) | |
1051 | { | |
1052 | printf("*** Only one message can be listed at once\n"); | |
1053 | return FALSE; | |
1054 | } | |
1055 | ||
1056 | if (action == MSG_SHOW_BODY) | |
1057 | { | |
1058 | subdirectory = US"input"; | |
1059 | suffix = US"-D"; | |
1060 | } | |
1061 | else if (action == MSG_SHOW_HEADER) | |
1062 | { | |
1063 | subdirectory = US"input"; | |
1064 | suffix = US"-H"; | |
1065 | } | |
1066 | else | |
1067 | { | |
1068 | subdirectory = US"msglog"; | |
1069 | suffix = US""; | |
1070 | } | |
1071 | ||
d7978c0f | 1072 | for (int i = 0; i < 2; i++) |
059ec3d9 | 1073 | { |
59a93276 | 1074 | set_subdir_str(message_subdir, id, i); |
41313d92 JH |
1075 | if ((fd = Uopen(spool_fname(subdirectory, message_subdir, id, suffix), |
1076 | O_RDONLY, 0)) >= 0) | |
a2da3176 JH |
1077 | break; |
1078 | if (i == 0) | |
1079 | continue; | |
1080 | ||
059ec3d9 PH |
1081 | printf("Failed to open %s file for %s%s: %s\n", subdirectory, id, suffix, |
1082 | strerror(errno)); | |
1083 | if (action == MSG_SHOW_LOG && !message_logs) | |
1084 | printf("(No message logs are being created because the message_logs " | |
1085 | "option is false.)\n"); | |
1086 | return FALSE; | |
1087 | } | |
1088 | ||
1089 | while((rc = read(fd, big_buffer, big_buffer_size)) > 0) | |
1ac6b2e7 | 1090 | rc = write(fileno(stdout), big_buffer, rc); |
059ec3d9 | 1091 | |
f1e894f3 | 1092 | (void)close(fd); |
059ec3d9 PH |
1093 | return TRUE; |
1094 | } | |
1095 | ||
1096 | /* For actions that actually act, open and lock the data file to ensure that no | |
1097 | other process is working on this message. If the file does not exist, continue | |
1098 | only if the action is remove and the user is an admin user, to allow for | |
1099 | tidying up broken states. */ | |
1100 | ||
789f8a4f | 1101 | if ((deliver_datafile = spool_open_datafile(id)) < 0) |
059ec3d9 PH |
1102 | if (errno == ENOENT) |
1103 | { | |
1104 | yield = FALSE; | |
1105 | printf("Spool data file for %s does not exist\n", id); | |
8768d548 | 1106 | if (action != MSG_REMOVE || !f.admin_user) return FALSE; |
059ec3d9 PH |
1107 | printf("Continuing, to ensure all files removed\n"); |
1108 | } | |
1109 | else | |
1110 | { | |
1111 | if (errno == 0) printf("Message %s is locked\n", id); | |
1112 | else printf("Couldn't open spool file for %s: %s\n", id, | |
1113 | strerror(errno)); | |
1114 | return FALSE; | |
1115 | } | |
059ec3d9 PH |
1116 | |
1117 | /* Read the spool header file for the message. Again, continue after an | |
1118 | error only in the case of deleting by an administrator. Setting the third | |
1119 | argument false causes it to look both in the main spool directory and in | |
1120 | the appropriate subdirectory, and set message_subdir according to where it | |
1121 | found the message. */ | |
1122 | ||
1123 | sprintf(CS spoolname, "%s-H", id); | |
1124 | if (spool_read_header(spoolname, TRUE, FALSE) != spool_read_OK) | |
1125 | { | |
1126 | yield = FALSE; | |
1127 | if (errno != ERRNO_SPOOLFORMAT) | |
1128 | printf("Spool read error for %s: %s\n", spoolname, strerror(errno)); | |
1129 | else | |
1130 | printf("Spool format error for %s\n", spoolname); | |
8768d548 | 1131 | if (action != MSG_REMOVE || !f.admin_user) |
059ec3d9 | 1132 | { |
f1e894f3 | 1133 | (void)close(deliver_datafile); |
059ec3d9 PH |
1134 | deliver_datafile = -1; |
1135 | return FALSE; | |
1136 | } | |
1137 | printf("Continuing to ensure all files removed\n"); | |
1138 | } | |
1139 | ||
1140 | /* Check that the user running this process is entitled to operate on this | |
1141 | message. Only admin users may freeze/thaw, add/cancel recipients, or otherwise | |
1142 | mess about, but the original sender is permitted to remove a message. That's | |
1143 | why we leave this check until after the headers are read. */ | |
1144 | ||
8768d548 | 1145 | if (!f.admin_user && (action != MSG_REMOVE || real_uid != originator_uid)) |
059ec3d9 PH |
1146 | { |
1147 | printf("Permission denied\n"); | |
f1e894f3 | 1148 | (void)close(deliver_datafile); |
059ec3d9 PH |
1149 | deliver_datafile = -1; |
1150 | return FALSE; | |
1151 | } | |
1152 | ||
1153 | /* Set up the user name for logging. */ | |
1154 | ||
1155 | pw = getpwuid(real_uid); | |
1156 | username = (pw != NULL)? | |
1157 | US pw->pw_name : string_sprintf("uid %ld", (long int)real_uid); | |
1158 | ||
1159 | /* Take the necessary action. */ | |
1160 | ||
a96603a0 | 1161 | if (action != MSG_SHOW_COPY) printf("Message %s ", id); |
059ec3d9 PH |
1162 | |
1163 | switch(action) | |
1164 | { | |
a96603a0 | 1165 | case MSG_SHOW_COPY: |
42055a33 | 1166 | { |
cab0c277 | 1167 | transport_ctx tctx = {{0}}; |
42055a33 JH |
1168 | deliver_in_buffer = store_malloc(DELIVER_IN_BUFFER_SIZE); |
1169 | deliver_out_buffer = store_malloc(DELIVER_OUT_BUFFER_SIZE); | |
1170 | tctx.u.fd = 1; | |
ee8b8090 | 1171 | (void) transport_write_message(&tctx, 0); |
42055a33 JH |
1172 | break; |
1173 | } | |
a96603a0 PH |
1174 | |
1175 | ||
059ec3d9 | 1176 | case MSG_FREEZE: |
8768d548 | 1177 | if (f.deliver_freeze) |
059ec3d9 PH |
1178 | { |
1179 | yield = FALSE; | |
1180 | printf("is already frozen\n"); | |
1181 | } | |
1182 | else | |
1183 | { | |
8768d548 JH |
1184 | f.deliver_freeze = TRUE; |
1185 | f.deliver_manual_thaw = FALSE; | |
059ec3d9 PH |
1186 | deliver_frozen_at = time(NULL); |
1187 | if (spool_write_header(id, SW_MODIFYING, &errmsg) >= 0) | |
1188 | { | |
1189 | printf("is now frozen\n"); | |
1190 | log_write(0, LOG_MAIN, "frozen by %s", username); | |
1191 | } | |
1192 | else | |
1193 | { | |
1194 | yield = FALSE; | |
1195 | printf("could not be frozen: %s\n", errmsg); | |
1196 | } | |
1197 | } | |
1198 | break; | |
1199 | ||
1200 | ||
1201 | case MSG_THAW: | |
8768d548 | 1202 | if (!f.deliver_freeze) |
059ec3d9 PH |
1203 | { |
1204 | yield = FALSE; | |
1205 | printf("is not frozen\n"); | |
1206 | } | |
1207 | else | |
1208 | { | |
8768d548 JH |
1209 | f.deliver_freeze = FALSE; |
1210 | f.deliver_manual_thaw = TRUE; | |
059ec3d9 PH |
1211 | if (spool_write_header(id, SW_MODIFYING, &errmsg) >= 0) |
1212 | { | |
1213 | printf("is no longer frozen\n"); | |
1214 | log_write(0, LOG_MAIN, "unfrozen by %s", username); | |
1215 | } | |
1216 | else | |
1217 | { | |
1218 | yield = FALSE; | |
1219 | printf("could not be unfrozen: %s\n", errmsg); | |
1220 | } | |
1221 | } | |
1222 | break; | |
1223 | ||
1224 | ||
1225 | /* We must ensure all files are removed from both the input directory | |
1226 | and the appropriate subdirectory, to clean up cases when there are odd | |
1227 | files left lying around in odd places. In the normal case message_subdir | |
1228 | will have been set correctly by spool_read_header, but as this is a rare | |
1229 | operation, just run everything twice. */ | |
1230 | ||
1231 | case MSG_REMOVE: | |
059ec3d9 | 1232 | { |
41313d92 | 1233 | uschar suffix[3]; |
059ec3d9 | 1234 | |
41313d92 JH |
1235 | suffix[0] = '-'; |
1236 | suffix[2] = 0; | |
1237 | message_subdir[0] = id[5]; | |
1238 | ||
d7978c0f | 1239 | for (int j = 0; j < 2; message_subdir[0] = 0, j++) |
059ec3d9 | 1240 | { |
41313d92 JH |
1241 | uschar * fname = spool_fname(US"msglog", message_subdir, id, US""); |
1242 | ||
1243 | DEBUG(D_any) debug_printf(" removing %s", fname); | |
1244 | if (Uunlink(fname) < 0) | |
1245 | { | |
1246 | if (errno != ENOENT) | |
1247 | { | |
1248 | yield = FALSE; | |
1249 | printf("Error while removing %s: %s\n", fname, strerror(errno)); | |
1250 | } | |
1251 | else DEBUG(D_any) debug_printf(" (no file)\n"); | |
1252 | } | |
1253 | else | |
1254 | { | |
1255 | removed = TRUE; | |
1256 | DEBUG(D_any) debug_printf(" (ok)\n"); | |
1257 | } | |
1258 | ||
d7978c0f | 1259 | for (int i = 0; i < 3; i++) |
41313d92 JH |
1260 | { |
1261 | uschar * fname; | |
1262 | ||
1263 | suffix[1] = (US"DHJ")[i]; | |
1264 | fname = spool_fname(US"input", message_subdir, id, suffix); | |
1265 | ||
1266 | DEBUG(D_any) debug_printf(" removing %s", fname); | |
1267 | if (Uunlink(fname) < 0) | |
1268 | { | |
1269 | if (errno != ENOENT) | |
1270 | { | |
1271 | yield = FALSE; | |
1272 | printf("Error while removing %s: %s\n", fname, strerror(errno)); | |
1273 | } | |
1274 | else DEBUG(D_any) debug_printf(" (no file)\n"); | |
1275 | } | |
1276 | else | |
1277 | { | |
1278 | removed = TRUE; | |
1279 | DEBUG(D_any) debug_printf(" (done)\n"); | |
1280 | } | |
1281 | } | |
059ec3d9 | 1282 | } |
059ec3d9 | 1283 | |
41313d92 JH |
1284 | /* In the common case, the datafile is open (and locked), so give the |
1285 | obvious message. Otherwise be more specific. */ | |
059ec3d9 | 1286 | |
41313d92 JH |
1287 | if (deliver_datafile >= 0) printf("has been removed\n"); |
1288 | else printf("has been removed or did not exist\n"); | |
1289 | if (removed) | |
1290 | { | |
7ea1237c | 1291 | #ifndef DISABLE_EVENT |
7a9e0ae1 | 1292 | if (event_action) for (int i = 0; i < recipients_count; i++) |
7ea1237c MK |
1293 | { |
1294 | tree_node *delivered = | |
1295 | tree_search(tree_nonrecipients, recipients_list[i].address); | |
1296 | if (!delivered) | |
1297 | { | |
1298 | uschar * save_local = deliver_localpart; | |
1299 | const uschar * save_domain = deliver_domain; | |
1300 | uschar * addr = recipients_list[i].address, * errmsg = NULL; | |
1301 | int start, end, dom; | |
1302 | ||
1303 | if (!parse_extract_address(addr, &errmsg, &start, &end, &dom, TRUE)) | |
1304 | log_write(0, LOG_MAIN|LOG_PANIC, | |
1305 | "failed to parse address '%.100s'\n: %s", addr, errmsg); | |
1306 | else | |
1307 | { | |
1308 | deliver_localpart = | |
1309 | string_copyn(addr+start, dom ? (dom-1) - start : end - start); | |
1310 | deliver_domain = dom | |
1311 | ? CUS string_copyn(addr+dom, end - dom) : CUS""; | |
1312 | ||
1313 | event_raise(event_action, US"msg:fail:internal", | |
1314 | string_sprintf("message removed by %s", username)); | |
1315 | ||
1316 | deliver_localpart = save_local; | |
1317 | deliver_domain = save_domain; | |
1318 | } | |
1319 | } | |
1320 | } | |
1321 | (void) event_raise(event_action, US"msg:complete", NULL); | |
1322 | #endif | |
41313d92 JH |
1323 | log_write(0, LOG_MAIN, "removed by %s", username); |
1324 | log_write(0, LOG_MAIN, "Completed"); | |
1325 | } | |
1326 | break; | |
8e669ac1 | 1327 | } |
059ec3d9 PH |
1328 | |
1329 | ||
fc7bae7f JH |
1330 | case MSG_SETQUEUE: |
1331 | /* The global "queue_name_dest" is used as destination, "queue_name" | |
1332 | as source */ | |
1333 | ||
1334 | spool_move_message(id, message_subdir, US"", US""); | |
1335 | break; | |
1336 | ||
1337 | ||
059ec3d9 | 1338 | case MSG_MARK_ALL_DELIVERED: |
d7978c0f | 1339 | for (int i = 0; i < recipients_count; i++) |
059ec3d9 | 1340 | tree_add_nonrecipient(recipients_list[i].address); |
7ea1237c | 1341 | |
059ec3d9 PH |
1342 | if (spool_write_header(id, SW_MODIFYING, &errmsg) >= 0) |
1343 | { | |
1344 | printf("has been modified\n"); | |
d7978c0f | 1345 | for (int i = 0; i < recipients_count; i++) |
059ec3d9 PH |
1346 | log_write(0, LOG_MAIN, "address <%s> marked delivered by %s", |
1347 | recipients_list[i].address, username); | |
1348 | } | |
1349 | else | |
1350 | { | |
1351 | yield = FALSE; | |
1352 | printf("- could not mark all delivered: %s\n", errmsg); | |
1353 | } | |
1354 | break; | |
1355 | ||
1356 | ||
1357 | case MSG_EDIT_SENDER: | |
1358 | if (recipients_arg < argc - 1) | |
1359 | { | |
1360 | yield = FALSE; | |
1361 | printf("- only one sender address can be specified\n"); | |
1362 | break; | |
1363 | } | |
1364 | doing = US"editing sender"; | |
1365 | /* Fall through */ | |
1366 | ||
1367 | case MSG_ADD_RECIPIENT: | |
1368 | if (doing == NULL) doing = US"adding recipient"; | |
1369 | /* Fall through */ | |
1370 | ||
1371 | case MSG_MARK_DELIVERED: | |
1372 | if (doing == NULL) doing = US"marking as delivered"; | |
1373 | ||
1374 | /* Common code for EDIT_SENDER, ADD_RECIPIENT, & MARK_DELIVERED */ | |
1375 | ||
1376 | if (recipients_arg >= argc) | |
1377 | { | |
1378 | yield = FALSE; | |
1379 | printf("- error while %s: no address given\n", doing); | |
1380 | break; | |
1381 | } | |
1382 | ||
1383 | for (; recipients_arg < argc; recipients_arg++) | |
1384 | { | |
1385 | int start, end, domain; | |
1386 | uschar *errmess; | |
1387 | uschar *recipient = | |
1388 | parse_extract_address(argv[recipients_arg], &errmess, &start, &end, | |
1389 | &domain, (action == MSG_EDIT_SENDER)); | |
1390 | ||
1391 | if (recipient == NULL) | |
1392 | { | |
1393 | yield = FALSE; | |
1394 | printf("- error while %s:\n bad address %s: %s\n", | |
1395 | doing, argv[recipients_arg], errmess); | |
1396 | } | |
1397 | else if (recipient[0] != 0 && domain == 0) | |
1398 | { | |
1399 | yield = FALSE; | |
1400 | printf("- error while %s:\n bad address %s: " | |
1401 | "domain missing\n", doing, argv[recipients_arg]); | |
1402 | } | |
1403 | else | |
1404 | { | |
1405 | if (action == MSG_ADD_RECIPIENT) | |
1406 | { | |
8c5d388a | 1407 | #ifdef SUPPORT_I18N |
d752cc0e JH |
1408 | if (string_is_utf8(recipient)) allow_utf8_domains = message_smtputf8 = TRUE; |
1409 | #endif | |
059ec3d9 PH |
1410 | receive_add_recipient(recipient, -1); |
1411 | log_write(0, LOG_MAIN, "recipient <%s> added by %s", | |
1412 | recipient, username); | |
1413 | } | |
1414 | else if (action == MSG_MARK_DELIVERED) | |
1415 | { | |
d7978c0f | 1416 | int i; |
059ec3d9 PH |
1417 | for (i = 0; i < recipients_count; i++) |
1418 | if (Ustrcmp(recipients_list[i].address, recipient) == 0) break; | |
1419 | if (i >= recipients_count) | |
1420 | { | |
1421 | printf("- error while %s:\n %s is not a recipient:" | |
1422 | " message not updated\n", doing, recipient); | |
1423 | yield = FALSE; | |
1424 | } | |
1425 | else | |
1426 | { | |
1427 | tree_add_nonrecipient(recipients_list[i].address); | |
1428 | log_write(0, LOG_MAIN, "address <%s> marked delivered by %s", | |
1429 | recipient, username); | |
1430 | } | |
1431 | } | |
1432 | else /* MSG_EDIT_SENDER */ | |
1433 | { | |
8c5d388a | 1434 | #ifdef SUPPORT_I18N |
d752cc0e JH |
1435 | if (string_is_utf8(recipient)) allow_utf8_domains = message_smtputf8 = TRUE; |
1436 | #endif | |
059ec3d9 PH |
1437 | sender_address = recipient; |
1438 | log_write(0, LOG_MAIN, "sender address changed to <%s> by %s", | |
1439 | recipient, username); | |
1440 | } | |
1441 | } | |
1442 | } | |
1443 | ||
1444 | if (yield) | |
059ec3d9 PH |
1445 | if (spool_write_header(id, SW_MODIFYING, &errmsg) >= 0) |
1446 | printf("has been modified\n"); | |
1447 | else | |
1448 | { | |
1449 | yield = FALSE; | |
1450 | printf("- while %s: %s\n", doing, errmsg); | |
1451 | } | |
059ec3d9 PH |
1452 | |
1453 | break; | |
1454 | } | |
1455 | ||
1456 | /* Closing the datafile releases the lock and permits other processes | |
1457 | to operate on the message (if it still exists). */ | |
1458 | ||
12cf7615 JH |
1459 | if (deliver_datafile >= 0) |
1460 | { | |
1461 | (void)close(deliver_datafile); | |
1462 | deliver_datafile = -1; | |
1463 | } | |
059ec3d9 PH |
1464 | return yield; |
1465 | } | |
1466 | ||
1467 | ||
1468 | ||
1469 | /************************************************* | |
1470 | * Check the queue_only_file condition * | |
1471 | *************************************************/ | |
1472 | ||
1473 | /* The queue_only_file option forces certain kinds of queueing if a given file | |
1474 | exists. | |
1475 | ||
1476 | Arguments: none | |
1477 | Returns: nothing | |
1478 | */ | |
1479 | ||
1480 | void | |
1481 | queue_check_only(void) | |
1482 | { | |
059ec3d9 PH |
1483 | int sep = 0; |
1484 | struct stat statbuf; | |
e851856f JH |
1485 | const uschar * s = queue_only_file; |
1486 | uschar * ss; | |
059ec3d9 | 1487 | |
e851856f JH |
1488 | if (s) |
1489 | while ((ss = string_nextinlist(&s, &sep, NULL, 0))) | |
1490 | if (Ustrncmp(ss, "smtp", 4) == 0) | |
8768d548 | 1491 | { |
e851856f JH |
1492 | ss += 4; |
1493 | if (Ustat(ss, &statbuf) == 0) | |
1494 | { | |
1495 | f.queue_smtp = TRUE; | |
1496 | DEBUG(D_receive) debug_printf("queue_smtp set because %s exists\n", ss); | |
1497 | } | |
8768d548 | 1498 | } |
e851856f JH |
1499 | else |
1500 | if (Ustat(ss, &statbuf) == 0) | |
1501 | { | |
1502 | queue_only = TRUE; | |
1503 | DEBUG(D_receive) debug_printf("queue_only set because %s exists\n", ss); | |
1504 | } | |
059ec3d9 PH |
1505 | } |
1506 | ||
ff966302 JH |
1507 | |
1508 | ||
1509 | /******************************************************************************/ | |
1510 | /******************************************************************************/ | |
1511 | ||
1512 | #ifdef EXPERIMENTAL_QUEUE_RAMP | |
1513 | void | |
1514 | queue_notify_daemon(const uschar * msgid) | |
1515 | { | |
1516 | uschar buf[MESSAGE_ID_LENGTH + 2]; | |
1517 | int fd; | |
1518 | ||
1519 | DEBUG(D_queue_run) debug_printf("%s: %s\n", __FUNCTION__, msgid); | |
1520 | ||
1521 | buf[0] = NOTIFY_MSG_QRUN; | |
1522 | memcpy(buf+1, msgid, MESSAGE_ID_LENGTH+1); | |
1523 | ||
1524 | if ((fd = socket(AF_UNIX, SOCK_DGRAM, 0)) >= 0) | |
1525 | { | |
1526 | struct sockaddr_un sun = {.sun_family = AF_UNIX}; | |
04403ab0 JH |
1527 | int len = offsetof(struct sockaddr_un, sun_path) + 1 |
1528 | + snprintf(sun.sun_path+1, sizeof(sun.sun_path)-1, "%s", | |
1529 | NOTIFIER_SOCKET_NAME); | |
1530 | sun.sun_path[0] = 0; | |
ff966302 | 1531 | |
04403ab0 | 1532 | if (sendto(fd, buf, sizeof(buf), 0, &sun, len) < 0) |
ff966302 JH |
1533 | DEBUG(D_queue_run) |
1534 | debug_printf("%s: sendto %s\n", __FUNCTION__, strerror(errno)); | |
1535 | close(fd); | |
1536 | } | |
1537 | else DEBUG(D_queue_run) debug_printf(" socket: %s\n", strerror(errno)); | |
1538 | } | |
1539 | #endif | |
1540 | ||
41313d92 JH |
1541 | #endif /*!COMPILE_UTILITY*/ |
1542 | ||
059ec3d9 | 1543 | /* End of queue.c */ |