psparse.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675
  1. /******************************************************************************
  2. *
  3. * Module Name: psparse - Parser top level AML parse routines
  4. *
  5. *****************************************************************************/
  6. /*
  7. * Copyright (C) 2000 - 2006, R. Byron Moore
  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_VAR_PACKAGE_OP)) {
  176. replacement_op =
  177. acpi_ps_alloc_op(AML_INT_RETURN_VALUE_OP);
  178. if (!replacement_op) {
  179. goto allocate_error;
  180. }
  181. } else
  182. if ((op->common.parent->common.aml_opcode ==
  183. AML_NAME_OP)
  184. && (walk_state->pass_number <=
  185. ACPI_IMODE_LOAD_PASS2)) {
  186. if ((op->common.aml_opcode == AML_BUFFER_OP)
  187. || (op->common.aml_opcode == AML_PACKAGE_OP)
  188. || (op->common.aml_opcode ==
  189. AML_VAR_PACKAGE_OP)) {
  190. replacement_op =
  191. acpi_ps_alloc_op(op->common.
  192. aml_opcode);
  193. if (!replacement_op) {
  194. goto allocate_error;
  195. }
  196. replacement_op->named.data =
  197. op->named.data;
  198. replacement_op->named.length =
  199. op->named.length;
  200. }
  201. }
  202. break;
  203. default:
  204. replacement_op =
  205. acpi_ps_alloc_op(AML_INT_RETURN_VALUE_OP);
  206. if (!replacement_op) {
  207. goto allocate_error;
  208. }
  209. }
  210. /* We must unlink this op from the parent tree */
  211. if (prev == op) {
  212. /* This op is the first in the list */
  213. if (replacement_op) {
  214. replacement_op->common.parent =
  215. op->common.parent;
  216. replacement_op->common.value.arg = NULL;
  217. replacement_op->common.node = op->common.node;
  218. op->common.parent->common.value.arg =
  219. replacement_op;
  220. replacement_op->common.next = op->common.next;
  221. } else {
  222. op->common.parent->common.value.arg =
  223. op->common.next;
  224. }
  225. }
  226. /* Search the parent list */
  227. else
  228. while (prev) {
  229. /* Traverse all siblings in the parent's argument list */
  230. next = prev->common.next;
  231. if (next == op) {
  232. if (replacement_op) {
  233. replacement_op->common.parent =
  234. op->common.parent;
  235. replacement_op->common.value.
  236. arg = NULL;
  237. replacement_op->common.node =
  238. op->common.node;
  239. prev->common.next =
  240. replacement_op;
  241. replacement_op->common.next =
  242. op->common.next;
  243. next = NULL;
  244. } else {
  245. prev->common.next =
  246. op->common.next;
  247. next = NULL;
  248. }
  249. }
  250. prev = next;
  251. }
  252. }
  253. cleanup:
  254. /* Now we can actually delete the subtree rooted at Op */
  255. acpi_ps_delete_parse_tree(op);
  256. return_ACPI_STATUS(AE_OK);
  257. allocate_error:
  258. /* Always delete the subtree, even on error */
  259. acpi_ps_delete_parse_tree(op);
  260. return_ACPI_STATUS(AE_NO_MEMORY);
  261. }
  262. /*******************************************************************************
  263. *
  264. * FUNCTION: acpi_ps_next_parse_state
  265. *
  266. * PARAMETERS: walk_state - Current state
  267. * Op - Current parse op
  268. * callback_status - Status from previous operation
  269. *
  270. * RETURN: Status
  271. *
  272. * DESCRIPTION: Update the parser state based upon the return exception from
  273. * the parser callback.
  274. *
  275. ******************************************************************************/
  276. acpi_status
  277. acpi_ps_next_parse_state(struct acpi_walk_state *walk_state,
  278. union acpi_parse_object *op,
  279. acpi_status callback_status)
  280. {
  281. struct acpi_parse_state *parser_state = &walk_state->parser_state;
  282. acpi_status status = AE_CTRL_PENDING;
  283. ACPI_FUNCTION_TRACE_PTR(ps_next_parse_state, op);
  284. switch (callback_status) {
  285. case AE_CTRL_TERMINATE:
  286. /*
  287. * A control method was terminated via a RETURN statement.
  288. * The walk of this method is complete.
  289. */
  290. parser_state->aml = parser_state->aml_end;
  291. status = AE_CTRL_TERMINATE;
  292. break;
  293. case AE_CTRL_BREAK:
  294. parser_state->aml = walk_state->aml_last_while;
  295. walk_state->control_state->common.value = FALSE;
  296. status = acpi_ds_result_stack_pop(walk_state);
  297. if (ACPI_SUCCESS(status)) {
  298. status = AE_CTRL_BREAK;
  299. }
  300. break;
  301. case AE_CTRL_CONTINUE:
  302. parser_state->aml = walk_state->aml_last_while;
  303. status = acpi_ds_result_stack_pop(walk_state);
  304. if (ACPI_SUCCESS(status)) {
  305. status = AE_CTRL_CONTINUE;
  306. }
  307. break;
  308. case AE_CTRL_PENDING:
  309. parser_state->aml = walk_state->aml_last_while;
  310. break;
  311. #if 0
  312. case AE_CTRL_SKIP:
  313. parser_state->aml = parser_state->scope->parse_scope.pkg_end;
  314. status = AE_OK;
  315. break;
  316. #endif
  317. case AE_CTRL_TRUE:
  318. /*
  319. * Predicate of an IF was true, and we are at the matching ELSE.
  320. * Just close out this package
  321. */
  322. parser_state->aml = acpi_ps_get_next_package_end(parser_state);
  323. status = acpi_ds_result_stack_pop(walk_state);
  324. if (ACPI_SUCCESS(status)) {
  325. status = AE_CTRL_PENDING;
  326. }
  327. break;
  328. case AE_CTRL_FALSE:
  329. /*
  330. * Either an IF/WHILE Predicate was false or we encountered a BREAK
  331. * opcode. In both cases, we do not execute the rest of the
  332. * package; We simply close out the parent (finishing the walk of
  333. * this branch of the tree) and continue execution at the parent
  334. * level.
  335. */
  336. parser_state->aml = parser_state->scope->parse_scope.pkg_end;
  337. /* In the case of a BREAK, just force a predicate (if any) to FALSE */
  338. walk_state->control_state->common.value = FALSE;
  339. status = AE_CTRL_END;
  340. break;
  341. case AE_CTRL_TRANSFER:
  342. /* A method call (invocation) -- transfer control */
  343. status = AE_CTRL_TRANSFER;
  344. walk_state->prev_op = op;
  345. walk_state->method_call_op = op;
  346. walk_state->method_call_node =
  347. (op->common.value.arg)->common.node;
  348. /* Will return value (if any) be used by the caller? */
  349. walk_state->return_used =
  350. acpi_ds_is_result_used(op, walk_state);
  351. break;
  352. default:
  353. status = callback_status;
  354. if ((callback_status & AE_CODE_MASK) == AE_CODE_CONTROL) {
  355. status = AE_OK;
  356. }
  357. break;
  358. }
  359. return_ACPI_STATUS(status);
  360. }
  361. /*******************************************************************************
  362. *
  363. * FUNCTION: acpi_ps_parse_aml
  364. *
  365. * PARAMETERS: walk_state - Current state
  366. *
  367. *
  368. * RETURN: Status
  369. *
  370. * DESCRIPTION: Parse raw AML and return a tree of ops
  371. *
  372. ******************************************************************************/
  373. acpi_status acpi_ps_parse_aml(struct acpi_walk_state *walk_state)
  374. {
  375. acpi_status status;
  376. struct acpi_thread_state *thread;
  377. struct acpi_thread_state *prev_walk_list = acpi_gbl_current_walk_list;
  378. struct acpi_walk_state *previous_walk_state;
  379. ACPI_FUNCTION_TRACE(ps_parse_aml);
  380. ACPI_DEBUG_PRINT((ACPI_DB_PARSE,
  381. "Entered with WalkState=%p Aml=%p size=%X\n",
  382. walk_state, walk_state->parser_state.aml,
  383. walk_state->parser_state.aml_size));
  384. /* Create and initialize a new thread state */
  385. thread = acpi_ut_create_thread_state();
  386. if (!thread) {
  387. acpi_ds_delete_walk_state(walk_state);
  388. return_ACPI_STATUS(AE_NO_MEMORY);
  389. }
  390. walk_state->thread = thread;
  391. /*
  392. * If executing a method, the starting sync_level is this method's
  393. * sync_level
  394. */
  395. if (walk_state->method_desc) {
  396. walk_state->thread->current_sync_level =
  397. walk_state->method_desc->method.sync_level;
  398. }
  399. acpi_ds_push_walk_state(walk_state, thread);
  400. /*
  401. * This global allows the AML debugger to get a handle to the currently
  402. * executing control method.
  403. */
  404. acpi_gbl_current_walk_list = thread;
  405. /*
  406. * Execute the walk loop as long as there is a valid Walk State. This
  407. * handles nested control method invocations without recursion.
  408. */
  409. ACPI_DEBUG_PRINT((ACPI_DB_PARSE, "State=%p\n", walk_state));
  410. status = AE_OK;
  411. while (walk_state) {
  412. if (ACPI_SUCCESS(status)) {
  413. /*
  414. * The parse_loop executes AML until the method terminates
  415. * or calls another method.
  416. */
  417. status = acpi_ps_parse_loop(walk_state);
  418. }
  419. ACPI_DEBUG_PRINT((ACPI_DB_PARSE,
  420. "Completed one call to walk loop, %s State=%p\n",
  421. acpi_format_exception(status), walk_state));
  422. if (status == AE_CTRL_TRANSFER) {
  423. /*
  424. * A method call was detected.
  425. * Transfer control to the called control method
  426. */
  427. status =
  428. acpi_ds_call_control_method(thread, walk_state,
  429. NULL);
  430. if (ACPI_FAILURE(status)) {
  431. status =
  432. acpi_ds_method_error(status, walk_state);
  433. }
  434. /*
  435. * If the transfer to the new method method call worked, a new walk
  436. * state was created -- get it
  437. */
  438. walk_state = acpi_ds_get_current_walk_state(thread);
  439. continue;
  440. } else if (status == AE_CTRL_TERMINATE) {
  441. status = AE_OK;
  442. } else if ((status != AE_OK) && (walk_state->method_desc)) {
  443. /* Either the method parse or actual execution failed */
  444. ACPI_ERROR_METHOD("Method parse/execution failed",
  445. walk_state->method_node, NULL,
  446. status);
  447. /* Check for possible multi-thread reentrancy problem */
  448. if ((status == AE_ALREADY_EXISTS) &&
  449. (!walk_state->method_desc->method.mutex)) {
  450. ACPI_INFO((AE_INFO,
  451. "Marking method %4.4s as Serialized",
  452. walk_state->method_node->name.
  453. ascii));
  454. /*
  455. * Method tried to create an object twice. The probable cause is
  456. * that the method cannot handle reentrancy.
  457. *
  458. * The method is marked not_serialized, but it tried to create
  459. * a named object, causing the second thread entrance to fail.
  460. * Workaround this problem by marking the method permanently
  461. * as Serialized.
  462. */
  463. walk_state->method_desc->method.method_flags |=
  464. AML_METHOD_SERIALIZED;
  465. walk_state->method_desc->method.sync_level = 0;
  466. }
  467. }
  468. /* We are done with this walk, move on to the parent if any */
  469. walk_state = acpi_ds_pop_walk_state(thread);
  470. /* Reset the current scope to the beginning of scope stack */
  471. acpi_ds_scope_stack_clear(walk_state);
  472. /*
  473. * If we just returned from the execution of a control method or if we
  474. * encountered an error during the method parse phase, there's lots of
  475. * cleanup to do
  476. */
  477. if (((walk_state->parse_flags & ACPI_PARSE_MODE_MASK) ==
  478. ACPI_PARSE_EXECUTE) || (ACPI_FAILURE(status))) {
  479. acpi_ds_terminate_control_method(walk_state->
  480. method_desc,
  481. walk_state);
  482. }
  483. /* Delete this walk state and all linked control states */
  484. acpi_ps_cleanup_scope(&walk_state->parser_state);
  485. previous_walk_state = walk_state;
  486. ACPI_DEBUG_PRINT((ACPI_DB_PARSE,
  487. "ReturnValue=%p, ImplicitValue=%p State=%p\n",
  488. walk_state->return_desc,
  489. walk_state->implicit_return_obj, walk_state));
  490. /* Check if we have restarted a preempted walk */
  491. walk_state = acpi_ds_get_current_walk_state(thread);
  492. if (walk_state) {
  493. if (ACPI_SUCCESS(status)) {
  494. /*
  495. * There is another walk state, restart it.
  496. * If the method return value is not used by the parent,
  497. * The object is deleted
  498. */
  499. if (!previous_walk_state->return_desc) {
  500. status =
  501. acpi_ds_restart_control_method
  502. (walk_state,
  503. previous_walk_state->
  504. implicit_return_obj);
  505. } else {
  506. /*
  507. * We have a valid return value, delete any implicit
  508. * return value.
  509. */
  510. acpi_ds_clear_implicit_return
  511. (previous_walk_state);
  512. status =
  513. acpi_ds_restart_control_method
  514. (walk_state,
  515. previous_walk_state->return_desc);
  516. }
  517. if (ACPI_SUCCESS(status)) {
  518. walk_state->walk_type |=
  519. ACPI_WALK_METHOD_RESTART;
  520. }
  521. } else {
  522. /* On error, delete any return object */
  523. acpi_ut_remove_reference(previous_walk_state->
  524. return_desc);
  525. }
  526. }
  527. /*
  528. * Just completed a 1st-level method, save the final internal return
  529. * value (if any)
  530. */
  531. else if (previous_walk_state->caller_return_desc) {
  532. if (previous_walk_state->implicit_return_obj) {
  533. *(previous_walk_state->caller_return_desc) =
  534. previous_walk_state->implicit_return_obj;
  535. } else {
  536. /* NULL if no return value */
  537. *(previous_walk_state->caller_return_desc) =
  538. previous_walk_state->return_desc;
  539. }
  540. } else {
  541. if (previous_walk_state->return_desc) {
  542. /* Caller doesn't want it, must delete it */
  543. acpi_ut_remove_reference(previous_walk_state->
  544. return_desc);
  545. }
  546. if (previous_walk_state->implicit_return_obj) {
  547. /* Caller doesn't want it, must delete it */
  548. acpi_ut_remove_reference(previous_walk_state->
  549. implicit_return_obj);
  550. }
  551. }
  552. acpi_ds_delete_walk_state(previous_walk_state);
  553. }
  554. /* Normal exit */
  555. acpi_ex_release_all_mutexes(thread);
  556. acpi_ut_delete_generic_state(ACPI_CAST_PTR
  557. (union acpi_generic_state, thread));
  558. acpi_gbl_current_walk_list = prev_walk_list;
  559. return_ACPI_STATUS(status);
  560. }