init_parser.c revision 50b3afd9f39619f69dc6f4efc29be88933eb3614
1/* 2 * Copyright (C) 2010 The Android Open Source Project 3 * 4 * Licensed under the Apache License, Version 2.0 (the "License"); 5 * you may not use this file except in compliance with the License. 6 * You may obtain a copy of the License at 7 * 8 * http://www.apache.org/licenses/LICENSE-2.0 9 * 10 * Unless required by applicable law or agreed to in writing, software 11 * distributed under the License is distributed on an "AS IS" BASIS, 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 * See the License for the specific language governing permissions and 14 * limitations under the License. 15 */ 16 17#include <stdio.h> 18#include <stdlib.h> 19#include <unistd.h> 20#include <fcntl.h> 21#include <stdarg.h> 22#include <string.h> 23#include <stddef.h> 24#include <ctype.h> 25 26#include "init.h" 27#include "parser.h" 28#include "init_parser.h" 29#include "log.h" 30#include "list.h" 31#include "property_service.h" 32#include "util.h" 33 34#include <cutils/iosched_policy.h> 35 36#define _REALLY_INCLUDE_SYS__SYSTEM_PROPERTIES_H_ 37#include <sys/_system_properties.h> 38 39static list_declare(service_list); 40static list_declare(action_list); 41static list_declare(action_queue); 42 43static void *parse_service(struct parse_state *state, int nargs, char **args); 44static void parse_line_service(struct parse_state *state, int nargs, char **args); 45 46static void *parse_action(struct parse_state *state, int nargs, char **args); 47static void parse_line_action(struct parse_state *state, int nargs, char **args); 48 49#define SECTION 0x01 50#define COMMAND 0x02 51#define OPTION 0x04 52 53#include "keywords.h" 54 55#define KEYWORD(symbol, flags, nargs, func) \ 56 [ K_##symbol ] = { #symbol, func, nargs + 1, flags, }, 57 58struct { 59 const char *name; 60 int (*func)(int nargs, char **args); 61 unsigned char nargs; 62 unsigned char flags; 63} keyword_info[KEYWORD_COUNT] = { 64 [ K_UNKNOWN ] = { "unknown", 0, 0, 0 }, 65#include "keywords.h" 66}; 67#undef KEYWORD 68 69#define kw_is(kw, type) (keyword_info[kw].flags & (type)) 70#define kw_name(kw) (keyword_info[kw].name) 71#define kw_func(kw) (keyword_info[kw].func) 72#define kw_nargs(kw) (keyword_info[kw].nargs) 73 74int lookup_keyword(const char *s) 75{ 76 switch (*s++) { 77 case 'c': 78 if (!strcmp(s, "opy")) return K_copy; 79 if (!strcmp(s, "apability")) return K_capability; 80 if (!strcmp(s, "hdir")) return K_chdir; 81 if (!strcmp(s, "hroot")) return K_chroot; 82 if (!strcmp(s, "lass")) return K_class; 83 if (!strcmp(s, "lass_start")) return K_class_start; 84 if (!strcmp(s, "lass_stop")) return K_class_stop; 85 if (!strcmp(s, "onsole")) return K_console; 86 if (!strcmp(s, "hown")) return K_chown; 87 if (!strcmp(s, "hmod")) return K_chmod; 88 if (!strcmp(s, "ritical")) return K_critical; 89 break; 90 case 'd': 91 if (!strcmp(s, "isabled")) return K_disabled; 92 if (!strcmp(s, "omainname")) return K_domainname; 93 break; 94 case 'e': 95 if (!strcmp(s, "xec")) return K_exec; 96 if (!strcmp(s, "xport")) return K_export; 97 break; 98 case 'g': 99 if (!strcmp(s, "roup")) return K_group; 100 break; 101 case 'h': 102 if (!strcmp(s, "ostname")) return K_hostname; 103 break; 104 case 'i': 105 if (!strcmp(s, "oprio")) return K_ioprio; 106 if (!strcmp(s, "fup")) return K_ifup; 107 if (!strcmp(s, "nsmod")) return K_insmod; 108 if (!strcmp(s, "mport")) return K_import; 109 break; 110 case 'k': 111 if (!strcmp(s, "eycodes")) return K_keycodes; 112 break; 113 case 'l': 114 if (!strcmp(s, "oglevel")) return K_loglevel; 115 break; 116 case 'm': 117 if (!strcmp(s, "kdir")) return K_mkdir; 118 if (!strcmp(s, "ount")) return K_mount; 119 break; 120 case 'o': 121 if (!strcmp(s, "n")) return K_on; 122 if (!strcmp(s, "neshot")) return K_oneshot; 123 if (!strcmp(s, "nrestart")) return K_onrestart; 124 break; 125 case 'r': 126 if (!strcmp(s, "estart")) return K_restart; 127 break; 128 case 's': 129 if (!strcmp(s, "ervice")) return K_service; 130 if (!strcmp(s, "etenv")) return K_setenv; 131 if (!strcmp(s, "etkey")) return K_setkey; 132 if (!strcmp(s, "etprop")) return K_setprop; 133 if (!strcmp(s, "etrlimit")) return K_setrlimit; 134 if (!strcmp(s, "low_start")) return K_slow_start; 135 if (!strcmp(s, "ocket")) return K_socket; 136 if (!strcmp(s, "tart")) return K_start; 137 if (!strcmp(s, "top")) return K_stop; 138 if (!strcmp(s, "ymlink")) return K_symlink; 139 if (!strcmp(s, "ysclktz")) return K_sysclktz; 140 break; 141 case 't': 142 if (!strcmp(s, "rigger")) return K_trigger; 143 break; 144 case 'u': 145 if (!strcmp(s, "ser")) return K_user; 146 break; 147 case 'w': 148 if (!strcmp(s, "rite")) return K_write; 149 if (!strcmp(s, "ait")) return K_wait; 150 break; 151 } 152 return K_UNKNOWN; 153} 154 155void parse_line_no_op(struct parse_state *state, int nargs, char **args) 156{ 157} 158 159void parse_new_section(struct parse_state *state, int kw, 160 int nargs, char **args) 161{ 162 printf("[ %s %s ]\n", args[0], 163 nargs > 1 ? args[1] : ""); 164 switch(kw) { 165 case K_service: 166 state->context = parse_service(state, nargs, args); 167 if (state->context) { 168 state->parse_line = parse_line_service; 169 return; 170 } 171 break; 172 case K_on: 173 state->context = parse_action(state, nargs, args); 174 if (state->context) { 175 state->parse_line = parse_line_action; 176 return; 177 } 178 break; 179 } 180 state->parse_line = parse_line_no_op; 181} 182 183static void parse_config(const char *fn, char *s) 184{ 185 struct parse_state state; 186 char *args[INIT_PARSER_MAXARGS]; 187 int nargs; 188 189 nargs = 0; 190 state.filename = fn; 191 state.line = 1; 192 state.ptr = s; 193 state.nexttoken = 0; 194 state.parse_line = parse_line_no_op; 195 for (;;) { 196 switch (next_token(&state)) { 197 case T_EOF: 198 state.parse_line(&state, 0, 0); 199 return; 200 case T_NEWLINE: 201 if (nargs) { 202 int kw = lookup_keyword(args[0]); 203 if (kw_is(kw, SECTION)) { 204 state.parse_line(&state, 0, 0); 205 parse_new_section(&state, kw, nargs, args); 206 } else { 207 state.parse_line(&state, nargs, args); 208 } 209 nargs = 0; 210 } 211 break; 212 case T_TEXT: 213 if (nargs < INIT_PARSER_MAXARGS) { 214 args[nargs++] = state.text; 215 } 216 break; 217 } 218 } 219} 220 221int init_parse_config_file(const char *fn) 222{ 223 char *data; 224 data = read_file(fn, 0); 225 if (!data) return -1; 226 227 parse_config(fn, data); 228 DUMP(); 229 return 0; 230} 231 232static int valid_name(const char *name) 233{ 234 if (strlen(name) > 16) { 235 return 0; 236 } 237 while (*name) { 238 if (!isalnum(*name) && (*name != '_') && (*name != '-')) { 239 return 0; 240 } 241 name++; 242 } 243 return 1; 244} 245 246struct service *service_find_by_name(const char *name) 247{ 248 struct listnode *node; 249 struct service *svc; 250 list_for_each(node, &service_list) { 251 svc = node_to_item(node, struct service, slist); 252 if (!strcmp(svc->name, name)) { 253 return svc; 254 } 255 } 256 return 0; 257} 258 259struct service *service_find_by_pid(pid_t pid) 260{ 261 struct listnode *node; 262 struct service *svc; 263 list_for_each(node, &service_list) { 264 svc = node_to_item(node, struct service, slist); 265 if (svc->pid == pid) { 266 return svc; 267 } 268 } 269 return 0; 270} 271 272struct service *service_find_by_keychord(int keychord_id) 273{ 274 struct listnode *node; 275 struct service *svc; 276 list_for_each(node, &service_list) { 277 svc = node_to_item(node, struct service, slist); 278 if (svc->keychord_id == keychord_id) { 279 return svc; 280 } 281 } 282 return 0; 283} 284 285void service_for_each(void (*func)(struct service *svc)) 286{ 287 struct listnode *node; 288 struct service *svc; 289 list_for_each(node, &service_list) { 290 svc = node_to_item(node, struct service, slist); 291 func(svc); 292 } 293} 294 295void service_for_each_class(const char *classname, 296 void (*func)(struct service *svc)) 297{ 298 struct listnode *node; 299 struct service *svc; 300 list_for_each(node, &service_list) { 301 svc = node_to_item(node, struct service, slist); 302 if (!strcmp(svc->classname, classname)) { 303 func(svc); 304 } 305 } 306} 307 308void service_for_each_flags(unsigned matchflags, 309 void (*func)(struct service *svc)) 310{ 311 struct listnode *node; 312 struct service *svc; 313 list_for_each(node, &service_list) { 314 svc = node_to_item(node, struct service, slist); 315 if (svc->flags & matchflags) { 316 func(svc); 317 } 318 } 319} 320 321void action_for_each_trigger(const char *trigger, 322 void (*func)(struct action *act)) 323{ 324 struct listnode *node; 325 struct action *act; 326 list_for_each(node, &action_list) { 327 act = node_to_item(node, struct action, alist); 328 if (!strcmp(act->name, trigger)) { 329 func(act); 330 } 331 } 332} 333 334void queue_property_triggers(const char *name, const char *value) 335{ 336 struct listnode *node; 337 struct action *act; 338 list_for_each(node, &action_list) { 339 act = node_to_item(node, struct action, alist); 340 if (!strncmp(act->name, "property:", strlen("property:"))) { 341 const char *test = act->name + strlen("property:"); 342 int name_length = strlen(name); 343 344 if (!strncmp(name, test, name_length) && 345 test[name_length] == '=' && 346 !strcmp(test + name_length + 1, value)) { 347 action_add_queue_tail(act); 348 } 349 } 350 } 351} 352 353void queue_all_property_triggers() 354{ 355 struct listnode *node; 356 struct action *act; 357 list_for_each(node, &action_list) { 358 act = node_to_item(node, struct action, alist); 359 if (!strncmp(act->name, "property:", strlen("property:"))) { 360 /* parse property name and value 361 syntax is property:<name>=<value> */ 362 const char* name = act->name + strlen("property:"); 363 const char* equals = strchr(name, '='); 364 if (equals) { 365 char prop_name[PROP_NAME_MAX + 1]; 366 const char* value; 367 int length = equals - name; 368 if (length > PROP_NAME_MAX) { 369 ERROR("property name too long in trigger %s", act->name); 370 } else { 371 memcpy(prop_name, name, length); 372 prop_name[length] = 0; 373 374 /* does the property exist, and match the trigger value? */ 375 value = property_get(prop_name); 376 if (value && !strcmp(equals + 1, value)) { 377 action_add_queue_tail(act); 378 } 379 } 380 } 381 } 382 } 383} 384 385void queue_builtin_action(int (*func)(int nargs, char **args), char *name) 386{ 387 struct action *act; 388 struct command *cmd; 389 390 act = calloc(1, sizeof(*act)); 391 act->name = name; 392 list_init(&act->commands); 393 394 cmd = calloc(1, sizeof(*cmd)); 395 cmd->func = func; 396 cmd->args[0] = name; 397 list_add_tail(&act->commands, &cmd->clist); 398 399 list_add_tail(&action_list, &act->alist); 400 action_add_queue_tail(act); 401} 402 403void action_add_queue_tail(struct action *act) 404{ 405 list_add_tail(&action_queue, &act->qlist); 406} 407 408struct action *action_remove_queue_head(void) 409{ 410 if (list_empty(&action_queue)) { 411 return 0; 412 } else { 413 struct listnode *node = list_head(&action_queue); 414 struct action *act = node_to_item(node, struct action, qlist); 415 list_remove(node); 416 return act; 417 } 418} 419 420int action_queue_empty() 421{ 422 return list_empty(&action_queue); 423} 424 425static void *parse_service(struct parse_state *state, int nargs, char **args) 426{ 427 struct service *svc; 428 if (nargs < 3) { 429 parse_error(state, "services must have a name and a program\n"); 430 return 0; 431 } 432 if (!valid_name(args[1])) { 433 parse_error(state, "invalid service name '%s'\n", args[1]); 434 return 0; 435 } 436 437 svc = service_find_by_name(args[1]); 438 if (svc) { 439 parse_error(state, "ignored duplicate definition of service '%s'\n", args[1]); 440 return 0; 441 } 442 443 nargs -= 2; 444 svc = calloc(1, sizeof(*svc) + sizeof(char*) * nargs); 445 if (!svc) { 446 parse_error(state, "out of memory\n"); 447 return 0; 448 } 449 svc->name = args[1]; 450 svc->classname = "default"; 451 memcpy(svc->args, args + 2, sizeof(char*) * nargs); 452 svc->args[nargs] = 0; 453 svc->nargs = nargs; 454 svc->onrestart.name = "onrestart"; 455 list_init(&svc->onrestart.commands); 456 list_add_tail(&service_list, &svc->slist); 457 return svc; 458} 459 460static void parse_line_service(struct parse_state *state, int nargs, char **args) 461{ 462 struct service *svc = state->context; 463 struct command *cmd; 464 int i, kw, kw_nargs; 465 466 if (nargs == 0) { 467 return; 468 } 469 470 svc->ioprio_class = IoSchedClass_NONE; 471 472 kw = lookup_keyword(args[0]); 473 switch (kw) { 474 case K_capability: 475 break; 476 case K_class: 477 if (nargs != 2) { 478 parse_error(state, "class option requires a classname\n"); 479 } else { 480 svc->classname = args[1]; 481 } 482 break; 483 case K_console: 484 svc->flags |= SVC_CONSOLE; 485 break; 486 case K_disabled: 487 svc->flags |= SVC_DISABLED; 488 break; 489 case K_ioprio: 490 if (nargs != 3) { 491 parse_error(state, "ioprio optin usage: ioprio <rt|be|idle> <ioprio 0-7>\n"); 492 } else { 493 svc->ioprio_pri = strtoul(args[2], 0, 8); 494 495 if (svc->ioprio_pri < 0 || svc->ioprio_pri > 7) { 496 parse_error(state, "priority value must be range 0 - 7\n"); 497 break; 498 } 499 500 if (!strcmp(args[1], "rt")) { 501 svc->ioprio_class = IoSchedClass_RT; 502 } else if (!strcmp(args[1], "be")) { 503 svc->ioprio_class = IoSchedClass_BE; 504 } else if (!strcmp(args[1], "idle")) { 505 svc->ioprio_class = IoSchedClass_IDLE; 506 } else { 507 parse_error(state, "ioprio option usage: ioprio <rt|be|idle> <0-7>\n"); 508 } 509 } 510 break; 511 case K_group: 512 if (nargs < 2) { 513 parse_error(state, "group option requires a group id\n"); 514 } else if (nargs > NR_SVC_SUPP_GIDS + 2) { 515 parse_error(state, "group option accepts at most %d supp. groups\n", 516 NR_SVC_SUPP_GIDS); 517 } else { 518 int n; 519 svc->gid = decode_uid(args[1]); 520 for (n = 2; n < nargs; n++) { 521 svc->supp_gids[n-2] = decode_uid(args[n]); 522 } 523 svc->nr_supp_gids = n - 2; 524 } 525 break; 526 case K_keycodes: 527 if (nargs < 2) { 528 parse_error(state, "keycodes option requires atleast one keycode\n"); 529 } else { 530 svc->keycodes = malloc((nargs - 1) * sizeof(svc->keycodes[0])); 531 if (!svc->keycodes) { 532 parse_error(state, "could not allocate keycodes\n"); 533 } else { 534 svc->nkeycodes = nargs - 1; 535 for (i = 1; i < nargs; i++) { 536 svc->keycodes[i - 1] = atoi(args[i]); 537 } 538 } 539 } 540 break; 541 case K_oneshot: 542 svc->flags |= SVC_ONESHOT; 543 break; 544 case K_onrestart: 545 nargs--; 546 args++; 547 kw = lookup_keyword(args[0]); 548 if (!kw_is(kw, COMMAND)) { 549 parse_error(state, "invalid command '%s'\n", args[0]); 550 break; 551 } 552 kw_nargs = kw_nargs(kw); 553 if (nargs < kw_nargs) { 554 parse_error(state, "%s requires %d %s\n", args[0], kw_nargs - 1, 555 kw_nargs > 2 ? "arguments" : "argument"); 556 break; 557 } 558 559 cmd = malloc(sizeof(*cmd) + sizeof(char*) * nargs); 560 cmd->func = kw_func(kw); 561 cmd->nargs = nargs; 562 memcpy(cmd->args, args, sizeof(char*) * nargs); 563 list_add_tail(&svc->onrestart.commands, &cmd->clist); 564 break; 565 case K_critical: 566 svc->flags |= SVC_CRITICAL; 567 break; 568 case K_slow_start: 569 svc->flags |= SVC_SLOW_START; 570 break; 571 case K_setenv: { /* name value */ 572 struct svcenvinfo *ei; 573 if (nargs < 2) { 574 parse_error(state, "setenv option requires name and value arguments\n"); 575 break; 576 } 577 ei = calloc(1, sizeof(*ei)); 578 if (!ei) { 579 parse_error(state, "out of memory\n"); 580 break; 581 } 582 ei->name = args[1]; 583 ei->value = args[2]; 584 ei->next = svc->envvars; 585 svc->envvars = ei; 586 break; 587 } 588 case K_socket: {/* name type perm [ uid gid ] */ 589 struct socketinfo *si; 590 if (nargs < 4) { 591 parse_error(state, "socket option requires name, type, perm arguments\n"); 592 break; 593 } 594 if (strcmp(args[2],"dgram") && strcmp(args[2],"stream") 595 && strcmp(args[2],"seqpacket")) { 596 parse_error(state, "socket type must be 'dgram', 'stream' or 'seqpacket'\n"); 597 break; 598 } 599 si = calloc(1, sizeof(*si)); 600 if (!si) { 601 parse_error(state, "out of memory\n"); 602 break; 603 } 604 si->name = args[1]; 605 si->type = args[2]; 606 si->perm = strtoul(args[3], 0, 8); 607 if (nargs > 4) 608 si->uid = decode_uid(args[4]); 609 if (nargs > 5) 610 si->gid = decode_uid(args[5]); 611 si->next = svc->sockets; 612 svc->sockets = si; 613 break; 614 } 615 case K_user: 616 if (nargs != 2) { 617 parse_error(state, "user option requires a user id\n"); 618 } else { 619 svc->uid = decode_uid(args[1]); 620 } 621 break; 622 default: 623 parse_error(state, "invalid option '%s'\n", args[0]); 624 } 625} 626 627static void *parse_action(struct parse_state *state, int nargs, char **args) 628{ 629 struct action *act; 630 if (nargs < 2) { 631 parse_error(state, "actions must have a trigger\n"); 632 return 0; 633 } 634 if (nargs > 2) { 635 parse_error(state, "actions may not have extra parameters\n"); 636 return 0; 637 } 638 act = calloc(1, sizeof(*act)); 639 act->name = args[1]; 640 list_init(&act->commands); 641 list_add_tail(&action_list, &act->alist); 642 /* XXX add to hash */ 643 return act; 644} 645 646static void parse_line_action(struct parse_state* state, int nargs, char **args) 647{ 648 struct command *cmd; 649 struct action *act = state->context; 650 int (*func)(int nargs, char **args); 651 int kw, n; 652 653 if (nargs == 0) { 654 return; 655 } 656 657 kw = lookup_keyword(args[0]); 658 if (!kw_is(kw, COMMAND)) { 659 parse_error(state, "invalid command '%s'\n", args[0]); 660 return; 661 } 662 663 n = kw_nargs(kw); 664 if (nargs < n) { 665 parse_error(state, "%s requires %d %s\n", args[0], n - 1, 666 n > 2 ? "arguments" : "argument"); 667 return; 668 } 669 cmd = malloc(sizeof(*cmd) + sizeof(char*) * nargs); 670 cmd->func = kw_func(kw); 671 cmd->nargs = nargs; 672 memcpy(cmd->args, args, sizeof(char*) * nargs); 673 list_add_tail(&act->commands, &cmd->clist); 674} 675