X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=libraries%2Flibldap%2Fgetentry.c;h=6e5d15eb681e4ea3a3b2425b6634f21c08e0bb05;hb=1fd3c797a822ac121a481f5ba686779d6e620ed8;hp=069b2dcbe97f2df759e56623dc3ed5ebb36e806b;hpb=138d76ecf458ca1d1fd6ca0e24183d86a8b71e92;p=openldap diff --git a/libraries/libldap/getentry.c b/libraries/libldap/getentry.c index 069b2dcbe9..6e5d15eb68 100644 --- a/libraries/libldap/getentry.c +++ b/libraries/libldap/getentry.c @@ -1,4 +1,8 @@ /* + * Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved. + * COPYING RESTRICTIONS APPLY, see COPYRIGHT file + */ +/* Portions * Copyright (c) 1990 Regents of the University of Michigan. * All rights reserved. * @@ -7,12 +11,8 @@ #include "portable.h" -#ifndef lint -static char copyright[] = "@(#) Copyright (c) 1990 Regents of the University of Michigan.\nAll rights reserved.\n"; -#endif - #include -#include +#include #include #include @@ -25,8 +25,12 @@ static char copyright[] = "@(#) Copyright (c) 1990 Regents of the University of LDAPMessage * ldap_first_entry( LDAP *ld, LDAPMessage *chain ) { - if( ld == NULL || chain == NULLMSG ) { - return NULLMSG; + assert( ld != NULL ); + assert( LDAP_VALID( ld ) ); + assert( chain != NULL ); + + if( ld == NULL || chain == NULL ) { + return NULL; } return chain->lm_msgtype == LDAP_RES_SEARCH_ENTRY @@ -34,17 +38,20 @@ ldap_first_entry( LDAP *ld, LDAPMessage *chain ) : ldap_next_entry( ld, chain ); } -/* ARGSUSED */ LDAPMessage * ldap_next_entry( LDAP *ld, LDAPMessage *entry ) { - if ( ld == NULL || entry == NULLMSG ) { - return NULLMSG; + assert( ld != NULL ); + assert( LDAP_VALID( ld ) ); + assert( entry != NULL ); + + if ( ld == NULL || entry == NULL ) { + return NULL; } for ( entry = entry->lm_chain; - entry != NULLMSG; + entry != NULL; entry = entry->lm_chain ) { if( entry->lm_msgtype == LDAP_RES_SEARCH_ENTRY ) { @@ -52,15 +59,17 @@ ldap_next_entry( LDAP *ld, LDAPMessage *entry ) } } - return( NULLMSG ); + return( NULL ); } -/* ARGSUSED */ int ldap_count_entries( LDAP *ld, LDAPMessage *chain ) { int i; + assert( ld != NULL ); + assert( LDAP_VALID( ld ) ); + if ( ld == NULL ) { return -1; } @@ -73,3 +82,51 @@ ldap_count_entries( LDAP *ld, LDAPMessage *chain ) return( i ); } + +int +ldap_get_entry_controls( + LDAP *ld, + LDAPMessage *entry, + LDAPControl ***sctrls ) +{ + int rc; + BerElement be; + + assert( ld != NULL ); + assert( LDAP_VALID( ld ) ); + assert( entry != NULL ); + assert( sctrls != NULL ); + + if ( ld == NULL || sctrls == NULL || + entry == NULL || entry->lm_msgtype == LDAP_RES_SEARCH_ENTRY ) + { + return LDAP_PARAM_ERROR; + } + + /* make a local copy of the BerElement */ + SAFEMEMCPY(&be, entry->lm_ber, sizeof(be)); + + if ( ber_scanf( &be, "{xx" /*}*/ ) == LBER_ERROR ) { + rc = LDAP_DECODING_ERROR; + goto cleanup_and_return; + } + + rc = ldap_int_get_controls( &be, sctrls ); + +cleanup_and_return: + if( rc != LDAP_SUCCESS ) { + ld->ld_errno = rc; + + if( ld->ld_matched != NULL ) { + LDAP_FREE( ld->ld_matched ); + ld->ld_matched = NULL; + } + + if( ld->ld_error != NULL ) { + LDAP_FREE( ld->ld_error ); + ld->ld_error = NULL; + } + } + + return rc; +}