Loading...
1/******************************************************************************
2 *
3 * Module Name: nsparse - namespace interface to AML parser
4 *
5 *****************************************************************************/
6
7/*
8 * Copyright (C) 2000 - 2011, Intel Corp.
9 * All rights reserved.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions, and the following disclaimer,
16 * without modification.
17 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
18 * substantially similar to the "NO WARRANTY" disclaimer below
19 * ("Disclaimer") and any redistribution must be conditioned upon
20 * including a substantially similar Disclaimer requirement for further
21 * binary redistribution.
22 * 3. Neither the names of the above-listed copyright holders nor the names
23 * of any contributors may be used to endorse or promote products derived
24 * from this software without specific prior written permission.
25 *
26 * Alternatively, this software may be distributed under the terms of the
27 * GNU General Public License ("GPL") version 2 as published by the Free
28 * Software Foundation.
29 *
30 * NO WARRANTY
31 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
32 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
33 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR
34 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
35 * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
36 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
37 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
38 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
39 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
40 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
41 * POSSIBILITY OF SUCH DAMAGES.
42 */
43
44#include <acpi/acpi.h>
45#include "accommon.h"
46#include "acnamesp.h"
47#include "acparser.h"
48#include "acdispat.h"
49#include "actables.h"
50
51#define _COMPONENT ACPI_NAMESPACE
52ACPI_MODULE_NAME("nsparse")
53
54/*******************************************************************************
55 *
56 * FUNCTION: ns_one_complete_parse
57 *
58 * PARAMETERS: pass_number - 1 or 2
59 * table_desc - The table to be parsed.
60 *
61 * RETURN: Status
62 *
63 * DESCRIPTION: Perform one complete parse of an ACPI/AML table.
64 *
65 ******************************************************************************/
66acpi_status
67acpi_ns_one_complete_parse(u32 pass_number,
68 u32 table_index,
69 struct acpi_namespace_node *start_node)
70{
71 union acpi_parse_object *parse_root;
72 acpi_status status;
73 u32 aml_length;
74 u8 *aml_start;
75 struct acpi_walk_state *walk_state;
76 struct acpi_table_header *table;
77 acpi_owner_id owner_id;
78
79 ACPI_FUNCTION_TRACE(ns_one_complete_parse);
80
81 status = acpi_tb_get_owner_id(table_index, &owner_id);
82 if (ACPI_FAILURE(status)) {
83 return_ACPI_STATUS(status);
84 }
85
86 /* Create and init a Root Node */
87
88 parse_root = acpi_ps_create_scope_op();
89 if (!parse_root) {
90 return_ACPI_STATUS(AE_NO_MEMORY);
91 }
92
93 /* Create and initialize a new walk state */
94
95 walk_state = acpi_ds_create_walk_state(owner_id, NULL, NULL, NULL);
96 if (!walk_state) {
97 acpi_ps_free_op(parse_root);
98 return_ACPI_STATUS(AE_NO_MEMORY);
99 }
100
101 status = acpi_get_table_by_index(table_index, &table);
102 if (ACPI_FAILURE(status)) {
103 acpi_ds_delete_walk_state(walk_state);
104 acpi_ps_free_op(parse_root);
105 return_ACPI_STATUS(status);
106 }
107
108 /* Table must consist of at least a complete header */
109
110 if (table->length < sizeof(struct acpi_table_header)) {
111 status = AE_BAD_HEADER;
112 } else {
113 aml_start = (u8 *) table + sizeof(struct acpi_table_header);
114 aml_length = table->length - sizeof(struct acpi_table_header);
115 status = acpi_ds_init_aml_walk(walk_state, parse_root, NULL,
116 aml_start, aml_length, NULL,
117 (u8) pass_number);
118 }
119
120 if (ACPI_FAILURE(status)) {
121 acpi_ds_delete_walk_state(walk_state);
122 goto cleanup;
123 }
124
125 /* start_node is the default location to load the table */
126
127 if (start_node && start_node != acpi_gbl_root_node) {
128 status =
129 acpi_ds_scope_stack_push(start_node, ACPI_TYPE_METHOD,
130 walk_state);
131 if (ACPI_FAILURE(status)) {
132 acpi_ds_delete_walk_state(walk_state);
133 goto cleanup;
134 }
135 }
136
137 /* Parse the AML */
138
139 ACPI_DEBUG_PRINT((ACPI_DB_PARSE, "*PARSE* pass %u parse\n",
140 pass_number));
141 status = acpi_ps_parse_aml(walk_state);
142
143 cleanup:
144 acpi_ps_delete_parse_tree(parse_root);
145 return_ACPI_STATUS(status);
146}
147
148/*******************************************************************************
149 *
150 * FUNCTION: acpi_ns_parse_table
151 *
152 * PARAMETERS: table_desc - An ACPI table descriptor for table to parse
153 * start_node - Where to enter the table into the namespace
154 *
155 * RETURN: Status
156 *
157 * DESCRIPTION: Parse AML within an ACPI table and return a tree of ops
158 *
159 ******************************************************************************/
160
161acpi_status
162acpi_ns_parse_table(u32 table_index, struct acpi_namespace_node *start_node)
163{
164 acpi_status status;
165
166 ACPI_FUNCTION_TRACE(ns_parse_table);
167
168 /*
169 * AML Parse, pass 1
170 *
171 * In this pass, we load most of the namespace. Control methods
172 * are not parsed until later. A parse tree is not created. Instead,
173 * each Parser Op subtree is deleted when it is finished. This saves
174 * a great deal of memory, and allows a small cache of parse objects
175 * to service the entire parse. The second pass of the parse then
176 * performs another complete parse of the AML.
177 */
178 ACPI_DEBUG_PRINT((ACPI_DB_PARSE, "**** Start pass 1\n"));
179 status = acpi_ns_one_complete_parse(ACPI_IMODE_LOAD_PASS1,
180 table_index, start_node);
181 if (ACPI_FAILURE(status)) {
182 return_ACPI_STATUS(status);
183 }
184
185 /*
186 * AML Parse, pass 2
187 *
188 * In this pass, we resolve forward references and other things
189 * that could not be completed during the first pass.
190 * Another complete parse of the AML is performed, but the
191 * overhead of this is compensated for by the fact that the
192 * parse objects are all cached.
193 */
194 ACPI_DEBUG_PRINT((ACPI_DB_PARSE, "**** Start pass 2\n"));
195 status = acpi_ns_one_complete_parse(ACPI_IMODE_LOAD_PASS2,
196 table_index, start_node);
197 if (ACPI_FAILURE(status)) {
198 return_ACPI_STATUS(status);
199 }
200
201 return_ACPI_STATUS(status);
202}
1// SPDX-License-Identifier: BSD-3-Clause OR GPL-2.0
2/******************************************************************************
3 *
4 * Module Name: nsparse - namespace interface to AML parser
5 *
6 * Copyright (C) 2000 - 2018, Intel Corp.
7 *
8 *****************************************************************************/
9
10#include <acpi/acpi.h>
11#include "accommon.h"
12#include "acnamesp.h"
13#include "acparser.h"
14#include "acdispat.h"
15#include "actables.h"
16#include "acinterp.h"
17
18#define _COMPONENT ACPI_NAMESPACE
19ACPI_MODULE_NAME("nsparse")
20
21/*******************************************************************************
22 *
23 * FUNCTION: ns_execute_table
24 *
25 * PARAMETERS: table_desc - An ACPI table descriptor for table to parse
26 * start_node - Where to enter the table into the namespace
27 *
28 * RETURN: Status
29 *
30 * DESCRIPTION: Load ACPI/AML table by executing the entire table as a single
31 * large control method.
32 *
33 * NOTE: The point of this is to execute any module-level code in-place
34 * as the table is parsed. Some AML code depends on this behavior.
35 *
36 * It is a run-time option at this time, but will eventually become
37 * the default.
38 *
39 * Note: This causes the table to only have a single-pass parse.
40 * However, this is compatible with other ACPI implementations.
41 *
42 ******************************************************************************/
43acpi_status
44acpi_ns_execute_table(u32 table_index, struct acpi_namespace_node *start_node)
45{
46 acpi_status status;
47 struct acpi_table_header *table;
48 acpi_owner_id owner_id;
49 struct acpi_evaluate_info *info = NULL;
50 u32 aml_length;
51 u8 *aml_start;
52 union acpi_operand_object *method_obj = NULL;
53
54 ACPI_FUNCTION_TRACE(ns_execute_table);
55
56 status = acpi_get_table_by_index(table_index, &table);
57 if (ACPI_FAILURE(status)) {
58 return_ACPI_STATUS(status);
59 }
60
61 /* Table must consist of at least a complete header */
62
63 if (table->length < sizeof(struct acpi_table_header)) {
64 return_ACPI_STATUS(AE_BAD_HEADER);
65 }
66
67 aml_start = (u8 *)table + sizeof(struct acpi_table_header);
68 aml_length = table->length - sizeof(struct acpi_table_header);
69
70 status = acpi_tb_get_owner_id(table_index, &owner_id);
71 if (ACPI_FAILURE(status)) {
72 return_ACPI_STATUS(status);
73 }
74
75 /* Create, initialize, and link a new temporary method object */
76
77 method_obj = acpi_ut_create_internal_object(ACPI_TYPE_METHOD);
78 if (!method_obj) {
79 return_ACPI_STATUS(AE_NO_MEMORY);
80 }
81
82 /* Allocate the evaluation information block */
83
84 info = ACPI_ALLOCATE_ZEROED(sizeof(struct acpi_evaluate_info));
85 if (!info) {
86 status = AE_NO_MEMORY;
87 goto cleanup;
88 }
89
90 ACPI_DEBUG_PRINT_RAW((ACPI_DB_PARSE,
91 "%s: Create table pseudo-method for [%4.4s] @%p, method %p\n",
92 ACPI_GET_FUNCTION_NAME, table->signature, table,
93 method_obj));
94
95 method_obj->method.aml_start = aml_start;
96 method_obj->method.aml_length = aml_length;
97 method_obj->method.owner_id = owner_id;
98 method_obj->method.info_flags |= ACPI_METHOD_MODULE_LEVEL;
99
100 info->pass_number = ACPI_IMODE_EXECUTE;
101 info->node = start_node;
102 info->obj_desc = method_obj;
103 info->node_flags = info->node->flags;
104 info->full_pathname = acpi_ns_get_normalized_pathname(info->node, TRUE);
105 if (!info->full_pathname) {
106 status = AE_NO_MEMORY;
107 goto cleanup;
108 }
109
110 status = acpi_ps_execute_table(info);
111
112cleanup:
113 if (info) {
114 ACPI_FREE(info->full_pathname);
115 info->full_pathname = NULL;
116 }
117 ACPI_FREE(info);
118 acpi_ut_remove_reference(method_obj);
119 return_ACPI_STATUS(status);
120}
121
122/*******************************************************************************
123 *
124 * FUNCTION: ns_one_complete_parse
125 *
126 * PARAMETERS: pass_number - 1 or 2
127 * table_desc - The table to be parsed.
128 *
129 * RETURN: Status
130 *
131 * DESCRIPTION: Perform one complete parse of an ACPI/AML table.
132 *
133 ******************************************************************************/
134
135acpi_status
136acpi_ns_one_complete_parse(u32 pass_number,
137 u32 table_index,
138 struct acpi_namespace_node *start_node)
139{
140 union acpi_parse_object *parse_root;
141 acpi_status status;
142 u32 aml_length;
143 u8 *aml_start;
144 struct acpi_walk_state *walk_state;
145 struct acpi_table_header *table;
146 acpi_owner_id owner_id;
147
148 ACPI_FUNCTION_TRACE(ns_one_complete_parse);
149
150 status = acpi_get_table_by_index(table_index, &table);
151 if (ACPI_FAILURE(status)) {
152 return_ACPI_STATUS(status);
153 }
154
155 /* Table must consist of at least a complete header */
156
157 if (table->length < sizeof(struct acpi_table_header)) {
158 return_ACPI_STATUS(AE_BAD_HEADER);
159 }
160
161 aml_start = (u8 *)table + sizeof(struct acpi_table_header);
162 aml_length = table->length - sizeof(struct acpi_table_header);
163
164 status = acpi_tb_get_owner_id(table_index, &owner_id);
165 if (ACPI_FAILURE(status)) {
166 return_ACPI_STATUS(status);
167 }
168
169 /* Create and init a Root Node */
170
171 parse_root = acpi_ps_create_scope_op(aml_start);
172 if (!parse_root) {
173 return_ACPI_STATUS(AE_NO_MEMORY);
174 }
175
176 /* Create and initialize a new walk state */
177
178 walk_state = acpi_ds_create_walk_state(owner_id, NULL, NULL, NULL);
179 if (!walk_state) {
180 acpi_ps_free_op(parse_root);
181 return_ACPI_STATUS(AE_NO_MEMORY);
182 }
183
184 status = acpi_ds_init_aml_walk(walk_state, parse_root, NULL,
185 aml_start, aml_length, NULL,
186 (u8)pass_number);
187 if (ACPI_FAILURE(status)) {
188 acpi_ds_delete_walk_state(walk_state);
189 goto cleanup;
190 }
191
192 /* Found OSDT table, enable the namespace override feature */
193
194 if (ACPI_COMPARE_NAME(table->signature, ACPI_SIG_OSDT) &&
195 pass_number == ACPI_IMODE_LOAD_PASS1) {
196 walk_state->namespace_override = TRUE;
197 }
198
199 /* start_node is the default location to load the table */
200
201 if (start_node && start_node != acpi_gbl_root_node) {
202 status =
203 acpi_ds_scope_stack_push(start_node, ACPI_TYPE_METHOD,
204 walk_state);
205 if (ACPI_FAILURE(status)) {
206 acpi_ds_delete_walk_state(walk_state);
207 goto cleanup;
208 }
209 }
210
211 /* Parse the AML */
212
213 ACPI_DEBUG_PRINT((ACPI_DB_PARSE,
214 "*PARSE* pass %u parse\n", pass_number));
215 acpi_ex_enter_interpreter();
216 status = acpi_ps_parse_aml(walk_state);
217 acpi_ex_exit_interpreter();
218
219cleanup:
220 acpi_ps_delete_parse_tree(parse_root);
221 return_ACPI_STATUS(status);
222}
223
224/*******************************************************************************
225 *
226 * FUNCTION: acpi_ns_parse_table
227 *
228 * PARAMETERS: table_desc - An ACPI table descriptor for table to parse
229 * start_node - Where to enter the table into the namespace
230 *
231 * RETURN: Status
232 *
233 * DESCRIPTION: Parse AML within an ACPI table and return a tree of ops
234 *
235 ******************************************************************************/
236
237acpi_status
238acpi_ns_parse_table(u32 table_index, struct acpi_namespace_node *start_node)
239{
240 acpi_status status;
241
242 ACPI_FUNCTION_TRACE(ns_parse_table);
243
244 if (acpi_gbl_execute_tables_as_methods) {
245 /*
246 * This case executes the AML table as one large control method.
247 * The point of this is to execute any module-level code in-place
248 * as the table is parsed. Some AML code depends on this behavior.
249 *
250 * It is a run-time option at this time, but will eventually become
251 * the default.
252 *
253 * Note: This causes the table to only have a single-pass parse.
254 * However, this is compatible with other ACPI implementations.
255 */
256 ACPI_DEBUG_PRINT_RAW((ACPI_DB_PARSE,
257 "%s: **** Start table execution pass\n",
258 ACPI_GET_FUNCTION_NAME));
259
260 status = acpi_ns_execute_table(table_index, start_node);
261 if (ACPI_FAILURE(status)) {
262 return_ACPI_STATUS(status);
263 }
264 } else {
265 /*
266 * AML Parse, pass 1
267 *
268 * In this pass, we load most of the namespace. Control methods
269 * are not parsed until later. A parse tree is not created.
270 * Instead, each Parser Op subtree is deleted when it is finished.
271 * This saves a great deal of memory, and allows a small cache of
272 * parse objects to service the entire parse. The second pass of
273 * the parse then performs another complete parse of the AML.
274 */
275 ACPI_DEBUG_PRINT((ACPI_DB_PARSE, "**** Start pass 1\n"));
276
277 status = acpi_ns_one_complete_parse(ACPI_IMODE_LOAD_PASS1,
278 table_index, start_node);
279 if (ACPI_FAILURE(status)) {
280 return_ACPI_STATUS(status);
281 }
282
283 /*
284 * AML Parse, pass 2
285 *
286 * In this pass, we resolve forward references and other things
287 * that could not be completed during the first pass.
288 * Another complete parse of the AML is performed, but the
289 * overhead of this is compensated for by the fact that the
290 * parse objects are all cached.
291 */
292 ACPI_DEBUG_PRINT((ACPI_DB_PARSE, "**** Start pass 2\n"));
293 status = acpi_ns_one_complete_parse(ACPI_IMODE_LOAD_PASS2,
294 table_index, start_node);
295 if (ACPI_FAILURE(status)) {
296 return_ACPI_STATUS(status);
297 }
298 }
299
300 return_ACPI_STATUS(status);
301}