Lines Matching refs:vals
48 BerVarray *vals,
59 if ( *vals == NULL ) {
60 *vals = (BerVarray) SLAP_MALLOC( (nn + 1)
62 if( *vals == NULL ) {
70 for ( n = 0; !BER_BVISNULL( &(*vals)[n] ); n++ ) {
73 *vals = (BerVarray) SLAP_REALLOC( (char *) *vals,
75 if( *vals == NULL ) {
82 v2 = &(*vals)[n];
94 BerVarray *vals,
100 if ( *vals == NULL ) {
101 *vals = (BerVarray) SLAP_MALLOC( 2 * sizeof(struct berval) );
102 if( *vals == NULL ) {
110 for ( n = 0; !BER_BVISNULL( &(*vals)[n] ); n++ ) {
113 *vals = (BerVarray) SLAP_REALLOC( (char *) *vals,
115 if( *vals == NULL ) {
122 v2 = &(*vals)[n];
224 BerVarray vals,
252 for ( i = 0; vals[i].bv_val != NULL; i++ ) {
257 &vals[i], nval.bv_val == NULL ? val : &nval, &text );
325 int i, vals;
348 vals = i;
358 a->a_nvals = ch_malloc( (vals+1)*sizeof(struct berval));
359 BER_BVZERO(a->a_nvals+vals);
360 for ( i=0; i<vals; i++ ) {
368 for ( i=0; i<vals; i++ ) {
376 indexes = ch_malloc( vals * sizeof(int) );
377 for ( i=0; i<vals; i++) {
387 for ( i=1; i<vals; i++ ) {
404 if ( indexes[0] != 0 || indexes[vals-1] != vals-1 ) {
706 BerVarray vals,
713 /* count new vals */
714 for (i=0; !BER_BVISNULL( vals+i ); i++) ;
735 assert( nvals != vals );
745 if ( !nvals ) nvals = vals;
757 if ( vals[i].bv_val[0] == '{' ) {
759 k = strtol( vals[i].bv_val + 1, &next, 0 );
760 if ( next == vals[i].bv_val + 1 ||
762 (ber_len_t) (next - vals[i].bv_val) > vals[i].bv_len )
774 ber_dupbv( new+anum, vals+i );
783 ber_dupbv( new+k, vals+i );