Lines Matching defs:latency

40  * Only collapse lgroups which have same latency (and resources)
199  * latency and shift its old resources to its parent and its parent's resources
203 lgrp_rsets_replace(klgrpset_t *rset, int latency, lgrp_t *lgrp, int shift)
212 	lat_saved = latency;
216 		 * Save current resources and latency to insert in parent and
217 		 * then replace with new resources and latency
353 	 * Lgroup represents resources within certain latency, so need to keep
354 	 * biggest latency value of lgroups being consolidated
472 		 * Find all lgroups with same resources and latency
543  * Create new parent lgroup with given latency and resources for
547 lgrp_new_parent(lgrp_t *child, int latency, klgrpset_t *rset,
559 	 * Create lgroup and set its latency and resources
562 	new->lgrp_latency = latency;
604 lgrp_proprogate(lgrp_t *newleaf, lgrp_t *child, int latency,
645 		    "latency %d, child %d(0x%p), parent %d(0x%p)\n",
646 		    newleaf->lgrp_id, (void *)newleaf, latency, child->lgrp_id,
669  * different latency to new leaf lgroup (newleaf) than leaf lgroups of given
679 	int		latency;
706 	 * Get latency between new leaf and old leaf whose lineage it is
709 	latency = lgrp_plat_latency(oldleaf->lgrp_plathand,
714 	 * latency to new leaf
732 		 * Same latency, so skip
738 			prom_printf("lgrp_split: latency(%d,%d) %d,"
739 			    " latency(%d,%d) %d\n",
740 			    oldleaf->lgrp_id, newleaf->lgrp_id, latency,
743 		if (sibling_latency == latency)
748 		 * make new parent for old leaf with same latency and same
840 	int		latency;
863 	 * Get latency between old and new leaves, so we can determine
866 	latency = lgrp_plat_latency(oldleaf->lgrp_plathand,
877 		prom_printf("lgrp_lineage_add: latency(%d,%d) 0x%x, ht %d\n",
878 		    oldleaf->lgrp_id, newleaf->lgrp_id, latency, nlevels);
883 	 * determined latency between them yet
885 	if (latency == 0)
915 		 * than one leaf, but all its leaves don't have latency to new
916 		 * leaf within the parent lgroup's latency
941 			total += lgrp_proprogate(newleaf, child, latency,
955 			prom_printf("lgrp_lineage_add: latency 0x%x,"
956 			    " parent latency 0x%x\n",
957 			    latency, parent->lgrp_latency);
964 		if (latency < parent->lgrp_latency) {
974 				    "latency < parent latency\n");
1005 					    latency, &changes);
1028 				lgrp_rsets_replace(rset, latency, parent, 1);
1039 					    (void *)child, latency);
1044 				total += lgrp_new_parent(child, latency, rset,
1065 		} else if (latency == parent->lgrp_latency) {
1071 				prom_printf("lgrp_lineage_add: latency == "
1072 				    "parent latency\n");
1082 			total += lgrp_proprogate(newleaf, child, latency,
1130 	int		latency;
1172 	 * latency for it is available
1174 	latency = lgrp_plat_latency(leaf->lgrp_plathand, leaf->lgrp_plathand);
1175 	if (latency == 0) {
1189 	leaf->lgrp_latency = latency;
1449  * Update lgroup topology for any leaves that don't have their latency set
1486 	 * Look for any leaf lgroup without its latency set, finish adding it
1496 		 * with its latency set already