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("/", DI_CACHE_SNAPSHOT_FLAGS | DINFOCLEANUP); 295 thp->th_pi = di_prom_init(); 296 297 if (topo_tree_enum_all(thp) < 0) { 298 topo_dprintf(thp, TOPO_DBG_ERR, "enumeration failure: %s\n", 299 topo_hdl_errmsg(thp)); 300 if (topo_hdl_errno(thp) == ETOPO_ENUM_FATAL) { 301 *errp = thp->th_errno; 302 303 if (thp->th_di != DI_NODE_NIL) { 304 di_fini(thp->th_di); 305 thp->th_di = DI_NODE_NIL; 306 } 307 if (thp->th_pi != DI_PROM_HANDLE_NIL) { 308 di_prom_fini(thp->th_pi); 309 thp->th_pi = DI_PROM_HANDLE_NIL; 310 } 311 312 topo_hdl_strfree(thp, ustr); 313 topo_hdl_unlock(thp); 314 return (NULL); 315 } 316 } 317 318 if (thp->th_ipmi != NULL && 319 ipmi_sdr_changed(thp->th_ipmi) && 320 ipmi_sdr_refresh(thp->th_ipmi) != 0) { 321 topo_dprintf(thp, TOPO_DBG_ERR, 322 "failed to refresh IPMI sdr repository: %s\n", 323 ipmi_errmsg(thp->th_ipmi)); 324 } 325 326 topo_hdl_unlock(thp); 327 328 return (ustr); 329 } 330 331 /*ARGSUSED*/ 332 static char * 333 topo_snap_log_create(topo_hdl_t *thp, const char *uuid, int *errp) 334 { 335 return ((char *)uuid); 336 } 337 338 /*ARGSUSED*/ 339 static int 340 fac_walker(topo_hdl_t *thp, tnode_t *node, void *arg) 341 { 342 int err; 343 nvlist_t *out; 344 345 if (topo_method_supported(node, TOPO_METH_FAC_ENUM, 0)) { 346 /* 347 * If the facility enumeration method fails, note the failure, 348 * but continue on with the walk. 349 */ 350 if (topo_method_invoke(node, TOPO_METH_FAC_ENUM, 0, NULL, &out, 351 &err) != 0) { 352 topo_dprintf(thp, TOPO_DBG_ERR, 353 "facility enumeration method failed on node %s=%d " 354 "(%s)\n", topo_node_name(node), 355 topo_node_instance(node), topo_strerror(err)); 356 } 357 } 358 return (TOPO_WALK_NEXT); 359 } 360 361 /* 362 * Return snapshot id 363 */ 364 char * 365 topo_snap_hold(topo_hdl_t *thp, const char *uuid, int *errp) 366 { 367 topo_walk_t *twp; 368 369 if (thp == NULL) 370 return (NULL); 371 372 if (uuid == NULL) { 373 char *ret; 374 375 ret = topo_snap_create(thp, errp); 376 377 /* 378 * Now walk the tree and invoke any facility enumeration methods 379 */ 380 if (ret != NULL) { 381 if ((twp = topo_walk_init(thp, FM_FMRI_SCHEME_HC, 382 fac_walker, (void *)0, errp)) == NULL) { 383 return (ret); 384 } 385 (void) topo_walk_step(twp, TOPO_WALK_CHILD); 386 topo_walk_fini(twp); 387 } 388 return (ret); 389 } 390 return (topo_snap_log_create(thp, uuid, errp)); 391 } 392 393 /*ARGSUSED*/ 394 static int 395 topo_walk_destroy(topo_hdl_t *thp, tnode_t *node, void *notused) 396 { 397 tnode_t *cnode; 398 399 cnode = topo_child_first(node); 400 401 if (cnode != NULL) 402 return (TOPO_WALK_NEXT); 403 404 topo_node_unbind(node); 405 406 return (TOPO_WALK_NEXT); 407 } 408 409 static void 410 topo_snap_destroy(topo_hdl_t *thp) 411 { 412 int i; 413 ttree_t *tp; 414 topo_walk_t *twp; 415 tnode_t *root; 416 topo_nodehash_t *nhp; 417 topo_mod_t *mod; 418 419 for (tp = topo_list_next(&thp->th_trees); tp != NULL; 420 tp = topo_list_next(tp)) { 421 422 root = tp->tt_root; 423 twp = tp->tt_walk; 424 /* 425 * Clean-up tree nodes from the bottom-up 426 */ 427 if ((twp->tw_node = topo_child_first(root)) != NULL) { 428 twp->tw_cb = topo_walk_destroy; 429 topo_node_hold(root); 430 topo_node_hold(twp->tw_node); /* released at walk end */ 431 (void) topo_walk_bottomup(twp, TOPO_WALK_CHILD); 432 topo_node_rele(root); 433 } 434 435 /* 436 * Tidy-up the root node 437 */ 438 while ((nhp = topo_list_next(&root->tn_children)) != NULL) { 439 for (i = 0; i < nhp->th_arrlen; i++) { 440 assert(nhp->th_nodearr[i] == NULL); 441 } 442 mod = nhp->th_enum; 443 topo_mod_strfree(mod, nhp->th_name); 444 topo_mod_free(mod, nhp->th_nodearr, 445 nhp->th_arrlen * sizeof (tnode_t *)); 446 topo_list_delete(&root->tn_children, nhp); 447 topo_mod_free(mod, nhp, sizeof (topo_nodehash_t)); 448 topo_mod_rele(mod); 449 } 450 451 } 452 453 /* 454 * Clean-up our cached devinfo and prom tree handles. 455 */ 456 if (thp->th_di != DI_NODE_NIL) { 457 di_fini(thp->th_di); 458 thp->th_di = DI_NODE_NIL; 459 } 460 if (thp->th_pi != DI_PROM_HANDLE_NIL) { 461 di_prom_fini(thp->th_pi); 462 thp->th_pi = DI_PROM_HANDLE_NIL; 463 } 464 465 466 if (thp->th_uuid != NULL) { 467 topo_hdl_free(thp, thp->th_uuid, TOPO_UUID_SIZE); 468 thp->th_uuid = NULL; 469 } 470 } 471 472 void 473 topo_snap_release(topo_hdl_t *thp) 474 { 475 if (thp == NULL) 476 return; 477 478 topo_hdl_lock(thp); 479 topo_snap_destroy(thp); 480 topo_hdl_unlock(thp); 481 } 482 483 topo_walk_t * 484 topo_walk_init(topo_hdl_t *thp, const char *scheme, topo_walk_cb_t cb_f, 485 void *pdata, int *errp) 486 { 487 ttree_t *tp; 488 topo_walk_t *wp; 489 490 for (tp = topo_list_next(&thp->th_trees); tp != NULL; 491 tp = topo_list_next(tp)) { 492 if (strcmp(scheme, tp->tt_scheme) == 0) { 493 494 /* 495 * Hold the root node and start walk at the first 496 * child node 497 */ 498 assert(tp->tt_root != NULL); 499 500 if ((wp = topo_node_walk_init(thp, NULL, tp->tt_root, 501 cb_f, pdata, errp)) == NULL) /* errp set */ 502 return (NULL); 503 504 return (wp); 505 } 506 } 507 508 *errp = ETOPO_WALK_NOTFOUND; 509 return (NULL); 510 } 511 512 static int 513 step_child(tnode_t *cnp, topo_walk_t *wp, int flag, int bottomup) 514 { 515 int status; 516 tnode_t *nnp; 517 518 nnp = topo_child_first(cnp); 519 520 if (nnp == NULL) { 521 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 522 "step_child: TOPO_WALK_TERMINATE for %s=%d\n", 523 cnp->tn_name, cnp->tn_instance); 524 return (TOPO_WALK_TERMINATE); 525 } 526 527 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 528 "step_child: walk through node %s=%d to %s=%d\n", 529 cnp->tn_name, cnp->tn_instance, nnp->tn_name, nnp->tn_instance); 530 531 topo_node_hold(nnp); /* released on return from walk_step */ 532 wp->tw_node = nnp; 533 if (bottomup == 1) 534 status = topo_walk_bottomup(wp, flag); 535 else 536 status = topo_walk_step(wp, flag); 537 538 return (status); 539 } 540 541 static int 542 step_sibling(tnode_t *cnp, topo_walk_t *wp, int flag, int bottomup) 543 { 544 int status; 545 tnode_t *nnp; 546 547 nnp = topo_child_next(cnp->tn_parent, cnp); 548 549 if (nnp == NULL) { 550 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 551 "step_sibling: TOPO_WALK_TERMINATE for %s=%d\n", 552 cnp->tn_name, cnp->tn_instance); 553 return (TOPO_WALK_TERMINATE); 554 } 555 556 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 557 "step_sibling: through sibling node %s=%d to %s=%d\n", 558 cnp->tn_name, cnp->tn_instance, nnp->tn_name, nnp->tn_instance); 559 560 topo_node_hold(nnp); /* released on return from walk_step */ 561 wp->tw_node = nnp; 562 if (bottomup == 1) 563 status = topo_walk_bottomup(wp, flag); 564 else 565 status = topo_walk_step(wp, flag); 566 567 return (status); 568 } 569 570 int 571 topo_walk_byid(topo_walk_t *wp, const char *name, topo_instance_t inst) 572 { 573 int status; 574 tnode_t *nnp, *cnp; 575 576 cnp = wp->tw_node; 577 nnp = topo_node_lookup(cnp, name, inst); 578 if (nnp == NULL) 579 return (TOPO_WALK_TERMINATE); 580 581 topo_node_hold(nnp); 582 wp->tw_node = nnp; 583 if (wp->tw_mod != NULL) 584 status = wp->tw_cb(wp->tw_mod, nnp, wp->tw_pdata); 585 else 586 status = wp->tw_cb(wp->tw_thp, nnp, wp->tw_pdata); 587 topo_node_rele(nnp); 588 wp->tw_node = cnp; 589 590 return (status); 591 } 592 593 int 594 topo_walk_bysibling(topo_walk_t *wp, const char *name, topo_instance_t inst) 595 { 596 int status; 597 tnode_t *cnp, *pnp; 598 599 cnp = wp->tw_node; 600 pnp = topo_node_parent(cnp); 601 assert(pnp != NULL); 602 603 topo_node_hold(pnp); 604 wp->tw_node = pnp; 605 status = topo_walk_byid(wp, name, inst); 606 topo_node_rele(pnp); 607 wp->tw_node = cnp; 608 609 return (status); 610 } 611 612 int 613 topo_walk_step(topo_walk_t *wp, int flag) 614 { 615 int status; 616 tnode_t *cnp = wp->tw_node; 617 618 if (flag != TOPO_WALK_CHILD && flag != TOPO_WALK_SIBLING) { 619 topo_node_rele(cnp); 620 return (TOPO_WALK_ERR); 621 } 622 623 /* 624 * No more nodes to walk 625 */ 626 if (cnp == NULL) { 627 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 628 "walk_step terminated\n"); 629 topo_node_rele(cnp); 630 return (TOPO_WALK_TERMINATE); 631 } 632 633 634 if (wp->tw_mod != NULL) 635 status = wp->tw_cb(wp->tw_mod, cnp, wp->tw_pdata); 636 else 637 status = wp->tw_cb(wp->tw_thp, cnp, wp->tw_pdata); 638 639 /* 640 * Walker callback says we're done 641 */ 642 if (status != TOPO_WALK_NEXT) { 643 topo_node_rele(cnp); 644 return (status); 645 } 646 647 if (flag == TOPO_WALK_CHILD) 648 status = step_child(cnp, wp, flag, 0); 649 else 650 status = step_sibling(cnp, wp, flag, 0); 651 652 /* 653 * No more nodes in this hash, skip to next node hash by stepping 654 * to next sibling (child-first walk) or next child (sibling-first 655 * walk). 656 */ 657 if (status == TOPO_WALK_TERMINATE) { 658 if (flag == TOPO_WALK_CHILD) 659 status = step_sibling(cnp, wp, flag, 0); 660 else 661 status = step_child(cnp, wp, flag, 0); 662 } 663 664 topo_node_rele(cnp); /* done with current node */ 665 666 return (status); 667 } 668 669 void 670 topo_walk_fini(topo_walk_t *wp) 671 { 672 if (wp == NULL) 673 return; 674 675 topo_node_rele(wp->tw_root); 676 677 topo_hdl_free(wp->tw_thp, wp, sizeof (topo_walk_t)); 678 } 679 680 int 681 topo_walk_bottomup(topo_walk_t *wp, int flag) 682 { 683 int status; 684 tnode_t *cnp; 685 686 if (wp == NULL) 687 return (TOPO_WALK_ERR); 688 689 cnp = wp->tw_node; 690 if (flag != TOPO_WALK_CHILD && flag != TOPO_WALK_SIBLING) { 691 topo_node_rele(cnp); 692 return (TOPO_WALK_ERR); 693 } 694 695 /* 696 * End of the line 697 */ 698 if (cnp == NULL) { 699 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 700 "walk_bottomup terminated\n"); 701 topo_node_rele(cnp); 702 return (TOPO_WALK_TERMINATE); 703 } 704 705 topo_dprintf(wp->tw_thp, TOPO_DBG_WALK, 706 "%s walk_bottomup through node %s=%d\n", 707 (flag == TOPO_WALK_CHILD ? "TOPO_WALK_CHILD" : "TOPO_WALK_SIBLING"), 708 cnp->tn_name, cnp->tn_instance); 709 710 if (flag == TOPO_WALK_CHILD) 711 status = step_child(cnp, wp, flag, 1); 712 else 713 status = step_sibling(cnp, wp, flag, 1); 714 715 /* 716 * At a leaf, run the callback 717 */ 718 if (status == TOPO_WALK_TERMINATE) { 719 if ((status = wp->tw_cb(wp->tw_thp, cnp, wp->tw_pdata)) 720 != TOPO_WALK_NEXT) { 721 topo_node_rele(cnp); 722 return (status); 723 } 724 } 725 726 /* 727 * Try next child or sibling 728 */ 729 if (status == TOPO_WALK_NEXT) { 730 if (flag == TOPO_WALK_CHILD) 731 status = step_sibling(cnp, wp, flag, 1); 732 else 733 status = step_child(cnp, wp, flag, 1); 734 } 735 736 topo_node_rele(cnp); /* done with current node */ 737 738 return (status); 739 } 740 741 di_node_t 742 topo_hdl_devinfo(topo_hdl_t *thp) 743 { 744 return (thp == NULL ? DI_NODE_NIL : thp->th_di); 745 } 746 747 di_prom_handle_t 748 topo_hdl_prominfo(topo_hdl_t *thp) 749 { 750 return (thp == NULL ? DI_PROM_HANDLE_NIL : thp->th_pi); 751 } 752