mirror of
https://github.com/rn10950/RetroZilla.git
synced 2024-11-14 11:40:13 +01:00
186 lines
4.9 KiB
C
186 lines
4.9 KiB
C
/* ***** BEGIN LICENSE BLOCK *****
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
*
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
* the License. You may obtain a copy of the License at
|
|
* http://www.mozilla.org/MPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
* for the specific language governing rights and limitations under the
|
|
* License.
|
|
*
|
|
* The Original Code is Mozilla Communicator client code, released
|
|
* March 31, 1998.
|
|
*
|
|
* The Initial Developer of the Original Code is
|
|
* Netscape Communications Corporation.
|
|
* Portions created by the Initial Developer are Copyright (C) 1998-1999
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
*
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
* the provisions above, a recipient may use your version of this file under
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
*
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
/*
|
|
* Demonstrate use of the create filter function.
|
|
*/
|
|
|
|
#include "examples.h"
|
|
|
|
#define FILT_BUFSIZ 4096
|
|
|
|
struct filt_words {
|
|
char **f_words;
|
|
char *f_internal;
|
|
};
|
|
|
|
static int get_string_input( const char *prompt, const char *defaultval,
|
|
char *resultbuf );
|
|
static struct filt_words *val2words( const char *value, const char *delims );
|
|
static void freewords( struct filt_words *words );
|
|
|
|
|
|
int
|
|
main( int argc, char **argv )
|
|
{
|
|
int rc;
|
|
char patbuf[ FILT_BUFSIZ ];
|
|
char attrbuf[ FILT_BUFSIZ ], valuebuf[ FILT_BUFSIZ ];
|
|
char filtbuf[ FILT_BUFSIZ ];
|
|
struct filt_words *fwords;
|
|
|
|
patbuf[0] = attrbuf[0] = valuebuf[0] = '\0';
|
|
|
|
while ( 1 ) {
|
|
if ( get_string_input( "Enter a filter pattern: [%s] ", patbuf,
|
|
patbuf ) != 0 ) {
|
|
break;
|
|
}
|
|
|
|
if ( get_string_input( "Enter an attribute type: [%s] ", attrbuf,
|
|
attrbuf ) != 0 ) {
|
|
break;
|
|
}
|
|
|
|
if ( get_string_input( "Enter a value: [%s] ", valuebuf,
|
|
valuebuf ) != 0 ) {
|
|
break;
|
|
}
|
|
|
|
fwords = val2words( valuebuf, " " );
|
|
rc = ldap_create_filter( filtbuf, sizeof( filtbuf ), patbuf,
|
|
NULL, NULL, attrbuf, valuebuf, fwords->f_words );
|
|
freewords( fwords );
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
fprintf( stderr, "ldap_create_filter: failed (%d - %s)\n", rc,
|
|
ldap_err2string( rc ));
|
|
} else {
|
|
printf( "Resulting filter: %s\n", filtbuf );
|
|
}
|
|
putchar( '\n' );
|
|
}
|
|
|
|
return( 0 );
|
|
}
|
|
|
|
|
|
/*
|
|
* Prompt the user for a string. The entered string is placed in resultbuf.
|
|
* If a zero-length string is entered, i.e., if they just hit return, the
|
|
* contents of defaultval are copied to resultbuf.
|
|
* Returns 0 if all goes well and -1 if error or end of file.
|
|
*/
|
|
static int
|
|
get_string_input( const char *prompt, const char *defaultval, char *resultbuf )
|
|
{
|
|
char inbuf[ FILT_BUFSIZ ];
|
|
|
|
inbuf[0] = '\0';
|
|
printf( prompt, defaultval );
|
|
if ( fgets( inbuf, sizeof( inbuf ), stdin ) == NULL ) {
|
|
return( -1 );
|
|
}
|
|
inbuf[ strlen( inbuf ) - 1 ] = '\0'; /* strip trailing newline */
|
|
if ( inbuf[ 0 ] == '\0' ) { /* use default value */
|
|
if ( defaultval != resultbuf ) {
|
|
strcpy( resultbuf, defaultval );
|
|
}
|
|
} else { /* use newly entered value */
|
|
strcpy( resultbuf, inbuf );
|
|
}
|
|
|
|
return( 0 );
|
|
}
|
|
|
|
|
|
static struct filt_words *
|
|
val2words( const char *value, const char *delims )
|
|
{
|
|
struct filt_words *fw;
|
|
char *word;
|
|
int i;
|
|
|
|
if (( fw = calloc( 1, sizeof( struct filt_words ))) == NULL ||
|
|
( fw->f_internal = strdup( value )) == NULL ) {
|
|
perror( "calloc OR strdup" );
|
|
exit( 1 );
|
|
}
|
|
|
|
word = strtok( fw->f_internal, delims );
|
|
i = 0;
|
|
|
|
while ( word != NULL ) {
|
|
if ( fw->f_words == NULL ) {
|
|
fw->f_words = (char **)malloc( (i + 2 ) * sizeof( char * ));
|
|
} else {
|
|
fw->f_words = (char **)realloc( fw->f_words,
|
|
(i + 2 ) * sizeof( char * ));
|
|
}
|
|
|
|
if ( fw->f_words == NULL ) {
|
|
perror( "malloc OR realloc" );
|
|
exit( 1 );
|
|
}
|
|
|
|
fw->f_words[ i ] = word;
|
|
fw->f_words[ ++i ] = NULL;
|
|
word = strtok( NULL, delims );
|
|
}
|
|
|
|
if ( i > 0 ) {
|
|
fw->f_words[ i ] = NULL;
|
|
}
|
|
|
|
return( fw );
|
|
}
|
|
|
|
|
|
static void
|
|
freewords( struct filt_words *words )
|
|
{
|
|
if ( words != NULL ) {
|
|
if ( words->f_words != NULL ) {
|
|
free( words->f_words );
|
|
}
|
|
if ( words->f_internal != NULL ) {
|
|
free( words->f_internal );
|
|
}
|
|
free( words );
|
|
}
|
|
}
|