pswalk.c 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110
  1. /******************************************************************************
  2. *
  3. * Module Name: pswalk - Parser routines to walk parsed op tree(s)
  4. *
  5. *****************************************************************************/
  6. /*
  7. * Copyright (C) 2000 - 2015, Intel Corp.
  8. * All rights reserved.
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions
  12. * are met:
  13. * 1. Redistributions of source code must retain the above copyright
  14. * notice, this list of conditions, and the following disclaimer,
  15. * without modification.
  16. * 2. Redistributions in binary form must reproduce at minimum a disclaimer
  17. * substantially similar to the "NO WARRANTY" disclaimer below
  18. * ("Disclaimer") and any redistribution must be conditioned upon
  19. * including a substantially similar Disclaimer requirement for further
  20. * binary redistribution.
  21. * 3. Neither the names of the above-listed copyright holders nor the names
  22. * of any contributors may be used to endorse or promote products derived
  23. * from this software without specific prior written permission.
  24. *
  25. * Alternatively, this software may be distributed under the terms of the
  26. * GNU General Public License ("GPL") version 2 as published by the Free
  27. * Software Foundation.
  28. *
  29. * NO WARRANTY
  30. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  31. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  32. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR
  33. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  34. * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  35. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  36. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  37. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  38. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
  39. * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  40. * POSSIBILITY OF SUCH DAMAGES.
  41. */
  42. #include <acpi/acpi.h>
  43. #include "accommon.h"
  44. #include "acparser.h"
  45. #define _COMPONENT ACPI_PARSER
  46. ACPI_MODULE_NAME("pswalk")
  47. /*******************************************************************************
  48. *
  49. * FUNCTION: acpi_ps_delete_parse_tree
  50. *
  51. * PARAMETERS: subtree_root - Root of tree (or subtree) to delete
  52. *
  53. * RETURN: None
  54. *
  55. * DESCRIPTION: Delete a portion of or an entire parse tree.
  56. *
  57. ******************************************************************************/
  58. void acpi_ps_delete_parse_tree(union acpi_parse_object *subtree_root)
  59. {
  60. union acpi_parse_object *op = subtree_root;
  61. union acpi_parse_object *next = NULL;
  62. union acpi_parse_object *parent = NULL;
  63. ACPI_FUNCTION_TRACE_PTR(ps_delete_parse_tree, subtree_root);
  64. /* Visit all nodes in the subtree */
  65. while (op) {
  66. /* Check if we are not ascending */
  67. if (op != parent) {
  68. /* Look for an argument or child of the current op */
  69. next = acpi_ps_get_arg(op, 0);
  70. if (next) {
  71. /* Still going downward in tree (Op is not completed yet) */
  72. op = next;
  73. continue;
  74. }
  75. }
  76. /* No more children, this Op is complete. */
  77. next = op->common.next;
  78. parent = op->common.parent;
  79. acpi_ps_free_op(op);
  80. /* If we are back to the starting point, the walk is complete. */
  81. if (op == subtree_root) {
  82. return_VOID;
  83. }
  84. if (next) {
  85. op = next;
  86. } else {
  87. op = parent;
  88. }
  89. }
  90. return_VOID;
  91. }