svc/svccfg/svccfg_tmpl.c

226 #define	CPG2PG(cpg)	(cpg->cpg_instance_pg ? cpg->cpg_instance_pg : \
227 			    cpg->cpg_service_pg)
576 	composed_pg_t *cpg;
578 	cpg = safe_malloc(sizeof (*cpg));
579 	uu_avl_node_init(cpg, &cpg->cpg_node, composed_pg_pool);
580 	return (cpg);
584 composed_pg_destroy(composed_pg_t *cpg)
589 	if (cpg == NULL)
592 	if ((cpg->cpg_composed_props != NULL)) {
593 		while (uu_avl_teardown(cpg->cpg_composed_props, &marker) !=
601 		uu_avl_destroy(cpg->cpg_composed_props);
605 	if ((pg = cpg->cpg_instance_pg) != NULL) {
607 		    (pg->sc_pgroup_composed == cpg));
611 	uu_avl_node_fini(cpg, &cpg->cpg_node, composed_pg_pool);
612 	free(cpg);
648 compose_props(composed_pg_t *cpg)
652 	tree = uu_avl_create(composed_prop_pool, cpg, TMPL_DEBUG_TREE);
657 	cpg->cpg_composed_props = tree;
662 	 * that neither cpg->cpg_instance_pg nor cpg->cpg_service_pg can be
668 	assert(cpg->cpg_instance_pg != NULL);
669 	grow_props_tree(cpg->cpg_instance_pg, tree);
674 	assert(cpg->cpg_service_pg != NULL);
675 	grow_props_tree(cpg->cpg_service_pg, tree);
684 	composed_pg_t *cpg;
694 		cpg = composed_pg_create();
695 		cpg->cpg_name = pg->sc_pgroup_name;
696 		cpg->cpg_type = pg->sc_pgroup_type;
697 		cpg->cpg_instance_pg = pg;
698 		match = uu_avl_find(tree, cpg, NULL, &marker);
701 		uu_avl_insert(tree, cpg, marker);
702 		pg->sc_pgroup_composed = cpg;
707 	cpg = NULL;
711 		if (cpg == NULL)
712 			cpg = composed_pg_create();
713 		cpg->cpg_name = pg->sc_pgroup_name;
714 		cpg->cpg_type = pg->sc_pgroup_type;
715 		cpg->cpg_service_pg = pg;
716 		match = uu_avl_find(tree, cpg, NULL, &marker);
718 			uu_avl_insert(tree, cpg, marker);
720 			cpg = NULL;
731 	if (cpg != NULL)
732 		composed_pg_destroy(cpg);
757 	composed_pg_t *cpg;
766 	while ((cpg = uu_avl_teardown(tree, &marker)) != NULL) {
767 		composed_pg_destroy(cpg);
813 	composed_pg_t *cpg;
816 	cpg = pg->sc_pgroup_composed;
818 	if ((cpg == NULL) || (cpg->cpg_composed_props == NULL)) {
828 	return (uu_avl_find(cpg->cpg_composed_props, &look, NULL, NULL));
1993 	composed_pg_t *cpg;
1996 	cpg = pg->sc_pgroup_composed;
1997 	if ((cpg != NULL) && (cpg->cpg_composed_props != NULL)) {
2000 			prop = uu_avl_next(cpg->cpg_composed_props, current);
2002 			prop = uu_avl_first(cpg->cpg_composed_props);
2022 	composed_pg_t cpg;
2060 			(void) memset(&cpg, 0, sizeof (cpg));
2061 			cpg.cpg_name = info->pi_pgp_name;
2062 			cpg.cpg_type = SCF_GROUP_TEMPLATE_PG_PATTERN;
2064 			    &cpg, NULL, NULL);
2253 	composed_pg_t *cpg;
2264 			cpg = i->pgi_current.pgi_cpg;
2265 			if (cpg == NULL) {
2266 				cpg = uu_avl_first(composed_tree);
2268 				cpg = uu_avl_next(composed_tree, cpg);
2270 			if (cpg == NULL) {
2273 				pg = CPG2PG(cpg);
2274 				i->pgi_current.pgi_cpg = cpg;
3145 	pgroup_t *cpg;		/* candidate property group */
3175 	while ((cpg = next_pattern_pg(iter)) != NULL) {
3176 		if (pg_target_check(cpg, iter->pgi_level) == 0)
3181 			if (strcmp(cpg->sc_pgroup_name, pg_names[i]) == 0) {
3187 					pg_patterns[i] = cpg;
3334 	composed_pg_t cpg;
3365 		(void) memset(&cpg, 0, sizeof (cpg));
3366 		cpg.cpg_name = pg_name;
3367 		cpg.cpg_type = pg_type;
3368 		match = uu_avl_find(tree, &cpg, NULL, NULL);
3899 	composed_pg_t *cpg;
3908 	for (cpg = uu_avl_first(pgroups);
3909 	    cpg != NULL;
3910 	    cpg = uu_avl_next(pgroups, cpg)) {
3911 		if (strcmp(cpg->cpg_type, SCF_GROUP_TEMPLATE) == 0)
3913 		pg = CPG2PG(cpg);