init_parser.c revision 203bad597fb4e46ddda051add28400070b5c3a5a
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, "lass_reset")) return K_class_reset; 86 if (!strcmp(s, "onsole")) return K_console; 87 if (!strcmp(s, "hown")) return K_chown; 88 if (!strcmp(s, "hmod")) return K_chmod; 89 if (!strcmp(s, "ritical")) return K_critical; 90 break; 91 case 'd': 92 if (!strcmp(s, "isabled")) return K_disabled; 93 if (!strcmp(s, "omainname")) return K_domainname; 94 break; 95 case 'e': 96 if (!strcmp(s, "xec")) return K_exec; 97 if (!strcmp(s, "xport")) return K_export; 98 break; 99 case 'g': 100 if (!strcmp(s, "roup")) return K_group; 101 break; 102 case 'h': 103 if (!strcmp(s, "ostname")) return K_hostname; 104 break; 105 case 'i': 106 if (!strcmp(s, "oprio")) return K_ioprio; 107 if (!strcmp(s, "fup")) return K_ifup; 108 if (!strcmp(s, "nsmod")) return K_insmod; 109 if (!strcmp(s, "mport")) return K_import; 110 break; 111 case 'k': 112 if (!strcmp(s, "eycodes")) return K_keycodes; 113 break; 114 case 'l': 115 if (!strcmp(s, "oglevel")) return K_loglevel; 116 break; 117 case 'm': 118 if (!strcmp(s, "kdir")) return K_mkdir; 119 if (!strcmp(s, "ount")) return K_mount; 120 break; 121 case 'o': 122 if (!strcmp(s, "n")) return K_on; 123 if (!strcmp(s, "neshot")) return K_oneshot; 124 if (!strcmp(s, "nrestart")) return K_onrestart; 125 break; 126 case 'r': 127 if (!strcmp(s, "estart")) return K_restart; 128 if (!strcmp(s, "mdir")) return K_rmdir; 129 if (!strcmp(s, "m")) return K_rm; 130 break; 131 case 's': 132 if (!strcmp(s, "ervice")) return K_service; 133 if (!strcmp(s, "etenv")) return K_setenv; 134 if (!strcmp(s, "etkey")) return K_setkey; 135 if (!strcmp(s, "etprop")) return K_setprop; 136 if (!strcmp(s, "etrlimit")) return K_setrlimit; 137 if (!strcmp(s, "ocket")) return K_socket; 138 if (!strcmp(s, "tart")) return K_start; 139 if (!strcmp(s, "top")) return K_stop; 140 if (!strcmp(s, "ymlink")) return K_symlink; 141 if (!strcmp(s, "ysclktz")) return K_sysclktz; 142 break; 143 case 't': 144 if (!strcmp(s, "rigger")) return K_trigger; 145 break; 146 case 'u': 147 if (!strcmp(s, "ser")) return K_user; 148 break; 149 case 'w': 150 if (!strcmp(s, "rite")) return K_write; 151 if (!strcmp(s, "ait")) return K_wait; 152 break; 153 } 154 return K_UNKNOWN; 155} 156 157void parse_line_no_op(struct parse_state *state, int nargs, char **args) 158{ 159} 160 161void parse_new_section(struct parse_state *state, int kw, 162 int nargs, char **args) 163{ 164 printf("[ %s %s ]\n", args[0], 165 nargs > 1 ? args[1] : ""); 166 switch(kw) { 167 case K_service: 168 state->context = parse_service(state, nargs, args); 169 if (state->context) { 170 state->parse_line = parse_line_service; 171 return; 172 } 173 break; 174 case K_on: 175 state->context = parse_action(state, nargs, args); 176 if (state->context) { 177 state->parse_line = parse_line_action; 178 return; 179 } 180 break; 181 } 182 state->parse_line = parse_line_no_op; 183} 184 185static void parse_config(const char *fn, char *s) 186{ 187 struct parse_state state; 188 char *args[INIT_PARSER_MAXARGS]; 189 int nargs; 190 191 nargs = 0; 192 state.filename = fn; 193 state.line = 0; 194 state.ptr = s; 195 state.nexttoken = 0; 196 state.parse_line = parse_line_no_op; 197 for (;;) { 198 switch (next_token(&state)) { 199 case T_EOF: 200 state.parse_line(&state, 0, 0); 201 return; 202 case T_NEWLINE: 203 state.line++; 204 if (nargs) { 205 int kw = lookup_keyword(args[0]); 206 if (kw_is(kw, SECTION)) { 207 state.parse_line(&state, 0, 0); 208 parse_new_section(&state, kw, nargs, args); 209 } else { 210 state.parse_line(&state, nargs, args); 211 } 212 nargs = 0; 213 } 214 break; 215 case T_TEXT: 216 if (nargs < INIT_PARSER_MAXARGS) { 217 args[nargs++] = state.text; 218 } 219 break; 220 } 221 } 222} 223 224int init_parse_config_file(const char *fn) 225{ 226 char *data; 227 data = read_file(fn, 0); 228 if (!data) return -1; 229 230 parse_config(fn, data); 231 DUMP(); 232 return 0; 233} 234 235static int valid_name(const char *name) 236{ 237 if (strlen(name) > 16) { 238 return 0; 239 } 240 while (*name) { 241 if (!isalnum(*name) && (*name != '_') && (*name != '-')) { 242 return 0; 243 } 244 name++; 245 } 246 return 1; 247} 248 249struct service *service_find_by_name(const char *name) 250{ 251 struct listnode *node; 252 struct service *svc; 253 list_for_each(node, &service_list) { 254 svc = node_to_item(node, struct service, slist); 255 if (!strcmp(svc->name, name)) { 256 return svc; 257 } 258 } 259 return 0; 260} 261 262struct service *service_find_by_pid(pid_t pid) 263{ 264 struct listnode *node; 265 struct service *svc; 266 list_for_each(node, &service_list) { 267 svc = node_to_item(node, struct service, slist); 268 if (svc->pid == pid) { 269 return svc; 270 } 271 } 272 return 0; 273} 274 275struct service *service_find_by_keychord(int keychord_id) 276{ 277 struct listnode *node; 278 struct service *svc; 279 list_for_each(node, &service_list) { 280 svc = node_to_item(node, struct service, slist); 281 if (svc->keychord_id == keychord_id) { 282 return svc; 283 } 284 } 285 return 0; 286} 287 288void service_for_each(void (*func)(struct service *svc)) 289{ 290 struct listnode *node; 291 struct service *svc; 292 list_for_each(node, &service_list) { 293 svc = node_to_item(node, struct service, slist); 294 func(svc); 295 } 296} 297 298void service_for_each_class(const char *classname, 299 void (*func)(struct service *svc)) 300{ 301 struct listnode *node; 302 struct service *svc; 303 list_for_each(node, &service_list) { 304 svc = node_to_item(node, struct service, slist); 305 if (!strcmp(svc->classname, classname)) { 306 func(svc); 307 } 308 } 309} 310 311void service_for_each_flags(unsigned matchflags, 312 void (*func)(struct service *svc)) 313{ 314 struct listnode *node; 315 struct service *svc; 316 list_for_each(node, &service_list) { 317 svc = node_to_item(node, struct service, slist); 318 if (svc->flags & matchflags) { 319 func(svc); 320 } 321 } 322} 323 324void action_for_each_trigger(const char *trigger, 325 void (*func)(struct action *act)) 326{ 327 struct listnode *node; 328 struct action *act; 329 list_for_each(node, &action_list) { 330 act = node_to_item(node, struct action, alist); 331 if (!strcmp(act->name, trigger)) { 332 func(act); 333 } 334 } 335} 336 337void queue_property_triggers(const char *name, const char *value) 338{ 339 struct listnode *node; 340 struct action *act; 341 list_for_each(node, &action_list) { 342 act = node_to_item(node, struct action, alist); 343 if (!strncmp(act->name, "property:", strlen("property:"))) { 344 const char *test = act->name + strlen("property:"); 345 int name_length = strlen(name); 346 347 if (!strncmp(name, test, name_length) && 348 test[name_length] == '=' && 349 !strcmp(test + name_length + 1, value)) { 350 action_add_queue_tail(act); 351 } 352 } 353 } 354} 355 356void queue_all_property_triggers() 357{ 358 struct listnode *node; 359 struct action *act; 360 list_for_each(node, &action_list) { 361 act = node_to_item(node, struct action, alist); 362 if (!strncmp(act->name, "property:", strlen("property:"))) { 363 /* parse property name and value 364 syntax is property:<name>=<value> */ 365 const char* name = act->name + strlen("property:"); 366 const char* equals = strchr(name, '='); 367 if (equals) { 368 char prop_name[PROP_NAME_MAX + 1]; 369 const char* value; 370 int length = equals - name; 371 if (length > PROP_NAME_MAX) { 372 ERROR("property name too long in trigger %s", act->name); 373 } else { 374 memcpy(prop_name, name, length); 375 prop_name[length] = 0; 376 377 /* does the property exist, and match the trigger value? */ 378 value = property_get(prop_name); 379 if (value && !strcmp(equals + 1, value)) { 380 action_add_queue_tail(act); 381 } 382 } 383 } 384 } 385 } 386} 387 388void queue_builtin_action(int (*func)(int nargs, char **args), char *name) 389{ 390 struct action *act; 391 struct command *cmd; 392 393 act = calloc(1, sizeof(*act)); 394 act->name = name; 395 list_init(&act->commands); 396 397 cmd = calloc(1, sizeof(*cmd)); 398 cmd->func = func; 399 cmd->args[0] = name; 400 list_add_tail(&act->commands, &cmd->clist); 401 402 list_add_tail(&action_list, &act->alist); 403 action_add_queue_tail(act); 404} 405 406void action_add_queue_tail(struct action *act) 407{ 408 list_add_tail(&action_queue, &act->qlist); 409} 410 411struct action *action_remove_queue_head(void) 412{ 413 if (list_empty(&action_queue)) { 414 return 0; 415 } else { 416 struct listnode *node = list_head(&action_queue); 417 struct action *act = node_to_item(node, struct action, qlist); 418 list_remove(node); 419 return act; 420 } 421} 422 423int action_queue_empty() 424{ 425 return list_empty(&action_queue); 426} 427 428static void *parse_service(struct parse_state *state, int nargs, char **args) 429{ 430 struct service *svc; 431 if (nargs < 3) { 432 parse_error(state, "services must have a name and a program\n"); 433 return 0; 434 } 435 if (!valid_name(args[1])) { 436 parse_error(state, "invalid service name '%s'\n", args[1]); 437 return 0; 438 } 439 440 svc = service_find_by_name(args[1]); 441 if (svc) { 442 parse_error(state, "ignored duplicate definition of service '%s'\n", args[1]); 443 return 0; 444 } 445 446 nargs -= 2; 447 svc = calloc(1, sizeof(*svc) + sizeof(char*) * nargs); 448 if (!svc) { 449 parse_error(state, "out of memory\n"); 450 return 0; 451 } 452 svc->name = args[1]; 453 svc->classname = "default"; 454 memcpy(svc->args, args + 2, sizeof(char*) * nargs); 455 svc->args[nargs] = 0; 456 svc->nargs = nargs; 457 svc->onrestart.name = "onrestart"; 458 list_init(&svc->onrestart.commands); 459 list_add_tail(&service_list, &svc->slist); 460 return svc; 461} 462 463static void parse_line_service(struct parse_state *state, int nargs, char **args) 464{ 465 struct service *svc = state->context; 466 struct command *cmd; 467 int i, kw, kw_nargs; 468 469 if (nargs == 0) { 470 return; 471 } 472 473 svc->ioprio_class = IoSchedClass_NONE; 474 475 kw = lookup_keyword(args[0]); 476 switch (kw) { 477 case K_capability: 478 break; 479 case K_class: 480 if (nargs != 2) { 481 parse_error(state, "class option requires a classname\n"); 482 } else { 483 svc->classname = args[1]; 484 } 485 break; 486 case K_console: 487 svc->flags |= SVC_CONSOLE; 488 break; 489 case K_disabled: 490 svc->flags |= SVC_DISABLED; 491 break; 492 case K_ioprio: 493 if (nargs != 3) { 494 parse_error(state, "ioprio optin usage: ioprio <rt|be|idle> <ioprio 0-7>\n"); 495 } else { 496 svc->ioprio_pri = strtoul(args[2], 0, 8); 497 498 if (svc->ioprio_pri < 0 || svc->ioprio_pri > 7) { 499 parse_error(state, "priority value must be range 0 - 7\n"); 500 break; 501 } 502 503 if (!strcmp(args[1], "rt")) { 504 svc->ioprio_class = IoSchedClass_RT; 505 } else if (!strcmp(args[1], "be")) { 506 svc->ioprio_class = IoSchedClass_BE; 507 } else if (!strcmp(args[1], "idle")) { 508 svc->ioprio_class = IoSchedClass_IDLE; 509 } else { 510 parse_error(state, "ioprio option usage: ioprio <rt|be|idle> <0-7>\n"); 511 } 512 } 513 break; 514 case K_group: 515 if (nargs < 2) { 516 parse_error(state, "group option requires a group id\n"); 517 } else if (nargs > NR_SVC_SUPP_GIDS + 2) { 518 parse_error(state, "group option accepts at most %d supp. groups\n", 519 NR_SVC_SUPP_GIDS); 520 } else { 521 int n; 522 svc->gid = decode_uid(args[1]); 523 for (n = 2; n < nargs; n++) { 524 svc->supp_gids[n-2] = decode_uid(args[n]); 525 } 526 svc->nr_supp_gids = n - 2; 527 } 528 break; 529 case K_keycodes: 530 if (nargs < 2) { 531 parse_error(state, "keycodes option requires atleast one keycode\n"); 532 } else { 533 svc->keycodes = malloc((nargs - 1) * sizeof(svc->keycodes[0])); 534 if (!svc->keycodes) { 535 parse_error(state, "could not allocate keycodes\n"); 536 } else { 537 svc->nkeycodes = nargs - 1; 538 for (i = 1; i < nargs; i++) { 539 svc->keycodes[i - 1] = atoi(args[i]); 540 } 541 } 542 } 543 break; 544 case K_oneshot: 545 svc->flags |= SVC_ONESHOT; 546 break; 547 case K_onrestart: 548 nargs--; 549 args++; 550 kw = lookup_keyword(args[0]); 551 if (!kw_is(kw, COMMAND)) { 552 parse_error(state, "invalid command '%s'\n", args[0]); 553 break; 554 } 555 kw_nargs = kw_nargs(kw); 556 if (nargs < kw_nargs) { 557 parse_error(state, "%s requires %d %s\n", args[0], kw_nargs - 1, 558 kw_nargs > 2 ? "arguments" : "argument"); 559 break; 560 } 561 562 cmd = malloc(sizeof(*cmd) + sizeof(char*) * nargs); 563 cmd->func = kw_func(kw); 564 cmd->nargs = nargs; 565 memcpy(cmd->args, args, sizeof(char*) * nargs); 566 list_add_tail(&svc->onrestart.commands, &cmd->clist); 567 break; 568 case K_critical: 569 svc->flags |= SVC_CRITICAL; 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