3 * Configuration parser for Director Run Configuration
4 * directives, which are part of the Schedule Resource
11 Copyright (C) 2000, 2001, 2002 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'},
165 * Store Schedule Run information
167 * Parse Run statement:
169 * Run <keyword=value ...> [on] 2 january at 23:45
171 * Default Run time is daily at 0:0
173 * There can be multiple run statements, they are simply chained
177 void store_run(LEX *lc, struct res_items *item, int index, int pass)
181 int token, state, state2 = 0, code = 0, code2 = 0;
182 int options = lc->options;
183 RUN **run = (RUN **)(item->value);
189 lc->options |= LOPT_NO_IDENT; /* want only "strings" */
191 /* clear local copy of run record */
192 memset(&lrun, 0, sizeof(RUN));
194 /* scan for Job level "full", "incremental", ... */
195 for (found=true; found; ) {
197 token = lex_get_token(lc, T_NAME);
198 for (i=0; RunFields[i].name; i++) {
199 if (strcasecmp(lc->str, RunFields[i].name) == 0) {
201 if (lex_get_token(lc, T_ALL) != T_EQUALS) {
202 scan_err1(lc, "Expected an equals, got: %s", lc->str);
205 switch (RunFields[i].token) {
206 case 'L': /* level */
207 token = lex_get_token(lc, T_NAME);
208 for (j=0; joblevels[j].level_name; j++) {
209 if (strcasecmp(lc->str, joblevels[j].level_name) == 0) {
210 lrun.level = joblevels[j].level;
211 lrun.job_type = joblevels[j].job_type;
217 scan_err1(lc, _("Job level field: %s not found in run record"), lc->str);
221 case 'p': /* Priority */
222 token = lex_get_token(lc, T_PINT32);
224 lrun.Priority = lc->pint32_val;
228 case 'f': /* FullPool */
229 case 'i': /* IncPool */
230 case 'd': /* DifPool */
231 token = lex_get_token(lc, T_NAME);
233 res = GetResWithName(R_POOL, lc->str);
235 scan_err1(lc, "Could not find specified Pool Resource: %s",
239 switch(RunFields[i].token) {
241 lrun.pool = (POOL *)res;
244 lrun.full_pool = (POOL *)res;
247 lrun.inc_pool = (POOL *)res;
250 lrun.dif_pool = (POOL *)res;
255 case 'S': /* storage */
256 token = lex_get_token(lc, T_NAME);
258 res = GetResWithName(R_STORAGE, lc->str);
260 scan_err1(lc, "Could not find specified Storage Resource: %s",
264 lrun.storage = (STORE *)res;
267 case 'M': /* messages */
268 token = lex_get_token(lc, T_NAME);
270 res = GetResWithName(R_MSGS, lc->str);
272 scan_err1(lc, "Could not find specified Messages Resource: %s",
276 lrun.msgs = (MSGS *)res;
280 scan_err1(lc, "Expected a keyword name, got: %s", lc->str);
284 } /* end if strcasecmp */
285 } /* end for RunFields */
287 /* At this point, it is not a keyword. Check for old syle
288 * Job Levels without keyword. This form is depreciated!!!
290 for (j=0; joblevels[j].level_name; j++) {
291 if (strcasecmp(lc->str, joblevels[j].level_name) == 0) {
292 lrun.level = joblevels[j].level;
293 lrun.job_type = joblevels[j].job_type;
298 } /* end for found */
302 * Scan schedule times.
303 * Default is: daily at 0:0
308 for ( ; token != T_EOL; (token = lex_get_token(lc, T_ALL))) {
313 code = atoi(lc->str) - 1;
314 if (code < 0 || code > 30) {
315 scan_err0(lc, _("Day number out of range (1-31)"));
318 case T_NAME: /* this handles drop through from keyword */
319 case T_UNQUOTED_STRING:
320 if (strchr(lc->str, (int)'-')) {
324 if (strchr(lc->str, (int)':')) {
328 if (lc->str_len == 3 && (lc->str[0] == 'w' || lc->str[0] == 'W') &&
329 is_an_integer(lc->str+1)) {
330 code = atoi(lc->str+1);
331 if (code < 0 || code > 53) {
332 scan_err0(lc, _("Week number out of range (0-53)"));
334 state = s_woy; /* week of year */
337 /* everything else must be a keyword */
338 for (i=0; keyw[i].name; i++) {
339 if (strcasecmp(lc->str, keyw[i].name) == 0) {
340 state = keyw[i].state;
347 scan_err1(lc, _("Job type field: %s in run record not found"), lc->str);
354 scan_err2(lc, _("Unexpected token: %d:%s"), token, lc->str);
361 case s_mday: /* day of month */
363 clear_bits(0, 30, lrun.mday);
364 clear_bits(0, 6, lrun.wday);
367 set_bit(code, lrun.mday);
369 case s_month: /* month of year */
371 clear_bits(0, 11, lrun.month);
374 set_bit(code, lrun.month);
376 case s_wday: /* week day */
378 clear_bits(0, 6, lrun.wday);
379 clear_bits(0, 30, lrun.mday);
382 set_bit(code, lrun.wday);
384 case s_wom: /* Week of month 1st, ... */
386 clear_bits(0, 4, lrun.wom);
389 set_bit(code, lrun.wom);
393 clear_bits(0, 53, lrun.woy);
396 set_bit(code, lrun.woy);
398 case s_time: /* time */
400 scan_err0(lc, _("Time must be preceded by keyword AT."));
404 clear_bit(0, lrun.hour);
406 p = strchr(lc->str, ':');
408 scan_err0(lc, _("Time logic error.\n"));
411 *p++ = 0; /* separate two halves */
412 code = atoi(lc->str);
414 if (len > 2 && p[len-1] == 'm') {
415 if (p[len-2] == 'a') {
417 } else if (p[len-2] == 'p') {
420 scan_err0(lc, _("Bad time specification."));
430 if (code < 0 || code > 23 || code2 < 0 || code2 > 59) {
431 scan_err0(lc, _("Bad time specification."));
434 /****FIXME**** convert to UTC */
435 set_bit(code, lrun.hour);
443 p = strchr(lc->str, '-');
445 scan_err0(lc, _("Range logic error.\n"));
447 *p++ = 0; /* separate two halves */
449 /* Check for day range */
450 if (is_an_integer(lc->str) && is_an_integer(p)) {
451 code = atoi(lc->str) - 1;
453 if (code < 0 || code > 30 || code2 < 0 || code2 > 30) {
454 scan_err0(lc, _("Bad day range specification."));
457 clear_bits(0, 30, lrun.mday);
458 clear_bits(0, 6, lrun.wday);
462 set_bits(code, code2, lrun.mday);
464 set_bits(code, 30, lrun.mday);
465 set_bits(0, code2, lrun.mday);
469 /* Check for week of year range */
470 if (strlen(lc->str) == 3 && strlen(p) == 3 &&
471 (lc->str[0] == 'w' || lc->str[0] == 'W') &&
472 (p[0] == 'w' || p[0] == 'W') &&
473 is_an_integer(lc->str+1) && is_an_integer(p+1)) {
474 code = atoi(lc->str+1);
476 if (code < 0 || code > 53 || code2 < 0 || code2 > 53) {
477 scan_err0(lc, _("Week number out of range (0-53)"));
480 clear_bits(0, 53, lrun.woy);
484 set_bits(code, code2, lrun.woy);
486 set_bits(code, 53, lrun.woy);
487 set_bits(0, code2, lrun.woy);
491 /* lookup first half of keyword range (week days or months) */
493 for (i=0; keyw[i].name; i++) {
494 if (strcmp(lc->str, keyw[i].name) == 0) {
495 state = keyw[i].state;
501 if (i != 0 || (state != s_month && state != s_wday && state != s_wom)) {
502 scan_err0(lc, _("Invalid month, week or position day range"));
506 /* Lookup end of range */
508 for (i=0; keyw[i].name; i++) {
509 if (strcmp(p, keyw[i].name) == 0) {
510 state2 = keyw[i].state;
511 code2 = keyw[i].code;
516 if (i != 0 || state != state2 || code == code2) {
517 scan_err0(lc, _("Invalid month, weekday or position range"));
520 if (state == s_wday) {
522 clear_bits(0, 6, lrun.wday);
523 clear_bits(0, 30, lrun.mday);
527 set_bits(code, code2, lrun.wday);
529 set_bits(code, 6, lrun.wday);
530 set_bits(0, code2, lrun.wday);
532 } else if (state == s_month) {
534 clear_bits(0, 30, lrun.month);
538 set_bits(code, code2, lrun.month);
540 /* this is a bit odd, but we accept it anyway */
541 set_bits(code, 30, lrun.month);
542 set_bits(0, code2, lrun.month);
545 /* Must be position */
547 clear_bits(0, 4, lrun.wom);
551 set_bits(code, code2, lrun.wom);
553 set_bits(code, 4, lrun.wom);
554 set_bits(0, code2, lrun.wom);
560 set_bits(0, 23, lrun.hour);
561 set_bits(0, 30, lrun.mday);
562 set_bits(0, 11, lrun.month);
563 set_bits(0, 4, lrun.wom);
564 set_bits(0, 53, lrun.woy);
568 set_bit(0, lrun.wday);
569 set_bits(0, 11, lrun.month);
570 set_bits(0, 4, lrun.wom);
571 set_bits(0, 53, lrun.woy);
575 set_bits(0, 30, lrun.mday);
576 set_bits(0, 11, lrun.month);
577 set_bits(0, 4, lrun.wom);
578 set_bits(0, 53, lrun.woy);
582 set_bits(0, 11, lrun.month);
583 set_bits(0, 4, lrun.wom);
584 set_bits(0, 53, lrun.woy);
587 scan_err0(lc, _("Unexpected run state\n"));
593 /* Allocate run record, copy new stuff into it,
594 * and link it into the list of run records
595 * in the schedule resource.
598 trun = (RUN *)malloc(sizeof(RUN));
599 memcpy(trun, &lrun, sizeof(RUN));
606 lc->options = options; /* restore scanner options */
607 set_bit(index, res_all.res_sch.hdr.item_present);