init_parser.c revision 1be6968d9d51f43fdb00535708a6fed0be6bfbca
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 break; 129 case 's': 130 if (!strcmp(s, "ervice")) return K_service; 131 if (!strcmp(s, "etenv")) return K_setenv; 132 if (!strcmp(s, "etkey")) return K_setkey; 133 if (!strcmp(s, "etprop")) return K_setprop; 134 if (!strcmp(s, "etrlimit")) return K_setrlimit; 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 = 0; 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 state.line++; 202 if (nargs) { 203 int kw = lookup_keyword(args[0]); 204 if (kw_is(kw, SECTION)) { 205 state.parse_line(&state, 0, 0); 206 parse_new_section(&state, kw, nargs, args); 207 } else { 208 state.parse_line(&state, nargs, args); 209 } 210 nargs = 0; 211 } 212 break; 213 case T_TEXT: 214 if (nargs < INIT_PARSER_MAXARGS) { 215 args[nargs++] = state.text; 216 } 217 break; 218 } 219 } 220} 221 222int init_parse_config_file(const char *fn) 223{ 224 char *data; 225 data = read_file(fn, 0); 226 if (!data) return -1; 227 228 parse_config(fn, data); 229 DUMP(); 230 return 0; 231} 232 233static int valid_name(const char *name) 234{ 235 if (strlen(name) > 16) { 236 return 0; 237 } 238 while (*name) { 239 if (!isalnum(*name) && (*name != '_') && (*name != '-')) { 240 return 0; 241 } 242 name++; 243 } 244 return 1; 245} 246 247struct service *service_find_by_name(const char *name) 248{ 249 struct listnode *node; 250 struct service *svc; 251 list_for_each(node, &service_list) { 252 svc = node_to_item(node, struct service, slist); 253 if (!strcmp(svc->name, name)) { 254 return svc; 255 } 256 } 257 return 0; 258} 259 260struct service *service_find_by_pid(pid_t pid) 261{ 262 struct listnode *node; 263 struct service *svc; 264 list_for_each(node, &service_list) { 265 svc = node_to_item(node, struct service, slist); 266 if (svc->pid == pid) { 267 return svc; 268 } 269 } 270 return 0; 271} 272 273struct service *service_find_by_keychord(int keychord_id) 274{ 275 struct listnode *node; 276 struct service *svc; 277 list_for_each(node, &service_list) { 278 svc = node_to_item(node, struct service, slist); 279 if (svc->keychord_id == keychord_id) { 280 return svc; 281 } 282 } 283 return 0; 284} 285 286void service_for_each(void (*func)(struct service *svc)) 287{ 288 struct listnode *node; 289 struct service *svc; 290 list_for_each(node, &service_list) { 291 svc = node_to_item(node, struct service, slist); 292 func(svc); 293 } 294} 295 296void service_for_each_class(const char *classname, 297 void (*func)(struct service *svc)) 298{ 299 struct listnode *node; 300 struct service *svc; 301 list_for_each(node, &service_list) { 302 svc = node_to_item(node, struct service, slist); 303 if (!strcmp(svc->classname, classname)) { 304 func(svc); 305 } 306 } 307} 308 309void service_for_each_flags(unsigned matchflags, 310 void (*func)(struct service *svc)) 311{ 312 struct listnode *node; 313 struct service *svc; 314 list_for_each(node, &service_list) { 315 svc = node_to_item(node, struct service, slist); 316 if (svc->flags & matchflags) { 317 func(svc); 318 } 319 } 320} 321 322void action_for_each_trigger(const char *trigger, 323 void (*func)(struct action *act)) 324{ 325 struct listnode *node; 326 struct action *act; 327 list_for_each(node, &action_list) { 328 act = node_to_item(node, struct action, alist); 329 if (!strcmp(act->name, trigger)) { 330 func(act); 331 } 332 } 333} 334 335void queue_property_triggers(const char *name, const char *value) 336{ 337 struct listnode *node; 338 struct action *act; 339 list_for_each(node, &action_list) { 340 act = node_to_item(node, struct action, alist); 341 if (!strncmp(act->name, "property:", strlen("property:"))) { 342 const char *test = act->name + strlen("property:"); 343 int name_length = strlen(name); 344 345 if (!strncmp(name, test, name_length) && 346 test[name_length] == '=' && 347 !strcmp(test + name_length + 1, value)) { 348 action_add_queue_tail(act); 349 } 350 } 351 } 352} 353 354void queue_all_property_triggers() 355{ 356 struct listnode *node; 357 struct action *act; 358 list_for_each(node, &action_list) { 359 act = node_to_item(node, struct action, alist); 360 if (!strncmp(act->name, "property:", strlen("property:"))) { 361 /* parse property name and value 362 syntax is property:<name>=<value> */ 363 const char* name = act->name + strlen("property:"); 364 const char* equals = strchr(name, '='); 365 if (equals) { 366 char prop_name[PROP_NAME_MAX + 1]; 367 const char* value; 368 int length = equals - name; 369 if (length > PROP_NAME_MAX) { 370 ERROR("property name too long in trigger %s", act->name); 371 } else { 372 memcpy(prop_name, name, length); 373 prop_name[length] = 0; 374 375 /* does the property exist, and match the trigger value? */ 376 value = property_get(prop_name); 377 if (value && !strcmp(equals + 1, value)) { 378 action_add_queue_tail(act); 379 } 380 } 381 } 382 } 383 } 384} 385 386void queue_builtin_action(int (*func)(int nargs, char **args), char *name) 387{ 388 struct action *act; 389 struct command *cmd; 390 391 act = calloc(1, sizeof(*act)); 392 act->name = name; 393 list_init(&act->commands); 394 395 cmd = calloc(1, sizeof(*cmd)); 396 cmd->func = func; 397 cmd->args[0] = name; 398 list_add_tail(&act->commands, &cmd->clist); 399 400 list_add_tail(&action_list, &act->alist); 401 action_add_queue_tail(act); 402} 403 404void action_add_queue_tail(struct action *act) 405{ 406 list_add_tail(&action_queue, &act->qlist); 407} 408 409struct action *action_remove_queue_head(void) 410{ 411 if (list_empty(&action_queue)) { 412 return 0; 413 } else { 414 struct listnode *node = list_head(&action_queue); 415 struct action *act = node_to_item(node, struct action, qlist); 416 list_remove(node); 417 return act; 418 } 419} 420 421int action_queue_empty() 422{ 423 return list_empty(&action_queue); 424} 425 426static void *parse_service(struct parse_state *state, int nargs, char **args) 427{ 428 struct service *svc; 429 if (nargs < 3) { 430 parse_error(state, "services must have a name and a program\n"); 431 return 0; 432 } 433 if (!valid_name(args[1])) { 434 parse_error(state, "invalid service name '%s'\n", args[1]); 435 return 0; 436 } 437 438 svc = service_find_by_name(args[1]); 439 if (svc) { 440 parse_error(state, "ignored duplicate definition of service '%s'\n", args[1]); 441 return 0; 442 } 443 444 nargs -= 2; 445 svc = calloc(1, sizeof(*svc) + sizeof(char*) * nargs); 446 if (!svc) { 447 parse_error(state, "out of memory\n"); 448 return 0; 449 } 450 svc->name = args[1]; 451 svc->classname = "default"; 452 memcpy(svc->args, args + 2, sizeof(char*) * nargs); 453 svc->args[nargs] = 0; 454 svc->nargs = nargs; 455 svc->onrestart.name = "onrestart"; 456 list_init(&svc->onrestart.commands); 457 list_add_tail(&service_list, &svc->slist); 458 return svc; 459} 460 461static void parse_line_service(struct parse_state *state, int nargs, char **args) 462{ 463 struct service *svc = state->context; 464 struct command *cmd; 465 int i, kw, kw_nargs; 466 467 if (nargs == 0) { 468 return; 469 } 470 471 svc->ioprio_class = IoSchedClass_NONE; 472 473 kw = lookup_keyword(args[0]); 474 switch (kw) { 475 case K_capability: 476 break; 477 case K_class: 478 if (nargs != 2) { 479 parse_error(state, "class option requires a classname\n"); 480 } else { 481 svc->classname = args[1]; 482 } 483 break; 484 case K_console: 485 svc->flags |= SVC_CONSOLE; 486 break; 487 case K_disabled: 488 svc->flags |= SVC_DISABLED; 489 break; 490 case K_ioprio: 491 if (nargs != 3) { 492 parse_error(state, "ioprio optin usage: ioprio <rt|be|idle> <ioprio 0-7>\n"); 493 } else { 494 svc->ioprio_pri = strtoul(args[2], 0, 8); 495 496 if (svc->ioprio_pri < 0 || svc->ioprio_pri > 7) { 497 parse_error(state, "priority value must be range 0 - 7\n"); 498 break; 499 } 500 501 if (!strcmp(args[1], "rt")) { 502 svc->ioprio_class = IoSchedClass_RT; 503 } else if (!strcmp(args[1], "be")) { 504 svc->ioprio_class = IoSchedClass_BE; 505 } else if (!strcmp(args[1], "idle")) { 506 svc->ioprio_class = IoSchedClass_IDLE; 507 } else { 508 parse_error(state, "ioprio option usage: ioprio <rt|be|idle> <0-7>\n"); 509 } 510 } 511 break; 512 case K_group: 513 if (nargs < 2) { 514 parse_error(state, "group option requires a group id\n"); 515 } else if (nargs > NR_SVC_SUPP_GIDS + 2) { 516 parse_error(state, "group option accepts at most %d supp. groups\n", 517 NR_SVC_SUPP_GIDS); 518 } else { 519 int n; 520 svc->gid = decode_uid(args[1]); 521 for (n = 2; n < nargs; n++) { 522 svc->supp_gids[n-2] = decode_uid(args[n]); 523 } 524 svc->nr_supp_gids = n - 2; 525 } 526 break; 527 case K_keycodes: 528 if (nargs < 2) { 529 parse_error(state, "keycodes option requires atleast one keycode\n"); 530 } else { 531 svc->keycodes = malloc((nargs - 1) * sizeof(svc->keycodes[0])); 532 if (!svc->keycodes) { 533 parse_error(state, "could not allocate keycodes\n"); 534 } else { 535 svc->nkeycodes = nargs - 1; 536 for (i = 1; i < nargs; i++) { 537 svc->keycodes[i - 1] = atoi(args[i]); 538 } 539 } 540 } 541 break; 542 case K_oneshot: 543 svc->flags |= SVC_ONESHOT; 544 break; 545 case K_onrestart: 546 nargs--; 547 args++; 548 kw = lookup_keyword(args[0]); 549 if (!kw_is(kw, COMMAND)) { 550 parse_error(state, "invalid command '%s'\n", args[0]); 551 break; 552 } 553 kw_nargs = kw_nargs(kw); 554 if (nargs < kw_nargs) { 555 parse_error(state, "%s requires %d %s\n", args[0], kw_nargs - 1, 556 kw_nargs > 2 ? "arguments" : "argument"); 557 break; 558 } 559 560 cmd = malloc(sizeof(*cmd) + sizeof(char*) * nargs); 561 cmd->func = kw_func(kw); 562 cmd->nargs = nargs; 563 memcpy(cmd->args, args, sizeof(char*) * nargs); 564 list_add_tail(&svc->onrestart.commands, &cmd->clist); 565 break; 566 case K_critical: 567 svc->flags |= SVC_CRITICAL; 568 break; 569 case K_setenv: { /* name value */ 570 struct svcenvinfo *ei; 571 if (nargs < 2) { 572 parse_error(state, "setenv option requires name and value arguments\n"); 573 break; 574 } 575 ei = calloc(1, sizeof(*ei)); 576 if (!ei) { 577 parse_error(state, "out of memory\n"); 578 break; 579 } 580 ei->name = args[1]; 581 ei->value = args[2]; 582 ei->next = svc->envvars; 583 svc->envvars = ei; 584 break; 585 } 586 case K_socket: {/* name type perm [ uid gid ] */ 587 struct socketinfo *si; 588 if (nargs < 4) { 589 parse_error(state, "socket option requires name, type, perm arguments\n"); 590 break; 591 } 592 if (strcmp(args[2],"dgram") && strcmp(args[2],"stream") 593 && strcmp(args[2],"seqpacket")) { 594 parse_error(state, "socket type must be 'dgram', 'stream' or 'seqpacket'\n"); 595 break; 596 } 597 si = calloc(1, sizeof(*si)); 598 if (!si) { 599 parse_error(state, "out of memory\n"); 600 break; 601 } 602 si->name = args[1]; 603 si->type = args[2]; 604 si->perm = strtoul(args[3], 0, 8); 605 if (nargs > 4) 606 si->uid = decode_uid(args[4]); 607 if (nargs > 5) 608 si->gid = decode_uid(args[5]); 609 si->next = svc->sockets; 610 svc->sockets = si; 611 break; 612 } 613 case K_user: 614 if (nargs != 2) { 615 parse_error(state, "user option requires a user id\n"); 616 } else { 617 svc->uid = decode_uid(args[1]); 618 } 619 break; 620 default: 621 parse_error(state, "invalid option '%s'\n", args[0]); 622 } 623} 624 625static void *parse_action(struct parse_state *state, int nargs, char **args) 626{ 627 struct action *act; 628 if (nargs < 2) { 629 parse_error(state, "actions must have a trigger\n"); 630 return 0; 631 } 632 if (nargs > 2) { 633 parse_error(state, "actions may not have extra parameters\n"); 634 return 0; 635 } 636 act = calloc(1, sizeof(*act)); 637 act->name = args[1]; 638 list_init(&act->commands); 639 list_add_tail(&action_list, &act->alist); 640 /* XXX add to hash */ 641 return act; 642} 643 644static void parse_line_action(struct parse_state* state, int nargs, char **args) 645{ 646 struct command *cmd; 647 struct action *act = state->context; 648 int (*func)(int nargs, char **args); 649 int kw, n; 650 651 if (nargs == 0) { 652 return; 653 } 654 655 kw = lookup_keyword(args[0]); 656 if (!kw_is(kw, COMMAND)) { 657 parse_error(state, "invalid command '%s'\n", args[0]); 658 return; 659 } 660 661 n = kw_nargs(kw); 662 if (nargs < n) { 663 parse_error(state, "%s requires %d %s\n", args[0], n - 1, 664 n > 2 ? "arguments" : "argument"); 665 return; 666 } 667 cmd = malloc(sizeof(*cmd) + sizeof(char*) * nargs); 668 cmd->func = kw_func(kw); 669 cmd->nargs = nargs; 670 memcpy(cmd->args, args, sizeof(char*) * nargs); 671 list_add_tail(&act->commands, &cmd->clist); 672} 673