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 if (( ber = ber_alloc_t( ld->ld_lberoptions )) == NULL ) {
74 ld->ld_errno = LDAP_NO_MEMORY;
82 ldap_set_ber_options( LDAP *ld, BerElement *ber )
84 ber->ber_options = ld->ld_lberoptions;
89 ldap_send_initial_request(
98 Debug( LDAP_DEBUG_TRACE, "ldap_send_initial_request\n", 0, 0, 0 );
100 #ifdef LDAP_R_COMPILE
101 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
103 if ( ber_sockbuf_ctrl( ld->ld_sb, LBER_SB_OPT_GET_FD, NULL ) == -1 ) {
104 /* not connected yet */
105 rc = ldap_open_defconn( ld );
108 #ifdef LDAP_R_COMPILE
109 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
114 } else if ( rc == 0 ) {
115 Debug( LDAP_DEBUG_TRACE,
116 "ldap_open_defconn: successful\n",
120 #ifdef LDAP_CONNECTIONLESS
121 if (LDAP_IS_UDP(ld)) {
122 if (msgtype == LDAP_REQ_BIND) {
123 if (ld->ld_options.ldo_cldapdn)
124 ldap_memfree(ld->ld_options.ldo_cldapdn);
125 ld->ld_options.ldo_cldapdn = ldap_strdup(dn);
128 if (msgtype != LDAP_REQ_ABANDON && msgtype != LDAP_REQ_SEARCH)
129 return LDAP_PARAM_ERROR;
132 #ifdef LDAP_R_COMPILE
133 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
135 rc = ldap_send_server_request( ld, ber, msgid, NULL,
137 #ifdef LDAP_R_COMPILE
138 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
145 ldap_int_flush_request(
149 LDAPConn *lc = lr->lr_conn;
151 if ( ber_flush( lc->lconn_sb, lr->lr_ber, 0 ) != 0 ) {
152 if ( errno == EAGAIN ) {
153 /* need to continue write later */
154 lr->lr_status = LDAP_REQST_WRITING;
155 ldap_mark_select_write( ld, lc->lconn_sb );
156 ld->ld_errno = LDAP_BUSY;
159 ld->ld_errno = LDAP_SERVER_DOWN;
160 ldap_free_request( ld, lr );
161 ldap_free_connection( ld, lc, 0, 0 );
165 if ( lr->lr_parent == NULL ) {
166 lr->lr_ber->ber_end = lr->lr_ber->ber_ptr;
167 lr->lr_ber->ber_ptr = lr->lr_ber->ber_buf;
169 lr->lr_status = LDAP_REQST_INPROGRESS;
171 /* sent -- waiting for a response */
172 ldap_mark_select_read( ld, lc->lconn_sb );
178 ldap_send_server_request(
182 LDAPRequest *parentreq,
183 LDAPURLDesc *srvlist,
190 Debug( LDAP_DEBUG_TRACE, "ldap_send_server_request\n", 0, 0, 0 );
193 ld->ld_errno = LDAP_SUCCESS; /* optimistic */
196 if ( srvlist == NULL ) {
199 lc = find_connection( ld, srvlist, 1 );
201 if ( (bind != NULL) && (parentreq != NULL) ) {
202 /* Remember the bind in the parent */
204 ++parentreq->lr_outrefcnt;
206 lc = ldap_new_connection( ld, srvlist, 0, 1, bind );
211 if ( lc == NULL || lc->lconn_status != LDAP_CONNST_CONNECTED ) {
213 if ( ld->ld_errno == LDAP_SUCCESS ) {
214 ld->ld_errno = LDAP_SERVER_DOWN;
217 /* Forget about the bind */
218 --parentreq->lr_outrefcnt;
223 use_connection( ld, lc );
225 /* If we still have an incomplete write, try to finish it before
226 * dealing with the new request. If we don't finish here, return
227 * LDAP_BUSY and let the caller retry later. We only allow a single
228 * request to be in WRITING state.
231 if ( ld->ld_requests &&
232 ld->ld_requests->lr_status == LDAP_REQST_WRITING &&
233 ldap_int_flush_request( ld, ld->ld_requests ) < 0 )
239 lr = (LDAPRequest *)LDAP_CALLOC( 1, sizeof( LDAPRequest ));
241 ld->ld_errno = LDAP_NO_MEMORY;
242 ldap_free_connection( ld, lc, 0, 0 );
245 /* Forget about the bind */
246 --parentreq->lr_outrefcnt;
250 lr->lr_msgid = msgid;
251 lr->lr_status = LDAP_REQST_INPROGRESS;
252 lr->lr_res_errno = LDAP_SUCCESS; /* optimistic */
255 if ( parentreq != NULL ) { /* sub-request */
257 /* Increment if we didn't do it before the bind */
258 ++parentreq->lr_outrefcnt;
260 lr->lr_origid = parentreq->lr_origid;
261 lr->lr_parentcnt = ++parentreq->lr_parentcnt;
262 lr->lr_parent = parentreq;
263 lr->lr_refnext = parentreq->lr_child;
264 parentreq->lr_child = lr;
265 } else { /* original request */
266 lr->lr_origid = lr->lr_msgid;
269 /* Extract requestDN for future reference */
271 BerElement tmpber = *ber;
275 ber_reset( &tmpber, 1 );
276 rtag = ber_scanf( &tmpber, "{it", /*}*/ &bint, &tag );
279 rtag = ber_scanf( &tmpber, "{i" /*}*/, &bint );
281 case LDAP_REQ_DELETE:
284 rtag = ber_scanf( &tmpber, "{" /*}*/ );
285 case LDAP_REQ_ABANDON:
288 if ( tag != LDAP_REQ_ABANDON ) {
289 ber_skip_tag( &tmpber, &lr->lr_dn.bv_len );
290 lr->lr_dn.bv_val = tmpber.ber_ptr;
295 if (( lr->lr_next = ld->ld_requests ) != NULL ) {
296 lr->lr_next->lr_prev = lr;
298 ld->ld_requests = lr;
300 ld->ld_errno = LDAP_SUCCESS;
301 if ( ldap_int_flush_request( ld, lr ) == -1 ) {
309 ldap_new_connection( LDAP *ld, LDAPURLDesc *srvlist, int use_ldsb,
310 int connect, LDAPreqinfo *bind )
315 Debug( LDAP_DEBUG_TRACE, "ldap_new_connection %d %d %d\n",
316 use_ldsb, connect, (bind != NULL) );
318 * make a new LDAP server connection
319 * XXX open connection synchronously for now
321 lc = (LDAPConn *)LDAP_CALLOC( 1, sizeof( LDAPConn ) );
323 ld->ld_errno = LDAP_NO_MEMORY;
328 assert( ld->ld_sb != NULL );
329 lc->lconn_sb = ld->ld_sb;
332 lc->lconn_sb = ber_sockbuf_alloc();
333 if ( lc->lconn_sb == NULL ) {
334 LDAP_FREE( (char *)lc );
335 ld->ld_errno = LDAP_NO_MEMORY;
341 for ( srv = srvlist; srv != NULL; srv = srv->lud_next ) {
342 if ( ldap_int_open_connection( ld, lc, srv, 0 ) != -1 )
350 ber_sockbuf_free( lc->lconn_sb );
352 LDAP_FREE( (char *)lc );
353 ld->ld_errno = LDAP_SERVER_DOWN;
357 lc->lconn_server = ldap_url_dup( srv );
360 lc->lconn_status = LDAP_CONNST_CONNECTED;
361 #ifdef LDAP_R_COMPILE
362 ldap_pvt_thread_mutex_lock( &ld->ld_conn_mutex );
364 lc->lconn_next = ld->ld_conns;
366 #ifdef LDAP_R_COMPILE
367 ldap_pvt_thread_mutex_unlock( &ld->ld_conn_mutex );
371 * XXX for now, we always do a synchronous bind. This will have
372 * to change in the long run...
376 LDAPConn *savedefconn;
378 /* Set flag to prevent additional referrals
379 * from being processed on this
380 * connection until the bind has completed
382 lc->lconn_rebind_inprogress = 1;
383 /* V3 rebind function */
384 if ( ld->ld_rebind_proc != NULL) {
385 LDAPURLDesc *srvfunc;
387 srvfunc = ldap_url_dup( srvlist );
388 if ( srvfunc == NULL ) {
389 ld->ld_errno = LDAP_NO_MEMORY;
392 savedefconn = ld->ld_defconn;
393 ++lc->lconn_refcnt; /* avoid premature free */
396 Debug( LDAP_DEBUG_TRACE, "Call application rebind_proc\n", 0, 0, 0);
397 #ifdef LDAP_R_COMPILE
398 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
399 ldap_pvt_thread_mutex_unlock( &ld->ld_res_mutex );
401 err = (*ld->ld_rebind_proc)( ld,
402 bind->ri_url, bind->ri_request, bind->ri_msgid,
403 ld->ld_rebind_params );
404 #ifdef LDAP_R_COMPILE
405 ldap_pvt_thread_mutex_lock( &ld->ld_res_mutex );
406 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
409 ld->ld_defconn = savedefconn;
414 ldap_free_connection( ld, lc, 1, 0 );
417 ldap_free_urldesc( srvfunc );
421 struct berval passwd = BER_BVNULL;
423 savedefconn = ld->ld_defconn;
424 ++lc->lconn_refcnt; /* avoid premature free */
427 Debug( LDAP_DEBUG_TRACE, "anonymous rebind via ldap_bind_s\n", 0, 0, 0);
428 #ifdef LDAP_R_COMPILE
429 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
430 ldap_pvt_thread_mutex_unlock( &ld->ld_res_mutex );
432 rc = ldap_sasl_bind( ld, "", LDAP_SASL_SIMPLE, &passwd,
433 NULL, NULL, &msgid );
434 if ( rc != LDAP_SUCCESS ) {
438 for ( err = 1; err > 0; ) {
439 struct timeval tv = { 0, 100000 };
440 LDAPMessage *res = NULL;
442 switch ( ldap_result( ld, msgid, LDAP_MSG_ALL, &tv, &res ) ) {
448 #ifdef LDAP_R_COMPILE
449 ldap_pvt_thread_yield();
454 rc = ldap_parse_result( ld, res, &err, NULL, NULL, NULL, NULL, 1 );
455 if ( rc != LDAP_SUCCESS ) {
458 } else if ( err != LDAP_SUCCESS ) {
461 /* else err == LDAP_SUCCESS == 0 */
469 #ifdef LDAP_R_COMPILE
470 ldap_pvt_thread_mutex_lock( &ld->ld_res_mutex );
471 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
473 ld->ld_defconn = savedefconn;
477 ldap_free_connection( ld, lc, 1, 0 );
482 lc->lconn_rebind_inprogress = 0;
490 find_connection( LDAP *ld, LDAPURLDesc *srv, int any )
492 * return an existing connection (if any) to the server srv
493 * if "any" is non-zero, check for any server in the "srv" chain
497 LDAPURLDesc *lcu, *lsu;
498 int lcu_port, lsu_port;
501 #ifdef LDAP_R_COMPILE
502 ldap_pvt_thread_mutex_lock( &ld->ld_conn_mutex );
504 for ( lc = ld->ld_conns; lc != NULL; lc = lc->lconn_next ) {
505 lcu = lc->lconn_server;
506 lcu_port = ldap_pvt_url_scheme_port( lcu->lud_scheme,
509 for ( lsu = srv; lsu != NULL; lsu = lsu->lud_next ) {
510 lsu_port = ldap_pvt_url_scheme_port( lsu->lud_scheme,
513 if ( lsu_port == lcu_port
514 && strcmp( lcu->lud_scheme, lsu->lud_scheme ) == 0
515 && lcu->lud_host != NULL && *lcu->lud_host != '\0'
516 && lsu->lud_host != NULL && *lsu->lud_host != '\0'
517 && strcasecmp( lsu->lud_host, lcu->lud_host ) == 0 )
528 #ifdef LDAP_R_COMPILE
529 ldap_pvt_thread_mutex_unlock( &ld->ld_conn_mutex );
537 use_connection( LDAP *ld, LDAPConn *lc )
540 lc->lconn_lastused = time( NULL );
545 ldap_free_connection( LDAP *ld, LDAPConn *lc, int force, int unbind )
547 LDAPConn *tmplc, *prevlc;
549 Debug( LDAP_DEBUG_TRACE,
550 "ldap_free_connection %d %d\n",
553 if ( force || --lc->lconn_refcnt <= 0 ) {
554 if ( lc->lconn_status == LDAP_CONNST_CONNECTED ) {
555 ldap_mark_select_clear( ld, lc->lconn_sb );
557 ldap_send_unbind( ld, lc->lconn_sb,
562 if ( lc->lconn_ber != NULL ) {
563 ber_free( lc->lconn_ber, 1 );
566 ldap_int_sasl_close( ld, lc );
569 #ifdef LDAP_R_COMPILE
570 ldap_pvt_thread_mutex_lock( &ld->ld_conn_mutex );
572 for ( tmplc = ld->ld_conns;
574 tmplc = tmplc->lconn_next )
577 if ( prevlc == NULL ) {
578 ld->ld_conns = tmplc->lconn_next;
580 prevlc->lconn_next = tmplc->lconn_next;
586 #ifdef LDAP_R_COMPILE
587 ldap_pvt_thread_mutex_unlock( &ld->ld_conn_mutex );
589 ldap_free_urllist( lc->lconn_server );
590 #ifdef LDAP_API_FEATURE_X_OPENLDAP_V2_KBIND
591 if ( lc->lconn_krbinstance != NULL ) {
592 LDAP_FREE( lc->lconn_krbinstance );
596 /* FIXME: is this at all possible? */
600 for ( lr = ld->ld_requests; lr; ) {
601 LDAPRequest *lr_next = lr->lr_next;
603 if ( lr->lr_conn == lc ) {
604 ldap_free_request_int( ld, lr );
610 if ( lc->lconn_sb != ld->ld_sb ) {
611 ber_sockbuf_free( lc->lconn_sb );
613 if ( lc->lconn_rebind_queue != NULL) {
615 for( i = 0; lc->lconn_rebind_queue[i] != NULL; i++ ) {
616 LDAP_VFREE( lc->lconn_rebind_queue[i] );
618 LDAP_FREE( lc->lconn_rebind_queue );
621 Debug( LDAP_DEBUG_TRACE,
622 "ldap_free_connection: actually freed\n",
625 lc->lconn_lastused = time( NULL );
626 Debug( LDAP_DEBUG_TRACE, "ldap_free_connection: refcnt %d\n",
627 lc->lconn_refcnt, 0, 0 );
634 ldap_dump_connection( LDAP *ld, LDAPConn *lconns, int all )
639 fprintf( stderr, "** ld %p Connection%s:\n", (void *)ld, all ? "s" : "" );
640 for ( lc = lconns; lc != NULL; lc = lc->lconn_next ) {
641 if ( lc->lconn_server != NULL ) {
642 fprintf( stderr, "* host: %s port: %d%s\n",
643 ( lc->lconn_server->lud_host == NULL ) ? "(null)"
644 : lc->lconn_server->lud_host,
645 lc->lconn_server->lud_port, ( lc->lconn_sb ==
646 ld->ld_sb ) ? " (default)" : "" );
648 fprintf( stderr, " refcnt: %d status: %s\n", lc->lconn_refcnt,
649 ( lc->lconn_status == LDAP_CONNST_NEEDSOCKET ) ?
650 "NeedSocket" : ( lc->lconn_status ==
651 LDAP_CONNST_CONNECTING ) ? "Connecting" : "Connected" );
652 fprintf( stderr, " last used: %s",
653 ldap_pvt_ctime( &lc->lconn_lastused, timebuf ));
654 if( lc->lconn_rebind_inprogress ) {
655 fprintf( stderr, " rebind in progress\n");
656 if( lc->lconn_rebind_queue != NULL) {
658 for( ;lc->lconn_rebind_queue[i] != NULL; i++) {
660 for( ;lc->lconn_rebind_queue[i][j] != 0; j++) {
661 fprintf( stderr, " queue %d entry %d - %s\n",
662 i, j, lc->lconn_rebind_queue[i][j]);
666 fprintf( stderr, " queue is empty\n");
669 fprintf(stderr, "\n");
678 ldap_dump_requests_and_responses( LDAP *ld )
683 #ifdef LDAP_R_COMPILE
684 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
686 fprintf( stderr, "** ld %p Outstanding Requests:\n", (void *)ld );
687 if (( lr = ld->ld_requests ) == NULL ) {
688 fprintf( stderr, " Empty\n" );
690 for ( ; lr != NULL; lr = lr->lr_next ) {
691 fprintf( stderr, " * msgid %d, origid %d, status %s\n",
692 lr->lr_msgid, lr->lr_origid,
693 ( lr->lr_status == LDAP_REQST_INPROGRESS ) ? "InProgress" :
694 ( lr->lr_status == LDAP_REQST_CHASINGREFS ) ? "ChasingRefs" :
695 ( lr->lr_status == LDAP_REQST_NOTCONNECTED ) ? "NotConnected" :
696 ( lr->lr_status == LDAP_REQST_WRITING) ? "Writing" :
697 ( lr->lr_status == LDAP_REQST_COMPLETED ? "RequestCompleted"
699 fprintf( stderr, " outstanding referrals %d, parent count %d\n",
700 lr->lr_outrefcnt, lr->lr_parentcnt );
702 #ifdef LDAP_R_COMPILE
703 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
705 fprintf( stderr, "** ld %p Response Queue:\n", (void *)ld );
706 if (( lm = ld->ld_responses ) == NULL ) {
707 fprintf( stderr, " Empty\n" );
709 for ( ; lm != NULL; lm = lm->lm_next ) {
710 fprintf( stderr, " * msgid %d, type %lu\n",
711 lm->lm_msgid, (unsigned long) lm->lm_msgtype );
712 if (( l = lm->lm_chain ) != NULL ) {
713 fprintf( stderr, " chained responses:\n" );
714 for ( ; l != NULL; l = l->lm_chain ) {
716 " * msgid %d, type %lu\n",
718 (unsigned long) l->lm_msgtype );
723 #endif /* LDAP_DEBUG */
726 ldap_free_request_int( LDAP *ld, LDAPRequest *lr )
728 if ( lr->lr_prev == NULL ) {
729 /* free'ing the first request? */
730 assert( ld->ld_requests == lr );
731 ld->ld_requests = lr->lr_next;
734 lr->lr_prev->lr_next = lr->lr_next;
737 if ( lr->lr_next != NULL ) {
738 lr->lr_next->lr_prev = lr->lr_prev;
741 if ( lr->lr_ber != NULL ) {
742 ber_free( lr->lr_ber, 1 );
745 if ( lr->lr_res_error != NULL ) {
746 LDAP_FREE( lr->lr_res_error );
749 if ( lr->lr_res_matched != NULL ) {
750 LDAP_FREE( lr->lr_res_matched );
757 ldap_free_request( LDAP *ld, LDAPRequest *lr )
759 LDAPRequest **ttmplr;
761 Debug( LDAP_DEBUG_TRACE, "ldap_free_request (origid %d, msgid %d)\n",
762 lr->lr_origid, lr->lr_msgid, 0 );
764 /* free all referrals (child requests) */
765 while ( lr->lr_child )
766 ldap_free_request( ld, lr->lr_child );
768 if ( lr->lr_parent != NULL ) {
769 --lr->lr_parent->lr_outrefcnt;
770 for ( ttmplr = &lr->lr_parent->lr_child; *ttmplr && *ttmplr != lr; ttmplr = &(*ttmplr)->lr_refnext );
772 *ttmplr = lr->lr_refnext;
774 ldap_free_request_int( ld, lr );
778 * call first time with *cntp = -1
779 * when returns *cntp == -1, no referrals are left
781 * NOTE: may replace *refsp, or shuffle the contents
782 * of the original array.
784 static int ldap_int_nextref(
790 assert( refsp != NULL );
791 assert( *refsp != NULL );
792 assert( cntp != NULL );
801 if ( (*refsp)[ *cntp ] == NULL ) {
812 * (IN) ld = LDAP connection handle
813 * (IN) lr = LDAP Request structure
814 * (IN) refs = array of pointers to referral strings that we will chase
815 * The array will be free'd by this function when no longer needed
816 * (IN) sref != 0 if following search reference
817 * (OUT) errstrp = Place to return a string of referrals which could not be followed
818 * (OUT) hadrefp = 1 if sucessfully followed referral
820 * Return value - number of referrals followed
823 ldap_chase_v3referrals( LDAP *ld, LDAPRequest *lr, char **refs, int sref, char **errstrp, int *hadrefp )
826 int unfollowedcnt = 0;
827 LDAPRequest *origreq;
828 LDAPURLDesc *srv = NULL;
830 char **refarray = NULL;
832 int rc, count, i, j, id;
835 ld->ld_errno = LDAP_SUCCESS; /* optimistic */
838 Debug( LDAP_DEBUG_TRACE, "ldap_chase_v3referrals\n", 0, 0, 0 );
843 /* If no referrals in array, return */
844 if ( (refs == NULL) || ( (refs)[0] == NULL) ) {
849 /* Check for hop limit exceeded */
850 if ( lr->lr_parentcnt >= ld->ld_refhoplimit ) {
851 Debug( LDAP_DEBUG_ANY,
852 "more than %d referral hops (dropping)\n", ld->ld_refhoplimit, 0, 0 );
853 ld->ld_errno = LDAP_REFERRAL_LIMIT_EXCEEDED;
858 /* find original request */
860 origreq->lr_parent != NULL;
861 origreq = origreq->lr_parent )
869 if ( ld->ld_nextref_proc == NULL ) {
870 ld->ld_nextref_proc = ldap_int_nextref;
873 /* parse out & follow referrals */
875 for ( ld->ld_nextref_proc( ld, &refarray, &i, ld->ld_nextref_params );
877 ld->ld_nextref_proc( ld, &refarray, &i, ld->ld_nextref_params ) )
880 /* Parse the referral URL */
881 if (( rc = ldap_url_parse_ext( refarray[i], &srv)) != LDAP_SUCCESS) {
887 if( srv->lud_crit_exts ) {
888 /* we do not support any extensions */
889 ld->ld_errno = LDAP_NOT_SUPPORTED;
894 /* treat ldap://hostpart and ldap://hostpart/ the same */
895 if ( srv->lud_dn && srv->lud_dn[0] == '\0' ) {
896 LDAP_FREE( srv->lud_dn );
900 /* check connection for re-bind in progress */
901 if (( lc = find_connection( ld, srv, 1 )) != NULL ) {
902 /* See if we've already requested this DN with this conn */
905 int len = srv->lud_dn ? strlen( srv->lud_dn ) : 0;
906 for ( lp = origreq; lp; ) {
907 if ( lp->lr_conn == lc ) {
908 if ( len == lp->lr_dn.bv_len
910 && strncmp( srv->lud_dn, lp->lr_dn.bv_val, len ) == 0 )
916 if ( lp == origreq ) {
923 ldap_free_urllist( srv );
925 ld->ld_errno = LDAP_CLIENT_LOOP;
930 if ( lc->lconn_rebind_inprogress ) {
931 /* We are already chasing a referral or search reference and a
932 * bind on that connection is in progress. We must queue
933 * referrals on that connection, so we don't get a request
934 * going out before the bind operation completes. This happens
935 * if two search references come in one behind the other
936 * for the same server with different contexts.
938 Debug( LDAP_DEBUG_TRACE,
939 "ldap_chase_v3referrals: queue referral \"%s\"\n",
941 if( lc->lconn_rebind_queue == NULL ) {
942 /* Create a referral list */
943 lc->lconn_rebind_queue =
944 (char ***) LDAP_MALLOC( sizeof(void *) * 2);
946 if( lc->lconn_rebind_queue == NULL) {
947 ld->ld_errno = LDAP_NO_MEMORY;
952 lc->lconn_rebind_queue[0] = refarray;
953 lc->lconn_rebind_queue[1] = NULL;
957 /* Count how many referral arrays we already have */
958 for( j = 0; lc->lconn_rebind_queue[j] != NULL; j++) {
962 /* Add the new referral to the list */
963 lc->lconn_rebind_queue = (char ***) LDAP_REALLOC(
964 lc->lconn_rebind_queue, sizeof(void *) * (j + 2));
966 if( lc->lconn_rebind_queue == NULL ) {
967 ld->ld_errno = LDAP_NO_MEMORY;
971 lc->lconn_rebind_queue[j] = refarray;
972 lc->lconn_rebind_queue[j+1] = NULL;
976 /* We have queued the referral/reference, now just return */
979 count = 1; /* Pretend we already followed referral */
983 /* Re-encode the request with the new starting point of the search.
984 * Note: In the future we also need to replace the filter if one
985 * was provided with the search reference
988 /* For references we don't want old dn if new dn empty */
989 if ( sref && srv->lud_dn == NULL ) {
990 srv->lud_dn = LDAP_STRDUP( "" );
993 LDAP_NEXT_MSGID( ld, id );
994 ber = re_encode_request( ld, origreq->lr_ber, id,
995 sref, srv, &rinfo.ri_request );
998 ld->ld_errno = LDAP_ENCODING_ERROR;
1003 Debug( LDAP_DEBUG_TRACE,
1004 "ldap_chase_v3referral: msgid %d, url \"%s\"\n",
1005 lr->lr_msgid, refarray[i], 0);
1007 /* Send the new request to the server - may require a bind */
1008 rinfo.ri_msgid = origreq->lr_origid;
1009 rinfo.ri_url = refarray[i];
1010 #ifdef LDAP_R_COMPILE
1011 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
1013 rc = ldap_send_server_request( ld, ber, id,
1014 origreq, srv, NULL, &rinfo );
1015 #ifdef LDAP_R_COMPILE
1016 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
1019 /* Failure, try next referral in the list */
1020 Debug( LDAP_DEBUG_ANY, "Unable to chase referral \"%s\" (%d: %s)\n",
1021 refarray[i], ld->ld_errno, ldap_err2string( ld->ld_errno ) );
1022 unfollowedcnt += ldap_append_referral( ld, &unfollowed, refarray[i] );
1023 ldap_free_urllist( srv );
1025 ld->ld_errno = LDAP_REFERRAL;
1027 /* Success, no need to try this referral list further */
1032 /* check if there is a queue of referrals that came in during bind */
1034 lc = find_connection( ld, srv, 1 );
1036 ld->ld_errno = LDAP_OPERATIONS_ERROR;
1042 if ( lc->lconn_rebind_queue != NULL ) {
1043 /* Release resources of previous list */
1044 LDAP_VFREE( refarray );
1046 ldap_free_urllist( srv );
1049 /* Pull entries off end of queue so list always null terminated */
1050 for( j = 0; lc->lconn_rebind_queue[j] != NULL; j++ )
1052 refarray = lc->lconn_rebind_queue[j - 1];
1053 lc->lconn_rebind_queue[j-1] = NULL;
1054 /* we pulled off last entry from queue, free queue */
1056 LDAP_FREE( lc->lconn_rebind_queue );
1057 lc->lconn_rebind_queue = NULL;
1059 /* restart the loop the with new referral list */
1063 break; /* referral followed, break out of for loop */
1065 } /* end for loop */
1067 LDAP_VFREE( refarray );
1068 ldap_free_urllist( srv );
1069 LDAP_FREE( *errstrp );
1073 LDAP_FREE( unfollowed );
1076 *errstrp = unfollowed;
1082 * XXX merging of errors in this routine needs to be improved
1085 ldap_chase_referrals( LDAP *ld,
1093 char *p, *ref, *unfollowed;
1094 LDAPRequest *origreq;
1100 Debug( LDAP_DEBUG_TRACE, "ldap_chase_referrals\n", 0, 0, 0 );
1102 ld->ld_errno = LDAP_SUCCESS; /* optimistic */
1105 if ( *errstrp == NULL ) {
1109 len = strlen( *errstrp );
1110 for ( p = *errstrp; len >= LDAP_REF_STR_LEN; ++p, --len ) {
1111 if ( strncasecmp( p, LDAP_REF_STR, LDAP_REF_STR_LEN ) == 0 ) {
1113 p += LDAP_REF_STR_LEN;
1118 if ( len < LDAP_REF_STR_LEN ) {
1122 if ( lr->lr_parentcnt >= ld->ld_refhoplimit ) {
1123 Debug( LDAP_DEBUG_ANY,
1124 "more than %d referral hops (dropping)\n",
1125 ld->ld_refhoplimit, 0, 0 );
1126 /* XXX report as error in ld->ld_errno? */
1130 /* find original request */
1131 for ( origreq = lr; origreq->lr_parent != NULL;
1132 origreq = origreq->lr_parent ) {
1139 /* parse out & follow referrals */
1140 for ( ref = p; rc == 0 && ref != NULL; ref = p ) {
1141 p = strchr( ref, '\n' );
1146 rc = ldap_url_parse_ext( ref, &srv );
1148 if ( rc != LDAP_URL_SUCCESS ) {
1149 Debug( LDAP_DEBUG_TRACE,
1150 "ignoring unknown referral <%s>\n", ref, 0, 0 );
1151 rc = ldap_append_referral( ld, &unfollowed, ref );
1156 if ( srv->lud_dn != NULL && srv->lud_dn == '\0' ) {
1157 LDAP_FREE( srv->lud_dn );
1161 Debug( LDAP_DEBUG_TRACE,
1162 "chasing LDAP referral: <%s>\n", ref, 0, 0 );
1166 /* See if we've already been here */
1167 if (( lc = find_connection( ld, srv, 1 )) != NULL ) {
1170 int len = srv->lud_dn ? strlen( srv->lud_dn ) : 0;
1171 for (lp = lr; lp; lp = lp->lr_parent ) {
1172 if ( lp->lr_conn == lc ) {
1173 if ( len == lp->lr_dn.bv_len ) {
1174 if ( len && strncmp( srv->lud_dn, lp->lr_dn.bv_val,
1183 ldap_free_urllist(srv);
1184 ld->ld_errno = LDAP_CLIENT_LOOP;
1190 LDAP_NEXT_MSGID( ld, id );
1191 ber = re_encode_request( ld, origreq->lr_ber,
1192 id, sref, srv, &rinfo.ri_request );
1194 if ( ber == NULL ) {
1198 /* copy the complete referral for rebind process */
1199 rinfo.ri_url = LDAP_STRDUP( ref );
1201 rinfo.ri_msgid = origreq->lr_origid;
1203 #ifdef LDAP_R_COMPILE
1204 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
1206 rc = ldap_send_server_request( ld, ber, id,
1207 lr, srv, NULL, &rinfo );
1208 #ifdef LDAP_R_COMPILE
1209 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
1212 LDAP_FREE( rinfo.ri_url );
1217 Debug( LDAP_DEBUG_ANY,
1218 "Unable to chase referral \"%s\" (%d: %s)\n",
1219 ref, ld->ld_errno, ldap_err2string( ld->ld_errno ) );
1220 rc = ldap_append_referral( ld, &unfollowed, ref );
1223 ldap_free_urllist(srv);
1226 LDAP_FREE( *errstrp );
1227 *errstrp = unfollowed;
1229 return(( rc == 0 ) ? count : rc );
1234 ldap_append_referral( LDAP *ld, char **referralsp, char *s )
1238 if ( *referralsp == NULL ) {
1240 *referralsp = (char *)LDAP_MALLOC( strlen( s ) + LDAP_REF_STR_LEN
1244 *referralsp = (char *)LDAP_REALLOC( *referralsp,
1245 strlen( *referralsp ) + strlen( s ) + 2 );
1248 if ( *referralsp == NULL ) {
1249 ld->ld_errno = LDAP_NO_MEMORY;
1254 strcpy( *referralsp, LDAP_REF_STR );
1256 strcat( *referralsp, "\n" );
1258 strcat( *referralsp, s );
1266 re_encode_request( LDAP *ld,
1267 BerElement *origber,
1274 * XXX this routine knows way too much about how the lber library works!
1282 BerElement tmpber, *ber;
1285 Debug( LDAP_DEBUG_TRACE,
1286 "re_encode_request: new msgid %ld, new dn <%s>\n",
1288 ( srv == NULL || srv->lud_dn == NULL) ? "NONE" : srv->lud_dn, 0 );
1293 * all LDAP requests are sequences that start with a message id.
1294 * For all except delete, this is followed by a sequence that is
1295 * tagged with the operation code. For delete, the provided DN
1296 * is not wrapped by a sequence.
1298 rtag = ber_scanf( &tmpber, "{it", /*}*/ &along, &tag );
1300 if ( rtag == LBER_ERROR ) {
1301 ld->ld_errno = LDAP_DECODING_ERROR;
1306 if ( tag == LDAP_REQ_BIND ) {
1307 /* bind requests have a version number before the DN & other stuff */
1308 rtag = ber_scanf( &tmpber, "{im" /*}*/, &ver, &dn );
1310 } else if ( tag == LDAP_REQ_DELETE ) {
1311 /* delete requests don't have a DN wrapping sequence */
1312 rtag = ber_scanf( &tmpber, "m", &dn );
1314 } else if ( tag == LDAP_REQ_SEARCH ) {
1315 /* search requests need to be re-scope-ed */
1316 rtag = ber_scanf( &tmpber, "{me" /*"}"*/, &dn, &scope );
1318 if( srv->lud_scope != LDAP_SCOPE_DEFAULT ) {
1319 /* use the scope provided in reference */
1320 scope = srv->lud_scope;
1322 } else if ( sref ) {
1323 /* use scope implied by previous operation
1326 * subtree -> subtree
1327 * subordinate -> subtree
1331 case LDAP_SCOPE_BASE:
1332 case LDAP_SCOPE_ONELEVEL:
1333 scope = LDAP_SCOPE_BASE;
1335 case LDAP_SCOPE_SUBTREE:
1336 #ifdef LDAP_SCOPE_SUBORDINATE
1337 case LDAP_SCOPE_SUBORDINATE:
1339 scope = LDAP_SCOPE_SUBTREE;
1345 rtag = ber_scanf( &tmpber, "{m" /*}*/, &dn );
1348 if( rtag == LBER_ERROR ) {
1349 ld->ld_errno = LDAP_DECODING_ERROR;
1353 /* restore character zero'd out by ber_scanf*/
1354 dn.bv_val[dn.bv_len] = tmpber.ber_tag;
1356 if (( ber = ldap_alloc_ber_with_options( ld )) == NULL ) {
1360 if ( srv->lud_dn ) {
1361 ber_str2bv( srv->lud_dn, 0, 0, &dn );
1364 if ( tag == LDAP_REQ_BIND ) {
1365 rc = ber_printf( ber, "{it{iO" /*}}*/, msgid, tag, ver, &dn );
1366 } else if ( tag == LDAP_REQ_DELETE ) {
1367 rc = ber_printf( ber, "{itON}", msgid, tag, &dn );
1368 } else if ( tag == LDAP_REQ_SEARCH ) {
1369 rc = ber_printf( ber, "{it{Oe" /*}}*/, msgid, tag, &dn, scope );
1371 rc = ber_printf( ber, "{it{O" /*}}*/, msgid, tag, &dn );
1375 ld->ld_errno = LDAP_ENCODING_ERROR;
1380 if ( tag != LDAP_REQ_DELETE && (
1381 ber_write(ber, tmpber.ber_ptr, ( tmpber.ber_end - tmpber.ber_ptr ), 0)
1382 != ( tmpber.ber_end - tmpber.ber_ptr ) ||
1383 ber_printf( ber, /*{{*/ "N}N}" ) == -1 ) )
1385 ld->ld_errno = LDAP_ENCODING_ERROR;
1391 if ( ldap_debug & LDAP_DEBUG_PACKETS ) {
1392 Debug( LDAP_DEBUG_ANY, "re_encode_request new request is:\n",
1394 ber_log_dump( LDAP_DEBUG_BER, ldap_debug, ber, 0 );
1396 #endif /* LDAP_DEBUG */
1398 *type = tag; /* return request type */
1404 ldap_find_request_by_msgid( LDAP *ld, ber_int_t msgid )
1408 #ifdef LDAP_R_COMPILE
1409 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
1411 for ( lr = ld->ld_requests; lr != NULL; lr = lr->lr_next ) {
1412 if( lr->lr_status == LDAP_REQST_COMPLETED ) {
1413 continue; /* Skip completed requests */
1415 if ( msgid == lr->lr_msgid ) {
1419 #ifdef LDAP_R_COMPILE
1420 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );