1241 require_all_satisfied(graph_vertex_t *groupv, boolean_t satbility)  in require_all_satisfied()  argument
1247 	if (uu_list_numnodes(groupv->gv_dependencies) == 0)  in require_all_satisfied()
1252 	for (edge = uu_list_first(groupv->gv_dependencies);  in require_all_satisfied()
1254 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in require_all_satisfied()
1260 		    "require_all(%s): %s is unsatisfi%s.\n", groupv->gv_name,  in require_all_satisfied()
1280 require_any_satisfied(graph_vertex_t *groupv, boolean_t satbility)  in require_any_satisfied()  argument
1286 	if (uu_list_numnodes(groupv->gv_dependencies) == 0)  in require_any_satisfied()
1291 	for (edge = uu_list_first(groupv->gv_dependencies);  in require_any_satisfied()
1293 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in require_any_satisfied()
1301 		    groupv->gv_name, edge->ge_vertex->gv_name,  in require_any_satisfied()
1321 optional_all_satisfied(graph_vertex_t *groupv, boolean_t satbility)  in optional_all_satisfied()  argument
1332 	for (edge = uu_list_first(groupv->gv_dependencies);  in optional_all_satisfied()
1334 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in optional_all_satisfied()
1387 		    "optional_all(%s): %s is unsatisfi%s.\n", groupv->gv_name,  in optional_all_satisfied()
1416 exclude_all_satisfied(graph_vertex_t *groupv, boolean_t satbility)  in exclude_all_satisfied()  argument
1421 	for (edge = uu_list_first(groupv->gv_dependencies);  in exclude_all_satisfied()
1423 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in exclude_all_satisfied()
1434 				LOG_EXCLUDE(groupv, v);  in exclude_all_satisfied()
1439 				LOG_EXCLUDE(groupv, v);  in exclude_all_satisfied()
1461 			LOG_EXCLUDE(groupv, v);  in exclude_all_satisfied()
1489 				LOG_EXCLUDE(groupv, v2);  in exclude_all_satisfied()
1494 				LOG_EXCLUDE(groupv, v2);  in exclude_all_satisfied()