nsparse.c 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204
  1. /******************************************************************************
  2. *
  3. * Module Name: nsparse - namespace interface to AML parser
  4. *
  5. *****************************************************************************/
  6. /*
  7. * Copyright (C) 2000 - 2008, 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 <acpi/acnamesp.h>
  44. #include <acpi/acparser.h>
  45. #include <acpi/acdispat.h>
  46. #include <acpi/actables.h>
  47. #define _COMPONENT ACPI_NAMESPACE
  48. ACPI_MODULE_NAME("nsparse")
  49. /*******************************************************************************
  50. *
  51. * FUNCTION: ns_one_complete_parse
  52. *
  53. * PARAMETERS: pass_number - 1 or 2
  54. * table_desc - The table to be parsed.
  55. *
  56. * RETURN: Status
  57. *
  58. * DESCRIPTION: Perform one complete parse of an ACPI/AML table.
  59. *
  60. ******************************************************************************/
  61. acpi_status
  62. acpi_ns_one_complete_parse(acpi_native_uint pass_number,
  63. acpi_native_uint table_index,
  64. struct acpi_namespace_node * start_node)
  65. {
  66. union acpi_parse_object *parse_root;
  67. acpi_status status;
  68. acpi_native_uint aml_length;
  69. u8 *aml_start;
  70. struct acpi_walk_state *walk_state;
  71. struct acpi_table_header *table;
  72. acpi_owner_id owner_id;
  73. ACPI_FUNCTION_TRACE(ns_one_complete_parse);
  74. status = acpi_tb_get_owner_id(table_index, &owner_id);
  75. if (ACPI_FAILURE(status)) {
  76. return_ACPI_STATUS(status);
  77. }
  78. /* Create and init a Root Node */
  79. parse_root = acpi_ps_create_scope_op();
  80. if (!parse_root) {
  81. return_ACPI_STATUS(AE_NO_MEMORY);
  82. }
  83. /* Create and initialize a new walk state */
  84. walk_state = acpi_ds_create_walk_state(owner_id, NULL, NULL, NULL);
  85. if (!walk_state) {
  86. acpi_ps_free_op(parse_root);
  87. return_ACPI_STATUS(AE_NO_MEMORY);
  88. }
  89. status = acpi_get_table_by_index(table_index, &table);
  90. if (ACPI_FAILURE(status)) {
  91. acpi_ds_delete_walk_state(walk_state);
  92. acpi_ps_free_op(parse_root);
  93. return_ACPI_STATUS(status);
  94. }
  95. /* Table must consist of at least a complete header */
  96. if (table->length < sizeof(struct acpi_table_header)) {
  97. status = AE_BAD_HEADER;
  98. } else {
  99. aml_start = (u8 *) table + sizeof(struct acpi_table_header);
  100. aml_length = table->length - sizeof(struct acpi_table_header);
  101. status = acpi_ds_init_aml_walk(walk_state, parse_root, NULL,
  102. aml_start, (u32) aml_length,
  103. NULL, (u8) pass_number);
  104. }
  105. if (ACPI_FAILURE(status)) {
  106. acpi_ds_delete_walk_state(walk_state);
  107. goto cleanup;
  108. }
  109. /* start_node is the default location to load the table */
  110. if (start_node && start_node != acpi_gbl_root_node) {
  111. status =
  112. acpi_ds_scope_stack_push(start_node, ACPI_TYPE_METHOD,
  113. walk_state);
  114. if (ACPI_FAILURE(status)) {
  115. acpi_ds_delete_walk_state(walk_state);
  116. goto cleanup;
  117. }
  118. }
  119. /* Parse the AML */
  120. ACPI_DEBUG_PRINT((ACPI_DB_PARSE, "*PARSE* pass %d parse\n",
  121. (unsigned)pass_number));
  122. status = acpi_ps_parse_aml(walk_state);
  123. cleanup:
  124. acpi_ps_delete_parse_tree(parse_root);
  125. return_ACPI_STATUS(status);
  126. }
  127. /*******************************************************************************
  128. *
  129. * FUNCTION: acpi_ns_parse_table
  130. *
  131. * PARAMETERS: table_desc - An ACPI table descriptor for table to parse
  132. * start_node - Where to enter the table into the namespace
  133. *
  134. * RETURN: Status
  135. *
  136. * DESCRIPTION: Parse AML within an ACPI table and return a tree of ops
  137. *
  138. ******************************************************************************/
  139. acpi_status
  140. acpi_ns_parse_table(acpi_native_uint table_index,
  141. struct acpi_namespace_node *start_node)
  142. {
  143. acpi_status status;
  144. ACPI_FUNCTION_TRACE(ns_parse_table);
  145. /*
  146. * AML Parse, pass 1
  147. *
  148. * In this pass, we load most of the namespace. Control methods
  149. * are not parsed until later. A parse tree is not created. Instead,
  150. * each Parser Op subtree is deleted when it is finished. This saves
  151. * a great deal of memory, and allows a small cache of parse objects
  152. * to service the entire parse. The second pass of the parse then
  153. * performs another complete parse of the AML.
  154. */
  155. ACPI_DEBUG_PRINT((ACPI_DB_PARSE, "**** Start pass 1\n"));
  156. status =
  157. acpi_ns_one_complete_parse(ACPI_IMODE_LOAD_PASS1, table_index,
  158. start_node);
  159. if (ACPI_FAILURE(status)) {
  160. return_ACPI_STATUS(status);
  161. }
  162. /*
  163. * AML Parse, pass 2
  164. *
  165. * In this pass, we resolve forward references and other things
  166. * that could not be completed during the first pass.
  167. * Another complete parse of the AML is performed, but the
  168. * overhead of this is compensated for by the fact that the
  169. * parse objects are all cached.
  170. */
  171. ACPI_DEBUG_PRINT((ACPI_DB_PARSE, "**** Start pass 2\n"));
  172. status =
  173. acpi_ns_one_complete_parse(ACPI_IMODE_LOAD_PASS2, table_index,
  174. start_node);
  175. if (ACPI_FAILURE(status)) {
  176. return_ACPI_STATUS(status);
  177. }
  178. return_ACPI_STATUS(status);
  179. }