1999-09-09 03:06:24 +08:00
|
|
|
/* $OpenLDAP$ */
|
1998-08-09 08:43:13 +08:00
|
|
|
/*
|
2000-05-13 10:36:07 +08:00
|
|
|
* Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
|
1998-12-29 04:53:15 +08:00
|
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
|
|
*/
|
|
|
|
/* Portions
|
1998-08-09 08:43:13 +08:00
|
|
|
* Copyright (c) 1990 Regents of the University of Michigan.
|
|
|
|
* All rights reserved.
|
2000-06-01 01:47:33 +08:00
|
|
|
*/
|
|
|
|
/*---
|
2000-06-01 01:34:43 +08:00
|
|
|
* This notice applies to changes, created by or for Novell, Inc.,
|
|
|
|
* to preexisting works for which notices appear elsewhere in this file.
|
|
|
|
*
|
|
|
|
* Copyright (C) 1999, 2000 Novell, Inc. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* THIS WORK IS SUBJECT TO U.S. AND INTERNATIONAL COPYRIGHT LAWS AND TREATIES.
|
|
|
|
* USE, MODIFICATION, AND REDISTRIBUTION OF THIS WORK IS SUBJECT TO VERSION
|
|
|
|
* 2.0.1 OF THE OPENLDAP PUBLIC LICENSE, A COPY OF WHICH IS AVAILABLE AT
|
|
|
|
* HTTP://WWW.OPENLDAP.ORG/LICENSE.HTML OR IN THE FILE "LICENSE" IN THE
|
|
|
|
* TOP-LEVEL DIRECTORY OF THE DISTRIBUTION. ANY USE OR EXPLOITATION OF THIS
|
|
|
|
* WORK OTHER THAN AS AUTHORIZED IN VERSION 2.0.1 OF THE OPENLDAP PUBLIC
|
|
|
|
* LICENSE, OR OTHER PRIOR WRITTEN CONSENT FROM NOVELL, COULD SUBJECT THE
|
|
|
|
* PERPETRATOR TO CRIMINAL AND CIVIL LIABILITY.
|
2000-06-01 01:47:33 +08:00
|
|
|
*---
|
2000-06-01 01:34:43 +08:00
|
|
|
* Modification to OpenLDAP source by Novell, Inc.
|
|
|
|
* April 2000 sfs Add code to process V3 referrals and search results
|
1998-08-09 08:43:13 +08:00
|
|
|
*
|
|
|
|
* result.c - wait for an ldap result
|
|
|
|
*/
|
|
|
|
|
1999-06-04 03:22:33 +08:00
|
|
|
/*
|
|
|
|
* LDAPv3 (RFC2251)
|
|
|
|
* LDAPResult ::= SEQUENCE {
|
|
|
|
* resultCode ENUMERATED { ... },
|
|
|
|
* matchedDN LDAPDN,
|
|
|
|
* errorMessage LDAPString,
|
|
|
|
* referral Referral OPTIONAL
|
|
|
|
* }
|
|
|
|
* Referral ::= SEQUENCE OF LDAPURL (one or more)
|
|
|
|
* LDAPURL ::= LDAPString (limited to URL chars)
|
|
|
|
*/
|
|
|
|
|
1998-10-25 11:13:43 +08:00
|
|
|
#include "portable.h"
|
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
#include <stdio.h>
|
1999-06-03 08:37:44 +08:00
|
|
|
|
|
|
|
#include <ac/stdlib.h>
|
1998-08-21 03:42:38 +08:00
|
|
|
|
1998-10-25 11:13:43 +08:00
|
|
|
#include <ac/errno.h>
|
|
|
|
#include <ac/socket.h>
|
|
|
|
#include <ac/string.h>
|
|
|
|
#include <ac/time.h>
|
|
|
|
#include <ac/unistd.h>
|
1998-08-21 03:42:38 +08:00
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
#include "ldap-int.h"
|
|
|
|
|
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
static int ldap_abandoned LDAP_P(( LDAP *ld, ber_int_t msgid ));
|
|
|
|
static int ldap_mark_abandoned LDAP_P(( LDAP *ld, ber_int_t msgid ));
|
|
|
|
static int wait4msg LDAP_P(( LDAP *ld, ber_int_t msgid, int all, struct timeval *timeout,
|
1998-10-25 11:13:43 +08:00
|
|
|
LDAPMessage **result ));
|
1999-06-19 07:53:05 +08:00
|
|
|
static ber_tag_t try_read1msg LDAP_P(( LDAP *ld, ber_int_t msgid,
|
|
|
|
int all, Sockbuf *sb, LDAPConn *lc, LDAPMessage **result ));
|
|
|
|
static ber_tag_t build_result_ber LDAP_P(( LDAP *ld, BerElement **bp, LDAPRequest *lr ));
|
1998-10-25 11:13:43 +08:00
|
|
|
static void merge_error_info LDAP_P(( LDAP *ld, LDAPRequest *parentr, LDAPRequest *lr ));
|
2000-10-05 09:40:36 +08:00
|
|
|
static LDAPMessage * chkResponseList LDAP_P(( LDAP *ld, int msgid, int all));
|
1998-08-09 08:43:13 +08:00
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ldap_result - wait for an ldap result response to a message from the
|
2000-07-05 05:49:00 +08:00
|
|
|
* ldap server. If msgid is LDAP_RES_ANY (-1), any message will be
|
|
|
|
* accepted. If msgid is LDAP_RES_UNSOLICITED (0), any unsolicited
|
|
|
|
* message is accepted. Otherwise ldap_result will wait for a response
|
|
|
|
* with msgid. If all is LDAP_MSG_ONE (0) the first message with id
|
|
|
|
* msgid will be accepted, otherwise, ldap_result will wait for all
|
|
|
|
* responses with id msgid and then return a pointer to the entire list
|
2000-10-18 08:26:53 +08:00
|
|
|
* of messages. In general, this is only useful for search responses,
|
|
|
|
* which can be of three message types (zero or more entries, zero or
|
|
|
|
* search references, followed by an ldap result). An extension to
|
|
|
|
* LDAPv3 allows partial extended responses to be returned in response
|
|
|
|
* to any request. The type of the first message received is returned.
|
1998-08-09 08:43:13 +08:00
|
|
|
* When waiting, any messages that have been abandoned are discarded.
|
|
|
|
*
|
|
|
|
* Example:
|
|
|
|
* ldap_result( s, msgid, all, timeout, result )
|
|
|
|
*/
|
|
|
|
int
|
1999-06-29 06:20:04 +08:00
|
|
|
ldap_result(
|
|
|
|
LDAP *ld,
|
|
|
|
int msgid,
|
|
|
|
int all,
|
|
|
|
struct timeval *timeout,
|
1998-08-09 08:43:13 +08:00
|
|
|
LDAPMessage **result )
|
|
|
|
{
|
2000-10-05 09:40:36 +08:00
|
|
|
LDAPMessage *lm;
|
1998-08-09 08:43:13 +08:00
|
|
|
|
1999-05-21 11:56:17 +08:00
|
|
|
assert( ld != NULL );
|
|
|
|
assert( result != NULL );
|
|
|
|
|
2000-10-05 09:40:36 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE, "ldap_result msgid %d\n", msgid, 0, 0 );
|
1999-05-21 11:56:17 +08:00
|
|
|
|
|
|
|
if( ld == NULL ) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( result == NULL ) {
|
|
|
|
ld->ld_errno = LDAP_PARAM_ERROR;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2000-10-05 09:40:36 +08:00
|
|
|
lm = chkResponseList(ld, msgid, all);
|
|
|
|
|
|
|
|
if ( lm == NULL ) {
|
|
|
|
return( wait4msg( ld, msgid, all, timeout, result ) );
|
|
|
|
}
|
|
|
|
|
|
|
|
*result = lm;
|
|
|
|
ld->ld_errno = LDAP_SUCCESS;
|
|
|
|
return( lm->lm_msgtype );
|
|
|
|
}
|
|
|
|
|
|
|
|
static LDAPMessage *
|
2000-10-18 08:26:53 +08:00
|
|
|
chkResponseList(
|
|
|
|
LDAP *ld,
|
|
|
|
int msgid,
|
|
|
|
int all)
|
2000-10-05 09:40:36 +08:00
|
|
|
{
|
|
|
|
LDAPMessage *lm, *lastlm, *nextlm;
|
|
|
|
/*
|
|
|
|
* Look through the list of responses we have received on
|
1998-08-09 08:43:13 +08:00
|
|
|
* this association and see if the response we're interested in
|
|
|
|
* is there. If it is, return it. If not, call wait4msg() to
|
|
|
|
* wait until it arrives or timeout occurs.
|
|
|
|
*/
|
|
|
|
|
2000-10-18 08:26:53 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"ldap_chkResponseList for msgid=%d, all=%d\n",
|
2000-10-12 05:11:34 +08:00
|
|
|
msgid, all, 0 );
|
1999-06-19 07:53:05 +08:00
|
|
|
lastlm = NULL;
|
|
|
|
for ( lm = ld->ld_responses; lm != NULL; lm = nextlm ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
nextlm = lm->lm_next;
|
|
|
|
|
|
|
|
if ( ldap_abandoned( ld, lm->lm_msgid ) ) {
|
2000-10-18 08:26:53 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"ldap_chkResponseList msg abandoned, msgid %d\n",
|
2000-10-12 05:11:34 +08:00
|
|
|
msgid, 0, 0 );
|
1998-08-09 08:43:13 +08:00
|
|
|
ldap_mark_abandoned( ld, lm->lm_msgid );
|
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
if ( lastlm == NULL ) {
|
2000-10-12 05:11:34 +08:00
|
|
|
/* Remove first entry in list */
|
1998-08-09 08:43:13 +08:00
|
|
|
ld->ld_responses = lm->lm_next;
|
|
|
|
} else {
|
|
|
|
lastlm->lm_next = nextlm;
|
|
|
|
}
|
|
|
|
|
|
|
|
ldap_msgfree( lm );
|
|
|
|
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( msgid == LDAP_RES_ANY || lm->lm_msgid == msgid ) {
|
|
|
|
LDAPMessage *tmp;
|
|
|
|
|
2000-10-18 08:26:53 +08:00
|
|
|
if ( all == LDAP_MSG_ONE || msgid == LDAP_RES_UNSOLICITED ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
break;
|
2000-10-18 08:26:53 +08:00
|
|
|
}
|
1998-08-09 08:43:13 +08:00
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
for ( tmp = lm; tmp != NULL; tmp = tmp->lm_chain ) {
|
2001-03-15 11:11:52 +08:00
|
|
|
if ( tmp->lm_msgtype != LDAP_RES_SEARCH_ENTRY
|
|
|
|
&& tmp->lm_msgtype != LDAP_RES_SEARCH_REFERENCE
|
|
|
|
&& tmp->lm_msgtype != LDAP_RES_EXTENDED_PARTIAL )
|
2000-10-18 08:26:53 +08:00
|
|
|
{
|
1998-08-09 08:43:13 +08:00
|
|
|
break;
|
2000-10-18 08:26:53 +08:00
|
|
|
}
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
if ( tmp == NULL ) {
|
1999-06-29 06:20:04 +08:00
|
|
|
lm = NULL;
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
lastlm = lm;
|
|
|
|
}
|
2000-10-18 08:26:53 +08:00
|
|
|
|
2000-10-05 09:40:36 +08:00
|
|
|
if ( lm != NULL ) {
|
2000-10-12 05:11:34 +08:00
|
|
|
/* Found an entry, remove it from the list */
|
2000-10-05 09:40:36 +08:00
|
|
|
if ( lastlm == NULL ) {
|
|
|
|
ld->ld_responses = (all == LDAP_MSG_ONE && lm->lm_chain != NULL
|
|
|
|
? lm->lm_chain : lm->lm_next);
|
|
|
|
} else {
|
|
|
|
lastlm->lm_next = (all == LDAP_MSG_ONE && lm->lm_chain != NULL
|
|
|
|
? lm->lm_chain : lm->lm_next);
|
|
|
|
}
|
2000-10-18 08:26:53 +08:00
|
|
|
if ( all == LDAP_MSG_ONE && lm->lm_chain != NULL ) {
|
2000-10-05 09:40:36 +08:00
|
|
|
lm->lm_chain->lm_next = lm->lm_next;
|
|
|
|
lm->lm_chain = NULL;
|
|
|
|
}
|
|
|
|
lm->lm_next = NULL;
|
|
|
|
}
|
2000-10-12 05:11:34 +08:00
|
|
|
|
|
|
|
#ifdef LDAP_DEBUG
|
|
|
|
if( lm == NULL) {
|
2000-10-18 08:26:53 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"ldap_chkResponseList returns NULL\n", 0, 0, 0);
|
2000-10-12 05:11:34 +08:00
|
|
|
} else {
|
2000-10-18 08:26:53 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"ldap_chkResponseList returns msgid %d, type 0x%02lu\n",
|
|
|
|
lm->lm_msgid, (unsigned long) lm->lm_msgtype, 0);
|
2000-10-12 05:11:34 +08:00
|
|
|
}
|
|
|
|
#endif
|
2000-10-05 09:40:36 +08:00
|
|
|
return lm;
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
2001-03-15 11:11:52 +08:00
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
static int
|
1999-06-19 07:53:05 +08:00
|
|
|
wait4msg(
|
|
|
|
LDAP *ld,
|
|
|
|
ber_int_t msgid,
|
|
|
|
int all,
|
|
|
|
struct timeval *timeout,
|
1998-08-09 08:43:13 +08:00
|
|
|
LDAPMessage **result )
|
|
|
|
{
|
|
|
|
int rc;
|
|
|
|
struct timeval tv, *tvp;
|
1998-08-21 03:42:38 +08:00
|
|
|
time_t start_time = 0;
|
|
|
|
time_t tmp_time;
|
1998-08-09 08:43:13 +08:00
|
|
|
LDAPConn *lc, *nextlc;
|
|
|
|
|
1999-05-21 11:56:17 +08:00
|
|
|
assert( ld != NULL );
|
|
|
|
assert( result != NULL );
|
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
#ifdef LDAP_DEBUG
|
|
|
|
if ( timeout == NULL ) {
|
2000-10-05 09:40:36 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE, "wait4msg (infinite timeout), msgid %d\n",
|
|
|
|
msgid, 0, 0 );
|
1998-08-09 08:43:13 +08:00
|
|
|
} else {
|
2000-10-05 09:40:36 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE, "wait4msg (timeout %ld sec, %ld usec), msgid %d\n",
|
|
|
|
(long) timeout->tv_sec, (long) timeout->tv_usec, msgid );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
#endif /* LDAP_DEBUG */
|
|
|
|
|
|
|
|
if ( timeout == NULL ) {
|
|
|
|
tvp = NULL;
|
|
|
|
} else {
|
|
|
|
tv = *timeout;
|
|
|
|
tvp = &tv;
|
1998-08-21 03:42:38 +08:00
|
|
|
start_time = time( NULL );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
rc = -2;
|
|
|
|
while ( rc == -2 ) {
|
|
|
|
#ifdef LDAP_DEBUG
|
2000-10-12 05:11:34 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE, "wait4msg continue, msgid %d, all %d\n",
|
|
|
|
msgid, all, 0 );
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( ldap_debug & LDAP_DEBUG_TRACE ) {
|
1998-08-09 11:04:12 +08:00
|
|
|
ldap_dump_connection( ld, ld->ld_conns, 1 );
|
|
|
|
ldap_dump_requests_and_responses( ld );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
#endif /* LDAP_DEBUG */
|
|
|
|
|
2000-10-12 05:11:34 +08:00
|
|
|
if( (*result = chkResponseList(ld, msgid, all)) != NULL ) {
|
|
|
|
rc = (*result)->lm_msgtype;
|
|
|
|
} else {
|
|
|
|
|
|
|
|
for ( lc = ld->ld_conns; lc != NULL; lc = lc->lconn_next ) {
|
|
|
|
if ( ber_sockbuf_ctrl( lc->lconn_sb,
|
|
|
|
LBER_SB_OPT_DATA_READY, NULL ) ) {
|
|
|
|
rc = try_read1msg( ld, msgid, all, lc->lconn_sb,
|
|
|
|
lc, result );
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( lc == NULL ) {
|
|
|
|
rc = do_ldap_select( ld, tvp );
|
1998-08-09 08:43:13 +08:00
|
|
|
|
|
|
|
|
1998-10-25 11:13:43 +08:00
|
|
|
#ifdef LDAP_DEBUG
|
2000-10-12 05:11:34 +08:00
|
|
|
if ( rc == -1 ) {
|
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"do_ldap_select returned -1: errno %d\n",
|
|
|
|
errno, 0, 0 );
|
|
|
|
}
|
1998-08-09 08:43:13 +08:00
|
|
|
#endif
|
|
|
|
|
2000-10-12 05:11:34 +08:00
|
|
|
if ( rc == 0 || ( rc == -1 && (
|
|
|
|
!LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_RESTART)
|
|
|
|
|| errno != EINTR )))
|
|
|
|
{
|
|
|
|
ld->ld_errno = (rc == -1 ? LDAP_SERVER_DOWN :
|
|
|
|
LDAP_TIMEOUT);
|
|
|
|
return( rc );
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( rc == -1 ) {
|
|
|
|
rc = -2; /* select interrupted: loop */
|
|
|
|
} else {
|
|
|
|
rc = -2;
|
|
|
|
for ( lc = ld->ld_conns; rc == -2 && lc != NULL;
|
|
|
|
lc = nextlc ) {
|
|
|
|
nextlc = lc->lconn_next;
|
|
|
|
if ( lc->lconn_status ==
|
|
|
|
LDAP_CONNST_CONNECTED &&
|
|
|
|
ldap_is_read_ready( ld,
|
|
|
|
lc->lconn_sb )) {
|
|
|
|
rc = try_read1msg( ld, msgid, all,
|
|
|
|
lc->lconn_sb, lc, result );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if ( rc == -2 && tvp != NULL ) {
|
1998-08-21 03:42:38 +08:00
|
|
|
tmp_time = time( NULL );
|
1998-08-09 08:43:13 +08:00
|
|
|
if (( tv.tv_sec -= ( tmp_time - start_time )) <= 0 ) {
|
|
|
|
rc = 0; /* timed out */
|
|
|
|
ld->ld_errno = LDAP_TIMEOUT;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "wait4msg: %ld secs to go\n",
|
1998-11-23 09:46:32 +08:00
|
|
|
(long) tv.tv_sec, 0, 0 );
|
1998-08-09 08:43:13 +08:00
|
|
|
start_time = tmp_time;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return( rc );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
static ber_tag_t
|
|
|
|
try_read1msg(
|
|
|
|
LDAP *ld,
|
|
|
|
ber_int_t msgid,
|
|
|
|
int all,
|
|
|
|
Sockbuf *sb,
|
2001-01-11 07:48:24 +08:00
|
|
|
LDAPConn *lc,
|
1999-06-19 07:53:05 +08:00
|
|
|
LDAPMessage **result )
|
1998-08-09 08:43:13 +08:00
|
|
|
{
|
1999-03-04 00:38:56 +08:00
|
|
|
BerElement *ber;
|
1998-08-09 08:43:13 +08:00
|
|
|
LDAPMessage *new, *l, *prev, *tmp;
|
1999-06-19 07:53:05 +08:00
|
|
|
ber_int_t id;
|
|
|
|
ber_tag_t tag;
|
|
|
|
ber_len_t len;
|
1998-08-09 08:43:13 +08:00
|
|
|
int foundit = 0;
|
2000-06-01 01:34:43 +08:00
|
|
|
LDAPRequest *lr, *tmplr;
|
1998-08-09 08:43:13 +08:00
|
|
|
BerElement tmpber;
|
|
|
|
int rc, refer_cnt, hadref, simple_request;
|
1999-06-19 07:53:05 +08:00
|
|
|
ber_int_t lderr;
|
2000-06-01 01:34:43 +08:00
|
|
|
/*
|
|
|
|
* v3ref = flag for V3 referral / search reference
|
|
|
|
* 0 = not a ref, 1 = sucessfully chased ref, -1 = pass ref to application
|
|
|
|
*/
|
|
|
|
int v3ref;
|
1999-05-21 11:56:17 +08:00
|
|
|
|
|
|
|
assert( ld != NULL );
|
|
|
|
assert( lc != NULL );
|
1999-03-04 00:38:56 +08:00
|
|
|
|
2000-10-05 09:40:36 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE, "read1msg: msgid %d, all %d\n", msgid, all, 0 );
|
1999-05-21 11:56:17 +08:00
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
if ( lc->lconn_ber == NULL ) {
|
1999-05-29 03:33:05 +08:00
|
|
|
lc->lconn_ber = ldap_alloc_ber_with_options(ld);
|
|
|
|
|
|
|
|
if( lc->lconn_ber == NULL ) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ber = lc->lconn_ber;
|
2001-07-22 07:13:04 +08:00
|
|
|
assert( LBER_VALID (ber) );
|
1999-05-22 14:11:48 +08:00
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
/* get the next message */
|
1999-05-28 13:19:18 +08:00
|
|
|
errno = 0;
|
1999-03-04 00:38:56 +08:00
|
|
|
if ( (tag = ber_get_next( sb, &len, ber ))
|
1998-08-09 08:43:13 +08:00
|
|
|
!= LDAP_TAG_MESSAGE ) {
|
1999-03-04 00:38:56 +08:00
|
|
|
if ( tag == LBER_DEFAULT) {
|
|
|
|
#ifdef LDAP_DEBUG
|
|
|
|
Debug( LDAP_DEBUG_CONNS,
|
|
|
|
"ber_get_next failed.\n", 0, 0, 0 );
|
|
|
|
#endif
|
|
|
|
#ifdef EWOULDBLOCK
|
|
|
|
if (errno==EWOULDBLOCK) return -2;
|
|
|
|
#endif
|
|
|
|
#ifdef EAGAIN
|
|
|
|
if (errno == EAGAIN) return -2;
|
|
|
|
#endif
|
|
|
|
ld->ld_errno = LDAP_SERVER_DOWN;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
ld->ld_errno = LDAP_LOCAL_ERROR;
|
|
|
|
return -1;
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
1999-05-29 03:33:05 +08:00
|
|
|
/*
|
|
|
|
* We read a complete message.
|
|
|
|
* The connection should no longer need this ber.
|
|
|
|
*/
|
1999-06-19 07:53:05 +08:00
|
|
|
lc->lconn_ber = NULL;
|
1999-05-29 03:33:05 +08:00
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
/* message id */
|
1999-03-04 00:38:56 +08:00
|
|
|
if ( ber_get_int( ber, &id ) == LBER_ERROR ) {
|
1999-05-29 03:33:05 +08:00
|
|
|
ber_free( ber, 1 );
|
1998-08-09 08:43:13 +08:00
|
|
|
ld->ld_errno = LDAP_DECODING_ERROR;
|
|
|
|
return( -1 );
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if it's been abandoned, toss it */
|
1999-06-19 07:53:05 +08:00
|
|
|
if ( ldap_abandoned( ld, id ) ) {
|
1999-05-29 03:33:05 +08:00
|
|
|
ber_free( ber, 1 );
|
2000-06-01 01:34:43 +08:00
|
|
|
Debug( LDAP_DEBUG_ANY, "abandoned\n", 0, 0, 0);
|
1998-08-09 08:43:13 +08:00
|
|
|
return( -2 ); /* continue looking */
|
|
|
|
}
|
|
|
|
|
1998-08-09 11:04:12 +08:00
|
|
|
if (( lr = ldap_find_request_by_msgid( ld, id )) == NULL ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
Debug( LDAP_DEBUG_ANY,
|
|
|
|
"no request for response with msgid %ld (tossing)\n",
|
1999-09-02 16:05:17 +08:00
|
|
|
(long) id, 0, 0 );
|
1999-05-29 03:33:05 +08:00
|
|
|
ber_free( ber, 1 );
|
1998-08-09 08:43:13 +08:00
|
|
|
return( -2 ); /* continue looking */
|
|
|
|
}
|
|
|
|
|
|
|
|
/* the message type */
|
1999-03-04 00:38:56 +08:00
|
|
|
if ( (tag = ber_peek_tag( ber, &len )) == LBER_ERROR ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
ld->ld_errno = LDAP_DECODING_ERROR;
|
1999-05-29 03:33:05 +08:00
|
|
|
ber_free( ber, 1 );
|
1998-08-09 08:43:13 +08:00
|
|
|
return( -1 );
|
|
|
|
}
|
|
|
|
|
2001-01-11 07:48:24 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"ldap_read: message type %s msgid %ld, original id %ld\n",
|
2000-06-24 09:40:39 +08:00
|
|
|
ldap_int_msgtype2str( tag ),
|
2000-06-01 01:34:43 +08:00
|
|
|
(long) lr->lr_msgid, (long) lr->lr_origid );
|
1999-05-29 03:33:05 +08:00
|
|
|
|
|
|
|
id = lr->lr_origid;
|
1998-08-09 08:43:13 +08:00
|
|
|
refer_cnt = 0;
|
|
|
|
hadref = simple_request = 0;
|
|
|
|
rc = -2; /* default is to keep looking (no response found) */
|
|
|
|
lr->lr_res_msgtype = tag;
|
|
|
|
|
2000-06-01 01:34:43 +08:00
|
|
|
/*
|
|
|
|
* This code figures out if we are going to chase a
|
|
|
|
* referral / search reference, or pass it back to the application
|
|
|
|
*/
|
|
|
|
v3ref = 0; /* Assume not a V3 search reference or referral */
|
|
|
|
if( (tag != LDAP_RES_SEARCH_ENTRY) && (ld->ld_version > LDAP_VERSION2) ) {
|
|
|
|
BerElement tmpber = *ber; /* struct copy */
|
|
|
|
char **refs = NULL;
|
|
|
|
|
|
|
|
if( tag == LDAP_RES_SEARCH_REFERENCE) {
|
|
|
|
/* This is a V3 search reference */
|
|
|
|
/* Assume we do not chase the reference, but pass it to application */
|
|
|
|
v3ref = -1;
|
|
|
|
if( LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_REFERRALS) ||
|
|
|
|
(lr->lr_parent != NULL) )
|
|
|
|
{
|
|
|
|
/* Get the referral list */
|
|
|
|
if ( ber_scanf( &tmpber, "{v}", &refs ) == LBER_ERROR ) {
|
|
|
|
rc = LDAP_DECODING_ERROR;
|
|
|
|
} else {
|
|
|
|
/* Note: refs arrary is freed by ldap_chase_v3referrals */
|
|
|
|
refer_cnt = ldap_chase_v3referrals( ld, lr, refs,
|
2000-10-11 12:23:23 +08:00
|
|
|
1, &lr->lr_res_error, &hadref );
|
2000-06-01 01:34:43 +08:00
|
|
|
if ( refer_cnt > 0 ) { /* sucessfully chased reference */
|
|
|
|
/* If haven't got end search, set chasing referrals */
|
|
|
|
if( lr->lr_status != LDAP_REQST_COMPLETED) {
|
|
|
|
lr->lr_status = LDAP_REQST_CHASINGREFS;
|
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"read1msg: search ref chased, mark request chasing refs, id = %d\n",
|
|
|
|
lr->lr_msgid, 0, 0);
|
|
|
|
}
|
|
|
|
v3ref = 1; /* We sucessfully chased the reference */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* Check for V3 referral */
|
|
|
|
ber_len_t len;
|
|
|
|
if ( ber_scanf( &tmpber, "{iaa",/*}*/ &lderr,
|
|
|
|
&lr->lr_res_matched, &lr->lr_res_error )
|
|
|
|
!= LBER_ERROR ) {
|
|
|
|
/* Check if V3 referral */
|
|
|
|
if( ber_peek_tag( &tmpber, &len) == LDAP_TAG_REFERRAL ) {
|
|
|
|
/* We have a V3 referral, assume we cannot chase it */
|
|
|
|
v3ref = -1;
|
|
|
|
if( LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_REFERRALS)
|
|
|
|
|| (lr->lr_parent != NULL) )
|
|
|
|
{
|
|
|
|
v3ref = -1; /* Assume referral not chased and return it to app */
|
|
|
|
/* Get the referral list */
|
2000-06-01 01:47:33 +08:00
|
|
|
if( ber_scanf( &tmpber, "{v}", &refs) == LBER_ERROR) {
|
2000-06-01 01:34:43 +08:00
|
|
|
rc = LDAP_DECODING_ERROR;
|
|
|
|
lr->lr_status = LDAP_REQST_COMPLETED;
|
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"read1msg: referral decode error, mark request completed, id = %d\n",
|
|
|
|
lr->lr_msgid, 0, 0);
|
|
|
|
} else {
|
|
|
|
/* Chase the referral
|
|
|
|
* Note: refs arrary is freed by ldap_chase_v3referrals
|
|
|
|
*/
|
|
|
|
refer_cnt = ldap_chase_v3referrals( ld, lr, refs,
|
2000-10-11 12:23:23 +08:00
|
|
|
0, &lr->lr_res_error, &hadref );
|
2000-06-01 01:34:43 +08:00
|
|
|
lr->lr_status = LDAP_REQST_COMPLETED;
|
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"read1msg: referral chased, mark request completed, id = %d\n",
|
|
|
|
lr->lr_msgid, 0, 0);
|
|
|
|
if( refer_cnt > 0) {
|
|
|
|
v3ref = 1; /* Referral successfully chased */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2000-06-17 04:00:21 +08:00
|
|
|
|
|
|
|
if( lr->lr_res_matched != NULL ) {
|
|
|
|
LDAP_FREE( lr->lr_res_matched );
|
|
|
|
lr->lr_res_matched = NULL;
|
|
|
|
}
|
|
|
|
if( lr->lr_res_error != NULL ) {
|
|
|
|
LDAP_FREE( lr->lr_res_error );
|
|
|
|
lr->lr_res_error = NULL;
|
|
|
|
}
|
2000-06-01 01:34:43 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* All results that just return a status, i.e. don't return data
|
|
|
|
* go through the following code. This code also chases V2 referrals
|
|
|
|
* and checks if all referrals have been chased.
|
|
|
|
*/
|
|
|
|
if ( (tag != LDAP_RES_SEARCH_ENTRY) && (v3ref > -1) ) {
|
|
|
|
/* For a v3 search referral/reference, only come here if already chased it */
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( ld->ld_version >= LDAP_VERSION2 &&
|
1998-11-10 02:40:37 +08:00
|
|
|
( lr->lr_parent != NULL ||
|
1999-06-01 01:30:22 +08:00
|
|
|
LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_REFERRALS) ) )
|
1998-11-10 02:40:37 +08:00
|
|
|
{
|
1999-03-04 00:38:56 +08:00
|
|
|
tmpber = *ber; /* struct copy */
|
2000-06-01 01:34:43 +08:00
|
|
|
if ( v3ref == 1 ) {
|
|
|
|
; /* V3 search reference or V3 referral sucessfully chased */
|
2001-01-11 07:48:24 +08:00
|
|
|
} else if ( ber_scanf( &tmpber, "{iaa}", &lderr,
|
1998-08-09 08:43:13 +08:00
|
|
|
&lr->lr_res_matched, &lr->lr_res_error )
|
|
|
|
!= LBER_ERROR ) {
|
|
|
|
if ( lderr != LDAP_SUCCESS ) {
|
|
|
|
/* referrals are in error string */
|
1998-08-09 11:04:12 +08:00
|
|
|
refer_cnt = ldap_chase_referrals( ld, lr,
|
2001-01-11 07:48:24 +08:00
|
|
|
&lr->lr_res_error, -1, &hadref );
|
2000-06-01 01:34:43 +08:00
|
|
|
lr->lr_status = LDAP_REQST_COMPLETED;
|
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"read1msg: V2 referral chased, mark request completed, id = %d\n", lr->lr_msgid, 0, 0);
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* save errno, message, and matched string */
|
|
|
|
if ( !hadref || lr->lr_res_error == NULL ) {
|
|
|
|
lr->lr_res_errno = ( lderr ==
|
|
|
|
LDAP_PARTIAL_RESULTS ) ? LDAP_SUCCESS
|
|
|
|
: lderr;
|
|
|
|
} else if ( ld->ld_errno != LDAP_SUCCESS ) {
|
|
|
|
lr->lr_res_errno = ld->ld_errno;
|
|
|
|
} else {
|
|
|
|
lr->lr_res_errno = LDAP_PARTIAL_RESULTS;
|
|
|
|
}
|
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"new result: res_errno: %d, res_error: <%s>, res_matched: <%s>\n",
|
|
|
|
lr->lr_res_errno, lr->lr_res_error ? lr->lr_res_error : "",
|
|
|
|
lr->lr_res_matched ? lr->lr_res_matched : "" );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"read1msg: %d new referrals\n", refer_cnt, 0, 0 );
|
|
|
|
|
|
|
|
if ( refer_cnt != 0 ) { /* chasing referrals */
|
1999-05-29 03:33:05 +08:00
|
|
|
ber_free( ber, 1 );
|
|
|
|
ber = NULL;
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( refer_cnt < 0 ) {
|
|
|
|
return( -1 ); /* fatal error */
|
|
|
|
}
|
2000-06-01 01:34:43 +08:00
|
|
|
lr->lr_res_errno = LDAP_SUCCESS; /* sucessfully chased referral */
|
1998-08-09 08:43:13 +08:00
|
|
|
} else {
|
|
|
|
if ( lr->lr_outrefcnt <= 0 && lr->lr_parent == NULL ) {
|
|
|
|
/* request without any referrals */
|
|
|
|
simple_request = ( hadref ? 0 : 1 );
|
|
|
|
} else {
|
|
|
|
/* request with referrals or child request */
|
1999-05-29 03:33:05 +08:00
|
|
|
ber_free( ber, 1 );
|
|
|
|
ber = NULL;
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
2000-06-01 01:34:43 +08:00
|
|
|
lr->lr_status = LDAP_REQST_COMPLETED; /* declare this request done */
|
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"read1msg: mark request completed, id = %d\n", lr->lr_msgid, 0, 0);
|
1998-08-09 08:43:13 +08:00
|
|
|
while ( lr->lr_parent != NULL ) {
|
|
|
|
merge_error_info( ld, lr->lr_parent, lr );
|
|
|
|
|
|
|
|
lr = lr->lr_parent;
|
|
|
|
if ( --lr->lr_outrefcnt > 0 ) {
|
|
|
|
break; /* not completely done yet */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-06-01 01:34:43 +08:00
|
|
|
/* Check if all requests are finished, lr is now parent */
|
|
|
|
for(tmplr=lr ; tmplr != NULL; tmplr=tmplr->lr_refnext) {
|
|
|
|
if( tmplr->lr_status != LDAP_REQST_COMPLETED) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This is the parent request if the request has referrals */
|
|
|
|
if ( lr->lr_outrefcnt <= 0 && lr->lr_parent == NULL && tmplr == NULL ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
id = lr->lr_msgid;
|
|
|
|
tag = lr->lr_res_msgtype;
|
|
|
|
Debug( LDAP_DEBUG_ANY, "request %ld done\n",
|
1999-09-02 16:05:17 +08:00
|
|
|
(long) id, 0, 0 );
|
1998-08-09 08:43:13 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"res_errno: %d, res_error: <%s>, res_matched: <%s>\n",
|
|
|
|
lr->lr_res_errno, lr->lr_res_error ? lr->lr_res_error : "",
|
|
|
|
lr->lr_res_matched ? lr->lr_res_matched : "" );
|
|
|
|
if ( !simple_request ) {
|
1999-05-29 03:33:05 +08:00
|
|
|
ber_free( ber, 1 );
|
|
|
|
ber = NULL;
|
1999-06-11 02:00:04 +08:00
|
|
|
if ( build_result_ber( ld, &ber, lr )
|
1998-08-09 08:43:13 +08:00
|
|
|
== LBER_ERROR ) {
|
|
|
|
rc = -1; /* fatal error */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1998-08-09 11:04:12 +08:00
|
|
|
ldap_free_request( ld, lr );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if ( lc != NULL ) {
|
1998-08-09 11:04:12 +08:00
|
|
|
ldap_free_connection( ld, lc, 0, 1 );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-05-29 03:33:05 +08:00
|
|
|
if ( ber == NULL ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
return( rc );
|
|
|
|
}
|
|
|
|
|
|
|
|
/* make a new ldap message */
|
1999-05-29 09:19:14 +08:00
|
|
|
if ( (new = (LDAPMessage *) LDAP_CALLOC( 1, sizeof(LDAPMessage) ))
|
1998-08-09 08:43:13 +08:00
|
|
|
== NULL ) {
|
|
|
|
ld->ld_errno = LDAP_NO_MEMORY;
|
|
|
|
return( -1 );
|
|
|
|
}
|
|
|
|
new->lm_msgid = (int)id;
|
|
|
|
new->lm_msgtype = tag;
|
1999-05-29 03:33:05 +08:00
|
|
|
new->lm_ber = ber;
|
1998-08-09 08:43:13 +08:00
|
|
|
|
1998-10-25 11:13:43 +08:00
|
|
|
#ifndef LDAP_NOCACHE
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( ld->ld_cache != NULL ) {
|
1998-08-09 11:04:12 +08:00
|
|
|
ldap_add_result_to_cache( ld, new );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
1998-10-25 11:13:43 +08:00
|
|
|
#endif /* LDAP_NOCACHE */
|
1998-08-09 08:43:13 +08:00
|
|
|
|
|
|
|
/* is this the one we're looking for? */
|
|
|
|
if ( msgid == LDAP_RES_ANY || id == msgid ) {
|
2000-05-26 09:11:18 +08:00
|
|
|
if ( all == LDAP_MSG_ONE
|
1998-08-09 08:43:13 +08:00
|
|
|
|| (new->lm_msgtype != LDAP_RES_SEARCH_RESULT
|
2000-06-01 01:34:43 +08:00
|
|
|
&& new->lm_msgtype != LDAP_RES_SEARCH_ENTRY
|
|
|
|
&& new->lm_msgtype != LDAP_RES_SEARCH_REFERENCE) ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
*result = new;
|
|
|
|
ld->ld_errno = LDAP_SUCCESS;
|
|
|
|
return( tag );
|
|
|
|
} else if ( new->lm_msgtype == LDAP_RES_SEARCH_RESULT) {
|
|
|
|
foundit = 1; /* return the chain later */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* if not, we must add it to the list of responses. if
|
|
|
|
* the msgid is already there, it must be part of an existing
|
|
|
|
* search response.
|
|
|
|
*/
|
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
prev = NULL;
|
|
|
|
for ( l = ld->ld_responses; l != NULL; l = l->lm_next ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( l->lm_msgid == new->lm_msgid )
|
|
|
|
break;
|
|
|
|
prev = l;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* not part of an existing search response */
|
1999-06-19 07:53:05 +08:00
|
|
|
if ( l == NULL ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( foundit ) {
|
|
|
|
*result = new;
|
|
|
|
ld->ld_errno = LDAP_SUCCESS;
|
|
|
|
return( tag );
|
|
|
|
}
|
|
|
|
|
|
|
|
new->lm_next = ld->ld_responses;
|
|
|
|
ld->ld_responses = new;
|
|
|
|
return( -2 ); /* continue looking */
|
|
|
|
}
|
|
|
|
|
1999-09-02 16:05:17 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE, "adding response id %ld type %ld:\n",
|
|
|
|
(long) new->lm_msgid, (long) new->lm_msgtype, 0 );
|
1998-08-09 08:43:13 +08:00
|
|
|
|
|
|
|
/* part of a search response - add to end of list of entries */
|
2000-06-01 01:34:43 +08:00
|
|
|
for ( tmp = l; (tmp->lm_chain != NULL) &&
|
|
|
|
((tmp->lm_chain->lm_msgtype == LDAP_RES_SEARCH_ENTRY) ||
|
2000-06-24 09:40:39 +08:00
|
|
|
(tmp->lm_chain->lm_msgtype == LDAP_RES_SEARCH_REFERENCE) ||
|
|
|
|
(tmp->lm_chain->lm_msgtype == LDAP_RES_EXTENDED_PARTIAL ));
|
1998-08-09 08:43:13 +08:00
|
|
|
tmp = tmp->lm_chain )
|
|
|
|
; /* NULL */
|
|
|
|
tmp->lm_chain = new;
|
|
|
|
|
|
|
|
/* return the whole chain if that's what we were looking for */
|
|
|
|
if ( foundit ) {
|
1999-06-19 07:53:05 +08:00
|
|
|
if ( prev == NULL )
|
1998-08-09 08:43:13 +08:00
|
|
|
ld->ld_responses = l->lm_next;
|
|
|
|
else
|
|
|
|
prev->lm_next = l->lm_next;
|
|
|
|
*result = l;
|
|
|
|
ld->ld_errno = LDAP_SUCCESS;
|
1998-08-14 13:08:34 +08:00
|
|
|
#ifdef LDAP_WORLD_P16
|
1998-08-18 07:26:25 +08:00
|
|
|
/*
|
|
|
|
* XXX questionable fix; see text for [P16] on
|
|
|
|
* http://www.critical-angle.com/ldapworld/patch/
|
|
|
|
*
|
|
|
|
* inclusion of this patch causes searchs to hang on
|
|
|
|
* multiple platforms
|
|
|
|
*/
|
1998-08-09 11:08:09 +08:00
|
|
|
return( l->lm_msgtype );
|
1998-08-18 07:26:25 +08:00
|
|
|
#else /* LDAP_WORLD_P16 */
|
1998-08-09 08:43:13 +08:00
|
|
|
return( tag );
|
1998-08-18 07:26:25 +08:00
|
|
|
#endif /* !LDAP_WORLD_P16 */
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return( -2 ); /* continue looking */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
static ber_tag_t
|
1999-06-11 02:00:04 +08:00
|
|
|
build_result_ber( LDAP *ld, BerElement **bp, LDAPRequest *lr )
|
1998-08-09 08:43:13 +08:00
|
|
|
{
|
1999-06-19 07:53:05 +08:00
|
|
|
ber_len_t len;
|
|
|
|
ber_int_t tag;
|
|
|
|
ber_int_t along;
|
1999-06-11 02:00:04 +08:00
|
|
|
BerElement *ber;
|
|
|
|
|
1999-06-12 02:48:34 +08:00
|
|
|
*bp = NULL;
|
|
|
|
ber = ldap_alloc_ber_with_options( ld );
|
1999-06-11 02:00:04 +08:00
|
|
|
|
|
|
|
if( ber == NULL ) {
|
1999-06-12 02:48:34 +08:00
|
|
|
ld->ld_errno = LDAP_NO_MEMORY;
|
1999-06-11 02:00:04 +08:00
|
|
|
return LBER_ERROR;
|
|
|
|
}
|
1998-08-09 08:43:13 +08:00
|
|
|
|
|
|
|
if ( ber_printf( ber, "{it{ess}}", lr->lr_msgid,
|
1999-06-19 07:53:05 +08:00
|
|
|
lr->lr_res_msgtype, lr->lr_res_errno,
|
1998-08-09 08:43:13 +08:00
|
|
|
lr->lr_res_matched ? lr->lr_res_matched : "",
|
1998-11-04 21:15:18 +08:00
|
|
|
lr->lr_res_error ? lr->lr_res_error : "" ) == -1 ) {
|
1999-06-11 02:00:04 +08:00
|
|
|
|
|
|
|
ld->ld_errno = LDAP_ENCODING_ERROR;
|
1999-06-12 02:48:34 +08:00
|
|
|
ber_free(ber, 1);
|
1998-08-09 08:43:13 +08:00
|
|
|
return( LBER_ERROR );
|
|
|
|
}
|
|
|
|
|
|
|
|
ber_reset( ber, 1 );
|
1999-06-11 02:00:04 +08:00
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( ber_skip_tag( ber, &len ) == LBER_ERROR ) {
|
1999-06-11 02:00:04 +08:00
|
|
|
ld->ld_errno = LDAP_DECODING_ERROR;
|
1999-06-12 02:48:34 +08:00
|
|
|
ber_free(ber, 1);
|
1998-08-09 08:43:13 +08:00
|
|
|
return( LBER_ERROR );
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( ber_get_int( ber, &along ) == LBER_ERROR ) {
|
1999-06-11 02:00:04 +08:00
|
|
|
ld->ld_errno = LDAP_DECODING_ERROR;
|
1999-06-12 02:48:34 +08:00
|
|
|
ber_free(ber, 1);
|
1999-06-11 02:00:04 +08:00
|
|
|
return( LBER_ERROR );
|
|
|
|
}
|
|
|
|
|
|
|
|
tag = ber_peek_tag( ber, &len );
|
|
|
|
|
|
|
|
if ( tag == LBER_ERROR ) {
|
|
|
|
ld->ld_errno = LDAP_DECODING_ERROR;
|
1999-06-12 02:48:34 +08:00
|
|
|
ber_free(ber, 1);
|
1998-08-09 08:43:13 +08:00
|
|
|
return( LBER_ERROR );
|
|
|
|
}
|
|
|
|
|
1999-06-12 02:48:34 +08:00
|
|
|
*bp = ber;
|
1999-06-11 02:00:04 +08:00
|
|
|
return tag;
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
merge_error_info( LDAP *ld, LDAPRequest *parentr, LDAPRequest *lr )
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Merge error information in "lr" with "parentr" error code and string.
|
|
|
|
*/
|
|
|
|
if ( lr->lr_res_errno == LDAP_PARTIAL_RESULTS ) {
|
|
|
|
parentr->lr_res_errno = lr->lr_res_errno;
|
|
|
|
if ( lr->lr_res_error != NULL ) {
|
1998-08-09 11:04:12 +08:00
|
|
|
(void)ldap_append_referral( ld, &parentr->lr_res_error,
|
1998-08-09 08:43:13 +08:00
|
|
|
lr->lr_res_error );
|
|
|
|
}
|
|
|
|
} else if ( lr->lr_res_errno != LDAP_SUCCESS &&
|
|
|
|
parentr->lr_res_errno == LDAP_SUCCESS ) {
|
|
|
|
parentr->lr_res_errno = lr->lr_res_errno;
|
|
|
|
if ( parentr->lr_res_error != NULL ) {
|
1999-05-29 09:19:14 +08:00
|
|
|
LDAP_FREE( parentr->lr_res_error );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
parentr->lr_res_error = lr->lr_res_error;
|
|
|
|
lr->lr_res_error = NULL;
|
1999-05-19 09:12:33 +08:00
|
|
|
if ( LDAP_NAME_ERROR( lr->lr_res_errno )) {
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( parentr->lr_res_matched != NULL ) {
|
1999-05-29 09:19:14 +08:00
|
|
|
LDAP_FREE( parentr->lr_res_matched );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
parentr->lr_res_matched = lr->lr_res_matched;
|
|
|
|
lr->lr_res_matched = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "merged parent (id %d) error info: ",
|
|
|
|
parentr->lr_msgid, 0, 0 );
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "result errno %d, error <%s>, matched <%s>\n",
|
|
|
|
parentr->lr_res_errno, parentr->lr_res_error ?
|
|
|
|
parentr->lr_res_error : "", parentr->lr_res_matched ?
|
|
|
|
parentr->lr_res_matched : "" );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
1998-11-05 07:51:31 +08:00
|
|
|
int
|
|
|
|
ldap_msgtype( LDAPMessage *lm )
|
|
|
|
{
|
1999-05-21 11:56:17 +08:00
|
|
|
assert( lm != NULL );
|
1999-10-31 02:33:37 +08:00
|
|
|
return ( lm != NULL ) ? lm->lm_msgtype : -1;
|
1998-11-05 07:51:31 +08:00
|
|
|
}
|
|
|
|
|
1999-05-21 11:56:17 +08:00
|
|
|
|
1998-11-05 07:51:31 +08:00
|
|
|
int
|
|
|
|
ldap_msgid( LDAPMessage *lm )
|
|
|
|
{
|
1999-05-21 11:56:17 +08:00
|
|
|
assert( lm != NULL );
|
|
|
|
|
1999-10-31 02:33:37 +08:00
|
|
|
return ( lm != NULL ) ? lm->lm_msgid : -1;
|
1998-11-05 07:51:31 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-06-24 09:40:39 +08:00
|
|
|
char * ldap_int_msgtype2str( ber_tag_t tag )
|
|
|
|
{
|
|
|
|
switch( tag ) {
|
|
|
|
case LDAP_RES_ADD: return "add";
|
|
|
|
case LDAP_RES_BIND: return "bind";
|
|
|
|
case LDAP_RES_COMPARE: return "compare";
|
|
|
|
case LDAP_RES_DELETE: return "delete";
|
|
|
|
case LDAP_RES_EXTENDED: return "extended-result";
|
|
|
|
case LDAP_RES_EXTENDED_PARTIAL: return "extended-partial";
|
|
|
|
case LDAP_RES_MODIFY: return "modify";
|
|
|
|
case LDAP_RES_RENAME: return "rename";
|
|
|
|
case LDAP_RES_SEARCH_ENTRY: return "search-entry";
|
|
|
|
case LDAP_RES_SEARCH_REFERENCE: return "search-reference";
|
|
|
|
case LDAP_RES_SEARCH_RESULT: return "search-result";
|
|
|
|
}
|
|
|
|
return "unknown";
|
|
|
|
}
|
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
int
|
|
|
|
ldap_msgfree( LDAPMessage *lm )
|
|
|
|
{
|
|
|
|
LDAPMessage *next;
|
|
|
|
int type = 0;
|
|
|
|
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "ldap_msgfree\n", 0, 0, 0 );
|
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
for ( ; lm != NULL; lm = next ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
next = lm->lm_chain;
|
|
|
|
type = lm->lm_msgtype;
|
|
|
|
ber_free( lm->lm_ber, 1 );
|
1999-05-29 09:19:14 +08:00
|
|
|
LDAP_FREE( (char *) lm );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return( type );
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ldap_msgdelete - delete a message. It returns:
|
|
|
|
* 0 if the entire message was deleted
|
|
|
|
* -1 if the message was not found, or only part of it was found
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
ldap_msgdelete( LDAP *ld, int msgid )
|
|
|
|
{
|
|
|
|
LDAPMessage *lm, *prev;
|
|
|
|
|
1999-05-21 11:56:17 +08:00
|
|
|
assert( ld != NULL );
|
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE, "ldap_msgdelete\n", 0, 0, 0 );
|
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
prev = NULL;
|
|
|
|
for ( lm = ld->ld_responses; lm != NULL; lm = lm->lm_next ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( lm->lm_msgid == msgid )
|
|
|
|
break;
|
|
|
|
prev = lm;
|
|
|
|
}
|
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
if ( lm == NULL )
|
1998-08-09 08:43:13 +08:00
|
|
|
return( -1 );
|
|
|
|
|
1999-06-19 07:53:05 +08:00
|
|
|
if ( prev == NULL )
|
1998-08-09 08:43:13 +08:00
|
|
|
ld->ld_responses = lm->lm_next;
|
|
|
|
else
|
|
|
|
prev->lm_next = lm->lm_next;
|
|
|
|
|
|
|
|
if ( ldap_msgfree( lm ) == LDAP_RES_SEARCH_ENTRY )
|
|
|
|
return( -1 );
|
|
|
|
|
|
|
|
return( 0 );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* return 1 if message msgid is waiting to be abandoned, 0 otherwise
|
|
|
|
*/
|
|
|
|
static int
|
1999-06-19 07:53:05 +08:00
|
|
|
ldap_abandoned( LDAP *ld, ber_int_t msgid )
|
1998-08-09 08:43:13 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if ( ld->ld_abandoned == NULL )
|
|
|
|
return( 0 );
|
|
|
|
|
|
|
|
for ( i = 0; ld->ld_abandoned[i] != -1; i++ )
|
|
|
|
if ( ld->ld_abandoned[i] == msgid )
|
|
|
|
return( 1 );
|
|
|
|
|
|
|
|
return( 0 );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int
|
1999-06-19 07:53:05 +08:00
|
|
|
ldap_mark_abandoned( LDAP *ld, ber_int_t msgid )
|
1998-08-09 08:43:13 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if ( ld->ld_abandoned == NULL )
|
|
|
|
return( -1 );
|
|
|
|
|
|
|
|
for ( i = 0; ld->ld_abandoned[i] != -1; i++ )
|
|
|
|
if ( ld->ld_abandoned[i] == msgid )
|
|
|
|
break;
|
|
|
|
|
|
|
|
if ( ld->ld_abandoned[i] == -1 )
|
|
|
|
return( -1 );
|
|
|
|
|
|
|
|
for ( ; ld->ld_abandoned[i] != -1; i++ ) {
|
|
|
|
ld->ld_abandoned[i] = ld->ld_abandoned[i + 1];
|
|
|
|
}
|
|
|
|
|
|
|
|
return( 0 );
|
|
|
|
}
|