nsnames.c 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241
  1. /*******************************************************************************
  2. *
  3. * Module Name: nsnames - Name manipulation and search
  4. *
  5. ******************************************************************************/
  6. /*
  7. * Copyright (C) 2000 - 2006, R. Byron Moore
  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/amlcode.h>
  44. #include <acpi/acnamesp.h>
  45. #define _COMPONENT ACPI_NAMESPACE
  46. ACPI_MODULE_NAME("nsnames")
  47. /*******************************************************************************
  48. *
  49. * FUNCTION: acpi_ns_build_external_path
  50. *
  51. * PARAMETERS: Node - NS node whose pathname is needed
  52. * Size - Size of the pathname
  53. * *name_buffer - Where to return the pathname
  54. *
  55. * RETURN: Places the pathname into the name_buffer, in external format
  56. * (name segments separated by path separators)
  57. *
  58. * DESCRIPTION: Generate a full pathaname
  59. *
  60. ******************************************************************************/
  61. void
  62. acpi_ns_build_external_path(struct acpi_namespace_node *node,
  63. acpi_size size, char *name_buffer)
  64. {
  65. acpi_size index;
  66. struct acpi_namespace_node *parent_node;
  67. ACPI_FUNCTION_ENTRY();
  68. /* Special case for root */
  69. index = size - 1;
  70. if (index < ACPI_NAME_SIZE) {
  71. name_buffer[0] = AML_ROOT_PREFIX;
  72. name_buffer[1] = 0;
  73. return;
  74. }
  75. /* Store terminator byte, then build name backwards */
  76. parent_node = node;
  77. name_buffer[index] = 0;
  78. while ((index > ACPI_NAME_SIZE) && (parent_node != acpi_gbl_root_node)) {
  79. index -= ACPI_NAME_SIZE;
  80. /* Put the name into the buffer */
  81. ACPI_MOVE_32_TO_32((name_buffer + index), &parent_node->name);
  82. parent_node = acpi_ns_get_parent_node(parent_node);
  83. /* Prefix name with the path separator */
  84. index--;
  85. name_buffer[index] = ACPI_PATH_SEPARATOR;
  86. }
  87. /* Overwrite final separator with the root prefix character */
  88. name_buffer[index] = AML_ROOT_PREFIX;
  89. if (index != 0) {
  90. ACPI_ERROR((AE_INFO,
  91. "Could not construct pathname; index=%X, size=%X, Path=%s",
  92. (u32) index, (u32) size, &name_buffer[size]));
  93. }
  94. return;
  95. }
  96. #ifdef ACPI_DEBUG_OUTPUT
  97. /*******************************************************************************
  98. *
  99. * FUNCTION: acpi_ns_get_external_pathname
  100. *
  101. * PARAMETERS: Node - Namespace node whose pathname is needed
  102. *
  103. * RETURN: Pointer to storage containing the fully qualified name of
  104. * the node, In external format (name segments separated by path
  105. * separators.)
  106. *
  107. * DESCRIPTION: Used for debug printing in acpi_ns_search_table().
  108. *
  109. ******************************************************************************/
  110. char *acpi_ns_get_external_pathname(struct acpi_namespace_node *node)
  111. {
  112. char *name_buffer;
  113. acpi_size size;
  114. ACPI_FUNCTION_TRACE_PTR(ns_get_external_pathname, node);
  115. /* Calculate required buffer size based on depth below root */
  116. size = acpi_ns_get_pathname_length(node);
  117. /* Allocate a buffer to be returned to caller */
  118. name_buffer = ACPI_ALLOCATE_ZEROED(size);
  119. if (!name_buffer) {
  120. ACPI_ERROR((AE_INFO, "Allocation failure"));
  121. return_PTR(NULL);
  122. }
  123. /* Build the path in the allocated buffer */
  124. acpi_ns_build_external_path(node, size, name_buffer);
  125. return_PTR(name_buffer);
  126. }
  127. #endif
  128. /*******************************************************************************
  129. *
  130. * FUNCTION: acpi_ns_get_pathname_length
  131. *
  132. * PARAMETERS: Node - Namespace node
  133. *
  134. * RETURN: Length of path, including prefix
  135. *
  136. * DESCRIPTION: Get the length of the pathname string for this node
  137. *
  138. ******************************************************************************/
  139. acpi_size acpi_ns_get_pathname_length(struct acpi_namespace_node *node)
  140. {
  141. acpi_size size;
  142. struct acpi_namespace_node *next_node;
  143. ACPI_FUNCTION_ENTRY();
  144. /*
  145. * Compute length of pathname as 5 * number of name segments.
  146. * Go back up the parent tree to the root
  147. */
  148. size = 0;
  149. next_node = node;
  150. while (next_node && (next_node != acpi_gbl_root_node)) {
  151. size += ACPI_PATH_SEGMENT_LENGTH;
  152. next_node = acpi_ns_get_parent_node(next_node);
  153. }
  154. if (!size) {
  155. size = 1; /* Root node case */
  156. }
  157. return (size + 1); /* +1 for null string terminator */
  158. }
  159. /*******************************************************************************
  160. *
  161. * FUNCTION: acpi_ns_handle_to_pathname
  162. *
  163. * PARAMETERS: target_handle - Handle of named object whose name is
  164. * to be found
  165. * Buffer - Where the pathname is returned
  166. *
  167. * RETURN: Status, Buffer is filled with pathname if status is AE_OK
  168. *
  169. * DESCRIPTION: Build and return a full namespace pathname
  170. *
  171. ******************************************************************************/
  172. acpi_status
  173. acpi_ns_handle_to_pathname(acpi_handle target_handle,
  174. struct acpi_buffer * buffer)
  175. {
  176. acpi_status status;
  177. struct acpi_namespace_node *node;
  178. acpi_size required_size;
  179. ACPI_FUNCTION_TRACE_PTR(ns_handle_to_pathname, target_handle);
  180. node = acpi_ns_map_handle_to_node(target_handle);
  181. if (!node) {
  182. return_ACPI_STATUS(AE_BAD_PARAMETER);
  183. }
  184. /* Determine size required for the caller buffer */
  185. required_size = acpi_ns_get_pathname_length(node);
  186. /* Validate/Allocate/Clear caller buffer */
  187. status = acpi_ut_initialize_buffer(buffer, required_size);
  188. if (ACPI_FAILURE(status)) {
  189. return_ACPI_STATUS(status);
  190. }
  191. /* Build the path in the caller buffer */
  192. acpi_ns_build_external_path(node, required_size, buffer->pointer);
  193. ACPI_DEBUG_PRINT((ACPI_DB_EXEC, "%s [%X]\n",
  194. (char *)buffer->pointer, (u32) required_size));
  195. return_ACPI_STATUS(AE_OK);
  196. }