1233 require_all_satisfied(graph_vertex_t *groupv, boolean_t satbility)  in require_all_satisfied()  argument
1239 	if (uu_list_numnodes(groupv->gv_dependencies) == 0)  in require_all_satisfied()
1244 	for (edge = uu_list_first(groupv->gv_dependencies);  in require_all_satisfied()
1246 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in require_all_satisfied()
1252 		    "require_all(%s): %s is unsatisfi%s.\n", groupv->gv_name,  in require_all_satisfied()
1272 require_any_satisfied(graph_vertex_t *groupv, boolean_t satbility)  in require_any_satisfied()  argument
1278 	if (uu_list_numnodes(groupv->gv_dependencies) == 0)  in require_any_satisfied()
1283 	for (edge = uu_list_first(groupv->gv_dependencies);  in require_any_satisfied()
1285 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in require_any_satisfied()
1293 		    groupv->gv_name, edge->ge_vertex->gv_name,  in require_any_satisfied()
1313 optional_all_satisfied(graph_vertex_t *groupv, boolean_t satbility)  in optional_all_satisfied()  argument
1324 	for (edge = uu_list_first(groupv->gv_dependencies);  in optional_all_satisfied()
1326 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in optional_all_satisfied()
1448 		    "optional_all(%s): %s is unsatisfi%s.\n", groupv->gv_name,  in optional_all_satisfied()
1477 exclude_all_satisfied(graph_vertex_t *groupv, boolean_t satbility)  in exclude_all_satisfied()  argument
1482 	for (edge = uu_list_first(groupv->gv_dependencies);  in exclude_all_satisfied()
1484 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in exclude_all_satisfied()
1495 				LOG_EXCLUDE(groupv, v);  in exclude_all_satisfied()
1500 				LOG_EXCLUDE(groupv, v);  in exclude_all_satisfied()
1522 			LOG_EXCLUDE(groupv, v);  in exclude_all_satisfied()
1550 				LOG_EXCLUDE(groupv, v2);  in exclude_all_satisfied()
1555 				LOG_EXCLUDE(groupv, v2);  in exclude_all_satisfied()