1 /* index.c - routines for dealing with attribute indexes */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2011 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
21 #include <ac/string.h>
22 #include <ac/socket.h>
26 #include "lutil_hash.h"
28 static char presence_keyval[] = {0,0};
29 static struct berval presence_key[2] = {BER_BVC(presence_keyval), BER_BVNULL};
31 AttrInfo *mdb_index_mask(
33 AttributeDescription *desc,
34 struct berval *atname )
37 AttrInfo *ai = mdb_attr_mask( be->be_private, desc );
40 *atname = desc->ad_cname;
44 /* If there is a tagging option, did we ever index the base
45 * type? If so, check for mask, otherwise it's not there.
47 if( slap_ad_is_tagged( desc ) && desc != desc->ad_type->sat_ad ) {
48 /* has tagging option */
49 ai = mdb_attr_mask( be->be_private, desc->ad_type->sat_ad );
51 if ( ai && !( ai->ai_indexmask & SLAP_INDEX_NOTAGS ) ) {
52 *atname = desc->ad_type->sat_cname;
57 /* see if supertype defined mask for its subtypes */
58 for( at = desc->ad_type; at != NULL ; at = at->sat_sup ) {
59 /* If no AD, we've never indexed this type */
60 if ( !at->sat_ad ) continue;
62 ai = mdb_attr_mask( be->be_private, at->sat_ad );
64 if ( ai && !( ai->ai_indexmask & SLAP_INDEX_NOSUBTYPES ) ) {
65 *atname = at->sat_cname;
73 /* This function is only called when evaluating search filters.
77 AttributeDescription *desc,
81 struct berval *prefixp )
84 slap_mask_t mask, type = 0;
86 ai = mdb_index_mask( be, desc, prefixp );
89 #ifdef MDB_MONITOR_IDX
91 case LDAP_FILTER_PRESENT:
92 type = SLAP_INDEX_PRESENT;
94 case LDAP_FILTER_APPROX:
95 type = SLAP_INDEX_APPROX;
97 case LDAP_FILTER_EQUALITY:
98 type = SLAP_INDEX_EQUALITY;
100 case LDAP_FILTER_SUBSTRINGS:
101 type = SLAP_INDEX_SUBSTR;
104 return LDAP_INAPPROPRIATE_MATCHING;
106 mdb_monitor_idx_add( be->be_private, desc, type );
107 #endif /* MDB_MONITOR_IDX */
109 return LDAP_INAPPROPRIATE_MATCHING;
111 mask = ai->ai_indexmask;
114 case LDAP_FILTER_PRESENT:
115 type = SLAP_INDEX_PRESENT;
116 if( IS_SLAP_INDEX( mask, SLAP_INDEX_PRESENT ) ) {
117 *prefixp = presence_key[0];
122 case LDAP_FILTER_APPROX:
123 type = SLAP_INDEX_APPROX;
124 if ( desc->ad_type->sat_approx ) {
125 if( IS_SLAP_INDEX( mask, SLAP_INDEX_APPROX ) ) {
131 /* Use EQUALITY rule and index for approximate match */
134 case LDAP_FILTER_EQUALITY:
135 type = SLAP_INDEX_EQUALITY;
136 if( IS_SLAP_INDEX( mask, SLAP_INDEX_EQUALITY ) ) {
141 case LDAP_FILTER_SUBSTRINGS:
142 type = SLAP_INDEX_SUBSTR;
143 if( IS_SLAP_INDEX( mask, SLAP_INDEX_SUBSTR ) ) {
152 #ifdef MDB_MONITOR_IDX
153 mdb_monitor_idx_add( be->be_private, desc, type );
154 #endif /* MDB_MONITOR_IDX */
156 return LDAP_INAPPROPRIATE_MATCHING;
168 AttributeDescription *ad,
169 struct berval *atname,
178 mdb_idl_keyfunc *keyfunc;
184 rc = mdb_cursor_open( txn, dbi, &mc );
187 if ( opid == SLAP_INDEX_ADD_OP ) {
188 if ( slapMode & SLAP_TOOL_QUICK )
189 keyfunc = mdb_tool_idl_add;
191 keyfunc = mdb_idl_insert_keys;
193 keyfunc = mdb_idl_delete_keys;
195 if( IS_SLAP_INDEX( mask, SLAP_INDEX_PRESENT ) ) {
196 rc = keyfunc( mc, presence_key, id );
203 if( IS_SLAP_INDEX( mask, SLAP_INDEX_EQUALITY ) ) {
204 rc = ad->ad_type->sat_equality->smr_indexer(
205 LDAP_FILTER_EQUALITY,
207 ad->ad_type->sat_syntax,
208 ad->ad_type->sat_equality,
209 atname, vals, &keys, op->o_tmpmemctx );
211 if( rc == LDAP_SUCCESS && keys != NULL ) {
212 rc = keyfunc( mc, keys, id );
213 ber_bvarray_free_x( keys, op->o_tmpmemctx );
222 if( IS_SLAP_INDEX( mask, SLAP_INDEX_APPROX ) ) {
223 rc = ad->ad_type->sat_approx->smr_indexer(
226 ad->ad_type->sat_syntax,
227 ad->ad_type->sat_approx,
228 atname, vals, &keys, op->o_tmpmemctx );
230 if( rc == LDAP_SUCCESS && keys != NULL ) {
231 rc = keyfunc( mc, keys, id );
232 ber_bvarray_free_x( keys, op->o_tmpmemctx );
242 if( IS_SLAP_INDEX( mask, SLAP_INDEX_SUBSTR ) ) {
243 rc = ad->ad_type->sat_substr->smr_indexer(
244 LDAP_FILTER_SUBSTRINGS,
246 ad->ad_type->sat_syntax,
247 ad->ad_type->sat_substr,
248 atname, vals, &keys, op->o_tmpmemctx );
250 if( rc == LDAP_SUCCESS && keys != NULL ) {
251 rc = keyfunc( mc, keys, id );
252 ber_bvarray_free_x( keys, op->o_tmpmemctx );
263 mdb_cursor_close( mc );
265 /* The callers all know how to deal with these results */
268 /* Anything else is bad news */
275 static int index_at_values(
278 AttributeDescription *ad,
286 slap_mask_t mask = 0;
290 if ( opid == MDB_INDEX_UPDATE_OP )
291 ixop = SLAP_INDEX_ADD_OP;
293 if( type->sat_sup ) {
295 rc = index_at_values( op, txn, NULL,
302 /* If this type has no AD, we've never used it before */
304 ai = mdb_attr_mask( op->o_bd->be_private, type->sat_ad );
306 #ifdef LDAP_COMP_MATCH
307 /* component indexing */
309 ComponentReference *cr;
310 for( cr = ai->ai_cr ; cr ; cr = cr->cr_next ) {
311 rc = indexer( op, txn, ai->ai_dbi, cr->cr_ad, &type->sat_cname,
312 cr->cr_nvals, id, ixop,
318 /* If we're updating the index, just set the new bits that aren't
319 * already in the old mask.
321 if ( opid == MDB_INDEX_UPDATE_OP )
322 mask = ai->ai_newmask & ~ai->ai_indexmask;
324 /* For regular updates, if there is a newmask use it. Otherwise
325 * just use the old mask.
327 mask = ai->ai_newmask ? ai->ai_newmask : ai->ai_indexmask;
329 rc = indexer( op, txn, ai->ai_dbi, ad, &type->sat_cname,
330 vals, id, ixop, mask );
338 AttributeDescription *desc;
340 desc = ad_find_tags( type, tags );
342 ai = mdb_attr_mask( op->o_bd->be_private, desc );
345 if ( opid == MDB_INDEX_UPDATE_OP )
346 mask = ai->ai_newmask & ~ai->ai_indexmask;
348 mask = ai->ai_newmask ? ai->ai_newmask : ai->ai_indexmask;
350 rc = indexer( op, txn, ai->ai_dbi, desc, &desc->ad_cname,
351 vals, id, ixop, mask );
364 int mdb_index_values(
367 AttributeDescription *desc,
374 /* Never index ID 0 */
378 rc = index_at_values( op, txn, desc,
379 desc->ad_type, &desc->ad_tags,
385 /* Get the list of which indices apply to this attr */
388 struct mdb_info *mdb,
397 if( type->sat_sup ) {
399 rc = mdb_index_recset( mdb, a, type->sat_sup, tags, ir );
402 /* If this type has no AD, we've never used it before */
404 slot = mdb_attr_slot( mdb, type->sat_ad, NULL );
406 ir[slot].ai = mdb->mi_attrs[slot];
407 al = ch_malloc( sizeof( AttrList ));
409 al->next = ir[slot].attrs;
414 AttributeDescription *desc;
416 desc = ad_find_tags( type, tags );
418 slot = mdb_attr_slot( mdb, desc, NULL );
420 ir[slot].ai = mdb->mi_attrs[slot];
421 al = ch_malloc( sizeof( AttrList ));
423 al->next = ir[slot].attrs;
431 /* Apply the indices for the recset */
432 int mdb_index_recrun(
434 struct mdb_info *mdb,
443 /* Never index ID 0 */
447 for (i=base; i<mdb->mi_nattrs; i+=slap_tool_thread_max) {
449 if ( !ir->ai ) continue;
450 while (( al = ir->attrs )) {
451 ir->attrs = al->next;
452 rc = indexer( op, NULL, ir->ai->ai_dbi, ir->ai->ai_desc,
453 &ir->ai->ai_desc->ad_type->sat_cname,
454 al->attr->a_nvals, id, SLAP_INDEX_ADD_OP,
455 ir->ai->ai_indexmask );
471 Attribute *ap = e->e_attrs;
472 #if 0 /* ifdef LDAP_COMP_MATCH */
473 ComponentReference *cr_list = NULL;
474 ComponentReference *cr = NULL, *dupped_cr = NULL;
476 ComponentSyntaxInfo* csi_attr;
481 struct berval value = {0};
484 /* Never index ID 0 */
488 Debug( LDAP_DEBUG_TRACE, "=> index_entry_%s( %ld, \"%s\" )\n",
489 opid == SLAP_INDEX_DELETE_OP ? "del" : "add",
490 (long) e->e_id, e->e_dn );
492 /* add each attribute to the indexes */
493 for ( ; ap != NULL; ap = ap->a_next ) {
494 #if 0 /* ifdef LDAP_COMP_MATCH */
496 /* see if attribute has components to be indexed */
497 ai = mdb_attr_mask( op->o_bd->be_private, ap->a_desc->ad_type->sat_ad );
500 if ( attr_converter && cr_list ) {
501 syn = ap->a_desc->ad_type->sat_syntax;
502 ap->a_comp_data = op->o_tmpalloc( sizeof( ComponentData ), op->o_tmpmemctx );
503 /* Memory chunk(nibble) pre-allocation for decoders */
504 mem_op = nibble_mem_allocator ( 1024*16, 1024*4 );
505 ap->a_comp_data->cd_mem_op = mem_op;
506 for( cr = cr_list ; cr ; cr = cr->cr_next ) {
507 /* count how many values in an attribute */
508 for( num_attr=0; ap->a_vals[num_attr].bv_val != NULL; num_attr++ );
510 cr->cr_nvals = (BerVarray)op->o_tmpalloc( sizeof( struct berval )*num_attr, op->o_tmpmemctx );
511 for( i=0; ap->a_vals[i].bv_val != NULL; i++ ) {
512 /* decoding attribute value */
513 decoded_comp = attr_converter ( ap, syn, &ap->a_vals[i] );
515 return LDAP_DECODING_ERROR;
516 /* extracting the referenced component */
517 dupped_cr = dup_comp_ref( op, cr );
518 csi_attr = ((ComponentSyntaxInfo*)decoded_comp)->csi_comp_desc->cd_extract_i( mem_op, dupped_cr, decoded_comp );
520 return LDAP_DECODING_ERROR;
521 cr->cr_asn_type_id = csi_attr->csi_comp_desc->cd_type_id;
522 cr->cr_ad = (AttributeDescription*)get_component_description ( cr->cr_asn_type_id );
524 return LDAP_INVALID_SYNTAX;
525 at = cr->cr_ad->ad_type;
526 /* encoding the value of component in GSER */
527 rc = component_encoder( mem_op, csi_attr, &value );
528 if ( rc != LDAP_SUCCESS )
529 return LDAP_ENCODING_ERROR;
530 /* Normalize the encoded component values */
531 if ( at->sat_equality && at->sat_equality->smr_normalize ) {
532 rc = at->sat_equality->smr_normalize (
533 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
534 at->sat_syntax, at->sat_equality,
535 &value, &cr->cr_nvals[i], op->o_tmpmemctx );
537 cr->cr_nvals[i] = value;
540 /* The end of BerVarray */
541 cr->cr_nvals[num_attr-1].bv_val = NULL;
542 cr->cr_nvals[num_attr-1].bv_len = 0;
544 op->o_tmpfree( ap->a_comp_data, op->o_tmpmemctx );
545 nibble_mem_free ( mem_op );
546 ap->a_comp_data = NULL;
549 rc = mdb_index_values( op, txn, ap->a_desc,
550 ap->a_nvals, e->e_id, opid );
552 if( rc != LDAP_SUCCESS ) {
553 Debug( LDAP_DEBUG_TRACE,
554 "<= index_entry_%s( %ld, \"%s\" ) failure\n",
555 opid == SLAP_INDEX_ADD_OP ? "add" : "del",
556 (long) e->e_id, e->e_dn );
561 Debug( LDAP_DEBUG_TRACE, "<= index_entry_%s( %ld, \"%s\" ) success\n",
562 opid == SLAP_INDEX_DELETE_OP ? "del" : "add",
563 (long) e->e_id, e->e_dn );