2 * Copyright (c) 1993 Regents of the University of Michigan.
5 * getfilter.c -- optional add-on to libldap
11 static char copyright[] = "@(#) Copyright (c) 1993 Regents of the University of Michigan.\nAll rights reserved.\n";
20 #include <ac/string.h>
22 #include <ac/unistd.h>
24 #ifdef HAVE_SYS_FILE_H
31 static int break_into_words LDAP_P(( char *str, char *delims, char ***wordsp ));
32 int next_line_tokens LDAP_P(( char **bufp, long *blenp, char ***toksp ));
33 void free_strarray LDAP_P(( char **sap ));
35 #define FILT_MAX_LINE_LEN 1024
38 ldap_init_getfilter( char *fname )
46 if (( fp = fopen( fname, "r" )) == NULL ) {
50 if ( fseek( fp, 0L, SEEK_END ) != 0 ) { /* move to end to get len */
57 if ( fseek( fp, 0L, SEEK_SET ) != 0 ) { /* back to start of file */
62 if (( buf = malloc( (size_t)len )) == NULL ) {
67 rlen = fread( buf, 1, (size_t)len, fp );
71 if ( rlen != len && !eof ) { /* error: didn't get the whole file */
77 lfdp = ldap_init_getfilter_buf( buf, rlen );
85 ldap_init_getfilter_buf( char *buf, long buflen )
88 LDAPFiltList *flp, *nextflp;
89 LDAPFiltInfo *fip, *nextfip;
95 if (( lfdp = (LDAPFiltDesc *)calloc( 1, sizeof( LDAPFiltDesc))) == NULL ) {
103 while ( buflen > 0 && ( tokcnt = next_line_tokens( &buf, &buflen, &tok ))
107 case 1: /* tag line */
115 case 5: /* start of filter info. list */
116 if (( nextflp = (LDAPFiltList *)calloc( 1, sizeof( LDAPFiltList )))
118 ldap_getfilter_free( lfdp );
121 nextflp->lfl_tag = strdup( tag );
122 nextflp->lfl_pattern = tok[ 0 ];
123 if ( (rc = regcomp( &re, nextflp->lfl_pattern, 0 )) != 0 ) {
126 regerror(rc, &re, error, sizeof(error));
127 ldap_getfilter_free( lfdp );
128 fprintf( stderr, "bad regular expresssion %s, %s\n",
129 nextflp->lfl_pattern, error );
131 #endif /* LDAP_LIBUI */
132 free_strarray( tok );
137 nextflp->lfl_delims = tok[ 1 ];
138 nextflp->lfl_ilist = NULL;
139 nextflp->lfl_next = NULL;
140 if ( flp == NULL ) { /* first one */
141 lfdp->lfd_filtlist = nextflp;
143 flp->lfl_next = nextflp;
147 for ( i = 2; i < 5; ++i ) {
148 tok[ i - 2 ] = tok[ i ];
153 case 3: /* filter, desc, and optional search scope */
154 if ( nextflp != NULL ) { /* add to info list */
155 if (( nextfip = (LDAPFiltInfo *)calloc( 1,
156 sizeof( LDAPFiltInfo ))) == NULL ) {
157 ldap_getfilter_free( lfdp );
158 free_strarray( tok );
161 if ( fip == NULL ) { /* first one */
162 nextflp->lfl_ilist = nextfip;
164 fip->lfi_next = nextfip;
167 nextfip->lfi_next = NULL;
168 nextfip->lfi_filter = tok[ 0 ];
169 nextfip->lfi_desc = tok[ 1 ];
170 if ( tok[ 2 ] != NULL ) {
171 if ( strcasecmp( tok[ 2 ], "subtree" ) == 0 ) {
172 nextfip->lfi_scope = LDAP_SCOPE_SUBTREE;
173 } else if ( strcasecmp( tok[ 2 ], "onelevel" ) == 0 ) {
174 nextfip->lfi_scope = LDAP_SCOPE_ONELEVEL;
175 } else if ( strcasecmp( tok[ 2 ], "base" ) == 0 ) {
176 nextfip->lfi_scope = LDAP_SCOPE_BASE;
178 free_strarray( tok );
179 ldap_getfilter_free( lfdp );
186 nextfip->lfi_scope = LDAP_SCOPE_SUBTREE; /* default */
188 nextfip->lfi_isexact = ( strchr( tok[ 0 ], '*' ) == NULL &&
189 strchr( tok[ 0 ], '~' ) == NULL );
195 free_strarray( tok );
196 ldap_getfilter_free( lfdp );
211 ldap_setfilteraffixes( LDAPFiltDesc *lfdp, char *prefix, char *suffix )
213 if ( lfdp->lfd_filtprefix != NULL ) {
214 free( lfdp->lfd_filtprefix );
216 lfdp->lfd_filtprefix = ( prefix == NULL ) ? NULL : strdup( prefix );
218 if ( lfdp->lfd_filtsuffix != NULL ) {
219 free( lfdp->lfd_filtsuffix );
221 lfdp->lfd_filtsuffix = ( suffix == NULL ) ? NULL : strdup( suffix );
226 ldap_getfirstfilter( LDAPFiltDesc *lfdp, char *tagpat, char *value )
232 if ( lfdp->lfd_curvalcopy != NULL ) {
233 free( lfdp->lfd_curvalcopy );
234 free( lfdp->lfd_curvalwords );
237 lfdp->lfd_curval = value;
238 lfdp->lfd_curfip = NULL;
240 for ( flp = lfdp->lfd_filtlist; flp != NULL; flp = flp->lfl_next ) {
241 /* compile tagpat, continue if we fail */
242 if (regcomp(&re, tagpat, 0) != 0)
245 /* match tagpatern and tag, continue if we fail */
246 rc = regexec(&re, flp->lfl_tag, 0, NULL, 0);
251 /* compile flp->ifl_pattern, continue if we fail */
252 if (regcomp(&re, flp->lfl_pattern, 0) != 0)
255 /* match ifl_pattern and lfd_curval, continue if we fail */
256 rc = regexec(&re, lfdp->lfd_curval, 0, NULL, 0);
261 /* we successfully compiled both patterns and matched both values */
262 lfdp->lfd_curfip = flp->lfl_ilist;
266 if ( lfdp->lfd_curfip == NULL ) {
270 if (( lfdp->lfd_curvalcopy = strdup( value )) == NULL ) {
274 if ( break_into_words( lfdp->lfd_curvalcopy, flp->lfl_delims,
275 &lfdp->lfd_curvalwords ) < 0 ) {
276 free( lfdp->lfd_curvalcopy );
277 lfdp->lfd_curvalcopy = NULL;
281 return( ldap_getnextfilter( lfdp ));
286 ldap_getnextfilter( LDAPFiltDesc *lfdp )
290 fip = lfdp->lfd_curfip;
296 lfdp->lfd_curfip = fip->lfi_next;
298 ldap_build_filter( lfdp->lfd_filter, LDAP_FILT_MAXSIZ, fip->lfi_filter,
299 lfdp->lfd_filtprefix, lfdp->lfd_filtsuffix, NULL,
300 lfdp->lfd_curval, lfdp->lfd_curvalwords );
301 lfdp->lfd_retfi.lfi_filter = lfdp->lfd_filter;
302 lfdp->lfd_retfi.lfi_desc = fip->lfi_desc;
303 lfdp->lfd_retfi.lfi_scope = fip->lfi_scope;
304 lfdp->lfd_retfi.lfi_isexact = fip->lfi_isexact;
306 return( &lfdp->lfd_retfi );
311 ldap_build_filter( char *filtbuf, unsigned long buflen, char *pattern,
312 char *prefix, char *suffix, char *attr, char *value, char **valwords )
316 int i, wordcount, wordnum, endwordnum;
318 if ( valwords == NULL ) {
321 for ( wordcount = 0; valwords[ wordcount ] != NULL; ++wordcount ) {
328 if ( prefix != NULL ) {
330 f += strlen( prefix );
333 for ( p = pattern; *p != '\0'; ++p ) {
337 if ( isdigit( *(p+1))) {
340 if ( *(p+1) == '-' ) {
342 if ( isdigit( *(p+1))) {
344 endwordnum = *p - '1'; /* e.g., "%v2-4" */
345 if ( endwordnum > wordcount - 1 ) {
346 endwordnum = wordcount - 1;
349 endwordnum = wordcount - 1; /* e.g., "%v2-" */
352 endwordnum = wordnum; /* e.g., "%v2" */
355 if ( wordcount > 0 ) {
356 for ( i = wordnum; i <= endwordnum; ++i ) {
357 if ( i > wordnum ) { /* add blank btw words */
360 slen = strlen( valwords[ i ] );
361 SAFEMEMCPY( f, valwords[ i ], slen );
365 } else if ( *(p+1) == '$' ) {
367 if ( wordcount > 0 ) {
368 wordnum = wordcount - 1;
369 slen = strlen( valwords[ wordnum ] );
370 SAFEMEMCPY( f, valwords[ wordnum ], slen );
373 } else if ( value != NULL ) {
374 slen = strlen( value );
375 SAFEMEMCPY( f, value, slen );
378 } else if ( *p == 'a' && attr != NULL ) {
379 slen = strlen( attr );
380 SAFEMEMCPY( f, attr, slen );
389 if ( (unsigned long) (f - filtbuf) > buflen ) {
396 if ( suffix != NULL && (
397 (unsigned long) ( f - filtbuf ) < buflen ) )
407 break_into_words( char *str, char *delims, char ***wordsp )
412 if (( words = (char **)calloc( 1, sizeof( char * ))) == NULL ) {
416 words[ count ] = NULL;
418 word = strtok( str, delims );
419 while ( word != NULL ) {
420 if (( words = (char **)realloc( words,
421 ( count + 2 ) * sizeof( char * ))) == NULL ) {
425 words[ count ] = word;
426 words[ ++count ] = NULL;
427 word = strtok( NULL, delims );