-
Notifications
You must be signed in to change notification settings - Fork 13
/
database.c
1879 lines (1589 loc) · 62.3 KB
/
database.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* FCRON - periodic command scheduler
*
* Copyright 2000-2025 Thibault Godouet <[email protected]>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* The GNU General Public License can also be found in the file
* `LICENSE' that comes with the fcron source distribution.
*/
#include "fcron.h"
#include "database.h"
#include "job.h"
#include "getloadavg.h"
int is_leap_year(int year);
int get_nb_mdays(int year, int mon);
void set_wday(struct tm *date);
time_t mktime_no_dst(struct tm *t);
void goto_beginning_next_period_periodical(cl_t * line, struct tm *ftime);
void move_time_to(int where, cl_t * line, struct tm *ftime);
#define BEGIN_NEXT_PERIOD 11 /* move_time_to()'s where possible value */
#define END_OF_INTERVAL 12 /* move_time_to()'s where possible value */
void run_serial_job(void);
void run_lavg_job(lavg_t * l);
void run_queue_job(cl_t * line);
int is_loop_in_queue(void);
void
test_jobs(void)
/* determine which jobs need to be run, and run them. */
{
struct job_t *j;
/* // */
debug("Looking for jobs to execute ...");
/* // */
while ((j = queue_base) && j->j_line->cl_nextexe <= now) {
if (j->j_line->cl_remain > 0 && --(j->j_line->cl_remain) > 0) {
debug(" cl_remain: %d", j->j_line->cl_remain);
}
else {
j->j_line->cl_remain = j->j_line->cl_runfreq;
if (is_lavg(j->j_line->cl_option))
add_lavg_job(j->j_line, -1);
else if (is_serial(j->j_line->cl_option))
add_serial_job(j->j_line, -1);
else
run_normal_job(j->j_line, -1);
set_hasrun(j->j_line->cl_option);
}
if (is_runonce(j->j_line->cl_option) && is_hasrun(j->j_line->cl_option)) {
explain("Line '%s' has runonce set: not re-scheduling it.",
j->j_line->cl_shell);
job_queue_remove(j->j_line);
}
else {
set_next_exe(j->j_line, STD, -1);
}
}
}
int
switch_timezone(const char *orig_tz, const char *dest_tz)
/* check if we have already switched to dest_tz timezone, otherwise do it */
/* If dest_tz is NULL, this function does nothing */
/* Returns 1 if this function has switched the timezone, 0 otherwise */
{
char *current_tz = getenv("TZ");
if (dest_tz != NULL &&
(current_tz == NULL || strcmp(dest_tz, current_tz) != 0)) {
my_setenv_overwrite("TZ", dest_tz);
return 1;
}
else
return 0;
}
void
switch_back_timezone(const char *orig_tz)
/* if orig_tz is NULL, unsets TZ
* otherwise, sets TZ to orig_tz */
{
if (orig_tz == NULL) {
my_unsetenv("TZ");
}
else {
my_setenv_overwrite("TZ", orig_tz);
}
}
time_t
mktime_no_dst(struct tm *t)
/* same as mktime(), but without daylight saving time (dst) change adjustment
* (ie. the returned time_t does not depend on the tm_isdst field) */
/* Remark : you may think that instead of creating a new function,
* it would be easier to set the tm_isdst field to -1.
* Unfortunately, the behaviour of mktime() with
* tm_isdst set to -1 depends on the unix you run.
* In other word, it wouldn't be portable. */
/*
* WARNING : the content of t has to be valid (for instance, 0<=t->tm_hour<=23,
* etc)
*/
{
struct tm t2;
time_t ti1;
t2 = *t;
ti1 = mktime(&t2);
/* */
debug(" after mktime() : %d:%d isdst:%d ti:%ld\n",
t2.tm_hour, t2.tm_min, t2.tm_isdst, ti1);
/* */
/* check if there have been a dst change adjustment */
if (t->tm_isdst != t2.tm_isdst) {
time_t ti2;
struct tm t3;
/* recompute the time_t field with the other isdst value
* it works well, unless in a special case, hence the test
* below */
t3 = *t;
t3.tm_isdst = t2.tm_isdst;
ti2 = mktime(&t3);
/* */
debug("after dst fix 1 : %d:%d isdst:%d ti:%ld\n",
t3.tm_hour, t3.tm_min, t3.tm_isdst, ti2);
/* */
/* if t1 is in the "gap" of a dst change (for instance,
* if t1 is 2:30 while at 2:00, it is 3:00 due to the dst change,
* ie. 2:30 is never reached), the ti2 may be incorrect :
* we check that it is correct before using it : */
if (t3.tm_hour == t->tm_hour || ti1 < ti2) {
t2 = t3;
ti1 = ti2;
}
}
*t = t2;
return ti1;
}
void
run_normal_job(cl_t *line, int info_fd)
/* run a job, and write "log" on info_fd if positive */
{
if (line->cl_numexe <= 0 ||
(is_exe_sev(line->cl_option) && line->cl_numexe < UCHAR_MAX)) {
line->cl_numexe += 1;
run_queue_job(line);
send_msg_fd(info_fd, "Job '%s' started.", line->cl_shell);
}
else {
warn_fd(info_fd, " process already running: %s's '%s'",
line->cl_file->cf_user, line->cl_shell);
}
}
void
run_lavg_job(lavg_t *l)
{
run_queue_job(l->l_line);
if (is_serial(l->l_line->cl_option))
lavg_serial_running++;
}
void
run_serial_job(void)
/* run the next serialized job */
{
/* // */
/* debug("running next serial job"); */
/* // */
debug("num: %d running:%d index:%d", serial_num, serial_running,
serial_array_index);
if (serial_num != 0) {
run_queue_job(serial_array[serial_array_index]);
serial_array[serial_array_index] = NULL;
serial_running++;
if (++serial_array_index >= serial_array_size)
serial_array_index -= serial_array_size;
serial_num--;
}
}
void
run_queue_job(cl_t *line)
/* run a job */
{
exe_t e = { NULL, 0, 0 };
/* // */
/* debug("run_queue_job"); */
/* // */
e.e_line = line;
/* run the job */
if (run_job(&e) == OK) {
/* append job to the list of executed job */
exe_list_add(exe_list, &e);
line->cl_file->cf_running += 1;
}
}
int
is_loop_in_queue(void)
/* Check that we don't have a loop in the queue_base list.
* Return 1 if there is a loop, 0 otherwise.
* Only intended to be used when running in debug mode really. */
{
const int max_entries = 1000000;
int i = 0;
struct job_t *j;
if (queue_base == NULL) {
return 0;
}
for (j = queue_base, i = 0; j != NULL; j = j->j_next, i++) {
if (i > max_entries) {
return 1;
}
}
return 0;
}
job_t *
job_queue_remove(cl_t *line)
/* remove a job from the queue list
* returns a pointer to the previous entry,
* or NULL if the line either wasn't in the queue or was the first entry */
{
struct job_t *j;
struct job_t *jprev = NULL;
if (queue_base == NULL)
return NULL;
if (debug_opt && is_loop_in_queue()) {
error("Loop found in job queue before removing line '%s': aborting",
line->cl_shell);
abort();
}
/* find the job in the list */
for (j = queue_base; j != NULL; jprev = j, j = j->j_next) {
if (j->j_line == line) {
/* remove it from the list */
if (jprev != NULL) {
jprev->j_next = j->j_next;
}
else
/* first element of the list */
queue_base = j->j_next;
Free_safe(j);
if (debug_opt && is_loop_in_queue()) {
error("Loop found in job queue after removing line '%s': "
"aborting.", line->cl_shell);
abort();
}
return jprev;
}
}
/* the job wasn't there */
return NULL;
}
void
insert_nextexe(cl_t *line)
/* insert a job at the right position in the job queue */
{
struct job_t *newjob = NULL;
struct job_t *j = NULL;
struct job_t *jprev = NULL;
if (debug_opt && is_loop_in_queue()) {
error("Detected loop in queue_base before adding job '%s' "
"to the queue: aborting.", line->cl_shell);
abort();
}
Alloc(newjob, job_t);
newjob->j_line = line;
newjob->j_next = NULL;
if (queue_base == NULL) {
/* no job in queue */
queue_base = newjob;
return;
}
jprev = job_queue_remove(line);
/* check if we should start from queue_base or from jprev
* (in some cases, e.g. fcrontab has just been edited, the line should
* be moved *forward* in the queue) */
if (jprev == NULL || line->cl_nextexe < jprev->j_line->cl_nextexe) {
j = queue_base;
jprev = NULL;
}
else {
j = jprev;
}
/* a job can only be moved back */
while (j != NULL && (line->cl_nextexe >= j->j_line->cl_nextexe)) {
jprev = j;
j = j->j_next;
}
/* when we get out from the while(), newjob should be added between jprev and j */
newjob->j_next = j;
if (jprev == NULL) {
queue_base = newjob;
}
else {
jprev->j_next = newjob;
}
if (debug_opt && is_loop_in_queue()) {
error("Detected loop in queue_base after adding job '%s' to the queue:"
" aborting.", line->cl_shell);
abort();
}
}
void
add_serial_job(cl_t *line, int info_fd)
/* add the next queued job in serial queue */
{
short int i;
/* check if the line is already in the serial queue
* (we consider serial jobs currently running as in the queue) */
if ((is_serial_sev(line->cl_option) && line->cl_numexe >= UCHAR_MAX) ||
(!is_serial_sev(line->cl_option) && line->cl_numexe > 0)) {
send_msg_fd_debug(info_fd, "already in serial queue '%s'",
line->cl_shell);
return;
}
send_msg_fd_debug(info_fd, "inserting in serial queue '%s'",
line->cl_shell);
if (serial_num >= serial_array_size) {
if (serial_num >= serial_queue_max) {
error_fd(info_fd, "Could not add job : serial queue is full "
"(%d jobs). Consider using option serialonce, fcron's "
"option -m and/or -q : '%s'", serial_queue_max,
line->cl_shell);
if (is_notice_notrun(line->cl_option))
mail_notrun(line, QUEUE_FULL, NULL);
return;
}
else {
cl_t **ptr = NULL;
short int old_size = serial_array_size;
debug("Resizing serial_array");
serial_array_size = (serial_array_size + SERIAL_GROW_SIZE);
ptr =
alloc_safe(serial_array_size * sizeof(cl_t *), "serial_array");
/* copy lines in order to have the first line at the index 0 */
memcpy(ptr + serial_array_index, serial_array,
(sizeof(cl_t *) * (old_size - serial_array_index)));
memcpy(ptr, serial_array + (old_size - serial_array_index),
(sizeof(cl_t *) * serial_array_index));
serial_array_index = 0;
Free_safe(serial_array);
serial_array = ptr;
}
}
if ((i = serial_array_index + serial_num) >= serial_array_size)
i -= serial_array_size;
serial_array[i] = line;
serial_num++;
line->cl_numexe += 1;
send_msg_fd_debug(info_fd, "serial num: %d size:%d index:%d curline:%d "
"running:%d (%s)", serial_num, serial_array_size,
serial_array_index, i, serial_running, line->cl_shell);
}
void
add_lavg_job(cl_t *line, int info_fd)
/* add the next queued job in lavg queue */
/* WARNING : must be run before a set_next_exe() to get the strict option
* working correctly */
{
lavg_t *lavg_entry = NULL;
/* check if the line is already in the lavg queue
* (we consider serial jobs currently running as in the queue) */
if ((is_lavg_sev(line->cl_option) && line->cl_numexe >= UCHAR_MAX) ||
(!is_lavg_sev(line->cl_option) && line->cl_numexe > 0)) {
send_msg_fd_debug(info_fd, "already in lavg queue '%s'",
line->cl_shell);
return;
}
/* // */
send_msg_fd_debug(info_fd, "inserting in lavg queue '%s'", line->cl_shell);
/* // */
/* append job to the list of lavg job */
lavg_entry = lavg_list_add_line(lavg_list, line);
if (lavg_entry == NULL) {
error_fd(info_fd,
"Could not add job '%s' : lavg queue is full (%d jobs)."
" Consider using options lavgonce, until, strict and/or "
"fcron's option -q.", line->cl_shell, lavg_list->max_entries);
if (is_notice_notrun(line->cl_option))
mail_notrun(line, QUEUE_FULL, NULL);
return;
}
line->cl_numexe += 1;
set_run_if_late(line->cl_option);
if (is_strict(line->cl_option) && line->cl_runfreq == 1) {
struct tm *ft;
struct tm ftime;
time_t begin_of_cur_int, end_of_cur_int = 0;
int tz_changed = 0;
/* Switch to another timezone if necessary. */
/* If line should be scheduled in a different time zone
* (ie. cl_tz != NULL),
* switch to that timezone now, do the calculations,
* and switch back to the local timezone at the end
* of the function. */
tz_changed = switch_timezone(orig_tz_envvar, line->cl_tz);
/* handle timezone differences */
begin_of_cur_int = line->cl_nextexe - (line->cl_file->cf_tzdiff * 3600);
ft = localtime(&begin_of_cur_int);
/* localtime() function seems to return every time the same pointer :
* it resets our previous changes, so we need to prevent it
* ( localtime() is used in the debug() function) */
memcpy(&ftime, ft, sizeof(struct tm));
move_time_to(END_OF_INTERVAL, line, &ftime);
end_of_cur_int =
mktime_no_dst(&ftime) + (line->cl_file->cf_tzdiff * 3600);
if ((line->cl_until > 0) && (line->cl_until + now < end_of_cur_int))
lavg_entry->l_until = line->cl_until + now;
else {
lavg_entry->l_until = end_of_cur_int;
clear_run_if_late(line->cl_option);
}
if (tz_changed > 0)
switch_back_timezone(orig_tz_envvar);
}
else
lavg_entry->l_until = (line->cl_until > 0) ? now + line->cl_until : 0;
if (debug_opt) {
if (lavg_entry->l_until == 0) {
send_msg_fd_debug(info_fd,
" lavg entry added until:none cmd: '%s'",
line->cl_shell);
}
else {
struct tm ftime;
struct tm *ft = localtime(&(lavg_entry->l_until));
/* localtime() returns a statically allocated struct which might be
* overwritten by subsequent calls: take a copy.
* (note: localtime() is used in the debug() function too) */
memcpy(&ftime, ft, sizeof(struct tm));
send_msg_fd_debug(info_fd,
" lavg entry added until:%04d-%02d-%02d "
"%02d:%02d:%02d (system time) cmd: '%s'",
(ftime.tm_year + 1900), (ftime.tm_mon + 1),
ftime.tm_mday, ftime.tm_hour,
ftime.tm_min, ftime.tm_sec, line->cl_shell);
}
}
}
void
wait_chld(void)
/* wait_chld() - check for job completion */
{
int pid;
cl_t *line = NULL;
exe_t *e = NULL;
/* // */
/* debug("wait_chld"); */
/* // */
while ((pid = waitpid(-1, NULL, WNOHANG)) > 0) {
for (e = exe_list_first(exe_list); e != NULL;
e = exe_list_next(exe_list)) {
if (pid == e->e_ctrl_pid) {
if (e->e_line == NULL) {
/* the corresponding file has been removed from memory */
debug("Child exited: pid %d", pid);
}
else {
line = e->e_line;
debug("Child exited (pid %d): %s", pid, line->cl_shell);
line->cl_numexe -= 1;
line->cl_file->cf_running -= 1;
if (is_serial_once(line->cl_option)) {
clear_serial_once(line->cl_option);
if (--serial_running < serial_max_running)
run_serial_job();
}
else if (is_serial(line->cl_option)
&& !is_lavg(line->cl_option)) {
if (--serial_running < serial_max_running)
run_serial_job();
}
else if (is_lavg(line->cl_option)
&& is_serial(line->cl_option))
lavg_serial_running--;
}
exe_list_remove_cur(exe_list);
exe_list_end_iteration(exe_list);
break;
}
}
}
}
void
wait_all(int *counter)
/* return after all jobs completion. */
{
int pid;
exe_t *e = NULL;
debug("Waiting for all jobs");
while ((*counter > 0) && (pid = waitpid(-1, NULL, 0)) > 0) {
for (e = exe_list_first(exe_list); e != NULL;
e = exe_list_next(exe_list)) {
if (pid == e->e_ctrl_pid) {
if (e->e_line == NULL) {
/* the corresponding file has been removed from memory */
debug("Job finished: pid %d", pid);
}
else {
debug("Job finished: '%s'", e->e_line->cl_shell);
e->e_line->cl_numexe -= 1;
e->e_line->cl_file->cf_running -= 1;
if (is_serial_once(e->e_line->cl_option))
clear_serial_once(e->e_line->cl_option);
}
exe_list_remove_cur(exe_list);
exe_list_end_iteration(exe_list);
break;
}
}
}
}
int
is_leap_year(int year)
/* return 1 if it's a leap year otherwise return 0 */
{
return ((year % 4 == 0) && ((year % 100 != 0) || (year % 400 == 0)));
}
int
get_nb_mdays(int year, int mon)
/* return the number of days in a given month of a given year */
{
if (mon == 1) { /* is February ? */
if (is_leap_year(year))
return 29;
else
return 28;
}
else if (mon <= 6)
if (mon % 2 == 0)
return 31;
else
return 30;
else if (mon % 2 == 0)
return 30;
else
return 31;
}
void
set_wday(struct tm *date)
/* we know that 01/01/2000 was a Saturday ( day number 6 )
* so we count the number of days since 01/01/2000,
* and add this number modulo 7 to the wday number */
{
long nod = 0;
int i;
/* we add the number of days of each previous years */
for (i = (date->tm_year - 1); i >= 100; i--)
nod += (is_leap_year(i + 1900)) ? 366 : 365;
/* and month */
for (i = (date->tm_mon - 1); i >= 0; i--)
nod += get_nb_mdays((date->tm_year + 1900), i);
/* then we add the number of days passed in the current month */
nod += (date->tm_mday - 1); /* (mday is set from 1 to 31) */
date->tm_wday = (nod % 7) + 6;
if (date->tm_wday >= 7)
date->tm_wday -= 7;
debug(" dow of %04d-%02d-%02d : %d", (date->tm_year + 1900),
(date->tm_mon + 1), date->tm_mday, date->tm_wday);
}
void
goto_beginning_next_period_periodical(cl_t *line, struct tm *ftime)
/* From ftime, search the first/nearest time and date of the line's next
* period of execution.
*
* Line must be periodical (i.e. is_freq_periodically(line->cl_option) == TRUE)
*
* ftime will contain this time and date when this function returns.
*
* Vocabulary:
* interval of execution= a continuous interval of time during which
* the line can be executed.
* period of execution= a continuous interval of time during which
* the line is to be executed once and only once. */
{
int max = 0;
/* sanity check */
if (!is_freq_periodically(line->cl_option))
die("goto_beginning_next_period() called with a non periodical line");
/* number of days in ftime's month */
max = get_nb_mdays(ftime->tm_year, ftime->tm_mon);
/* STEP 1: find the beginning of the next period without ensuring
* there is no overflow (min>=60, hour>=24, etc) */
if (is_freq_mid(line->cl_option)) {
if (is_freq_mins(line->cl_option))
/* nothing to do : return */
return;
else if (is_freq_hrs(line->cl_option)) {
if (ftime->tm_min >= 30)
ftime->tm_hour++;
ftime->tm_min = 30;
}
else {
ftime->tm_min = 0;
if (is_freq_days(line->cl_option)) {
if (ftime->tm_hour >= 12)
ftime->tm_mday++;
ftime->tm_hour = 12;
}
else {
ftime->tm_hour = 0;
if (is_freq_dow(line->cl_option)) {
int to_add = (ftime->tm_wday >= 4) ? 11 - ftime->tm_wday :
4 - ftime->tm_wday;
if (ftime->tm_mday + to_add > max) {
ftime->tm_mon++;
ftime->tm_mday = ftime->tm_mday + to_add - max;
}
else
ftime->tm_mday += to_add;
}
else {
if (is_freq_mons(line->cl_option)) {
if (ftime->tm_mday >= 15)
ftime->tm_mon++;
ftime->tm_mday = 15;
}
else {
/* weird : we have the bit freq_mid set, but
* none of freq_{mins|hour|days|dow|mons} is set :
* we do nothing but increase tm_min by 1
* so as we don't return a time in the past */
ftime->tm_min++;
warn("Line %s doesn't seem correct: consider "
"reinstalling the corresponding fcrontab");
}
}
}
}
}
else { /* is_freq_mid(line->cl_option) */
if (is_freq_mins(line->cl_option))
/* nothing to do */
return;
else {
ftime->tm_min = 0;
if (is_freq_hrs(line->cl_option))
ftime->tm_hour++;
else {
ftime->tm_hour = 0;
if (is_freq_days(line->cl_option))
ftime->tm_mday++;
else {
if (is_freq_dow(line->cl_option)) {
int to_add =
(ftime->tm_wday == 0) ? 1 : 8 - ftime->tm_wday;
if (ftime->tm_mday + to_add > max) {
ftime->tm_mday = ftime->tm_mday + to_add - max;
ftime->tm_mon++;
}
else
ftime->tm_mday += to_add;
}
else {
ftime->tm_mday = 1;
if (is_freq_mons(line->cl_option))
ftime->tm_mon++;
}
}
}
}
} /* is_freq_mid(line->cl_option) */
/* we set tm_sec to 0 here and not before to ensure we will never return
* a time in the past (case is_freq_mins(line->cl_option)
* where we do nothing) */
ftime->tm_sec = 0;
/* STEP 2: fix the overflows.
* (a value may exceed the max value of a field: fix it if necessary) */
if (ftime->tm_min >= 60) {
ftime->tm_min = 0;
ftime->tm_hour++;
}
if (ftime->tm_hour >= 24) {
ftime->tm_hour = 0;
ftime->tm_mday++;
}
/* the month field may have changed */
max = get_nb_mdays((ftime->tm_year + 1900), ftime->tm_mon);
if (ftime->tm_mday > max) {
ftime->tm_mday = 1;
ftime->tm_mon++;
}
if (ftime->tm_mon >= 12) {
ftime->tm_mon = 0;
ftime->tm_year++;
}
if (debug_opt)
set_wday(ftime);
debug(" '%s' beginning of next period %04d-%02d-%02d wday:%d %02d:%02d "
"(tzdiff=%d, timezone=%s)", line->cl_shell, (ftime->tm_year + 1900),
(ftime->tm_mon + 1), ftime->tm_mday, ftime->tm_wday,
ftime->tm_hour, ftime->tm_min, line->cl_file->cf_tzdiff,
(line->cl_tz != NULL) ? line->cl_tz : "localtime");
}
void
move_time_to(int where, cl_t *line, struct tm *ftime)
/* IF WHERE == BEGIN_NEXT_PERIOD: from ftime, search the first/nearest time and date
* of the line's next period of execution.
* IF WHERE == END_OF_INTERVAL: search the last time and date
* of the line's interval of execution containing ftime.
*
* ftime will contain this time and date when move_time_to returns.
*
* Vocabulary:
* interval of execution= a continuous interval of time during which
* the line can be executed.
* period of execution= a continuous interval of time during which
* the line is to be executed once and only once. */
{
struct tm tm_next_period;
time_t timet_ftime;
/* by default we set timet_next_period to now + 10 years, which will
* always be later than the end of the interval of execution
* so as to make the test timet_ftime < timet_next_period always true */
time_t timet_next_period = now + 10 * 365 * 24 * 3600;
/* to prevent from infinite loop with unvalid lines : */
short int year_limit = MAXYEAR_SCHEDULE_TIME;
/* Depending on the situation we may need to ignore some fields
* while we walk through time */
char ignore_mins, ignore_hrs, ignore_days, ignore_mons, ignore_dow;
/* sanity checks */
if (where != BEGIN_NEXT_PERIOD && where != END_OF_INTERVAL)
die("move_time_to() called with invalid argument 'where': %d",
(int)where);
if (where == BEGIN_NEXT_PERIOD && is_freq_periodically(line->cl_option)) {
goto_beginning_next_period_periodical(line, ftime);
return;
}
/* In all other cases, we will have to walk through time */
if (is_freq_periodically(line->cl_option)) {
/* In this case we want to make sure we won't go after the end
* of the period of execution, so we need to set next_period */
memcpy(&tm_next_period, ftime, sizeof(tm_next_period));
goto_beginning_next_period_periodical(line, &tm_next_period);
timet_next_period = mktime_no_dst(&tm_next_period);
}
timet_ftime = mktime_no_dst(ftime);
if (where == BEGIN_NEXT_PERIOD) {
/* we have to ignore the fields containing single numbers */
ignore_mins = (is_freq_mins(line->cl_option)) ? 1 : 0;
ignore_hrs = (is_freq_hrs(line->cl_option)) ? 1 : 0;
ignore_days = (is_freq_days(line->cl_option)) ? 1 : 0;
ignore_mons = (is_freq_mons(line->cl_option)) ? 1 : 0;
ignore_dow = (is_freq_dow(line->cl_option)) ? 1 : 0;
}
else {
/* we want to go to the end of the current interval:
* we don't ignore anything */
ignore_mins = ignore_hrs = ignore_days = ignore_mons = ignore_dow = 0;
}
/* */
debug(" ignore: %d %d %d %d %d", ignore_mins, ignore_hrs,
ignore_days, ignore_mons, ignore_dow);
/* */
/* while we are in an interval of execution and not in the next period */
while ((ignore_mins == 1 || bit_test(line->cl_mins, ftime->tm_min)) &&
(ignore_hrs == 1 || bit_test(line->cl_hrs, ftime->tm_hour)) &&
((is_dayand(line->cl_option) &&
(ignore_days == 1 || bit_test(line->cl_days, ftime->tm_mday)) &&
(ignore_dow == 1 || bit_test(line->cl_dow, ftime->tm_wday)))
||
(is_dayor(line->cl_option) &&
(ignore_days == 1 || bit_test(line->cl_days, ftime->tm_mday) ||
ignore_dow == 1 || bit_test(line->cl_dow, ftime->tm_wday)))
) && (ignore_mons == 1 || bit_test(line->cl_mons, ftime->tm_mon))
&& (timet_ftime < timet_next_period)
) {
ftime->tm_sec = 0;
if (ignore_mins)
ftime->tm_min = 60;
else {
do
ftime->tm_min++;
while (bit_test(line->cl_mins, ftime->tm_min)
&& (ftime->tm_min < 60));
}
if (ftime->tm_min >= 60) {
ftime->tm_min = 0;
if (ignore_hrs && ignore_mins)
ftime->tm_hour = 24;
else
ftime->tm_hour++;
if (ftime->tm_hour >= 24) {
ftime->tm_hour = 0;
if (ignore_days && ignore_hrs && ignore_mins && ignore_dow)
ftime->tm_mday = 32; /* go to next month */
else
ftime->tm_mday++;
if (ftime->tm_mday >
get_nb_mdays((ftime->tm_year + 1900), ftime->tm_mon)) {
ftime->tm_mday = 1;
if (ignore_mons && ignore_days && ignore_dow
&& ignore_hrs && ignore_mins)
ftime->tm_mon = 12;
else
ftime->tm_mon++;
if (ftime->tm_mon >= 12) {
ftime->tm_mon = 0;
ftime->tm_year++;
if (--year_limit <= 0) {
error("Can't found a non matching date for '%s' "
"in the next %d years. Maybe this line "
"is corrupted : consider reinstalling "
"the fcrontab", line->cl_shell,
MAXYEAR_SCHEDULE_TIME);
return;
}
}
}
set_wday(ftime);
}
}
/* // */
{
/* set temporarily debug_opt to false to avoid having too many
* messages in the logs */
char debug_opt_previous = debug_opt;
debug_opt = 0;
timet_ftime = mktime_no_dst(ftime);
debug_opt = debug_opt_previous;
}
/* // */