Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /******************************************************************************* |
2 | * | |
3 | * Module Name: nsalloc - Namespace allocation and deletion utilities | |
4 | * | |
5 | ******************************************************************************/ | |
6 | ||
7 | /* | |
c8100dc4 | 8 | * Copyright (C) 2000 - 2016, Intel Corp. |
1da177e4 LT |
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 | ||
1da177e4 | 44 | #include <acpi/acpi.h> |
e2f7a777 LB |
45 | #include "accommon.h" |
46 | #include "acnamesp.h" | |
1da177e4 | 47 | |
1da177e4 | 48 | #define _COMPONENT ACPI_NAMESPACE |
4be44fcd | 49 | ACPI_MODULE_NAME("nsalloc") |
1da177e4 | 50 | |
1da177e4 LT |
51 | /******************************************************************************* |
52 | * | |
53 | * FUNCTION: acpi_ns_create_node | |
54 | * | |
ba494bee | 55 | * PARAMETERS: name - Name of the new node (4 char ACPI name) |
1da177e4 | 56 | * |
44f6c012 | 57 | * RETURN: New namespace node (Null on failure) |
1da177e4 LT |
58 | * |
59 | * DESCRIPTION: Create a namespace node | |
60 | * | |
61 | ******************************************************************************/ | |
4be44fcd | 62 | struct acpi_namespace_node *acpi_ns_create_node(u32 name) |
1da177e4 | 63 | { |
4be44fcd | 64 | struct acpi_namespace_node *node; |
afbb9e65 VP |
65 | #ifdef ACPI_DBG_TRACK_ALLOCATIONS |
66 | u32 temp; | |
67 | #endif | |
1da177e4 | 68 | |
b229cf92 | 69 | ACPI_FUNCTION_TRACE(ns_create_node); |
1da177e4 | 70 | |
61686124 | 71 | node = acpi_os_acquire_object(acpi_gbl_namespace_cache); |
1da177e4 | 72 | if (!node) { |
4be44fcd | 73 | return_PTR(NULL); |
1da177e4 LT |
74 | } |
75 | ||
4be44fcd | 76 | ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_allocated++); |
1da177e4 | 77 | |
afbb9e65 | 78 | #ifdef ACPI_DBG_TRACK_ALLOCATIONS |
d4913dc6 | 79 | temp = acpi_gbl_ns_node_list->total_allocated - |
afbb9e65 VP |
80 | acpi_gbl_ns_node_list->total_freed; |
81 | if (temp > acpi_gbl_ns_node_list->max_occupied) { | |
82 | acpi_gbl_ns_node_list->max_occupied = temp; | |
83 | } | |
84 | #endif | |
85 | ||
4be44fcd | 86 | node->name.integer = name; |
4be44fcd | 87 | ACPI_SET_DESCRIPTOR_TYPE(node, ACPI_DESC_TYPE_NAMED); |
4be44fcd | 88 | return_PTR(node); |
1da177e4 LT |
89 | } |
90 | ||
1da177e4 LT |
91 | /******************************************************************************* |
92 | * | |
93 | * FUNCTION: acpi_ns_delete_node | |
94 | * | |
ba494bee | 95 | * PARAMETERS: node - Node to be deleted |
1da177e4 LT |
96 | * |
97 | * RETURN: None | |
98 | * | |
8e4319c4 BM |
99 | * DESCRIPTION: Delete a namespace node. All node deletions must come through |
100 | * here. Detaches any attached objects, including any attached | |
101 | * data. If a handler is associated with attached data, it is | |
102 | * invoked before the node is deleted. | |
1da177e4 LT |
103 | * |
104 | ******************************************************************************/ | |
105 | ||
4be44fcd | 106 | void acpi_ns_delete_node(struct acpi_namespace_node *node) |
8e4319c4 BM |
107 | { |
108 | union acpi_operand_object *obj_desc; | |
794ba09b | 109 | union acpi_operand_object *next_desc; |
8e4319c4 BM |
110 | |
111 | ACPI_FUNCTION_NAME(ns_delete_node); | |
112 | ||
113 | /* Detach an object if there is one */ | |
114 | ||
115 | acpi_ns_detach_object(node); | |
116 | ||
117 | /* | |
794ba09b TN |
118 | * Delete an attached data object list if present (objects that were |
119 | * attached via acpi_attach_data). Note: After any normal object is | |
120 | * detached above, the only possible remaining object(s) are data | |
121 | * objects, in a linked list. | |
8e4319c4 BM |
122 | */ |
123 | obj_desc = node->object; | |
794ba09b | 124 | while (obj_desc && (obj_desc->common.type == ACPI_TYPE_LOCAL_DATA)) { |
8e4319c4 BM |
125 | |
126 | /* Invoke the attached data deletion handler if present */ | |
127 | ||
128 | if (obj_desc->data.handler) { | |
129 | obj_desc->data.handler(node, obj_desc->data.pointer); | |
130 | } | |
131 | ||
794ba09b | 132 | next_desc = obj_desc->common.next_object; |
8e4319c4 | 133 | acpi_ut_remove_reference(obj_desc); |
794ba09b | 134 | obj_desc = next_desc; |
8e4319c4 BM |
135 | } |
136 | ||
3f69fe15 BM |
137 | /* Special case for the statically allocated root node */ |
138 | ||
139 | if (node == acpi_gbl_root_node) { | |
140 | return; | |
141 | } | |
142 | ||
8e4319c4 BM |
143 | /* Now we can delete the node */ |
144 | ||
145 | (void)acpi_os_release_object(acpi_gbl_namespace_cache, node); | |
146 | ||
147 | ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_freed++); | |
148 | ACPI_DEBUG_PRINT((ACPI_DB_ALLOCATIONS, "Node %p, Remaining %X\n", | |
149 | node, acpi_gbl_current_node_count)); | |
150 | } | |
151 | ||
152 | /******************************************************************************* | |
153 | * | |
154 | * FUNCTION: acpi_ns_remove_node | |
155 | * | |
ba494bee | 156 | * PARAMETERS: node - Node to be removed/deleted |
8e4319c4 BM |
157 | * |
158 | * RETURN: None | |
159 | * | |
160 | * DESCRIPTION: Remove (unlink) and delete a namespace node | |
161 | * | |
162 | ******************************************************************************/ | |
163 | ||
164 | void acpi_ns_remove_node(struct acpi_namespace_node *node) | |
1da177e4 | 165 | { |
4be44fcd LB |
166 | struct acpi_namespace_node *parent_node; |
167 | struct acpi_namespace_node *prev_node; | |
168 | struct acpi_namespace_node *next_node; | |
1da177e4 | 169 | |
8e4319c4 | 170 | ACPI_FUNCTION_TRACE_PTR(ns_remove_node, node); |
1da177e4 | 171 | |
c45b5c09 | 172 | parent_node = node->parent; |
1da177e4 LT |
173 | |
174 | prev_node = NULL; | |
175 | next_node = parent_node->child; | |
176 | ||
177 | /* Find the node that is the previous peer in the parent's child list */ | |
178 | ||
179 | while (next_node != node) { | |
180 | prev_node = next_node; | |
c45b5c09 | 181 | next_node = next_node->peer; |
1da177e4 LT |
182 | } |
183 | ||
184 | if (prev_node) { | |
52fc0b02 | 185 | |
1da177e4 LT |
186 | /* Node is not first child, unlink it */ |
187 | ||
c45b5c09 | 188 | prev_node->peer = node->peer; |
4be44fcd | 189 | } else { |
c45b5c09 AS |
190 | /* |
191 | * Node is first child (has no previous peer). | |
192 | * Link peer list to parent | |
193 | */ | |
194 | parent_node->child = node->peer; | |
1da177e4 LT |
195 | } |
196 | ||
8e4319c4 | 197 | /* Delete the node and any attached objects */ |
d4913dc6 | 198 | |
8e4319c4 | 199 | acpi_ns_delete_node(node); |
1da177e4 LT |
200 | return_VOID; |
201 | } | |
202 | ||
1da177e4 LT |
203 | /******************************************************************************* |
204 | * | |
205 | * FUNCTION: acpi_ns_install_node | |
206 | * | |
207 | * PARAMETERS: walk_state - Current state of the walk | |
208 | * parent_node - The parent of the new Node | |
ba494bee BM |
209 | * node - The new Node to install |
210 | * type - ACPI object type of the new Node | |
1da177e4 LT |
211 | * |
212 | * RETURN: None | |
213 | * | |
214 | * DESCRIPTION: Initialize a new namespace node and install it amongst | |
215 | * its peers. | |
216 | * | |
0c9938cc RM |
217 | * Note: Current namespace lookup is linear search. This appears |
218 | * to be sufficient as namespace searches consume only a small | |
219 | * fraction of the execution time of the ACPI subsystem. | |
1da177e4 LT |
220 | * |
221 | ******************************************************************************/ | |
222 | ||
4be44fcd LB |
223 | void acpi_ns_install_node(struct acpi_walk_state *walk_state, struct acpi_namespace_node *parent_node, /* Parent */ |
224 | struct acpi_namespace_node *node, /* New Child */ | |
225 | acpi_object_type type) | |
1da177e4 | 226 | { |
4be44fcd LB |
227 | acpi_owner_id owner_id = 0; |
228 | struct acpi_namespace_node *child_node; | |
1da177e4 | 229 | |
b229cf92 | 230 | ACPI_FUNCTION_TRACE(ns_install_node); |
1da177e4 | 231 | |
1da177e4 | 232 | if (walk_state) { |
a9fc0312 AS |
233 | /* |
234 | * Get the owner ID from the Walk state. The owner ID is used to | |
235 | * track table deletion and deletion of objects created by methods. | |
236 | */ | |
1da177e4 | 237 | owner_id = walk_state->owner_id; |
a9fc0312 AS |
238 | |
239 | if ((walk_state->method_desc) && | |
240 | (parent_node != walk_state->method_node)) { | |
241 | /* | |
242 | * A method is creating a new node that is not a child of the | |
243 | * method (it is non-local). Mark the executing method as having | |
244 | * modified the namespace. This is used for cleanup when the | |
245 | * method exits. | |
246 | */ | |
26294842 LM |
247 | walk_state->method_desc->method.info_flags |= |
248 | ACPI_METHOD_MODIFIED_NAMESPACE; | |
a9fc0312 | 249 | } |
1da177e4 LT |
250 | } |
251 | ||
252 | /* Link the new entry into the parent and existing children */ | |
253 | ||
c45b5c09 AS |
254 | node->peer = NULL; |
255 | node->parent = parent_node; | |
1da177e4 | 256 | child_node = parent_node->child; |
c45b5c09 | 257 | |
1da177e4 LT |
258 | if (!child_node) { |
259 | parent_node->child = node; | |
4be44fcd | 260 | } else { |
c45b5c09 AS |
261 | /* Add node to the end of the peer list */ |
262 | ||
263 | while (child_node->peer) { | |
1da177e4 LT |
264 | child_node = child_node->peer; |
265 | } | |
266 | ||
267 | child_node->peer = node; | |
1da177e4 LT |
268 | } |
269 | ||
270 | /* Init the new entry */ | |
271 | ||
272 | node->owner_id = owner_id; | |
273 | node->type = (u8) type; | |
274 | ||
4be44fcd LB |
275 | ACPI_DEBUG_PRINT((ACPI_DB_NAMES, |
276 | "%4.4s (%s) [Node %p Owner %X] added to %4.4s (%s) [Node %p]\n", | |
277 | acpi_ut_get_node_name(node), | |
278 | acpi_ut_get_type_name(node->type), node, owner_id, | |
279 | acpi_ut_get_node_name(parent_node), | |
280 | acpi_ut_get_type_name(parent_node->type), | |
281 | parent_node)); | |
793c2388 BM |
282 | |
283 | return_VOID; | |
1da177e4 LT |
284 | } |
285 | ||
1da177e4 LT |
286 | /******************************************************************************* |
287 | * | |
288 | * FUNCTION: acpi_ns_delete_children | |
289 | * | |
290 | * PARAMETERS: parent_node - Delete this objects children | |
291 | * | |
292 | * RETURN: None. | |
293 | * | |
294 | * DESCRIPTION: Delete all children of the parent object. In other words, | |
295 | * deletes a "scope". | |
296 | * | |
297 | ******************************************************************************/ | |
298 | ||
4be44fcd | 299 | void acpi_ns_delete_children(struct acpi_namespace_node *parent_node) |
1da177e4 | 300 | { |
4be44fcd | 301 | struct acpi_namespace_node *next_node; |
c45b5c09 | 302 | struct acpi_namespace_node *node_to_delete; |
1da177e4 | 303 | |
b229cf92 | 304 | ACPI_FUNCTION_TRACE_PTR(ns_delete_children, parent_node); |
1da177e4 LT |
305 | |
306 | if (!parent_node) { | |
307 | return_VOID; | |
308 | } | |
309 | ||
d4913dc6 BM |
310 | /* Deallocate all children at this level */ |
311 | ||
c45b5c09 AS |
312 | next_node = parent_node->child; |
313 | while (next_node) { | |
1da177e4 LT |
314 | |
315 | /* Grandchildren should have all been deleted already */ | |
316 | ||
c45b5c09 | 317 | if (next_node->child) { |
b8e4d893 | 318 | ACPI_ERROR((AE_INFO, "Found a grandchild! P=%p C=%p", |
c45b5c09 | 319 | parent_node, next_node)); |
1da177e4 LT |
320 | } |
321 | ||
8e4319c4 BM |
322 | /* |
323 | * Delete this child node and move on to the next child in the list. | |
324 | * No need to unlink the node since we are deleting the entire branch. | |
325 | */ | |
c45b5c09 AS |
326 | node_to_delete = next_node; |
327 | next_node = next_node->peer; | |
328 | acpi_ns_delete_node(node_to_delete); | |
329 | }; | |
1da177e4 | 330 | |
1da177e4 LT |
331 | /* Clear the parent's child pointer */ |
332 | ||
333 | parent_node->child = NULL; | |
1da177e4 LT |
334 | return_VOID; |
335 | } | |
336 | ||
1da177e4 LT |
337 | /******************************************************************************* |
338 | * | |
339 | * FUNCTION: acpi_ns_delete_namespace_subtree | |
340 | * | |
341 | * PARAMETERS: parent_node - Root of the subtree to be deleted | |
342 | * | |
343 | * RETURN: None. | |
344 | * | |
73a3090a | 345 | * DESCRIPTION: Delete a subtree of the namespace. This includes all objects |
1da177e4 LT |
346 | * stored within the subtree. |
347 | * | |
348 | ******************************************************************************/ | |
349 | ||
4be44fcd | 350 | void acpi_ns_delete_namespace_subtree(struct acpi_namespace_node *parent_node) |
1da177e4 | 351 | { |
4be44fcd LB |
352 | struct acpi_namespace_node *child_node = NULL; |
353 | u32 level = 1; | |
5d3131f5 | 354 | acpi_status status; |
1da177e4 | 355 | |
b229cf92 | 356 | ACPI_FUNCTION_TRACE(ns_delete_namespace_subtree); |
1da177e4 LT |
357 | |
358 | if (!parent_node) { | |
359 | return_VOID; | |
360 | } | |
361 | ||
5d3131f5 DM |
362 | /* Lock namespace for possible update */ |
363 | ||
364 | status = acpi_ut_acquire_mutex(ACPI_MTX_NAMESPACE); | |
365 | if (ACPI_FAILURE(status)) { | |
366 | return_VOID; | |
367 | } | |
368 | ||
1da177e4 LT |
369 | /* |
370 | * Traverse the tree of objects until we bubble back up | |
371 | * to where we started. | |
372 | */ | |
373 | while (level > 0) { | |
52fc0b02 | 374 | |
1da177e4 LT |
375 | /* Get the next node in this scope (NULL if none) */ |
376 | ||
8c725bf9 | 377 | child_node = acpi_ns_get_next_node(parent_node, child_node); |
1da177e4 | 378 | if (child_node) { |
52fc0b02 | 379 | |
1da177e4 LT |
380 | /* Found a child node - detach any attached object */ |
381 | ||
4be44fcd | 382 | acpi_ns_detach_object(child_node); |
1da177e4 LT |
383 | |
384 | /* Check if this node has any children */ | |
385 | ||
8c725bf9 | 386 | if (child_node->child) { |
1da177e4 LT |
387 | /* |
388 | * There is at least one child of this node, | |
389 | * visit the node | |
390 | */ | |
391 | level++; | |
392 | parent_node = child_node; | |
393 | child_node = NULL; | |
394 | } | |
4be44fcd | 395 | } else { |
1da177e4 LT |
396 | /* |
397 | * No more children of this parent node. | |
398 | * Move up to the grandparent. | |
399 | */ | |
400 | level--; | |
401 | ||
402 | /* | |
403 | * Now delete all of the children of this parent | |
404 | * all at the same time. | |
405 | */ | |
4be44fcd | 406 | acpi_ns_delete_children(parent_node); |
1da177e4 LT |
407 | |
408 | /* New "last child" is this parent node */ | |
409 | ||
410 | child_node = parent_node; | |
411 | ||
412 | /* Move up the tree to the grandparent */ | |
413 | ||
c45b5c09 | 414 | parent_node = parent_node->parent; |
1da177e4 LT |
415 | } |
416 | } | |
417 | ||
5d3131f5 | 418 | (void)acpi_ut_release_mutex(ACPI_MTX_NAMESPACE); |
1da177e4 LT |
419 | return_VOID; |
420 | } | |
421 | ||
1da177e4 LT |
422 | /******************************************************************************* |
423 | * | |
424 | * FUNCTION: acpi_ns_delete_namespace_by_owner | |
425 | * | |
426 | * PARAMETERS: owner_id - All nodes with this owner will be deleted | |
427 | * | |
428 | * RETURN: Status | |
429 | * | |
430 | * DESCRIPTION: Delete entries within the namespace that are owned by a | |
73a3090a | 431 | * specific ID. Used to delete entire ACPI tables. All |
1da177e4 LT |
432 | * reference counts are updated. |
433 | * | |
f6dd9221 BM |
434 | * MUTEX: Locks namespace during deletion walk. |
435 | * | |
1da177e4 LT |
436 | ******************************************************************************/ |
437 | ||
4be44fcd | 438 | void acpi_ns_delete_namespace_by_owner(acpi_owner_id owner_id) |
1da177e4 | 439 | { |
4be44fcd LB |
440 | struct acpi_namespace_node *child_node; |
441 | struct acpi_namespace_node *deletion_node; | |
4be44fcd | 442 | struct acpi_namespace_node *parent_node; |
f6dd9221 BM |
443 | u32 level; |
444 | acpi_status status; | |
1da177e4 | 445 | |
b229cf92 | 446 | ACPI_FUNCTION_TRACE_U32(ns_delete_namespace_by_owner, owner_id); |
1da177e4 | 447 | |
0c9938cc RM |
448 | if (owner_id == 0) { |
449 | return_VOID; | |
450 | } | |
451 | ||
f6dd9221 BM |
452 | /* Lock namespace for possible update */ |
453 | ||
454 | status = acpi_ut_acquire_mutex(ACPI_MTX_NAMESPACE); | |
455 | if (ACPI_FAILURE(status)) { | |
456 | return_VOID; | |
457 | } | |
458 | ||
61686124 | 459 | deletion_node = NULL; |
4be44fcd LB |
460 | parent_node = acpi_gbl_root_node; |
461 | child_node = NULL; | |
4be44fcd | 462 | level = 1; |
1da177e4 LT |
463 | |
464 | /* | |
465 | * Traverse the tree of nodes until we bubble back up | |
466 | * to where we started. | |
467 | */ | |
468 | while (level > 0) { | |
469 | /* | |
470 | * Get the next child of this parent node. When child_node is NULL, | |
471 | * the first child of the parent is returned | |
472 | */ | |
8c725bf9 | 473 | child_node = acpi_ns_get_next_node(parent_node, child_node); |
1da177e4 LT |
474 | |
475 | if (deletion_node) { | |
61686124 | 476 | acpi_ns_delete_children(deletion_node); |
8e4319c4 | 477 | acpi_ns_remove_node(deletion_node); |
1da177e4 LT |
478 | deletion_node = NULL; |
479 | } | |
480 | ||
481 | if (child_node) { | |
482 | if (child_node->owner_id == owner_id) { | |
52fc0b02 | 483 | |
1da177e4 LT |
484 | /* Found a matching child node - detach any attached object */ |
485 | ||
4be44fcd | 486 | acpi_ns_detach_object(child_node); |
1da177e4 LT |
487 | } |
488 | ||
489 | /* Check if this node has any children */ | |
490 | ||
8c725bf9 | 491 | if (child_node->child) { |
1da177e4 LT |
492 | /* |
493 | * There is at least one child of this node, | |
494 | * visit the node | |
495 | */ | |
496 | level++; | |
497 | parent_node = child_node; | |
498 | child_node = NULL; | |
4be44fcd | 499 | } else if (child_node->owner_id == owner_id) { |
1da177e4 LT |
500 | deletion_node = child_node; |
501 | } | |
4be44fcd | 502 | } else { |
1da177e4 LT |
503 | /* |
504 | * No more children of this parent node. | |
505 | * Move up to the grandparent. | |
506 | */ | |
507 | level--; | |
508 | if (level != 0) { | |
509 | if (parent_node->owner_id == owner_id) { | |
510 | deletion_node = parent_node; | |
511 | } | |
512 | } | |
513 | ||
514 | /* New "last child" is this parent node */ | |
515 | ||
516 | child_node = parent_node; | |
517 | ||
518 | /* Move up the tree to the grandparent */ | |
519 | ||
c45b5c09 | 520 | parent_node = parent_node->parent; |
1da177e4 LT |
521 | } |
522 | } | |
523 | ||
f6dd9221 | 524 | (void)acpi_ut_release_mutex(ACPI_MTX_NAMESPACE); |
1da177e4 LT |
525 | return_VOID; |
526 | } |