Lines Matching defs:numvalues

472 	int		numvalues, i;
654 numvalues = 1;
674 vals = realloc(vals, ++numvalues
676 vals[numvalues - 1] = ++keyend;
683 raprop.prop_numvalues = numvalues;
1380 int i, ret, numvalues = 0;
1400 RA_PG_ROUTEADM, RA_PROP_PROTO, B_TRUE, B_FALSE, NULL, &numvalues,
1416 for (i = 0; i < numvalues; i++) {
1424 ra_free_prop_values(numvalues, protolist);
1432 for (i = 0; i < numvalues; i++) {
1440 ra_free_prop_values(numvalues, protolist);
1450 ra_free_prop_values(numvalues, protolist);
1649 int numvalues = 0;
1654 B_TRUE, B_FALSE, NULL, &numvalues, &protolist) == -1)
1656 ra_free_prop_values(numvalues, protolist);
1686 int numvalues = 0;
1691 B_TRUE, B_FALSE, NULL, &numvalues, &protolist) == -1) {
1700 ra_free_prop_values(numvalues, protolist);
1703 ra_free_prop_values(numvalues, protolist);
1820 int numvalues = 0;
1825 B_TRUE, B_FALSE, NULL, &numvalues, &protolist) == -1) {
1834 ra_free_prop_values(numvalues, protolist);
1837 ra_free_prop_values(numvalues, protolist);
1860 int numvalues = 0;
1864 B_TRUE, B_FALSE, NULL, &numvalues, &protolist) == -1)
1866 ra_free_prop_values(numvalues, protolist);
1925 int numvalues = 1;
1928 type, &numvalues, &values) == -1)
1943 boolean_t required, scf_type_t *type, int *numvalues, char ***values)
1963 *numvalues = 0;
2000 * if *numvalues != 0, it holds expected number of values. If a
2003 if (*numvalues != 0 && *numvalues != numvalues_retrieved) {
2006 myname, numvalues_retrieved, pgname, propname, *numvalues);
2010 *numvalues = numvalues_retrieved;
2044 ra_free_prop_values(int numvalues, char **values)
2048 for (i = 0; i < numvalues; i++)
2081 int i, retval, numvalues = 0, ret = 0;
2087 B_FALSE, &oldproptype, &numvalues, &ovalues) == -1) {
2097 ra_free_prop_values(numvalues, ovalues);