xref: /illumos-gate/usr/src/common/mdesc/mdesc_scandag.c (revision 7c478bd95313f5f23a4c958a745db2134aa03244)
1*7c478bd9Sstevel@tonic-gate /*
2*7c478bd9Sstevel@tonic-gate  * CDDL HEADER START
3*7c478bd9Sstevel@tonic-gate  *
4*7c478bd9Sstevel@tonic-gate  * The contents of this file are subject to the terms of the
5*7c478bd9Sstevel@tonic-gate  * Common Development and Distribution License, Version 1.0 only
6*7c478bd9Sstevel@tonic-gate  * (the "License").  You may not use this file except in compliance
7*7c478bd9Sstevel@tonic-gate  * with the License.
8*7c478bd9Sstevel@tonic-gate  *
9*7c478bd9Sstevel@tonic-gate  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*7c478bd9Sstevel@tonic-gate  * or http://www.opensolaris.org/os/licensing.
11*7c478bd9Sstevel@tonic-gate  * See the License for the specific language governing permissions
12*7c478bd9Sstevel@tonic-gate  * and limitations under the License.
13*7c478bd9Sstevel@tonic-gate  *
14*7c478bd9Sstevel@tonic-gate  * When distributing Covered Code, include this CDDL HEADER in each
15*7c478bd9Sstevel@tonic-gate  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*7c478bd9Sstevel@tonic-gate  * If applicable, add the following below this CDDL HEADER, with the
17*7c478bd9Sstevel@tonic-gate  * fields enclosed by brackets "[]" replaced with your own identifying
18*7c478bd9Sstevel@tonic-gate  * information: Portions Copyright [yyyy] [name of copyright owner]
19*7c478bd9Sstevel@tonic-gate  *
20*7c478bd9Sstevel@tonic-gate  * CDDL HEADER END
21*7c478bd9Sstevel@tonic-gate  */
22*7c478bd9Sstevel@tonic-gate /*
23*7c478bd9Sstevel@tonic-gate  * Copyright 2005 Sun Microsystems, Inc.  All rights reserved.
24*7c478bd9Sstevel@tonic-gate  * Use is subject to license terms.
25*7c478bd9Sstevel@tonic-gate  */
26*7c478bd9Sstevel@tonic-gate 
27*7c478bd9Sstevel@tonic-gate #pragma ident	"%Z%%M%	%I%	%E% SMI"
28*7c478bd9Sstevel@tonic-gate 
29*7c478bd9Sstevel@tonic-gate #include <sys/types.h>
30*7c478bd9Sstevel@tonic-gate #include <sys/param.h>
31*7c478bd9Sstevel@tonic-gate #ifdef _KERNEL
32*7c478bd9Sstevel@tonic-gate #include <sys/systm.h>
33*7c478bd9Sstevel@tonic-gate #else
34*7c478bd9Sstevel@tonic-gate #include <string.h>
35*7c478bd9Sstevel@tonic-gate #include <strings.h>
36*7c478bd9Sstevel@tonic-gate #endif
37*7c478bd9Sstevel@tonic-gate 
38*7c478bd9Sstevel@tonic-gate #include <sys/mdesc.h>
39*7c478bd9Sstevel@tonic-gate #include <sys/mdesc_impl.h>
40*7c478bd9Sstevel@tonic-gate 
41*7c478bd9Sstevel@tonic-gate static int
42*7c478bd9Sstevel@tonic-gate mdl_scan_dag(md_impl_t *mdp,
43*7c478bd9Sstevel@tonic-gate 	int nodeidx,
44*7c478bd9Sstevel@tonic-gate 	mde_str_cookie_t node_cookie,
45*7c478bd9Sstevel@tonic-gate 	mde_str_cookie_t arc_cookie,
46*7c478bd9Sstevel@tonic-gate 	uint8_t *dseenp,
47*7c478bd9Sstevel@tonic-gate 	int *idxp,
48*7c478bd9Sstevel@tonic-gate 	mde_cookie_t *stashp,
49*7c478bd9Sstevel@tonic-gate 	int level);
50*7c478bd9Sstevel@tonic-gate 
51*7c478bd9Sstevel@tonic-gate 
52*7c478bd9Sstevel@tonic-gate int
53*7c478bd9Sstevel@tonic-gate md_scan_dag(md_t *ptr,
54*7c478bd9Sstevel@tonic-gate 	mde_cookie_t startnode,
55*7c478bd9Sstevel@tonic-gate 	mde_str_cookie_t node_name_cookie,
56*7c478bd9Sstevel@tonic-gate 	mde_str_cookie_t arc_name_cookie,
57*7c478bd9Sstevel@tonic-gate 	mde_cookie_t *stashp)
58*7c478bd9Sstevel@tonic-gate {
59*7c478bd9Sstevel@tonic-gate 	int	res;
60*7c478bd9Sstevel@tonic-gate 	int	idx;
61*7c478bd9Sstevel@tonic-gate 	uint8_t *seenp;
62*7c478bd9Sstevel@tonic-gate 	md_impl_t *mdp;
63*7c478bd9Sstevel@tonic-gate 	int	start;
64*7c478bd9Sstevel@tonic-gate 
65*7c478bd9Sstevel@tonic-gate 	mdp = (md_impl_t *)ptr;
66*7c478bd9Sstevel@tonic-gate 
67*7c478bd9Sstevel@tonic-gate 	/*
68*7c478bd9Sstevel@tonic-gate 	 * Possible the caller was lazy and didn't check the
69*7c478bd9Sstevel@tonic-gate 	 * validitiy of either the node name or the arc name
70*7c478bd9Sstevel@tonic-gate 	 * on calling ... in which case fail to find any
71*7c478bd9Sstevel@tonic-gate 	 * nodes.
72*7c478bd9Sstevel@tonic-gate 	 * This is distinct, from a fail (-1) since we return
73*7c478bd9Sstevel@tonic-gate 	 * that nothing was found.
74*7c478bd9Sstevel@tonic-gate 	 */
75*7c478bd9Sstevel@tonic-gate 
76*7c478bd9Sstevel@tonic-gate 	if (node_name_cookie == MDE_INVAL_STR_COOKIE ||
77*7c478bd9Sstevel@tonic-gate 		arc_name_cookie == MDE_INVAL_STR_COOKIE) return 0;
78*7c478bd9Sstevel@tonic-gate 
79*7c478bd9Sstevel@tonic-gate 	/*
80*7c478bd9Sstevel@tonic-gate 	 * if we want to start at the top, start at index 0
81*7c478bd9Sstevel@tonic-gate 	 */
82*7c478bd9Sstevel@tonic-gate 
83*7c478bd9Sstevel@tonic-gate 	start = (int)startnode;
84*7c478bd9Sstevel@tonic-gate 	if (start == MDE_INVAL_ELEM_COOKIE) start = 0;
85*7c478bd9Sstevel@tonic-gate 
86*7c478bd9Sstevel@tonic-gate 	/*
87*7c478bd9Sstevel@tonic-gate 	 * Scan from the start point until the first node.
88*7c478bd9Sstevel@tonic-gate 	 */
89*7c478bd9Sstevel@tonic-gate 	while (MDE_TAG(&mdp->mdep[start]) == MDET_NULL) start++;
90*7c478bd9Sstevel@tonic-gate 
91*7c478bd9Sstevel@tonic-gate 	/*
92*7c478bd9Sstevel@tonic-gate 	 * This was a bogus start point if no node found
93*7c478bd9Sstevel@tonic-gate 	 */
94*7c478bd9Sstevel@tonic-gate 	if (MDE_TAG(&mdp->mdep[start]) != MDET_NODE) {
95*7c478bd9Sstevel@tonic-gate 		return (-1);	/* illegal start node specified */
96*7c478bd9Sstevel@tonic-gate 	}
97*7c478bd9Sstevel@tonic-gate 
98*7c478bd9Sstevel@tonic-gate 	/*
99*7c478bd9Sstevel@tonic-gate 	 * Allocate a recursion mask on the local stack fail
100*7c478bd9Sstevel@tonic-gate 	 * if we can't allocate the recursion detection.
101*7c478bd9Sstevel@tonic-gate 	 */
102*7c478bd9Sstevel@tonic-gate 	seenp = (uint8_t *)mdp->allocp(mdp->element_count);
103*7c478bd9Sstevel@tonic-gate 	if (seenp == NULL)
104*7c478bd9Sstevel@tonic-gate 		return (-1);
105*7c478bd9Sstevel@tonic-gate 	(void) memset(seenp, 0, mdp->element_count);
106*7c478bd9Sstevel@tonic-gate 
107*7c478bd9Sstevel@tonic-gate 	/*
108*7c478bd9Sstevel@tonic-gate 	 * Now build the list of requested nodes.
109*7c478bd9Sstevel@tonic-gate 	 */
110*7c478bd9Sstevel@tonic-gate 	idx = 0;
111*7c478bd9Sstevel@tonic-gate 	res = mdl_scan_dag(mdp, start,
112*7c478bd9Sstevel@tonic-gate 		node_name_cookie, arc_name_cookie,
113*7c478bd9Sstevel@tonic-gate 		seenp, &idx, stashp, 0);
114*7c478bd9Sstevel@tonic-gate 
115*7c478bd9Sstevel@tonic-gate 	mdp->freep(seenp);
116*7c478bd9Sstevel@tonic-gate 
117*7c478bd9Sstevel@tonic-gate 	return (res >= 0 ? idx : res);
118*7c478bd9Sstevel@tonic-gate }
119*7c478bd9Sstevel@tonic-gate 
120*7c478bd9Sstevel@tonic-gate 
121*7c478bd9Sstevel@tonic-gate 
122*7c478bd9Sstevel@tonic-gate 
123*7c478bd9Sstevel@tonic-gate 
124*7c478bd9Sstevel@tonic-gate static int mdl_scan_dag(md_impl_t *mdp,
125*7c478bd9Sstevel@tonic-gate 	int nodeidx,
126*7c478bd9Sstevel@tonic-gate 	mde_str_cookie_t node_name_cookie,
127*7c478bd9Sstevel@tonic-gate 	mde_str_cookie_t arc_name_cookie,
128*7c478bd9Sstevel@tonic-gate 	uint8_t *seenp,
129*7c478bd9Sstevel@tonic-gate 	int *idxp,
130*7c478bd9Sstevel@tonic-gate 	mde_cookie_t *stashp,
131*7c478bd9Sstevel@tonic-gate 	int level)
132*7c478bd9Sstevel@tonic-gate {
133*7c478bd9Sstevel@tonic-gate 	md_element_t *mdep;
134*7c478bd9Sstevel@tonic-gate 
135*7c478bd9Sstevel@tonic-gate 	mdep = &(mdp->mdep[nodeidx]);
136*7c478bd9Sstevel@tonic-gate 
137*7c478bd9Sstevel@tonic-gate 	/* see if cookie is infact a node */
138*7c478bd9Sstevel@tonic-gate 	if (MDE_TAG(mdep) != MDET_NODE)
139*7c478bd9Sstevel@tonic-gate 		return (-1);
140*7c478bd9Sstevel@tonic-gate 
141*7c478bd9Sstevel@tonic-gate 	/* have we been here before ? */
142*7c478bd9Sstevel@tonic-gate 	if (seenp[nodeidx])
143*7c478bd9Sstevel@tonic-gate 		return (0);
144*7c478bd9Sstevel@tonic-gate 	seenp[nodeidx] = 1;
145*7c478bd9Sstevel@tonic-gate 
146*7c478bd9Sstevel@tonic-gate 	/* is this node of the type we seek ? */
147*7c478bd9Sstevel@tonic-gate 
148*7c478bd9Sstevel@tonic-gate #ifdef	DEBUG_LIBMDESC
149*7c478bd9Sstevel@tonic-gate 	{
150*7c478bd9Sstevel@tonic-gate 	int x;
151*7c478bd9Sstevel@tonic-gate 	for (x = 0; x < level; x++)
152*7c478bd9Sstevel@tonic-gate 		printf("-");
153*7c478bd9Sstevel@tonic-gate 	printf("%d (%s)\n", nodeidx, (char *)(mdp->datap + MDE_NAME(mdep)));
154*7c478bd9Sstevel@tonic-gate 	}
155*7c478bd9Sstevel@tonic-gate #endif
156*7c478bd9Sstevel@tonic-gate 
157*7c478bd9Sstevel@tonic-gate 	if (MDE_NAME(mdep) == node_name_cookie) {
158*7c478bd9Sstevel@tonic-gate 		/* record the node in the list and keep searching */
159*7c478bd9Sstevel@tonic-gate 		if (stashp != NULL) {
160*7c478bd9Sstevel@tonic-gate 			stashp[*idxp] = (mde_cookie_t)nodeidx;
161*7c478bd9Sstevel@tonic-gate 		}
162*7c478bd9Sstevel@tonic-gate 		(*idxp)++;
163*7c478bd9Sstevel@tonic-gate #ifdef	DEBUG_LIBMDESC
164*7c478bd9Sstevel@tonic-gate 		printf("\t* %d\n", *idxp);
165*7c478bd9Sstevel@tonic-gate #endif
166*7c478bd9Sstevel@tonic-gate 	}
167*7c478bd9Sstevel@tonic-gate 
168*7c478bd9Sstevel@tonic-gate 	/*
169*7c478bd9Sstevel@tonic-gate 	 * Simply walk the elements in the node.
170*7c478bd9Sstevel@tonic-gate 	 * if we find a matching arc, then recursively call
171*7c478bd9Sstevel@tonic-gate 	 * the subordinate looking for a match
172*7c478bd9Sstevel@tonic-gate 	 */
173*7c478bd9Sstevel@tonic-gate 
174*7c478bd9Sstevel@tonic-gate 	for (mdep++; MDE_TAG(mdep) != MDET_NODE_END; mdep++) {
175*7c478bd9Sstevel@tonic-gate 		if (MDE_TAG(mdep) == MDET_PROP_ARC &&
176*7c478bd9Sstevel@tonic-gate 			MDE_NAME(mdep) == arc_name_cookie) {
177*7c478bd9Sstevel@tonic-gate 			int res;
178*7c478bd9Sstevel@tonic-gate 
179*7c478bd9Sstevel@tonic-gate 			res = mdl_scan_dag(mdp,
180*7c478bd9Sstevel@tonic-gate 			    (int)mdep->d.prop_idx,
181*7c478bd9Sstevel@tonic-gate 			    node_name_cookie,
182*7c478bd9Sstevel@tonic-gate 			    arc_name_cookie,
183*7c478bd9Sstevel@tonic-gate 			    seenp, idxp, stashp, level+1);
184*7c478bd9Sstevel@tonic-gate 
185*7c478bd9Sstevel@tonic-gate 			if (res == -1)
186*7c478bd9Sstevel@tonic-gate 				return (res);
187*7c478bd9Sstevel@tonic-gate 		}
188*7c478bd9Sstevel@tonic-gate 	}
189*7c478bd9Sstevel@tonic-gate 
190*7c478bd9Sstevel@tonic-gate 	return (0);
191*7c478bd9Sstevel@tonic-gate }
192