2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1998-2006 The OpenLDAP Foundation.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted only as authorized by the OpenLDAP
11 * A copy of this license is available in the file LICENSE in the
12 * top-level directory of the distribution or, alternatively, at
13 * <http://www.OpenLDAP.org/license.html>.
15 /* Portions Copyright (c) 1995 Regents of the University of Michigan.
16 * All rights reserved.
18 /* This notice applies to changes, created by or for Novell, Inc.,
19 * to preexisting works for which notices appear elsewhere in this file.
21 * Copyright (C) 1999, 2000 Novell, Inc. All Rights Reserved.
23 * THIS WORK IS SUBJECT TO U.S. AND INTERNATIONAL COPYRIGHT LAWS AND TREATIES.
24 * USE, MODIFICATION, AND REDISTRIBUTION OF THIS WORK IS SUBJECT TO VERSION
25 * 2.0.1 OF THE OPENLDAP PUBLIC LICENSE, A COPY OF WHICH IS AVAILABLE AT
26 * HTTP://WWW.OPENLDAP.ORG/LICENSE.HTML OR IN THE FILE "LICENSE" IN THE
27 * TOP-LEVEL DIRECTORY OF THE DISTRIBUTION. ANY USE OR EXPLOITATION OF THIS
28 * WORK OTHER THAN AS AUTHORIZED IN VERSION 2.0.1 OF THE OPENLDAP PUBLIC
29 * LICENSE, OR OTHER PRIOR WRITTEN CONSENT FROM NOVELL, COULD SUBJECT THE
30 * PERPETRATOR TO CRIMINAL AND CIVIL LIABILITY.
32 * Modification to OpenLDAP source by Novell, Inc.
33 * April 2000 sfs Added code to chase V3 referrals
34 * request.c - sending of ldap requests; handling of referrals
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.
45 #include <ac/stdlib.h>
48 #include <ac/socket.h>
49 #include <ac/string.h>
51 #include <ac/unistd.h>
56 static LDAPConn *find_connection LDAP_P(( LDAP *ld, LDAPURLDesc *srv, int any ));
57 static void use_connection LDAP_P(( LDAP *ld, LDAPConn *lc ));
58 static void ldap_free_request_int LDAP_P(( LDAP *ld, LDAPRequest *lr ));
61 re_encode_request( LDAP *ld,
69 ldap_alloc_ber_with_options( LDAP *ld )
73 ber = ber_alloc_t( ld->ld_lberoptions );
75 ld->ld_errno = LDAP_NO_MEMORY;
83 ldap_set_ber_options( LDAP *ld, BerElement *ber )
85 ber->ber_options = ld->ld_lberoptions;
90 ldap_send_initial_request(
99 Debug( LDAP_DEBUG_TRACE, "ldap_send_initial_request\n", 0, 0, 0 );
101 #ifdef LDAP_R_COMPILE
102 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
104 if ( ber_sockbuf_ctrl( ld->ld_sb, LBER_SB_OPT_GET_FD, NULL ) == -1 ) {
105 /* not connected yet */
106 rc = ldap_open_defconn( ld );
109 #ifdef LDAP_R_COMPILE
110 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
115 } else if ( rc == 0 ) {
116 Debug( LDAP_DEBUG_TRACE,
117 "ldap_open_defconn: successful\n",
121 #ifdef LDAP_CONNECTIONLESS
122 if (LDAP_IS_UDP(ld)) {
123 if (msgtype == LDAP_REQ_BIND) {
124 if (ld->ld_options.ldo_cldapdn)
125 ldap_memfree(ld->ld_options.ldo_cldapdn);
126 ld->ld_options.ldo_cldapdn = ldap_strdup(dn);
129 if (msgtype != LDAP_REQ_ABANDON && msgtype != LDAP_REQ_SEARCH)
130 return LDAP_PARAM_ERROR;
133 #ifdef LDAP_R_COMPILE
134 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
136 rc = ldap_send_server_request( ld, ber, msgid, NULL,
138 #ifdef LDAP_R_COMPILE
139 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
146 ldap_int_flush_request(
150 LDAPConn *lc = lr->lr_conn;
152 if ( ber_flush2( lc->lconn_sb, lr->lr_ber, LBER_FLUSH_FREE_NEVER ) != 0 ) {
153 if ( sock_errno() == EAGAIN ) {
154 /* need to continue write later */
155 lr->lr_status = LDAP_REQST_WRITING;
156 ldap_mark_select_write( ld, lc->lconn_sb );
157 ld->ld_errno = LDAP_BUSY;
160 ld->ld_errno = LDAP_SERVER_DOWN;
161 ldap_free_request( ld, lr );
162 ldap_free_connection( ld, lc, 0, 0 );
166 if ( lr->lr_parent == NULL ) {
167 lr->lr_ber->ber_end = lr->lr_ber->ber_ptr;
168 lr->lr_ber->ber_ptr = lr->lr_ber->ber_buf;
170 lr->lr_status = LDAP_REQST_INPROGRESS;
172 /* sent -- waiting for a response */
173 ldap_mark_select_read( ld, lc->lconn_sb );
179 ldap_send_server_request(
183 LDAPRequest *parentreq,
184 LDAPURLDesc **srvlist,
191 Debug( LDAP_DEBUG_TRACE, "ldap_send_server_request\n", 0, 0, 0 );
194 ld->ld_errno = LDAP_SUCCESS; /* optimistic */
197 if ( srvlist == NULL ) {
200 lc = find_connection( ld, *srvlist, 1 );
202 if ( (bind != NULL) && (parentreq != NULL) ) {
203 /* Remember the bind in the parent */
205 ++parentreq->lr_outrefcnt;
207 lc = ldap_new_connection( ld, srvlist, 0, 1, bind );
212 if ( lc == NULL || lc->lconn_status != LDAP_CONNST_CONNECTED ) {
214 if ( ld->ld_errno == LDAP_SUCCESS ) {
215 ld->ld_errno = LDAP_SERVER_DOWN;
218 /* Forget about the bind */
219 --parentreq->lr_outrefcnt;
224 use_connection( ld, lc );
226 /* If we still have an incomplete write, try to finish it before
227 * dealing with the new request. If we don't finish here, return
228 * LDAP_BUSY and let the caller retry later. We only allow a single
229 * request to be in WRITING state.
232 if ( ld->ld_requests &&
233 ld->ld_requests->lr_status == LDAP_REQST_WRITING &&
234 ldap_int_flush_request( ld, ld->ld_requests ) < 0 )
240 lr = (LDAPRequest *)LDAP_CALLOC( 1, sizeof( LDAPRequest ) );
242 ld->ld_errno = LDAP_NO_MEMORY;
243 ldap_free_connection( ld, lc, 0, 0 );
246 /* Forget about the bind */
247 --parentreq->lr_outrefcnt;
251 lr->lr_msgid = msgid;
252 lr->lr_status = LDAP_REQST_INPROGRESS;
253 lr->lr_res_errno = LDAP_SUCCESS; /* optimistic */
256 if ( parentreq != NULL ) { /* sub-request */
258 /* Increment if we didn't do it before the bind */
259 ++parentreq->lr_outrefcnt;
261 lr->lr_origid = parentreq->lr_origid;
262 lr->lr_parentcnt = ++parentreq->lr_parentcnt;
263 lr->lr_parent = parentreq;
264 lr->lr_refnext = parentreq->lr_child;
265 parentreq->lr_child = lr;
266 } else { /* original request */
267 lr->lr_origid = lr->lr_msgid;
270 /* Extract requestDN for future reference */
272 BerElement tmpber = *ber;
276 ber_reset( &tmpber, 1 );
277 rtag = ber_scanf( &tmpber, "{it", /*}*/ &bint, &tag );
280 rtag = ber_scanf( &tmpber, "{i" /*}*/, &bint );
282 case LDAP_REQ_DELETE:
285 rtag = ber_scanf( &tmpber, "{" /*}*/ );
286 case LDAP_REQ_ABANDON:
289 if ( tag != LDAP_REQ_ABANDON ) {
290 ber_skip_tag( &tmpber, &lr->lr_dn.bv_len );
291 lr->lr_dn.bv_val = tmpber.ber_ptr;
296 lr->lr_next = ld->ld_requests;
297 if ( lr->lr_next != NULL ) {
298 lr->lr_next->lr_prev = lr;
300 ld->ld_requests = lr;
302 ld->ld_errno = LDAP_SUCCESS;
303 if ( ldap_int_flush_request( ld, lr ) == -1 ) {
311 ldap_new_connection( LDAP *ld, LDAPURLDesc **srvlist, int use_ldsb,
312 int connect, LDAPreqinfo *bind )
316 Debug( LDAP_DEBUG_TRACE, "ldap_new_connection %d %d %d\n",
317 use_ldsb, connect, (bind != NULL) );
319 * make a new LDAP server connection
320 * XXX open connection synchronously for now
322 lc = (LDAPConn *)LDAP_CALLOC( 1, sizeof( LDAPConn ) );
324 ld->ld_errno = LDAP_NO_MEMORY;
329 assert( ld->ld_sb != NULL );
330 lc->lconn_sb = ld->ld_sb;
333 lc->lconn_sb = ber_sockbuf_alloc();
334 if ( lc->lconn_sb == NULL ) {
335 LDAP_FREE( (char *)lc );
336 ld->ld_errno = LDAP_NO_MEMORY;
342 LDAPURLDesc **srvp, *srv = NULL;
344 for ( srvp = srvlist; *srvp != NULL; srvp = &(*srvp)->lud_next ) {
345 if ( ldap_int_open_connection( ld, lc, *srvp, 0 ) != -1 )
349 if ( ld->ld_urllist_proc ) {
350 ld->ld_urllist_proc( ld, srvlist, srvp, ld->ld_urllist_params );
359 ber_sockbuf_free( lc->lconn_sb );
361 LDAP_FREE( (char *)lc );
362 ld->ld_errno = LDAP_SERVER_DOWN;
366 lc->lconn_server = ldap_url_dup( srv );
369 lc->lconn_status = LDAP_CONNST_CONNECTED;
370 #ifdef LDAP_R_COMPILE
371 ldap_pvt_thread_mutex_lock( &ld->ld_conn_mutex );
373 lc->lconn_next = ld->ld_conns;
375 #ifdef LDAP_R_COMPILE
376 ldap_pvt_thread_mutex_unlock( &ld->ld_conn_mutex );
379 if ( bind != NULL ) {
381 LDAPConn *savedefconn;
383 /* Set flag to prevent additional referrals
384 * from being processed on this
385 * connection until the bind has completed
387 lc->lconn_rebind_inprogress = 1;
388 /* V3 rebind function */
389 if ( ld->ld_rebind_proc != NULL) {
390 LDAPURLDesc *srvfunc;
392 srvfunc = ldap_url_dup( *srvlist );
393 if ( srvfunc == NULL ) {
394 ld->ld_errno = LDAP_NO_MEMORY;
397 savedefconn = ld->ld_defconn;
398 ++lc->lconn_refcnt; /* avoid premature free */
401 Debug( LDAP_DEBUG_TRACE, "Call application rebind_proc\n", 0, 0, 0);
402 #ifdef LDAP_R_COMPILE
403 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
404 ldap_pvt_thread_mutex_unlock( &ld->ld_res_mutex );
406 err = (*ld->ld_rebind_proc)( ld,
407 bind->ri_url, bind->ri_request, bind->ri_msgid,
408 ld->ld_rebind_params );
409 #ifdef LDAP_R_COMPILE
410 ldap_pvt_thread_mutex_lock( &ld->ld_res_mutex );
411 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
414 ld->ld_defconn = savedefconn;
419 ldap_free_connection( ld, lc, 1, 0 );
422 ldap_free_urldesc( srvfunc );
427 struct berval passwd = BER_BVNULL;
429 savedefconn = ld->ld_defconn;
430 ++lc->lconn_refcnt; /* avoid premature free */
433 Debug( LDAP_DEBUG_TRACE, "anonymous rebind via ldap_bind_s\n", 0, 0, 0);
434 #ifdef LDAP_R_COMPILE
435 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
436 ldap_pvt_thread_mutex_unlock( &ld->ld_res_mutex );
438 rc = ldap_sasl_bind( ld, "", LDAP_SASL_SIMPLE, &passwd,
439 NULL, NULL, &msgid );
440 if ( rc != LDAP_SUCCESS ) {
444 for ( err = 1; err > 0; ) {
445 struct timeval tv = { 0, 100000 };
446 LDAPMessage *res = NULL;
448 switch ( ldap_result( ld, msgid, LDAP_MSG_ALL, &tv, &res ) ) {
454 #ifdef LDAP_R_COMPILE
455 ldap_pvt_thread_yield();
460 rc = ldap_parse_result( ld, res, &err, NULL, NULL, NULL, NULL, 1 );
461 if ( rc != LDAP_SUCCESS ) {
464 } else if ( err != LDAP_SUCCESS ) {
467 /* else err == LDAP_SUCCESS == 0 */
475 #ifdef LDAP_R_COMPILE
476 ldap_pvt_thread_mutex_lock( &ld->ld_res_mutex );
477 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
479 ld->ld_defconn = savedefconn;
483 ldap_free_connection( ld, lc, 1, 0 );
488 lc->lconn_rebind_inprogress = 0;
496 find_connection( LDAP *ld, LDAPURLDesc *srv, int any )
498 * return an existing connection (if any) to the server srv
499 * if "any" is non-zero, check for any server in the "srv" chain
503 LDAPURLDesc *lcu, *lsu;
504 int lcu_port, lsu_port;
507 #ifdef LDAP_R_COMPILE
508 ldap_pvt_thread_mutex_lock( &ld->ld_conn_mutex );
510 for ( lc = ld->ld_conns; lc != NULL; lc = lc->lconn_next ) {
511 lcu = lc->lconn_server;
512 lcu_port = ldap_pvt_url_scheme_port( lcu->lud_scheme,
515 for ( lsu = srv; lsu != NULL; lsu = lsu->lud_next ) {
516 lsu_port = ldap_pvt_url_scheme_port( lsu->lud_scheme,
519 if ( lsu_port == lcu_port
520 && strcmp( lcu->lud_scheme, lsu->lud_scheme ) == 0
521 && lcu->lud_host != NULL && *lcu->lud_host != '\0'
522 && lsu->lud_host != NULL && *lsu->lud_host != '\0'
523 && strcasecmp( lsu->lud_host, lcu->lud_host ) == 0 )
534 #ifdef LDAP_R_COMPILE
535 ldap_pvt_thread_mutex_unlock( &ld->ld_conn_mutex );
543 use_connection( LDAP *ld, LDAPConn *lc )
546 lc->lconn_lastused = time( NULL );
551 ldap_free_connection( LDAP *ld, LDAPConn *lc, int force, int unbind )
553 LDAPConn *tmplc, *prevlc;
555 Debug( LDAP_DEBUG_TRACE,
556 "ldap_free_connection %d %d\n",
559 if ( force || --lc->lconn_refcnt <= 0 ) {
560 /* remove from connections list first */
561 #ifdef LDAP_R_COMPILE
562 ldap_pvt_thread_mutex_lock( &ld->ld_conn_mutex );
565 for ( prevlc = NULL, tmplc = ld->ld_conns;
567 tmplc = tmplc->lconn_next )
570 if ( prevlc == NULL ) {
571 ld->ld_conns = tmplc->lconn_next;
573 prevlc->lconn_next = tmplc->lconn_next;
579 #ifdef LDAP_R_COMPILE
580 ldap_pvt_thread_mutex_unlock( &ld->ld_conn_mutex );
583 if ( lc->lconn_status == LDAP_CONNST_CONNECTED ) {
584 ldap_mark_select_clear( ld, lc->lconn_sb );
586 ldap_send_unbind( ld, lc->lconn_sb,
591 if ( lc->lconn_ber != NULL ) {
592 ber_free( lc->lconn_ber, 1 );
595 ldap_int_sasl_close( ld, lc );
597 ldap_free_urllist( lc->lconn_server );
598 #ifdef LDAP_API_FEATURE_X_OPENLDAP_V2_KBIND
599 if ( lc->lconn_krbinstance != NULL ) {
600 LDAP_FREE( lc->lconn_krbinstance );
604 /* FIXME: is this at all possible?
605 * ldap_ld_free() in unbind.c calls ldap_free_connection()
606 * with force == 1 __after__ explicitly calling
607 * ldap_free_request() on all requests */
611 for ( lr = ld->ld_requests; lr; ) {
612 LDAPRequest *lr_next = lr->lr_next;
614 if ( lr->lr_conn == lc ) {
615 ldap_free_request_int( ld, lr );
622 if ( lc->lconn_sb != ld->ld_sb ) {
623 ber_sockbuf_free( lc->lconn_sb );
626 if ( lc->lconn_rebind_queue != NULL) {
628 for( i = 0; lc->lconn_rebind_queue[i] != NULL; i++ ) {
629 LDAP_VFREE( lc->lconn_rebind_queue[i] );
631 LDAP_FREE( lc->lconn_rebind_queue );
636 Debug( LDAP_DEBUG_TRACE,
637 "ldap_free_connection: actually freed\n",
641 lc->lconn_lastused = time( NULL );
642 Debug( LDAP_DEBUG_TRACE, "ldap_free_connection: refcnt %d\n",
643 lc->lconn_refcnt, 0, 0 );
650 ldap_dump_connection( LDAP *ld, LDAPConn *lconns, int all )
655 Debug( LDAP_DEBUG_TRACE, "** ld %p Connection%s:\n", (void *)ld, all ? "s" : "", 0 );
656 for ( lc = lconns; lc != NULL; lc = lc->lconn_next ) {
657 if ( lc->lconn_server != NULL ) {
658 Debug( LDAP_DEBUG_TRACE, "* host: %s port: %d%s\n",
659 ( lc->lconn_server->lud_host == NULL ) ? "(null)"
660 : lc->lconn_server->lud_host,
661 lc->lconn_server->lud_port, ( lc->lconn_sb ==
662 ld->ld_sb ) ? " (default)" : "" );
664 Debug( LDAP_DEBUG_TRACE, " refcnt: %d status: %s\n", lc->lconn_refcnt,
665 ( lc->lconn_status == LDAP_CONNST_NEEDSOCKET )
666 ? "NeedSocket" : ( lc->lconn_status == LDAP_CONNST_CONNECTING )
667 ? "Connecting" : "Connected", 0 );
668 Debug( LDAP_DEBUG_TRACE, " last used: %s%s\n",
669 ldap_pvt_ctime( &lc->lconn_lastused, timebuf ),
670 lc->lconn_rebind_inprogress ? " rebind in progress" : "", 0 );
671 if ( lc->lconn_rebind_inprogress ) {
672 if ( lc->lconn_rebind_queue != NULL) {
675 for ( i = 0; lc->lconn_rebind_queue[i] != NULL; i++ ) {
677 for( j = 0; lc->lconn_rebind_queue[i][j] != 0; j++ ) {
678 Debug( LDAP_DEBUG_TRACE, " queue %d entry %d - %s\n",
679 i, j, lc->lconn_rebind_queue[i][j] );
683 Debug( LDAP_DEBUG_TRACE, " queue is empty\n", 0, 0, 0 );
686 Debug( LDAP_DEBUG_TRACE, "\n", 0, 0, 0 );
695 ldap_dump_requests_and_responses( LDAP *ld )
701 Debug( LDAP_DEBUG_TRACE, "** ld %p Outstanding Requests:\n",
703 lr = ld->ld_requests;
705 Debug( LDAP_DEBUG_TRACE, " Empty\n", 0, 0, 0 );
707 for ( i = 0; lr != NULL; lr = lr->lr_next, i++ ) {
708 Debug( LDAP_DEBUG_TRACE, " * msgid %d, origid %d, status %s\n",
709 lr->lr_msgid, lr->lr_origid,
710 ( lr->lr_status == LDAP_REQST_INPROGRESS ) ? "InProgress" :
711 ( lr->lr_status == LDAP_REQST_CHASINGREFS ) ? "ChasingRefs" :
712 ( lr->lr_status == LDAP_REQST_NOTCONNECTED ) ? "NotConnected" :
713 ( lr->lr_status == LDAP_REQST_WRITING ) ? "Writing" :
714 ( lr->lr_status == LDAP_REQST_COMPLETED ) ? "RequestCompleted"
716 Debug( LDAP_DEBUG_TRACE, " outstanding referrals %d, parent count %d\n",
717 lr->lr_outrefcnt, lr->lr_parentcnt, 0 );
719 Debug( LDAP_DEBUG_TRACE, " ld %p request count %d\n", (void *)ld, i, 0 );
720 Debug( LDAP_DEBUG_TRACE, "** ld %p Response Queue:\n", (void *)ld, 0, 0 );
721 if ( ( lm = ld->ld_responses ) == NULL ) {
722 Debug( LDAP_DEBUG_TRACE, " Empty\n", 0, 0, 0 );
724 for ( i = 0; lm != NULL; lm = lm->lm_next, i++ ) {
725 Debug( LDAP_DEBUG_TRACE, " * msgid %d, type %lu\n",
726 lm->lm_msgid, (unsigned long)lm->lm_msgtype, 0 );
727 if ( ( l = lm->lm_chain ) != NULL ) {
728 Debug( LDAP_DEBUG_TRACE, " chained responses:\n", 0, 0, 0 );
729 for ( ; l != NULL; l = l->lm_chain ) {
730 Debug( LDAP_DEBUG_TRACE,
731 " * msgid %d, type %lu\n",
733 (unsigned long)l->lm_msgtype, 0 );
737 Debug( LDAP_DEBUG_TRACE, " ld %p response count %d\n", (void *)ld, i, 0 );
739 #endif /* LDAP_DEBUG */
742 ldap_free_request_int( LDAP *ld, LDAPRequest *lr )
744 /* if lr_refcnt > 0, the request has been looked up
745 * by ldap_find_request_by_msgid(); if in the meanwhile
746 * the request is free()'d by someone else, just decrease
747 * the reference count and extract it from the request
748 * list; later on, it will be freed. */
749 if ( lr->lr_prev == NULL ) {
750 if ( lr->lr_refcnt == 0 ) {
751 /* free'ing the first request? */
752 assert( ld->ld_requests == lr );
755 if ( ld->ld_requests == lr ) {
756 ld->ld_requests = lr->lr_next;
760 lr->lr_prev->lr_next = lr->lr_next;
763 if ( lr->lr_next != NULL ) {
764 lr->lr_next->lr_prev = lr->lr_prev;
767 if ( lr->lr_refcnt > 0 ) {
768 lr->lr_refcnt = -lr->lr_refcnt;
776 if ( lr->lr_ber != NULL ) {
777 ber_free( lr->lr_ber, 1 );
781 if ( lr->lr_res_error != NULL ) {
782 LDAP_FREE( lr->lr_res_error );
783 lr->lr_res_error = NULL;
786 if ( lr->lr_res_matched != NULL ) {
787 LDAP_FREE( lr->lr_res_matched );
788 lr->lr_res_matched = NULL;
795 ldap_free_request( LDAP *ld, LDAPRequest *lr )
797 LDAPRequest **ttmplr;
798 #ifdef LDAP_R_COMPILE
799 LDAP_PVT_THREAD_ASSERT_MUTEX_OWNER( &ld->ld_req_mutex );
802 Debug( LDAP_DEBUG_TRACE, "ldap_free_request (origid %d, msgid %d)\n",
803 lr->lr_origid, lr->lr_msgid, 0 );
805 /* free all referrals (child requests) */
806 while ( lr->lr_child )
807 ldap_free_request( ld, lr->lr_child );
809 if ( lr->lr_parent != NULL ) {
810 --lr->lr_parent->lr_outrefcnt;
811 for ( ttmplr = &lr->lr_parent->lr_child;
812 *ttmplr && *ttmplr != lr;
813 ttmplr = &(*ttmplr)->lr_refnext );
815 *ttmplr = lr->lr_refnext;
817 ldap_free_request_int( ld, lr );
821 * call first time with *cntp = -1
822 * when returns *cntp == -1, no referrals are left
824 * NOTE: may replace *refsp, or shuffle the contents
825 * of the original array.
827 static int ldap_int_nextref(
833 assert( refsp != NULL );
834 assert( *refsp != NULL );
835 assert( cntp != NULL );
844 if ( (*refsp)[ *cntp ] == NULL ) {
855 * (IN) ld = LDAP connection handle
856 * (IN) lr = LDAP Request structure
857 * (IN) refs = array of pointers to referral strings that we will chase
858 * The array will be free'd by this function when no longer needed
859 * (IN) sref != 0 if following search reference
860 * (OUT) errstrp = Place to return a string of referrals which could not be followed
861 * (OUT) hadrefp = 1 if sucessfully followed referral
863 * Return value - number of referrals followed
866 ldap_chase_v3referrals( LDAP *ld, LDAPRequest *lr, char **refs, int sref, char **errstrp, int *hadrefp )
869 int unfollowedcnt = 0;
870 LDAPRequest *origreq;
871 LDAPURLDesc *srv = NULL;
873 char **refarray = NULL;
875 int rc, count, i, j, id;
878 ld->ld_errno = LDAP_SUCCESS; /* optimistic */
881 Debug( LDAP_DEBUG_TRACE, "ldap_chase_v3referrals\n", 0, 0, 0 );
886 /* If no referrals in array, return */
887 if ( (refs == NULL) || ( (refs)[0] == NULL) ) {
892 /* Check for hop limit exceeded */
893 if ( lr->lr_parentcnt >= ld->ld_refhoplimit ) {
894 Debug( LDAP_DEBUG_ANY,
895 "more than %d referral hops (dropping)\n", ld->ld_refhoplimit, 0, 0 );
896 ld->ld_errno = LDAP_REFERRAL_LIMIT_EXCEEDED;
901 /* find original request */
903 origreq->lr_parent != NULL;
904 origreq = origreq->lr_parent )
912 if ( ld->ld_nextref_proc == NULL ) {
913 ld->ld_nextref_proc = ldap_int_nextref;
916 /* parse out & follow referrals */
918 for ( ld->ld_nextref_proc( ld, &refarray, &i, ld->ld_nextref_params );
920 ld->ld_nextref_proc( ld, &refarray, &i, ld->ld_nextref_params ) )
923 /* Parse the referral URL */
924 rc = ldap_url_parse_ext( refarray[i], &srv, LDAP_PVT_URL_PARSE_NOEMPTY_DN );
925 if ( rc != LDAP_URL_SUCCESS ) {
926 /* ldap_url_parse_ext() returns LDAP_URL_* errors
927 * which do not map on API errors */
928 ld->ld_errno = LDAP_PARAM_ERROR;
933 if( srv->lud_crit_exts ) {
934 /* we do not support any extensions */
935 ld->ld_errno = LDAP_NOT_SUPPORTED;
940 /* check connection for re-bind in progress */
941 if (( lc = find_connection( ld, srv, 1 )) != NULL ) {
942 /* See if we've already requested this DN with this conn */
945 int len = srv->lud_dn ? strlen( srv->lud_dn ) : 0;
946 for ( lp = origreq; lp; ) {
947 if ( lp->lr_conn == lc
948 && len == lp->lr_dn.bv_len
950 && strncmp( srv->lud_dn, lp->lr_dn.bv_val, len ) == 0 )
955 if ( lp == origreq ) {
962 ldap_free_urllist( srv );
964 ld->ld_errno = LDAP_CLIENT_LOOP;
969 if ( lc->lconn_rebind_inprogress ) {
970 /* We are already chasing a referral or search reference and a
971 * bind on that connection is in progress. We must queue
972 * referrals on that connection, so we don't get a request
973 * going out before the bind operation completes. This happens
974 * if two search references come in one behind the other
975 * for the same server with different contexts.
977 Debug( LDAP_DEBUG_TRACE,
978 "ldap_chase_v3referrals: queue referral \"%s\"\n",
980 if( lc->lconn_rebind_queue == NULL ) {
981 /* Create a referral list */
982 lc->lconn_rebind_queue =
983 (char ***) LDAP_MALLOC( sizeof(void *) * 2);
985 if( lc->lconn_rebind_queue == NULL) {
986 ld->ld_errno = LDAP_NO_MEMORY;
991 lc->lconn_rebind_queue[0] = refarray;
992 lc->lconn_rebind_queue[1] = NULL;
996 /* Count how many referral arrays we already have */
997 for( j = 0; lc->lconn_rebind_queue[j] != NULL; j++) {
1001 /* Add the new referral to the list */
1002 lc->lconn_rebind_queue = (char ***) LDAP_REALLOC(
1003 lc->lconn_rebind_queue, sizeof(void *) * (j + 2));
1005 if( lc->lconn_rebind_queue == NULL ) {
1006 ld->ld_errno = LDAP_NO_MEMORY;
1010 lc->lconn_rebind_queue[j] = refarray;
1011 lc->lconn_rebind_queue[j+1] = NULL;
1015 /* We have queued the referral/reference, now just return */
1018 count = 1; /* Pretend we already followed referral */
1022 /* Re-encode the request with the new starting point of the search.
1023 * Note: In the future we also need to replace the filter if one
1024 * was provided with the search reference
1027 /* For references we don't want old dn if new dn empty */
1028 if ( sref && srv->lud_dn == NULL ) {
1029 srv->lud_dn = LDAP_STRDUP( "" );
1032 LDAP_NEXT_MSGID( ld, id );
1033 ber = re_encode_request( ld, origreq->lr_ber, id,
1034 sref, srv, &rinfo.ri_request );
1037 ld->ld_errno = LDAP_ENCODING_ERROR;
1042 Debug( LDAP_DEBUG_TRACE,
1043 "ldap_chase_v3referral: msgid %d, url \"%s\"\n",
1044 lr->lr_msgid, refarray[i], 0);
1046 /* Send the new request to the server - may require a bind */
1047 rinfo.ri_msgid = origreq->lr_origid;
1048 rinfo.ri_url = refarray[i];
1049 #ifdef LDAP_R_COMPILE
1050 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
1052 rc = ldap_send_server_request( ld, ber, id,
1053 origreq, &srv, NULL, &rinfo );
1054 #ifdef LDAP_R_COMPILE
1055 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
1058 /* Failure, try next referral in the list */
1059 Debug( LDAP_DEBUG_ANY, "Unable to chase referral \"%s\" (%d: %s)\n",
1060 refarray[i], ld->ld_errno, ldap_err2string( ld->ld_errno ) );
1061 unfollowedcnt += ldap_append_referral( ld, &unfollowed, refarray[i] );
1062 ldap_free_urllist( srv );
1064 ld->ld_errno = LDAP_REFERRAL;
1066 /* Success, no need to try this referral list further */
1071 /* check if there is a queue of referrals that came in during bind */
1073 lc = find_connection( ld, srv, 1 );
1075 ld->ld_errno = LDAP_OPERATIONS_ERROR;
1081 if ( lc->lconn_rebind_queue != NULL ) {
1082 /* Release resources of previous list */
1083 LDAP_VFREE( refarray );
1085 ldap_free_urllist( srv );
1088 /* Pull entries off end of queue so list always null terminated */
1089 for( j = 0; lc->lconn_rebind_queue[j] != NULL; j++ )
1091 refarray = lc->lconn_rebind_queue[j - 1];
1092 lc->lconn_rebind_queue[j-1] = NULL;
1093 /* we pulled off last entry from queue, free queue */
1095 LDAP_FREE( lc->lconn_rebind_queue );
1096 lc->lconn_rebind_queue = NULL;
1098 /* restart the loop the with new referral list */
1102 break; /* referral followed, break out of for loop */
1104 } /* end for loop */
1106 LDAP_VFREE( refarray );
1107 ldap_free_urllist( srv );
1108 LDAP_FREE( *errstrp );
1112 LDAP_FREE( unfollowed );
1115 *errstrp = unfollowed;
1121 * XXX merging of errors in this routine needs to be improved
1124 ldap_chase_referrals( LDAP *ld,
1132 char *p, *ref, *unfollowed;
1133 LDAPRequest *origreq;
1139 Debug( LDAP_DEBUG_TRACE, "ldap_chase_referrals\n", 0, 0, 0 );
1141 ld->ld_errno = LDAP_SUCCESS; /* optimistic */
1144 if ( *errstrp == NULL ) {
1148 len = strlen( *errstrp );
1149 for ( p = *errstrp; len >= LDAP_REF_STR_LEN; ++p, --len ) {
1150 if ( strncasecmp( p, LDAP_REF_STR, LDAP_REF_STR_LEN ) == 0 ) {
1152 p += LDAP_REF_STR_LEN;
1157 if ( len < LDAP_REF_STR_LEN ) {
1161 if ( lr->lr_parentcnt >= ld->ld_refhoplimit ) {
1162 Debug( LDAP_DEBUG_ANY,
1163 "more than %d referral hops (dropping)\n",
1164 ld->ld_refhoplimit, 0, 0 );
1165 /* XXX report as error in ld->ld_errno? */
1169 /* find original request */
1170 for ( origreq = lr; origreq->lr_parent != NULL;
1171 origreq = origreq->lr_parent ) {
1178 /* parse out & follow referrals */
1179 for ( ref = p; rc == 0 && ref != NULL; ref = p ) {
1180 p = strchr( ref, '\n' );
1185 rc = ldap_url_parse_ext( ref, &srv, LDAP_PVT_URL_PARSE_NOEMPTY_DN );
1186 if ( rc != LDAP_URL_SUCCESS ) {
1187 Debug( LDAP_DEBUG_TRACE,
1188 "ignoring %s referral <%s>\n",
1189 ref, rc == LDAP_URL_ERR_BADSCHEME ? "unknown" : "incorrect", 0 );
1190 rc = ldap_append_referral( ld, &unfollowed, ref );
1195 Debug( LDAP_DEBUG_TRACE,
1196 "chasing LDAP referral: <%s>\n", ref, 0, 0 );
1200 /* See if we've already been here */
1201 if (( lc = find_connection( ld, srv, 1 )) != NULL ) {
1204 int len = srv->lud_dn ? strlen( srv->lud_dn ) : 0;
1205 for ( lp = lr; lp; lp = lp->lr_parent ) {
1206 if ( lp->lr_conn == lc
1207 && len == lp->lr_dn.bv_len )
1209 if ( len && strncmp( srv->lud_dn, lp->lr_dn.bv_val, len ) )
1216 ldap_free_urllist(srv);
1217 ld->ld_errno = LDAP_CLIENT_LOOP;
1223 LDAP_NEXT_MSGID( ld, id );
1224 ber = re_encode_request( ld, origreq->lr_ber,
1225 id, sref, srv, &rinfo.ri_request );
1227 if ( ber == NULL ) {
1231 /* copy the complete referral for rebind process */
1232 rinfo.ri_url = LDAP_STRDUP( ref );
1234 rinfo.ri_msgid = origreq->lr_origid;
1236 #ifdef LDAP_R_COMPILE
1237 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
1239 rc = ldap_send_server_request( ld, ber, id,
1240 lr, &srv, NULL, &rinfo );
1241 #ifdef LDAP_R_COMPILE
1242 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
1245 LDAP_FREE( rinfo.ri_url );
1250 Debug( LDAP_DEBUG_ANY,
1251 "Unable to chase referral \"%s\" (%d: %s)\n",
1252 ref, ld->ld_errno, ldap_err2string( ld->ld_errno ) );
1253 rc = ldap_append_referral( ld, &unfollowed, ref );
1256 ldap_free_urllist(srv);
1259 LDAP_FREE( *errstrp );
1260 *errstrp = unfollowed;
1262 return(( rc == 0 ) ? count : rc );
1267 ldap_append_referral( LDAP *ld, char **referralsp, char *s )
1271 if ( *referralsp == NULL ) {
1273 *referralsp = (char *)LDAP_MALLOC( strlen( s ) + LDAP_REF_STR_LEN
1277 *referralsp = (char *)LDAP_REALLOC( *referralsp,
1278 strlen( *referralsp ) + strlen( s ) + 2 );
1281 if ( *referralsp == NULL ) {
1282 ld->ld_errno = LDAP_NO_MEMORY;
1287 strcpy( *referralsp, LDAP_REF_STR );
1289 strcat( *referralsp, "\n" );
1291 strcat( *referralsp, s );
1299 re_encode_request( LDAP *ld,
1300 BerElement *origber,
1307 * XXX this routine knows way too much about how the lber library works!
1315 BerElement tmpber, *ber;
1318 Debug( LDAP_DEBUG_TRACE,
1319 "re_encode_request: new msgid %ld, new dn <%s>\n",
1321 ( srv == NULL || srv->lud_dn == NULL) ? "NONE" : srv->lud_dn, 0 );
1326 * all LDAP requests are sequences that start with a message id.
1327 * For all except delete, this is followed by a sequence that is
1328 * tagged with the operation code. For delete, the provided DN
1329 * is not wrapped by a sequence.
1331 rtag = ber_scanf( &tmpber, "{it", /*}*/ &along, &tag );
1333 if ( rtag == LBER_ERROR ) {
1334 ld->ld_errno = LDAP_DECODING_ERROR;
1339 if ( tag == LDAP_REQ_BIND ) {
1340 /* bind requests have a version number before the DN & other stuff */
1341 rtag = ber_scanf( &tmpber, "{im" /*}*/, &ver, &dn );
1343 } else if ( tag == LDAP_REQ_DELETE ) {
1344 /* delete requests don't have a DN wrapping sequence */
1345 rtag = ber_scanf( &tmpber, "m", &dn );
1347 } else if ( tag == LDAP_REQ_SEARCH ) {
1348 /* search requests need to be re-scope-ed */
1349 rtag = ber_scanf( &tmpber, "{me" /*"}"*/, &dn, &scope );
1351 if( srv->lud_scope != LDAP_SCOPE_DEFAULT ) {
1352 /* use the scope provided in reference */
1353 scope = srv->lud_scope;
1355 } else if ( sref ) {
1356 /* use scope implied by previous operation
1359 * subtree -> subtree
1360 * subordinate -> subtree
1364 case LDAP_SCOPE_BASE:
1365 case LDAP_SCOPE_ONELEVEL:
1366 scope = LDAP_SCOPE_BASE;
1368 case LDAP_SCOPE_SUBTREE:
1369 case LDAP_SCOPE_SUBORDINATE:
1370 scope = LDAP_SCOPE_SUBTREE;
1376 rtag = ber_scanf( &tmpber, "{m" /*}*/, &dn );
1379 if( rtag == LBER_ERROR ) {
1380 ld->ld_errno = LDAP_DECODING_ERROR;
1384 /* restore character zero'd out by ber_scanf*/
1385 dn.bv_val[dn.bv_len] = tmpber.ber_tag;
1387 if (( ber = ldap_alloc_ber_with_options( ld )) == NULL ) {
1391 if ( srv->lud_dn ) {
1392 ber_str2bv( srv->lud_dn, 0, 0, &dn );
1395 if ( tag == LDAP_REQ_BIND ) {
1396 rc = ber_printf( ber, "{it{iO" /*}}*/, msgid, tag, ver, &dn );
1397 } else if ( tag == LDAP_REQ_DELETE ) {
1398 rc = ber_printf( ber, "{itON}", msgid, tag, &dn );
1399 } else if ( tag == LDAP_REQ_SEARCH ) {
1400 rc = ber_printf( ber, "{it{Oe" /*}}*/, msgid, tag, &dn, scope );
1402 rc = ber_printf( ber, "{it{O" /*}}*/, msgid, tag, &dn );
1406 ld->ld_errno = LDAP_ENCODING_ERROR;
1411 if ( tag != LDAP_REQ_DELETE && (
1412 ber_write(ber, tmpber.ber_ptr, ( tmpber.ber_end - tmpber.ber_ptr ), 0)
1413 != ( tmpber.ber_end - tmpber.ber_ptr ) ||
1414 ber_printf( ber, /*{{*/ "N}N}" ) == -1 ) )
1416 ld->ld_errno = LDAP_ENCODING_ERROR;
1422 if ( ldap_debug & LDAP_DEBUG_PACKETS ) {
1423 Debug( LDAP_DEBUG_ANY, "re_encode_request new request is:\n",
1425 ber_log_dump( LDAP_DEBUG_BER, ldap_debug, ber, 0 );
1427 #endif /* LDAP_DEBUG */
1429 *type = tag; /* return request type */
1435 ldap_find_request_by_msgid( LDAP *ld, ber_int_t msgid )
1439 #ifdef LDAP_R_COMPILE
1440 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
1442 for ( lr = ld->ld_requests; lr != NULL; lr = lr->lr_next ) {
1443 if ( lr->lr_status == LDAP_REQST_COMPLETED ) {
1444 continue; /* Skip completed requests */
1446 if ( msgid == lr->lr_msgid ) {
1451 #ifdef LDAP_R_COMPILE
1452 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
1459 ldap_return_request( LDAP *ld, LDAPRequest *lrx, int freeit )
1463 #ifdef LDAP_R_COMPILE
1464 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
1466 for ( lr = ld->ld_requests; lr != NULL; lr = lr->lr_next ) {
1468 if ( lr->lr_refcnt > 0 ) {
1471 } else if ( lr->lr_refcnt < 0 ) {
1473 if ( lr->lr_refcnt == 0 ) {
1481 ldap_free_request_int( ld, lrx );
1483 } else if ( freeit ) {
1484 ldap_free_request( ld, lrx );
1486 #ifdef LDAP_R_COMPILE
1487 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );