| * linux/arch/alpha/kernel/gct.c |
| #include <linux/kernel.h> |
| gct6_find_nodes(gct6_node *node, gct6_search_struct *search) |
| gct6_search_struct *wanted; |
| /* First check the magic number. */ |
| if (node->magic != GCT_NODE_MAGIC) { |
| printk(KERN_ERR "GCT Node MAGIC incorrect - GCT invalid\n"); |
| /* Check against the search struct. */ |
| wanted && (wanted->type | wanted->subtype); |
| if (node->type != wanted->type) |
| if (node->subtype != wanted->subtype) |
| /* Found it -- call out. */ |
| /* Now walk the tree, siblings first. */ |
| status |= gct6_find_nodes(GCT_NODE_PTR(node->next), search); |
| status |= gct6_find_nodes(GCT_NODE_PTR(node->child), search); |