1 /******************************************************************************
3 * Module Name: psparse - Parser top level AML parse routines
5 *****************************************************************************/
7 /******************************************************************************
11 * Some or all of this work - Copyright (c) 1999 - 2018, Intel Corp.
12 * All rights reserved.
16 * 2.1. This is your license from Intel Corp. under its intellectual property
17 * rights. You may have additional license terms from the party that provided
18 * you this software, covering your right to use that party's intellectual
21 * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a
22 * copy of the source code appearing in this file ("Covered Code") an
23 * irrevocable, perpetual, worldwide license under Intel's copyrights in the
24 * base code distributed originally by Intel ("Original Intel Code") to copy,
25 * make derivatives, distribute, use and display any portion of the Covered
26 * Code in any form, with the right to sublicense such rights; and
28 * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent
29 * license (with the right to sublicense), under only those claims of Intel
30 * patents that are infringed by the Original Intel Code, to make, use, sell,
31 * offer to sell, and import the Covered Code and derivative works thereof
32 * solely to the minimum extent necessary to exercise the above copyright
33 * license, and in no event shall the patent license extend to any additions
34 * to or modifications of the Original Intel Code. No other license or right
35 * is granted directly or by implication, estoppel or otherwise;
37 * The above copyright and patent license is granted only if the following
42 * 3.1. Redistribution of Source with Rights to Further Distribute Source.
43 * Redistribution of source code of any substantial portion of the Covered
44 * Code or modification with rights to further distribute source must include
45 * the above Copyright Notice, the above License, this list of Conditions,
46 * and the following Disclaimer and Export Compliance provision. In addition,
47 * Licensee must cause all Covered Code to which Licensee contributes to
48 * contain a file documenting the changes Licensee made to create that Covered
49 * Code and the date of any change. Licensee must include in that file the
50 * documentation of any changes made by any predecessor Licensee. Licensee
51 * must include a prominent statement that the modification is derived,
52 * directly or indirectly, from Original Intel Code.
54 * 3.2. Redistribution of Source with no Rights to Further Distribute Source.
55 * Redistribution of source code of any substantial portion of the Covered
56 * Code or modification without rights to further distribute source must
57 * include the following Disclaimer and Export Compliance provision in the
58 * documentation and/or other materials provided with distribution. In
59 * addition, Licensee may not authorize further sublicense of source of any
60 * portion of the Covered Code, and must include terms to the effect that the
61 * license from Licensee to its licensee is limited to the intellectual
62 * property embodied in the software Licensee provides to its licensee, and
63 * not to intellectual property embodied in modifications its licensee may
66 * 3.3. Redistribution of Executable. Redistribution in executable form of any
67 * substantial portion of the Covered Code or modification must reproduce the
68 * above Copyright Notice, and the following Disclaimer and Export Compliance
69 * provision in the documentation and/or other materials provided with the
72 * 3.4. Intel retains all right, title, and interest in and to the Original
75 * 3.5. Neither the name Intel nor any other trademark owned or controlled by
76 * Intel shall be used in advertising or otherwise to promote the sale, use or
77 * other dealings in products derived from or relating to the Covered Code
78 * without prior written authorization from Intel.
80 * 4. Disclaimer and Export Compliance
82 * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED
83 * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE
84 * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE,
85 * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY
86 * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY
87 * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A
90 * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES
91 * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR
92 * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT,
93 * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY
94 * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL
95 * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS
96 * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY
99 * 4.3. Licensee shall not export, either directly or indirectly, any of this
100 * software or system incorporating such software without first obtaining any
101 * required license or other approval from the U. S. Department of Commerce or
102 * any other agency or department of the United States Government. In the
103 * event Licensee exports any such software from the United States or
104 * re-exports any such software from a foreign destination, Licensee shall
105 * ensure that the distribution and export/re-export of the software is in
106 * compliance with all laws, regulations, orders, or other restrictions of the
107 * U.S. Export Administration Regulations. Licensee agrees that neither it nor
108 * any of its subsidiaries will export/re-export any technical data, process,
109 * software, or service, directly or indirectly, to any country for which the
110 * United States government or any agency thereof requires an export license,
111 * other governmental approval, or letter of assurance, without first obtaining
112 * such license, approval or letter.
114 *****************************************************************************
116 * Alternatively, you may choose to be licensed under the terms of the
119 * Redistribution and use in source and binary forms, with or without
120 * modification, are permitted provided that the following conditions
122 * 1. Redistributions of source code must retain the above copyright
123 * notice, this list of conditions, and the following disclaimer,
124 * without modification.
125 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
126 * substantially similar to the "NO WARRANTY" disclaimer below
127 * ("Disclaimer") and any redistribution must be conditioned upon
128 * including a substantially similar Disclaimer requirement for further
129 * binary redistribution.
130 * 3. Neither the names of the above-listed copyright holders nor the names
131 * of any contributors may be used to endorse or promote products derived
132 * from this software without specific prior written permission.
134 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
135 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
136 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
137 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
138 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
139 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
140 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
141 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
142 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
143 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
144 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
146 * Alternatively, you may choose to be licensed under the terms of the
147 * GNU General Public License ("GPL") version 2 as published by the Free
148 * Software Foundation.
150 *****************************************************************************/
153 * Parse the AML and build an operation tree as most interpreters,
154 * like Perl, do. Parsing is done by hand rather than with a YACC
155 * generated parser to tightly constrain stack and dynamic memory
156 * usage. At the same time, parsing is kept flexible and the code
157 * fairly compact by parsing based on a list of AML opcode
158 * templates in AmlOpInfo[]
162 #include "accommon.h"
163 #include "acparser.h"
164 #include "acdispat.h"
166 #include "acinterp.h"
167 #include "acnamesp.h"
169 #define _COMPONENT ACPI_PARSER
170 ACPI_MODULE_NAME ("psparse")
173 /*******************************************************************************
175 * FUNCTION: AcpiPsGetOpcodeSize
177 * PARAMETERS: Opcode - An AML opcode
179 * RETURN: Size of the opcode, in bytes (1 or 2)
181 * DESCRIPTION: Get the size of the current opcode.
183 ******************************************************************************/
186 AcpiPsGetOpcodeSize (
190 /* Extended (2-byte) opcode if > 255 */
197 /* Otherwise, just a single byte opcode */
203 /*******************************************************************************
205 * FUNCTION: AcpiPsPeekOpcode
207 * PARAMETERS: ParserState - A parser state object
209 * RETURN: Next AML opcode
211 * DESCRIPTION: Get next AML opcode (without incrementing AML pointer)
213 ******************************************************************************/
217 ACPI_PARSE_STATE
*ParserState
)
223 Aml
= ParserState
->Aml
;
224 Opcode
= (UINT16
) ACPI_GET8 (Aml
);
226 if (Opcode
== AML_EXTENDED_PREFIX
)
228 /* Extended opcode, get the second opcode byte */
231 Opcode
= (UINT16
) ((Opcode
<< 8) | ACPI_GET8 (Aml
));
238 /*******************************************************************************
240 * FUNCTION: AcpiPsCompleteThisOp
242 * PARAMETERS: WalkState - Current State
243 * Op - Op to complete
247 * DESCRIPTION: Perform any cleanup at the completion of an Op.
249 ******************************************************************************/
252 AcpiPsCompleteThisOp (
253 ACPI_WALK_STATE
*WalkState
,
254 ACPI_PARSE_OBJECT
*Op
)
256 ACPI_PARSE_OBJECT
*Prev
;
257 ACPI_PARSE_OBJECT
*Next
;
258 const ACPI_OPCODE_INFO
*ParentInfo
;
259 ACPI_PARSE_OBJECT
*ReplacementOp
= NULL
;
260 ACPI_STATUS Status
= AE_OK
;
263 ACPI_FUNCTION_TRACE_PTR (PsCompleteThisOp
, Op
);
266 /* Check for null Op, can happen if AML code is corrupt */
270 return_ACPI_STATUS (AE_OK
); /* OK for now */
273 AcpiExStopTraceOpcode (Op
, WalkState
);
275 /* Delete this op and the subtree below it if asked to */
277 if (((WalkState
->ParseFlags
& ACPI_PARSE_TREE_MASK
) != ACPI_PARSE_DELETE_TREE
) ||
278 (WalkState
->OpInfo
->Class
== AML_CLASS_ARGUMENT
))
280 return_ACPI_STATUS (AE_OK
);
283 /* Make sure that we only delete this subtree */
285 if (Op
->Common
.Parent
)
287 Prev
= Op
->Common
.Parent
->Common
.Value
.Arg
;
290 /* Nothing more to do */
296 * Check if we need to replace the operator and its subtree
297 * with a return value op (placeholder op)
299 ParentInfo
= AcpiPsGetOpcodeInfo (Op
->Common
.Parent
->Common
.AmlOpcode
);
301 switch (ParentInfo
->Class
)
303 case AML_CLASS_CONTROL
:
307 case AML_CLASS_CREATE
:
309 * These opcodes contain TermArg operands. The current
310 * op must be replaced by a placeholder return op
312 ReplacementOp
= AcpiPsAllocOp (
313 AML_INT_RETURN_VALUE_OP
, Op
->Common
.Aml
);
316 Status
= AE_NO_MEMORY
;
320 case AML_CLASS_NAMED_OBJECT
:
322 * These opcodes contain TermArg operands. The current
323 * op must be replaced by a placeholder return op
325 if ((Op
->Common
.Parent
->Common
.AmlOpcode
== AML_REGION_OP
) ||
326 (Op
->Common
.Parent
->Common
.AmlOpcode
== AML_DATA_REGION_OP
) ||
327 (Op
->Common
.Parent
->Common
.AmlOpcode
== AML_BUFFER_OP
) ||
328 (Op
->Common
.Parent
->Common
.AmlOpcode
== AML_PACKAGE_OP
) ||
329 (Op
->Common
.Parent
->Common
.AmlOpcode
== AML_BANK_FIELD_OP
) ||
330 (Op
->Common
.Parent
->Common
.AmlOpcode
== AML_VARIABLE_PACKAGE_OP
))
332 ReplacementOp
= AcpiPsAllocOp (
333 AML_INT_RETURN_VALUE_OP
, Op
->Common
.Aml
);
336 Status
= AE_NO_MEMORY
;
339 else if ((Op
->Common
.Parent
->Common
.AmlOpcode
== AML_NAME_OP
) &&
340 (WalkState
->PassNumber
<= ACPI_IMODE_LOAD_PASS2
))
342 if ((Op
->Common
.AmlOpcode
== AML_BUFFER_OP
) ||
343 (Op
->Common
.AmlOpcode
== AML_PACKAGE_OP
) ||
344 (Op
->Common
.AmlOpcode
== AML_VARIABLE_PACKAGE_OP
))
346 ReplacementOp
= AcpiPsAllocOp (Op
->Common
.AmlOpcode
,
350 Status
= AE_NO_MEMORY
;
354 ReplacementOp
->Named
.Data
= Op
->Named
.Data
;
355 ReplacementOp
->Named
.Length
= Op
->Named
.Length
;
363 ReplacementOp
= AcpiPsAllocOp (
364 AML_INT_RETURN_VALUE_OP
, Op
->Common
.Aml
);
367 Status
= AE_NO_MEMORY
;
371 /* We must unlink this op from the parent tree */
375 /* This op is the first in the list */
379 ReplacementOp
->Common
.Parent
= Op
->Common
.Parent
;
380 ReplacementOp
->Common
.Value
.Arg
= NULL
;
381 ReplacementOp
->Common
.Node
= Op
->Common
.Node
;
382 Op
->Common
.Parent
->Common
.Value
.Arg
= ReplacementOp
;
383 ReplacementOp
->Common
.Next
= Op
->Common
.Next
;
387 Op
->Common
.Parent
->Common
.Value
.Arg
= Op
->Common
.Next
;
391 /* Search the parent list */
395 /* Traverse all siblings in the parent's argument list */
397 Next
= Prev
->Common
.Next
;
402 ReplacementOp
->Common
.Parent
= Op
->Common
.Parent
;
403 ReplacementOp
->Common
.Value
.Arg
= NULL
;
404 ReplacementOp
->Common
.Node
= Op
->Common
.Node
;
405 Prev
->Common
.Next
= ReplacementOp
;
406 ReplacementOp
->Common
.Next
= Op
->Common
.Next
;
411 Prev
->Common
.Next
= Op
->Common
.Next
;
422 /* Now we can actually delete the subtree rooted at Op */
424 AcpiPsDeleteParseTree (Op
);
425 return_ACPI_STATUS (Status
);
429 /*******************************************************************************
431 * FUNCTION: AcpiPsNextParseState
433 * PARAMETERS: WalkState - Current state
434 * Op - Current parse op
435 * CallbackStatus - Status from previous operation
439 * DESCRIPTION: Update the parser state based upon the return exception from
440 * the parser callback.
442 ******************************************************************************/
445 AcpiPsNextParseState (
446 ACPI_WALK_STATE
*WalkState
,
447 ACPI_PARSE_OBJECT
*Op
,
448 ACPI_STATUS CallbackStatus
)
450 ACPI_PARSE_STATE
*ParserState
= &WalkState
->ParserState
;
451 ACPI_STATUS Status
= AE_CTRL_PENDING
;
454 ACPI_FUNCTION_TRACE_PTR (PsNextParseState
, Op
);
457 switch (CallbackStatus
)
459 case AE_CTRL_TERMINATE
:
461 * A control method was terminated via a RETURN statement.
462 * The walk of this method is complete.
464 ParserState
->Aml
= ParserState
->AmlEnd
;
465 Status
= AE_CTRL_TERMINATE
;
470 ParserState
->Aml
= WalkState
->AmlLastWhile
;
471 WalkState
->ControlState
->Common
.Value
= FALSE
;
472 Status
= AE_CTRL_BREAK
;
475 case AE_CTRL_CONTINUE
:
477 ParserState
->Aml
= WalkState
->AmlLastWhile
;
478 Status
= AE_CTRL_CONTINUE
;
481 case AE_CTRL_PENDING
:
483 ParserState
->Aml
= WalkState
->AmlLastWhile
;
489 ParserState
->Aml
= ParserState
->Scope
->ParseScope
.PkgEnd
;
496 * Predicate of an IF was true, and we are at the matching ELSE.
497 * Just close out this package
499 ParserState
->Aml
= AcpiPsGetNextPackageEnd (ParserState
);
500 Status
= AE_CTRL_PENDING
;
505 * Either an IF/WHILE Predicate was false or we encountered a BREAK
506 * opcode. In both cases, we do not execute the rest of the
507 * package; We simply close out the parent (finishing the walk of
508 * this branch of the tree) and continue execution at the parent
511 ParserState
->Aml
= ParserState
->Scope
->ParseScope
.PkgEnd
;
513 /* In the case of a BREAK, just force a predicate (if any) to FALSE */
515 WalkState
->ControlState
->Common
.Value
= FALSE
;
516 Status
= AE_CTRL_END
;
519 case AE_CTRL_TRANSFER
:
521 /* A method call (invocation) -- transfer control */
523 Status
= AE_CTRL_TRANSFER
;
524 WalkState
->PrevOp
= Op
;
525 WalkState
->MethodCallOp
= Op
;
526 WalkState
->MethodCallNode
= (Op
->Common
.Value
.Arg
)->Common
.Node
;
528 /* Will return value (if any) be used by the caller? */
530 WalkState
->ReturnUsed
= AcpiDsIsResultUsed (Op
, WalkState
);
535 Status
= CallbackStatus
;
536 if ((CallbackStatus
& AE_CODE_MASK
) == AE_CODE_CONTROL
)
543 return_ACPI_STATUS (Status
);
547 /*******************************************************************************
549 * FUNCTION: AcpiPsParseAml
551 * PARAMETERS: WalkState - Current state
556 * DESCRIPTION: Parse raw AML and return a tree of ops
558 ******************************************************************************/
562 ACPI_WALK_STATE
*WalkState
)
565 ACPI_THREAD_STATE
*Thread
;
566 ACPI_THREAD_STATE
*PrevWalkList
= AcpiGbl_CurrentWalkList
;
567 ACPI_WALK_STATE
*PreviousWalkState
;
570 ACPI_FUNCTION_TRACE (PsParseAml
);
572 ACPI_DEBUG_PRINT ((ACPI_DB_PARSE
,
573 "Entered with WalkState=%p Aml=%p size=%X\n",
574 WalkState
, WalkState
->ParserState
.Aml
,
575 WalkState
->ParserState
.AmlSize
));
577 if (!WalkState
->ParserState
.Aml
)
579 return_ACPI_STATUS (AE_BAD_ADDRESS
);
582 /* Create and initialize a new thread state */
584 Thread
= AcpiUtCreateThreadState ();
587 if (WalkState
->MethodDesc
)
589 /* Executing a control method - additional cleanup */
591 AcpiDsTerminateControlMethod (WalkState
->MethodDesc
, WalkState
);
594 AcpiDsDeleteWalkState (WalkState
);
595 return_ACPI_STATUS (AE_NO_MEMORY
);
598 WalkState
->Thread
= Thread
;
601 * If executing a method, the starting SyncLevel is this method's
604 if (WalkState
->MethodDesc
)
606 WalkState
->Thread
->CurrentSyncLevel
=
607 WalkState
->MethodDesc
->Method
.SyncLevel
;
610 AcpiDsPushWalkState (WalkState
, Thread
);
613 * This global allows the AML debugger to get a handle to the currently
614 * executing control method.
616 AcpiGbl_CurrentWalkList
= Thread
;
619 * Execute the walk loop as long as there is a valid Walk State. This
620 * handles nested control method invocations without recursion.
622 ACPI_DEBUG_PRINT ((ACPI_DB_PARSE
, "State=%p\n", WalkState
));
627 if (ACPI_SUCCESS (Status
))
630 * The ParseLoop executes AML until the method terminates
631 * or calls another method.
633 Status
= AcpiPsParseLoop (WalkState
);
636 ACPI_DEBUG_PRINT ((ACPI_DB_PARSE
,
637 "Completed one call to walk loop, %s State=%p\n",
638 AcpiFormatException (Status
), WalkState
));
640 if (WalkState
->MethodPathname
&& WalkState
->MethodIsNested
)
642 /* Optional object evaluation log */
644 ACPI_DEBUG_PRINT_RAW ((ACPI_DB_EVALUATION
, "%-26s: %*s%s\n",
645 " Exit nested method",
646 (WalkState
->MethodNestingDepth
+ 1) * 3, " ",
647 &WalkState
->MethodPathname
[1]));
649 ACPI_FREE (WalkState
->MethodPathname
);
650 WalkState
->MethodIsNested
= FALSE
;
652 if (Status
== AE_CTRL_TRANSFER
)
655 * A method call was detected.
656 * Transfer control to the called control method
658 Status
= AcpiDsCallControlMethod (Thread
, WalkState
, NULL
);
659 if (ACPI_FAILURE (Status
))
661 Status
= AcpiDsMethodError (Status
, WalkState
);
665 * If the transfer to the new method method call worked
666 *, a new walk state was created -- get it
668 WalkState
= AcpiDsGetCurrentWalkState (Thread
);
671 else if (Status
== AE_CTRL_TERMINATE
)
675 else if ((Status
!= AE_OK
) && (WalkState
->MethodDesc
))
677 /* Either the method parse or actual execution failed */
679 AcpiExExitInterpreter ();
680 if (Status
== AE_ABORT_METHOD
)
682 AcpiNsPrintNodePathname (
683 WalkState
->MethodNode
, "Method aborted:");
688 ACPI_ERROR_METHOD ("Method parse/execution failed",
689 WalkState
->MethodNode
, NULL
, Status
);
691 AcpiExEnterInterpreter ();
693 /* Check for possible multi-thread reentrancy problem */
695 if ((Status
== AE_ALREADY_EXISTS
) &&
696 (!(WalkState
->MethodDesc
->Method
.InfoFlags
&
697 ACPI_METHOD_SERIALIZED
)))
700 * Method is not serialized and tried to create an object
701 * twice. The probable cause is that the method cannot
702 * handle reentrancy. Mark as "pending serialized" now, and
703 * then mark "serialized" when the last thread exits.
705 WalkState
->MethodDesc
->Method
.InfoFlags
|=
706 ACPI_METHOD_SERIALIZED_PENDING
;
710 /* We are done with this walk, move on to the parent if any */
712 WalkState
= AcpiDsPopWalkState (Thread
);
714 /* Reset the current scope to the beginning of scope stack */
716 AcpiDsScopeStackClear (WalkState
);
719 * If we just returned from the execution of a control method or if we
720 * encountered an error during the method parse phase, there's lots of
723 if (((WalkState
->ParseFlags
& ACPI_PARSE_MODE_MASK
) ==
724 ACPI_PARSE_EXECUTE
&&
725 !(WalkState
->ParseFlags
& ACPI_PARSE_MODULE_LEVEL
)) ||
726 (ACPI_FAILURE (Status
)))
728 AcpiDsTerminateControlMethod (WalkState
->MethodDesc
, WalkState
);
731 /* Delete this walk state and all linked control states */
733 AcpiPsCleanupScope (&WalkState
->ParserState
);
734 PreviousWalkState
= WalkState
;
736 ACPI_DEBUG_PRINT ((ACPI_DB_PARSE
,
737 "ReturnValue=%p, ImplicitValue=%p State=%p\n",
738 WalkState
->ReturnDesc
, WalkState
->ImplicitReturnObj
, WalkState
));
740 /* Check if we have restarted a preempted walk */
742 WalkState
= AcpiDsGetCurrentWalkState (Thread
);
745 if (ACPI_SUCCESS (Status
))
748 * There is another walk state, restart it.
749 * If the method return value is not used by the parent,
750 * The object is deleted
752 if (!PreviousWalkState
->ReturnDesc
)
755 * In slack mode execution, if there is no return value
756 * we should implicitly return zero (0) as a default value.
758 if (AcpiGbl_EnableInterpreterSlack
&&
759 !PreviousWalkState
->ImplicitReturnObj
)
761 PreviousWalkState
->ImplicitReturnObj
=
762 AcpiUtCreateIntegerObject ((UINT64
) 0);
763 if (!PreviousWalkState
->ImplicitReturnObj
)
765 return_ACPI_STATUS (AE_NO_MEMORY
);
769 /* Restart the calling control method */
771 Status
= AcpiDsRestartControlMethod (WalkState
,
772 PreviousWalkState
->ImplicitReturnObj
);
777 * We have a valid return value, delete any implicit
780 AcpiDsClearImplicitReturn (PreviousWalkState
);
782 Status
= AcpiDsRestartControlMethod (WalkState
,
783 PreviousWalkState
->ReturnDesc
);
785 if (ACPI_SUCCESS (Status
))
787 WalkState
->WalkType
|= ACPI_WALK_METHOD_RESTART
;
792 /* On error, delete any return object or implicit return */
794 AcpiUtRemoveReference (PreviousWalkState
->ReturnDesc
);
795 AcpiDsClearImplicitReturn (PreviousWalkState
);
800 * Just completed a 1st-level method, save the final internal return
803 else if (PreviousWalkState
->CallerReturnDesc
)
805 if (PreviousWalkState
->ImplicitReturnObj
)
807 *(PreviousWalkState
->CallerReturnDesc
) =
808 PreviousWalkState
->ImplicitReturnObj
;
812 /* NULL if no return value */
814 *(PreviousWalkState
->CallerReturnDesc
) =
815 PreviousWalkState
->ReturnDesc
;
820 if (PreviousWalkState
->ReturnDesc
)
822 /* Caller doesn't want it, must delete it */
824 AcpiUtRemoveReference (PreviousWalkState
->ReturnDesc
);
826 if (PreviousWalkState
->ImplicitReturnObj
)
828 /* Caller doesn't want it, must delete it */
830 AcpiUtRemoveReference (PreviousWalkState
->ImplicitReturnObj
);
834 AcpiDsDeleteWalkState (PreviousWalkState
);
839 AcpiExReleaseAllMutexes (Thread
);
840 AcpiUtDeleteGenericState (ACPI_CAST_PTR (ACPI_GENERIC_STATE
, Thread
));
841 AcpiGbl_CurrentWalkList
= PrevWalkList
;
842 return_ACPI_STATUS (Status
);