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_wpos, /* 1st, 2nd, ...*/
54 char *name; /* keyword */
55 enum e_state state; /* parser state */
56 int code; /* state value */
59 /* Keywords understood by parser */
60 static struct s_keyw keyw[] = {
61 {N_("on"), s_none, 0},
64 {N_("sun"), s_wday, 0},
65 {N_("mon"), s_wday, 1},
66 {N_("tue"), s_wday, 2},
67 {N_("wed"), s_wday, 3},
68 {N_("thu"), s_wday, 4},
69 {N_("fri"), s_wday, 5},
70 {N_("sat"), s_wday, 6},
71 {N_("jan"), s_month, 0},
72 {N_("feb"), s_month, 1},
73 {N_("mar"), s_month, 2},
74 {N_("apr"), s_month, 3},
75 {N_("may"), s_month, 4},
76 {N_("jun"), s_month, 5},
77 {N_("jul"), s_month, 6},
78 {N_("aug"), s_month, 7},
79 {N_("sep"), s_month, 8},
80 {N_("oct"), s_month, 9},
81 {N_("nov"), s_month, 10},
82 {N_("dec"), s_month, 11},
84 {N_("sunday"), s_wday, 0},
85 {N_("monday"), s_wday, 1},
86 {N_("tuesday"), s_wday, 2},
87 {N_("wednesday"), s_wday, 3},
88 {N_("thursday"), s_wday, 4},
89 {N_("friday"), s_wday, 5},
90 {N_("saturday"), s_wday, 6},
91 {N_("january"), s_month, 0},
92 {N_("february"), s_month, 1},
93 {N_("march"), s_month, 2},
94 {N_("april"), s_month, 3},
95 {N_("june"), s_month, 5},
96 {N_("july"), s_month, 6},
97 {N_("august"), s_month, 7},
98 {N_("september"), s_month, 8},
99 {N_("october"), s_month, 9},
100 {N_("november"), s_month, 10},
101 {N_("december"), s_month, 11},
103 {N_("daily"), s_daily, 0},
104 {N_("weekly"), s_weekly, 0},
105 {N_("monthly"), s_monthly, 0},
106 {N_("hourly"), s_hourly, 0},
108 {N_("1st"), s_wpos, 0},
109 {N_("2nd"), s_wpos, 1},
110 {N_("3rd"), s_wpos, 2},
111 {N_("4th"), s_wpos, 3},
112 {N_("5th"), s_wpos, 4},
114 {N_("first"), s_wpos, 0},
115 {N_("second"), s_wpos, 1},
116 {N_("third"), s_wpos, 2},
117 {N_("fourth"), s_wpos, 3},
118 {N_("fifth"), s_wpos, 4},
122 static int have_hour, have_mday, have_wday, have_month, have_wpos;
126 static void clear_defaults()
128 have_hour = have_mday = have_wday = have_month = have_wpos = TRUE;
129 clear_bit(0,lrun.hour);
130 clear_bits(0, 30, lrun.mday);
131 clear_bits(0, 6, lrun.wday);
132 clear_bits(0, 11, lrun.month);
133 clear_bits(0, 4, lrun.wpos);
136 static void set_defaults()
138 have_hour = have_mday = have_wday = have_month = have_wpos = FALSE;
140 set_bit(0,lrun.hour);
141 set_bits(0, 30, lrun.mday);
142 set_bits(0, 6, lrun.wday);
143 set_bits(0, 11, lrun.month);
144 set_bits(0, 4, lrun.wpos);
148 /* Keywords (RHS) permitted in Run records */
149 static struct s_kw RunFields[] = {
159 * Store Schedule Run information
161 * Parse Run statement:
163 * Run <keyword=value ...> [on] 2 january at 23:45
165 * Default Run time is daily at 0:0
167 * There can be multiple run statements, they are simply chained
171 void store_run(LEX *lc, struct res_items *item, int index, int pass)
174 int token, state, state2 = 0, code = 0, code2 = 0;
175 int options = lc->options;
176 RUN **run = (RUN **)(item->value);
182 lc->options |= LOPT_NO_IDENT; /* want only "strings" */
184 /* clear local copy of run record */
185 memset(&lrun, 0, sizeof(RUN));
187 /* scan for Job level "full", "incremental", ... */
188 for (found=TRUE; found; ) {
190 token = lex_get_token(lc, T_NAME);
191 for (i=0; RunFields[i].name; i++) {
192 if (strcasecmp(lc->str, RunFields[i].name) == 0) {
194 if (lex_get_token(lc, T_ALL) != T_EQUALS) {
195 scan_err1(lc, "Expected an equals, got: %s", lc->str);
198 switch (RunFields[i].token) {
199 case 'L': /* level */
200 token = lex_get_token(lc, T_NAME);
201 for (j=0; joblevels[j].level_name; j++) {
202 if (strcasecmp(lc->str, joblevels[j].level_name) == 0) {
203 lrun.level = joblevels[j].level;
204 lrun.job_type = joblevels[j].job_type;
210 scan_err1(lc, _("Job level field: %s not found in run record"), lc->str);
214 case 'p': /* Priority */
215 token = lex_get_token(lc, T_PINT32);
217 lrun.Priority = lc->pint32_val;
221 token = lex_get_token(lc, T_NAME);
223 res = GetResWithName(R_POOL, lc->str);
225 scan_err1(lc, "Could not find specified Pool Resource: %s",
229 lrun.pool = (POOL *)res;
232 case 'S': /* storage */
233 token = lex_get_token(lc, T_NAME);
235 res = GetResWithName(R_STORAGE, lc->str);
237 scan_err1(lc, "Could not find specified Storage Resource: %s",
241 lrun.storage = (STORE *)res;
244 case 'M': /* messages */
245 token = lex_get_token(lc, T_NAME);
247 res = GetResWithName(R_MSGS, lc->str);
249 scan_err1(lc, "Could not find specified Messages Resource: %s",
253 lrun.msgs = (MSGS *)res;
257 scan_err1(lc, "Expected a keyword name, got: %s", lc->str);
261 } /* end if strcasecmp */
262 } /* end for RunFields */
264 /* At this point, it is not a keyword. Check for old syle
265 * Job Levels without keyword. This form is depreciated!!!
267 for (j=0; joblevels[j].level_name; j++) {
268 if (strcasecmp(lc->str, joblevels[j].level_name) == 0) {
269 lrun.level = joblevels[j].level;
270 lrun.job_type = joblevels[j].job_type;
275 } /* end for found */
279 * Scan schedule times.
280 * Default is: daily at 0:0
285 for ( ; token != T_EOL; (token = lex_get_token(lc, T_ALL))) {
290 code = atoi(lc->str) - 1;
291 if (code < 0 || code > 30) {
292 scan_err0(lc, _("Day number out of range (1-31)"));
295 case T_NAME: /* this handles drop through from keyword */
296 case T_UNQUOTED_STRING:
297 if (strchr(lc->str, (int)'-')) {
301 if (strchr(lc->str, (int)':')) {
305 /* everything else must be a keyword */
306 for (i=0; keyw[i].name; i++) {
307 if (strcasecmp(lc->str, keyw[i].name) == 0) {
308 state = keyw[i].state;
315 scan_err1(lc, _("Job type field: %s in run record not found"), lc->str);
322 scan_err2(lc, _("Unexpected token: %d:%s"), token, lc->str);
329 case s_mday: /* day of month */
331 clear_bits(0, 30, lrun.mday);
332 clear_bits(0, 6, lrun.wday);
335 set_bit(code, lrun.mday);
337 case s_month: /* month of year */
339 clear_bits(0, 11, lrun.month);
342 set_bit(code, lrun.month);
344 case s_wday: /* week day */
346 clear_bits(0, 6, lrun.wday);
347 clear_bits(0, 30, lrun.mday);
350 set_bit(code, lrun.wday);
352 case s_wpos: /* Week position 1st, ... */
354 clear_bits(0, 4, lrun.wpos);
357 set_bit(code, lrun.wpos);
359 case s_time: /* time */
361 scan_err0(lc, _("Time must be preceded by keyword AT."));
365 clear_bit(0, lrun.hour);
367 p = strchr(lc->str, ':');
369 scan_err0(lc, _("Time logic error.\n"));
372 *p++ = 0; /* separate two halves */
373 code = atoi(lc->str);
375 if (len > 2 && p[len-1] == 'm') {
376 if (p[len-2] == 'a') {
378 } else if (p[len-2] == 'p') {
381 scan_err0(lc, _("Bad time specification."));
391 if (code < 0 || code > 23 || code2 < 0 || code2 > 59) {
392 scan_err0(lc, _("Bad time specification."));
395 set_bit(code, lrun.hour);
403 p = strchr(lc->str, '-');
405 scan_err0(lc, _("Range logic error.\n"));
407 *p++ = 0; /* separate two halves */
409 /* Check for day range */
410 if (is_an_integer(lc->str) && is_an_integer(p)) {
411 code = atoi(lc->str) - 1;
413 if (code < 0 || code > 30 || code2 < 0 || code2 > 30) {
414 scan_err0(lc, _("Bad day range specification."));
417 clear_bits(0, 30, lrun.mday);
418 clear_bits(0, 6, lrun.wday);
422 set_bits(code, code2, lrun.mday);
424 set_bits(code, 30, lrun.mday);
425 set_bits(0, code2, lrun.mday);
430 /* lookup first half of keyword range (week days or months) */
432 for (i=0; keyw[i].name; i++) {
433 if (strcmp(lc->str, keyw[i].name) == 0) {
434 state = keyw[i].state;
440 if (i != 0 || (state != s_month && state != s_wday && state != s_wpos)) {
441 scan_err0(lc, _("Invalid month, week or position day range"));
445 /* Lookup end of range */
447 for (i=0; keyw[i].name; i++) {
448 if (strcmp(p, keyw[i].name) == 0) {
449 state2 = keyw[i].state;
450 code2 = keyw[i].code;
455 if (i != 0 || state != state2 || code == code2) {
456 scan_err0(lc, _("Invalid month, weekday or position range"));
459 if (state == s_wday) {
461 clear_bits(0, 6, lrun.wday);
462 clear_bits(0, 30, lrun.mday);
466 set_bits(code, code2, lrun.wday);
468 set_bits(code, 6, lrun.wday);
469 set_bits(0, code2, lrun.wday);
471 } else if (state == s_month) {
473 clear_bits(0, 30, lrun.month);
477 set_bits(code, code2, lrun.month);
479 /* this is a bit odd, but we accept it anyway */
480 set_bits(code, 30, lrun.month);
481 set_bits(0, code2, lrun.month);
484 /* Must be position */
486 clear_bits(0, 4, lrun.wpos);
490 set_bits(code, code2, lrun.wpos);
492 set_bits(code, 4, lrun.wpos);
493 set_bits(0, code2, lrun.wpos);
499 set_bits(0, 23, lrun.hour);
500 set_bits(0, 30, lrun.mday);
501 set_bits(0, 11, lrun.month);
502 set_bits(0, 4, lrun.wpos);
506 set_bit(0, lrun.wday);
507 set_bits(0, 11, lrun.month);
508 set_bits(0, 4, lrun.wpos);
512 set_bits(0, 30, lrun.mday);
513 set_bits(0, 11, lrun.month);
514 set_bits(0, 4, lrun.wpos);
518 set_bits(0, 11, lrun.month);
519 set_bits(0, 4, lrun.wpos);
522 scan_err0(lc, _("Unexpected run state\n"));
528 /* Allocate run record, copy new stuff into it,
529 * and link it into the list of run records
530 * in the schedule resource.
533 trun = (RUN *)malloc(sizeof(RUN));
534 memcpy(trun, &lrun, sizeof(RUN));
541 lc->options = options; /* restore scanner options */
542 set_bit(index, res_all.res_sch.hdr.item_present);