mirror of
https://git.openldap.org/openldap/openldap.git
synced 2025-12-20 22:59:34 -05:00
including use of ctime_r, gethostby*_r, etc.. Also reworked ldap_sort_entries to be reentrant. Need to add code to properly set LDAP_API_FEATURE_THREAD_SAFE.
430 lines
9.4 KiB
C
430 lines
9.4 KiB
C
/*
|
|
* Copyright (c) 1993 Regents of the University of Michigan.
|
|
* All rights reserved.
|
|
*
|
|
* getfilter.c -- optional add-on to libldap
|
|
*/
|
|
|
|
#include "portable.h"
|
|
|
|
#ifndef lint
|
|
static char copyright[] = "@(#) Copyright (c) 1993 Regents of the University of Michigan.\nAll rights reserved.\n";
|
|
#endif
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
#include <ac/ctype.h>
|
|
#include <ac/errno.h>
|
|
#include <ac/regex.h>
|
|
#include <ac/string.h>
|
|
#include <ac/time.h>
|
|
#include <ac/unistd.h>
|
|
|
|
#ifdef HAVE_SYS_FILE_H
|
|
#include <sys/file.h>
|
|
#endif
|
|
|
|
#include "ldap-int.h"
|
|
|
|
static int break_into_words LDAP_P(( char *str, char *delims, char ***wordsp ));
|
|
|
|
#define FILT_MAX_LINE_LEN 1024
|
|
|
|
LDAPFiltDesc *
|
|
ldap_init_getfilter( char *fname )
|
|
{
|
|
FILE *fp;
|
|
char *buf;
|
|
long rlen, len;
|
|
int eof;
|
|
LDAPFiltDesc *lfdp;
|
|
|
|
if (( fp = fopen( fname, "r" )) == NULL ) {
|
|
return( NULL );
|
|
}
|
|
|
|
if ( fseek( fp, 0L, SEEK_END ) != 0 ) { /* move to end to get len */
|
|
fclose( fp );
|
|
return( NULL );
|
|
}
|
|
|
|
len = ftell( fp );
|
|
|
|
if ( fseek( fp, 0L, SEEK_SET ) != 0 ) { /* back to start of file */
|
|
fclose( fp );
|
|
return( NULL );
|
|
}
|
|
|
|
if (( buf = malloc( (size_t)len )) == NULL ) {
|
|
fclose( fp );
|
|
return( NULL );
|
|
}
|
|
|
|
rlen = fread( buf, 1, (size_t)len, fp );
|
|
eof = feof( fp );
|
|
fclose( fp );
|
|
|
|
if ( rlen != len && !eof ) { /* error: didn't get the whole file */
|
|
free( buf );
|
|
return( NULL );
|
|
}
|
|
|
|
|
|
lfdp = ldap_init_getfilter_buf( buf, rlen );
|
|
free( buf );
|
|
|
|
return( lfdp );
|
|
}
|
|
|
|
|
|
LDAPFiltDesc *
|
|
ldap_init_getfilter_buf( char *buf, long buflen )
|
|
{
|
|
LDAPFiltDesc *lfdp;
|
|
LDAPFiltList *flp, *nextflp;
|
|
LDAPFiltInfo *fip, *nextfip;
|
|
char *tag, **tok;
|
|
int tokcnt, i;
|
|
int rc;
|
|
regex_t re;
|
|
|
|
if (( lfdp = (LDAPFiltDesc *)calloc( 1, sizeof( LDAPFiltDesc))) == NULL ) {
|
|
return( NULL );
|
|
}
|
|
|
|
flp = nextflp = NULL;
|
|
fip = NULL;
|
|
tag = NULL;
|
|
|
|
while ( buflen > 0 && ( tokcnt = next_line_tokens( &buf, &buflen, &tok ))
|
|
> 0 ) {
|
|
|
|
switch( tokcnt ) {
|
|
case 1: /* tag line */
|
|
if ( tag != NULL ) {
|
|
free( tag );
|
|
}
|
|
tag = tok[ 0 ];
|
|
free( tok );
|
|
break;
|
|
case 4:
|
|
case 5: /* start of filter info. list */
|
|
if (( nextflp = (LDAPFiltList *)calloc( 1, sizeof( LDAPFiltList )))
|
|
== NULL ) {
|
|
ldap_getfilter_free( lfdp );
|
|
return( NULL );
|
|
}
|
|
nextflp->lfl_tag = ldap_strdup( tag );
|
|
nextflp->lfl_pattern = tok[ 0 ];
|
|
if ( (rc = regcomp( &re, nextflp->lfl_pattern, 0 )) != 0 ) {
|
|
#ifdef LDAP_LIBUI
|
|
char error[512];
|
|
regerror(rc, &re, error, sizeof(error));
|
|
ldap_getfilter_free( lfdp );
|
|
fprintf( stderr, "bad regular expresssion %s, %s\n",
|
|
nextflp->lfl_pattern, error );
|
|
errno = EINVAL;
|
|
#endif /* LDAP_LIBUI */
|
|
free_strarray( tok );
|
|
return( NULL );
|
|
}
|
|
regfree(&re);
|
|
|
|
nextflp->lfl_delims = tok[ 1 ];
|
|
nextflp->lfl_ilist = NULL;
|
|
nextflp->lfl_next = NULL;
|
|
if ( flp == NULL ) { /* first one */
|
|
lfdp->lfd_filtlist = nextflp;
|
|
} else {
|
|
flp->lfl_next = nextflp;
|
|
}
|
|
flp = nextflp;
|
|
fip = NULL;
|
|
for ( i = 2; i < 5; ++i ) {
|
|
tok[ i - 2 ] = tok[ i ];
|
|
}
|
|
/* fall through */
|
|
|
|
case 2:
|
|
case 3: /* filter, desc, and optional search scope */
|
|
if ( nextflp != NULL ) { /* add to info list */
|
|
if (( nextfip = (LDAPFiltInfo *)calloc( 1,
|
|
sizeof( LDAPFiltInfo ))) == NULL ) {
|
|
ldap_getfilter_free( lfdp );
|
|
free_strarray( tok );
|
|
return( NULL );
|
|
}
|
|
if ( fip == NULL ) { /* first one */
|
|
nextflp->lfl_ilist = nextfip;
|
|
} else {
|
|
fip->lfi_next = nextfip;
|
|
}
|
|
fip = nextfip;
|
|
nextfip->lfi_next = NULL;
|
|
nextfip->lfi_filter = tok[ 0 ];
|
|
nextfip->lfi_desc = tok[ 1 ];
|
|
if ( tok[ 2 ] != NULL ) {
|
|
if ( strcasecmp( tok[ 2 ], "subtree" ) == 0 ) {
|
|
nextfip->lfi_scope = LDAP_SCOPE_SUBTREE;
|
|
} else if ( strcasecmp( tok[ 2 ], "onelevel" ) == 0 ) {
|
|
nextfip->lfi_scope = LDAP_SCOPE_ONELEVEL;
|
|
} else if ( strcasecmp( tok[ 2 ], "base" ) == 0 ) {
|
|
nextfip->lfi_scope = LDAP_SCOPE_BASE;
|
|
} else {
|
|
free_strarray( tok );
|
|
ldap_getfilter_free( lfdp );
|
|
errno = EINVAL;
|
|
return( NULL );
|
|
}
|
|
free( tok[ 2 ] );
|
|
tok[ 2 ] = NULL;
|
|
} else {
|
|
nextfip->lfi_scope = LDAP_SCOPE_SUBTREE; /* default */
|
|
}
|
|
nextfip->lfi_isexact = ( strchr( tok[ 0 ], '*' ) == NULL &&
|
|
strchr( tok[ 0 ], '~' ) == NULL );
|
|
free( tok );
|
|
}
|
|
break;
|
|
|
|
default:
|
|
free_strarray( tok );
|
|
ldap_getfilter_free( lfdp );
|
|
errno = EINVAL;
|
|
return( NULL );
|
|
}
|
|
}
|
|
|
|
if ( tag != NULL ) {
|
|
free( tag );
|
|
}
|
|
|
|
return( lfdp );
|
|
}
|
|
|
|
|
|
void
|
|
ldap_setfilteraffixes( LDAPFiltDesc *lfdp, char *prefix, char *suffix )
|
|
{
|
|
if ( lfdp->lfd_filtprefix != NULL ) {
|
|
free( lfdp->lfd_filtprefix );
|
|
}
|
|
lfdp->lfd_filtprefix = ( prefix == NULL ) ? NULL : ldap_strdup( prefix );
|
|
|
|
if ( lfdp->lfd_filtsuffix != NULL ) {
|
|
free( lfdp->lfd_filtsuffix );
|
|
}
|
|
lfdp->lfd_filtsuffix = ( suffix == NULL ) ? NULL : ldap_strdup( suffix );
|
|
}
|
|
|
|
|
|
LDAPFiltInfo *
|
|
ldap_getfirstfilter( LDAPFiltDesc *lfdp, char *tagpat, char *value )
|
|
{
|
|
LDAPFiltList *flp;
|
|
int rc;
|
|
regex_t re;
|
|
|
|
if ( lfdp->lfd_curvalcopy != NULL ) {
|
|
free( lfdp->lfd_curvalcopy );
|
|
free( lfdp->lfd_curvalwords );
|
|
}
|
|
|
|
lfdp->lfd_curval = value;
|
|
lfdp->lfd_curfip = NULL;
|
|
|
|
for ( flp = lfdp->lfd_filtlist; flp != NULL; flp = flp->lfl_next ) {
|
|
/* compile tagpat, continue if we fail */
|
|
if (regcomp(&re, tagpat, 0) != 0)
|
|
continue;
|
|
|
|
/* match tagpatern and tag, continue if we fail */
|
|
rc = regexec(&re, flp->lfl_tag, 0, NULL, 0);
|
|
regfree(&re);
|
|
if (rc != 0)
|
|
continue;
|
|
|
|
/* compile flp->ifl_pattern, continue if we fail */
|
|
if (regcomp(&re, flp->lfl_pattern, 0) != 0)
|
|
continue;
|
|
|
|
/* match ifl_pattern and lfd_curval, continue if we fail */
|
|
rc = regexec(&re, lfdp->lfd_curval, 0, NULL, 0);
|
|
regfree(&re);
|
|
if (rc != 0)
|
|
continue;
|
|
|
|
/* we successfully compiled both patterns and matched both values */
|
|
lfdp->lfd_curfip = flp->lfl_ilist;
|
|
break;
|
|
}
|
|
|
|
if ( lfdp->lfd_curfip == NULL ) {
|
|
return( NULL );
|
|
}
|
|
|
|
if (( lfdp->lfd_curvalcopy = ldap_strdup( value )) == NULL ) {
|
|
return( NULL );
|
|
}
|
|
|
|
if ( break_into_words( lfdp->lfd_curvalcopy, flp->lfl_delims,
|
|
&lfdp->lfd_curvalwords ) < 0 ) {
|
|
free( lfdp->lfd_curvalcopy );
|
|
lfdp->lfd_curvalcopy = NULL;
|
|
return( NULL );
|
|
}
|
|
|
|
return( ldap_getnextfilter( lfdp ));
|
|
}
|
|
|
|
|
|
LDAPFiltInfo *
|
|
ldap_getnextfilter( LDAPFiltDesc *lfdp )
|
|
{
|
|
LDAPFiltInfo *fip;
|
|
|
|
fip = lfdp->lfd_curfip;
|
|
|
|
if ( fip == NULL ) {
|
|
return( NULL );
|
|
}
|
|
|
|
lfdp->lfd_curfip = fip->lfi_next;
|
|
|
|
ldap_build_filter( lfdp->lfd_filter, LDAP_FILT_MAXSIZ, fip->lfi_filter,
|
|
lfdp->lfd_filtprefix, lfdp->lfd_filtsuffix, NULL,
|
|
lfdp->lfd_curval, lfdp->lfd_curvalwords );
|
|
lfdp->lfd_retfi.lfi_filter = lfdp->lfd_filter;
|
|
lfdp->lfd_retfi.lfi_desc = fip->lfi_desc;
|
|
lfdp->lfd_retfi.lfi_scope = fip->lfi_scope;
|
|
lfdp->lfd_retfi.lfi_isexact = fip->lfi_isexact;
|
|
|
|
return( &lfdp->lfd_retfi );
|
|
}
|
|
|
|
|
|
void
|
|
ldap_build_filter( char *filtbuf, unsigned long buflen, char *pattern,
|
|
char *prefix, char *suffix, char *attr, char *value, char **valwords )
|
|
{
|
|
char *p, *f;
|
|
size_t slen;
|
|
int i, wordcount, wordnum, endwordnum;
|
|
|
|
if ( valwords == NULL ) {
|
|
wordcount = 0;
|
|
} else {
|
|
for ( wordcount = 0; valwords[ wordcount ] != NULL; ++wordcount ) {
|
|
;
|
|
}
|
|
}
|
|
|
|
f = filtbuf;
|
|
|
|
if ( prefix != NULL ) {
|
|
strcpy( f, prefix );
|
|
f += strlen( prefix );
|
|
}
|
|
|
|
for ( p = pattern; *p != '\0'; ++p ) {
|
|
if ( *p == '%' ) {
|
|
++p;
|
|
if ( *p == 'v' ) {
|
|
if ( isdigit( *(p+1))) {
|
|
++p;
|
|
wordnum = *p - '1';
|
|
if ( *(p+1) == '-' ) {
|
|
++p;
|
|
if ( isdigit( *(p+1))) {
|
|
++p;
|
|
endwordnum = *p - '1'; /* e.g., "%v2-4" */
|
|
if ( endwordnum > wordcount - 1 ) {
|
|
endwordnum = wordcount - 1;
|
|
}
|
|
} else {
|
|
endwordnum = wordcount - 1; /* e.g., "%v2-" */
|
|
}
|
|
} else {
|
|
endwordnum = wordnum; /* e.g., "%v2" */
|
|
}
|
|
|
|
if ( wordcount > 0 ) {
|
|
for ( i = wordnum; i <= endwordnum; ++i ) {
|
|
if ( i > wordnum ) { /* add blank btw words */
|
|
*f++ = ' ';
|
|
}
|
|
slen = strlen( valwords[ i ] );
|
|
SAFEMEMCPY( f, valwords[ i ], slen );
|
|
f += slen;
|
|
}
|
|
}
|
|
} else if ( *(p+1) == '$' ) {
|
|
++p;
|
|
if ( wordcount > 0 ) {
|
|
wordnum = wordcount - 1;
|
|
slen = strlen( valwords[ wordnum ] );
|
|
SAFEMEMCPY( f, valwords[ wordnum ], slen );
|
|
f += slen;
|
|
}
|
|
} else if ( value != NULL ) {
|
|
slen = strlen( value );
|
|
SAFEMEMCPY( f, value, slen );
|
|
f += slen;
|
|
}
|
|
} else if ( *p == 'a' && attr != NULL ) {
|
|
slen = strlen( attr );
|
|
SAFEMEMCPY( f, attr, slen );
|
|
f += slen;
|
|
} else {
|
|
*f++ = *p;
|
|
}
|
|
} else {
|
|
*f++ = *p;
|
|
}
|
|
|
|
if ( (unsigned long) (f - filtbuf) > buflen ) {
|
|
/* sanity check */
|
|
--f;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if ( suffix != NULL && (
|
|
(unsigned long) ( f - filtbuf ) < buflen ) )
|
|
{
|
|
strcpy( f, suffix );
|
|
} else {
|
|
*f = '\0';
|
|
}
|
|
}
|
|
|
|
|
|
static int
|
|
break_into_words( char *str, char *delims, char ***wordsp )
|
|
{
|
|
char *word, **words;
|
|
int count;
|
|
char *tok_r;
|
|
|
|
if (( words = (char **)calloc( 1, sizeof( char * ))) == NULL ) {
|
|
return( -1 );
|
|
}
|
|
count = 0;
|
|
words[ count ] = NULL;
|
|
|
|
word = ldap_int_strtok( str, delims, &tok_r );
|
|
while ( word != NULL ) {
|
|
if (( words = (char **)realloc( words,
|
|
( count + 2 ) * sizeof( char * ))) == NULL ) {
|
|
return( -1 );
|
|
}
|
|
|
|
words[ count ] = word;
|
|
words[ ++count ] = NULL;
|
|
word = ldap_int_strtok( NULL, delims, &tok_r );
|
|
}
|
|
|
|
*wordsp = words;
|
|
return( count );
|
|
}
|