1 /******************************************************************************
3 * Module Name: dscontrol - Support for execution control opcodes -
6 *****************************************************************************/
9 * Copyright (C) 2000 - 2011, Intel Corp.
10 * All rights reserved.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions, and the following disclaimer,
17 * without modification.
18 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
19 * substantially similar to the "NO WARRANTY" disclaimer below
20 * ("Disclaimer") and any redistribution must be conditioned upon
21 * including a substantially similar Disclaimer requirement for further
22 * binary redistribution.
23 * 3. Neither the names of the above-listed copyright holders nor the names
24 * of any contributors may be used to endorse or promote products derived
25 * from this software without specific prior written permission.
27 * Alternatively, this software may be distributed under the terms of the
28 * GNU General Public License ("GPL") version 2 as published by the Free
29 * Software Foundation.
32 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
33 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
34 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR
35 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
36 * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
37 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
38 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
39 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
40 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
41 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
42 * POSSIBILITY OF SUCH DAMAGES.
45 #include <acpi/acpi.h>
51 #define _COMPONENT ACPI_DISPATCHER
52 ACPI_MODULE_NAME("dscontrol")
54 /*******************************************************************************
56 * FUNCTION: acpi_ds_exec_begin_control_op
58 * PARAMETERS: walk_list - The list that owns the walk stack
63 * DESCRIPTION: Handles all control ops encountered during control method
66 ******************************************************************************/
68 acpi_ds_exec_begin_control_op(struct acpi_walk_state
*walk_state
,
69 union acpi_parse_object
*op
)
71 acpi_status status
= AE_OK
;
72 union acpi_generic_state
*control_state
;
74 ACPI_FUNCTION_NAME(ds_exec_begin_control_op
);
76 ACPI_DEBUG_PRINT((ACPI_DB_DISPATCH
, "Op=%p Opcode=%2.2X State=%p\n",
77 op
, op
->common
.aml_opcode
, walk_state
));
79 switch (op
->common
.aml_opcode
) {
83 * If this is an additional iteration of a while loop, continue.
84 * There is no need to allocate a new control state.
86 if (walk_state
->control_state
) {
87 if (walk_state
->control_state
->control
.
88 aml_predicate_start
==
89 (walk_state
->parser_state
.aml
- 1)) {
91 /* Reset the state to start-of-loop */
93 walk_state
->control_state
->common
.state
=
94 ACPI_CONTROL_CONDITIONAL_EXECUTING
;
99 /*lint -fallthrough */
104 * IF/WHILE: Create a new control state to manage these
105 * constructs. We need to manage these as a stack, in order
108 control_state
= acpi_ut_create_control_state();
109 if (!control_state
) {
110 status
= AE_NO_MEMORY
;
114 * Save a pointer to the predicate for multiple executions
117 control_state
->control
.aml_predicate_start
=
118 walk_state
->parser_state
.aml
- 1;
119 control_state
->control
.package_end
=
120 walk_state
->parser_state
.pkg_end
;
121 control_state
->control
.opcode
= op
->common
.aml_opcode
;
123 /* Push the control state on this walk's control stack */
125 acpi_ut_push_generic_state(&walk_state
->control_state
,
131 /* Predicate is in the state object */
132 /* If predicate is true, the IF was executed, ignore ELSE part */
134 if (walk_state
->last_predicate
) {
135 status
= AE_CTRL_TRUE
;
151 /*******************************************************************************
153 * FUNCTION: acpi_ds_exec_end_control_op
155 * PARAMETERS: walk_list - The list that owns the walk stack
156 * Op - The control Op
160 * DESCRIPTION: Handles all control ops encountered during control method
163 ******************************************************************************/
166 acpi_ds_exec_end_control_op(struct acpi_walk_state
* walk_state
,
167 union acpi_parse_object
* op
)
169 acpi_status status
= AE_OK
;
170 union acpi_generic_state
*control_state
;
172 ACPI_FUNCTION_NAME(ds_exec_end_control_op
);
174 switch (op
->common
.aml_opcode
) {
177 ACPI_DEBUG_PRINT((ACPI_DB_DISPATCH
, "[IF_OP] Op=%p\n", op
));
180 * Save the result of the predicate in case there is an
183 walk_state
->last_predicate
=
184 (u8
)walk_state
->control_state
->common
.value
;
187 * Pop the control state that was created at the start
188 * of the IF and free it
191 acpi_ut_pop_generic_state(&walk_state
->control_state
);
192 acpi_ut_delete_generic_state(control_state
);
201 ACPI_DEBUG_PRINT((ACPI_DB_DISPATCH
, "[WHILE_OP] Op=%p\n", op
));
203 control_state
= walk_state
->control_state
;
204 if (control_state
->common
.value
) {
206 /* Predicate was true, the body of the loop was just executed */
209 * This loop counter mechanism allows the interpreter to escape
210 * possibly infinite loops. This can occur in poorly written AML
211 * when the hardware does not respond within a while loop and the
212 * loop does not implement a timeout.
214 control_state
->control
.loop_count
++;
215 if (control_state
->control
.loop_count
>
216 ACPI_MAX_LOOP_ITERATIONS
) {
217 status
= AE_AML_INFINITE_LOOP
;
222 * Go back and evaluate the predicate and maybe execute the loop
225 status
= AE_CTRL_PENDING
;
226 walk_state
->aml_last_while
=
227 control_state
->control
.aml_predicate_start
;
231 /* Predicate was false, terminate this while loop */
233 ACPI_DEBUG_PRINT((ACPI_DB_DISPATCH
,
234 "[WHILE_OP] termination! Op=%p\n", op
));
236 /* Pop this control state and free it */
239 acpi_ut_pop_generic_state(&walk_state
->control_state
);
240 acpi_ut_delete_generic_state(control_state
);
245 ACPI_DEBUG_PRINT((ACPI_DB_DISPATCH
,
246 "[RETURN_OP] Op=%p Arg=%p\n", op
,
247 op
->common
.value
.arg
));
250 * One optional operand -- the return value
251 * It can be either an immediate operand or a result that
252 * has been bubbled up the tree
254 if (op
->common
.value
.arg
) {
256 /* Since we have a real Return(), delete any implicit return */
258 acpi_ds_clear_implicit_return(walk_state
);
260 /* Return statement has an immediate operand */
263 acpi_ds_create_operands(walk_state
,
264 op
->common
.value
.arg
);
265 if (ACPI_FAILURE(status
)) {
270 * If value being returned is a Reference (such as
271 * an arg or local), resolve it now because it may
272 * cease to exist at the end of the method.
275 acpi_ex_resolve_to_value(&walk_state
->operands
[0],
277 if (ACPI_FAILURE(status
)) {
282 * Get the return value and save as the last result
283 * value. This is the only place where walk_state->return_desc
284 * is set to anything other than zero!
286 walk_state
->return_desc
= walk_state
->operands
[0];
287 } else if (walk_state
->result_count
) {
289 /* Since we have a real Return(), delete any implicit return */
291 acpi_ds_clear_implicit_return(walk_state
);
294 * The return value has come from a previous calculation.
296 * If value being returned is a Reference (such as
297 * an arg or local), resolve it now because it may
298 * cease to exist at the end of the method.
300 * Allow references created by the Index operator to return
303 if ((ACPI_GET_DESCRIPTOR_TYPE
304 (walk_state
->results
->results
.obj_desc
[0]) ==
305 ACPI_DESC_TYPE_OPERAND
)
306 && ((walk_state
->results
->results
.obj_desc
[0])->
307 common
.type
== ACPI_TYPE_LOCAL_REFERENCE
)
308 && ((walk_state
->results
->results
.obj_desc
[0])->
309 reference
.class != ACPI_REFCLASS_INDEX
)) {
311 acpi_ex_resolve_to_value(&walk_state
->
315 if (ACPI_FAILURE(status
)) {
320 walk_state
->return_desc
=
321 walk_state
->results
->results
.obj_desc
[0];
323 /* No return operand */
325 if (walk_state
->num_operands
) {
326 acpi_ut_remove_reference(walk_state
->
330 walk_state
->operands
[0] = NULL
;
331 walk_state
->num_operands
= 0;
332 walk_state
->return_desc
= NULL
;
335 ACPI_DEBUG_PRINT((ACPI_DB_DISPATCH
,
336 "Completed RETURN_OP State=%p, RetVal=%p\n",
337 walk_state
, walk_state
->return_desc
));
339 /* End the control method execution right now */
341 status
= AE_CTRL_TERMINATE
;
346 /* Just do nothing! */
349 case AML_BREAK_POINT_OP
:
352 * Set the single-step flag. This will cause the debugger (if present)
353 * to break to the console within the AML debugger at the start of the
354 * next AML instruction.
356 ACPI_DEBUGGER_EXEC(acpi_gbl_cm_single_step
= TRUE
);
357 ACPI_DEBUGGER_EXEC(acpi_os_printf
358 ("**break** Executed AML BreakPoint opcode\n"));
360 /* Call to the OSL in case OS wants a piece of the action */
362 status
= acpi_os_signal(ACPI_SIGNAL_BREAKPOINT
,
363 "Executed AML Breakpoint opcode");
367 case AML_CONTINUE_OP
: /* ACPI 2.0 */
369 /* Pop and delete control states until we find a while */
371 while (walk_state
->control_state
&&
372 (walk_state
->control_state
->control
.opcode
!=
375 acpi_ut_pop_generic_state(&walk_state
->
377 acpi_ut_delete_generic_state(control_state
);
380 /* No while found? */
382 if (!walk_state
->control_state
) {
383 return (AE_AML_NO_WHILE
);
386 /* Was: walk_state->aml_last_while = walk_state->control_state->Control.aml_predicate_start; */
388 walk_state
->aml_last_while
=
389 walk_state
->control_state
->control
.package_end
;
391 /* Return status depending on opcode */
393 if (op
->common
.aml_opcode
== AML_BREAK_OP
) {
394 status
= AE_CTRL_BREAK
;
396 status
= AE_CTRL_CONTINUE
;
402 ACPI_ERROR((AE_INFO
, "Unknown control opcode=0x%X Op=%p",
403 op
->common
.aml_opcode
, op
));
405 status
= AE_AML_BAD_OPCODE
;