|
|
@@ -50,11 +50,10 @@
|
|
|
static int int_filter_ava( Slapi_PBlock *pb, struct berval *bvfilter,
|
|
|
Slapi_Value **bvals, int ftype, Slapi_Value **retVal );
|
|
|
static int int_values2keys( Slapi_PBlock *pb, Slapi_Value **val,
|
|
|
- Slapi_Value ***ivals );
|
|
|
+ Slapi_Value ***ivals, int ftype );
|
|
|
static int int_assertion2keys( Slapi_PBlock *pb, Slapi_Value *val,
|
|
|
Slapi_Value ***ivals, int ftype );
|
|
|
static int int_compare(struct berval *v1, struct berval *v2);
|
|
|
-static long int_to_canonical( long num );
|
|
|
|
|
|
/* the first name is the official one from RFC 2252 */
|
|
|
static char *names[] = { "INTEGER", "int", INTEGER_SYNTAX_OID, 0 };
|
|
|
@@ -97,103 +96,22 @@ static int
|
|
|
int_filter_ava( Slapi_PBlock *pb, struct berval *bvfilter,
|
|
|
Slapi_Value **bvals, int ftype, Slapi_Value **retVal )
|
|
|
{
|
|
|
- int i, rc;
|
|
|
- long flong, elong;
|
|
|
-
|
|
|
- if ( ftype == LDAP_FILTER_APPROX ) {
|
|
|
- return( LDAP_PROTOCOL_ERROR );
|
|
|
- }
|
|
|
- if(retVal) {
|
|
|
- *retVal=NULL;
|
|
|
- }
|
|
|
- flong = atol( bvfilter->bv_val );
|
|
|
- for ( i = 0; bvals[i] != NULL; i++ ) {
|
|
|
- elong = atol ( slapi_value_get_string(bvals[i]) );
|
|
|
- rc = elong - flong;
|
|
|
- switch ( ftype ) {
|
|
|
- case LDAP_FILTER_GE:
|
|
|
- if ( rc >= 0 ) {
|
|
|
- if(retVal) {
|
|
|
- *retVal = bvals[i];
|
|
|
- }
|
|
|
- return( 0 );
|
|
|
- }
|
|
|
- break;
|
|
|
- case LDAP_FILTER_LE:
|
|
|
- if ( rc <= 0 ) {
|
|
|
- if(retVal) {
|
|
|
- *retVal = bvals[i];
|
|
|
- }
|
|
|
- return( 0 );
|
|
|
- }
|
|
|
- break;
|
|
|
- case LDAP_FILTER_EQUALITY:
|
|
|
- if ( rc == 0 ) {
|
|
|
- if(retVal) {
|
|
|
- *retVal = bvals[i];
|
|
|
- }
|
|
|
- return( 0 );
|
|
|
- }
|
|
|
- break;
|
|
|
- }
|
|
|
- }
|
|
|
-
|
|
|
- return( -1 );
|
|
|
+ return( string_filter_ava( bvfilter, bvals, SYNTAX_INT | SYNTAX_CES,
|
|
|
+ ftype, retVal ) );
|
|
|
}
|
|
|
|
|
|
static int
|
|
|
-int_values2keys( Slapi_PBlock *pb, Slapi_Value **vals, Slapi_Value ***ivals )
|
|
|
+int_values2keys( Slapi_PBlock *pb, Slapi_Value **vals, Slapi_Value ***ivals, int ftype )
|
|
|
{
|
|
|
- long num;
|
|
|
- int i;
|
|
|
-
|
|
|
- for ( i = 0; vals[i] != NULL; i++ ) {
|
|
|
- /* NULL */
|
|
|
- }
|
|
|
-
|
|
|
- *ivals = (Slapi_Value **) slapi_ch_malloc(( i + 1 ) * sizeof(Slapi_Value *) );
|
|
|
-
|
|
|
- for ( i = 0; vals[i] != NULL; i++ )
|
|
|
- {
|
|
|
- num = atol( slapi_value_get_string(vals[i]) );
|
|
|
- num = int_to_canonical( num );
|
|
|
- (*ivals)[i] = slapi_value_new();
|
|
|
- slapi_value_set((*ivals)[i],&num,sizeof(long));
|
|
|
- }
|
|
|
- (*ivals)[i] = NULL;
|
|
|
-
|
|
|
- return( 0 );
|
|
|
+ return( string_values2keys( pb, vals, ivals, SYNTAX_INT | SYNTAX_CES,
|
|
|
+ ftype ) );
|
|
|
}
|
|
|
|
|
|
static int
|
|
|
int_assertion2keys( Slapi_PBlock *pb, Slapi_Value *val, Slapi_Value ***ivals, int ftype )
|
|
|
{
|
|
|
- long num;
|
|
|
- size_t len;
|
|
|
- unsigned char *b;
|
|
|
- Slapi_Value *tmpval=NULL;
|
|
|
-
|
|
|
- num = atol( slapi_value_get_string(val) );
|
|
|
- num = int_to_canonical( num );
|
|
|
- /* similar to string.c to optimize equality path: avoid malloc/free */
|
|
|
- if(ftype == LDAP_FILTER_EQUALITY_FAST) {
|
|
|
- len=sizeof(long);
|
|
|
- tmpval=(*ivals)[0];
|
|
|
- if ( len > tmpval->bv.bv_len) {
|
|
|
- tmpval->bv.bv_val=(char *)slapi_ch_malloc(len);
|
|
|
- }
|
|
|
- tmpval->bv.bv_len=len;
|
|
|
- b = (unsigned char *)#
|
|
|
- memcpy(tmpval->bv.bv_val,b,len);
|
|
|
- } else {
|
|
|
- *ivals = (Slapi_Value **) slapi_ch_malloc( 2 * sizeof(Slapi_Value *) );
|
|
|
- (*ivals)[0] = (Slapi_Value *) slapi_ch_malloc( sizeof(Slapi_Value) );
|
|
|
- /* XXXSD initialize memory */
|
|
|
- memset((*ivals)[0],0,sizeof(Slapi_Value));
|
|
|
- slapi_value_set((*ivals)[0],&num,sizeof(long));
|
|
|
- (*ivals)[1] = NULL;
|
|
|
- }
|
|
|
- return( 0 );
|
|
|
+ return(string_assertion2keys_ava( pb, val, ivals,
|
|
|
+ SYNTAX_INT | SYNTAX_CES, ftype ));
|
|
|
}
|
|
|
|
|
|
static int int_compare(
|
|
|
@@ -201,25 +119,5 @@ static int int_compare(
|
|
|
struct berval *v2
|
|
|
)
|
|
|
{
|
|
|
- long value1 = atol(v1->bv_val);
|
|
|
- long value2 = atol(v2->bv_val);
|
|
|
-
|
|
|
- if (value1 == value2) {
|
|
|
- return 0;
|
|
|
- }
|
|
|
- return ( ((value1 - value2) > 0) ? 1 : -1);
|
|
|
-}
|
|
|
-
|
|
|
-static long
|
|
|
-int_to_canonical( long num )
|
|
|
-{
|
|
|
- long ret = 0L;
|
|
|
- unsigned char *b = (unsigned char *)&ret;
|
|
|
-
|
|
|
- b[0] = (unsigned char)(num >> 24);
|
|
|
- b[1] = (unsigned char)(num >> 16);
|
|
|
- b[2] = (unsigned char)(num >> 8);
|
|
|
- b[3] = (unsigned char)num;
|
|
|
-
|
|
|
- return ret;
|
|
|
+ return value_cmp(v1, v2, SYNTAX_INT|SYNTAX_CES, 3 /* Normalise both values */);
|
|
|
}
|