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