psparse.c 19 KB

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