mirror/openldap
2
0
Fork 0
mirror of https://git.openldap.org/openldap/openldap.git synced 2025-03-07 14:18:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add additional error checking... need to better handle

Browse Source 
garbage input from slapadd or pre-existing database.
This commit is contained in:
Kurt Zeilenga 2000-09-15 03:26:22 +00:00
parent df4605b8c1
commit 45cf7e1dfe
1 changed files with 27 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

41
servers/slapd/schema_init.c
View File

@ -120,12 +120,13 @@ int octetStringIndexer(
digest.bv_val = MD5digest;
digest.bv_len = sizeof(MD5digest);
/* we should have at least one value at this point */
assert( values != NULL && values[0] != NULL );
for( i=0; values[i] != NULL; i++ ) {
/* just count them */
}
assert( i > 0 );
keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
slen = strlen( syntax->ssyn_oid );
@ -791,12 +792,13 @@ int caseExactIndexer(
digest.bv_val = MD5digest;
digest.bv_len = sizeof(MD5digest);
/* we should have at least one value at this point */
assert( values != NULL && values[0] != NULL );
for( i=0; values[i] != NULL; i++ ) {
/* just count them */
}
assert( i > 0 );
keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
slen = strlen( syntax->ssyn_oid );
@ -891,6 +893,9 @@ int caseExactSubstringsIndexer(
digest.bv_val = MD5digest;
digest.bv_len = sizeof(MD5digest);
/* we should have at least one value at this point */
assert( values != NULL && values[0] != NULL );
nkeys=0;
for( i=0; values[i] != NULL; i++ ) {
/* count number of indices to generate */
@ -922,7 +927,6 @@ int caseExactSubstringsIndexer(
}
}
}
assert( i > 0 );
if( nkeys == 0 ) {
/* no keys to generate */
@ -1358,12 +1362,13 @@ int caseIgnoreIndexer(
digest.bv_val = MD5digest;
digest.bv_len = sizeof(MD5digest);
/* we should have at least one value at this point */
assert( values != NULL && values[0] != NULL );
for( i=0; values[i] != NULL; i++ ) {
/* just count them */
}
assert( i > 0 );
keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
slen = strlen( syntax->ssyn_oid );
@ -1465,6 +1470,9 @@ int caseIgnoreSubstringsIndexer(
digest.bv_val = MD5digest;
digest.bv_len = sizeof(MD5digest);
/* we should have at least one value at this point */
assert( values != NULL && values[0] != NULL );
nkeys=0;
for( i=0; values[i] != NULL; i++ ) {
/* count number of indices to generate */
@ -1496,7 +1504,6 @@ int caseIgnoreSubstringsIndexer(
}
}
}
assert( i > 0 );
if( nkeys == 0 ) {
/* no keys to generate */
@ -2139,12 +2146,13 @@ int caseExactIA5Indexer(
digest.bv_val = MD5digest;
digest.bv_len = sizeof(MD5digest);
/* we should have at least one value at this point */
assert( values != NULL && values[0] != NULL );
for( i=0; values[i] != NULL; i++ ) {
/* just count them */
}
assert( i > 0 );
keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
slen = strlen( syntax->ssyn_oid );
@ -2239,6 +2247,9 @@ int caseExactIA5SubstringsIndexer(
digest.bv_val = MD5digest;
digest.bv_len = sizeof(MD5digest);
/* we should have at least one value at this point */
assert( values != NULL && values[0] != NULL );
nkeys=0;
for( i=0; values[i] != NULL; i++ ) {
/* count number of indices to generate */
@ -2270,7 +2281,6 @@ int caseExactIA5SubstringsIndexer(
}
}
}
assert( i > 0 );
if( nkeys == 0 ) {
/* no keys to generate */
@ -2702,12 +2712,13 @@ int caseIgnoreIA5Indexer(
digest.bv_val = MD5digest;
digest.bv_len = sizeof(MD5digest);
/* we should have at least one value at this point */
assert( values != NULL && values[0] != NULL );
for( i=0; values[i] != NULL; i++ ) {
/* just count them */
}
assert( i > 0 );
keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
slen = strlen( syntax->ssyn_oid );
@ -2809,6 +2820,9 @@ int caseIgnoreIA5SubstringsIndexer(
digest.bv_val = MD5digest;
digest.bv_len = sizeof(MD5digest);
/* we should have at least one value at this point */
assert( values != NULL && values[0] != NULL );
nkeys=0;
for( i=0; values[i] != NULL; i++ ) {
/* count number of indices to generate */
@ -2840,7 +2854,6 @@ int caseIgnoreIA5SubstringsIndexer(
}
}
}
assert( i > 0 );
if( nkeys == 0 ) {
/* no keys to generate */