1 /* sssvlv.c - server side sort / virtual list view */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2009 The OpenLDAP Foundation.
6 * Portions copyright 2009 Symas Corporation.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted only as authorized by the OpenLDAP
13 * A copy of this license is available in the file LICENSE in the
14 * top-level directory of the distribution or, alternatively, at
15 * <http://www.OpenLDAP.org/license.html>.
18 * This work was initially developed by Howard Chu for inclusion in
24 #ifdef SLAPD_OVER_SSSVLV
28 #include <ac/string.h>
37 /* RFC2891: Server Side Sorting
38 * RFC2696: Paged Results
40 #ifndef LDAP_MATCHRULE_IDENTIFIER
41 #define LDAP_MATCHRULE_IDENTIFIER 0x80L
42 #define LDAP_REVERSEORDER_IDENTIFIER 0x81L
43 #define LDAP_ATTRTYPES_IDENTIFIER 0x80L
46 /* draft-ietf-ldapext-ldapv3-vlv-09.txt: Virtual List Views
48 #ifndef LDAP_VLVBYINDEX_IDENTIFIER
49 #define LDAP_VLVBYINDEX_IDENTIFIER 0xa0L
50 #define LDAP_VLVBYVALUE_IDENTIFIER 0x81L
51 #define LDAP_VLVCONTEXT_IDENTIFIER 0x04L
53 #define LDAP_VLV_SSS_MISSING 0x4C
54 #define LDAP_VLV_RANGE_ERROR 0x4D
57 #define SAFESTR(macro_str, macro_def) ((macro_str) ? (macro_str) : (macro_def))
59 #define SSSVLV_DEFAULT_MAX_KEYS 5
61 typedef struct vlv_ctrl {
66 struct berval vc_value;
67 unsigned long vc_context;
70 typedef struct sort_key
72 AttributeDescription *sk_ad;
73 MatchingRule *sk_ordering;
74 int sk_direction; /* 1=normal, -1=reverse */
77 typedef struct sort_ctrl {
83 typedef struct sort_node
87 struct berval *sn_vals;
90 typedef struct sssvlv_info
92 int svi_max; /* max concurrent sorts */
93 int svi_num; /* current # sorts */
94 int svi_max_keys; /* max sort keys per request */
97 typedef struct sort_op
101 sssvlv_info *so_info;
108 unsigned long so_vcontext;
111 /* There is only one conn table for all overlay instances */
112 static sort_op **sort_conns;
113 static ldap_pvt_thread_mutex_t sort_conns_mutex;
114 static const char *debug_header = "sssvlv";
119 /* RFC 2981 Section 2.2
120 * If a sort key is a multi-valued attribute, and an entry happens to
121 * have multiple values for that attribute and no other controls are
122 * present that affect the sorting order, then the server SHOULD use the
123 * least value (according to the ORDERING rule for that attribute).
125 static struct berval* select_value(
129 struct berval* ber1, *ber2;
130 MatchingRule *mr = key->sk_ordering;
133 ber1 = &(attr->a_nvals[0]);
135 for ( i = 1; i < attr->a_numvals; i++,ber2++ ) {
136 mr->smr_match( &cmp, 0, mr->smr_syntax, mr, ber1, ber2 );
142 Debug(LDAP_DEBUG_TRACE, "%s: value selected for compare: %s\n",
144 SAFESTR(ber1->bv_val, "<Empty>"),
150 static int node_cmp( const void* val1, const void* val2 )
152 sort_node *sn1 = (sort_node *)val1;
153 sort_node *sn2 = (sort_node *)val2;
154 sort_ctrl *sc = sort_conns[sn1->sn_conn]->so_ctrl;
158 for ( i=0; cmp == 0 && i<sc->sc_nkeys; i++ ) {
159 if ( BER_BVISNULL( &sn1->sn_vals[i] )) {
160 if ( BER_BVISNULL( &sn2->sn_vals[i] ))
163 cmp = sc->sc_keys[i].sk_direction;
164 } else if ( BER_BVISNULL( &sn2->sn_vals[i] )) {
165 cmp = sc->sc_keys[i].sk_direction * -1;
167 mr = sc->sc_keys[i].sk_ordering;
168 mr->smr_match( &cmp, 0, mr->smr_syntax, mr,
169 &sn1->sn_vals[i], &sn2->sn_vals[i] );
171 cmp *= sc->sc_keys[i].sk_direction;
177 static int node_insert( const void *val1, const void *val2 )
179 /* Never return equal so that new entries are always inserted */
180 return node_cmp( val1, val2 ) < 0 ? -1 : 1;
183 static int pack_vlv_response_control(
187 LDAPControl **ctrlsp )
190 BerElementBuffer berbuf;
191 BerElement *ber = (BerElement *)&berbuf;
192 PagedResultsCookie resp_cookie;
193 struct berval cookie, bv;
196 ber_init2( ber, NULL, LBER_USE_DER );
197 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
199 rc = ber_printf( ber, "{iii", so->so_vlv_target, so->so_nentries,
202 if ( rc != -1 && so->so_vcontext ) {
203 cookie.bv_val = (char *)&so->so_vcontext;
204 cookie.bv_len = sizeof(so->so_vcontext);
205 rc = ber_printf( ber, "tO", LDAP_VLVCONTEXT_IDENTIFIER, &cookie );
209 rc = ber_printf( ber, "}" );
213 rc = ber_flatten2( ber, &bv, 0 );
217 ctrl = (LDAPControl *)op->o_tmpalloc( sizeof(LDAPControl)+
218 bv.bv_len, op->o_tmpmemctx );
219 ctrl->ldctl_oid = LDAP_CONTROL_VLVRESPONSE;
220 ctrl->ldctl_iscritical = 0;
221 ctrl->ldctl_value.bv_val = (char *)(ctrl+1);
222 ctrl->ldctl_value.bv_len = bv.bv_len;
223 AC_MEMCPY( ctrl->ldctl_value.bv_val, bv.bv_val, bv.bv_len );
227 rs->sr_err = LDAP_OTHER;
235 static int pack_pagedresult_response_control(
239 LDAPControl **ctrlsp )
242 BerElementBuffer berbuf;
243 BerElement *ber = (BerElement *)&berbuf;
244 PagedResultsCookie resp_cookie;
245 struct berval cookie, bv;
248 ber_init2( ber, NULL, LBER_USE_DER );
249 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
251 if ( so->so_nentries > 0 ) {
252 resp_cookie = ( PagedResultsCookie )so->so_tree;
253 cookie.bv_len = sizeof( PagedResultsCookie );
254 cookie.bv_val = (char *)&resp_cookie;
256 resp_cookie = ( PagedResultsCookie )0;
257 BER_BVZERO( &cookie );
260 op->o_conn->c_pagedresults_state.ps_cookie = resp_cookie;
261 op->o_conn->c_pagedresults_state.ps_count
262 = ((PagedResultsState *)op->o_pagedresults_state)->ps_count
265 rc = ber_printf( ber, "{iO}", so->so_nentries, &cookie );
267 rc = ber_flatten2( ber, &bv, 0 );
271 ctrl = (LDAPControl *)op->o_tmpalloc( sizeof(LDAPControl)+
272 bv.bv_len, op->o_tmpmemctx );
273 ctrl->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
274 ctrl->ldctl_iscritical = 0;
275 ctrl->ldctl_value.bv_val = (char *)(ctrl+1);
276 ctrl->ldctl_value.bv_len = bv.bv_len;
277 AC_MEMCPY( ctrl->ldctl_value.bv_val, bv.bv_val, bv.bv_len );
281 rs->sr_err = LDAP_OTHER;
289 static int pack_sss_response_control(
292 LDAPControl **ctrlsp )
295 BerElementBuffer berbuf;
296 BerElement *ber = (BerElement *)&berbuf;
300 ber_init2( ber, NULL, LBER_USE_DER );
301 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
303 /* Pack error code */
304 rc = ber_printf(ber, "{e}", rs->sr_err);
307 rc = ber_flatten2( ber, &bv, 0 );
310 ctrl = (LDAPControl *)op->o_tmpalloc( sizeof(LDAPControl)+
311 bv.bv_len, op->o_tmpmemctx );
312 ctrl->ldctl_oid = LDAP_CONTROL_SORTRESPONSE;
313 ctrl->ldctl_iscritical = 0;
314 ctrl->ldctl_value.bv_val = (char *)(ctrl+1);
315 ctrl->ldctl_value.bv_len = bv.bv_len;
316 AC_MEMCPY( ctrl->ldctl_value.bv_val, bv.bv_val, bv.bv_len );
320 rs->sr_err = LDAP_OTHER;
328 static void free_sort_op( Connection *conn, sort_op *so )
331 tavl_free( so->so_tree, ch_free );
335 ldap_pvt_thread_mutex_lock( &sort_conns_mutex );
336 sort_conns[conn->c_conn_idx] = NULL;
337 so->so_info->svi_num--;
338 ldap_pvt_thread_mutex_unlock( &sort_conns_mutex );
343 static int send_list(
348 Avlnode *cur_node, *tmp_node;
349 vlv_ctrl *vc = op->o_controls[vlv_cid];
353 LDAPControl *ctrls[2];
355 /* FIXME: it may be better to just flatten the tree into
356 * an array before doing all of this...
359 /* Are we just counting an offset? */
360 if ( BER_BVISNULL( &vc->vc_value )) {
361 if ( vc->vc_offset == vc->vc_count ) {
362 /* wants the last entry in the list */
363 cur_node = tavl_end(so->so_tree, TAVL_DIR_RIGHT);
364 so->so_vlv_target = so->so_nentries;
365 } else if ( vc->vc_offset == 1 ) {
366 /* wants the first entry in the list */
367 cur_node = tavl_end(so->so_tree, TAVL_DIR_LEFT);
368 so->so_vlv_target = 1;
371 /* Just iterate to the right spot */
372 if ( vc->vc_count && vc->vc_count != so->so_nentries ) {
373 if ( vc->vc_offset > vc->vc_count )
375 target = so->so_nentries * vc->vc_offset / vc->vc_count;
377 if ( vc->vc_offset > so->so_nentries ) {
379 so->so_vlv_rc = LDAP_VLV_RANGE_ERROR;
380 pack_vlv_response_control( op, rs, so, ctrls );
382 slap_add_ctrls( op, rs, ctrls );
383 rs->sr_err = LDAP_VLV_ERROR;
386 target = vc->vc_offset;
388 so->so_vlv_target = target;
389 /* Start at left and go right, or start at right and go left? */
390 if ( target < so->so_nentries / 2 ) {
391 cur_node = tavl_end(so->so_tree, TAVL_DIR_LEFT);
392 dir = TAVL_DIR_RIGHT;
394 cur_node = tavl_end(so->so_tree, TAVL_DIR_RIGHT);
396 target = so->so_nentries - target + 1;
398 for ( i=1; i<target; i++ )
399 cur_node = tavl_next( cur_node, dir );
402 /* we're looking for a specific value */
403 sort_ctrl *sc = so->so_ctrl;
404 MatchingRule *mr = sc->sc_keys[0].sk_ordering;
408 if ( mr->smr_normalize ) {
409 rc = mr->smr_normalize( SLAP_MR_VALUE_OF_SYNTAX,
410 mr->smr_syntax, mr, &vc->vc_value, &bv, op->o_tmpmemctx );
412 so->so_vlv_rc = LDAP_INAPPROPRIATE_MATCHING;
413 pack_vlv_response_control( op, rs, so, ctrls );
415 slap_add_ctrls( op, rs, ctrls );
416 rs->sr_err = LDAP_VLV_ERROR;
423 sn = op->o_tmpalloc( sizeof(sort_node) +
424 sc->sc_nkeys * sizeof(struct berval), op->o_tmpmemctx );
425 sn->sn_vals = (struct berval *)(sn+1);
426 sn->sn_conn = op->o_conn->c_conn_idx;
428 for (i=1; i<sc->sc_nkeys; i++) {
429 BER_BVZERO( &sn->sn_vals[i] );
431 cur_node = tavl_find2( so->so_tree, sn, node_cmp );
432 op->o_tmpfree( sn, op->o_tmpmemctx );
435 so->so_vlv_target = so->so_nentries + 1;
437 sort_node *sn = so->so_tree->avl_data;
438 /* start from the left or the right side? */
439 mr->smr_match( &i, 0, mr->smr_syntax, mr, &bv, &sn->sn_vals[0] );
441 tmp_node = tavl_end(so->so_tree, TAVL_DIR_RIGHT);
444 tmp_node = tavl_end(so->so_tree, TAVL_DIR_LEFT);
445 dir = TAVL_DIR_RIGHT;
447 for (i=0; tmp_node != cur_node;
448 tmp_node = tavl_next( tmp_node, dir ), i++);
449 so->so_vlv_target = i;
451 if ( bv.bv_val != vc->vc_value.bv_val )
452 op->o_tmpfree( bv.bv_val, op->o_tmpmemctx );
456 cur_node = tavl_end(so->so_tree, TAVL_DIR_RIGHT);
460 for ( ; i<vc->vc_before; i++ ) {
461 tmp_node = tavl_next( cur_node, TAVL_DIR_LEFT );
462 if ( !tmp_node ) break;
465 j = i + vc->vc_after + 1;
467 for ( i=0; i<j; i++ ) {
468 sort_node *sn = cur_node->avl_data;
470 op->o_bd = select_backend( &sn->sn_dn, 0 );
472 rc = be_entry_get_rw( op, &sn->sn_dn, NULL, NULL, 0, &e );
474 if ( e && rc == LDAP_SUCCESS ) {
476 rs->sr_flags = REP_ENTRY_MUSTRELEASE;
477 rs->sr_err = send_search_entry( op, rs );
478 if ( rs->sr_err == LDAP_UNAVAILABLE )
481 cur_node = tavl_next( cur_node, TAVL_DIR_RIGHT );
482 if ( !cur_node ) break;
484 so->so_vlv_rc = LDAP_SUCCESS;
489 static void send_page( Operation *op, SlapReply *rs, sort_op *so )
491 Avlnode *cur_node = so->so_tree;
492 Avlnode *next_node = NULL;
493 BackendDB *be = op->o_bd;
498 while ( cur_node && rs->sr_nentries < so->so_page_size ) {
499 sort_node *sn = cur_node->avl_data;
501 next_node = tavl_next( cur_node, TAVL_DIR_RIGHT );
503 op->o_bd = select_backend( &sn->sn_dn, 0 );
505 rc = be_entry_get_rw( op, &sn->sn_dn, NULL, NULL, 0, &e );
507 ch_free( cur_node->avl_data );
508 ber_memfree( cur_node );
510 cur_node = next_node;
513 if ( e && rc == LDAP_SUCCESS ) {
515 rs->sr_flags = REP_ENTRY_MUSTRELEASE;
516 rs->sr_err = send_search_entry( op, rs );
517 if ( rs->sr_err == LDAP_UNAVAILABLE )
522 /* Set the first entry to send for the next page */
523 so->so_tree = next_node;
528 static void send_entry(
533 Debug(LDAP_DEBUG_TRACE,
534 "%s: response control: status=%d, text=%s\n",
535 debug_header, rs->sr_err, SAFESTR(rs->sr_text, "<None>"));
537 /* RFC 2891: If critical then send the entries iff they were
538 * succesfully sorted. If non-critical send all entries
539 * whether they were sorted or not.
541 if ( (op->o_ctrlflag[sss_cid] != SLAP_CONTROL_CRITICAL) ||
542 (rs->sr_err == LDAP_SUCCESS) )
544 if ( so->so_vlv > SLAP_CONTROL_IGNORED ) {
545 send_list( op, rs, so );
547 /* Get the first node to send */
548 Avlnode *start_node = tavl_end(so->so_tree, TAVL_DIR_LEFT);
549 so->so_tree = start_node;
551 if ( so->so_paged <= SLAP_CONTROL_IGNORED ) {
552 /* Not paged result search. Send all entries.
553 * Set the page size to the number of entries
554 * so that send_page() will send all entries.
556 so->so_page_size = so->so_nentries;
559 send_page( op, rs, so );
564 static void send_result(
569 LDAPControl *ctrls[3];
572 rc = pack_sss_response_control( op, rs, ctrls );
573 if ( rc == LDAP_SUCCESS ) {
576 if ( so->so_paged > SLAP_CONTROL_IGNORED ) {
577 rc = pack_pagedresult_response_control( op, rs, so, ctrls+1 );
578 } else if ( so->so_vlv > SLAP_CONTROL_IGNORED ) {
579 rc = pack_vlv_response_control( op, rs, so, ctrls+1 );
581 if ( rc == LDAP_SUCCESS )
586 if ( ctrls[0] != NULL )
587 slap_add_ctrls( op, rs, ctrls );
588 send_ldap_result( op, rs );
590 if ( so->so_tree == NULL ) {
591 /* Search finished, so clean up */
592 free_sort_op( op->o_conn, so );
596 static int sssvlv_op_response(
600 sort_ctrl *sc = op->o_controls[sss_cid];
601 sort_op *so = op->o_callback->sc_private;
603 if ( rs->sr_type == REP_SEARCH ) {
610 len = sizeof(sort_node) + sc->sc_nkeys * sizeof(struct berval) +
611 rs->sr_entry->e_nname.bv_len + 1;
612 sn = op->o_tmpalloc( len, op->o_tmpmemctx );
613 sn->sn_vals = (struct berval *)(sn+1);
615 /* Build tmp list of key values */
616 for ( i=0; i<sc->sc_nkeys; i++ ) {
617 Attribute *a = attr_find( rs->sr_entry->e_attrs,
618 sc->sc_keys[i].sk_ad );
620 if ( a->a_numvals > 1 ) {
621 bv = select_value( a, &sc->sc_keys[i] );
625 sn->sn_vals[i] = *bv;
626 len += bv->bv_len + 1;
628 BER_BVZERO( &sn->sn_vals[i] );
632 /* Now dup into regular memory */
633 sn2 = ch_malloc( len );
634 sn2->sn_vals = (struct berval *)(sn2+1);
635 AC_MEMCPY( sn2->sn_vals, sn->sn_vals,
636 sc->sc_nkeys * sizeof(struct berval));
639 ptr = (char *)(sn->sn_vals + sc->sc_nkeys);
640 sn->sn_dn.bv_val = ptr;
641 sn->sn_dn.bv_len = rs->sr_entry->e_nname.bv_len;
642 AC_MEMCPY( ptr, rs->sr_entry->e_nname.bv_val,
643 rs->sr_entry->e_nname.bv_len );
644 ptr += rs->sr_entry->e_nname.bv_len;
646 for ( i=0; i<sc->sc_nkeys; i++ ) {
647 if ( !BER_BVISNULL( &sn->sn_vals[i] )) {
648 AC_MEMCPY( ptr, sn->sn_vals[i].bv_val, sn->sn_vals[i].bv_len );
649 sn->sn_vals[i].bv_val = ptr;
650 ptr += sn->sn_vals[i].bv_len;
654 sn->sn_conn = op->o_conn->c_conn_idx;
656 /* Insert into the AVL tree */
657 tavl_insert(&(so->so_tree), sn, node_insert, avl_dup_error);
661 /* Collected the keys so that they can be sorted. Thus, stop
662 * the entry from propagating.
664 rs->sr_err = LDAP_SUCCESS;
666 else if ( rs->sr_type == REP_RESULT ) {
667 /* Remove serversort response callback.
668 * We don't want the entries that we are about to send to be
669 * processed by serversort response again.
671 if ( op->o_callback->sc_response == sssvlv_op_response ) {
672 op->o_callback = op->o_callback->sc_next;
675 send_entry( op, rs, so );
676 send_result( op, rs, so );
682 static int sssvlv_op_search(
686 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
687 sssvlv_info *si = on->on_bi.bi_private;
688 int rc = SLAP_CB_CONTINUE;
691 sort_ctrl *sc = op->o_controls[sss_cid];
692 PagedResultsState *ps;
695 if ( op->o_ctrlflag[sss_cid] <= SLAP_CONTROL_IGNORED ) {
696 if ( op->o_ctrlflag[vlv_cid] > SLAP_CONTROL_IGNORED ) {
697 LDAPControl *ctrls[2];
699 so2.so_vlv_target = 0;
701 so2.so_vlv_rc = LDAP_VLV_SSS_MISSING;
702 rc = pack_vlv_response_control( op, rs, &so2, ctrls );
703 if ( rc == LDAP_SUCCESS ) {
705 slap_add_ctrls( op, rs, ctrls );
707 rs->sr_err = LDAP_VLV_ERROR;
708 rs->sr_text = "Sort control is required with VLV";
711 /* Not server side sort so just continue */
712 return SLAP_CB_CONTINUE;
715 Debug(LDAP_DEBUG_TRACE,
716 "==> sssvlv_search: <%s> %s, control flag: %d\n",
717 op->o_req_dn.bv_val, op->ors_filterstr.bv_val,
718 op->o_ctrlflag[sss_cid]);
720 if ( sc->sc_nkeys > si->svi_max_keys ) {
721 rs->sr_text = "Too many sort keys";
722 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
726 ps = ( op->o_pagedresults > SLAP_CONTROL_IGNORED ) ?
727 (PagedResultsState*)(op->o_pagedresults_state) : NULL;
728 vc = op->o_ctrlflag[vlv_cid] > SLAP_CONTROL_IGNORED ?
729 op->o_controls[vlv_cid] : NULL;
732 rs->sr_text = "VLV incompatible with PagedResults";
733 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
738 ldap_pvt_thread_mutex_lock( &sort_conns_mutex );
739 so = sort_conns[op->o_conn->c_conn_idx];
740 /* Is there already a sort running on this conn? */
742 /* Is it a continuation of a VLV search? */
743 if ( !vc || so->so_vlv <= SLAP_CONTROL_IGNORED ||
744 vc->vc_context != so->so_vcontext ) {
745 /* Is it a continuation of a paged search? */
746 if ( !ps || so->so_paged <= SLAP_CONTROL_IGNORED ||
747 op->o_conn->c_pagedresults_state.ps_cookie != ps->ps_cookie ) {
749 } else if ( !ps->ps_size ) {
750 /* Abandoning current request */
753 rs->sr_err = LDAP_SUCCESS;
756 if (( vc && so->so_paged > SLAP_CONTROL_IGNORED ) ||
757 ( ps && so->so_vlv > SLAP_CONTROL_IGNORED )) {
758 /* changed from paged to vlv or vice versa, abandon */
761 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
763 /* Are there too many running overall? */
764 } else if ( si->svi_num >= si->svi_max ) {
767 /* OK, this connection now has a sort running */
769 sort_conns[op->o_conn->c_conn_idx] = &so2;
771 ldap_pvt_thread_mutex_unlock( &sort_conns_mutex );
773 /* are we continuing a VLV search? */
774 if ( vc && vc->vc_context ) {
776 send_list( op, rs, so );
777 send_result( op, rs, so );
779 /* are we continuing a paged search? */
780 } else if ( ps && ps->ps_cookie ) {
782 send_page( op, rs, so );
783 send_result( op, rs, so );
786 slap_callback *cb = op->o_tmpalloc( sizeof(slap_callback),
788 /* Install serversort response callback to handle a new search */
790 so = ch_malloc( sizeof(sort_op));
792 so = op->o_tmpalloc( sizeof(sort_op), op->o_tmpmemctx );
794 sort_conns[op->o_conn->c_conn_idx] = so;
796 cb->sc_cleanup = NULL;
797 cb->sc_response = sssvlv_op_response;
798 cb->sc_next = op->o_callback;
805 so->so_paged = op->o_pagedresults;
806 so->so_page_size = ps->ps_size;
807 op->o_pagedresults = SLAP_CONTROL_IGNORED;
810 so->so_page_size = 0;
812 so->so_vlv = op->o_ctrlflag[vlv_cid];
814 so->so_vcontext = (unsigned long)so;
820 if ( so && !so->so_nentries ) {
821 free_sort_op( op->o_conn, so );
823 rs->sr_text = "Other sort requests already in progress";
824 rs->sr_err = LDAP_BUSY;
828 send_ldap_result( op, rs );
834 static int get_ordering_rule(
835 AttributeDescription *ad,
836 struct berval *matchrule,
838 MatchingRule **ordering )
842 if ( matchrule && matchrule->bv_val ) {
843 mr = mr_find( matchrule->bv_val );
845 rs->sr_err = LDAP_INAPPROPRIATE_MATCHING;
846 rs->sr_text = "serverSort control: No ordering rule";
847 Debug(LDAP_DEBUG_TRACE, "%s: no ordering rule function for %s\n",
848 debug_header, matchrule->bv_val, 0);
852 mr = ad->ad_type->sat_ordering;
854 rs->sr_err = LDAP_INAPPROPRIATE_MATCHING;
855 rs->sr_text = "serverSort control: No ordering rule";
856 Debug(LDAP_DEBUG_TRACE,
857 "%s: no ordering rule specified and no default ordering rule for attribute %s\n",
858 debug_header, ad->ad_cname.bv_val, 0);
866 static int count_key(BerElement *ber)
873 /* Server Side Sort Control is a SEQUENCE of SEQUENCE */
874 for ( tag = ber_first_element( ber, &len, &end );
875 tag == LBER_SEQUENCE;
876 tag = ber_next_element( ber, &len, end ))
878 tag = ber_skip_tag( ber, &len );
879 ber_skip_data( ber, len );
887 static int build_key(
893 struct berval matchrule = BER_BVNULL;
894 ber_int_t reverse = 0;
897 MatchingRule *ordering = NULL;
898 AttributeDescription *ad = NULL;
901 if (( tag = ber_scanf( ber, "{" )) == LBER_ERROR ) {
902 rs->sr_text = "serverSort control: decoding error";
903 rs->sr_err = LDAP_PROTOCOL_ERROR;
907 if (( tag = ber_scanf( ber, "m", &attr )) == LBER_ERROR ) {
908 rs->sr_text = "serverSort control: attribute decoding error";
909 rs->sr_err = LDAP_PROTOCOL_ERROR;
913 tag = ber_peek_tag( ber, &len );
914 if ( tag == LDAP_MATCHRULE_IDENTIFIER ) {
915 if (( tag = ber_scanf( ber, "m", &matchrule )) == LBER_ERROR ) {
916 rs->sr_text = "serverSort control: matchrule decoding error";
917 rs->sr_err = LDAP_PROTOCOL_ERROR;
920 tag = ber_peek_tag( ber, &len );
923 if ( tag == LDAP_REVERSEORDER_IDENTIFIER ) {
924 if (( tag = ber_scanf( ber, "b", &reverse )) == LBER_ERROR ) {
925 rs->sr_text = "serverSort control: reverse decoding error";
926 rs->sr_err = LDAP_PROTOCOL_ERROR;
931 if (( tag = ber_scanf( ber, "}" )) == LBER_ERROR ) {
932 rs->sr_text = "serverSort control: decoding error";
933 rs->sr_err = LDAP_PROTOCOL_ERROR;
937 if ( slap_bv2ad( &attr, &ad, &text ) != LDAP_SUCCESS ) {
939 "serverSort control: Unrecognized attribute type in sort key";
940 Debug(LDAP_DEBUG_TRACE,
941 "%s: Unrecognized attribute type in sort key: %s\n",
942 debug_header, SAFESTR(attr.bv_val, "<None>"), 0);
943 rs->sr_err = LDAP_NO_SUCH_ATTRIBUTE;
947 /* get_ordering_rule will set sr_err and sr_text */
948 get_ordering_rule( ad, &matchrule, rs, &ordering );
949 if ( rs->sr_err != LDAP_SUCCESS ) {
954 key->sk_ordering = ordering;
955 key->sk_direction = reverse ? -1 : 1;
960 static int sss_parseCtrl(
965 BerElementBuffer berbuf;
972 rs->sr_err = LDAP_PROTOCOL_ERROR;
974 if ( op->o_ctrlflag[sss_cid] > SLAP_CONTROL_IGNORED ) {
975 rs->sr_text = "sorted results control specified multiple times";
976 } else if ( BER_BVISNULL( &ctrl->ldctl_value ) ) {
977 rs->sr_text = "sorted results control value is absent";
978 } else if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
979 rs->sr_text = "sorted results control value is empty";
981 rs->sr_err = LDAP_SUCCESS;
983 if ( rs->sr_err != LDAP_SUCCESS )
986 op->o_ctrlflag[sss_cid] = ctrl->ldctl_iscritical ?
987 SLAP_CONTROL_CRITICAL : SLAP_CONTROL_NONCRITICAL;
989 ber = (BerElement *)&berbuf;
990 ber_init2( ber, &ctrl->ldctl_value, 0 );
991 i = count_key( ber );
993 sc = op->o_tmpalloc( sizeof(sort_ctrl) +
994 i * sizeof(sort_key), op->o_tmpmemctx );
996 op->o_controls[sss_cid] = sc;
998 /* peel off initial sequence */
999 ber_scanf( ber, "{" );
1003 if ( build_key( ber, rs, &sc->sc_keys[i] ) != LDAP_SUCCESS )
1006 tag = ber_peek_tag( ber, &len );
1007 } while ( tag != LBER_DEFAULT );
1012 static int vlv_parseCtrl(
1017 BerElementBuffer berbuf;
1024 rs->sr_err = LDAP_PROTOCOL_ERROR;
1027 if ( op->o_ctrlflag[vlv_cid] > SLAP_CONTROL_IGNORED ) {
1028 rs->sr_text = "vlv control specified multiple times";
1029 } else if ( BER_BVISNULL( &ctrl->ldctl_value ) ) {
1030 rs->sr_text = "vlv control value is absent";
1031 } else if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
1032 rs->sr_text = "vlv control value is empty";
1034 if ( rs->sr_text != NULL )
1037 op->o_ctrlflag[vlv_cid] = ctrl->ldctl_iscritical ?
1038 SLAP_CONTROL_CRITICAL : SLAP_CONTROL_NONCRITICAL;
1040 ber = (BerElement *)&berbuf;
1041 ber_init2( ber, &ctrl->ldctl_value, 0 );
1043 rs->sr_err = LDAP_PROTOCOL_ERROR;
1045 tag = ber_scanf( ber, "{ii", &vc2.vc_before, &vc2.vc_after );
1046 if ( tag == LBER_ERROR ) {
1050 tag = ber_peek_tag( ber, &len );
1051 if ( tag == LDAP_VLVBYINDEX_IDENTIFIER ) {
1052 tag = ber_scanf( ber, "{ii}", &vc2.vc_offset, &vc2.vc_count );
1053 if ( tag == LBER_ERROR )
1055 BER_BVZERO( &vc2.vc_value );
1056 } else if ( tag == LDAP_VLVBYVALUE_IDENTIFIER ) {
1057 tag = ber_scanf( ber, "m", &vc2.vc_value );
1058 if ( tag == LBER_ERROR || BER_BVISNULL( &vc2.vc_value ))
1063 tag = ber_peek_tag( ber, &len );
1064 if ( tag == LDAP_VLVCONTEXT_IDENTIFIER ) {
1066 tag = ber_scanf( ber, "m", &bv );
1067 if ( tag == LBER_ERROR || bv.bv_len != sizeof(vc2.vc_context))
1069 AC_MEMCPY( &vc2.vc_context, bv.bv_val, bv.bv_len );
1074 vc = op->o_tmpalloc( sizeof(vlv_ctrl), op->o_tmpmemctx );
1076 op->o_controls[vlv_cid] = vc;
1077 rs->sr_err = LDAP_SUCCESS;
1082 static int sssvlv_connection_destroy( BackendDB *be, Connection *conn )
1084 slap_overinst *on = (slap_overinst *)be->bd_info;
1086 if ( sort_conns[conn->c_conn_idx] )
1087 free_sort_op( conn, sort_conns[conn->c_conn_idx] );
1089 return LDAP_SUCCESS;
1092 static int sssvlv_db_open(
1096 slap_overinst *on = (slap_overinst *)be->bd_info;
1097 sssvlv_info *si = on->on_bi.bi_private;
1099 /* If not set, default to 1/2 of available threads */
1101 si->svi_max = connection_pool_max / 2;
1103 int rc = overlay_register_control( be, LDAP_CONTROL_SORTREQUEST );
1104 if ( rc == LDAP_SUCCESS )
1105 rc = overlay_register_control( be, LDAP_CONTROL_VLVREQUEST );
1109 static ConfigTable sssvlv_cfg[] = {
1110 { "sssvlv-max", "num",
1111 2, 2, 0, ARG_INT|ARG_OFFSET,
1112 (void *)offsetof(sssvlv_info, svi_max),
1113 "( OLcfgOvAt:21.1 NAME 'olcSssVlvMax' "
1114 "DESC 'Maximum number of concurrent Sort requests' "
1115 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
1116 { "sssvlv-maxkeys", "num",
1117 2, 2, 0, ARG_INT|ARG_OFFSET,
1118 (void *)offsetof(sssvlv_info, svi_max_keys),
1119 "( OLcfgOvAt:21.2 NAME 'olcSssVlvMaxKeys' "
1120 "DESC 'Maximum number of Keys in a Sort request' "
1121 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
1122 { NULL, NULL, 0, 0, 0, ARG_IGNORED }
1125 static ConfigOCs sssvlv_ocs[] = {
1126 { "( OLcfgOvOc:21.1 "
1127 "NAME 'olcSssVlvConfig' "
1128 "DESC 'SSS VLV configuration' "
1129 "SUP olcOverlayConfig "
1130 "MAY ( olcSssVlvMax $ olcSssVlvMaxKeys ) )",
1131 Cft_Overlay, sssvlv_cfg, NULL, NULL },
1135 static int sssvlv_db_init(
1139 slap_overinst *on = (slap_overinst *)be->bd_info;
1142 si = (sssvlv_info *)ch_malloc(sizeof(sssvlv_info));
1143 on->on_bi.bi_private = si;
1147 si->svi_max_keys = SSSVLV_DEFAULT_MAX_KEYS;
1149 if ( dtblsize && !sort_conns ) {
1150 ldap_pvt_thread_mutex_init( &sort_conns_mutex );
1151 /* accommodate for c_conn_idx == -1 */
1152 sort_conns = ch_calloc( sizeof(sort_op *), dtblsize + 1 );
1156 return LDAP_SUCCESS;
1159 static int sssvlv_db_destroy(
1163 slap_overinst *on = (slap_overinst *)be->bd_info;
1164 sssvlv_info *si = (sssvlv_info *)on->on_bi.bi_private;
1168 on->on_bi.bi_private = NULL;
1170 return LDAP_SUCCESS;
1173 static slap_overinst sssvlv;
1175 int sssvlv_initialize()
1179 sssvlv.on_bi.bi_type = "sssvlv";
1180 sssvlv.on_bi.bi_db_init = sssvlv_db_init;
1181 sssvlv.on_bi.bi_db_destroy = sssvlv_db_destroy;
1182 sssvlv.on_bi.bi_db_open = sssvlv_db_open;
1183 sssvlv.on_bi.bi_connection_destroy = sssvlv_connection_destroy;
1184 sssvlv.on_bi.bi_op_search = sssvlv_op_search;
1186 sssvlv.on_bi.bi_cf_ocs = sssvlv_ocs;
1188 rc = config_register_schema( sssvlv_cfg, sssvlv_ocs );
1192 rc = register_supported_control2( LDAP_CONTROL_SORTREQUEST,
1199 if ( rc == LDAP_SUCCESS ) {
1200 rc = register_supported_control2( LDAP_CONTROL_VLVREQUEST,
1208 if ( rc == LDAP_SUCCESS ) {
1209 rc = overlay_register( &sssvlv );
1210 if ( rc != LDAP_SUCCESS ) {
1211 fprintf( stderr, "Failed to register server side sort overlay\n" );
1215 fprintf( stderr, "Failed to register control %d\n", rc );
1221 #if SLAPD_OVER_SSSVLV == SLAPD_MOD_DYNAMIC
1222 int init_module( int argc, char *argv[])
1224 return sssvlv_initialize();
1228 #endif /* SLAPD_OVER_SSSVLV */