3 * Configuration parser for Director Run Configuration
4 * directives, which are part of the Schedule Resource
11 Copyright (C) 2000-2004 Kern Sibbald and John Walker
13 This program is free software; you can redistribute it and/or
14 modify it under the terms of the GNU General Public License as
15 published by the Free Software Foundation; either version 2 of
16 the License, or (at your option) any later version.
18 This program is distributed in the hope that it will be useful,
19 but WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public
24 License along with this program; if not, write to the Free
25 Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
34 extern struct s_jl joblevels[];
36 /* Forward referenced subroutines */
50 s_wom, /* 1st, 2nd, ...*/
51 s_woy, /* week of year w00 - w53 */
55 char *name; /* keyword */
56 enum e_state state; /* parser state */
57 int code; /* state value */
60 /* Keywords understood by parser */
61 static struct s_keyw keyw[] = {
62 {N_("on"), s_none, 0},
65 {N_("sun"), s_wday, 0},
66 {N_("mon"), s_wday, 1},
67 {N_("tue"), s_wday, 2},
68 {N_("wed"), s_wday, 3},
69 {N_("thu"), s_wday, 4},
70 {N_("fri"), s_wday, 5},
71 {N_("sat"), s_wday, 6},
72 {N_("jan"), s_month, 0},
73 {N_("feb"), s_month, 1},
74 {N_("mar"), s_month, 2},
75 {N_("apr"), s_month, 3},
76 {N_("may"), s_month, 4},
77 {N_("jun"), s_month, 5},
78 {N_("jul"), s_month, 6},
79 {N_("aug"), s_month, 7},
80 {N_("sep"), s_month, 8},
81 {N_("oct"), s_month, 9},
82 {N_("nov"), s_month, 10},
83 {N_("dec"), s_month, 11},
85 {N_("sunday"), s_wday, 0},
86 {N_("monday"), s_wday, 1},
87 {N_("tuesday"), s_wday, 2},
88 {N_("wednesday"), s_wday, 3},
89 {N_("thursday"), s_wday, 4},
90 {N_("friday"), s_wday, 5},
91 {N_("saturday"), s_wday, 6},
92 {N_("january"), s_month, 0},
93 {N_("february"), s_month, 1},
94 {N_("march"), s_month, 2},
95 {N_("april"), s_month, 3},
96 {N_("june"), s_month, 5},
97 {N_("july"), s_month, 6},
98 {N_("august"), s_month, 7},
99 {N_("september"), s_month, 8},
100 {N_("october"), s_month, 9},
101 {N_("november"), s_month, 10},
102 {N_("december"), s_month, 11},
104 {N_("daily"), s_daily, 0},
105 {N_("weekly"), s_weekly, 0},
106 {N_("monthly"), s_monthly, 0},
107 {N_("hourly"), s_hourly, 0},
109 {N_("1st"), s_wom, 0},
110 {N_("2nd"), s_wom, 1},
111 {N_("3rd"), s_wom, 2},
112 {N_("4th"), s_wom, 3},
113 {N_("5th"), s_wom, 4},
115 {N_("first"), s_wom, 0},
116 {N_("second"), s_wom, 1},
117 {N_("third"), s_wom, 2},
118 {N_("fourth"), s_wom, 3},
119 {N_("fifth"), s_wom, 4},
123 static bool have_hour, have_mday, have_wday, have_month, have_wom;
124 static bool have_at, have_woy;
127 static void clear_defaults()
129 have_hour = have_mday = have_wday = have_month = have_wom = have_woy = true;
130 clear_bit(0,lrun.hour);
131 clear_bits(0, 30, lrun.mday);
132 clear_bits(0, 6, lrun.wday);
133 clear_bits(0, 11, lrun.month);
134 clear_bits(0, 4, lrun.wom);
135 clear_bits(0, 53, lrun.woy);
138 static void set_defaults()
140 have_hour = have_mday = have_wday = have_month = have_wom = have_woy = false;
142 set_bit(0,lrun.hour);
143 set_bits(0, 30, lrun.mday);
144 set_bits(0, 6, lrun.wday);
145 set_bits(0, 11, lrun.month);
146 set_bits(0, 4, lrun.wom);
147 set_bits(0, 53, lrun.woy);
151 /* Keywords (RHS) permitted in Run records */
152 static struct s_kw RunFields[] = {
155 {"incrementalpool", 'i'},
156 {"differentialpool", 'd'},
166 * Store Schedule Run information
168 * Parse Run statement:
170 * Run <keyword=value ...> [on] 2 january at 23:45
172 * Default Run time is daily at 0:0
174 * There can be multiple run statements, they are simply chained
178 void store_run(LEX *lc, RES_ITEM *item, int index, int pass)
182 int token, state, state2 = 0, code = 0, code2 = 0;
183 int options = lc->options;
184 RUN **run = (RUN **)(item->value);
190 lc->options |= LOPT_NO_IDENT; /* want only "strings" */
192 /* clear local copy of run record */
193 memset(&lrun, 0, sizeof(RUN));
195 /* scan for Job level "full", "incremental", ... */
196 for (found=true; found; ) {
198 token = lex_get_token(lc, T_NAME);
199 for (i=0; RunFields[i].name; i++) {
200 if (strcasecmp(lc->str, RunFields[i].name) == 0) {
202 if (lex_get_token(lc, T_ALL) != T_EQUALS) {
203 scan_err1(lc, "Expected an equals, got: %s", lc->str);
206 switch (RunFields[i].token) {
207 case 's': /* Data spooling */
208 token = lex_get_token(lc, T_NAME);
209 if (strcasecmp(lc->str, "yes") == 0) {
210 lrun.spool_data = true;
211 lrun.spool_data_set = true;
212 } else if (strcasecmp(lc->str, "no") == 0) {
213 lrun.spool_data = false;
214 lrun.spool_data_set = true;
216 scan_err1(lc, _("Expect a YES or NO, got: %s"), lc->str);
219 case 'L': /* level */
220 token = lex_get_token(lc, T_NAME);
221 for (j=0; joblevels[j].level_name; j++) {
222 if (strcasecmp(lc->str, joblevels[j].level_name) == 0) {
223 lrun.level = joblevels[j].level;
224 lrun.job_type = joblevels[j].job_type;
230 scan_err1(lc, _("Job level field: %s not found in run record"), lc->str);
234 case 'p': /* Priority */
235 token = lex_get_token(lc, T_PINT32);
237 lrun.Priority = lc->pint32_val;
241 case 'f': /* FullPool */
242 case 'i': /* IncPool */
243 case 'd': /* DifPool */
244 token = lex_get_token(lc, T_NAME);
246 res = GetResWithName(R_POOL, lc->str);
248 scan_err1(lc, "Could not find specified Pool Resource: %s",
252 switch(RunFields[i].token) {
254 lrun.pool = (POOL *)res;
257 lrun.full_pool = (POOL *)res;
260 lrun.inc_pool = (POOL *)res;
263 lrun.dif_pool = (POOL *)res;
268 case 'S': /* storage */
269 token = lex_get_token(lc, T_NAME);
271 res = GetResWithName(R_STORAGE, lc->str);
273 scan_err1(lc, "Could not find specified Storage Resource: %s",
277 lrun.storage = (STORE *)res;
280 case 'M': /* messages */
281 token = lex_get_token(lc, T_NAME);
283 res = GetResWithName(R_MSGS, lc->str);
285 scan_err1(lc, "Could not find specified Messages Resource: %s",
289 lrun.msgs = (MSGS *)res;
293 scan_err1(lc, "Expected a keyword name, got: %s", lc->str);
297 } /* end if strcasecmp */
298 } /* end for RunFields */
300 /* At this point, it is not a keyword. Check for old syle
301 * Job Levels without keyword. This form is depreciated!!!
303 for (j=0; joblevels[j].level_name; j++) {
304 if (strcasecmp(lc->str, joblevels[j].level_name) == 0) {
305 lrun.level = joblevels[j].level;
306 lrun.job_type = joblevels[j].job_type;
311 } /* end for found */
315 * Scan schedule times.
316 * Default is: daily at 0:0
321 for ( ; token != T_EOL; (token = lex_get_token(lc, T_ALL))) {
326 code = atoi(lc->str) - 1;
327 if (code < 0 || code > 30) {
328 scan_err0(lc, _("Day number out of range (1-31)"));
331 case T_NAME: /* this handles drop through from keyword */
332 case T_UNQUOTED_STRING:
333 if (strchr(lc->str, (int)'-')) {
337 if (strchr(lc->str, (int)':')) {
341 if (lc->str_len == 3 && (lc->str[0] == 'w' || lc->str[0] == 'W') &&
342 is_an_integer(lc->str+1)) {
343 code = atoi(lc->str+1);
344 if (code < 0 || code > 53) {
345 scan_err0(lc, _("Week number out of range (0-53)"));
347 state = s_woy; /* week of year */
350 /* everything else must be a keyword */
351 for (i=0; keyw[i].name; i++) {
352 if (strcasecmp(lc->str, keyw[i].name) == 0) {
353 state = keyw[i].state;
360 scan_err1(lc, _("Job type field: %s in run record not found"), lc->str);
367 scan_err2(lc, _("Unexpected token: %d:%s"), token, lc->str);
374 case s_mday: /* day of month */
376 clear_bits(0, 30, lrun.mday);
379 set_bit(code, lrun.mday);
381 case s_month: /* month of year */
383 clear_bits(0, 11, lrun.month);
386 set_bit(code, lrun.month);
388 case s_wday: /* week day */
390 clear_bits(0, 6, lrun.wday);
393 set_bit(code, lrun.wday);
395 case s_wom: /* Week of month 1st, ... */
397 clear_bits(0, 4, lrun.wom);
400 set_bit(code, lrun.wom);
404 clear_bits(0, 53, lrun.woy);
407 set_bit(code, lrun.woy);
409 case s_time: /* time */
411 scan_err0(lc, _("Time must be preceded by keyword AT."));
415 clear_bit(0, lrun.hour);
417 p = strchr(lc->str, ':');
419 scan_err0(lc, _("Time logic error.\n"));
422 *p++ = 0; /* separate two halves */
423 code = atoi(lc->str);
425 if (len > 2 && p[len-1] == 'm') {
426 if (p[len-2] == 'a') {
428 } else if (p[len-2] == 'p') {
431 scan_err0(lc, _("Bad time specification."));
441 if (code < 0 || code > 23 || code2 < 0 || code2 > 59) {
442 scan_err0(lc, _("Bad time specification."));
445 /****FIXME**** convert to UTC */
446 set_bit(code, lrun.hour);
454 p = strchr(lc->str, '-');
456 scan_err0(lc, _("Range logic error.\n"));
458 *p++ = 0; /* separate two halves */
460 /* Check for day range */
461 if (is_an_integer(lc->str) && is_an_integer(p)) {
462 code = atoi(lc->str) - 1;
464 if (code < 0 || code > 30 || code2 < 0 || code2 > 30) {
465 scan_err0(lc, _("Bad day range specification."));
468 clear_bits(0, 30, lrun.mday);
472 set_bits(code, code2, lrun.mday);
474 set_bits(code, 30, lrun.mday);
475 set_bits(0, code2, lrun.mday);
479 /* Check for week of year range */
480 if (strlen(lc->str) == 3 && strlen(p) == 3 &&
481 (lc->str[0] == 'w' || lc->str[0] == 'W') &&
482 (p[0] == 'w' || p[0] == 'W') &&
483 is_an_integer(lc->str+1) && is_an_integer(p+1)) {
484 code = atoi(lc->str+1);
486 if (code < 0 || code > 53 || code2 < 0 || code2 > 53) {
487 scan_err0(lc, _("Week number out of range (0-53)"));
490 clear_bits(0, 53, lrun.woy);
494 set_bits(code, code2, lrun.woy);
496 set_bits(code, 53, lrun.woy);
497 set_bits(0, code2, lrun.woy);
501 /* lookup first half of keyword range (week days or months) */
503 for (i=0; keyw[i].name; i++) {
504 if (strcmp(lc->str, keyw[i].name) == 0) {
505 state = keyw[i].state;
511 if (i != 0 || (state != s_month && state != s_wday && state != s_wom)) {
512 scan_err0(lc, _("Invalid month, week or position day range"));
516 /* Lookup end of range */
518 for (i=0; keyw[i].name; i++) {
519 if (strcmp(p, keyw[i].name) == 0) {
520 state2 = keyw[i].state;
521 code2 = keyw[i].code;
526 if (i != 0 || state != state2 || code == code2) {
527 scan_err0(lc, _("Invalid month, weekday or position range"));
530 if (state == s_wday) {
532 clear_bits(0, 6, lrun.wday);
536 set_bits(code, code2, lrun.wday);
538 set_bits(code, 6, lrun.wday);
539 set_bits(0, code2, lrun.wday);
541 } else if (state == s_month) {
543 clear_bits(0, 11, lrun.month);
547 set_bits(code, code2, lrun.month);
549 /* this is a bit odd, but we accept it anyway */
550 set_bits(code, 11, lrun.month);
551 set_bits(0, code2, lrun.month);
554 /* Must be position */
556 clear_bits(0, 4, lrun.wom);
560 set_bits(code, code2, lrun.wom);
562 set_bits(code, 4, lrun.wom);
563 set_bits(0, code2, lrun.wom);
569 set_bits(0, 23, lrun.hour);
570 set_bits(0, 30, lrun.mday);
571 set_bits(0, 11, lrun.month);
572 set_bits(0, 4, lrun.wom);
573 set_bits(0, 53, lrun.woy);
577 set_bit(0, lrun.wday);
578 set_bits(0, 11, lrun.month);
579 set_bits(0, 4, lrun.wom);
580 set_bits(0, 53, lrun.woy);
584 set_bits(0, 30, lrun.mday);
585 set_bits(0, 11, lrun.month);
586 set_bits(0, 4, lrun.wom);
587 set_bits(0, 53, lrun.woy);
591 set_bits(0, 11, lrun.month);
592 set_bits(0, 4, lrun.wom);
593 set_bits(0, 53, lrun.woy);
596 scan_err0(lc, _("Unexpected run state\n"));
602 /* Allocate run record, copy new stuff into it,
603 * and link it into the list of run records
604 * in the schedule resource.
607 trun = (RUN *)malloc(sizeof(RUN));
608 memcpy(trun, &lrun, sizeof(RUN));
615 lc->options = options; /* restore scanner options */
616 set_bit(index, res_all.res_sch.hdr.item_present);