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