exoparg2.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608
  1. /******************************************************************************
  2. *
  3. * Module Name: exoparg2 - AML execution - opcodes with 2 arguments
  4. *
  5. *****************************************************************************/
  6. /*
  7. * Copyright (C) 2000 - 2005, 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. #include <acpi/acpi.h>
  43. #include <acpi/acparser.h>
  44. #include <acpi/acinterp.h>
  45. #include <acpi/acevents.h>
  46. #include <acpi/amlcode.h>
  47. #define _COMPONENT ACPI_EXECUTER
  48. ACPI_MODULE_NAME ("exoparg2")
  49. /*!
  50. * Naming convention for AML interpreter execution routines.
  51. *
  52. * The routines that begin execution of AML opcodes are named with a common
  53. * convention based upon the number of arguments, the number of target operands,
  54. * and whether or not a value is returned:
  55. *
  56. * AcpiExOpcode_xA_yT_zR
  57. *
  58. * Where:
  59. *
  60. * xA - ARGUMENTS: The number of arguments (input operands) that are
  61. * required for this opcode type (1 through 6 args).
  62. * yT - TARGETS: The number of targets (output operands) that are required
  63. * for this opcode type (0, 1, or 2 targets).
  64. * zR - RETURN VALUE: Indicates whether this opcode type returns a value
  65. * as the function return (0 or 1).
  66. *
  67. * The AcpiExOpcode* functions are called via the Dispatcher component with
  68. * fully resolved operands.
  69. !*/
  70. /*******************************************************************************
  71. *
  72. * FUNCTION: acpi_ex_opcode_2A_0T_0R
  73. *
  74. * PARAMETERS: walk_state - Current walk state
  75. *
  76. * RETURN: Status
  77. *
  78. * DESCRIPTION: Execute opcode with two arguments, no target, and no return
  79. * value.
  80. *
  81. * ALLOCATION: Deletes both operands
  82. *
  83. ******************************************************************************/
  84. acpi_status
  85. acpi_ex_opcode_2A_0T_0R (
  86. struct acpi_walk_state *walk_state)
  87. {
  88. union acpi_operand_object **operand = &walk_state->operands[0];
  89. struct acpi_namespace_node *node;
  90. u32 value;
  91. acpi_status status = AE_OK;
  92. ACPI_FUNCTION_TRACE_STR ("ex_opcode_2A_0T_0R",
  93. acpi_ps_get_opcode_name (walk_state->opcode));
  94. /* Examine the opcode */
  95. switch (walk_state->opcode) {
  96. case AML_NOTIFY_OP: /* Notify (notify_object, notify_value) */
  97. /* The first operand is a namespace node */
  98. node = (struct acpi_namespace_node *) operand[0];
  99. /* Second value is the notify value */
  100. value = (u32) operand[1]->integer.value;
  101. /* Notifies allowed on this object? */
  102. if (!acpi_ev_is_notify_object (node)) {
  103. ACPI_DEBUG_PRINT ((ACPI_DB_ERROR,
  104. "Unexpected notify object type [%s]\n",
  105. acpi_ut_get_type_name (node->type)));
  106. status = AE_AML_OPERAND_TYPE;
  107. break;
  108. }
  109. #ifdef ACPI_GPE_NOTIFY_CHECK
  110. /*
  111. * GPE method wake/notify check. Here, we want to ensure that we
  112. * don't receive any "device_wake" Notifies from a GPE _Lxx or _Exx
  113. * GPE method during system runtime. If we do, the GPE is marked
  114. * as "wake-only" and disabled.
  115. *
  116. * 1) Is the Notify() value == device_wake?
  117. * 2) Is this a GPE deferred method? (An _Lxx or _Exx method)
  118. * 3) Did the original GPE happen at system runtime?
  119. * (versus during wake)
  120. *
  121. * If all three cases are true, this is a wake-only GPE that should
  122. * be disabled at runtime.
  123. */
  124. if (value == 2) /* device_wake */ {
  125. status = acpi_ev_check_for_wake_only_gpe (walk_state->gpe_event_info);
  126. if (ACPI_FAILURE (status)) {
  127. /* AE_WAKE_ONLY_GPE only error, means ignore this notify */
  128. return_ACPI_STATUS (AE_OK)
  129. }
  130. }
  131. #endif
  132. /*
  133. * Dispatch the notify to the appropriate handler
  134. * NOTE: the request is queued for execution after this method
  135. * completes. The notify handlers are NOT invoked synchronously
  136. * from this thread -- because handlers may in turn run other
  137. * control methods.
  138. */
  139. status = acpi_ev_queue_notify_request (node, value);
  140. break;
  141. default:
  142. ACPI_REPORT_ERROR (("acpi_ex_opcode_2A_0T_0R: Unknown opcode %X\n",
  143. walk_state->opcode));
  144. status = AE_AML_BAD_OPCODE;
  145. }
  146. return_ACPI_STATUS (status);
  147. }
  148. /*******************************************************************************
  149. *
  150. * FUNCTION: acpi_ex_opcode_2A_2T_1R
  151. *
  152. * PARAMETERS: walk_state - Current walk state
  153. *
  154. * RETURN: Status
  155. *
  156. * DESCRIPTION: Execute a dyadic operator (2 operands) with 2 output targets
  157. * and one implicit return value.
  158. *
  159. ******************************************************************************/
  160. acpi_status
  161. acpi_ex_opcode_2A_2T_1R (
  162. struct acpi_walk_state *walk_state)
  163. {
  164. union acpi_operand_object **operand = &walk_state->operands[0];
  165. union acpi_operand_object *return_desc1 = NULL;
  166. union acpi_operand_object *return_desc2 = NULL;
  167. acpi_status status;
  168. ACPI_FUNCTION_TRACE_STR ("ex_opcode_2A_2T_1R",
  169. acpi_ps_get_opcode_name (walk_state->opcode));
  170. /*
  171. * Execute the opcode
  172. */
  173. switch (walk_state->opcode) {
  174. case AML_DIVIDE_OP: /* Divide (Dividend, Divisor, remainder_result quotient_result) */
  175. return_desc1 = acpi_ut_create_internal_object (ACPI_TYPE_INTEGER);
  176. if (!return_desc1) {
  177. status = AE_NO_MEMORY;
  178. goto cleanup;
  179. }
  180. return_desc2 = acpi_ut_create_internal_object (ACPI_TYPE_INTEGER);
  181. if (!return_desc2) {
  182. status = AE_NO_MEMORY;
  183. goto cleanup;
  184. }
  185. /* Quotient to return_desc1, remainder to return_desc2 */
  186. status = acpi_ut_divide (operand[0]->integer.value,
  187. operand[1]->integer.value,
  188. &return_desc1->integer.value,
  189. &return_desc2->integer.value);
  190. if (ACPI_FAILURE (status)) {
  191. goto cleanup;
  192. }
  193. break;
  194. default:
  195. ACPI_REPORT_ERROR (("acpi_ex_opcode_2A_2T_1R: Unknown opcode %X\n",
  196. walk_state->opcode));
  197. status = AE_AML_BAD_OPCODE;
  198. goto cleanup;
  199. }
  200. /* Store the results to the target reference operands */
  201. status = acpi_ex_store (return_desc2, operand[2], walk_state);
  202. if (ACPI_FAILURE (status)) {
  203. goto cleanup;
  204. }
  205. status = acpi_ex_store (return_desc1, operand[3], walk_state);
  206. if (ACPI_FAILURE (status)) {
  207. goto cleanup;
  208. }
  209. /* Return the remainder */
  210. walk_state->result_obj = return_desc1;
  211. cleanup:
  212. /*
  213. * Since the remainder is not returned indirectly, remove a reference to
  214. * it. Only the quotient is returned indirectly.
  215. */
  216. acpi_ut_remove_reference (return_desc2);
  217. if (ACPI_FAILURE (status)) {
  218. /* Delete the return object */
  219. acpi_ut_remove_reference (return_desc1);
  220. }
  221. return_ACPI_STATUS (status);
  222. }
  223. /*******************************************************************************
  224. *
  225. * FUNCTION: acpi_ex_opcode_2A_1T_1R
  226. *
  227. * PARAMETERS: walk_state - Current walk state
  228. *
  229. * RETURN: Status
  230. *
  231. * DESCRIPTION: Execute opcode with two arguments, one target, and a return
  232. * value.
  233. *
  234. ******************************************************************************/
  235. acpi_status
  236. acpi_ex_opcode_2A_1T_1R (
  237. struct acpi_walk_state *walk_state)
  238. {
  239. union acpi_operand_object **operand = &walk_state->operands[0];
  240. union acpi_operand_object *return_desc = NULL;
  241. u32 index;
  242. acpi_status status = AE_OK;
  243. acpi_size length;
  244. ACPI_FUNCTION_TRACE_STR ("ex_opcode_2A_1T_1R",
  245. acpi_ps_get_opcode_name (walk_state->opcode));
  246. /*
  247. * Execute the opcode
  248. */
  249. if (walk_state->op_info->flags & AML_MATH) {
  250. /* All simple math opcodes (add, etc.) */
  251. return_desc = acpi_ut_create_internal_object (ACPI_TYPE_INTEGER);
  252. if (!return_desc) {
  253. status = AE_NO_MEMORY;
  254. goto cleanup;
  255. }
  256. return_desc->integer.value = acpi_ex_do_math_op (walk_state->opcode,
  257. operand[0]->integer.value,
  258. operand[1]->integer.value);
  259. goto store_result_to_target;
  260. }
  261. switch (walk_state->opcode) {
  262. case AML_MOD_OP: /* Mod (Dividend, Divisor, remainder_result (ACPI 2.0) */
  263. return_desc = acpi_ut_create_internal_object (ACPI_TYPE_INTEGER);
  264. if (!return_desc) {
  265. status = AE_NO_MEMORY;
  266. goto cleanup;
  267. }
  268. /* return_desc will contain the remainder */
  269. status = acpi_ut_divide (operand[0]->integer.value,
  270. operand[1]->integer.value,
  271. NULL,
  272. &return_desc->integer.value);
  273. break;
  274. case AML_CONCAT_OP: /* Concatenate (Data1, Data2, Result) */
  275. status = acpi_ex_do_concatenate (operand[0], operand[1],
  276. &return_desc, walk_state);
  277. break;
  278. case AML_TO_STRING_OP: /* to_string (Buffer, Length, Result) (ACPI 2.0) */
  279. /*
  280. * Input object is guaranteed to be a buffer at this point (it may have
  281. * been converted.) Copy the raw buffer data to a new object of type String.
  282. */
  283. /*
  284. * Get the length of the new string. It is the smallest of:
  285. * 1) Length of the input buffer
  286. * 2) Max length as specified in the to_string operator
  287. * 3) Length of input buffer up to a zero byte (null terminator)
  288. *
  289. * NOTE: A length of zero is ok, and will create a zero-length, null
  290. * terminated string.
  291. */
  292. length = 0;
  293. while ((length < operand[0]->buffer.length) &&
  294. (length < operand[1]->integer.value) &&
  295. (operand[0]->buffer.pointer[length])) {
  296. length++;
  297. if (length > ACPI_MAX_STRING_CONVERSION) {
  298. status = AE_AML_STRING_LIMIT;
  299. goto cleanup;
  300. }
  301. }
  302. /* Allocate a new string object */
  303. return_desc = acpi_ut_create_string_object (length);
  304. if (!return_desc) {
  305. status = AE_NO_MEMORY;
  306. goto cleanup;
  307. }
  308. /* Copy the raw buffer data with no transform. NULL terminated already. */
  309. ACPI_MEMCPY (return_desc->string.pointer,
  310. operand[0]->buffer.pointer, length);
  311. break;
  312. case AML_CONCAT_RES_OP: /* concatenate_res_template (Buffer, Buffer, Result) (ACPI 2.0) */
  313. status = acpi_ex_concat_template (operand[0], operand[1],
  314. &return_desc, walk_state);
  315. break;
  316. case AML_INDEX_OP: /* Index (Source Index Result) */
  317. /* Create the internal return object */
  318. return_desc = acpi_ut_create_internal_object (ACPI_TYPE_LOCAL_REFERENCE);
  319. if (!return_desc) {
  320. status = AE_NO_MEMORY;
  321. goto cleanup;
  322. }
  323. index = (u32) operand[1]->integer.value;
  324. /*
  325. * At this point, the Source operand is a Package, Buffer, or String
  326. */
  327. if (ACPI_GET_OBJECT_TYPE (operand[0]) == ACPI_TYPE_PACKAGE) {
  328. /* Object to be indexed is a Package */
  329. if (index >= operand[0]->package.count) {
  330. ACPI_DEBUG_PRINT ((ACPI_DB_ERROR,
  331. "Index value (%X) beyond package end (%X)\n",
  332. index, operand[0]->package.count));
  333. status = AE_AML_PACKAGE_LIMIT;
  334. goto cleanup;
  335. }
  336. return_desc->reference.target_type = ACPI_TYPE_PACKAGE;
  337. return_desc->reference.object = operand[0];
  338. return_desc->reference.where = &operand[0]->package.elements [index];
  339. }
  340. else {
  341. /* Object to be indexed is a Buffer/String */
  342. if (index >= operand[0]->buffer.length) {
  343. ACPI_DEBUG_PRINT ((ACPI_DB_ERROR,
  344. "Index value (%X) beyond end of buffer (%X)\n",
  345. index, operand[0]->buffer.length));
  346. status = AE_AML_BUFFER_LIMIT;
  347. goto cleanup;
  348. }
  349. return_desc->reference.target_type = ACPI_TYPE_BUFFER_FIELD;
  350. return_desc->reference.object = operand[0];
  351. }
  352. /*
  353. * Add a reference to the target package/buffer/string for the life
  354. * of the index.
  355. */
  356. acpi_ut_add_reference (operand[0]);
  357. /* Complete the Index reference object */
  358. return_desc->reference.opcode = AML_INDEX_OP;
  359. return_desc->reference.offset = index;
  360. /* Store the reference to the Target */
  361. status = acpi_ex_store (return_desc, operand[2], walk_state);
  362. /* Return the reference */
  363. walk_state->result_obj = return_desc;
  364. goto cleanup;
  365. default:
  366. ACPI_REPORT_ERROR (("acpi_ex_opcode_2A_1T_1R: Unknown opcode %X\n",
  367. walk_state->opcode));
  368. status = AE_AML_BAD_OPCODE;
  369. break;
  370. }
  371. store_result_to_target:
  372. if (ACPI_SUCCESS (status)) {
  373. /*
  374. * Store the result of the operation (which is now in return_desc) into
  375. * the Target descriptor.
  376. */
  377. status = acpi_ex_store (return_desc, operand[2], walk_state);
  378. if (ACPI_FAILURE (status)) {
  379. goto cleanup;
  380. }
  381. if (!walk_state->result_obj) {
  382. walk_state->result_obj = return_desc;
  383. }
  384. }
  385. cleanup:
  386. /* Delete return object on error */
  387. if (ACPI_FAILURE (status)) {
  388. acpi_ut_remove_reference (return_desc);
  389. }
  390. return_ACPI_STATUS (status);
  391. }
  392. /*******************************************************************************
  393. *
  394. * FUNCTION: acpi_ex_opcode_2A_0T_1R
  395. *
  396. * PARAMETERS: walk_state - Current walk state
  397. *
  398. * RETURN: Status
  399. *
  400. * DESCRIPTION: Execute opcode with 2 arguments, no target, and a return value
  401. *
  402. ******************************************************************************/
  403. acpi_status
  404. acpi_ex_opcode_2A_0T_1R (
  405. struct acpi_walk_state *walk_state)
  406. {
  407. union acpi_operand_object **operand = &walk_state->operands[0];
  408. union acpi_operand_object *return_desc = NULL;
  409. acpi_status status = AE_OK;
  410. u8 logical_result = FALSE;
  411. ACPI_FUNCTION_TRACE_STR ("ex_opcode_2A_0T_1R",
  412. acpi_ps_get_opcode_name (walk_state->opcode));
  413. /* Create the internal return object */
  414. return_desc = acpi_ut_create_internal_object (ACPI_TYPE_INTEGER);
  415. if (!return_desc) {
  416. status = AE_NO_MEMORY;
  417. goto cleanup;
  418. }
  419. /*
  420. * Execute the Opcode
  421. */
  422. if (walk_state->op_info->flags & AML_LOGICAL_NUMERIC) /* logical_op (Operand0, Operand1) */ {
  423. status = acpi_ex_do_logical_numeric_op (walk_state->opcode,
  424. operand[0]->integer.value, operand[1]->integer.value,
  425. &logical_result);
  426. goto store_logical_result;
  427. }
  428. else if (walk_state->op_info->flags & AML_LOGICAL) /* logical_op (Operand0, Operand1) */ {
  429. status = acpi_ex_do_logical_op (walk_state->opcode, operand[0],
  430. operand[1], &logical_result);
  431. goto store_logical_result;
  432. }
  433. switch (walk_state->opcode) {
  434. case AML_ACQUIRE_OP: /* Acquire (mutex_object, Timeout) */
  435. status = acpi_ex_acquire_mutex (operand[1], operand[0], walk_state);
  436. if (status == AE_TIME) {
  437. logical_result = TRUE; /* TRUE = Acquire timed out */
  438. status = AE_OK;
  439. }
  440. break;
  441. case AML_WAIT_OP: /* Wait (event_object, Timeout) */
  442. status = acpi_ex_system_wait_event (operand[1], operand[0]);
  443. if (status == AE_TIME) {
  444. logical_result = TRUE; /* TRUE, Wait timed out */
  445. status = AE_OK;
  446. }
  447. break;
  448. default:
  449. ACPI_REPORT_ERROR (("acpi_ex_opcode_2A_0T_1R: Unknown opcode %X\n",
  450. walk_state->opcode));
  451. status = AE_AML_BAD_OPCODE;
  452. goto cleanup;
  453. }
  454. store_logical_result:
  455. /*
  456. * Set return value to according to logical_result. logical TRUE (all ones)
  457. * Default is FALSE (zero)
  458. */
  459. if (logical_result) {
  460. return_desc->integer.value = ACPI_INTEGER_MAX;
  461. }
  462. walk_state->result_obj = return_desc;
  463. cleanup:
  464. /* Delete return object on error */
  465. if (ACPI_FAILURE (status)) {
  466. acpi_ut_remove_reference (return_desc);
  467. }
  468. return_ACPI_STATUS (status);
  469. }