Lines Matching defs:vals
43 BerVarray *vals,
54 if ( *vals == NULL ) {
55 *vals = (BerVarray) SLAP_MALLOC( (nn + 1)
57 if( *vals == NULL ) {
65 for ( n = 0; !BER_BVISNULL( &(*vals)[n] ); n++ ) {
68 *vals = (BerVarray) SLAP_REALLOC( (char *) *vals,
70 if( *vals == NULL ) {
77 v2 = &(*vals)[n];
89 BerVarray *vals,
95 if ( *vals == NULL ) {
96 *vals = (BerVarray) SLAP_MALLOC( 2 * sizeof(struct berval) );
97 if( *vals == NULL ) {
105 for ( n = 0; !BER_BVISNULL( &(*vals)[n] ); n++ ) {
108 *vals = (BerVarray) SLAP_REALLOC( (char *) *vals,
110 if( *vals == NULL ) {
117 v2 = &(*vals)[n];
219 BerVarray vals,
247 for ( i = 0; vals[i].bv_val != NULL; i++ ) {
252 &vals[i], nval.bv_val == NULL ? val : &nval, &text );
320 int i, vals;
343 vals = i;
353 a->a_nvals = ch_malloc( (vals+1)*sizeof(struct berval));
354 BER_BVZERO(a->a_nvals+vals);
355 for ( i=0; i<vals; i++ ) {
363 for ( i=0; i<vals; i++ ) {
371 indexes = ch_malloc( vals * sizeof(int) );
372 for ( i=0; i<vals; i++) {
382 for ( i=1; i<vals; i++ ) {
399 if ( indexes[0] != 0 || indexes[vals-1] != vals-1 ) {
701 BerVarray vals,
708 /* count new vals */
709 for (i=0; !BER_BVISNULL( vals+i ); i++) ;
730 assert( nvals != vals );
740 if ( !nvals ) nvals = vals;
752 if ( vals[i].bv_val[0] == '{' ) {
754 k = strtol( vals[i].bv_val + 1, &next, 0 );
755 if ( next == vals[i].bv_val + 1 ||
757 (ber_len_t) (next - vals[i].bv_val) > vals[i].bv_len )
769 ber_dupbv( new+anum, vals+i );
778 ber_dupbv( new+k, vals+i );