зеркало из https://github.com/mozilla/pjs.git
167 строки
5.0 KiB
C
167 строки
5.0 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 of 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 ***** */
|
|
|
|
/*
|
|
* Search the directory for all people whose surname (last name) is
|
|
* "Jensen". Since the "sn" attribute is a caseignorestring (cis), case
|
|
* is not significant when searching.
|
|
*
|
|
* Instead of calling the synchronous ldap_search_s() routine, we call
|
|
* the asynchronous routine ldap_search() and poll for results using
|
|
* ldap_result().
|
|
*
|
|
*/
|
|
|
|
#include "examples.h"
|
|
|
|
static void do_other_work();
|
|
unsigned long global_counter = 0;
|
|
|
|
int
|
|
main( int argc, char **argv )
|
|
{
|
|
LDAP *ld;
|
|
LDAPMessage *result, *e;
|
|
BerElement *ber;
|
|
char *a, *dn;
|
|
char **vals;
|
|
int i;
|
|
int rc;
|
|
int finished;
|
|
int msgid;
|
|
int num_entries = 0;
|
|
struct timeval zerotime;
|
|
|
|
zerotime.tv_sec = zerotime.tv_usec = 0L;
|
|
|
|
/* get a handle to an LDAP connection */
|
|
if ( (ld = ldap_init( MY_HOST, MY_PORT )) == NULL ) {
|
|
perror( "ldap_init" );
|
|
return( 1 );
|
|
}
|
|
/* authenticate to the directory as nobody */
|
|
if ( ldap_simple_bind_s( ld, NULL, NULL ) != LDAP_SUCCESS ) {
|
|
ldap_perror( ld, "ldap_simple_bind_s" );
|
|
return( 1 );
|
|
}
|
|
/* search for all entries with surname of Jensen */
|
|
if (( msgid = ldap_search( ld, MY_SEARCHBASE, LDAP_SCOPE_SUBTREE,
|
|
MY_FILTER, NULL, 0 )) < 0 ) {
|
|
ldap_perror( ld, "ldap_search" );
|
|
return( 1 );
|
|
}
|
|
|
|
/* Loop, polling for results until finished */
|
|
finished = 0;
|
|
while ( !finished ) {
|
|
/*
|
|
* Poll for results. We call ldap_result with the "all" argument
|
|
* set to LDAP_MSG_ONE. This causes ldap_result() to return exactly one
|
|
* entry if at least one entry is available. This allows us to
|
|
* display the entries as they are received.
|
|
*/
|
|
result = NULL;
|
|
rc = ldap_result( ld, msgid, LDAP_MSG_ONE, &zerotime, &result );
|
|
switch ( rc ) {
|
|
case -1:
|
|
/* some error occurred */
|
|
ldap_perror( ld, "ldap_result" );
|
|
return( 1 );
|
|
case 0:
|
|
/* Timeout was exceeded. No entries are ready for retrieval. */
|
|
if ( result != NULL ) {
|
|
ldap_msgfree( result );
|
|
}
|
|
break;
|
|
default:
|
|
/*
|
|
* Either an entry is ready for retrieval, or all entries have
|
|
* been retrieved.
|
|
*/
|
|
if (( e = ldap_first_entry( ld, result )) == NULL ) {
|
|
/* All done */
|
|
finished = 1;
|
|
if ( result != NULL ) {
|
|
ldap_msgfree( result );
|
|
}
|
|
continue;
|
|
}
|
|
/* for each entry print out name + all attrs and values */
|
|
num_entries++;
|
|
if (( dn = ldap_get_dn( ld, e )) != NULL ) {
|
|
printf( "dn: %s\n", dn );
|
|
ldap_memfree( dn );
|
|
}
|
|
for ( a = ldap_first_attribute( ld, e, &ber );
|
|
a != NULL; a = ldap_next_attribute( ld, e, ber ) ) {
|
|
if (( vals = ldap_get_values( ld, e, a )) != NULL ) {
|
|
for ( i = 0; vals[ i ] != NULL; i++ ) {
|
|
printf( "%s: %s\n", a, vals[ i ] );
|
|
}
|
|
ldap_value_free( vals );
|
|
}
|
|
ldap_memfree( a );
|
|
}
|
|
if ( ber != NULL ) {
|
|
ber_free( ber, 0 );
|
|
}
|
|
printf( "\n" );
|
|
ldap_msgfree( result );
|
|
}
|
|
/* Do other work here while you are waiting... */
|
|
do_other_work();
|
|
}
|
|
|
|
/* All done. Print a summary. */
|
|
printf( "%d entries retrieved. I counted to %ld "
|
|
"while I was waiting.\n", num_entries,
|
|
global_counter );
|
|
ldap_unbind( ld );
|
|
return( 0 );
|
|
}
|
|
|
|
|
|
/*
|
|
* Perform other work while polling for results. This doesn't do anything
|
|
* useful, but it could.
|
|
*/
|
|
static void
|
|
do_other_work()
|
|
{
|
|
global_counter++;
|
|
}
|