3 * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
7 * Copyright (c) 1990 Regents of the University of Michigan.
11 * This notice applies to changes, created by or for Novell, Inc.,
12 * to preexisting works for which notices appear elsewhere in this file.
14 * Copyright (C) 1999, 2000 Novell, Inc. All Rights Reserved.
16 * THIS WORK IS SUBJECT TO U.S. AND INTERNATIONAL COPYRIGHT LAWS AND TREATIES.
17 * USE, MODIFICATION, AND REDISTRIBUTION OF THIS WORK IS SUBJECT TO VERSION
18 * 2.0.1 OF THE OPENLDAP PUBLIC LICENSE, A COPY OF WHICH IS AVAILABLE AT
19 * HTTP://WWW.OPENLDAP.ORG/LICENSE.HTML OR IN THE FILE "LICENSE" IN THE
20 * TOP-LEVEL DIRECTORY OF THE DISTRIBUTION. ANY USE OR EXPLOITATION OF THIS
21 * WORK OTHER THAN AS AUTHORIZED IN VERSION 2.0.1 OF THE OPENLDAP PUBLIC
22 * LICENSE, OR OTHER PRIOR WRITTEN CONSENT FROM NOVELL, COULD SUBJECT THE
23 * PERPETRATOR TO CRIMINAL AND CIVIL LIABILITY.
25 * Modification to OpenLDAP source by Novell, Inc.
26 * April 2000 sfs Add code to process V3 referrals and search results
28 * result.c - wait for an ldap result
33 * LDAPResult ::= SEQUENCE {
34 * resultCode ENUMERATED { ... },
36 * errorMessage LDAPString,
37 * referral Referral OPTIONAL
39 * Referral ::= SEQUENCE OF LDAPURL (one or more)
40 * LDAPURL ::= LDAPString (limited to URL chars)
47 #include <ac/stdlib.h>
50 #include <ac/socket.h>
51 #include <ac/string.h>
53 #include <ac/unistd.h>
58 static int ldap_abandoned LDAP_P(( LDAP *ld, ber_int_t msgid ));
59 static int ldap_mark_abandoned LDAP_P(( LDAP *ld, ber_int_t msgid ));
60 static int wait4msg LDAP_P(( LDAP *ld, ber_int_t msgid, int all, struct timeval *timeout,
61 LDAPMessage **result ));
62 static ber_tag_t try_read1msg LDAP_P(( LDAP *ld, ber_int_t msgid,
63 int all, Sockbuf *sb, LDAPConn *lc, LDAPMessage **result ));
64 static ber_tag_t build_result_ber LDAP_P(( LDAP *ld, BerElement **bp, LDAPRequest *lr ));
65 static void merge_error_info LDAP_P(( LDAP *ld, LDAPRequest *parentr, LDAPRequest *lr ));
66 static LDAPMessage * chkResponseList LDAP_P(( LDAP *ld, int msgid, int all));
70 * ldap_result - wait for an ldap result response to a message from the
71 * ldap server. If msgid is LDAP_RES_ANY (-1), any message will be
72 * accepted. If msgid is LDAP_RES_UNSOLICITED (0), any unsolicited
73 * message is accepted. Otherwise ldap_result will wait for a response
74 * with msgid. If all is LDAP_MSG_ONE (0) the first message with id
75 * msgid will be accepted, otherwise, ldap_result will wait for all
76 * responses with id msgid and then return a pointer to the entire list
77 * of messages. In general, this is only useful for search responses,
78 * which can be of three message types (zero or more entries, zero or
79 * search references, followed by an ldap result). An extension to
80 * LDAPv3 allows partial extended responses to be returned in response
81 * to any request. The type of the first message received is returned.
82 * When waiting, any messages that have been abandoned are discarded.
85 * ldap_result( s, msgid, all, timeout, result )
92 struct timeval *timeout,
93 LDAPMessage **result )
98 assert( result != NULL );
100 Debug( LDAP_DEBUG_TRACE, "ldap_result msgid %d\n", msgid, 0, 0 );
106 if( result == NULL ) {
107 ld->ld_errno = LDAP_PARAM_ERROR;
111 lm = chkResponseList(ld, msgid, all);
114 return( wait4msg( ld, msgid, all, timeout, result ) );
118 ld->ld_errno = LDAP_SUCCESS;
119 return( lm->lm_msgtype );
128 LDAPMessage *lm, *lastlm, *nextlm;
130 * Look through the list of responses we have received on
131 * this association and see if the response we're interested in
132 * is there. If it is, return it. If not, call wait4msg() to
133 * wait until it arrives or timeout occurs.
136 Debug( LDAP_DEBUG_TRACE,
137 "ldap_chkResponseList for msgid=%d, all=%d\n",
140 for ( lm = ld->ld_responses; lm != NULL; lm = nextlm ) {
141 nextlm = lm->lm_next;
143 if ( ldap_abandoned( ld, lm->lm_msgid ) ) {
144 Debug( LDAP_DEBUG_TRACE,
145 "ldap_chkResponseList msg abandoned, msgid %d\n",
147 ldap_mark_abandoned( ld, lm->lm_msgid );
149 if ( lastlm == NULL ) {
150 /* Remove first entry in list */
151 ld->ld_responses = lm->lm_next;
153 lastlm->lm_next = nextlm;
161 if ( msgid == LDAP_RES_ANY || lm->lm_msgid == msgid ) {
164 if ( all == LDAP_MSG_ONE || msgid == LDAP_RES_UNSOLICITED ) {
168 for ( tmp = lm; tmp != NULL; tmp = tmp->lm_chain ) {
169 if ( lm->lm_msgtype != LDAP_RES_SEARCH_ENTRY
170 && lm->lm_msgtype != LDAP_RES_SEARCH_REFERENCE
171 && lm->lm_msgtype != LDAP_RES_EXTENDED_PARTIAL )
187 /* Found an entry, remove it from the list */
188 if ( lastlm == NULL ) {
189 ld->ld_responses = (all == LDAP_MSG_ONE && lm->lm_chain != NULL
190 ? lm->lm_chain : lm->lm_next);
192 lastlm->lm_next = (all == LDAP_MSG_ONE && lm->lm_chain != NULL
193 ? lm->lm_chain : lm->lm_next);
195 if ( all == LDAP_MSG_ONE && lm->lm_chain != NULL ) {
196 lm->lm_chain->lm_next = lm->lm_next;
204 Debug( LDAP_DEBUG_TRACE,
205 "ldap_chkResponseList returns NULL\n", 0, 0, 0);
207 Debug( LDAP_DEBUG_TRACE,
208 "ldap_chkResponseList returns msgid %d, type 0x%02lu\n",
209 lm->lm_msgid, (unsigned long) lm->lm_msgtype, 0);
219 struct timeval *timeout,
220 LDAPMessage **result )
223 struct timeval tv, *tvp;
224 time_t start_time = 0;
226 LDAPConn *lc, *nextlc;
228 assert( ld != NULL );
229 assert( result != NULL );
232 if ( timeout == NULL ) {
233 Debug( LDAP_DEBUG_TRACE, "wait4msg (infinite timeout), msgid %d\n",
236 Debug( LDAP_DEBUG_TRACE, "wait4msg (timeout %ld sec, %ld usec), msgid %d\n",
237 (long) timeout->tv_sec, (long) timeout->tv_usec, msgid );
239 #endif /* LDAP_DEBUG */
241 if ( timeout == NULL ) {
246 start_time = time( NULL );
252 Debug( LDAP_DEBUG_TRACE, "wait4msg continue, msgid %d, all %d\n",
254 if ( ldap_debug & LDAP_DEBUG_TRACE ) {
255 ldap_dump_connection( ld, ld->ld_conns, 1 );
256 ldap_dump_requests_and_responses( ld );
258 #endif /* LDAP_DEBUG */
260 if( (*result = chkResponseList(ld, msgid, all)) != NULL ) {
261 rc = (*result)->lm_msgtype;
264 for ( lc = ld->ld_conns; lc != NULL; lc = lc->lconn_next ) {
265 if ( ber_sockbuf_ctrl( lc->lconn_sb,
266 LBER_SB_OPT_DATA_READY, NULL ) ) {
267 rc = try_read1msg( ld, msgid, all, lc->lconn_sb,
274 rc = do_ldap_select( ld, tvp );
279 Debug( LDAP_DEBUG_TRACE,
280 "do_ldap_select returned -1: errno %d\n",
285 if ( rc == 0 || ( rc == -1 && (
286 !LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_RESTART)
287 || errno != EINTR )))
289 ld->ld_errno = (rc == -1 ? LDAP_SERVER_DOWN :
295 rc = -2; /* select interrupted: loop */
298 for ( lc = ld->ld_conns; rc == -2 && lc != NULL;
300 nextlc = lc->lconn_next;
301 if ( lc->lconn_status ==
302 LDAP_CONNST_CONNECTED &&
303 ldap_is_read_ready( ld,
305 rc = try_read1msg( ld, msgid, all,
306 lc->lconn_sb, lc, result );
313 if ( rc == -2 && tvp != NULL ) {
314 tmp_time = time( NULL );
315 if (( tv.tv_sec -= ( tmp_time - start_time )) <= 0 ) {
316 rc = 0; /* timed out */
317 ld->ld_errno = LDAP_TIMEOUT;
321 Debug( LDAP_DEBUG_TRACE, "wait4msg: %ld secs to go\n",
322 (long) tv.tv_sec, 0, 0 );
323 start_time = tmp_time;
338 LDAPMessage **result )
341 LDAPMessage *new, *l, *prev, *tmp;
346 LDAPRequest *lr, *tmplr;
348 int rc, refer_cnt, hadref, simple_request;
351 * v3ref = flag for V3 referral / search reference
352 * 0 = not a ref, 1 = sucessfully chased ref, -1 = pass ref to application
356 assert( ld != NULL );
357 assert( lc != NULL );
359 Debug( LDAP_DEBUG_TRACE, "read1msg: msgid %d, all %d\n", msgid, all, 0 );
361 if ( lc->lconn_ber == NULL ) {
362 lc->lconn_ber = ldap_alloc_ber_with_options(ld);
364 if( lc->lconn_ber == NULL ) {
370 assert( BER_VALID (ber) );
372 /* get the next message */
374 if ( (tag = ber_get_next( sb, &len, ber ))
375 != LDAP_TAG_MESSAGE ) {
376 if ( tag == LBER_DEFAULT) {
378 Debug( LDAP_DEBUG_CONNS,
379 "ber_get_next failed.\n", 0, 0, 0 );
382 if (errno==EWOULDBLOCK) return -2;
385 if (errno == EAGAIN) return -2;
387 ld->ld_errno = LDAP_SERVER_DOWN;
390 ld->ld_errno = LDAP_LOCAL_ERROR;
395 * We read a complete message.
396 * The connection should no longer need this ber.
398 lc->lconn_ber = NULL;
401 if ( ber_get_int( ber, &id ) == LBER_ERROR ) {
403 ld->ld_errno = LDAP_DECODING_ERROR;
407 /* if it's been abandoned, toss it */
408 if ( ldap_abandoned( ld, id ) ) {
410 Debug( LDAP_DEBUG_ANY, "abandoned\n", 0, 0, 0);
411 return( -2 ); /* continue looking */
414 if (( lr = ldap_find_request_by_msgid( ld, id )) == NULL ) {
415 Debug( LDAP_DEBUG_ANY,
416 "no request for response with msgid %ld (tossing)\n",
419 return( -2 ); /* continue looking */
422 /* the message type */
423 if ( (tag = ber_peek_tag( ber, &len )) == LBER_ERROR ) {
424 ld->ld_errno = LDAP_DECODING_ERROR;
429 Debug( LDAP_DEBUG_TRACE, "ldap_read: message type %s msgid %ld, original id %ld\n",
430 ldap_int_msgtype2str( tag ),
431 (long) lr->lr_msgid, (long) lr->lr_origid );
435 hadref = simple_request = 0;
436 rc = -2; /* default is to keep looking (no response found) */
437 lr->lr_res_msgtype = tag;
440 * This code figures out if we are going to chase a
441 * referral / search reference, or pass it back to the application
443 v3ref = 0; /* Assume not a V3 search reference or referral */
444 if( (tag != LDAP_RES_SEARCH_ENTRY) && (ld->ld_version > LDAP_VERSION2) ) {
445 BerElement tmpber = *ber; /* struct copy */
448 if( tag == LDAP_RES_SEARCH_REFERENCE) {
449 /* This is a V3 search reference */
450 /* Assume we do not chase the reference, but pass it to application */
452 if( LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_REFERRALS) ||
453 (lr->lr_parent != NULL) )
455 /* Get the referral list */
456 if ( ber_scanf( &tmpber, "{v}", &refs ) == LBER_ERROR ) {
457 rc = LDAP_DECODING_ERROR;
459 /* Note: refs arrary is freed by ldap_chase_v3referrals */
460 refer_cnt = ldap_chase_v3referrals( ld, lr, refs,
461 1, &lr->lr_res_error, &hadref );
462 if ( refer_cnt > 0 ) { /* sucessfully chased reference */
463 /* If haven't got end search, set chasing referrals */
464 if( lr->lr_status != LDAP_REQST_COMPLETED) {
465 lr->lr_status = LDAP_REQST_CHASINGREFS;
466 Debug( LDAP_DEBUG_TRACE,
467 "read1msg: search ref chased, mark request chasing refs, id = %d\n",
470 v3ref = 1; /* We sucessfully chased the reference */
475 /* Check for V3 referral */
477 if ( ber_scanf( &tmpber, "{iaa",/*}*/ &lderr,
478 &lr->lr_res_matched, &lr->lr_res_error )
480 /* Check if V3 referral */
481 if( ber_peek_tag( &tmpber, &len) == LDAP_TAG_REFERRAL ) {
482 /* We have a V3 referral, assume we cannot chase it */
484 if( LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_REFERRALS)
485 || (lr->lr_parent != NULL) )
487 v3ref = -1; /* Assume referral not chased and return it to app */
488 /* Get the referral list */
489 if( ber_scanf( &tmpber, "{v}", &refs) == LBER_ERROR) {
490 rc = LDAP_DECODING_ERROR;
491 lr->lr_status = LDAP_REQST_COMPLETED;
492 Debug( LDAP_DEBUG_TRACE,
493 "read1msg: referral decode error, mark request completed, id = %d\n",
496 /* Chase the referral
497 * Note: refs arrary is freed by ldap_chase_v3referrals
499 refer_cnt = ldap_chase_v3referrals( ld, lr, refs,
500 0, &lr->lr_res_error, &hadref );
501 lr->lr_status = LDAP_REQST_COMPLETED;
502 Debug( LDAP_DEBUG_TRACE,
503 "read1msg: referral chased, mark request completed, id = %d\n",
506 v3ref = 1; /* Referral successfully chased */
512 if( lr->lr_res_matched != NULL ) {
513 LDAP_FREE( lr->lr_res_matched );
514 lr->lr_res_matched = NULL;
516 if( lr->lr_res_error != NULL ) {
517 LDAP_FREE( lr->lr_res_error );
518 lr->lr_res_error = NULL;
524 /* All results that just return a status, i.e. don't return data
525 * go through the following code. This code also chases V2 referrals
526 * and checks if all referrals have been chased.
528 if ( (tag != LDAP_RES_SEARCH_ENTRY) && (v3ref > -1) ) {
529 /* For a v3 search referral/reference, only come here if already chased it */
530 if ( ld->ld_version >= LDAP_VERSION2 &&
531 ( lr->lr_parent != NULL ||
532 LDAP_BOOL_GET(&ld->ld_options, LDAP_BOOL_REFERRALS) ) )
534 tmpber = *ber; /* struct copy */
536 ; /* V3 search reference or V3 referral sucessfully chased */
538 if ( ber_scanf( &tmpber, "{iaa}", &lderr,
539 &lr->lr_res_matched, &lr->lr_res_error )
541 if ( lderr != LDAP_SUCCESS ) {
542 /* referrals are in error string */
543 refer_cnt = ldap_chase_referrals( ld, lr,
544 &lr->lr_res_error, &hadref );
545 lr->lr_status = LDAP_REQST_COMPLETED;
546 Debug( LDAP_DEBUG_TRACE,
547 "read1msg: V2 referral chased, mark request completed, id = %d\n", lr->lr_msgid, 0, 0);
550 /* save errno, message, and matched string */
551 if ( !hadref || lr->lr_res_error == NULL ) {
552 lr->lr_res_errno = ( lderr ==
553 LDAP_PARTIAL_RESULTS ) ? LDAP_SUCCESS
555 } else if ( ld->ld_errno != LDAP_SUCCESS ) {
556 lr->lr_res_errno = ld->ld_errno;
558 lr->lr_res_errno = LDAP_PARTIAL_RESULTS;
560 Debug( LDAP_DEBUG_TRACE,
561 "new result: res_errno: %d, res_error: <%s>, res_matched: <%s>\n",
562 lr->lr_res_errno, lr->lr_res_error ? lr->lr_res_error : "",
563 lr->lr_res_matched ? lr->lr_res_matched : "" );
567 Debug( LDAP_DEBUG_TRACE,
568 "read1msg: %d new referrals\n", refer_cnt, 0, 0 );
570 if ( refer_cnt != 0 ) { /* chasing referrals */
573 if ( refer_cnt < 0 ) {
574 return( -1 ); /* fatal error */
576 lr->lr_res_errno = LDAP_SUCCESS; /* sucessfully chased referral */
578 if ( lr->lr_outrefcnt <= 0 && lr->lr_parent == NULL ) {
579 /* request without any referrals */
580 simple_request = ( hadref ? 0 : 1 );
582 /* request with referrals or child request */
587 lr->lr_status = LDAP_REQST_COMPLETED; /* declare this request done */
588 Debug( LDAP_DEBUG_TRACE,
589 "read1msg: mark request completed, id = %d\n", lr->lr_msgid, 0, 0);
590 while ( lr->lr_parent != NULL ) {
591 merge_error_info( ld, lr->lr_parent, lr );
594 if ( --lr->lr_outrefcnt > 0 ) {
595 break; /* not completely done yet */
599 /* Check if all requests are finished, lr is now parent */
600 for(tmplr=lr ; tmplr != NULL; tmplr=tmplr->lr_refnext) {
601 if( tmplr->lr_status != LDAP_REQST_COMPLETED) {
606 /* This is the parent request if the request has referrals */
607 if ( lr->lr_outrefcnt <= 0 && lr->lr_parent == NULL && tmplr == NULL ) {
609 tag = lr->lr_res_msgtype;
610 Debug( LDAP_DEBUG_ANY, "request %ld done\n",
612 Debug( LDAP_DEBUG_TRACE,
613 "res_errno: %d, res_error: <%s>, res_matched: <%s>\n",
614 lr->lr_res_errno, lr->lr_res_error ? lr->lr_res_error : "",
615 lr->lr_res_matched ? lr->lr_res_matched : "" );
616 if ( !simple_request ) {
619 if ( build_result_ber( ld, &ber, lr )
621 rc = -1; /* fatal error */
625 ldap_free_request( ld, lr );
629 ldap_free_connection( ld, lc, 0, 1 );
638 /* make a new ldap message */
639 if ( (new = (LDAPMessage *) LDAP_CALLOC( 1, sizeof(LDAPMessage) ))
641 ld->ld_errno = LDAP_NO_MEMORY;
644 new->lm_msgid = (int)id;
645 new->lm_msgtype = tag;
649 if ( ld->ld_cache != NULL ) {
650 ldap_add_result_to_cache( ld, new );
652 #endif /* LDAP_NOCACHE */
654 /* is this the one we're looking for? */
655 if ( msgid == LDAP_RES_ANY || id == msgid ) {
656 if ( all == LDAP_MSG_ONE
657 || (new->lm_msgtype != LDAP_RES_SEARCH_RESULT
658 && new->lm_msgtype != LDAP_RES_SEARCH_ENTRY
659 && new->lm_msgtype != LDAP_RES_SEARCH_REFERENCE) ) {
661 ld->ld_errno = LDAP_SUCCESS;
663 } else if ( new->lm_msgtype == LDAP_RES_SEARCH_RESULT) {
664 foundit = 1; /* return the chain later */
669 * if not, we must add it to the list of responses. if
670 * the msgid is already there, it must be part of an existing
675 for ( l = ld->ld_responses; l != NULL; l = l->lm_next ) {
676 if ( l->lm_msgid == new->lm_msgid )
681 /* not part of an existing search response */
685 ld->ld_errno = LDAP_SUCCESS;
689 new->lm_next = ld->ld_responses;
690 ld->ld_responses = new;
691 return( -2 ); /* continue looking */
694 Debug( LDAP_DEBUG_TRACE, "adding response id %ld type %ld:\n",
695 (long) new->lm_msgid, (long) new->lm_msgtype, 0 );
697 /* part of a search response - add to end of list of entries */
698 for ( tmp = l; (tmp->lm_chain != NULL) &&
699 ((tmp->lm_chain->lm_msgtype == LDAP_RES_SEARCH_ENTRY) ||
700 (tmp->lm_chain->lm_msgtype == LDAP_RES_SEARCH_REFERENCE) ||
701 (tmp->lm_chain->lm_msgtype == LDAP_RES_EXTENDED_PARTIAL ));
702 tmp = tmp->lm_chain )
706 /* return the whole chain if that's what we were looking for */
709 ld->ld_responses = l->lm_next;
711 prev->lm_next = l->lm_next;
713 ld->ld_errno = LDAP_SUCCESS;
714 #ifdef LDAP_WORLD_P16
716 * XXX questionable fix; see text for [P16] on
717 * http://www.critical-angle.com/ldapworld/patch/
719 * inclusion of this patch causes searchs to hang on
722 return( l->lm_msgtype );
723 #else /* LDAP_WORLD_P16 */
725 #endif /* !LDAP_WORLD_P16 */
728 return( -2 ); /* continue looking */
733 build_result_ber( LDAP *ld, BerElement **bp, LDAPRequest *lr )
741 ber = ldap_alloc_ber_with_options( ld );
744 ld->ld_errno = LDAP_NO_MEMORY;
748 if ( ber_printf( ber, "{it{ess}}", lr->lr_msgid,
749 lr->lr_res_msgtype, lr->lr_res_errno,
750 lr->lr_res_matched ? lr->lr_res_matched : "",
751 lr->lr_res_error ? lr->lr_res_error : "" ) == -1 ) {
753 ld->ld_errno = LDAP_ENCODING_ERROR;
755 return( LBER_ERROR );
760 if ( ber_skip_tag( ber, &len ) == LBER_ERROR ) {
761 ld->ld_errno = LDAP_DECODING_ERROR;
763 return( LBER_ERROR );
766 if ( ber_get_int( ber, &along ) == LBER_ERROR ) {
767 ld->ld_errno = LDAP_DECODING_ERROR;
769 return( LBER_ERROR );
772 tag = ber_peek_tag( ber, &len );
774 if ( tag == LBER_ERROR ) {
775 ld->ld_errno = LDAP_DECODING_ERROR;
777 return( LBER_ERROR );
786 merge_error_info( LDAP *ld, LDAPRequest *parentr, LDAPRequest *lr )
789 * Merge error information in "lr" with "parentr" error code and string.
791 if ( lr->lr_res_errno == LDAP_PARTIAL_RESULTS ) {
792 parentr->lr_res_errno = lr->lr_res_errno;
793 if ( lr->lr_res_error != NULL ) {
794 (void)ldap_append_referral( ld, &parentr->lr_res_error,
797 } else if ( lr->lr_res_errno != LDAP_SUCCESS &&
798 parentr->lr_res_errno == LDAP_SUCCESS ) {
799 parentr->lr_res_errno = lr->lr_res_errno;
800 if ( parentr->lr_res_error != NULL ) {
801 LDAP_FREE( parentr->lr_res_error );
803 parentr->lr_res_error = lr->lr_res_error;
804 lr->lr_res_error = NULL;
805 if ( LDAP_NAME_ERROR( lr->lr_res_errno )) {
806 if ( parentr->lr_res_matched != NULL ) {
807 LDAP_FREE( parentr->lr_res_matched );
809 parentr->lr_res_matched = lr->lr_res_matched;
810 lr->lr_res_matched = NULL;
814 Debug( LDAP_DEBUG_TRACE, "merged parent (id %d) error info: ",
815 parentr->lr_msgid, 0, 0 );
816 Debug( LDAP_DEBUG_TRACE, "result errno %d, error <%s>, matched <%s>\n",
817 parentr->lr_res_errno, parentr->lr_res_error ?
818 parentr->lr_res_error : "", parentr->lr_res_matched ?
819 parentr->lr_res_matched : "" );
825 ldap_msgtype( LDAPMessage *lm )
827 assert( lm != NULL );
828 return ( lm != NULL ) ? lm->lm_msgtype : -1;
833 ldap_msgid( LDAPMessage *lm )
835 assert( lm != NULL );
837 return ( lm != NULL ) ? lm->lm_msgid : -1;
841 char * ldap_int_msgtype2str( ber_tag_t tag )
844 case LDAP_RES_ADD: return "add";
845 case LDAP_RES_BIND: return "bind";
846 case LDAP_RES_COMPARE: return "compare";
847 case LDAP_RES_DELETE: return "delete";
848 case LDAP_RES_EXTENDED: return "extended-result";
849 case LDAP_RES_EXTENDED_PARTIAL: return "extended-partial";
850 case LDAP_RES_MODIFY: return "modify";
851 case LDAP_RES_RENAME: return "rename";
852 case LDAP_RES_SEARCH_ENTRY: return "search-entry";
853 case LDAP_RES_SEARCH_REFERENCE: return "search-reference";
854 case LDAP_RES_SEARCH_RESULT: return "search-result";
860 ldap_msgfree( LDAPMessage *lm )
865 Debug( LDAP_DEBUG_TRACE, "ldap_msgfree\n", 0, 0, 0 );
867 for ( ; lm != NULL; lm = next ) {
869 type = lm->lm_msgtype;
870 ber_free( lm->lm_ber, 1 );
871 LDAP_FREE( (char *) lm );
878 * ldap_msgdelete - delete a message. It returns:
879 * 0 if the entire message was deleted
880 * -1 if the message was not found, or only part of it was found
883 ldap_msgdelete( LDAP *ld, int msgid )
885 LDAPMessage *lm, *prev;
887 assert( ld != NULL );
889 Debug( LDAP_DEBUG_TRACE, "ldap_msgdelete\n", 0, 0, 0 );
892 for ( lm = ld->ld_responses; lm != NULL; lm = lm->lm_next ) {
893 if ( lm->lm_msgid == msgid )
902 ld->ld_responses = lm->lm_next;
904 prev->lm_next = lm->lm_next;
906 if ( ldap_msgfree( lm ) == LDAP_RES_SEARCH_ENTRY )
914 * return 1 if message msgid is waiting to be abandoned, 0 otherwise
917 ldap_abandoned( LDAP *ld, ber_int_t msgid )
921 if ( ld->ld_abandoned == NULL )
924 for ( i = 0; ld->ld_abandoned[i] != -1; i++ )
925 if ( ld->ld_abandoned[i] == msgid )
933 ldap_mark_abandoned( LDAP *ld, ber_int_t msgid )
937 if ( ld->ld_abandoned == NULL )
940 for ( i = 0; ld->ld_abandoned[i] != -1; i++ )
941 if ( ld->ld_abandoned[i] == msgid )
944 if ( ld->ld_abandoned[i] == -1 )
947 for ( ; ld->ld_abandoned[i] != -1; i++ ) {
948 ld->ld_abandoned[i] = ld->ld_abandoned[i + 1];