2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1998-2007 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 ( sock_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,
428 "anonymous rebind via ldap_sasl_bind(\"\")\n",
431 #ifdef LDAP_R_COMPILE
432 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
433 ldap_pvt_thread_mutex_unlock( &ld->ld_res_mutex );
435 rc = ldap_sasl_bind( ld, "", LDAP_SASL_SIMPLE, &passwd,
436 NULL, NULL, &msgid );
437 if ( rc != LDAP_SUCCESS ) {
441 for ( err = 1; err > 0; ) {
442 struct timeval tv = { 0, 100000 };
443 LDAPMessage *res = NULL;
445 switch ( ldap_result( ld, msgid, LDAP_MSG_ALL, &tv, &res ) ) {
451 #ifdef LDAP_R_COMPILE
452 ldap_pvt_thread_yield();
457 rc = ldap_parse_result( ld, res, &err, NULL, NULL, NULL, NULL, 1 );
458 if ( rc != LDAP_SUCCESS ) {
461 } else if ( err != LDAP_SUCCESS ) {
464 /* else err == LDAP_SUCCESS == 0 */
468 Debug( LDAP_DEBUG_TRACE,
469 "ldap_new_connection %p: "
470 "unexpected response %d "
471 "from BIND request id=%d\n",
472 ld, ldap_msgtype( res ), msgid );
478 #ifdef LDAP_R_COMPILE
479 ldap_pvt_thread_mutex_lock( &ld->ld_res_mutex );
480 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
482 ld->ld_defconn = savedefconn;
486 ldap_free_connection( ld, lc, 1, 0 );
491 lc->lconn_rebind_inprogress = 0;
499 find_connection( LDAP *ld, LDAPURLDesc *srv, int any )
501 * return an existing connection (if any) to the server srv
502 * if "any" is non-zero, check for any server in the "srv" chain
506 LDAPURLDesc *lcu, *lsu;
507 int lcu_port, lsu_port;
510 #ifdef LDAP_R_COMPILE
511 ldap_pvt_thread_mutex_lock( &ld->ld_conn_mutex );
513 for ( lc = ld->ld_conns; lc != NULL; lc = lc->lconn_next ) {
514 lcu = lc->lconn_server;
515 lcu_port = ldap_pvt_url_scheme_port( lcu->lud_scheme,
518 for ( lsu = srv; lsu != NULL; lsu = lsu->lud_next ) {
519 lsu_port = ldap_pvt_url_scheme_port( lsu->lud_scheme,
522 if ( lsu_port == lcu_port
523 && strcmp( lcu->lud_scheme, lsu->lud_scheme ) == 0
524 && lcu->lud_host != NULL && *lcu->lud_host != '\0'
525 && lsu->lud_host != NULL && *lsu->lud_host != '\0'
526 && strcasecmp( lsu->lud_host, lcu->lud_host ) == 0 )
537 #ifdef LDAP_R_COMPILE
538 ldap_pvt_thread_mutex_unlock( &ld->ld_conn_mutex );
546 use_connection( LDAP *ld, LDAPConn *lc )
549 lc->lconn_lastused = time( NULL );
554 ldap_free_connection( LDAP *ld, LDAPConn *lc, int force, int unbind )
556 LDAPConn *tmplc, *prevlc;
558 Debug( LDAP_DEBUG_TRACE,
559 "ldap_free_connection %d %d\n",
562 if ( force || --lc->lconn_refcnt <= 0 ) {
563 if ( lc->lconn_status == LDAP_CONNST_CONNECTED ) {
564 ldap_mark_select_clear( ld, lc->lconn_sb );
566 ldap_send_unbind( ld, lc->lconn_sb,
571 if ( lc->lconn_ber != NULL ) {
572 ber_free( lc->lconn_ber, 1 );
575 ldap_int_sasl_close( ld, lc );
578 #ifdef LDAP_R_COMPILE
579 ldap_pvt_thread_mutex_lock( &ld->ld_conn_mutex );
581 for ( tmplc = ld->ld_conns;
583 tmplc = tmplc->lconn_next )
586 if ( prevlc == NULL ) {
587 ld->ld_conns = tmplc->lconn_next;
589 prevlc->lconn_next = tmplc->lconn_next;
595 #ifdef LDAP_R_COMPILE
596 ldap_pvt_thread_mutex_unlock( &ld->ld_conn_mutex );
598 ldap_free_urllist( lc->lconn_server );
599 #ifdef LDAP_API_FEATURE_X_OPENLDAP_V2_KBIND
600 if ( lc->lconn_krbinstance != NULL ) {
601 LDAP_FREE( lc->lconn_krbinstance );
605 /* FIXME: is this at all possible? */
609 for ( lr = ld->ld_requests; lr; ) {
610 LDAPRequest *lr_next = lr->lr_next;
612 if ( lr->lr_conn == lc ) {
613 ldap_free_request_int( ld, lr );
619 if ( lc->lconn_sb != ld->ld_sb ) {
620 ber_sockbuf_free( lc->lconn_sb );
622 if ( lc->lconn_rebind_queue != NULL) {
624 for( i = 0; lc->lconn_rebind_queue[i] != NULL; i++ ) {
625 LDAP_VFREE( lc->lconn_rebind_queue[i] );
627 LDAP_FREE( lc->lconn_rebind_queue );
630 Debug( LDAP_DEBUG_TRACE,
631 "ldap_free_connection: actually freed\n",
634 lc->lconn_lastused = time( NULL );
635 Debug( LDAP_DEBUG_TRACE, "ldap_free_connection: refcnt %d\n",
636 lc->lconn_refcnt, 0, 0 );
643 ldap_dump_connection( LDAP *ld, LDAPConn *lconns, int all )
648 fprintf( stderr, "** ld %p Connection%s:\n", (void *)ld, all ? "s" : "" );
649 for ( lc = lconns; lc != NULL; lc = lc->lconn_next ) {
650 if ( lc->lconn_server != NULL ) {
651 fprintf( stderr, "* host: %s port: %d%s\n",
652 ( lc->lconn_server->lud_host == NULL ) ? "(null)"
653 : lc->lconn_server->lud_host,
654 lc->lconn_server->lud_port, ( lc->lconn_sb ==
655 ld->ld_sb ) ? " (default)" : "" );
657 fprintf( stderr, " refcnt: %d status: %s\n", lc->lconn_refcnt,
658 ( lc->lconn_status == LDAP_CONNST_NEEDSOCKET ) ?
659 "NeedSocket" : ( lc->lconn_status ==
660 LDAP_CONNST_CONNECTING ) ? "Connecting" : "Connected" );
661 fprintf( stderr, " last used: %s",
662 ldap_pvt_ctime( &lc->lconn_lastused, timebuf ));
663 if( lc->lconn_rebind_inprogress ) {
664 fprintf( stderr, " rebind in progress\n");
665 if( lc->lconn_rebind_queue != NULL) {
667 for( ;lc->lconn_rebind_queue[i] != NULL; i++) {
669 for( ;lc->lconn_rebind_queue[i][j] != 0; j++) {
670 fprintf( stderr, " queue %d entry %d - %s\n",
671 i, j, lc->lconn_rebind_queue[i][j]);
675 fprintf( stderr, " queue is empty\n");
678 fprintf(stderr, "\n");
687 ldap_dump_requests_and_responses( LDAP *ld )
692 #ifdef LDAP_R_COMPILE
693 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
695 fprintf( stderr, "** ld %p Outstanding Requests:\n", (void *)ld );
696 if (( lr = ld->ld_requests ) == NULL ) {
697 fprintf( stderr, " Empty\n" );
699 for ( ; lr != NULL; lr = lr->lr_next ) {
700 fprintf( stderr, " * msgid %d, origid %d, status %s\n",
701 lr->lr_msgid, lr->lr_origid,
702 ( lr->lr_status == LDAP_REQST_INPROGRESS ) ? "InProgress" :
703 ( lr->lr_status == LDAP_REQST_CHASINGREFS ) ? "ChasingRefs" :
704 ( lr->lr_status == LDAP_REQST_NOTCONNECTED ) ? "NotConnected" :
705 ( lr->lr_status == LDAP_REQST_WRITING) ? "Writing" :
706 ( lr->lr_status == LDAP_REQST_COMPLETED ? "RequestCompleted"
708 fprintf( stderr, " outstanding referrals %d, parent count %d\n",
709 lr->lr_outrefcnt, lr->lr_parentcnt );
711 #ifdef LDAP_R_COMPILE
712 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
714 fprintf( stderr, "** ld %p Response Queue:\n", (void *)ld );
715 if (( lm = ld->ld_responses ) == NULL ) {
716 fprintf( stderr, " Empty\n" );
718 for ( ; lm != NULL; lm = lm->lm_next ) {
719 fprintf( stderr, " * msgid %d, type %lu\n",
720 lm->lm_msgid, (unsigned long) lm->lm_msgtype );
721 if (( l = lm->lm_chain ) != NULL ) {
722 fprintf( stderr, " chained responses:\n" );
723 for ( ; l != NULL; l = l->lm_chain ) {
725 " * msgid %d, type %lu\n",
727 (unsigned long) l->lm_msgtype );
732 #endif /* LDAP_DEBUG */
735 ldap_free_request_int( LDAP *ld, LDAPRequest *lr )
737 if ( lr->lr_prev == NULL ) {
738 /* free'ing the first request? */
739 assert( ld->ld_requests == lr );
740 ld->ld_requests = lr->lr_next;
743 lr->lr_prev->lr_next = lr->lr_next;
746 if ( lr->lr_next != NULL ) {
747 lr->lr_next->lr_prev = lr->lr_prev;
750 if ( lr->lr_ber != NULL ) {
751 ber_free( lr->lr_ber, 1 );
754 if ( lr->lr_res_error != NULL ) {
755 LDAP_FREE( lr->lr_res_error );
758 if ( lr->lr_res_matched != NULL ) {
759 LDAP_FREE( lr->lr_res_matched );
766 ldap_free_request( LDAP *ld, LDAPRequest *lr )
768 LDAPRequest **ttmplr;
770 Debug( LDAP_DEBUG_TRACE, "ldap_free_request (origid %d, msgid %d)\n",
771 lr->lr_origid, lr->lr_msgid, 0 );
773 /* free all referrals (child requests) */
774 while ( lr->lr_child )
775 ldap_free_request( ld, lr->lr_child );
777 if ( lr->lr_parent != NULL ) {
778 --lr->lr_parent->lr_outrefcnt;
779 for ( ttmplr = &lr->lr_parent->lr_child; *ttmplr && *ttmplr != lr; ttmplr = &(*ttmplr)->lr_refnext );
781 *ttmplr = lr->lr_refnext;
783 ldap_free_request_int( ld, lr );
787 * call first time with *cntp = -1
788 * when returns *cntp == -1, no referrals are left
790 * NOTE: may replace *refsp, or shuffle the contents
791 * of the original array.
793 static int ldap_int_nextref(
799 assert( refsp != NULL );
800 assert( *refsp != NULL );
801 assert( cntp != NULL );
810 if ( (*refsp)[ *cntp ] == NULL ) {
821 * (IN) ld = LDAP connection handle
822 * (IN) lr = LDAP Request structure
823 * (IN) refs = array of pointers to referral strings that we will chase
824 * The array will be free'd by this function when no longer needed
825 * (IN) sref != 0 if following search reference
826 * (OUT) errstrp = Place to return a string of referrals which could not be followed
827 * (OUT) hadrefp = 1 if sucessfully followed referral
829 * Return value - number of referrals followed
832 ldap_chase_v3referrals( LDAP *ld, LDAPRequest *lr, char **refs, int sref, char **errstrp, int *hadrefp )
835 int unfollowedcnt = 0;
836 LDAPRequest *origreq;
837 LDAPURLDesc *srv = NULL;
839 char **refarray = NULL;
841 int rc, count, i, j, id;
844 ld->ld_errno = LDAP_SUCCESS; /* optimistic */
847 Debug( LDAP_DEBUG_TRACE, "ldap_chase_v3referrals\n", 0, 0, 0 );
852 /* If no referrals in array, return */
853 if ( (refs == NULL) || ( (refs)[0] == NULL) ) {
858 /* Check for hop limit exceeded */
859 if ( lr->lr_parentcnt >= ld->ld_refhoplimit ) {
860 Debug( LDAP_DEBUG_ANY,
861 "more than %d referral hops (dropping)\n", ld->ld_refhoplimit, 0, 0 );
862 ld->ld_errno = LDAP_REFERRAL_LIMIT_EXCEEDED;
867 /* find original request */
869 origreq->lr_parent != NULL;
870 origreq = origreq->lr_parent )
878 if ( ld->ld_nextref_proc == NULL ) {
879 ld->ld_nextref_proc = ldap_int_nextref;
882 /* parse out & follow referrals */
884 for ( ld->ld_nextref_proc( ld, &refarray, &i, ld->ld_nextref_params );
886 ld->ld_nextref_proc( ld, &refarray, &i, ld->ld_nextref_params ) )
889 /* Parse the referral URL */
890 if (( rc = ldap_url_parse_ext( refarray[i], &srv)) != LDAP_SUCCESS) {
896 if( srv->lud_crit_exts ) {
897 /* we do not support any extensions */
898 ld->ld_errno = LDAP_NOT_SUPPORTED;
903 /* treat ldap://hostpart and ldap://hostpart/ the same */
904 if ( srv->lud_dn && srv->lud_dn[0] == '\0' ) {
905 LDAP_FREE( srv->lud_dn );
909 /* check connection for re-bind in progress */
910 if (( lc = find_connection( ld, srv, 1 )) != NULL ) {
911 /* See if we've already requested this DN with this conn */
914 int len = srv->lud_dn ? strlen( srv->lud_dn ) : 0;
915 for ( lp = origreq; lp; ) {
916 if ( lp->lr_conn == lc ) {
917 if ( len == lp->lr_dn.bv_len
919 && strncmp( srv->lud_dn, lp->lr_dn.bv_val, len ) == 0 )
925 if ( lp == origreq ) {
932 ldap_free_urllist( srv );
934 ld->ld_errno = LDAP_CLIENT_LOOP;
939 if ( lc->lconn_rebind_inprogress ) {
940 /* We are already chasing a referral or search reference and a
941 * bind on that connection is in progress. We must queue
942 * referrals on that connection, so we don't get a request
943 * going out before the bind operation completes. This happens
944 * if two search references come in one behind the other
945 * for the same server with different contexts.
947 Debug( LDAP_DEBUG_TRACE,
948 "ldap_chase_v3referrals: queue referral \"%s\"\n",
950 if( lc->lconn_rebind_queue == NULL ) {
951 /* Create a referral list */
952 lc->lconn_rebind_queue =
953 (char ***) LDAP_MALLOC( sizeof(void *) * 2);
955 if( lc->lconn_rebind_queue == NULL) {
956 ld->ld_errno = LDAP_NO_MEMORY;
961 lc->lconn_rebind_queue[0] = refarray;
962 lc->lconn_rebind_queue[1] = NULL;
966 /* Count how many referral arrays we already have */
967 for( j = 0; lc->lconn_rebind_queue[j] != NULL; j++) {
971 /* Add the new referral to the list */
972 lc->lconn_rebind_queue = (char ***) LDAP_REALLOC(
973 lc->lconn_rebind_queue, sizeof(void *) * (j + 2));
975 if( lc->lconn_rebind_queue == NULL ) {
976 ld->ld_errno = LDAP_NO_MEMORY;
980 lc->lconn_rebind_queue[j] = refarray;
981 lc->lconn_rebind_queue[j+1] = NULL;
985 /* We have queued the referral/reference, now just return */
988 count = 1; /* Pretend we already followed referral */
992 /* Re-encode the request with the new starting point of the search.
993 * Note: In the future we also need to replace the filter if one
994 * was provided with the search reference
997 /* For references we don't want old dn if new dn empty */
998 if ( sref && srv->lud_dn == NULL ) {
999 srv->lud_dn = LDAP_STRDUP( "" );
1002 LDAP_NEXT_MSGID( ld, id );
1003 ber = re_encode_request( ld, origreq->lr_ber, id,
1004 sref, srv, &rinfo.ri_request );
1007 ld->ld_errno = LDAP_ENCODING_ERROR;
1012 Debug( LDAP_DEBUG_TRACE,
1013 "ldap_chase_v3referral: msgid %d, url \"%s\"\n",
1014 lr->lr_msgid, refarray[i], 0);
1016 /* Send the new request to the server - may require a bind */
1017 rinfo.ri_msgid = origreq->lr_origid;
1018 rinfo.ri_url = refarray[i];
1019 #ifdef LDAP_R_COMPILE
1020 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
1022 rc = ldap_send_server_request( ld, ber, id,
1023 origreq, srv, NULL, &rinfo );
1024 #ifdef LDAP_R_COMPILE
1025 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
1028 /* Failure, try next referral in the list */
1029 Debug( LDAP_DEBUG_ANY, "Unable to chase referral \"%s\" (%d: %s)\n",
1030 refarray[i], ld->ld_errno, ldap_err2string( ld->ld_errno ) );
1031 unfollowedcnt += ldap_append_referral( ld, &unfollowed, refarray[i] );
1032 ldap_free_urllist( srv );
1034 ld->ld_errno = LDAP_REFERRAL;
1036 /* Success, no need to try this referral list further */
1041 /* check if there is a queue of referrals that came in during bind */
1043 lc = find_connection( ld, srv, 1 );
1045 ld->ld_errno = LDAP_OPERATIONS_ERROR;
1051 if ( lc->lconn_rebind_queue != NULL ) {
1052 /* Release resources of previous list */
1053 LDAP_VFREE( refarray );
1055 ldap_free_urllist( srv );
1058 /* Pull entries off end of queue so list always null terminated */
1059 for( j = 0; lc->lconn_rebind_queue[j] != NULL; j++ )
1061 refarray = lc->lconn_rebind_queue[j - 1];
1062 lc->lconn_rebind_queue[j-1] = NULL;
1063 /* we pulled off last entry from queue, free queue */
1065 LDAP_FREE( lc->lconn_rebind_queue );
1066 lc->lconn_rebind_queue = NULL;
1068 /* restart the loop the with new referral list */
1072 break; /* referral followed, break out of for loop */
1074 } /* end for loop */
1076 LDAP_VFREE( refarray );
1077 ldap_free_urllist( srv );
1078 LDAP_FREE( *errstrp );
1082 LDAP_FREE( unfollowed );
1085 *errstrp = unfollowed;
1091 * XXX merging of errors in this routine needs to be improved
1094 ldap_chase_referrals( LDAP *ld,
1102 char *p, *ref, *unfollowed;
1103 LDAPRequest *origreq;
1109 Debug( LDAP_DEBUG_TRACE, "ldap_chase_referrals\n", 0, 0, 0 );
1111 ld->ld_errno = LDAP_SUCCESS; /* optimistic */
1114 if ( *errstrp == NULL ) {
1118 len = strlen( *errstrp );
1119 for ( p = *errstrp; len >= LDAP_REF_STR_LEN; ++p, --len ) {
1120 if ( strncasecmp( p, LDAP_REF_STR, LDAP_REF_STR_LEN ) == 0 ) {
1122 p += LDAP_REF_STR_LEN;
1127 if ( len < LDAP_REF_STR_LEN ) {
1131 if ( lr->lr_parentcnt >= ld->ld_refhoplimit ) {
1132 Debug( LDAP_DEBUG_ANY,
1133 "more than %d referral hops (dropping)\n",
1134 ld->ld_refhoplimit, 0, 0 );
1135 /* XXX report as error in ld->ld_errno? */
1139 /* find original request */
1140 for ( origreq = lr; origreq->lr_parent != NULL;
1141 origreq = origreq->lr_parent ) {
1148 /* parse out & follow referrals */
1149 for ( ref = p; rc == 0 && ref != NULL; ref = p ) {
1150 p = strchr( ref, '\n' );
1155 rc = ldap_url_parse_ext( ref, &srv );
1157 if ( rc != LDAP_URL_SUCCESS ) {
1158 Debug( LDAP_DEBUG_TRACE,
1159 "ignoring unknown referral <%s>\n", ref, 0, 0 );
1160 rc = ldap_append_referral( ld, &unfollowed, ref );
1165 if ( srv->lud_dn != NULL && srv->lud_dn == '\0' ) {
1166 LDAP_FREE( srv->lud_dn );
1170 Debug( LDAP_DEBUG_TRACE,
1171 "chasing LDAP referral: <%s>\n", ref, 0, 0 );
1175 /* See if we've already been here */
1176 if (( lc = find_connection( ld, srv, 1 )) != NULL ) {
1179 int len = srv->lud_dn ? strlen( srv->lud_dn ) : 0;
1180 for (lp = lr; lp; lp = lp->lr_parent ) {
1181 if ( lp->lr_conn == lc ) {
1182 if ( len == lp->lr_dn.bv_len ) {
1183 if ( len && strncmp( srv->lud_dn, lp->lr_dn.bv_val,
1192 ldap_free_urllist(srv);
1193 ld->ld_errno = LDAP_CLIENT_LOOP;
1199 LDAP_NEXT_MSGID( ld, id );
1200 ber = re_encode_request( ld, origreq->lr_ber,
1201 id, sref, srv, &rinfo.ri_request );
1203 if ( ber == NULL ) {
1207 /* copy the complete referral for rebind process */
1208 rinfo.ri_url = LDAP_STRDUP( ref );
1210 rinfo.ri_msgid = origreq->lr_origid;
1212 #ifdef LDAP_R_COMPILE
1213 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
1215 rc = ldap_send_server_request( ld, ber, id,
1216 lr, srv, NULL, &rinfo );
1217 #ifdef LDAP_R_COMPILE
1218 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );
1221 LDAP_FREE( rinfo.ri_url );
1226 Debug( LDAP_DEBUG_ANY,
1227 "Unable to chase referral \"%s\" (%d: %s)\n",
1228 ref, ld->ld_errno, ldap_err2string( ld->ld_errno ) );
1229 rc = ldap_append_referral( ld, &unfollowed, ref );
1232 ldap_free_urllist(srv);
1235 LDAP_FREE( *errstrp );
1236 *errstrp = unfollowed;
1238 return(( rc == 0 ) ? count : rc );
1243 ldap_append_referral( LDAP *ld, char **referralsp, char *s )
1247 if ( *referralsp == NULL ) {
1249 *referralsp = (char *)LDAP_MALLOC( strlen( s ) + LDAP_REF_STR_LEN
1253 *referralsp = (char *)LDAP_REALLOC( *referralsp,
1254 strlen( *referralsp ) + strlen( s ) + 2 );
1257 if ( *referralsp == NULL ) {
1258 ld->ld_errno = LDAP_NO_MEMORY;
1263 strcpy( *referralsp, LDAP_REF_STR );
1265 strcat( *referralsp, "\n" );
1267 strcat( *referralsp, s );
1275 re_encode_request( LDAP *ld,
1276 BerElement *origber,
1283 * XXX this routine knows way too much about how the lber library works!
1291 BerElement tmpber, *ber;
1294 Debug( LDAP_DEBUG_TRACE,
1295 "re_encode_request: new msgid %ld, new dn <%s>\n",
1297 ( srv == NULL || srv->lud_dn == NULL) ? "NONE" : srv->lud_dn, 0 );
1302 * all LDAP requests are sequences that start with a message id.
1303 * For all except delete, this is followed by a sequence that is
1304 * tagged with the operation code. For delete, the provided DN
1305 * is not wrapped by a sequence.
1307 rtag = ber_scanf( &tmpber, "{it", /*}*/ &along, &tag );
1309 if ( rtag == LBER_ERROR ) {
1310 ld->ld_errno = LDAP_DECODING_ERROR;
1315 if ( tag == LDAP_REQ_BIND ) {
1316 /* bind requests have a version number before the DN & other stuff */
1317 rtag = ber_scanf( &tmpber, "{im" /*}*/, &ver, &dn );
1319 } else if ( tag == LDAP_REQ_DELETE ) {
1320 /* delete requests don't have a DN wrapping sequence */
1321 rtag = ber_scanf( &tmpber, "m", &dn );
1323 } else if ( tag == LDAP_REQ_SEARCH ) {
1324 /* search requests need to be re-scope-ed */
1325 rtag = ber_scanf( &tmpber, "{me" /*"}"*/, &dn, &scope );
1327 if( srv->lud_scope != LDAP_SCOPE_DEFAULT ) {
1328 /* use the scope provided in reference */
1329 scope = srv->lud_scope;
1331 } else if ( sref ) {
1332 /* use scope implied by previous operation
1335 * subtree -> subtree
1336 * subordinate -> subtree
1340 case LDAP_SCOPE_BASE:
1341 case LDAP_SCOPE_ONELEVEL:
1342 scope = LDAP_SCOPE_BASE;
1344 case LDAP_SCOPE_SUBTREE:
1345 #ifdef LDAP_SCOPE_SUBORDINATE
1346 case LDAP_SCOPE_SUBORDINATE:
1348 scope = LDAP_SCOPE_SUBTREE;
1354 rtag = ber_scanf( &tmpber, "{m" /*}*/, &dn );
1357 if( rtag == LBER_ERROR ) {
1358 ld->ld_errno = LDAP_DECODING_ERROR;
1362 /* restore character zero'd out by ber_scanf*/
1363 dn.bv_val[dn.bv_len] = tmpber.ber_tag;
1365 if (( ber = ldap_alloc_ber_with_options( ld )) == NULL ) {
1369 if ( srv->lud_dn ) {
1370 ber_str2bv( srv->lud_dn, 0, 0, &dn );
1373 if ( tag == LDAP_REQ_BIND ) {
1374 rc = ber_printf( ber, "{it{iO" /*}}*/, msgid, tag, ver, &dn );
1375 } else if ( tag == LDAP_REQ_DELETE ) {
1376 rc = ber_printf( ber, "{itON}", msgid, tag, &dn );
1377 } else if ( tag == LDAP_REQ_SEARCH ) {
1378 rc = ber_printf( ber, "{it{Oe" /*}}*/, msgid, tag, &dn, scope );
1380 rc = ber_printf( ber, "{it{O" /*}}*/, msgid, tag, &dn );
1384 ld->ld_errno = LDAP_ENCODING_ERROR;
1389 if ( tag != LDAP_REQ_DELETE && (
1390 ber_write(ber, tmpber.ber_ptr, ( tmpber.ber_end - tmpber.ber_ptr ), 0)
1391 != ( tmpber.ber_end - tmpber.ber_ptr ) ||
1392 ber_printf( ber, /*{{*/ "N}N}" ) == -1 ) )
1394 ld->ld_errno = LDAP_ENCODING_ERROR;
1400 if ( ldap_debug & LDAP_DEBUG_PACKETS ) {
1401 Debug( LDAP_DEBUG_ANY, "re_encode_request new request is:\n",
1403 ber_log_dump( LDAP_DEBUG_BER, ldap_debug, ber, 0 );
1405 #endif /* LDAP_DEBUG */
1407 *type = tag; /* return request type */
1413 ldap_find_request_by_msgid( LDAP *ld, ber_int_t msgid )
1417 #ifdef LDAP_R_COMPILE
1418 ldap_pvt_thread_mutex_lock( &ld->ld_req_mutex );
1420 for ( lr = ld->ld_requests; lr != NULL; lr = lr->lr_next ) {
1421 if( lr->lr_status == LDAP_REQST_COMPLETED ) {
1422 continue; /* Skip completed requests */
1424 if ( msgid == lr->lr_msgid ) {
1428 #ifdef LDAP_R_COMPILE
1429 ldap_pvt_thread_mutex_unlock( &ld->ld_req_mutex );