1 /* 2 * CDDL HEADER START 3 * 4 * The contents of this file are subject to the terms of the 5 * Common Development and Distribution License (the "License"). 6 * You may not use this file except in compliance with the License. 7 * 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 9 * or http://www.opensolaris.org/os/licensing. 10 * See the License for the specific language governing permissions 11 * and limitations under the License. 12 * 13 * When distributing Covered Code, include this CDDL HEADER in each 14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 15 * If applicable, add the following below this CDDL HEADER, with the 16 * fields enclosed by brackets "[]" replaced with your own identifying 17 * information: Portions Copyright [yyyy] [name of copyright owner] 18 * 19 * CDDL HEADER END 20 */ 21 /* 22 * Copyright 2009 Sun Microsystems, Inc. All rights reserved. 23 * Use is subject to license terms. 24 */ 25 26 /* 27 * Snapshot Library Interfaces 28 * 29 * Consumers of topology data may use the interfaces in this file to open, 30 * snapshot and close a topology exported by FMRI scheme (hc, mem and cpu) 31 * builtin plugins and their helper modules. A topology handle is obtained 32 * by calling topo_open(). Upon a successful return, the caller may use this 33 * handle to open a new snapshot. Each snapshot is assigned a Universally 34 * Unique Identifier that in a future enchancement to the libtopo API will be 35 * used as the file locator in /var/fm/topo to persist new snapshots or lookup 36 * a previously captured snapshot. topo_snap_hold() will capture the current 37 * system topology. All consumers of the topo_hdl_t argument will be 38 * blocked from accessing the topology trees until the snapshot completes. 39 * 40 * A snapshot may be cleared by calling topo_snap_rele(). As with 41 * topo_snap_hold(), all topology accesses are blocked until the topology 42 * trees have been released and deallocated. 43 * 44 * Walker Library Interfaces 45 * 46 * Once a snapshot has been taken with topo_snap_hold(), topo_hdl_t holders 47 * may initiate topology tree walks on a scheme-tree basis. topo_walk_init() 48 * will initiate the data structures required to walk any one one of the 49 * FMRI scheme trees. The walker data structure, topo_walk_t, is an opaque 50 * handle passed to topo_walk_step to begin the walk. At each node in the 51 * topology tree, a callback function is called with access to the node at 52 * which our current walk falls. The callback function is passed in during 53 * calls to topo_walk_init() and used throughout the walk_step of the 54 * scheme tree. At any time, the callback may terminate the walk by returning 55 * TOPO_WALK_TERMINATE or TOPO_WALK_ERR. TOPO_WALK_NEXT will continue the walk. 56 * 57 * The type of walk through the tree may be sibling first or child first by 58 * respectively passing in TOPO_WALK_SIBLING or TOPO_WALK_CHILD to 59 * the topo_walk_step() function. Topology nodes 60 * associated with an outstanding walk are held in place and will not be 61 * deallocated until the walk through that node completes. 62 * 63 * Once the walk has terminated, the walking process should call 64 * topo_walk_fini() to clean-up resources created in topo_walk_init() 65 * and release nodes that may be still held. 66 */ 67 68 #include <alloca.h> 69 #include <ctype.h> 70 #include <pthread.h> 71 #include <limits.h> 72 #include <assert.h> 73 #include <fcntl.h> 74 #include <smbios.h> 75 #include <sys/param.h> 76 #include <sys/types.h> 77 #include <sys/stat.h> 78 #include <sys/systeminfo.h> 79 #include <sys/utsname.h> 80 #include <uuid/uuid.h> 81 82 #include <fm/libtopo.h> 83 #include <sys/fm/protocol.h> 84 85 #include <topo_alloc.h> 86 #include <topo_builtin.h> 87 #include <topo_string.h> 88 #include <topo_error.h> 89 #include <topo_subr.h> 90 91 static void topo_snap_destroy(topo_hdl_t *); 92 93 static topo_hdl_t * 94 set_open_errno(topo_hdl_t *thp, int *errp, int err) 95 { 96 if (thp != NULL) { 97 topo_close(thp); 98 } 99 if (errp != NULL) 100 *errp = err; 101 return (NULL); 102 } 103 104 topo_hdl_t * 105 topo_open(int version, const char *rootdir, int *errp) 106 { 107 topo_hdl_t *thp = NULL; 108 topo_alloc_t *tap; 109 110 char platform[MAXNAMELEN]; 111 char isa[MAXNAMELEN]; 112 struct utsname uts; 113 struct stat st; 114 115 smbios_hdl_t *shp; 116 smbios_system_t s1; 117 smbios_info_t s2; 118 id_t id; 119 120 char *dbflags, *dbout; 121 122 if (version != TOPO_VERSION) 123 return (set_open_errno(thp, errp, ETOPO_HDL_ABIVER)); 124 125 if (rootdir != NULL && stat(rootdir, &st) < 0) 126 return (set_open_errno(thp, errp, ETOPO_HDL_INVAL)); 127 128 if ((thp = topo_zalloc(sizeof (topo_hdl_t), 0)) == NULL) 129 return (set_open_errno(thp, errp, ETOPO_NOMEM)); 130 131 (void) pthread_mutex_init(&thp->th_lock, NULL); 132 133 if ((tap = topo_zalloc(sizeof (topo_alloc_t), 0)) == NULL) 134 return (set_open_errno(thp, errp, ETOPO_NOMEM)); 135 136 /* 137 * Install default allocators 138 */ 139 tap->ta_flags = 0; 140 tap->ta_alloc = topo_alloc; 141 tap->ta_zalloc = topo_zalloc; 142 tap->ta_free = topo_free; 143 tap->ta_nvops.nv_ao_alloc = topo_nv_alloc; 144 tap->ta_nvops.nv_ao_free = topo_nv_free; 145 (void) nv_alloc_init(&tap->ta_nva, &tap->ta_nvops); 146 thp->th_alloc = tap; 147 148 if ((thp->th_modhash = topo_modhash_create(thp)) == NULL) 149 return (set_open_errno(thp, errp, ETOPO_NOMEM)); 150 151 /* 152 * Set-up system information and search paths for modules 153 * and topology map files 154 */ 155 if (rootdir == NULL) { 156 rootdir = topo_hdl_strdup(thp, "/"); 157 thp->th_rootdir = (char *)rootdir; 158 } else { 159 int len; 160 char *rpath; 161 162 len = strlen(rootdir); 163 if (len >= PATH_MAX) 164 return (set_open_errno(thp, errp, EINVAL)); 165 166 if (rootdir[len - 1] != '/') { 167 rpath = alloca(len + 2); 168 (void) snprintf(rpath, len + 2, "%s/", rootdir); 169 } else { 170 rpath = (char *)rootdir; 171 } 172 thp->th_rootdir = topo_hdl_strdup(thp, rpath); 173 } 174 175 platform[0] = '\0'; 176 isa[0] = '\0'; 177 (void) sysinfo(SI_PLATFORM, platform, sizeof (platform)); 178 (void) sysinfo(SI_ARCHITECTURE, isa, sizeof (isa)); 179 (void) uname(&uts); 180 thp->th_platform = topo_hdl_strdup(thp, platform); 181 thp->th_isa = topo_hdl_strdup(thp, isa); 182 thp->th_machine = topo_hdl_strdup(thp, uts.machine); 183 if ((shp = smbios_open(NULL, SMB_VERSION, 0, NULL)) != NULL) { 184 if ((id = smbios_info_system(shp, &s1)) != SMB_ERR && 185 smbios_info_common(shp, id, &s2) != SMB_ERR) { 186 187 if (strcmp(s2.smbi_product, SMB_DEFAULT1) != 0 && 188 strcmp(s2.smbi_product, SMB_DEFAULT2) != 0) { 189 thp->th_product = topo_cleanup_auth_str(thp, 190 (char *)s2.smbi_product); 191 } 192 } 193 smbios_close(shp); 194 } else { 195 thp->th_product = topo_hdl_strdup(thp, thp->th_platform); 196 } 197 198 if (thp->th_rootdir == NULL || thp->th_platform == NULL || 199 thp->th_machine == NULL) 200 return (set_open_errno(thp, errp, ETOPO_NOMEM)); 201 202 dbflags = getenv("TOPO_DEBUG"); 203 dbout = getenv("TOPO_DEBUG_OUT"); 204 if (dbflags != NULL) 205 topo_debug_set(thp, dbflags, dbout); 206 207 if (topo_builtin_create(thp, thp->th_rootdir) != 0) { 208 topo_dprintf(thp, TOPO_DBG_ERR, 209 "failed to load builtin modules: %s\n", 210 topo_hdl_errmsg(thp)); 211 topo_close(thp); 212 return (NULL); 213 } 214 215 return (thp); 216 } 217 218 void 219 topo_close(topo_hdl_t *thp) 220 { 221 ttree_t *tp; 222 223 topo_hdl_lock(thp); 224 if (thp->th_platform != NULL) 225 topo_hdl_strfree(thp, thp->th_platform); 226 if (thp->th_isa != NULL) 227 topo_hdl_strfree(thp, thp->th_isa); 228 if (thp->th_machine != NULL) 229 topo_hdl_strfree(thp, thp->th_machine); 230 if (thp->th_product != NULL) 231 topo_hdl_strfree(thp, thp->th_product); 232 if (thp->th_rootdir != NULL) 233 topo_hdl_strfree(thp, thp->th_rootdir); 234 if (thp->th_ipmi != NULL) 235 ipmi_close(thp->th_ipmi); 236 237 /* 238 * Clean-up snapshot 239 */ 240 topo_snap_destroy(thp); 241 242 /* 243 * Clean-up trees 244 */ 245 while ((tp = topo_list_next(&thp->th_trees)) != NULL) { 246 topo_list_delete(&thp->th_trees, tp); 247 topo_tree_destroy(tp); 248 } 249 250 /* 251 * Unload all plugins 252 */ 253 topo_modhash_unload_all(thp); 254 255 if (thp->th_modhash != NULL) 256 topo_modhash_destroy(thp); 257 if (thp->th_alloc != NULL) 258 topo_free(thp->th_alloc, sizeof (topo_alloc_t)); 259 260 topo_hdl_unlock(thp); 261 262 topo_free(thp, sizeof (topo_hdl_t)); 263 } 264 265 static char * 266 topo_snap_create(topo_hdl_t *thp, int *errp) 267 { 268 uuid_t uuid; 269 char *ustr = NULL; 270 271 topo_hdl_lock(thp); 272 if (thp->th_uuid != NULL) { 273 *errp = ETOPO_HDL_UUID; 274 topo_hdl_unlock(thp); 275 return (NULL); 276 } 277 278 if ((thp->th_uuid = topo_hdl_zalloc(thp, TOPO_UUID_SIZE)) == NULL) { 279 *errp = ETOPO_NOMEM; 280 topo_dprintf(thp, TOPO_DBG_ERR, "unable to allocate uuid: %s\n", 281 topo_strerror(*errp)); 282 topo_hdl_unlock(thp); 283 return (NULL); 284 } 285 286 uuid_generate(uuid); 287 uuid_unparse(uuid, thp->th_uuid); 288 if ((ustr = topo_hdl_strdup(thp, thp->th_uuid)) == NULL) { 289 *errp = ETOPO_NOMEM; 290 topo_hdl_unlock(thp); 291 return (NULL); 292 } 293 294 thp->th_di = di_init("/", 295 DINFOFORCE | DINFOSUBTREE | DINFOMINOR | DINFOPROP | DINFOPATH); 296 thp->th_pi = di_prom_init(); 297 298 if (topo_tree_enum_all(thp) < 0) { 299 topo_dprintf(thp, TOPO_DBG_ERR, "enumeration failure: %s\n", 300 topo_hdl_errmsg(thp)); 301 if (topo_hdl_errno(thp) == ETOPO_ENUM_FATAL) { 302 *errp = thp->th_errno; 303 304 if (thp->th_di != DI_NODE_NIL) { 305 di_fini(thp->th_di); 306 thp->th_di = DI_NODE_NIL; 307 } 308 if (thp->th_pi != DI_PROM_HANDLE_NIL) { 309 di_prom_fini(thp->th_pi); 310 thp->th_pi = DI_PROM_HANDLE_NIL; 311 } 312 313 topo_hdl_strfree(thp, ustr); 314 topo_hdl_unlock(thp); 315 return (NULL); 316 } 317 } 318 319 if (thp->th_ipmi != NULL && 320 ipmi_sdr_changed(thp->th_ipmi) && 321 ipmi_sdr_refresh(thp->th_ipmi) != 0) { 322 topo_dprintf(thp, TOPO_DBG_ERR, 323 "failed to refresh IPMI sdr repository: %s\n", 324 ipmi_errmsg(thp->th_ipmi)); 325 } 326 327 topo_hdl_unlock(thp); 328 329 return (ustr); 330 } 331 332 /*ARGSUSED*/ 333 static char * 334 topo_snap_log_create(topo_hdl_t *thp, const char *uuid, int *errp) 335 { 336 return ((char *)uuid); 337 } 338 339 /*ARGSUSED*/ 340 static int 341 fac_walker(topo_hdl_t *thp, tnode_t *node, void *arg) 342 { 343 int err; 344 nvlist_t *out; 345 346 if (topo_method_supported(node, TOPO_METH_FAC_ENUM, 0)) { 347 /* 348 * If the facility enumeration method fails, note the failure, 349 * but continue on with the walk. 350 */ 351 if (topo_method_invoke(node, TOPO_METH_FAC_ENUM, 0, NULL, &out, 352 &err) != 0) { 353 topo_dprintf(thp, TOPO_DBG_ERR, 354 "facility enumeration method failed on node %s=%d " 355 "(%s)\n", topo_node_name(node), 356 topo_node_instance(node), topo_strerror(err)); 357 } 358 } 359 return (TOPO_WALK_NEXT); 360 } 361 362 /* 363 * Return snapshot id 364 */ 365 char * 366 topo_snap_hold(topo_hdl_t *thp, const char *uuid, int *errp) 367 { 368 topo_walk_t *twp; 369 370 if (thp == NULL) 371 return (NULL); 372 373 if (uuid == NULL) { 374 char *ret; 375 376 ret = topo_snap_create(thp, errp); 377 378 /* 379 * Now walk the tree and invoke any facility enumeration methods 380 */ 381 if (ret != NULL) { 382 if ((twp = topo_walk_init(thp, FM_FMRI_SCHEME_HC, 383 fac_walker, (void *)0, errp)) == NULL) { 384 return (ret); 385 } 386 (void) topo_walk_step(twp, TOPO_WALK_CHILD); 387 topo_walk_fini(twp); 388 } 389 return (ret); 390 } 391 return (topo_snap_log_create(thp, uuid, errp)); 392 } 393 394 /*ARGSUSED*/ 395 static int 396 topo_walk_destroy(topo_hdl_t *thp, tnode_t *node, void *notused) 397 { 398 tnode_t *cnode; 399 400 cnode = topo_child_first(node); 401 402 if (cnode != NULL) 403 return (TOPO_WALK_NEXT); 404 405 topo_node_unbind(node); 406 407 return (TOPO_WALK_NEXT); 408 } 409 410 static void 411 topo_snap_destroy(topo_hdl_t *thp) 412 { 413 int i; 414 ttree_t *tp; 415 topo_walk_t *twp; 416 tnode_t *root; 417 topo_nodehash_t *nhp; 418 topo_mod_t *mod; 419 420 for (tp = topo_list_next(&thp->th_trees); tp != NULL; 421 tp = topo_list_next(tp)) { 422 423 root = tp->tt_root; 424 twp = tp->tt_walk; 425 /* 426 * Clean-up tree nodes from the bottom-up 427 */ 428 if ((twp->tw_node = topo_child_first(root)) != NULL) { 429 twp->tw_cb = topo_walk_destroy; 430 topo_node_hold(root); 431 topo_node_hold(twp->tw_node); /* released at walk end */ 432 (void) topo_walk_bottomup(twp, TOPO_WALK_CHILD); 433 topo_node_rele(root); 434 } 435 436 /* 437 * Tidy-up the root node 438 */ 439 while ((nhp = topo_list_next(&root->tn_children)) != NULL) { 440 for (i = 0; i < nhp->th_arrlen; i++) { 441 assert(nhp->th_nodearr[i] == NULL); 442 } 443 mod = nhp->th_enum; 444 topo_mod_strfree(mod, nhp->th_name); 445 topo_mod_free(mod, nhp->th_nodearr, 446 nhp->th_arrlen * sizeof (tnode_t *)); 447 topo_list_delete(&root->tn_children, nhp); 448 topo_mod_free(mod, nhp, sizeof (topo_nodehash_t)); 449 topo_mod_rele(mod); 450 } 451 452 } 453 454 /* 455 * Clean-up our cached devinfo and prom tree handles. 456 */ 457 if (thp->th_di != DI_NODE_NIL) { 458 di_fini(thp->th_di); 459 thp->th_di = DI_NODE_NIL; 460 } 461 if (thp->th_pi != DI_PROM_HANDLE_NIL) { 462 di_prom_fini(thp->th_pi); 463 thp->th_pi = DI_PROM_HANDLE_NIL; 464 } 465 466 467 if (thp->th_uuid != NULL) { 468 topo_hdl_free(thp, thp->th_uuid, TOPO_UUID_SIZE); 469 thp->th_uuid = NULL; 470 } 471 } 472 473 void 474 topo_snap_release(topo_hdl_t *thp) 475 { 476 if (thp == NULL) 477 return; 478 479 topo_hdl_lock(thp); 480 topo_snap_destroy(thp); 481 topo_hdl_unlock(thp); 482 } 483 484 topo_walk_t * 485 topo_walk_init(topo_hdl_t *thp, const char *scheme, topo_walk_cb_t cb_f, 486 void *pdata, int *errp) 487 { 488 ttree_t *tp; 489 topo_walk_t *wp; 490 491 for (tp = topo_list_next(&thp->th_trees); tp != NULL; 492 tp = topo_list_next(tp)) { 493 if (strcmp(scheme, tp->tt_scheme) == 0) { 494 495 /* 496 * Hold the root node and start walk at the first 497 * child node 498 */ 499 assert(tp->tt_root != NULL); 500 501 if ((wp = topo_node_walk_init(thp, NULL, tp->tt_root, 502 cb_f, pdata, errp)) == NULL) /* errp set */ 503 return (NULL); 504 505 return (wp); 506 } 507 } 508 509 *errp = ETOPO_WALK_NOTFOUND; 510 return (NULL); 511 } 512 513 static int 514 step_child(tnode_t *cnp, topo_walk_t *wp, int flag, int bottomup) 515 { 516 int status; 517 tnode_t *nnp; 518 519 nnp = topo_child_first(cnp); 520 521 if (nnp == NULL) { 522 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 523 "step_child: TOPO_WALK_TERMINATE for %s=%d\n", 524 cnp->tn_name, cnp->tn_instance); 525 return (TOPO_WALK_TERMINATE); 526 } 527 528 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 529 "step_child: walk through node %s=%d to %s=%d\n", 530 cnp->tn_name, cnp->tn_instance, nnp->tn_name, nnp->tn_instance); 531 532 topo_node_hold(nnp); /* released on return from walk_step */ 533 wp->tw_node = nnp; 534 if (bottomup == 1) 535 status = topo_walk_bottomup(wp, flag); 536 else 537 status = topo_walk_step(wp, flag); 538 539 return (status); 540 } 541 542 static int 543 step_sibling(tnode_t *cnp, topo_walk_t *wp, int flag, int bottomup) 544 { 545 int status; 546 tnode_t *nnp; 547 548 nnp = topo_child_next(cnp->tn_parent, cnp); 549 550 if (nnp == NULL) { 551 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 552 "step_sibling: TOPO_WALK_TERMINATE for %s=%d\n", 553 cnp->tn_name, cnp->tn_instance); 554 return (TOPO_WALK_TERMINATE); 555 } 556 557 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 558 "step_sibling: through sibling node %s=%d to %s=%d\n", 559 cnp->tn_name, cnp->tn_instance, nnp->tn_name, nnp->tn_instance); 560 561 topo_node_hold(nnp); /* released on return from walk_step */ 562 wp->tw_node = nnp; 563 if (bottomup == 1) 564 status = topo_walk_bottomup(wp, flag); 565 else 566 status = topo_walk_step(wp, flag); 567 568 return (status); 569 } 570 571 int 572 topo_walk_byid(topo_walk_t *wp, const char *name, topo_instance_t inst) 573 { 574 int status; 575 tnode_t *nnp, *cnp; 576 577 cnp = wp->tw_node; 578 nnp = topo_node_lookup(cnp, name, inst); 579 if (nnp == NULL) 580 return (TOPO_WALK_TERMINATE); 581 582 topo_node_hold(nnp); 583 wp->tw_node = nnp; 584 if (wp->tw_mod != NULL) 585 status = wp->tw_cb(wp->tw_mod, nnp, wp->tw_pdata); 586 else 587 status = wp->tw_cb(wp->tw_thp, nnp, wp->tw_pdata); 588 topo_node_rele(nnp); 589 wp->tw_node = cnp; 590 591 return (status); 592 } 593 594 int 595 topo_walk_bysibling(topo_walk_t *wp, const char *name, topo_instance_t inst) 596 { 597 int status; 598 tnode_t *cnp, *pnp; 599 600 cnp = wp->tw_node; 601 pnp = topo_node_parent(cnp); 602 assert(pnp != NULL); 603 604 topo_node_hold(pnp); 605 wp->tw_node = pnp; 606 status = topo_walk_byid(wp, name, inst); 607 topo_node_rele(pnp); 608 wp->tw_node = cnp; 609 610 return (status); 611 } 612 613 int 614 topo_walk_step(topo_walk_t *wp, int flag) 615 { 616 int status; 617 tnode_t *cnp = wp->tw_node; 618 619 if (flag != TOPO_WALK_CHILD && flag != TOPO_WALK_SIBLING) { 620 topo_node_rele(cnp); 621 return (TOPO_WALK_ERR); 622 } 623 624 /* 625 * No more nodes to walk 626 */ 627 if (cnp == NULL) { 628 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 629 "walk_step terminated\n"); 630 topo_node_rele(cnp); 631 return (TOPO_WALK_TERMINATE); 632 } 633 634 635 if (wp->tw_mod != NULL) 636 status = wp->tw_cb(wp->tw_mod, cnp, wp->tw_pdata); 637 else 638 status = wp->tw_cb(wp->tw_thp, cnp, wp->tw_pdata); 639 640 /* 641 * Walker callback says we're done 642 */ 643 if (status != TOPO_WALK_NEXT) { 644 topo_node_rele(cnp); 645 return (status); 646 } 647 648 if (flag == TOPO_WALK_CHILD) 649 status = step_child(cnp, wp, flag, 0); 650 else 651 status = step_sibling(cnp, wp, flag, 0); 652 653 /* 654 * No more nodes in this hash, skip to next node hash by stepping 655 * to next sibling (child-first walk) or next child (sibling-first 656 * walk). 657 */ 658 if (status == TOPO_WALK_TERMINATE) { 659 if (flag == TOPO_WALK_CHILD) 660 status = step_sibling(cnp, wp, flag, 0); 661 else 662 status = step_child(cnp, wp, flag, 0); 663 } 664 665 topo_node_rele(cnp); /* done with current node */ 666 667 return (status); 668 } 669 670 void 671 topo_walk_fini(topo_walk_t *wp) 672 { 673 if (wp == NULL) 674 return; 675 676 topo_node_rele(wp->tw_root); 677 678 topo_hdl_free(wp->tw_thp, wp, sizeof (topo_walk_t)); 679 } 680 681 int 682 topo_walk_bottomup(topo_walk_t *wp, int flag) 683 { 684 int status; 685 tnode_t *cnp; 686 687 if (wp == NULL) 688 return (TOPO_WALK_ERR); 689 690 cnp = wp->tw_node; 691 if (flag != TOPO_WALK_CHILD && flag != TOPO_WALK_SIBLING) { 692 topo_node_rele(cnp); 693 return (TOPO_WALK_ERR); 694 } 695 696 /* 697 * End of the line 698 */ 699 if (cnp == NULL) { 700 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 701 "walk_bottomup terminated\n"); 702 topo_node_rele(cnp); 703 return (TOPO_WALK_TERMINATE); 704 } 705 706 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 707 "%s walk_bottomup through node %s=%d\n", 708 (flag == TOPO_WALK_CHILD ? "TOPO_WALK_CHILD" : "TOPO_WALK_SIBLING"), 709 cnp->tn_name, cnp->tn_instance); 710 711 if (flag == TOPO_WALK_CHILD) 712 status = step_child(cnp, wp, flag, 1); 713 else 714 status = step_sibling(cnp, wp, flag, 1); 715 716 /* 717 * At a leaf, run the callback 718 */ 719 if (status == TOPO_WALK_TERMINATE) { 720 if ((status = wp->tw_cb(wp->tw_thp, cnp, wp->tw_pdata)) 721 != TOPO_WALK_NEXT) { 722 topo_node_rele(cnp); 723 return (status); 724 } 725 } 726 727 /* 728 * Try next child or sibling 729 */ 730 if (status == TOPO_WALK_NEXT) { 731 if (flag == TOPO_WALK_CHILD) 732 status = step_sibling(cnp, wp, flag, 1); 733 else 734 status = step_child(cnp, wp, flag, 1); 735 } 736 737 topo_node_rele(cnp); /* done with current node */ 738 739 return (status); 740 } 741 742 di_node_t 743 topo_hdl_devinfo(topo_hdl_t *thp) 744 { 745 return (thp == NULL ? DI_NODE_NIL : thp->th_di); 746 } 747 748 di_prom_handle_t 749 topo_hdl_prominfo(topo_hdl_t *thp) 750 { 751 return (thp == NULL ? DI_PROM_HANDLE_NIL : thp->th_pi); 752 } 753