openldap/tests/progs/slapd-search.c

193 lines
4.0 KiB
C
Raw Normal View History

1999-09-02 16:40:22 +08:00
/* $OpenLDAP$ */
2003-11-26 23:24:38 +08:00
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*
2005-01-02 04:49:32 +08:00
* Copyright 1999-2005 The OpenLDAP Foundation.
2003-11-26 23:24:38 +08:00
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted only as authorized by the OpenLDAP
* Public License.
*
* A copy of this license is available in file LICENSE in the
* top-level directory of the distribution or, alternatively, at
* <http://www.OpenLDAP.org/license.html>.
1999-09-02 08:56:32 +08:00
*/
2003-11-26 23:24:38 +08:00
/* ACKNOWLEDGEMENTS:
* This work was initially developed by Kurt Spanier for inclusion
* in OpenLDAP Software.
*/
#include "portable.h"
#include <stdio.h>
1999-06-03 08:37:44 +08:00
#include <ac/stdlib.h>
#include <ac/ctype.h>
1999-11-02 01:21:24 +08:00
#include <ac/param.h>
#include <ac/socket.h>
#include <ac/string.h>
#include <ac/unistd.h>
#include <ac/wait.h>
#define LDAP_DEPRECATED 1
#include <ldap.h>
#define LOOPS 100
#define RETRIES 0
static void
do_search( char *uri, char *host, int port, char *manager, char *passwd,
char *sbase, char *filter, int maxloop, int maxretries );
static void
usage( char *name )
{
fprintf( stderr, "usage: %s [-h <host>] -p port -b <searchbase> -f <searchfiter> [-l <loops>]\n",
name );
exit( EXIT_FAILURE );
}
int
main( int argc, char **argv )
{
1999-03-06 14:33:34 +08:00
int i;
char *uri = NULL;
char *host = "localhost";
int port = -1;
char *manager = NULL;
char *passwd = NULL;
char *sbase = NULL;
char *filter = NULL;
int loops = LOOPS;
int retries = RETRIES;
while ( (i = getopt( argc, argv, "b:D:f:H:h:l:p:w:r:" )) != EOF ) {
switch( i ) {
case 'H': /* the server uri */
uri = strdup( optarg );
break;
case 'h': /* the servers host */
host = strdup( optarg );
break;
case 'p': /* the servers port */
port = atoi( optarg );
break;
case 'D': /* the servers manager */
manager = strdup( optarg );
break;
case 'w': /* the server managers password */
passwd = strdup( optarg );
break;
case 'b': /* file with search base */
sbase = strdup( optarg );
break;
case 'f': /* the search request */
filter = strdup( optarg );
break;
case 'l': /* number of loops */
loops = atoi( optarg );
break;
case 'r': /* number of retries */
retries = atoi( optarg );
break;
default:
usage( argv[0] );
break;
}
}
if (( sbase == NULL ) || ( filter == NULL ) || ( port == -1 && uri == NULL ))
usage( argv[0] );
if ( *filter == '\0' ) {
fprintf( stderr, "%s: invalid EMPTY search filter.\n",
argv[0] );
exit( EXIT_FAILURE );
}
do_search( uri, host, port, manager, passwd, sbase, filter,
( 10 * loops ), retries );
exit( EXIT_SUCCESS );
}
static void
do_search( char *uri, char *host, int port, char *manager, char *passwd,
char *sbase, char *filter, int maxloop, int maxretries )
{
LDAP *ld = NULL;
int i = 0, do_retry = maxretries;
char *attrs[] = { "cn", "sn", NULL };
pid_t pid = getpid();
int rc = LDAP_SUCCESS;
retry:;
if ( uri ) {
ldap_initialize( &ld, uri );
} else {
ld = ldap_init( host, port );
}
if ( ld == NULL ) {
perror( "ldap_init" );
exit( EXIT_FAILURE );
}
{
int version = LDAP_VERSION3;
(void) ldap_set_option( ld, LDAP_OPT_PROTOCOL_VERSION,
&version );
}
if ( do_retry == maxretries ) {
fprintf( stderr, "PID=%ld - Search(%d): base=\"%s\", filter=\"%s\".\n",
(long) pid, maxloop, sbase, filter );
}
rc = ldap_bind_s( ld, manager, passwd, LDAP_AUTH_SIMPLE );
if ( rc != LDAP_SUCCESS ) {
if ( rc == LDAP_BUSY && do_retry == 1 ) {
do_retry = 0;
goto retry;
}
ldap_perror( ld, "ldap_bind" );
exit( EXIT_FAILURE );
}
for ( ; i < maxloop; i++ ) {
LDAPMessage *res;
rc = ldap_search_s( ld, sbase, LDAP_SCOPE_SUBTREE,
filter, attrs, 0, &res );
if ( rc != LDAP_SUCCESS ) {
ldap_perror( ld, "ldap_search" );
if ( rc == LDAP_BUSY && do_retry == 1 ) {
do_retry = 0;
goto retry;
}
if ( rc != LDAP_NO_SUCH_OBJECT ) break;
continue;
}
ldap_msgfree( res );
}
fprintf( stderr, " PID=%ld - Search done (%d).\n", (long) pid, rc );
ldap_unbind( ld );
}