Lines Matching refs:vals

511  * appends to an existing scf_values_t *vals.  vals may be empty, but
532 scf_values_t *vals)
541 assert(vals != NULL);
542 assert(vals->value_type == SCF_TYPE_ASTRING);
543 assert(vals->reserved == NULL);
544 count = vals->value_count;
547 vals->values.v_astring = calloc(cursz, sizeof (char *));
548 if (vals->values.v_astring == NULL) {
597 (void) memcpy(aux, vals->values.v_astring,
599 free(vals->values.v_astring);
600 vals->values.v_astring = aux;
603 vals->values.v_astring[count] = malloc(rsize);
604 if (vals->values.v_astring[count] == NULL) {
610 vals->values.v_astring[count], rsize)) <= 0) {
613 free(vals->values.v_astring[count]);
621 if (strncmp(vals->values.v_astring[i],
622 vals->values.v_astring[count], rsize) == 0) {
623 free(vals->values.v_astring[count]);
634 vals->value_count = count;
642 vals->values_as_strings = vals->values.v_astring;
649 if (vals->values.v_astring[i] != NULL)
650 free(vals->values.v_astring[i]);
651 vals->values.v_astring[i] = NULL;
653 free(vals->values.v_astring);
654 vals->values.v_astring = NULL;
655 vals->value_count = 0;
661 return (vals->values.v_astring);
683 scf_values_t *vals)
685 assert(vals != NULL);
686 vals->value_count = 0;
687 vals->value_type = SCF_TYPE_ASTRING;
688 vals->reserved = NULL;
689 return (_append_astrings_values(pg, prop_name, vals));
3542 scf_tmpl_prop_internal_seps(const scf_prop_tmpl_t *t, scf_values_t *vals)
3545 SCF_PROPERTY_INTERNAL_SEPARATORS, vals) == NULL) {
3563 } else if (vals->value_count == 0) {
3566 scf_values_destroy(vals);
3590 scf_values_t *vals)
3595 SCF_PROPERTY_TM_CONSTRAINT_NAME, vals);
3615 } else if (vals->value_count == 0) {
3618 scf_values_destroy(vals);
3693 scf_values_t vals;
3696 SCF_PROPERTY_TM_CHOICES_INCLUDE_VALUES, &vals)) == NULL) {
3715 for (n = 0; n < vals.value_count; ++n) {
3721 scf_values_destroy(&vals);
3771 scf_values_t vals;
3781 if ((ret = _read_astrings_values(t->prt_pg, prop, &vals)) == NULL)
3783 if (vals.value_count == 0) {
3789 min = malloc(vals.value_count * sizeof (uint64_t));
3790 max = malloc(vals.value_count * sizeof (uint64_t));
3795 for (i = 0; i < vals.value_count; ++i) {
3819 ranges->scr_num_ranges = vals.value_count;
3822 scf_values_destroy(&vals);
3828 scf_values_destroy(&vals);
3870 scf_values_t vals;
3880 if ((ret = _read_astrings_values(t->prt_pg, prop, &vals)) == NULL)
3882 if (vals.value_count == 0) {
3888 min = malloc(vals.value_count * sizeof (int64_t));
3889 max = malloc(vals.value_count * sizeof (int64_t));
3894 while (n < vals.value_count) {
3919 ranges->sir_num_ranges = vals.value_count;
3922 scf_values_destroy(&vals);
3928 scf_values_destroy(&vals);
4015 scf_tmpl_value_name_choices(const scf_prop_tmpl_t *t, scf_values_t *vals)
4023 SCF_PROPERTY_TM_CHOICES_NAME, vals)) != NULL) {
4035 SCF_PROPERTY_TM_VALUES_NAME, vals);
4039 SCF_PROPERTY_TM_VALUES_NAME, vals);
4056 SCF_PROPERTY_TM_CONSTRAINT_NAME, vals);
4060 SCF_PROPERTY_TM_CONSTRAINT_NAME, vals);
4070 if (c_flag == 0 || vals->value_count == 0) {
4095 scf_values_destroy(scf_values_t *vals)
4101 if (vals == NULL)
4104 str = vals->values_as_strings;
4107 switch (vals->value_type) {
4109 free(vals->values.v_boolean);
4112 free(vals->values.v_count);
4115 free(vals->values.v_integer);
4118 items = vals->values.v_astring;
4122 items = vals->values.v_ustring;
4126 items = vals->values.v_opaque;
4130 free(vals->values.v_time);
4136 for (i = 0; i < vals->value_count; ++i) {
4142 vals->value_count = 0;
5693 scf_values_t vals;
5796 if (scf_tmpl_value_name_constraints(pt, &vals) != 0) {
5810 constraints = vals.values.v_astring;
5814 scf_values_destroy(&vals);
5821 scf_values_destroy(&vals);