1 /* result.c - wait for an ldap result */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-2004 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
16 /* Portions Copyright (c) 1990 Regents of the University of Michigan.
17 * All rights reserved.
19 /* This notice applies to changes, created by or for Novell, Inc.,
20 * to preexisting works for which notices appear elsewhere in this file.
22 * Copyright (C) 1999, 2000 Novell, Inc. All Rights Reserved.
24 * THIS WORK IS SUBJECT TO U.S. AND INTERNATIONAL COPYRIGHT LAWS AND TREATIES.
25 * USE, MODIFICATION, AND REDISTRIBUTION OF THIS WORK IS SUBJECT TO VERSION
26 * 2.0.1 OF THE OPENLDAP PUBLIC LICENSE, A COPY OF WHICH IS AVAILABLE AT
27 * HTTP://WWW.OPENLDAP.ORG/LICENSE.HTML OR IN THE FILE "LICENSE" IN THE
28 * TOP-LEVEL DIRECTORY OF THE DISTRIBUTION. ANY USE OR EXPLOITATION OF THIS
29 * WORK OTHER THAN AS AUTHORIZED IN VERSION 2.0.1 OF THE OPENLDAP PUBLIC
30 * LICENSE, OR OTHER PRIOR WRITTEN CONSENT FROM NOVELL, COULD SUBJECT THE
31 * PERPETRATOR TO CRIMINAL AND CIVIL LIABILITY.
33 * Modification to OpenLDAP source by Novell, Inc.
34 * April 2000 sfs Add code to process V3 referrals and search results
36 * Note: A verbatim copy of version 2.0.1 of the OpenLDAP Public License
37 * can be found in the file "build/LICENSE-2.0.1" in this distribution
38 * of OpenLDAP Software.
40 /* Portions Copyright (C) The Internet Society (1997)
41 * ASN.1 fragments are from RFC 2251; see RFC for full legal notices.
46 * LDAPResult ::= SEQUENCE {
47 * resultCode ENUMERATED { ... },
49 * errorMessage LDAPString,
50 * referral Referral OPTIONAL
52 * Referral ::= SEQUENCE OF LDAPURL (one or more)
53 * LDAPURL ::= LDAPString (limited to URL chars)
60 #include <ac/stdlib.h>
63 #include <ac/socket.h>
64 #include <ac/string.h>
66 #include <ac/unistd.h>
71 static int ldap_abandoned LDAP_P(( LDAP *ld, ber_int_t msgid ));
72 static int ldap_mark_abandoned LDAP_P(( LDAP *ld, ber_int_t msgid ));
73 static int wait4msg LDAP_P(( LDAP *ld, ber_int_t msgid, int all, struct timeval *timeout,
74 LDAPMessage **result ));
75 static ber_tag_t try_read1msg LDAP_P(( LDAP *ld, ber_int_t msgid,
76 int all, Sockbuf *sb, LDAPConn **lc, LDAPMessage **result ));
77 static ber_tag_t build_result_ber LDAP_P(( LDAP *ld, BerElement **bp, LDAPRequest *lr ));
78 static void merge_error_info LDAP_P(( LDAP *ld, LDAPRequest *parentr, LDAPRequest *lr ));
79 static LDAPMessage * chkResponseList LDAP_P(( LDAP *ld, int msgid, int all));
83 * ldap_result - wait for an ldap result response to a message from the
84 * ldap server. If msgid is LDAP_RES_ANY (-1), any message will be
85 * accepted. If msgid is LDAP_RES_UNSOLICITED (0), any unsolicited
86 * message is accepted. Otherwise ldap_result will wait for a response
87 * with msgid. If all is LDAP_MSG_ONE (0) the first message with id
88 * msgid will be accepted, otherwise, ldap_result will wait for all
89 * responses with id msgid and then return a pointer to the entire list
90 * of messages. In general, this is only useful for search responses,
91 * which can be of three message types (zero or more entries, zero or
92 * search references, followed by an ldap result). An extension to
93 * LDAPv3 allows partial extended responses to be returned in response
94 * to any request. The type of the first message received is returned.
95 * When waiting, any messages that have been abandoned are discarded.
98 * ldap_result( s, msgid, all, timeout, result )
105 struct timeval *timeout,
106 LDAPMessage **result )
111 assert( ld != NULL );
112 assert( result != NULL );
114 Debug( LDAP_DEBUG_TRACE, "ldap_result msgid %d\n", msgid, 0, 0 );
116 #ifdef LDAP_R_COMPILE
117 ldap_pvt_thread_mutex_lock( &ld->ld_res_mutex );
119 lm = chkResponseList(ld, msgid, all);
122 rc = wait4msg( ld, msgid, all, timeout, result );
125 ld->ld_errno = LDAP_SUCCESS;
128 #ifdef LDAP_R_COMPILE
129 ldap_pvt_thread_mutex_unlock( &ld->ld_res_mutex );
140 LDAPMessage *lm, *lastlm, *nextlm;
142 * Look through the list of responses we have received on
143 * this association and see if the response we're interested in
144 * is there. If it is, return it. If not, call wait4msg() to
145 * wait until it arrives or timeout occurs.
148 Debug( LDAP_DEBUG_TRACE,
149 "ldap_chkResponseList for msgid=%d, all=%d\n",
152 for ( lm = ld->ld_responses; lm != NULL; lm = nextlm ) {
153 nextlm = lm->lm_next;
155 if ( ldap_abandoned( ld, lm->lm_msgid ) ) {
156 Debug( LDAP_DEBUG_TRACE,
157 "ldap_chkResponseList msg abandoned, msgid %d\n",
159 ldap_mark_abandoned( ld, lm->lm_msgid );
161 if ( lastlm == NULL ) {
162 /* Remove first entry in list */
163 ld->ld_responses = lm->lm_next;
165 lastlm->lm_next = nextlm;
173 if ( msgid == LDAP_RES_ANY || lm->lm_msgid == msgid ) {
176 if ( all == LDAP_MSG_ONE || msgid == LDAP_RES_UNSOLICITED ) {
180 for ( tmp = lm; tmp != NULL; tmp = tmp->lm_chain ) {
181 if ( tmp->lm_msgtype != LDAP_RES_SEARCH_ENTRY
182 && tmp->lm_msgtype != LDAP_RES_SEARCH_REFERENCE
183 && tmp->lm_msgtype != LDAP_RES_INTERMEDIATE )
199 /* Found an entry, remove it from the list */
200 if ( lastlm == NULL ) {
201 ld->ld_responses = (all == LDAP_MSG_ONE && lm->lm_chain != NULL
202 ? lm->lm_chain : lm->lm_next);
204 lastlm->lm_next = (all == LDAP_MSG_ONE && lm->lm_chain != NULL
205 ? lm->lm_chain : lm->lm_next);
207 if ( all == LDAP_MSG_ONE && lm->lm_chain != NULL ) {
208 lm->lm_chain->lm_next = lm->lm_next;
216 Debug( LDAP_DEBUG_TRACE,
217 "ldap_chkResponseList returns NULL\n", 0, 0, 0);
219 Debug( LDAP_DEBUG_TRACE,
220 "ldap_chkResponseList returns msgid %d, type 0x%02lu\n",
221 lm->lm_msgid, (unsigned long) lm->lm_msgtype, 0);
232 struct timeval *timeout,
233 LDAPMessage **result )
236 struct timeval tv, *tvp;
237 time_t start_time = 0;
239 LDAPConn *lc, *nextlc;
241 assert( ld != NULL );
242 assert( result != NULL );
245 if ( timeout == NULL ) {
246 Debug( LDAP_DEBUG_TRACE, "wait4msg (infinite timeout), msgid %d\n",
249 Debug( LDAP_DEBUG_TRACE, "wait4msg (timeout %ld sec, %ld usec), msgid %d\n",
250 (long) timeout->tv_sec, (long) timeout->tv_usec, msgid );
252 #endif /* LDAP_DEBUG */
254 if ( timeout == NULL ) {
259 start_time = time( NULL );
265 Debug( LDAP_DEBUG_TRACE, "wait4msg continue, msgid %d, all %d\n",
267 if ( ldap_debug & LDAP_DEBUG_TRACE ) {
268 ldap_dump_connection( ld, ld->ld_conns, 1 );
269 ldap_dump_requests_and_responses( ld );
271 #endif /* LDAP_DEBUG */
273 if( (*result = chkResponseList(ld, msgid, all)) != NULL ) {
274 rc = (*result)->lm_msgtype;
278 for ( lc = ld->ld_conns; lc != NULL; lc = nextlc ) {
279 nextlc = lc->lconn_next;
280 if ( ber_sockbuf_ctrl( lc->lconn_sb,
281 LBER_SB_OPT_DATA_READY, NULL ) ) {
282 rc = try_read1msg( ld, msgid, all, lc->lconn_sb,
290 rc = ldap_int_select( ld, tvp );
293 Debug( LDAP_DEBUG_TRACE,
294 "ldap_int_select returned -1: errno %d\n",
299 if ( rc == 0 || ( rc == -1 && (
300 !LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_RESTART)
301 || errno != EINTR )))
303 ld->ld_errno = (rc == -1 ? LDAP_SERVER_DOWN :
309 rc = -2; /* select interrupted: loop */
312 #ifdef LDAP_R_COMPILE
313 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
315 if ( ld->ld_requests &&
316 ld->ld_requests->lr_status == LDAP_REQST_WRITING &&
317 ldap_is_write_ready( ld,
318 ld->ld_requests->lr_conn->lconn_sb ) ) {
319 ldap_int_flush_request( ld, ld->ld_requests );
321 #ifdef LDAP_R_COMPILE
322 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
324 for ( lc = ld->ld_conns; rc == -2 && lc != NULL;
326 nextlc = lc->lconn_next;
327 if ( lc->lconn_status ==
328 LDAP_CONNST_CONNECTED &&
329 ldap_is_read_ready( ld,
331 rc = try_read1msg( ld, msgid, all,
332 lc->lconn_sb, &lc, result );
333 if ( lc == NULL ) lc = nextlc;
340 if ( rc == -2 && tvp != NULL ) {
341 tmp_time = time( NULL );
342 if (( tv.tv_sec -= ( tmp_time - start_time )) <= 0 ) {
343 rc = 0; /* timed out */
344 ld->ld_errno = LDAP_TIMEOUT;
348 Debug( LDAP_DEBUG_TRACE, "wait4msg: %ld secs to go\n",
349 (long) tv.tv_sec, 0, 0 );
350 start_time = tmp_time;
365 LDAPMessage **result )
368 LDAPMessage *new, *l, *prev, *tmp;
373 LDAPRequest *lr, *tmplr;
376 int rc, refer_cnt, hadref, simple_request;
378 #ifdef LDAP_CONNECTIONLESS
379 int firstmsg = 1, moremsgs = 0, isv2 = 0;
382 * v3ref = flag for V3 referral / search reference
383 * 0 = not a ref, 1 = sucessfully chased ref, -1 = pass ref to application
387 assert( ld != NULL );
388 assert( lcp != NULL );
389 assert( *lcp != NULL );
391 Debug( LDAP_DEBUG_TRACE, "read1msg: msgid %d, all %d\n", msgid, all, 0 );
396 if ( lc->lconn_ber == NULL ) {
397 lc->lconn_ber = ldap_alloc_ber_with_options(ld);
399 if( lc->lconn_ber == NULL ) {
405 assert( LBER_VALID (ber) );
407 /* get the next message */
409 #ifdef LDAP_CONNECTIONLESS
410 if ( LDAP_IS_UDP(ld) ) {
411 struct sockaddr from;
412 ber_int_sb_read(sb, &from, sizeof(struct sockaddr));
413 if (ld->ld_options.ldo_version == LDAP_VERSION2) isv2=1;
417 tag = ber_get_next( sb, &len, ber );
418 if ( tag == LDAP_TAG_MESSAGE ) {
420 * We read a complete message.
421 * The connection should no longer need this ber.
423 lc->lconn_ber = NULL;
425 if ( tag != LDAP_TAG_MESSAGE ) {
426 if ( tag == LBER_DEFAULT) {
428 Debug( LDAP_DEBUG_CONNS,
429 "ber_get_next failed.\n", 0, 0, 0 );
432 if (errno==EWOULDBLOCK) return -2;
435 if (errno == EAGAIN) return -2;
437 ld->ld_errno = LDAP_SERVER_DOWN;
440 ld->ld_errno = LDAP_LOCAL_ERROR;
445 if ( ber_get_int( ber, &id ) == LBER_ERROR ) {
447 ld->ld_errno = LDAP_DECODING_ERROR;
451 /* if it's been abandoned, toss it */
452 if ( ldap_abandoned( ld, id ) ) {
453 Debug( LDAP_DEBUG_ANY, "abandoned\n", 0, 0, 0);
456 if ( ber_sockbuf_ctrl( sb, LBER_SB_OPT_DATA_READY, NULL ) ) {
459 return( -2 ); /* continue looking */
462 if (( lr = ldap_find_request_by_msgid( ld, id )) == NULL ) {
463 Debug( LDAP_DEBUG_ANY,
464 "no request for response with msgid %ld (tossing)\n",
468 #ifdef LDAP_CONNECTIONLESS
469 if (LDAP_IS_UDP(ld) && isv2) {
470 ber_scanf(ber, "x{");
474 /* the message type */
475 if ( (tag = ber_peek_tag( ber, &len )) == LBER_ERROR ) {
476 ld->ld_errno = LDAP_DECODING_ERROR;
481 Debug( LDAP_DEBUG_TRACE,
482 "ldap_read: message type %s msgid %ld, original id %ld\n",
483 ldap_int_msgtype2str( tag ),
484 (long) lr->lr_msgid, (long) lr->lr_origid );
488 hadref = simple_request = 0;
489 rc = -2; /* default is to keep looking (no response found) */
490 lr->lr_res_msgtype = tag;
493 * This code figures out if we are going to chase a
494 * referral / search reference, or pass it back to the application
496 v3ref = 0; /* Assume not a V3 search reference or referral */
497 if( (tag != LDAP_RES_SEARCH_ENTRY) && (ld->ld_version > LDAP_VERSION2) ) {
498 BerElement tmpber = *ber; /* struct copy */
501 if( tag == LDAP_RES_SEARCH_REFERENCE) {
502 /* This is a V3 search reference */
503 /* Assume we do not chase the reference, but pass it to application */
505 if( LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_REFERRALS) ||
506 (lr->lr_parent != NULL) )
508 /* Get the referral list */
509 if ( ber_scanf( &tmpber, "{v}", &refs ) == LBER_ERROR ) {
510 rc = LDAP_DECODING_ERROR;
512 /* Note: refs arrary is freed by ldap_chase_v3referrals */
513 refer_cnt = ldap_chase_v3referrals( ld, lr, refs,
514 1, &lr->lr_res_error, &hadref );
515 if ( refer_cnt > 0 ) { /* sucessfully chased reference */
516 /* If haven't got end search, set chasing referrals */
517 if( lr->lr_status != LDAP_REQST_COMPLETED) {
518 lr->lr_status = LDAP_REQST_CHASINGREFS;
519 Debug( LDAP_DEBUG_TRACE,
520 "read1msg: search ref chased, mark request chasing refs, id = %d\n",
523 v3ref = 1; /* We sucessfully chased the reference */
528 /* Check for V3 referral */
530 if ( ber_scanf( &tmpber, "{iaa",/*}*/ &lderr,
531 &lr->lr_res_matched, &lr->lr_res_error )
533 /* Check if V3 referral */
534 if( ber_peek_tag( &tmpber, &len) == LDAP_TAG_REFERRAL ) {
535 /* We have a V3 referral, assume we cannot chase it */
537 if( LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_REFERRALS)
538 || (lr->lr_parent != NULL) )
540 v3ref = -1; /* Assume referral not chased and return it to app */
541 /* Get the referral list */
542 if( ber_scanf( &tmpber, "{v}", &refs) == LBER_ERROR) {
543 rc = LDAP_DECODING_ERROR;
544 lr->lr_status = LDAP_REQST_COMPLETED;
545 Debug( LDAP_DEBUG_TRACE,
546 "read1msg: referral decode error, mark request completed, id = %d\n",
549 /* Chase the referral
550 * Note: refs arrary is freed by ldap_chase_v3referrals
552 refer_cnt = ldap_chase_v3referrals( ld, lr, refs,
553 0, &lr->lr_res_error, &hadref );
554 lr->lr_status = LDAP_REQST_COMPLETED;
555 Debug( LDAP_DEBUG_TRACE,
556 "read1msg: referral chased, mark request completed, id = %d\n",
559 v3ref = 1; /* Referral successfully chased */
565 if( lr->lr_res_matched != NULL ) {
566 LDAP_FREE( lr->lr_res_matched );
567 lr->lr_res_matched = NULL;
569 if( lr->lr_res_error != NULL ) {
570 LDAP_FREE( lr->lr_res_error );
571 lr->lr_res_error = NULL;
577 /* All results that just return a status, i.e. don't return data
578 * go through the following code. This code also chases V2 referrals
579 * and checks if all referrals have been chased.
581 if ( (tag != LDAP_RES_SEARCH_ENTRY) && (v3ref > -1) &&
582 (tag != LDAP_RES_INTERMEDIATE ))
584 /* For a v3 search referral/reference, only come here if already chased it */
585 if ( ld->ld_version >= LDAP_VERSION2 &&
586 ( lr->lr_parent != NULL ||
587 LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_REFERRALS) ) )
589 tmpber = *ber; /* struct copy */
591 /* V3 search reference or V3 referral
592 * sucessfully chased. If this message
593 * is a search result, then it has no more
594 * outstanding referrals.
596 if ( tag == LDAP_RES_SEARCH_RESULT )
598 } else if ( ber_scanf( &tmpber, "{iaa}", &lderr,
599 &lr->lr_res_matched, &lr->lr_res_error )
601 if ( lderr != LDAP_SUCCESS ) {
602 /* referrals are in error string */
603 refer_cnt = ldap_chase_referrals( ld, lr,
604 &lr->lr_res_error, -1, &hadref );
605 lr->lr_status = LDAP_REQST_COMPLETED;
606 Debug( LDAP_DEBUG_TRACE,
607 "read1msg: V2 referral chased, mark request completed, id = %d\n", lr->lr_msgid, 0, 0);
610 /* save errno, message, and matched string */
611 if ( !hadref || lr->lr_res_error == NULL ) {
612 lr->lr_res_errno = ( lderr ==
613 LDAP_PARTIAL_RESULTS ) ? LDAP_SUCCESS
615 } else if ( ld->ld_errno != LDAP_SUCCESS ) {
616 lr->lr_res_errno = ld->ld_errno;
618 lr->lr_res_errno = LDAP_PARTIAL_RESULTS;
620 Debug( LDAP_DEBUG_TRACE,
621 "new result: res_errno: %d, res_error: <%s>, res_matched: <%s>\n",
622 lr->lr_res_errno, lr->lr_res_error ? lr->lr_res_error : "",
623 lr->lr_res_matched ? lr->lr_res_matched : "" );
627 Debug( LDAP_DEBUG_TRACE,
628 "read1msg: %d new referrals\n", refer_cnt, 0, 0 );
630 if ( refer_cnt != 0 ) { /* chasing referrals */
633 if ( refer_cnt < 0 ) {
634 return( -1 ); /* fatal error */
636 lr->lr_res_errno = LDAP_SUCCESS; /* sucessfully chased referral */
638 if ( lr->lr_outrefcnt <= 0 && lr->lr_parent == NULL ) {
639 /* request without any referrals */
640 simple_request = ( hadref ? 0 : 1 );
642 /* request with referrals or child request */
647 lr->lr_status = LDAP_REQST_COMPLETED; /* declare this request done */
648 Debug( LDAP_DEBUG_TRACE,
649 "read1msg: mark request completed, id = %d\n", lr->lr_msgid, 0, 0);
650 while ( lr->lr_parent != NULL ) {
651 merge_error_info( ld, lr->lr_parent, lr );
654 if ( --lr->lr_outrefcnt > 0 ) {
655 break; /* not completely done yet */
659 /* Check if all requests are finished, lr is now parent */
661 if (tmplr->lr_status == LDAP_REQST_COMPLETED) {
662 for(tmplr=lr->lr_child; tmplr != NULL; tmplr=tmplr->lr_refnext) {
663 if( tmplr->lr_status != LDAP_REQST_COMPLETED) {
669 /* This is the parent request if the request has referrals */
670 if ( lr->lr_outrefcnt <= 0 && lr->lr_parent == NULL && tmplr == NULL ) {
672 tag = lr->lr_res_msgtype;
673 Debug( LDAP_DEBUG_ANY, "request %ld done\n",
675 Debug( LDAP_DEBUG_TRACE,
676 "res_errno: %d, res_error: <%s>, res_matched: <%s>\n",
677 lr->lr_res_errno, lr->lr_res_error ? lr->lr_res_error : "",
678 lr->lr_res_matched ? lr->lr_res_matched : "" );
679 if ( !simple_request ) {
682 if ( build_result_ber( ld, &ber, lr )
684 rc = -1; /* fatal error */
688 ldap_free_request( ld, lr );
692 ldap_free_connection( ld, lc, 0, 1 );
702 /* make a new ldap message */
703 if ( (new = (LDAPMessage *) LDAP_CALLOC( 1, sizeof(LDAPMessage) ))
705 ld->ld_errno = LDAP_NO_MEMORY;
708 new->lm_msgid = (int)id;
709 new->lm_msgtype = tag;
712 #ifdef LDAP_CONNECTIONLESS
713 /* CLDAP replies all fit in a single datagram. In LDAPv2 RFC1798
714 * the responses are all a sequence wrapped in one message. In
715 * LDAPv3 each response is in its own message. The datagram must
716 * end with a SearchResult. We can't just parse each response in
717 * separate calls to try_read1msg because the header info is only
718 * present at the beginning of the datagram, not at the beginning
719 * of each response. So parse all the responses at once and queue
720 * them up, then pull off the first response to return to the
721 * caller when all parsing is complete.
723 if ( LDAP_IS_UDP(ld) ) {
724 /* If not a result, look for more */
725 if ( tag != LDAP_RES_SEARCH_RESULT ) {
729 /* LDAPv2: dup the current ber, skip past the current
730 * response, and see if there are any more after it.
732 ber = ber_dup( ber );
733 ber_scanf( ber, "x" );
734 if (ber_peek_tag(ber, &len) != LBER_DEFAULT) {
735 /* There's more - dup the ber buffer so they can all be
736 * individually freed by ldap_msgfree.
739 ber_get_option(ber, LBER_OPT_BER_REMAINING_BYTES, &len);
740 bv.bv_val = LDAP_MALLOC(len);
743 ber_read(ber, bv.bv_val, len);
745 ber_init2(ber, &bv, ld->ld_lberoptions );
749 /* LDAPv3: Just allocate a new ber. Since this is a buffered
750 * datagram, if the sockbuf is readable we still have data
753 ber = ldap_alloc_ber_with_options(ld);
754 if (ber_sockbuf_ctrl(sb, LBER_SB_OPT_DATA_READY, NULL)) ok=1;
756 /* set up response chain */
759 new->lm_next = ld->ld_responses;
760 ld->ld_responses = new;
765 /* "ok" means there's more to parse */
767 if (isv2) goto nextresp2;
770 /* got to end of datagram without a SearchResult. Free
771 * our dup'd ber, but leave any buffer alone. For v2 case,
772 * the previous response is still using this buffer. For v3,
773 * the new ber has no buffer to free yet.
778 } else if ( moremsgs ) {
779 /* got search result, and we had multiple responses in 1 datagram.
780 * stick the result onto the end of the chain, and then pull the
781 * first response off the head of the chain.
784 *result = chkResponseList( ld, msgid, all );
785 ld->ld_errno = LDAP_SUCCESS;
786 return( (*result)->lm_msgtype );
791 /* is this the one we're looking for? */
792 if ( msgid == LDAP_RES_ANY || id == msgid ) {
793 if ( all == LDAP_MSG_ONE
794 || (new->lm_msgtype != LDAP_RES_SEARCH_RESULT
795 && new->lm_msgtype != LDAP_RES_SEARCH_ENTRY
796 && new->lm_msgtype != LDAP_RES_SEARCH_REFERENCE) ) {
798 ld->ld_errno = LDAP_SUCCESS;
800 } else if ( new->lm_msgtype == LDAP_RES_SEARCH_RESULT) {
801 foundit = 1; /* return the chain later */
806 * if not, we must add it to the list of responses. if
807 * the msgid is already there, it must be part of an existing
812 for ( l = ld->ld_responses; l != NULL; l = l->lm_next ) {
813 if ( l->lm_msgid == new->lm_msgid )
818 /* not part of an existing search response */
825 new->lm_next = ld->ld_responses;
826 ld->ld_responses = new;
830 Debug( LDAP_DEBUG_TRACE, "adding response id %ld type %ld:\n",
831 (long) new->lm_msgid, (long) new->lm_msgtype, 0 );
833 /* part of a search response - add to end of list of entries */
834 for ( tmp = l; (tmp->lm_chain != NULL) &&
835 ((tmp->lm_chain->lm_msgtype == LDAP_RES_SEARCH_ENTRY) ||
836 (tmp->lm_chain->lm_msgtype == LDAP_RES_SEARCH_REFERENCE) ||
837 (tmp->lm_chain->lm_msgtype == LDAP_RES_INTERMEDIATE ));
838 tmp = tmp->lm_chain )
842 /* return the whole chain if that's what we were looking for */
845 ld->ld_responses = l->lm_next;
847 prev->lm_next = l->lm_next;
853 ld->ld_errno = LDAP_SUCCESS;
856 if ( ber_sockbuf_ctrl( sb, LBER_SB_OPT_DATA_READY, NULL ) ) {
859 return( -2 ); /* continue looking */
864 build_result_ber( LDAP *ld, BerElement **bp, LDAPRequest *lr )
872 ber = ldap_alloc_ber_with_options( ld );
875 ld->ld_errno = LDAP_NO_MEMORY;
879 if ( ber_printf( ber, "{it{ess}}", lr->lr_msgid,
880 lr->lr_res_msgtype, lr->lr_res_errno,
881 lr->lr_res_matched ? lr->lr_res_matched : "",
882 lr->lr_res_error ? lr->lr_res_error : "" ) == -1 ) {
884 ld->ld_errno = LDAP_ENCODING_ERROR;
886 return( LBER_ERROR );
891 if ( ber_skip_tag( ber, &len ) == LBER_ERROR ) {
892 ld->ld_errno = LDAP_DECODING_ERROR;
894 return( LBER_ERROR );
897 if ( ber_get_int( ber, &along ) == LBER_ERROR ) {
898 ld->ld_errno = LDAP_DECODING_ERROR;
900 return( LBER_ERROR );
903 tag = ber_peek_tag( ber, &len );
905 if ( tag == LBER_ERROR ) {
906 ld->ld_errno = LDAP_DECODING_ERROR;
908 return( LBER_ERROR );
917 merge_error_info( LDAP *ld, LDAPRequest *parentr, LDAPRequest *lr )
920 * Merge error information in "lr" with "parentr" error code and string.
922 if ( lr->lr_res_errno == LDAP_PARTIAL_RESULTS ) {
923 parentr->lr_res_errno = lr->lr_res_errno;
924 if ( lr->lr_res_error != NULL ) {
925 (void)ldap_append_referral( ld, &parentr->lr_res_error,
928 } else if ( lr->lr_res_errno != LDAP_SUCCESS &&
929 parentr->lr_res_errno == LDAP_SUCCESS ) {
930 parentr->lr_res_errno = lr->lr_res_errno;
931 if ( parentr->lr_res_error != NULL ) {
932 LDAP_FREE( parentr->lr_res_error );
934 parentr->lr_res_error = lr->lr_res_error;
935 lr->lr_res_error = NULL;
936 if ( LDAP_NAME_ERROR( lr->lr_res_errno )) {
937 if ( parentr->lr_res_matched != NULL ) {
938 LDAP_FREE( parentr->lr_res_matched );
940 parentr->lr_res_matched = lr->lr_res_matched;
941 lr->lr_res_matched = NULL;
945 Debug( LDAP_DEBUG_TRACE, "merged parent (id %d) error info: ",
946 parentr->lr_msgid, 0, 0 );
947 Debug( LDAP_DEBUG_TRACE, "result errno %d, error <%s>, matched <%s>\n",
948 parentr->lr_res_errno, parentr->lr_res_error ?
949 parentr->lr_res_error : "", parentr->lr_res_matched ?
950 parentr->lr_res_matched : "" );
956 ldap_msgtype( LDAPMessage *lm )
958 assert( lm != NULL );
959 return ( lm != NULL ) ? lm->lm_msgtype : -1;
964 ldap_msgid( LDAPMessage *lm )
966 assert( lm != NULL );
968 return ( lm != NULL ) ? lm->lm_msgid : -1;
972 char * ldap_int_msgtype2str( ber_tag_t tag )
975 case LDAP_RES_ADD: return "add";
976 case LDAP_RES_BIND: return "bind";
977 case LDAP_RES_COMPARE: return "compare";
978 case LDAP_RES_DELETE: return "delete";
979 case LDAP_RES_EXTENDED: return "extended-result";
980 case LDAP_RES_INTERMEDIATE: return "intermediate";
981 case LDAP_RES_MODIFY: return "modify";
982 case LDAP_RES_RENAME: return "rename";
983 case LDAP_RES_SEARCH_ENTRY: return "search-entry";
984 case LDAP_RES_SEARCH_REFERENCE: return "search-reference";
985 case LDAP_RES_SEARCH_RESULT: return "search-result";
991 ldap_msgfree( LDAPMessage *lm )
996 Debug( LDAP_DEBUG_TRACE, "ldap_msgfree\n", 0, 0, 0 );
998 for ( ; lm != NULL; lm = next ) {
1000 type = lm->lm_msgtype;
1001 ber_free( lm->lm_ber, 1 );
1002 LDAP_FREE( (char *) lm );
1009 * ldap_msgdelete - delete a message. It returns:
1010 * 0 if the entire message was deleted
1011 * -1 if the message was not found, or only part of it was found
1014 ldap_msgdelete( LDAP *ld, int msgid )
1016 LDAPMessage *lm, *prev;
1019 assert( ld != NULL );
1021 Debug( LDAP_DEBUG_TRACE, "ldap_msgdelete\n", 0, 0, 0 );
1024 #ifdef LDAP_R_COMPILE
1025 ldap_pvt_thread_mutex_lock( &ld->ld_res_mutex );
1027 for ( lm = ld->ld_responses; lm != NULL; lm = lm->lm_next ) {
1028 if ( lm->lm_msgid == msgid )
1037 ld->ld_responses = lm->lm_next;
1039 prev->lm_next = lm->lm_next;
1041 #ifdef LDAP_R_COMPILE
1042 ldap_pvt_thread_mutex_unlock( &ld->ld_res_mutex );
1044 if ( lm && ldap_msgfree( lm ) == LDAP_RES_SEARCH_ENTRY )
1052 * return 1 if message msgid is waiting to be abandoned, 0 otherwise
1055 ldap_abandoned( LDAP *ld, ber_int_t msgid )
1059 if ( ld->ld_abandoned == NULL )
1062 for ( i = 0; ld->ld_abandoned[i] != -1; i++ )
1063 if ( ld->ld_abandoned[i] == msgid )
1071 ldap_mark_abandoned( LDAP *ld, ber_int_t msgid )
1075 if ( ld->ld_abandoned == NULL )
1078 for ( i = 0; ld->ld_abandoned[i] != -1; i++ )
1079 if ( ld->ld_abandoned[i] == msgid )
1082 if ( ld->ld_abandoned[i] == -1 )
1085 for ( ; ld->ld_abandoned[i] != -1; i++ ) {
1086 ld->ld_abandoned[i] = ld->ld_abandoned[i + 1];