git.sur5r.net Git - openldap/blob - servers/slapd/overlays/sssvlv.c

   1 /* sssvlv.c - server side sort / virtual list view */
   2 /* $OpenLDAP$ */
   3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
   4  *
   5  * Copyright 2009-2011 The OpenLDAP Foundation.
   6  * Portions copyright 2009 Symas Corporation.
   7  * All rights reserved.
   8  *
   9  * Redistribution and use in source and binary forms, with or without
  10  * modification, are permitted only as authorized by the OpenLDAP
  11  * Public License.
  12  *
  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>.
  16  */
  17 /* ACKNOWLEDGEMENTS:
  18  * This work was initially developed by Howard Chu for inclusion in
  19  * OpenLDAP Software. Support for multiple sorts per connection added
  20  * by Raphael Ouazana.
  21  */
  22
  23 #include "portable.h"
  24
  25 #ifdef SLAPD_OVER_SSSVLV
  26
  27 #include <stdio.h>
  28
  29 #include <ac/string.h>
  30 #include <ac/ctype.h>
  31
  32 #include <avl.h>
  33
  34 #include "slap.h"
  35 #include "lutil.h"
  36 #include "config.h"
  37
  38 #include "../../../libraries/liblber/lber-int.h"        /* ber_rewind */
  39
  40 /* RFC2891: Server Side Sorting
  41  * RFC2696: Paged Results
  42  */
  43 #ifndef LDAP_MATCHRULE_IDENTIFIER
  44 #define LDAP_MATCHRULE_IDENTIFIER      0x80L
  45 #define LDAP_REVERSEORDER_IDENTIFIER   0x81L
  46 #define LDAP_ATTRTYPES_IDENTIFIER      0x80L
  47 #endif
  48
  49 /* draft-ietf-ldapext-ldapv3-vlv-09.txt: Virtual List Views
  50  */
  51 #ifndef LDAP_VLVBYINDEX_IDENTIFIER
  52 #define LDAP_VLVBYINDEX_IDENTIFIER         0xa0L
  53 #define LDAP_VLVBYVALUE_IDENTIFIER     0x81L
  54 #define LDAP_VLVCONTEXT_IDENTIFIER     0x04L
  55
  56 #define LDAP_VLV_SSS_MISSING    0x4C
  57 #define LDAP_VLV_RANGE_ERROR    0x4D
  58 #endif
  59
  60 #define SAFESTR(macro_str, macro_def) ((macro_str) ? (macro_str) : (macro_def))
  61
  62 #define SSSVLV_DEFAULT_MAX_KEYS 5
  63 #define SSSVLV_DEFAULT_MAX_REQUEST_PER_CONN 5
  64
  65 #define NO_PS_COOKIE (PagedResultsCookie) -1
  66 #define NO_VC_CONTEXT (unsigned long) -1
  67
  68 typedef struct vlv_ctrl {
  69         int vc_before;
  70         int vc_after;
  71         int     vc_offset;
  72         int vc_count;
  73         struct berval vc_value;
  74         unsigned long vc_context;
  75 } vlv_ctrl;
  76
  77 typedef struct sort_key
  78 {
  79         AttributeDescription    *sk_ad;
  80         MatchingRule                    *sk_ordering;
  81         int                                             sk_direction;   /* 1=normal, -1=reverse */
  82 } sort_key;
  83
  84 typedef struct sort_ctrl {
  85         int sc_nkeys;
  86         sort_key sc_keys[1];
  87 } sort_ctrl;
  88
  89
  90 typedef struct sort_node
  91 {
  92         int sn_conn;
  93         int sn_session;
  94         struct berval sn_dn;
  95         struct berval *sn_vals;
  96 } sort_node;
  97
  98 typedef struct sssvlv_info
  99 {
 100         int svi_max;    /* max concurrent sorts */
 101         int svi_num;    /* current # sorts */
 102         int svi_max_keys;       /* max sort keys per request */
 103         int svi_max_percon; /* max concurrent sorts per con */
 104 } sssvlv_info;
 105
 106 typedef struct sort_op
 107 {
 108         Avlnode *so_tree;
 109         sort_ctrl *so_ctrl;
 110         sssvlv_info *so_info;
 111         int so_paged;
 112         int so_page_size;
 113         int so_nentries;
 114         int so_vlv;
 115         int so_vlv_rc;
 116         int so_vlv_target;
 117         int so_session;
 118         unsigned long so_vcontext;
 119 } sort_op;
 120
 121 /* There is only one conn table for all overlay instances */
 122 /* Each conn can handle one session by context */
 123 static sort_op ***sort_conns;
 124 static ldap_pvt_thread_mutex_t sort_conns_mutex;
 125 static int ov_count;
 126 static const char *debug_header = "sssvlv";
 127
 128 static int sss_cid;
 129 static int vlv_cid;
 130
 131 /* RFC 2981 Section 2.2
 132  * If a sort key is a multi-valued attribute, and an entry happens to
 133  * have multiple values for that attribute and no other controls are
 134  * present that affect the sorting order, then the server SHOULD use the
 135  * least value (according to the ORDERING rule for that attribute).
 136  */
 137 static struct berval* select_value(
 138         Attribute               *attr,
 139         sort_key                        *key )
 140 {
 141         struct berval* ber1, *ber2;
 142         MatchingRule *mr = key->sk_ordering;
 143         unsigned i;
 144         int cmp;
 145
 146         ber1 = &(attr->a_nvals[0]);
 147         ber2 = ber1+1;
 148         for ( i = 1; i < attr->a_numvals; i++,ber2++ ) {
 149                 mr->smr_match( &cmp, 0, mr->smr_syntax, mr, ber1, ber2 );
 150                 if ( cmp > 0 ) {
 151                         ber1 = ber2;
 152                 }
 153         }
 154
 155         Debug(LDAP_DEBUG_TRACE, "%s: value selected for compare: %s\n",
 156                 debug_header,
 157                 SAFESTR(ber1->bv_val, "<Empty>"),
 158                 0);
 159
 160         return ber1;
 161 }
 162
 163 static int node_cmp( const void* val1, const void* val2 )
 164 {
 165         sort_node *sn1 = (sort_node *)val1;
 166         sort_node *sn2 = (sort_node *)val2;
 167         sort_ctrl *sc;
 168         MatchingRule *mr;
 169         int i, cmp = 0;
 170         assert( sort_conns[sn1->sn_conn]
 171                 && sort_conns[sn1->sn_conn][sn1->sn_session]
 172                 && sort_conns[sn1->sn_conn][sn1->sn_session]->so_ctrl );
 173         sc = sort_conns[sn1->sn_conn][sn1->sn_session]->so_ctrl;
 174
 175         for ( i=0; cmp == 0 && i<sc->sc_nkeys; i++ ) {
 176                 if ( BER_BVISNULL( &sn1->sn_vals[i] )) {
 177                         if ( BER_BVISNULL( &sn2->sn_vals[i] ))
 178                                 cmp = 0;
 179                         else
 180                                 cmp = sc->sc_keys[i].sk_direction;
 181                 } else if ( BER_BVISNULL( &sn2->sn_vals[i] )) {
 182                         cmp = sc->sc_keys[i].sk_direction * -1;
 183                 } else {
 184                         mr = sc->sc_keys[i].sk_ordering;
 185                         mr->smr_match( &cmp, 0, mr->smr_syntax, mr,
 186                                 &sn1->sn_vals[i], &sn2->sn_vals[i] );
 187                         if ( cmp )
 188                                 cmp *= sc->sc_keys[i].sk_direction;
 189                 }
 190         }
 191         return cmp;
 192 }
 193
 194 static int node_insert( const void *val1, const void *val2 )
 195 {
 196         /* Never return equal so that new entries are always inserted */
 197         return node_cmp( val1, val2 ) < 0 ? -1 : 1;
 198 }
 199
 200 static int pack_vlv_response_control(
 201         Operation               *op,
 202         SlapReply               *rs,
 203         sort_op                 *so,
 204         LDAPControl     **ctrlsp )
 205 {
 206         LDAPControl                     *ctrl;
 207         BerElementBuffer        berbuf;
 208         BerElement                      *ber            = (BerElement *)&berbuf;
 209         struct berval           cookie, bv;
 210         int                                     rc;
 211
 212         ber_init2( ber, NULL, LBER_USE_DER );
 213         ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
 214
 215         rc = ber_printf( ber, "{iie", so->so_vlv_target, so->so_nentries,
 216                 so->so_vlv_rc );
 217
 218         if ( rc != -1 && so->so_vcontext ) {
 219                 cookie.bv_val = (char *)&so->so_vcontext;
 220                 cookie.bv_len = sizeof(so->so_vcontext);
 221                 rc = ber_printf( ber, "tO", LDAP_VLVCONTEXT_IDENTIFIER, &cookie );
 222         }
 223
 224         if ( rc != -1 ) {
 225                 rc = ber_printf( ber, "}" );
 226         }
 227
 228         if ( rc != -1 ) {
 229                 rc = ber_flatten2( ber, &bv, 0 );
 230         }
 231
 232         if ( rc != -1 ) {
 233                 ctrl = (LDAPControl *)op->o_tmpalloc( sizeof(LDAPControl)+
 234                         bv.bv_len, op->o_tmpmemctx );
 235                 ctrl->ldctl_oid                 = LDAP_CONTROL_VLVRESPONSE;
 236                 ctrl->ldctl_iscritical  = 0;
 237                 ctrl->ldctl_value.bv_val = (char *)(ctrl+1);
 238                 ctrl->ldctl_value.bv_len = bv.bv_len;
 239                 AC_MEMCPY( ctrl->ldctl_value.bv_val, bv.bv_val, bv.bv_len );
 240                 ctrlsp[0] = ctrl;
 241         } else {
 242                 ctrlsp[0] = NULL;
 243                 rs->sr_err = LDAP_OTHER;
 244         }
 245
 246         ber_free_buf( ber );
 247
 248         return rs->sr_err;
 249 }
 250
 251 static int pack_pagedresult_response_control(
 252         Operation               *op,
 253         SlapReply               *rs,
 254         sort_op                 *so,
 255         LDAPControl     **ctrlsp )
 256 {
 257         LDAPControl                     *ctrl;
 258         BerElementBuffer        berbuf;
 259         BerElement                      *ber            = (BerElement *)&berbuf;
 260         PagedResultsCookie      resp_cookie;
 261         struct berval           cookie, bv;
 262         int                                     rc;
 263
 264         ber_init2( ber, NULL, LBER_USE_DER );
 265         ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
 266
 267         if ( so->so_nentries > 0 ) {
 268                 resp_cookie             = ( PagedResultsCookie )so->so_tree;
 269                 cookie.bv_len   = sizeof( PagedResultsCookie );
 270                 cookie.bv_val   = (char *)&resp_cookie;
 271         } else {
 272                 resp_cookie             = ( PagedResultsCookie )0;
 273                 BER_BVZERO( &cookie );
 274         }
 275
 276         op->o_conn->c_pagedresults_state.ps_cookie = resp_cookie;
 277         op->o_conn->c_pagedresults_state.ps_count
 278                 = ((PagedResultsState *)op->o_pagedresults_state)->ps_count
 279                   + rs->sr_nentries;
 280
 281         rc = ber_printf( ber, "{iO}", so->so_nentries, &cookie );
 282         if ( rc != -1 ) {
 283                 rc = ber_flatten2( ber, &bv, 0 );
 284         }
 285
 286         if ( rc != -1 ) {
 287                 ctrl = (LDAPControl *)op->o_tmpalloc( sizeof(LDAPControl)+
 288                         bv.bv_len, op->o_tmpmemctx );
 289                 ctrl->ldctl_oid                 = LDAP_CONTROL_PAGEDRESULTS;
 290                 ctrl->ldctl_iscritical  = 0;
 291                 ctrl->ldctl_value.bv_val = (char *)(ctrl+1);
 292                 ctrl->ldctl_value.bv_len = bv.bv_len;
 293                 AC_MEMCPY( ctrl->ldctl_value.bv_val, bv.bv_val, bv.bv_len );
 294                 ctrlsp[0] = ctrl;
 295         } else {
 296                 ctrlsp[0] = NULL;
 297                 rs->sr_err = LDAP_OTHER;
 298         }
 299
 300         ber_free_buf( ber );
 301
 302         return rs->sr_err;
 303 }
 304
 305 static int pack_sss_response_control(
 306         Operation               *op,
 307         SlapReply               *rs,
 308         LDAPControl     **ctrlsp )
 309 {
 310         LDAPControl                     *ctrl;
 311         BerElementBuffer        berbuf;
 312         BerElement                      *ber            = (BerElement *)&berbuf;
 313         struct berval           bv;
 314         int                                     rc;
 315
 316         ber_init2( ber, NULL, LBER_USE_DER );
 317         ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
 318
 319         /* Pack error code */
 320         rc = ber_printf(ber, "{e}", rs->sr_err);
 321
 322         if ( rc != -1)
 323                 rc = ber_flatten2( ber, &bv, 0 );
 324
 325         if ( rc != -1 ) {
 326                 ctrl = (LDAPControl *)op->o_tmpalloc( sizeof(LDAPControl)+
 327                         bv.bv_len, op->o_tmpmemctx );
 328                 ctrl->ldctl_oid                 = LDAP_CONTROL_SORTRESPONSE;
 329                 ctrl->ldctl_iscritical  = 0;
 330                 ctrl->ldctl_value.bv_val = (char *)(ctrl+1);
 331                 ctrl->ldctl_value.bv_len = bv.bv_len;
 332                 AC_MEMCPY( ctrl->ldctl_value.bv_val, bv.bv_val, bv.bv_len );
 333                 ctrlsp[0] = ctrl;
 334         } else {
 335                 ctrlsp[0] = NULL;
 336                 rs->sr_err = LDAP_OTHER;
 337         }
 338
 339         ber_free_buf( ber );
 340
 341         return rs->sr_err;
 342 }
 343
 344 /* Return the session id or -1 if unknown */
 345 static int find_session_by_so(
 346         int svi_max_percon,
 347         int conn_id,
 348         sort_op *so )
 349 {
 350         int sess_id;
 351         if (so == NULL) {
 352                 return -1;
 353         }
 354         for (sess_id = 0; sess_id < svi_max_percon; sess_id++) {
 355                 if ( sort_conns[conn_id] && sort_conns[conn_id][sess_id] == so )
 356                         return sess_id;
 357         }
 358         return -1;
 359 }
 360
 361 /* Return the session id or -1 if unknown */
 362 static int find_session_by_context(
 363         int svi_max_percon,
 364         int conn_id,
 365         unsigned long vc_context,
 366         PagedResultsCookie ps_cookie )
 367 {
 368         int sess_id;
 369         for(sess_id = 0; sess_id < svi_max_percon; sess_id++) {
 370                 if( sort_conns[conn_id] && sort_conns[conn_id][sess_id] &&
 371                     ( sort_conns[conn_id][sess_id]->so_vcontext == vc_context ||
 372                       (PagedResultsCookie) sort_conns[conn_id][sess_id]->so_tree == ps_cookie ) )
 373                         return sess_id;
 374         }
 375         return -1;
 376 }
 377
 378 static int find_next_session(
 379         int svi_max_percon,
 380         int conn_id )
 381 {
 382         int sess_id;
 383         assert(sort_conns[conn_id] != NULL);
 384         for(sess_id = 0; sess_id < svi_max_percon; sess_id++) {
 385                 if(!sort_conns[conn_id][sess_id]) {
 386                         return sess_id;
 387                 }
 388         }
 389         if (sess_id >= svi_max_percon) {
 390                 return -1;
 391         } else {
 392                 return sess_id;
 393         }
 394 }
 395
 396 static void free_sort_op( Connection *conn, sort_op *so )
 397 {
 398         int sess_id;
 399         if ( so->so_tree ) {
 400                 tavl_free( so->so_tree, ch_free );
 401                 so->so_tree = NULL;
 402         }
 403
 404         ldap_pvt_thread_mutex_lock( &sort_conns_mutex );
 405         sess_id = find_session_by_so( so->so_info->svi_max_percon, conn->c_conn_idx, so );
 406         sort_conns[conn->c_conn_idx][sess_id] = NULL;
 407         so->so_info->svi_num--;
 408         ldap_pvt_thread_mutex_unlock( &sort_conns_mutex );
 409
 410         ch_free( so );
 411 }
 412
 413 static void free_sort_ops( Connection *conn, sort_op **sos, int svi_max_percon )
 414 {
 415         int sess_id;
 416         sort_op *so;
 417
 418         for( sess_id = 0; sess_id < svi_max_percon ; sess_id++ ) {
 419                 so = sort_conns[conn->c_conn_idx][sess_id];
 420                 if ( so ) {
 421                         free_sort_op( conn, so );
 422                         sort_conns[conn->c_conn_idx][sess_id] = NULL;
 423                 }
 424         }
 425 }
 426
 427 static void send_list(
 428         Operation               *op,
 429         SlapReply               *rs,
 430         sort_op                 *so)
 431 {
 432         Avlnode *cur_node, *tmp_node;
 433         vlv_ctrl *vc = op->o_controls[vlv_cid];
 434         int i, j, dir, rc;
 435         BackendDB *be;
 436         Entry *e;
 437         LDAPControl *ctrls[2];
 438
 439         /* FIXME: it may be better to just flatten the tree into
 440          * an array before doing all of this...
 441          */
 442
 443         /* Are we just counting an offset? */
 444         if ( BER_BVISNULL( &vc->vc_value )) {
 445                 if ( vc->vc_offset == vc->vc_count ) {
 446                         /* wants the last entry in the list */
 447                         cur_node = tavl_end(so->so_tree, TAVL_DIR_RIGHT);
 448                         so->so_vlv_target = so->so_nentries;
 449                 } else if ( vc->vc_offset == 1 ) {
 450                         /* wants the first entry in the list */
 451                         cur_node = tavl_end(so->so_tree, TAVL_DIR_LEFT);
 452                         so->so_vlv_target = 1;
 453                 } else {
 454                         int target;
 455                         /* Just iterate to the right spot */
 456                         if ( vc->vc_count && vc->vc_count != so->so_nentries ) {
 457                                 if ( vc->vc_offset > vc->vc_count )
 458                                         goto range_err;
 459                                 target = so->so_nentries * vc->vc_offset / vc->vc_count;
 460                         } else {
 461                                 if ( vc->vc_offset > so->so_nentries ) {
 462 range_err:
 463                                         so->so_vlv_rc = LDAP_VLV_RANGE_ERROR;
 464                                         pack_vlv_response_control( op, rs, so, ctrls );
 465                                         ctrls[1] = NULL;
 466                                         slap_add_ctrls( op, rs, ctrls );
 467                                         rs->sr_err = LDAP_VLV_ERROR;
 468                                         return;
 469                                 }
 470                                 target = vc->vc_offset;
 471                         }
 472                         so->so_vlv_target = target;
 473                         /* Start at left and go right, or start at right and go left? */
 474                         if ( target < so->so_nentries / 2 ) {
 475                                 cur_node = tavl_end(so->so_tree, TAVL_DIR_LEFT);
 476                                 dir = TAVL_DIR_RIGHT;
 477                         } else {
 478                                 cur_node = tavl_end(so->so_tree, TAVL_DIR_RIGHT);
 479                                 dir = TAVL_DIR_LEFT;
 480                                 target = so->so_nentries - target + 1;
 481                         }
 482                         for ( i=1; i<target; i++ )
 483                                 cur_node = tavl_next( cur_node, dir );
 484                 }
 485         } else {
 486         /* we're looking for a specific value */
 487                 sort_ctrl *sc = so->so_ctrl;
 488                 MatchingRule *mr = sc->sc_keys[0].sk_ordering;
 489                 sort_node *sn;
 490                 struct berval bv;
 491
 492                 if ( mr->smr_normalize ) {
 493                         rc = mr->smr_normalize( SLAP_MR_VALUE_OF_SYNTAX,
 494                                 mr->smr_syntax, mr, &vc->vc_value, &bv, op->o_tmpmemctx );
 495                         if ( rc ) {
 496                                 so->so_vlv_rc = LDAP_INAPPROPRIATE_MATCHING;
 497                                 pack_vlv_response_control( op, rs, so, ctrls );
 498                                 ctrls[1] = NULL;
 499                                 slap_add_ctrls( op, rs, ctrls );
 500                                 rs->sr_err = LDAP_VLV_ERROR;
 501                                 return;
 502                         }
 503                 } else {
 504                         bv = vc->vc_value;
 505                 }
 506
 507                 sn = op->o_tmpalloc( sizeof(sort_node) +
 508                         sc->sc_nkeys * sizeof(struct berval), op->o_tmpmemctx );
 509                 sn->sn_vals = (struct berval *)(sn+1);
 510                 sn->sn_conn = op->o_conn->c_conn_idx;
 511                 sn->sn_session = find_session_by_so( so->so_info->svi_max_percon, op->o_conn->c_conn_idx, so );
 512                 sn->sn_vals[0] = bv;
 513                 for (i=1; i<sc->sc_nkeys; i++) {
 514                         BER_BVZERO( &sn->sn_vals[i] );
 515                 }
 516                 cur_node = tavl_find3( so->so_tree, sn, node_cmp, &j );
 517                 /* didn't find >= match */
 518                 if ( j > 0 ) {
 519                         if ( cur_node )
 520                                 cur_node = tavl_next( cur_node, TAVL_DIR_RIGHT );
 521                 }
 522                 op->o_tmpfree( sn, op->o_tmpmemctx );
 523
 524                 if ( !cur_node ) {
 525                         so->so_vlv_target = so->so_nentries + 1;
 526                 } else {
 527                         sort_node *sn = so->so_tree->avl_data;
 528                         /* start from the left or the right side? */
 529                         mr->smr_match( &i, 0, mr->smr_syntax, mr, &bv, &sn->sn_vals[0] );
 530                         if ( i > 0 ) {
 531                                 tmp_node = tavl_end(so->so_tree, TAVL_DIR_RIGHT);
 532                                 dir = TAVL_DIR_LEFT;
 533                         } else {
 534                                 tmp_node = tavl_end(so->so_tree, TAVL_DIR_LEFT);
 535                                 dir = TAVL_DIR_RIGHT;
 536                         }
 537                         for (i=0; tmp_node != cur_node;
 538                                 tmp_node = tavl_next( tmp_node, dir ), i++);
 539                         so->so_vlv_target = (dir == TAVL_DIR_RIGHT) ? i+1 : so->so_nentries - i;
 540                 }
 541                 if ( bv.bv_val != vc->vc_value.bv_val )
 542                         op->o_tmpfree( bv.bv_val, op->o_tmpmemctx );
 543         }
 544         if ( !cur_node ) {
 545                 i = 1;
 546                 cur_node = tavl_end(so->so_tree, TAVL_DIR_RIGHT);
 547         } else {
 548                 i = 0;
 549         }
 550         for ( ; i<vc->vc_before; i++ ) {
 551                 tmp_node = tavl_next( cur_node, TAVL_DIR_LEFT );
 552                 if ( !tmp_node ) break;
 553                 cur_node = tmp_node;
 554         }
 555         j = i + vc->vc_after + 1;
 556         be = op->o_bd;
 557         for ( i=0; i<j; i++ ) {
 558                 sort_node *sn = cur_node->avl_data;
 559
 560                 if ( slapd_shutdown ) break;
 561
 562                 op->o_bd = select_backend( &sn->sn_dn, 0 );
 563                 e = NULL;
 564                 rc = be_entry_get_rw( op, &sn->sn_dn, NULL, NULL, 0, &e );
 565
 566                 if ( e && rc == LDAP_SUCCESS ) {
 567                         rs->sr_entry = e;
 568                         rs->sr_flags = REP_ENTRY_MUSTRELEASE;
 569                         rs->sr_err = send_search_entry( op, rs );
 570                         if ( rs->sr_err == LDAP_UNAVAILABLE )
 571                                 break;
 572                 }
 573                 cur_node = tavl_next( cur_node, TAVL_DIR_RIGHT );
 574                 if ( !cur_node ) break;
 575         }
 576         so->so_vlv_rc = LDAP_SUCCESS;
 577
 578         op->o_bd = be;
 579 }
 580
 581 static void send_page( Operation *op, SlapReply *rs, sort_op *so )
 582 {
 583         Avlnode         *cur_node               = so->so_tree;
 584         Avlnode         *next_node              = NULL;
 585         BackendDB *be = op->o_bd;
 586         Entry *e;
 587         int rc;
 588
 589         while ( cur_node && rs->sr_nentries < so->so_page_size ) {
 590                 sort_node *sn = cur_node->avl_data;
 591
 592                 if ( slapd_shutdown ) break;
 593
 594                 next_node = tavl_next( cur_node, TAVL_DIR_RIGHT );
 595
 596                 op->o_bd = select_backend( &sn->sn_dn, 0 );
 597                 e = NULL;
 598                 rc = be_entry_get_rw( op, &sn->sn_dn, NULL, NULL, 0, &e );
 599
 600                 ch_free( cur_node->avl_data );
 601                 ber_memfree( cur_node );
 602
 603                 cur_node = next_node;
 604                 so->so_nentries--;
 605
 606                 if ( e && rc == LDAP_SUCCESS ) {
 607                         rs->sr_entry = e;
 608                         rs->sr_flags = REP_ENTRY_MUSTRELEASE;
 609                         rs->sr_err = send_search_entry( op, rs );
 610                         if ( rs->sr_err == LDAP_UNAVAILABLE )
 611                                 break;
 612                 }
 613         }
 614
 615         /* Set the first entry to send for the next page */
 616         so->so_tree = next_node;
 617
 618         op->o_bd = be;
 619 }
 620
 621 static void send_entry(
 622         Operation               *op,
 623         SlapReply               *rs,
 624         sort_op                 *so)
 625 {
 626         Debug(LDAP_DEBUG_TRACE,
 627                 "%s: response control: status=%d, text=%s\n",
 628                 debug_header, rs->sr_err, SAFESTR(rs->sr_text, "<None>"));
 629
 630         if ( !so->so_tree )
 631                 return;
 632
 633         rs->sr_attrs = op->ors_attrs;
 634
 635         /* RFC 2891: If critical then send the entries iff they were
 636          * succesfully sorted.  If non-critical send all entries
 637          * whether they were sorted or not.
 638          */
 639         if ( (op->o_ctrlflag[sss_cid] != SLAP_CONTROL_CRITICAL) ||
 640                  (rs->sr_err == LDAP_SUCCESS) )
 641         {
 642                 if ( so->so_vlv > SLAP_CONTROL_IGNORED ) {
 643                         send_list( op, rs, so );
 644                 } else {
 645                         /* Get the first node to send */
 646                         Avlnode *start_node = tavl_end(so->so_tree, TAVL_DIR_LEFT);
 647                         so->so_tree = start_node;
 648
 649                         if ( so->so_paged <= SLAP_CONTROL_IGNORED ) {
 650                                 /* Not paged result search.  Send all entries.
 651                                  * Set the page size to the number of entries
 652                                  * so that send_page() will send all entries.
 653                                  */
 654                                 so->so_page_size = so->so_nentries;
 655                         }
 656
 657                         send_page( op, rs, so );
 658                 }
 659         }
 660 }
 661
 662 static void send_result(
 663         Operation               *op,
 664         SlapReply               *rs,
 665         sort_op                 *so)
 666 {
 667         LDAPControl *ctrls[3];
 668         int rc, i = 0;
 669
 670         rc = pack_sss_response_control( op, rs, ctrls );
 671         if ( rc == LDAP_SUCCESS ) {
 672                 i++;
 673                 rc = -1;
 674                 if ( so->so_paged > SLAP_CONTROL_IGNORED ) {
 675                         rc = pack_pagedresult_response_control( op, rs, so, ctrls+1 );
 676                 } else if ( so->so_vlv > SLAP_CONTROL_IGNORED ) {
 677                         rc = pack_vlv_response_control( op, rs, so, ctrls+1 );
 678                 }
 679                 if ( rc == LDAP_SUCCESS )
 680                         i++;
 681         }
 682         ctrls[i] = NULL;
 683
 684         if ( ctrls[0] != NULL )
 685                 slap_add_ctrls( op, rs, ctrls );
 686         send_ldap_result( op, rs );
 687
 688         if ( so->so_tree == NULL ) {
 689                 /* Search finished, so clean up */
 690                 free_sort_op( op->o_conn, so );
 691         }
 692 }
 693
 694 static int sssvlv_op_response(
 695         Operation       *op,
 696         SlapReply       *rs )
 697 {
 698         sort_ctrl *sc = op->o_controls[sss_cid];
 699         sort_op *so = op->o_callback->sc_private;
 700
 701         if ( rs->sr_type == REP_SEARCH ) {
 702                 int i;
 703                 size_t len;
 704                 sort_node *sn, *sn2;
 705                 struct berval *bv;
 706                 char *ptr;
 707
 708                 len = sizeof(sort_node) + sc->sc_nkeys * sizeof(struct berval) +
 709                         rs->sr_entry->e_nname.bv_len + 1;
 710                 sn = op->o_tmpalloc( len, op->o_tmpmemctx );
 711                 sn->sn_vals = (struct berval *)(sn+1);
 712
 713                 /* Build tmp list of key values */
 714                 for ( i=0; i<sc->sc_nkeys; i++ ) {
 715                         Attribute *a = attr_find( rs->sr_entry->e_attrs,
 716                                 sc->sc_keys[i].sk_ad );
 717                         if ( a ) {
 718                                 if ( a->a_numvals > 1 ) {
 719                                         bv = select_value( a, &sc->sc_keys[i] );
 720                                 } else {
 721                                         bv = a->a_nvals;
 722                                 }
 723                                 sn->sn_vals[i] = *bv;
 724                                 len += bv->bv_len + 1;
 725                         } else {
 726                                 BER_BVZERO( &sn->sn_vals[i] );
 727                         }
 728                 }
 729
 730                 /* Now dup into regular memory */
 731                 sn2 = ch_malloc( len );
 732                 sn2->sn_vals = (struct berval *)(sn2+1);
 733                 AC_MEMCPY( sn2->sn_vals, sn->sn_vals,
 734                                 sc->sc_nkeys * sizeof(struct berval));
 735
 736                 ptr = (char *)(sn2->sn_vals + sc->sc_nkeys);
 737                 sn2->sn_dn.bv_val = ptr;
 738                 sn2->sn_dn.bv_len = rs->sr_entry->e_nname.bv_len;
 739                 AC_MEMCPY( ptr, rs->sr_entry->e_nname.bv_val,
 740                         rs->sr_entry->e_nname.bv_len );
 741                 ptr += rs->sr_entry->e_nname.bv_len;
 742                 *ptr++ = '\0';
 743                 for ( i=0; i<sc->sc_nkeys; i++ ) {
 744                         if ( !BER_BVISNULL( &sn2->sn_vals[i] )) {
 745                                 AC_MEMCPY(ptr, sn2->sn_vals[i].bv_val, sn2->sn_vals[i].bv_len);
 746                                 sn2->sn_vals[i].bv_val = ptr;
 747                                 ptr += sn2->sn_vals[i].bv_len;
 748                                 *ptr++ = '\0';
 749                         }
 750                 }
 751                 op->o_tmpfree( sn, op->o_tmpmemctx );
 752                 sn = sn2;
 753                 sn->sn_conn = op->o_conn->c_conn_idx;
 754                 sn->sn_session = find_session_by_so( so->so_info->svi_max_percon, op->o_conn->c_conn_idx, so );
 755
 756                 /* Insert into the AVL tree */
 757                 tavl_insert(&(so->so_tree), sn, node_insert, avl_dup_error);
 758
 759                 so->so_nentries++;
 760
 761                 /* Collected the keys so that they can be sorted.  Thus, stop
 762                  * the entry from propagating.
 763                  */
 764                 rs->sr_err = LDAP_SUCCESS;
 765         }
 766         else if ( rs->sr_type == REP_RESULT ) {
 767                 /* Remove serversort response callback.
 768                  * We don't want the entries that we are about to send to be
 769                  * processed by serversort response again.
 770                  */
 771                 if ( op->o_callback->sc_response == sssvlv_op_response ) {
 772                         op->o_callback = op->o_callback->sc_next;
 773                 }
 774
 775                 send_entry( op, rs, so );
 776                 send_result( op, rs, so );
 777         }
 778
 779         return rs->sr_err;
 780 }
 781
 782 static int sssvlv_op_search(
 783         Operation               *op,
 784         SlapReply               *rs)
 785 {
 786         slap_overinst                   *on                     = (slap_overinst *)op->o_bd->bd_info;
 787         sssvlv_info                             *si                     = on->on_bi.bi_private;
 788         int                                             rc                      = SLAP_CB_CONTINUE;
 789         int     ok;
 790         sort_op *so = NULL, so2;
 791         sort_ctrl *sc;
 792         PagedResultsState *ps;
 793         vlv_ctrl *vc;
 794         int sess_id;
 795
 796         if ( op->o_ctrlflag[sss_cid] <= SLAP_CONTROL_IGNORED ) {
 797                 if ( op->o_ctrlflag[vlv_cid] > SLAP_CONTROL_IGNORED ) {
 798                         LDAPControl *ctrls[2];
 799                         so2.so_vcontext = 0;
 800                         so2.so_vlv_target = 0;
 801                         so2.so_nentries = 0;
 802                         so2.so_vlv_rc = LDAP_VLV_SSS_MISSING;
 803                         so2.so_vlv = op->o_ctrlflag[vlv_cid];
 804                         rc = pack_vlv_response_control( op, rs, &so2, ctrls );
 805                         if ( rc == LDAP_SUCCESS ) {
 806                                 ctrls[1] = NULL;
 807                                 slap_add_ctrls( op, rs, ctrls );
 808                         }
 809                         rs->sr_err = LDAP_VLV_ERROR;
 810                         rs->sr_text = "Sort control is required with VLV";
 811                         goto leave;
 812                 }
 813                 /* Not server side sort so just continue */
 814                 return SLAP_CB_CONTINUE;
 815         }
 816
 817         Debug(LDAP_DEBUG_TRACE,
 818                 "==> sssvlv_search: <%s> %s, control flag: %d\n",
 819                 op->o_req_dn.bv_val, op->ors_filterstr.bv_val,
 820                 op->o_ctrlflag[sss_cid]);
 821
 822         sc = op->o_controls[sss_cid];
 823         if ( sc->sc_nkeys > si->svi_max_keys ) {
 824                 rs->sr_text = "Too many sort keys";
 825                 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
 826                 goto leave;
 827         }
 828
 829         ps = ( op->o_pagedresults > SLAP_CONTROL_IGNORED ) ?
 830                 (PagedResultsState*)(op->o_pagedresults_state) : NULL;
 831         vc = op->o_ctrlflag[vlv_cid] > SLAP_CONTROL_IGNORED ?
 832                 op->o_controls[vlv_cid] : NULL;
 833
 834         if ( ps && vc ) {
 835                 rs->sr_text = "VLV incompatible with PagedResults";
 836                 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
 837                 goto leave;
 838         }
 839
 840         ok = 1;
 841         ldap_pvt_thread_mutex_lock( &sort_conns_mutex );
 842         /* Is there already a sort running on this conn? */
 843         sess_id = find_session_by_context( si->svi_max_percon, op->o_conn->c_conn_idx, vc ? vc->vc_context : NO_VC_CONTEXT, ps ? ps->ps_cookie : NO_PS_COOKIE );
 844         if ( sess_id >= 0 ) {
 845                 so = sort_conns[op->o_conn->c_conn_idx][sess_id];
 846                 /* Is it a continuation of a VLV search? */
 847                 if ( !vc || so->so_vlv <= SLAP_CONTROL_IGNORED ||
 848                         vc->vc_context != so->so_vcontext ) {
 849                         /* Is it a continuation of a paged search? */
 850                         if ( !ps || so->so_paged <= SLAP_CONTROL_IGNORED ||
 851                                 op->o_conn->c_pagedresults_state.ps_cookie != ps->ps_cookie ) {
 852                                 ok = 0;
 853                         } else if ( !ps->ps_size ) {
 854                         /* Abandoning current request */
 855                                 ok = 0;
 856                                 so->so_nentries = 0;
 857                                 rs->sr_err = LDAP_SUCCESS;
 858                         }
 859                 }
 860                 if (( vc && so->so_paged > SLAP_CONTROL_IGNORED ) ||
 861                         ( ps && so->so_vlv > SLAP_CONTROL_IGNORED )) {
 862                         /* changed from paged to vlv or vice versa, abandon */
 863                         ok = 0;
 864                         so->so_nentries = 0;
 865                         rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
 866                 }
 867         /* Are there too many running overall? */
 868         } else if ( si->svi_num >= si->svi_max ) {
 869                 ok = 0;
 870         } else if ( ( sess_id = find_next_session(si->svi_max_percon, op->o_conn->c_conn_idx ) ) < 0 ) {
 871                 ok = 0;
 872         } else {
 873                 /* OK, this connection now has a sort running */
 874                 si->svi_num++;
 875                 sort_conns[op->o_conn->c_conn_idx][sess_id] = &so2;
 876                 sort_conns[op->o_conn->c_conn_idx][sess_id]->so_session = sess_id;
 877         }
 878         ldap_pvt_thread_mutex_unlock( &sort_conns_mutex );
 879         if ( ok ) {
 880                 /* If we're a global overlay, this check got bypassed */
 881                 if ( !op->ors_limit && limits_check( op, rs ))
 882                         return rs->sr_err;
 883                 /* are we continuing a VLV search? */
 884                 if ( so && vc && vc->vc_context ) {
 885                         so->so_ctrl = sc;
 886                         send_list( op, rs, so );
 887                         send_result( op, rs, so );
 888                         rc = LDAP_SUCCESS;
 889                 /* are we continuing a paged search? */
 890                 } else if ( so && ps && ps->ps_cookie ) {
 891                         so->so_ctrl = sc;
 892                         send_page( op, rs, so );
 893                         send_result( op, rs, so );
 894                         rc = LDAP_SUCCESS;
 895                 } else {
 896                         slap_callback *cb = op->o_tmpalloc( sizeof(slap_callback),
 897                                 op->o_tmpmemctx );
 898                         /* Install serversort response callback to handle a new search */
 899                         if ( ps || vc ) {
 900                                 so = ch_calloc( 1, sizeof(sort_op));
 901                         } else {
 902                                 so = op->o_tmpcalloc( 1, sizeof(sort_op), op->o_tmpmemctx );
 903                         }
 904                         sort_conns[op->o_conn->c_conn_idx][sess_id] = so;
 905
 906                         cb->sc_cleanup          = NULL;
 907                         cb->sc_response         = sssvlv_op_response;
 908                         cb->sc_next                     = op->o_callback;
 909                         cb->sc_private          = so;
 910
 911                         so->so_tree = NULL;
 912                         so->so_ctrl = sc;
 913                         so->so_info = si;
 914                         if ( ps ) {
 915                                 so->so_paged = op->o_pagedresults;
 916                                 so->so_page_size = ps->ps_size;
 917                                 op->o_pagedresults = SLAP_CONTROL_IGNORED;
 918                         } else {
 919                                 so->so_paged = 0;
 920                                 so->so_page_size = 0;
 921                                 if ( vc ) {
 922                                         so->so_vlv = op->o_ctrlflag[vlv_cid];
 923                                         so->so_vlv_target = 0;
 924                                         so->so_vlv_rc = 0;
 925                                 } else {
 926                                         so->so_vlv = SLAP_CONTROL_NONE;
 927                                 }
 928                         }
 929                         so->so_session = sess_id;
 930                         so->so_vlv = op->o_ctrlflag[vlv_cid];
 931                         so->so_vcontext = (unsigned long)so;
 932                         so->so_nentries = 0;
 933
 934                         op->o_callback          = cb;
 935                 }
 936         } else {
 937                 if ( so && !so->so_nentries ) {
 938                         free_sort_op( op->o_conn, so );
 939                 } else {
 940                         rs->sr_text = "Other sort requests already in progress";
 941                         rs->sr_err = LDAP_BUSY;
 942                 }
 943 leave:
 944                 rc = rs->sr_err;
 945                 send_ldap_result( op, rs );
 946         }
 947
 948         return rc;
 949 }
 950
 951 static int get_ordering_rule(
 952         AttributeDescription    *ad,
 953         struct berval                   *matchrule,
 954         SlapReply                               *rs,
 955         MatchingRule                    **ordering )
 956 {
 957         MatchingRule* mr;
 958
 959         if ( matchrule && matchrule->bv_val ) {
 960                 mr = mr_find( matchrule->bv_val );
 961                 if ( mr == NULL ) {
 962                         rs->sr_err = LDAP_INAPPROPRIATE_MATCHING;
 963                         rs->sr_text = "serverSort control: No ordering rule";
 964                         Debug(LDAP_DEBUG_TRACE, "%s: no ordering rule function for %s\n",
 965                                 debug_header, matchrule->bv_val, 0);
 966                 }
 967         }
 968         else {
 969                 mr = ad->ad_type->sat_ordering;
 970                 if ( mr == NULL ) {
 971                         rs->sr_err = LDAP_INAPPROPRIATE_MATCHING;
 972                         rs->sr_text = "serverSort control: No ordering rule";
 973                         Debug(LDAP_DEBUG_TRACE,
 974                                 "%s: no ordering rule specified and no default ordering rule for attribute %s\n",
 975                                 debug_header, ad->ad_cname.bv_val, 0);
 976                 }
 977         }
 978
 979         *ordering = mr;
 980         return rs->sr_err;
 981 }
 982
 983 static int count_key(BerElement *ber)
 984 {
 985         char *end;
 986         ber_len_t len;
 987         ber_tag_t tag;
 988         int count = 0;
 989
 990         /* Server Side Sort Control is a SEQUENCE of SEQUENCE */
 991         for ( tag = ber_first_element( ber, &len, &end );
 992                   tag == LBER_SEQUENCE;
 993                   tag = ber_next_element( ber, &len, end ))
 994         {
 995                 tag = ber_skip_tag( ber, &len );
 996                 ber_skip_data( ber, len );
 997                 ++count;
 998         }
 999         ber_rewind( ber );
1000
1001         return count;
1002 }
1003
1004 static int build_key(
1005         BerElement              *ber,
1006         SlapReply               *rs,
1007         sort_key                        *key )
1008 {
1009         struct berval attr;
1010         struct berval matchrule = BER_BVNULL;
1011         ber_int_t reverse = 0;
1012         ber_tag_t tag;
1013         ber_len_t len;
1014         MatchingRule *ordering = NULL;
1015         AttributeDescription *ad = NULL;
1016         const char *text;
1017
1018         if (( tag = ber_scanf( ber, "{" )) == LBER_ERROR ) {
1019                 rs->sr_text = "serverSort control: decoding error";
1020                 rs->sr_err = LDAP_PROTOCOL_ERROR;
1021                 return rs->sr_err;
1022         }
1023
1024         if (( tag = ber_scanf( ber, "m", &attr )) == LBER_ERROR ) {
1025                 rs->sr_text = "serverSort control: attribute decoding error";
1026                 rs->sr_err = LDAP_PROTOCOL_ERROR;
1027                 return rs->sr_err;
1028         }
1029
1030         tag = ber_peek_tag( ber, &len );
1031         if ( tag == LDAP_MATCHRULE_IDENTIFIER ) {
1032                 if (( tag = ber_scanf( ber, "m", &matchrule )) == LBER_ERROR ) {
1033                         rs->sr_text = "serverSort control: matchrule decoding error";
1034                         rs->sr_err = LDAP_PROTOCOL_ERROR;
1035                         return rs->sr_err;
1036                 }
1037                 tag = ber_peek_tag( ber, &len );
1038         }
1039
1040         if ( tag == LDAP_REVERSEORDER_IDENTIFIER ) {
1041                 if (( tag = ber_scanf( ber, "b", &reverse )) == LBER_ERROR ) {
1042                         rs->sr_text = "serverSort control: reverse decoding error";
1043                         rs->sr_err = LDAP_PROTOCOL_ERROR;
1044                         return rs->sr_err;
1045                 }
1046         }
1047
1048         if (( tag = ber_scanf( ber, "}" )) == LBER_ERROR ) {
1049                 rs->sr_text = "serverSort control: decoding error";
1050                 rs->sr_err = LDAP_PROTOCOL_ERROR;
1051                 return rs->sr_err;
1052         }
1053
1054         if ( slap_bv2ad( &attr, &ad, &text ) != LDAP_SUCCESS ) {
1055                 rs->sr_text =
1056                         "serverSort control: Unrecognized attribute type in sort key";
1057                 Debug(LDAP_DEBUG_TRACE,
1058                         "%s: Unrecognized attribute type in sort key: %s\n",
1059                         debug_header, SAFESTR(attr.bv_val, "<None>"), 0);
1060                 rs->sr_err = LDAP_NO_SUCH_ATTRIBUTE;
1061                 return rs->sr_err;
1062         }
1063
1064         /* get_ordering_rule will set sr_err and sr_text */
1065         get_ordering_rule( ad, &matchrule, rs, &ordering );
1066         if ( rs->sr_err != LDAP_SUCCESS ) {
1067                 return rs->sr_err;
1068         }
1069
1070         key->sk_ad = ad;
1071         key->sk_ordering = ordering;
1072         key->sk_direction = reverse ? -1 : 1;
1073
1074         return rs->sr_err;
1075 }
1076
1077 static int sss_parseCtrl(
1078         Operation               *op,
1079         SlapReply               *rs,
1080         LDAPControl             *ctrl )
1081 {
1082         BerElementBuffer        berbuf;
1083         BerElement                      *ber;
1084         ber_tag_t               tag;
1085         ber_len_t               len;
1086         int                                     i;
1087         sort_ctrl       *sc;
1088
1089         rs->sr_err = LDAP_PROTOCOL_ERROR;
1090
1091         if ( op->o_ctrlflag[sss_cid] > SLAP_CONTROL_IGNORED ) {
1092                 rs->sr_text = "sorted results control specified multiple times";
1093         } else if ( BER_BVISNULL( &ctrl->ldctl_value ) ) {
1094                 rs->sr_text = "sorted results control value is absent";
1095         } else if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
1096                 rs->sr_text = "sorted results control value is empty";
1097         } else {
1098                 rs->sr_err = LDAP_SUCCESS;
1099         }
1100         if ( rs->sr_err != LDAP_SUCCESS )
1101                 return rs->sr_err;
1102
1103         op->o_ctrlflag[sss_cid] = ctrl->ldctl_iscritical ?
1104                 SLAP_CONTROL_CRITICAL : SLAP_CONTROL_NONCRITICAL;
1105
1106         ber = (BerElement *)&berbuf;
1107         ber_init2( ber, &ctrl->ldctl_value, 0 );
1108         i = count_key( ber );
1109
1110         sc = op->o_tmpalloc( sizeof(sort_ctrl) +
1111                 (i-1) * sizeof(sort_key), op->o_tmpmemctx );
1112         sc->sc_nkeys = i;
1113         op->o_controls[sss_cid] = sc;
1114
1115         /* peel off initial sequence */
1116         ber_scanf( ber, "{" );
1117
1118         i = 0;
1119         do {
1120                 if ( build_key( ber, rs, &sc->sc_keys[i] ) != LDAP_SUCCESS )
1121                         break;
1122                 i++;
1123                 tag = ber_peek_tag( ber, &len );
1124         } while ( tag != LBER_DEFAULT );
1125
1126         return rs->sr_err;
1127 }
1128
1129 static int vlv_parseCtrl(
1130         Operation               *op,
1131         SlapReply               *rs,
1132         LDAPControl             *ctrl )
1133 {
1134         BerElementBuffer        berbuf;
1135         BerElement                      *ber;
1136         ber_tag_t               tag;
1137         ber_len_t               len;
1138         vlv_ctrl        *vc, vc2;
1139
1140         rs->sr_err = LDAP_PROTOCOL_ERROR;
1141         rs->sr_text = NULL;
1142
1143         if ( op->o_ctrlflag[vlv_cid] > SLAP_CONTROL_IGNORED ) {
1144                 rs->sr_text = "vlv control specified multiple times";
1145         } else if ( BER_BVISNULL( &ctrl->ldctl_value ) ) {
1146                 rs->sr_text = "vlv control value is absent";
1147         } else if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
1148                 rs->sr_text = "vlv control value is empty";
1149         }
1150         if ( rs->sr_text != NULL )
1151                 return rs->sr_err;
1152
1153         op->o_ctrlflag[vlv_cid] = ctrl->ldctl_iscritical ?
1154                 SLAP_CONTROL_CRITICAL : SLAP_CONTROL_NONCRITICAL;
1155
1156         ber = (BerElement *)&berbuf;
1157         ber_init2( ber, &ctrl->ldctl_value, 0 );
1158
1159         rs->sr_err = LDAP_PROTOCOL_ERROR;
1160
1161         tag = ber_scanf( ber, "{ii", &vc2.vc_before, &vc2.vc_after );
1162         if ( tag == LBER_ERROR ) {
1163                 return rs->sr_err;
1164         }
1165
1166         tag = ber_peek_tag( ber, &len );
1167         if ( tag == LDAP_VLVBYINDEX_IDENTIFIER ) {
1168                 tag = ber_scanf( ber, "{ii}", &vc2.vc_offset, &vc2.vc_count );
1169                 if ( tag == LBER_ERROR )
1170                         return rs->sr_err;
1171                 BER_BVZERO( &vc2.vc_value );
1172         } else if ( tag == LDAP_VLVBYVALUE_IDENTIFIER ) {
1173                 tag = ber_scanf( ber, "m", &vc2.vc_value );
1174                 if ( tag == LBER_ERROR || BER_BVISNULL( &vc2.vc_value ))
1175                         return rs->sr_err;
1176         } else {
1177                 return rs->sr_err;
1178         }
1179         tag = ber_peek_tag( ber, &len );
1180         if ( tag == LDAP_VLVCONTEXT_IDENTIFIER ) {
1181                 struct berval bv;
1182                 tag = ber_scanf( ber, "m", &bv );
1183                 if ( tag == LBER_ERROR || bv.bv_len != sizeof(vc2.vc_context))
1184                         return rs->sr_err;
1185                 AC_MEMCPY( &vc2.vc_context, bv.bv_val, bv.bv_len );
1186         } else {
1187                 vc2.vc_context = 0;
1188         }
1189
1190         vc = op->o_tmpalloc( sizeof(vlv_ctrl), op->o_tmpmemctx );
1191         *vc = vc2;
1192         op->o_controls[vlv_cid] = vc;
1193         rs->sr_err = LDAP_SUCCESS;
1194
1195         return rs->sr_err;
1196 }
1197
1198 static int sssvlv_connection_destroy( BackendDB *be, Connection *conn )
1199 {
1200         slap_overinst   *on             = (slap_overinst *)be->bd_info;
1201         sssvlv_info *si = on->on_bi.bi_private;
1202
1203         if ( sort_conns[conn->c_conn_idx] ) {
1204                 free_sort_ops( conn, sort_conns[conn->c_conn_idx], si->svi_max_percon );
1205         }
1206
1207         return LDAP_SUCCESS;
1208 }
1209
1210 static int sssvlv_db_open(
1211         BackendDB               *be,
1212         ConfigReply             *cr )
1213 {
1214         slap_overinst   *on = (slap_overinst *)be->bd_info;
1215         sssvlv_info *si = on->on_bi.bi_private;
1216         int rc;
1217         int conn_index;
1218
1219         /* If not set, default to 1/2 of available threads */
1220         if ( !si->svi_max )
1221                 si->svi_max = connection_pool_max / 2;
1222
1223         if ( dtblsize && !sort_conns ) {
1224                 ldap_pvt_thread_mutex_init( &sort_conns_mutex );
1225                 /* accommodate for c_conn_idx == -1 */
1226                 sort_conns = ch_calloc( dtblsize + 1, sizeof(sort_op **) );
1227                 for ( conn_index = 0 ; conn_index < dtblsize + 1 ; conn_index++ ) {
1228                         sort_conns[conn_index] = ch_calloc( si->svi_max_percon, sizeof(sort_op *) );
1229                 }
1230                 sort_conns++;
1231         }
1232
1233         rc = overlay_register_control( be, LDAP_CONTROL_SORTREQUEST );
1234         if ( rc == LDAP_SUCCESS )
1235                 rc = overlay_register_control( be, LDAP_CONTROL_VLVREQUEST );
1236         return rc;
1237 }
1238
1239 static ConfigTable sssvlv_cfg[] = {
1240         { "sssvlv-max", "num",
1241                 2, 2, 0, ARG_INT|ARG_OFFSET,
1242                         (void *)offsetof(sssvlv_info, svi_max),
1243                 "( OLcfgOvAt:21.1 NAME 'olcSssVlvMax' "
1244                         "DESC 'Maximum number of concurrent Sort requests' "
1245                         "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
1246         { "sssvlv-maxkeys", "num",
1247                 2, 2, 0, ARG_INT|ARG_OFFSET,
1248                         (void *)offsetof(sssvlv_info, svi_max_keys),
1249                 "( OLcfgOvAt:21.2 NAME 'olcSssVlvMaxKeys' "
1250                         "DESC 'Maximum number of Keys in a Sort request' "
1251                         "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
1252         { "sssvlv-maxpercon", "num",
1253                 2, 2, 0, ARG_INT|ARG_OFFSET,
1254                         (void *)offsetof(sssvlv_info, svi_max_percon),
1255                 "( OLcfgOvAt:21.3 NAME 'olcSssVlvMaxPerConn' "
1256                         "DESC 'Maximum number of concurrent paged search requests per connection' "
1257                         "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
1258         { NULL, NULL, 0, 0, 0, ARG_IGNORED }
1259 };
1260
1261 static ConfigOCs sssvlv_ocs[] = {
1262         { "( OLcfgOvOc:21.1 "
1263                 "NAME 'olcSssVlvConfig' "
1264                 "DESC 'SSS VLV configuration' "
1265                 "SUP olcOverlayConfig "
1266                 "MAY ( olcSssVlvMax $ olcSssVlvMaxKeys ) )",
1267                 Cft_Overlay, sssvlv_cfg, NULL, NULL },
1268         { NULL, 0, NULL }
1269 };
1270
1271 static int sssvlv_db_init(
1272         BackendDB               *be,
1273         ConfigReply             *cr)
1274 {
1275         slap_overinst   *on = (slap_overinst *)be->bd_info;
1276         sssvlv_info *si;
1277
1278         if ( ov_count == 0 ) {
1279                 int rc;
1280
1281                 rc = register_supported_control2( LDAP_CONTROL_SORTREQUEST,
1282                         SLAP_CTRL_SEARCH,
1283                         NULL,
1284                         sss_parseCtrl,
1285                         1 /* replace */,
1286                         &sss_cid );
1287                 if ( rc != LDAP_SUCCESS ) {
1288                         Debug( LDAP_DEBUG_ANY, "Failed to register Sort Request control '%s' (%d)\n",
1289                                 LDAP_CONTROL_SORTREQUEST, rc, 0 );
1290                         return rc;
1291                 }
1292
1293                 rc = register_supported_control2( LDAP_CONTROL_VLVREQUEST,
1294                         SLAP_CTRL_SEARCH,
1295                         NULL,
1296                         vlv_parseCtrl,
1297                         1 /* replace */,
1298                         &vlv_cid );
1299                 if ( rc != LDAP_SUCCESS ) {
1300                         Debug( LDAP_DEBUG_ANY, "Failed to register VLV Request control '%s' (%d)\n",
1301                                 LDAP_CONTROL_VLVREQUEST, rc, 0 );
1302 #ifdef SLAP_CONFIG_DELETE
1303                         overlay_unregister_control( be, LDAP_CONTROL_SORTREQUEST );
1304                         unregister_supported_control( LDAP_CONTROL_SORTREQUEST );
1305 #endif /* SLAP_CONFIG_DELETE */
1306                         return rc;
1307                 }
1308         }
1309
1310         si = (sssvlv_info *)ch_malloc(sizeof(sssvlv_info));
1311         on->on_bi.bi_private = si;
1312
1313         si->svi_max = 0;
1314         si->svi_num = 0;
1315         si->svi_max_keys = SSSVLV_DEFAULT_MAX_KEYS;
1316         si->svi_max_percon = SSSVLV_DEFAULT_MAX_REQUEST_PER_CONN;
1317
1318         ov_count++;
1319
1320         return LDAP_SUCCESS;
1321 }
1322
1323 static int sssvlv_db_destroy(
1324         BackendDB               *be,
1325         ConfigReply             *cr )
1326 {
1327         slap_overinst   *on = (slap_overinst *)be->bd_info;
1328         sssvlv_info *si = (sssvlv_info *)on->on_bi.bi_private;
1329         int conn_index;
1330
1331         ov_count--;
1332         if ( !ov_count && sort_conns) {
1333                 sort_conns--;
1334                 for ( conn_index = 0 ; conn_index < dtblsize + 1 ; conn_index++ ) {
1335                         ch_free(sort_conns[conn_index]);
1336                 }
1337                 ch_free(sort_conns);
1338                 ldap_pvt_thread_mutex_destroy( &sort_conns_mutex );
1339         }
1340
1341 #ifdef SLAP_CONFIG_DELETE
1342         overlay_unregister_control( be, LDAP_CONTROL_SORTREQUEST );
1343         overlay_unregister_control( be, LDAP_CONTROL_VLVREQUEST );
1344         if ( ov_count == 0 ) {
1345                 unregister_supported_control( LDAP_CONTROL_SORTREQUEST );
1346                 unregister_supported_control( LDAP_CONTROL_VLVREQUEST );
1347         }
1348 #endif /* SLAP_CONFIG_DELETE */
1349
1350         if ( si ) {
1351                 ch_free( si );
1352                 on->on_bi.bi_private = NULL;
1353         }
1354         return LDAP_SUCCESS;
1355 }
1356
1357 static slap_overinst sssvlv;
1358
1359 int sssvlv_initialize()
1360 {
1361         int rc;
1362
1363         sssvlv.on_bi.bi_type                            = "sssvlv";
1364         sssvlv.on_bi.bi_db_init                         = sssvlv_db_init;
1365         sssvlv.on_bi.bi_db_destroy                      = sssvlv_db_destroy;
1366         sssvlv.on_bi.bi_db_open                         = sssvlv_db_open;
1367         sssvlv.on_bi.bi_connection_destroy      = sssvlv_connection_destroy;
1368         sssvlv.on_bi.bi_op_search                       = sssvlv_op_search;
1369
1370         sssvlv.on_bi.bi_cf_ocs = sssvlv_ocs;
1371
1372         rc = config_register_schema( sssvlv_cfg, sssvlv_ocs );
1373         if ( rc )
1374                 return rc;
1375
1376         rc = overlay_register( &sssvlv );
1377         if ( rc != LDAP_SUCCESS ) {
1378                 Debug( LDAP_DEBUG_ANY, "Failed to register server side sort overlay\n", 0, 0, 0 );
1379         }
1380
1381         return rc;
1382 }
1383
1384 #if SLAPD_OVER_SSSVLV == SLAPD_MOD_DYNAMIC
1385 int init_module( int argc, char *argv[])
1386 {
1387         return sssvlv_initialize();
1388 }
1389 #endif
1390
1391 #endif /* SLAPD_OVER_SSSVLV */