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