1 /******************************************************************************
3 * Module Name: psparse - Parser top level AML parse routines
5 *****************************************************************************/
7 /******************************************************************************
11 * Some or all of this work - Copyright (c) 1999 - 2017, 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"
168 #define _COMPONENT ACPI_PARSER
169 ACPI_MODULE_NAME ("psparse")
172 /*******************************************************************************
174 * FUNCTION: AcpiPsGetOpcodeSize
176 * PARAMETERS: Opcode - An AML opcode
178 * RETURN: Size of the opcode, in bytes (1 or 2)
180 * DESCRIPTION: Get the size of the current opcode.
182 ******************************************************************************/
185 AcpiPsGetOpcodeSize (
189 /* Extended (2-byte) opcode if > 255 */
196 /* Otherwise, just a single byte opcode */
202 /*******************************************************************************
204 * FUNCTION: AcpiPsPeekOpcode
206 * PARAMETERS: ParserState - A parser state object
208 * RETURN: Next AML opcode
210 * DESCRIPTION: Get next AML opcode (without incrementing AML pointer)
212 ******************************************************************************/
216 ACPI_PARSE_STATE *ParserState)
222 Aml = ParserState->Aml;
223 Opcode = (UINT16) ACPI_GET8 (Aml);
225 if (Opcode == AML_EXTENDED_PREFIX)
227 /* Extended opcode, get the second opcode byte */
230 Opcode = (UINT16) ((Opcode << 8) | ACPI_GET8 (Aml));
237 /*******************************************************************************
239 * FUNCTION: AcpiPsCompleteThisOp
241 * PARAMETERS: WalkState - Current State
242 * Op - Op to complete
246 * DESCRIPTION: Perform any cleanup at the completion of an Op.
248 ******************************************************************************/
251 AcpiPsCompleteThisOp (
252 ACPI_WALK_STATE *WalkState,
253 ACPI_PARSE_OBJECT *Op)
255 ACPI_PARSE_OBJECT *Prev;
256 ACPI_PARSE_OBJECT *Next;
257 const ACPI_OPCODE_INFO *ParentInfo;
258 ACPI_PARSE_OBJECT *ReplacementOp = NULL;
259 ACPI_STATUS Status = AE_OK;
262 ACPI_FUNCTION_TRACE_PTR (PsCompleteThisOp, Op);
265 /* Check for null Op, can happen if AML code is corrupt */
269 return_ACPI_STATUS (AE_OK); /* OK for now */
272 AcpiExStopTraceOpcode (Op, WalkState);
274 /* Delete this op and the subtree below it if asked to */
276 if (((WalkState->ParseFlags & ACPI_PARSE_TREE_MASK) != ACPI_PARSE_DELETE_TREE) ||
277 (WalkState->OpInfo->Class == AML_CLASS_ARGUMENT))
279 return_ACPI_STATUS (AE_OK);
282 /* Make sure that we only delete this subtree */
284 if (Op->Common.Parent)
286 Prev = Op->Common.Parent->Common.Value.Arg;
289 /* Nothing more to do */
295 * Check if we need to replace the operator and its subtree
296 * with a return value op (placeholder op)
298 ParentInfo = AcpiPsGetOpcodeInfo (Op->Common.Parent->Common.AmlOpcode);
300 switch (ParentInfo->Class)
302 case AML_CLASS_CONTROL:
306 case AML_CLASS_CREATE:
308 * These opcodes contain TermArg operands. The current
309 * op must be replaced by a placeholder return op
311 ReplacementOp = AcpiPsAllocOp (
312 AML_INT_RETURN_VALUE_OP, Op->Common.Aml);
315 Status = AE_NO_MEMORY;
319 case AML_CLASS_NAMED_OBJECT:
321 * These opcodes contain TermArg operands. The current
322 * op must be replaced by a placeholder return op
324 if ((Op->Common.Parent->Common.AmlOpcode == AML_REGION_OP) ||
325 (Op->Common.Parent->Common.AmlOpcode == AML_DATA_REGION_OP) ||
326 (Op->Common.Parent->Common.AmlOpcode == AML_BUFFER_OP) ||
327 (Op->Common.Parent->Common.AmlOpcode == AML_PACKAGE_OP) ||
328 (Op->Common.Parent->Common.AmlOpcode == AML_BANK_FIELD_OP) ||
329 (Op->Common.Parent->Common.AmlOpcode == AML_VARIABLE_PACKAGE_OP))
331 ReplacementOp = AcpiPsAllocOp (
332 AML_INT_RETURN_VALUE_OP, Op->Common.Aml);
335 Status = AE_NO_MEMORY;
338 else if ((Op->Common.Parent->Common.AmlOpcode == AML_NAME_OP) &&
339 (WalkState->PassNumber <= ACPI_IMODE_LOAD_PASS2))
341 if ((Op->Common.AmlOpcode == AML_BUFFER_OP) ||
342 (Op->Common.AmlOpcode == AML_PACKAGE_OP) ||
343 (Op->Common.AmlOpcode == AML_VARIABLE_PACKAGE_OP))
345 ReplacementOp = AcpiPsAllocOp (Op->Common.AmlOpcode,
349 Status = AE_NO_MEMORY;
353 ReplacementOp->Named.Data = Op->Named.Data;
354 ReplacementOp->Named.Length = Op->Named.Length;
362 ReplacementOp = AcpiPsAllocOp (
363 AML_INT_RETURN_VALUE_OP, Op->Common.Aml);
366 Status = AE_NO_MEMORY;
370 /* We must unlink this op from the parent tree */
374 /* This op is the first in the list */
378 ReplacementOp->Common.Parent = Op->Common.Parent;
379 ReplacementOp->Common.Value.Arg = NULL;
380 ReplacementOp->Common.Node = Op->Common.Node;
381 Op->Common.Parent->Common.Value.Arg = ReplacementOp;
382 ReplacementOp->Common.Next = Op->Common.Next;
386 Op->Common.Parent->Common.Value.Arg = Op->Common.Next;
390 /* Search the parent list */
394 /* Traverse all siblings in the parent's argument list */
396 Next = Prev->Common.Next;
401 ReplacementOp->Common.Parent = Op->Common.Parent;
402 ReplacementOp->Common.Value.Arg = NULL;
403 ReplacementOp->Common.Node = Op->Common.Node;
404 Prev->Common.Next = ReplacementOp;
405 ReplacementOp->Common.Next = Op->Common.Next;
410 Prev->Common.Next = Op->Common.Next;
421 /* Now we can actually delete the subtree rooted at Op */
423 AcpiPsDeleteParseTree (Op);
424 return_ACPI_STATUS (Status);
428 /*******************************************************************************
430 * FUNCTION: AcpiPsNextParseState
432 * PARAMETERS: WalkState - Current state
433 * Op - Current parse op
434 * CallbackStatus - Status from previous operation
438 * DESCRIPTION: Update the parser state based upon the return exception from
439 * the parser callback.
441 ******************************************************************************/
444 AcpiPsNextParseState (
445 ACPI_WALK_STATE *WalkState,
446 ACPI_PARSE_OBJECT *Op,
447 ACPI_STATUS CallbackStatus)
449 ACPI_PARSE_STATE *ParserState = &WalkState->ParserState;
450 ACPI_STATUS Status = AE_CTRL_PENDING;
453 ACPI_FUNCTION_TRACE_PTR (PsNextParseState, Op);
456 switch (CallbackStatus)
458 case AE_CTRL_TERMINATE:
460 * A control method was terminated via a RETURN statement.
461 * The walk of this method is complete.
463 ParserState->Aml = ParserState->AmlEnd;
464 Status = AE_CTRL_TERMINATE;
469 ParserState->Aml = WalkState->AmlLastWhile;
470 WalkState->ControlState->Common.Value = FALSE;
471 Status = AE_CTRL_BREAK;
474 case AE_CTRL_CONTINUE:
476 ParserState->Aml = WalkState->AmlLastWhile;
477 Status = AE_CTRL_CONTINUE;
480 case AE_CTRL_PENDING:
482 ParserState->Aml = WalkState->AmlLastWhile;
488 ParserState->Aml = ParserState->Scope->ParseScope.PkgEnd;
495 * Predicate of an IF was true, and we are at the matching ELSE.
496 * Just close out this package
498 ParserState->Aml = AcpiPsGetNextPackageEnd (ParserState);
499 Status = AE_CTRL_PENDING;
504 * Either an IF/WHILE Predicate was false or we encountered a BREAK
505 * opcode. In both cases, we do not execute the rest of the
506 * package; We simply close out the parent (finishing the walk of
507 * this branch of the tree) and continue execution at the parent
510 ParserState->Aml = ParserState->Scope->ParseScope.PkgEnd;
512 /* In the case of a BREAK, just force a predicate (if any) to FALSE */
514 WalkState->ControlState->Common.Value = FALSE;
515 Status = AE_CTRL_END;
518 case AE_CTRL_TRANSFER:
520 /* A method call (invocation) -- transfer control */
522 Status = AE_CTRL_TRANSFER;
523 WalkState->PrevOp = Op;
524 WalkState->MethodCallOp = Op;
525 WalkState->MethodCallNode = (Op->Common.Value.Arg)->Common.Node;
527 /* Will return value (if any) be used by the caller? */
529 WalkState->ReturnUsed = AcpiDsIsResultUsed (Op, WalkState);
534 Status = CallbackStatus;
535 if ((CallbackStatus & AE_CODE_MASK) == AE_CODE_CONTROL)
542 return_ACPI_STATUS (Status);
546 /*******************************************************************************
548 * FUNCTION: AcpiPsParseAml
550 * PARAMETERS: WalkState - Current state
555 * DESCRIPTION: Parse raw AML and return a tree of ops
557 ******************************************************************************/
561 ACPI_WALK_STATE *WalkState)
564 ACPI_THREAD_STATE *Thread;
565 ACPI_THREAD_STATE *PrevWalkList = AcpiGbl_CurrentWalkList;
566 ACPI_WALK_STATE *PreviousWalkState;
569 ACPI_FUNCTION_TRACE (PsParseAml);
571 ACPI_DEBUG_PRINT ((ACPI_DB_PARSE,
572 "Entered with WalkState=%p Aml=%p size=%X\n",
573 WalkState, WalkState->ParserState.Aml,
574 WalkState->ParserState.AmlSize));
576 if (!WalkState->ParserState.Aml)
578 return_ACPI_STATUS (AE_NULL_OBJECT);
581 /* Create and initialize a new thread state */
583 Thread = AcpiUtCreateThreadState ();
586 if (WalkState->MethodDesc)
588 /* Executing a control method - additional cleanup */
590 AcpiDsTerminateControlMethod (WalkState->MethodDesc, WalkState);
593 AcpiDsDeleteWalkState (WalkState);
594 return_ACPI_STATUS (AE_NO_MEMORY);
597 WalkState->Thread = Thread;
600 * If executing a method, the starting SyncLevel is this method's
603 if (WalkState->MethodDesc)
605 WalkState->Thread->CurrentSyncLevel =
606 WalkState->MethodDesc->Method.SyncLevel;
609 AcpiDsPushWalkState (WalkState, Thread);
612 * This global allows the AML debugger to get a handle to the currently
613 * executing control method.
615 AcpiGbl_CurrentWalkList = Thread;
618 * Execute the walk loop as long as there is a valid Walk State. This
619 * handles nested control method invocations without recursion.
621 ACPI_DEBUG_PRINT ((ACPI_DB_PARSE, "State=%p\n", WalkState));
626 if (ACPI_SUCCESS (Status))
629 * The ParseLoop executes AML until the method terminates
630 * or calls another method.
632 Status = AcpiPsParseLoop (WalkState);
635 ACPI_DEBUG_PRINT ((ACPI_DB_PARSE,
636 "Completed one call to walk loop, %s State=%p\n",
637 AcpiFormatException (Status), WalkState));
639 if (Status == AE_CTRL_TRANSFER)
642 * A method call was detected.
643 * Transfer control to the called control method
645 Status = AcpiDsCallControlMethod (Thread, WalkState, NULL);
646 if (ACPI_FAILURE (Status))
648 Status = AcpiDsMethodError (Status, WalkState);
652 * If the transfer to the new method method call worked
653 *, a new walk state was created -- get it
655 WalkState = AcpiDsGetCurrentWalkState (Thread);
658 else if (Status == AE_CTRL_TERMINATE)
662 else if ((Status != AE_OK) && (WalkState->MethodDesc))
664 /* Either the method parse or actual execution failed */
666 AcpiExExitInterpreter ();
667 ACPI_ERROR_METHOD ("Method parse/execution failed",
668 WalkState->MethodNode, NULL, Status);
669 AcpiExEnterInterpreter ();
671 /* Check for possible multi-thread reentrancy problem */
673 if ((Status == AE_ALREADY_EXISTS) &&
674 (!(WalkState->MethodDesc->Method.InfoFlags &
675 ACPI_METHOD_SERIALIZED)))
678 * Method is not serialized and tried to create an object
679 * twice. The probable cause is that the method cannot
680 * handle reentrancy. Mark as "pending serialized" now, and
681 * then mark "serialized" when the last thread exits.
683 WalkState->MethodDesc->Method.InfoFlags |=
684 ACPI_METHOD_SERIALIZED_PENDING;
688 /* We are done with this walk, move on to the parent if any */
690 WalkState = AcpiDsPopWalkState (Thread);
692 /* Reset the current scope to the beginning of scope stack */
694 AcpiDsScopeStackClear (WalkState);
697 * If we just returned from the execution of a control method or if we
698 * encountered an error during the method parse phase, there's lots of
701 if (((WalkState->ParseFlags & ACPI_PARSE_MODE_MASK) ==
702 ACPI_PARSE_EXECUTE &&
703 !(WalkState->ParseFlags & ACPI_PARSE_MODULE_LEVEL)) ||
704 (ACPI_FAILURE (Status)))
706 AcpiDsTerminateControlMethod (WalkState->MethodDesc, WalkState);
709 /* Delete this walk state and all linked control states */
711 AcpiPsCleanupScope (&WalkState->ParserState);
712 PreviousWalkState = WalkState;
714 ACPI_DEBUG_PRINT ((ACPI_DB_PARSE,
715 "ReturnValue=%p, ImplicitValue=%p State=%p\n",
716 WalkState->ReturnDesc, WalkState->ImplicitReturnObj, WalkState));
718 /* Check if we have restarted a preempted walk */
720 WalkState = AcpiDsGetCurrentWalkState (Thread);
723 if (ACPI_SUCCESS (Status))
726 * There is another walk state, restart it.
727 * If the method return value is not used by the parent,
728 * The object is deleted
730 if (!PreviousWalkState->ReturnDesc)
733 * In slack mode execution, if there is no return value
734 * we should implicitly return zero (0) as a default value.
736 if (AcpiGbl_EnableInterpreterSlack &&
737 !PreviousWalkState->ImplicitReturnObj)
739 PreviousWalkState->ImplicitReturnObj =
740 AcpiUtCreateIntegerObject ((UINT64) 0);
741 if (!PreviousWalkState->ImplicitReturnObj)
743 return_ACPI_STATUS (AE_NO_MEMORY);
747 /* Restart the calling control method */
749 Status = AcpiDsRestartControlMethod (WalkState,
750 PreviousWalkState->ImplicitReturnObj);
755 * We have a valid return value, delete any implicit
758 AcpiDsClearImplicitReturn (PreviousWalkState);
760 Status = AcpiDsRestartControlMethod (WalkState,
761 PreviousWalkState->ReturnDesc);
763 if (ACPI_SUCCESS (Status))
765 WalkState->WalkType |= ACPI_WALK_METHOD_RESTART;
770 /* On error, delete any return object or implicit return */
772 AcpiUtRemoveReference (PreviousWalkState->ReturnDesc);
773 AcpiDsClearImplicitReturn (PreviousWalkState);
778 * Just completed a 1st-level method, save the final internal return
781 else if (PreviousWalkState->CallerReturnDesc)
783 if (PreviousWalkState->ImplicitReturnObj)
785 *(PreviousWalkState->CallerReturnDesc) =
786 PreviousWalkState->ImplicitReturnObj;
790 /* NULL if no return value */
792 *(PreviousWalkState->CallerReturnDesc) =
793 PreviousWalkState->ReturnDesc;
798 if (PreviousWalkState->ReturnDesc)
800 /* Caller doesn't want it, must delete it */
802 AcpiUtRemoveReference (PreviousWalkState->ReturnDesc);
804 if (PreviousWalkState->ImplicitReturnObj)
806 /* Caller doesn't want it, must delete it */
808 AcpiUtRemoveReference (PreviousWalkState->ImplicitReturnObj);
812 AcpiDsDeleteWalkState (PreviousWalkState);
817 AcpiExReleaseAllMutexes (Thread);
818 AcpiUtDeleteGenericState (ACPI_CAST_PTR (ACPI_GENERIC_STATE, Thread));
819 AcpiGbl_CurrentWalkList = PrevWalkList;
820 return_ACPI_STATUS (Status);