Lines Matching defs:lgrp
30 #include <sys/lgrp.h>
119 lgrp_rsets_delete(lgrp_t *lgrp, lgrp_id_t lgrpid, int follow_parent)
123 while (lgrp != NULL) {
125 klgrpset_del(lgrp->lgrp_set[i], lgrpid);
128 lgrp = lgrp->lgrp_parent;
203 lgrp_rsets_replace(klgrpset_t *rset, int latency, lgrp_t *lgrp, int shift)
211 cur = lgrp;
306 " lgrp %d at 0x%p\n",
386 "lgrp %d to lgrp %d\n",
416 prom_printf("lgrp_consolidate: destroy lgrp %d at 0x%p\n",
477 "dups of lgrp %d at 0x%p\n",
482 lgrp_t *lgrp;
484 lgrp = lgrp_table[j];
491 if (!LGRP_EXISTS(lgrp) ||
492 lgrp->lgrp_childcnt == 0 ||
493 !lgrp_rsets_equal(lgrp->lgrp_set,
495 (lgrp->lgrp_latency != target->lgrp_latency &&
504 keep = lgrp;
508 "keep lgrp %d at 0x%p\n",
512 if (lgrp == lgrp_root) {
513 lgrp = keep;
519 " consolidate lgrp %d at 0x%p"
520 " into lgrp %d at 0x%p\n",
521 lgrp->lgrp_id, (void *)lgrp,
524 count += lgrp_consolidate(lgrp, keep,
718 lgrp_t *lgrp;
721 lgrp = lgrp_table[i];
727 if (!LGRP_EXISTS(lgrp) || lgrp == oldleaf ||
728 !klgrpset_ismember(parent->lgrp_leaves, lgrp->lgrp_id))
734 sibling_latency = lgrp_plat_latency(lgrp->lgrp_plathand,
741 lgrp->lgrp_id, newleaf->lgrp_id, sibling_latency);
779 " lgrp %d (0x%p)\n",
807 lgrp_topo_height(lgrp_t *lgrp)
811 if (!LGRP_EXISTS(lgrp))
815 while (lgrp != NULL) {
816 lgrp = lgrp->lgrp_parent;
1012 "replaced parent lgrp %d at 0x%p"
1013 " for lgrp %d\n",
1055 "parent lgrp %d at 0x%p for "
1056 "lgrp %d\n", intermed->lgrp_id,
1159 lgrp_rsets_print("lgrp_leaf_add: root lgrp resources",
1196 lgrp_t *lgrp;
1198 lgrp = lgrps[i];
1204 if (!LGRP_EXISTS(lgrp) || lgrp == leaf ||
1205 lgrp->lgrp_childcnt != 0) {
1209 "lgrp %d at 0x%p\n",
1210 lgrp->lgrp_id, (void *)lgrp);
1217 prom_printf("lgrp_leaf_add: lgrp %d (0x%p) =>"
1218 " lgrp %d (0x%p)\n",
1219 leaf->lgrp_id, (void *)leaf, lgrp->lgrp_id,
1220 (void *)lgrp);
1223 count += lgrp_lineage_add(leaf, lgrp, &changes);
1227 count += lgrp_lineage_add(lgrp, leaf, &changes);
1253 lgrp_t *lgrp;
1280 lgrp = lgrps[i];
1281 if (lgrp == NULL || lgrp->lgrp_id == LGRP_NONE ||
1282 !lgrp_rsets_member(lgrp->lgrp_set, leaf->lgrp_id))
1288 " lgrp %d at %p\n", lgrp->lgrp_id, (void *)lgrp);
1291 lgrp_rsets_delete(lgrp, leaf->lgrp_id, 0);
1292 klgrpset_del(lgrp->lgrp_leaves, leaf->lgrp_id);
1294 klgrpset_add(collapse, lgrp->lgrp_id);
1345 lgrp_t *lgrp;
1362 lgrp = lgrps[i];
1363 if (!LGRP_EXISTS(lgrp))
1366 hdl = lgrp->lgrp_plathand;
1368 if (lgrp == lgrp_root) {
1369 lgrp->lgrp_latency = lgrp_plat_latency(hdl, hdl);
1373 if (lgrp->lgrp_childcnt > 0) {
1379 parent = lgrp->lgrp_parent;
1381 klgrpset_add(*changed, lgrp->lgrp_id);
1387 lgrp->lgrp_id);
1390 lgrp_destroy(lgrp);
1391 } else if (lgrp->lgrp_parent != lgrp_root) {
1397 klgrpset_add(*changed, lgrp->lgrp_id);
1400 lgrp->lgrp_parent = lgrp_root;
1401 klgrpset_add(lgrp_root->lgrp_children, lgrp->lgrp_id);
1403 klgrpset_add(lgrp_root->lgrp_leaves, lgrp->lgrp_id);
1405 lgrp->lgrp_latency = lgrp_plat_latency(hdl, hdl);
1464 lgrp_t *lgrp;
1472 * resources. The root lgrp should also name itself as its own leaf
1492 lgrp = lgrps[i];
1498 if (lgrp == NULL || lgrp->lgrp_id == LGRP_NONE ||
1499 lgrp->lgrp_childcnt != 0 || lgrp->lgrp_latency != 0)
1505 "of lgrp %d at 0x%p\n", lgrp->lgrp_id,
1506 (void *)lgrp);
1510 count += lgrp_leaf_add(lgrp, lgrps, lgrp_count, &changes);
1538 lgrp_print(lgrp_t *lgrp)
1542 prom_printf("LGRP %d", lgrp->lgrp_id);
1543 if (lgrp->lgrp_childcnt == 0)
1545 (void *)lgrp->lgrp_plathand);
1549 prom_printf("\tlatency %d\n", lgrp->lgrp_latency);
1551 lgrp_rsets_print("\tresources", lgrp->lgrp_set);
1553 parent = lgrp->lgrp_parent;
1560 prom_printf("\tchild count %d, children ", lgrp->lgrp_childcnt);
1561 klgrpset_print(lgrp->lgrp_children);
1564 klgrpset_print(lgrp->lgrp_leaves);
1581 lgrp_t *lgrp;
1583 lgrp = lgrps[i];
1584 if (lgrp == NULL || !klgrpset_ismember(siblings, i))
1586 lgrp_print(lgrp);
1587 klgrpset_or(children, lgrp->lgrp_children);