Lines Matching refs:node
12 * The PPTT structure is an inverted tree, with each node potentially
60 struct acpi_pptt_processor *node,
65 if (resource >= node->number_of_priv_resources)
68 ref = ACPI_ADD_PTR(u32, node, sizeof(struct acpi_pptt_processor));
90 * of cache levels for the cache node.
92 * Given a pptt resource, verify that it is a cache node, then walk
125 * continue looking at this node's resource list
127 * cache node.
147 /* walk down from processor node */
155 * possible for a given node to have resources with differing
168 * acpi_count_levels() - Given a PPTT table, and a CPU node, count the caches
170 * @cpu_node: processor node we wish to count caches for
172 * Given a processor node containing a processing unit, walk into it and count
174 * the root node (ignore the package level because it may be possible to have
194 * acpi_pptt_leaf_node() - Given a processor node, determine if its a leaf
196 * @node: passed node is checked to see if its a leaf
198 * Determine if the *node parameter is a leaf node by iterating the
201 * Return: 0 if we find a node referencing the passed node (or table error),
205 struct acpi_pptt_processor *node)
214 return (node->flags & ACPI_PPTT_ACPI_LEAF_NODE);
217 node_entry = ACPI_PTR_DIFF(node, table_hdr);
244 * passed into the function. If we find a node that matches this criteria
245 * we verify that its a leaf node in the topology rather than depending
323 struct acpi_pptt_processor **node)
338 *node = cpu_node;
348 * @found_cache: The PPTT node describing this cache instance
445 /* Locate the last node in the tree with IDENTICAL set */
545 * check_acpi_cpu_flag() - Determine if CPU node has a flag set
550 * Check the node representing a CPU for a given flag.
670 * we reach a root node. Levels beyond the termination point will return the
728 * flag set or we reach a root node.
749 * flag set or we reach a root node.