psparse.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692
  1. /******************************************************************************
  2. *
  3. * Module Name: psparse - Parser top level AML parse routines
  4. *
  5. *****************************************************************************/
  6. /*
  7. * Copyright (C) 2000 - 2008, Intel Corp.
  8. * All rights reserved.
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions
  12. * are met:
  13. * 1. Redistributions of source code must retain the above copyright
  14. * notice, this list of conditions, and the following disclaimer,
  15. * without modification.
  16. * 2. Redistributions in binary form must reproduce at minimum a disclaimer
  17. * substantially similar to the "NO WARRANTY" disclaimer below
  18. * ("Disclaimer") and any redistribution must be conditioned upon
  19. * including a substantially similar Disclaimer requirement for further
  20. * binary redistribution.
  21. * 3. Neither the names of the above-listed copyright holders nor the names
  22. * of any contributors may be used to endorse or promote products derived
  23. * from this software without specific prior written permission.
  24. *
  25. * Alternatively, this software may be distributed under the terms of the
  26. * GNU General Public License ("GPL") version 2 as published by the Free
  27. * Software Foundation.
  28. *
  29. * NO WARRANTY
  30. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  31. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  32. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR
  33. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  34. * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  35. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  36. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  37. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  38. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
  39. * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  40. * POSSIBILITY OF SUCH DAMAGES.
  41. */
  42. /*
  43. * Parse the AML and build an operation tree as most interpreters,
  44. * like Perl, do. Parsing is done by hand rather than with a YACC
  45. * generated parser to tightly constrain stack and dynamic memory
  46. * usage. At the same time, parsing is kept flexible and the code
  47. * fairly compact by parsing based on a list of AML opcode
  48. * templates in aml_op_info[]
  49. */
  50. #include <acpi/acpi.h>
  51. #include <acpi/acparser.h>
  52. #include <acpi/acdispat.h>
  53. #include <acpi/amlcode.h>
  54. #include <acpi/acnamesp.h>
  55. #include <acpi/acinterp.h>
  56. #define _COMPONENT ACPI_PARSER
  57. ACPI_MODULE_NAME("psparse")
  58. /*******************************************************************************
  59. *
  60. * FUNCTION: acpi_ps_get_opcode_size
  61. *
  62. * PARAMETERS: Opcode - An AML opcode
  63. *
  64. * RETURN: Size of the opcode, in bytes (1 or 2)
  65. *
  66. * DESCRIPTION: Get the size of the current opcode.
  67. *
  68. ******************************************************************************/
  69. u32 acpi_ps_get_opcode_size(u32 opcode)
  70. {
  71. /* Extended (2-byte) opcode if > 255 */
  72. if (opcode > 0x00FF) {
  73. return (2);
  74. }
  75. /* Otherwise, just a single byte opcode */
  76. return (1);
  77. }
  78. /*******************************************************************************
  79. *
  80. * FUNCTION: acpi_ps_peek_opcode
  81. *
  82. * PARAMETERS: parser_state - A parser state object
  83. *
  84. * RETURN: Next AML opcode
  85. *
  86. * DESCRIPTION: Get next AML opcode (without incrementing AML pointer)
  87. *
  88. ******************************************************************************/
  89. u16 acpi_ps_peek_opcode(struct acpi_parse_state * parser_state)
  90. {
  91. u8 *aml;
  92. u16 opcode;
  93. aml = parser_state->aml;
  94. opcode = (u16) ACPI_GET8(aml);
  95. if (opcode == AML_EXTENDED_OP_PREFIX) {
  96. /* Extended opcode, get the second opcode byte */
  97. aml++;
  98. opcode = (u16) ((opcode << 8) | ACPI_GET8(aml));
  99. }
  100. return (opcode);
  101. }
  102. /*******************************************************************************
  103. *
  104. * FUNCTION: acpi_ps_complete_this_op
  105. *
  106. * PARAMETERS: walk_state - Current State
  107. * Op - Op to complete
  108. *
  109. * RETURN: Status
  110. *
  111. * DESCRIPTION: Perform any cleanup at the completion of an Op.
  112. *
  113. ******************************************************************************/
  114. acpi_status
  115. acpi_ps_complete_this_op(struct acpi_walk_state * walk_state,
  116. union acpi_parse_object * op)
  117. {
  118. union acpi_parse_object *prev;
  119. union acpi_parse_object *next;
  120. const struct acpi_opcode_info *parent_info;
  121. union acpi_parse_object *replacement_op = NULL;
  122. ACPI_FUNCTION_TRACE_PTR(ps_complete_this_op, op);
  123. /* Check for null Op, can happen if AML code is corrupt */
  124. if (!op) {
  125. return_ACPI_STATUS(AE_OK); /* OK for now */
  126. }
  127. /* Delete this op and the subtree below it if asked to */
  128. if (((walk_state->parse_flags & ACPI_PARSE_TREE_MASK) !=
  129. ACPI_PARSE_DELETE_TREE)
  130. || (walk_state->op_info->class == AML_CLASS_ARGUMENT)) {
  131. return_ACPI_STATUS(AE_OK);
  132. }
  133. /* Make sure that we only delete this subtree */
  134. if (op->common.parent) {
  135. prev = op->common.parent->common.value.arg;
  136. if (!prev) {
  137. /* Nothing more to do */
  138. goto cleanup;
  139. }
  140. /*
  141. * Check if we need to replace the operator and its subtree
  142. * with a return value op (placeholder op)
  143. */
  144. parent_info =
  145. acpi_ps_get_opcode_info(op->common.parent->common.
  146. aml_opcode);
  147. switch (parent_info->class) {
  148. case AML_CLASS_CONTROL:
  149. break;
  150. case AML_CLASS_CREATE:
  151. /*
  152. * These opcodes contain term_arg operands. The current
  153. * op must be replaced by a placeholder return op
  154. */
  155. replacement_op =
  156. acpi_ps_alloc_op(AML_INT_RETURN_VALUE_OP);
  157. if (!replacement_op) {
  158. goto allocate_error;
  159. }
  160. break;
  161. case AML_CLASS_NAMED_OBJECT:
  162. /*
  163. * These opcodes contain term_arg operands. The current
  164. * op must be replaced by a placeholder return op
  165. */
  166. if ((op->common.parent->common.aml_opcode ==
  167. AML_REGION_OP)
  168. || (op->common.parent->common.aml_opcode ==
  169. AML_DATA_REGION_OP)
  170. || (op->common.parent->common.aml_opcode ==
  171. AML_BUFFER_OP)
  172. || (op->common.parent->common.aml_opcode ==
  173. AML_PACKAGE_OP)
  174. || (op->common.parent->common.aml_opcode ==
  175. AML_BANK_FIELD_OP)
  176. || (op->common.parent->common.aml_opcode ==
  177. AML_VAR_PACKAGE_OP)) {
  178. replacement_op =
  179. acpi_ps_alloc_op(AML_INT_RETURN_VALUE_OP);
  180. if (!replacement_op) {
  181. goto allocate_error;
  182. }
  183. } else
  184. if ((op->common.parent->common.aml_opcode ==
  185. AML_NAME_OP)
  186. && (walk_state->pass_number <=
  187. ACPI_IMODE_LOAD_PASS2)) {
  188. if ((op->common.aml_opcode == AML_BUFFER_OP)
  189. || (op->common.aml_opcode == AML_PACKAGE_OP)
  190. || (op->common.aml_opcode ==
  191. AML_VAR_PACKAGE_OP)) {
  192. replacement_op =
  193. acpi_ps_alloc_op(op->common.
  194. aml_opcode);
  195. if (!replacement_op) {
  196. goto allocate_error;
  197. }
  198. replacement_op->named.data =
  199. op->named.data;
  200. replacement_op->named.length =
  201. op->named.length;
  202. }
  203. }
  204. break;
  205. default:
  206. replacement_op =
  207. acpi_ps_alloc_op(AML_INT_RETURN_VALUE_OP);
  208. if (!replacement_op) {
  209. goto allocate_error;
  210. }
  211. }
  212. /* We must unlink this op from the parent tree */
  213. if (prev == op) {
  214. /* This op is the first in the list */
  215. if (replacement_op) {
  216. replacement_op->common.parent =
  217. op->common.parent;
  218. replacement_op->common.value.arg = NULL;
  219. replacement_op->common.node = op->common.node;
  220. op->common.parent->common.value.arg =
  221. replacement_op;
  222. replacement_op->common.next = op->common.next;
  223. } else {
  224. op->common.parent->common.value.arg =
  225. op->common.next;
  226. }
  227. }
  228. /* Search the parent list */
  229. else
  230. while (prev) {
  231. /* Traverse all siblings in the parent's argument list */
  232. next = prev->common.next;
  233. if (next == op) {
  234. if (replacement_op) {
  235. replacement_op->common.parent =
  236. op->common.parent;
  237. replacement_op->common.value.
  238. arg = NULL;
  239. replacement_op->common.node =
  240. op->common.node;
  241. prev->common.next =
  242. replacement_op;
  243. replacement_op->common.next =
  244. op->common.next;
  245. next = NULL;
  246. } else {
  247. prev->common.next =
  248. op->common.next;
  249. next = NULL;
  250. }
  251. }
  252. prev = next;
  253. }
  254. }
  255. cleanup:
  256. /* Now we can actually delete the subtree rooted at Op */
  257. acpi_ps_delete_parse_tree(op);
  258. return_ACPI_STATUS(AE_OK);
  259. allocate_error:
  260. /* Always delete the subtree, even on error */
  261. acpi_ps_delete_parse_tree(op);
  262. return_ACPI_STATUS(AE_NO_MEMORY);
  263. }
  264. /*******************************************************************************
  265. *
  266. * FUNCTION: acpi_ps_next_parse_state
  267. *
  268. * PARAMETERS: walk_state - Current state
  269. * Op - Current parse op
  270. * callback_status - Status from previous operation
  271. *
  272. * RETURN: Status
  273. *
  274. * DESCRIPTION: Update the parser state based upon the return exception from
  275. * the parser callback.
  276. *
  277. ******************************************************************************/
  278. acpi_status
  279. acpi_ps_next_parse_state(struct acpi_walk_state *walk_state,
  280. union acpi_parse_object *op,
  281. acpi_status callback_status)
  282. {
  283. struct acpi_parse_state *parser_state = &walk_state->parser_state;
  284. acpi_status status = AE_CTRL_PENDING;
  285. ACPI_FUNCTION_TRACE_PTR(ps_next_parse_state, op);
  286. switch (callback_status) {
  287. case AE_CTRL_TERMINATE:
  288. /*
  289. * A control method was terminated via a RETURN statement.
  290. * The walk of this method is complete.
  291. */
  292. parser_state->aml = parser_state->aml_end;
  293. status = AE_CTRL_TERMINATE;
  294. break;
  295. case AE_CTRL_BREAK:
  296. parser_state->aml = walk_state->aml_last_while;
  297. walk_state->control_state->common.value = FALSE;
  298. status = AE_CTRL_BREAK;
  299. break;
  300. case AE_CTRL_CONTINUE:
  301. parser_state->aml = walk_state->aml_last_while;
  302. status = AE_CTRL_CONTINUE;
  303. break;
  304. case AE_CTRL_PENDING:
  305. parser_state->aml = walk_state->aml_last_while;
  306. break;
  307. #if 0
  308. case AE_CTRL_SKIP:
  309. parser_state->aml = parser_state->scope->parse_scope.pkg_end;
  310. status = AE_OK;
  311. break;
  312. #endif
  313. case AE_CTRL_TRUE:
  314. /*
  315. * Predicate of an IF was true, and we are at the matching ELSE.
  316. * Just close out this package
  317. */
  318. parser_state->aml = acpi_ps_get_next_package_end(parser_state);
  319. status = AE_CTRL_PENDING;
  320. break;
  321. case AE_CTRL_FALSE:
  322. /*
  323. * Either an IF/WHILE Predicate was false or we encountered a BREAK
  324. * opcode. In both cases, we do not execute the rest of the
  325. * package; We simply close out the parent (finishing the walk of
  326. * this branch of the tree) and continue execution at the parent
  327. * level.
  328. */
  329. parser_state->aml = parser_state->scope->parse_scope.pkg_end;
  330. /* In the case of a BREAK, just force a predicate (if any) to FALSE */
  331. walk_state->control_state->common.value = FALSE;
  332. status = AE_CTRL_END;
  333. break;
  334. case AE_CTRL_TRANSFER:
  335. /* A method call (invocation) -- transfer control */
  336. status = AE_CTRL_TRANSFER;
  337. walk_state->prev_op = op;
  338. walk_state->method_call_op = op;
  339. walk_state->method_call_node =
  340. (op->common.value.arg)->common.node;
  341. /* Will return value (if any) be used by the caller? */
  342. walk_state->return_used =
  343. acpi_ds_is_result_used(op, walk_state);
  344. break;
  345. default:
  346. status = callback_status;
  347. if ((callback_status & AE_CODE_MASK) == AE_CODE_CONTROL) {
  348. status = AE_OK;
  349. }
  350. break;
  351. }
  352. return_ACPI_STATUS(status);
  353. }
  354. /*******************************************************************************
  355. *
  356. * FUNCTION: acpi_ps_parse_aml
  357. *
  358. * PARAMETERS: walk_state - Current state
  359. *
  360. *
  361. * RETURN: Status
  362. *
  363. * DESCRIPTION: Parse raw AML and return a tree of ops
  364. *
  365. ******************************************************************************/
  366. acpi_status acpi_ps_parse_aml(struct acpi_walk_state *walk_state)
  367. {
  368. acpi_status status;
  369. struct acpi_thread_state *thread;
  370. struct acpi_thread_state *prev_walk_list = acpi_gbl_current_walk_list;
  371. struct acpi_walk_state *previous_walk_state;
  372. ACPI_FUNCTION_TRACE(ps_parse_aml);
  373. ACPI_DEBUG_PRINT((ACPI_DB_PARSE,
  374. "Entered with WalkState=%p Aml=%p size=%X\n",
  375. walk_state, walk_state->parser_state.aml,
  376. walk_state->parser_state.aml_size));
  377. /* Create and initialize a new thread state */
  378. thread = acpi_ut_create_thread_state();
  379. if (!thread) {
  380. acpi_ds_delete_walk_state(walk_state);
  381. return_ACPI_STATUS(AE_NO_MEMORY);
  382. }
  383. walk_state->thread = thread;
  384. /*
  385. * If executing a method, the starting sync_level is this method's
  386. * sync_level
  387. */
  388. if (walk_state->method_desc) {
  389. walk_state->thread->current_sync_level =
  390. walk_state->method_desc->method.sync_level;
  391. }
  392. acpi_ds_push_walk_state(walk_state, thread);
  393. /*
  394. * This global allows the AML debugger to get a handle to the currently
  395. * executing control method.
  396. */
  397. acpi_gbl_current_walk_list = thread;
  398. /*
  399. * Execute the walk loop as long as there is a valid Walk State. This
  400. * handles nested control method invocations without recursion.
  401. */
  402. ACPI_DEBUG_PRINT((ACPI_DB_PARSE, "State=%p\n", walk_state));
  403. status = AE_OK;
  404. while (walk_state) {
  405. if (ACPI_SUCCESS(status)) {
  406. /*
  407. * The parse_loop executes AML until the method terminates
  408. * or calls another method.
  409. */
  410. status = acpi_ps_parse_loop(walk_state);
  411. }
  412. ACPI_DEBUG_PRINT((ACPI_DB_PARSE,
  413. "Completed one call to walk loop, %s State=%p\n",
  414. acpi_format_exception(status), walk_state));
  415. if (status == AE_CTRL_TRANSFER) {
  416. /*
  417. * A method call was detected.
  418. * Transfer control to the called control method
  419. */
  420. status =
  421. acpi_ds_call_control_method(thread, walk_state,
  422. NULL);
  423. if (ACPI_FAILURE(status)) {
  424. status =
  425. acpi_ds_method_error(status, walk_state);
  426. }
  427. /*
  428. * If the transfer to the new method method call worked, a new walk
  429. * state was created -- get it
  430. */
  431. walk_state = acpi_ds_get_current_walk_state(thread);
  432. continue;
  433. } else if (status == AE_CTRL_TERMINATE) {
  434. status = AE_OK;
  435. } else if ((status != AE_OK) && (walk_state->method_desc)) {
  436. /* Either the method parse or actual execution failed */
  437. ACPI_ERROR_METHOD("Method parse/execution failed",
  438. walk_state->method_node, NULL,
  439. status);
  440. /* Check for possible multi-thread reentrancy problem */
  441. if ((status == AE_ALREADY_EXISTS) &&
  442. (!walk_state->method_desc->method.mutex)) {
  443. ACPI_INFO((AE_INFO,
  444. "Marking method %4.4s as Serialized because of AE_ALREADY_EXISTS error",
  445. walk_state->method_node->name.
  446. ascii));
  447. /*
  448. * Method tried to create an object twice. The probable cause is
  449. * that the method cannot handle reentrancy.
  450. *
  451. * The method is marked not_serialized, but it tried to create
  452. * a named object, causing the second thread entrance to fail.
  453. * Workaround this problem by marking the method permanently
  454. * as Serialized.
  455. */
  456. walk_state->method_desc->method.method_flags |=
  457. AML_METHOD_SERIALIZED;
  458. walk_state->method_desc->method.sync_level = 0;
  459. }
  460. }
  461. /* We are done with this walk, move on to the parent if any */
  462. walk_state = acpi_ds_pop_walk_state(thread);
  463. /* Reset the current scope to the beginning of scope stack */
  464. acpi_ds_scope_stack_clear(walk_state);
  465. /*
  466. * If we just returned from the execution of a control method or if we
  467. * encountered an error during the method parse phase, there's lots of
  468. * cleanup to do
  469. */
  470. if (((walk_state->parse_flags & ACPI_PARSE_MODE_MASK) ==
  471. ACPI_PARSE_EXECUTE) || (ACPI_FAILURE(status))) {
  472. acpi_ds_terminate_control_method(walk_state->
  473. method_desc,
  474. walk_state);
  475. }
  476. /* Delete this walk state and all linked control states */
  477. acpi_ps_cleanup_scope(&walk_state->parser_state);
  478. previous_walk_state = walk_state;
  479. ACPI_DEBUG_PRINT((ACPI_DB_PARSE,
  480. "ReturnValue=%p, ImplicitValue=%p State=%p\n",
  481. walk_state->return_desc,
  482. walk_state->implicit_return_obj, walk_state));
  483. /* Check if we have restarted a preempted walk */
  484. walk_state = acpi_ds_get_current_walk_state(thread);
  485. if (walk_state) {
  486. if (ACPI_SUCCESS(status)) {
  487. /*
  488. * There is another walk state, restart it.
  489. * If the method return value is not used by the parent,
  490. * The object is deleted
  491. */
  492. if (!previous_walk_state->return_desc) {
  493. /*
  494. * In slack mode execution, if there is no return value
  495. * we should implicitly return zero (0) as a default value.
  496. */
  497. if (acpi_gbl_enable_interpreter_slack &&
  498. !previous_walk_state->
  499. implicit_return_obj) {
  500. previous_walk_state->
  501. implicit_return_obj =
  502. acpi_ut_create_internal_object
  503. (ACPI_TYPE_INTEGER);
  504. if (!previous_walk_state->
  505. implicit_return_obj) {
  506. return_ACPI_STATUS
  507. (AE_NO_MEMORY);
  508. }
  509. previous_walk_state->
  510. implicit_return_obj->
  511. integer.value = 0;
  512. }
  513. /* Restart the calling control method */
  514. status =
  515. acpi_ds_restart_control_method
  516. (walk_state,
  517. previous_walk_state->
  518. implicit_return_obj);
  519. } else {
  520. /*
  521. * We have a valid return value, delete any implicit
  522. * return value.
  523. */
  524. acpi_ds_clear_implicit_return
  525. (previous_walk_state);
  526. status =
  527. acpi_ds_restart_control_method
  528. (walk_state,
  529. previous_walk_state->return_desc);
  530. }
  531. if (ACPI_SUCCESS(status)) {
  532. walk_state->walk_type |=
  533. ACPI_WALK_METHOD_RESTART;
  534. }
  535. } else {
  536. /* On error, delete any return object */
  537. acpi_ut_remove_reference(previous_walk_state->
  538. return_desc);
  539. }
  540. }
  541. /*
  542. * Just completed a 1st-level method, save the final internal return
  543. * value (if any)
  544. */
  545. else if (previous_walk_state->caller_return_desc) {
  546. if (previous_walk_state->implicit_return_obj) {
  547. *(previous_walk_state->caller_return_desc) =
  548. previous_walk_state->implicit_return_obj;
  549. } else {
  550. /* NULL if no return value */
  551. *(previous_walk_state->caller_return_desc) =
  552. previous_walk_state->return_desc;
  553. }
  554. } else {
  555. if (previous_walk_state->return_desc) {
  556. /* Caller doesn't want it, must delete it */
  557. acpi_ut_remove_reference(previous_walk_state->
  558. return_desc);
  559. }
  560. if (previous_walk_state->implicit_return_obj) {
  561. /* Caller doesn't want it, must delete it */
  562. acpi_ut_remove_reference(previous_walk_state->
  563. implicit_return_obj);
  564. }
  565. }
  566. acpi_ds_delete_walk_state(previous_walk_state);
  567. }
  568. /* Normal exit */
  569. acpi_ex_release_all_mutexes(thread);
  570. acpi_ut_delete_generic_state(ACPI_CAST_PTR
  571. (union acpi_generic_state, thread));
  572. acpi_gbl_current_walk_list = prev_walk_list;
  573. return_ACPI_STATUS(status);
  574. }