nsparse.c revision 1.1.1.2.10.1 1 1.1 jruoho /******************************************************************************
2 1.1 jruoho *
3 1.1 jruoho * Module Name: nsparse - namespace interface to AML parser
4 1.1 jruoho *
5 1.1 jruoho *****************************************************************************/
6 1.1 jruoho
7 1.1.1.2 jruoho /*
8 1.1.1.2.10.1 yamt * Copyright (C) 2000 - 2013, Intel Corp.
9 1.1 jruoho * All rights reserved.
10 1.1 jruoho *
11 1.1.1.2 jruoho * Redistribution and use in source and binary forms, with or without
12 1.1.1.2 jruoho * modification, are permitted provided that the following conditions
13 1.1.1.2 jruoho * are met:
14 1.1.1.2 jruoho * 1. Redistributions of source code must retain the above copyright
15 1.1.1.2 jruoho * notice, this list of conditions, and the following disclaimer,
16 1.1.1.2 jruoho * without modification.
17 1.1.1.2 jruoho * 2. Redistributions in binary form must reproduce at minimum a disclaimer
18 1.1.1.2 jruoho * substantially similar to the "NO WARRANTY" disclaimer below
19 1.1.1.2 jruoho * ("Disclaimer") and any redistribution must be conditioned upon
20 1.1.1.2 jruoho * including a substantially similar Disclaimer requirement for further
21 1.1.1.2 jruoho * binary redistribution.
22 1.1.1.2 jruoho * 3. Neither the names of the above-listed copyright holders nor the names
23 1.1.1.2 jruoho * of any contributors may be used to endorse or promote products derived
24 1.1.1.2 jruoho * from this software without specific prior written permission.
25 1.1.1.2 jruoho *
26 1.1.1.2 jruoho * Alternatively, this software may be distributed under the terms of the
27 1.1.1.2 jruoho * GNU General Public License ("GPL") version 2 as published by the Free
28 1.1.1.2 jruoho * Software Foundation.
29 1.1.1.2 jruoho *
30 1.1.1.2 jruoho * NO WARRANTY
31 1.1.1.2 jruoho * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
32 1.1.1.2 jruoho * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
33 1.1.1.2 jruoho * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR
34 1.1.1.2 jruoho * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
35 1.1.1.2 jruoho * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
36 1.1.1.2 jruoho * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
37 1.1.1.2 jruoho * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
38 1.1.1.2 jruoho * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
39 1.1.1.2 jruoho * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
40 1.1.1.2 jruoho * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
41 1.1.1.2 jruoho * POSSIBILITY OF SUCH DAMAGES.
42 1.1.1.2 jruoho */
43 1.1 jruoho
44 1.1 jruoho #define __NSPARSE_C__
45 1.1 jruoho
46 1.1 jruoho #include "acpi.h"
47 1.1 jruoho #include "accommon.h"
48 1.1 jruoho #include "acnamesp.h"
49 1.1 jruoho #include "acparser.h"
50 1.1 jruoho #include "acdispat.h"
51 1.1 jruoho #include "actables.h"
52 1.1 jruoho
53 1.1 jruoho
54 1.1 jruoho #define _COMPONENT ACPI_NAMESPACE
55 1.1 jruoho ACPI_MODULE_NAME ("nsparse")
56 1.1 jruoho
57 1.1 jruoho
58 1.1 jruoho /*******************************************************************************
59 1.1 jruoho *
60 1.1 jruoho * FUNCTION: NsOneCompleteParse
61 1.1 jruoho *
62 1.1 jruoho * PARAMETERS: PassNumber - 1 or 2
63 1.1 jruoho * TableDesc - The table to be parsed.
64 1.1 jruoho *
65 1.1 jruoho * RETURN: Status
66 1.1 jruoho *
67 1.1 jruoho * DESCRIPTION: Perform one complete parse of an ACPI/AML table.
68 1.1 jruoho *
69 1.1 jruoho ******************************************************************************/
70 1.1 jruoho
71 1.1 jruoho ACPI_STATUS
72 1.1 jruoho AcpiNsOneCompleteParse (
73 1.1 jruoho UINT32 PassNumber,
74 1.1 jruoho UINT32 TableIndex,
75 1.1 jruoho ACPI_NAMESPACE_NODE *StartNode)
76 1.1 jruoho {
77 1.1 jruoho ACPI_PARSE_OBJECT *ParseRoot;
78 1.1 jruoho ACPI_STATUS Status;
79 1.1 jruoho UINT32 AmlLength;
80 1.1 jruoho UINT8 *AmlStart;
81 1.1 jruoho ACPI_WALK_STATE *WalkState;
82 1.1 jruoho ACPI_TABLE_HEADER *Table;
83 1.1 jruoho ACPI_OWNER_ID OwnerId;
84 1.1 jruoho
85 1.1 jruoho
86 1.1 jruoho ACPI_FUNCTION_TRACE (NsOneCompleteParse);
87 1.1 jruoho
88 1.1 jruoho
89 1.1 jruoho Status = AcpiTbGetOwnerId (TableIndex, &OwnerId);
90 1.1 jruoho if (ACPI_FAILURE (Status))
91 1.1 jruoho {
92 1.1 jruoho return_ACPI_STATUS (Status);
93 1.1 jruoho }
94 1.1 jruoho
95 1.1 jruoho /* Create and init a Root Node */
96 1.1 jruoho
97 1.1 jruoho ParseRoot = AcpiPsCreateScopeOp ();
98 1.1 jruoho if (!ParseRoot)
99 1.1 jruoho {
100 1.1 jruoho return_ACPI_STATUS (AE_NO_MEMORY);
101 1.1 jruoho }
102 1.1 jruoho
103 1.1 jruoho /* Create and initialize a new walk state */
104 1.1 jruoho
105 1.1 jruoho WalkState = AcpiDsCreateWalkState (OwnerId, NULL, NULL, NULL);
106 1.1 jruoho if (!WalkState)
107 1.1 jruoho {
108 1.1 jruoho AcpiPsFreeOp (ParseRoot);
109 1.1 jruoho return_ACPI_STATUS (AE_NO_MEMORY);
110 1.1 jruoho }
111 1.1 jruoho
112 1.1 jruoho Status = AcpiGetTableByIndex (TableIndex, &Table);
113 1.1 jruoho if (ACPI_FAILURE (Status))
114 1.1 jruoho {
115 1.1 jruoho AcpiDsDeleteWalkState (WalkState);
116 1.1 jruoho AcpiPsFreeOp (ParseRoot);
117 1.1 jruoho return_ACPI_STATUS (Status);
118 1.1 jruoho }
119 1.1 jruoho
120 1.1 jruoho /* Table must consist of at least a complete header */
121 1.1 jruoho
122 1.1 jruoho if (Table->Length < sizeof (ACPI_TABLE_HEADER))
123 1.1 jruoho {
124 1.1 jruoho Status = AE_BAD_HEADER;
125 1.1 jruoho }
126 1.1 jruoho else
127 1.1 jruoho {
128 1.1 jruoho AmlStart = (UINT8 *) Table + sizeof (ACPI_TABLE_HEADER);
129 1.1 jruoho AmlLength = Table->Length - sizeof (ACPI_TABLE_HEADER);
130 1.1 jruoho Status = AcpiDsInitAmlWalk (WalkState, ParseRoot, NULL,
131 1.1 jruoho AmlStart, AmlLength, NULL, (UINT8) PassNumber);
132 1.1 jruoho }
133 1.1 jruoho
134 1.1 jruoho if (ACPI_FAILURE (Status))
135 1.1 jruoho {
136 1.1 jruoho AcpiDsDeleteWalkState (WalkState);
137 1.1 jruoho goto Cleanup;
138 1.1 jruoho }
139 1.1 jruoho
140 1.1 jruoho /* StartNode is the default location to load the table */
141 1.1 jruoho
142 1.1 jruoho if (StartNode && StartNode != AcpiGbl_RootNode)
143 1.1 jruoho {
144 1.1 jruoho Status = AcpiDsScopeStackPush (StartNode, ACPI_TYPE_METHOD, WalkState);
145 1.1 jruoho if (ACPI_FAILURE (Status))
146 1.1 jruoho {
147 1.1 jruoho AcpiDsDeleteWalkState (WalkState);
148 1.1 jruoho goto Cleanup;
149 1.1 jruoho }
150 1.1 jruoho }
151 1.1 jruoho
152 1.1 jruoho /* Parse the AML */
153 1.1 jruoho
154 1.1 jruoho ACPI_DEBUG_PRINT ((ACPI_DB_PARSE, "*PARSE* pass %u parse\n", PassNumber));
155 1.1 jruoho Status = AcpiPsParseAml (WalkState);
156 1.1 jruoho
157 1.1 jruoho Cleanup:
158 1.1 jruoho AcpiPsDeleteParseTree (ParseRoot);
159 1.1 jruoho return_ACPI_STATUS (Status);
160 1.1 jruoho }
161 1.1 jruoho
162 1.1 jruoho
163 1.1 jruoho /*******************************************************************************
164 1.1 jruoho *
165 1.1 jruoho * FUNCTION: AcpiNsParseTable
166 1.1 jruoho *
167 1.1 jruoho * PARAMETERS: TableDesc - An ACPI table descriptor for table to parse
168 1.1 jruoho * StartNode - Where to enter the table into the namespace
169 1.1 jruoho *
170 1.1 jruoho * RETURN: Status
171 1.1 jruoho *
172 1.1 jruoho * DESCRIPTION: Parse AML within an ACPI table and return a tree of ops
173 1.1 jruoho *
174 1.1 jruoho ******************************************************************************/
175 1.1 jruoho
176 1.1 jruoho ACPI_STATUS
177 1.1 jruoho AcpiNsParseTable (
178 1.1 jruoho UINT32 TableIndex,
179 1.1 jruoho ACPI_NAMESPACE_NODE *StartNode)
180 1.1 jruoho {
181 1.1 jruoho ACPI_STATUS Status;
182 1.1 jruoho
183 1.1 jruoho
184 1.1 jruoho ACPI_FUNCTION_TRACE (NsParseTable);
185 1.1 jruoho
186 1.1 jruoho
187 1.1 jruoho /*
188 1.1 jruoho * AML Parse, pass 1
189 1.1 jruoho *
190 1.1.1.2.10.1 yamt * In this pass, we load most of the namespace. Control methods
191 1.1.1.2.10.1 yamt * are not parsed until later. A parse tree is not created. Instead,
192 1.1.1.2.10.1 yamt * each Parser Op subtree is deleted when it is finished. This saves
193 1.1 jruoho * a great deal of memory, and allows a small cache of parse objects
194 1.1.1.2.10.1 yamt * to service the entire parse. The second pass of the parse then
195 1.1 jruoho * performs another complete parse of the AML.
196 1.1 jruoho */
197 1.1 jruoho ACPI_DEBUG_PRINT ((ACPI_DB_PARSE, "**** Start pass 1\n"));
198 1.1 jruoho Status = AcpiNsOneCompleteParse (ACPI_IMODE_LOAD_PASS1,
199 1.1 jruoho TableIndex, StartNode);
200 1.1 jruoho if (ACPI_FAILURE (Status))
201 1.1 jruoho {
202 1.1 jruoho return_ACPI_STATUS (Status);
203 1.1 jruoho }
204 1.1 jruoho
205 1.1 jruoho /*
206 1.1 jruoho * AML Parse, pass 2
207 1.1 jruoho *
208 1.1 jruoho * In this pass, we resolve forward references and other things
209 1.1 jruoho * that could not be completed during the first pass.
210 1.1 jruoho * Another complete parse of the AML is performed, but the
211 1.1 jruoho * overhead of this is compensated for by the fact that the
212 1.1 jruoho * parse objects are all cached.
213 1.1 jruoho */
214 1.1 jruoho ACPI_DEBUG_PRINT ((ACPI_DB_PARSE, "**** Start pass 2\n"));
215 1.1 jruoho Status = AcpiNsOneCompleteParse (ACPI_IMODE_LOAD_PASS2,
216 1.1 jruoho TableIndex, StartNode);
217 1.1 jruoho if (ACPI_FAILURE (Status))
218 1.1 jruoho {
219 1.1 jruoho return_ACPI_STATUS (Status);
220 1.1 jruoho }
221 1.1 jruoho
222 1.1 jruoho return_ACPI_STATUS (Status);
223 1.1 jruoho }
224