/* $OpenLDAP$ */ /* * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved. * COPYING RESTRICTIONS APPLY, see COPYRIGHT file */ /* Portions * Copyright (c) 1995 Regents of the University of Michigan. * All rights reserved. * * Redistribution and use in source and binary forms are permitted * provided that this notice is preserved and that due credit is given * to the University of Michigan at Ann Arbor. The name of the University * may not be used to endorse or promote products derived from this * software without specific prior written permission. This software * is provided ``as is'' without express or implied warranty. */ #include "portable.h" #include #include #include #include "ldap_pvt.h" #include "slap.h" int do_search( Connection *conn, /* where to send results */ Operation *op /* info about the op to which we're responding */ ) { int i; ber_int_t scope, deref, attrsonly; ber_int_t sizelimit, timelimit; struct berval base = { 0, NULL }; struct berval pbase = { 0, NULL }; struct berval nbase = { 0, NULL }; struct berval fstr = { 0, NULL }; Filter *filter = NULL; AttributeName an, *al = NULL, *alast, *anew; Backend *be; int rc; const char *text; int manageDSAit; #ifdef NEW_LOGGING LDAP_LOG(( "operation", LDAP_LEVEL_ENTRY, "do_search: conn %d\n", conn->c_connid )); #else Debug( LDAP_DEBUG_TRACE, "do_search\n", 0, 0, 0 ); #endif /* * Parse the search request. It looks like this: * * SearchRequest := [APPLICATION 3] SEQUENCE { * baseObject DistinguishedName, * scope ENUMERATED { * baseObject (0), * singleLevel (1), * wholeSubtree (2) * }, * derefAliases ENUMERATED { * neverDerefaliases (0), * derefInSearching (1), * derefFindingBaseObj (2), * alwaysDerefAliases (3) * }, * sizelimit INTEGER (0 .. 65535), * timelimit INTEGER (0 .. 65535), * attrsOnly BOOLEAN, * filter Filter, * attributes SEQUENCE OF AttributeType * } */ /* baseObject, scope, derefAliases, sizelimit, timelimit, attrsOnly */ if ( ber_scanf( op->o_ber, "{oiiiib" /*}*/, &base, &scope, &deref, &sizelimit, &timelimit, &attrsonly ) == LBER_ERROR ) { send_ldap_disconnect( conn, op, LDAP_PROTOCOL_ERROR, "decoding error" ); rc = SLAPD_DISCONNECT; goto return_results; } switch( scope ) { case LDAP_SCOPE_BASE: case LDAP_SCOPE_ONELEVEL: case LDAP_SCOPE_SUBTREE: break; default: send_ldap_result( conn, op, rc = LDAP_PROTOCOL_ERROR, NULL, "invalid scope", NULL, NULL ); goto return_results; } switch( deref ) { case LDAP_DEREF_NEVER: case LDAP_DEREF_FINDING: case LDAP_DEREF_SEARCHING: case LDAP_DEREF_ALWAYS: break; default: send_ldap_result( conn, op, rc = LDAP_PROTOCOL_ERROR, NULL, "invalid deref", NULL, NULL ); goto return_results; } rc = dnPrettyNormal( NULL, &base, &pbase, &nbase ); if( rc != LDAP_SUCCESS ) { #ifdef NEW_LOGGING LDAP_LOG(( "operation", LDAP_LEVEL_INFO, "do_search: conn %d invalid dn (%s)\n", conn->c_connid, base.bv_val )); #else Debug( LDAP_DEBUG_ANY, "do_search: invalid dn (%s)\n", base.bv_val, 0, 0 ); #endif send_ldap_result( conn, op, rc = LDAP_INVALID_DN_SYNTAX, NULL, "invalid DN", NULL, NULL ); goto return_results; } #ifdef NEW_LOGGING LDAP_LOG(( "operation", LDAP_LEVEL_ARGS, "do_search \"%s\" %d %d %d %d %d\n", base.bv_val, scope, deref, sizelimit, timelimit, attrsonly )); #else Debug( LDAP_DEBUG_ARGS, "SRCH \"%s\" %d %d", base.bv_val, scope, deref ); Debug( LDAP_DEBUG_ARGS, " %d %d %d\n", sizelimit, timelimit, attrsonly); #endif /* filter - returns a "normalized" version */ rc = get_filter( conn, op->o_ber, &filter, &fstr, &text ); if( rc != LDAP_SUCCESS ) { if( rc == SLAPD_DISCONNECT ) { send_ldap_disconnect( conn, op, LDAP_PROTOCOL_ERROR, text ); } else { send_ldap_result( conn, op, rc, NULL, text, NULL, NULL ); } goto return_results; } #ifdef NEW_LOGGING LDAP_LOG(( "operation", LDAP_LEVEL_ARGS, "do_search: conn %d filter: %s\n", conn->c_connid, fstr.bv_val )); #else Debug( LDAP_DEBUG_ARGS, " filter: %s\n", fstr.bv_val, 0, 0 ); #endif /* attributes */ if ( ber_scanf( op->o_ber, "{" /*}*/ ) == LBER_ERROR ) { send_ldap_disconnect( conn, op, LDAP_PROTOCOL_ERROR, "decoding attrs error" ); rc = SLAPD_DISCONNECT; goto return_results; } while ( ber_scanf( op->o_ber, "o", &an.an_name ) != LBER_ERROR) { anew = ch_malloc(sizeof(AttributeName)); anew->an_next = NULL; anew->an_name = an.an_name; anew->an_desc = NULL; slap_bv2ad( &anew->an_name, &anew->an_desc, &text ); if (!al) { al = anew; } else { alast->an_next = anew; } alast = anew; } if ( ber_scanf( op->o_ber, /*{{*/ "}}" ) == LBER_ERROR ) { send_ldap_disconnect( conn, op, LDAP_PROTOCOL_ERROR, "decoding attrs error" ); rc = SLAPD_DISCONNECT; goto return_results; } if( (rc = get_ctrls( conn, op, 1 )) != LDAP_SUCCESS ) { #ifdef NEW_LOGGING LDAP_LOG(( "operation", LDAP_LEVEL_INFO, "do_search: conn %d get_ctrls failed (%d)\n", conn->c_connid, rc )); #else Debug( LDAP_DEBUG_ANY, "do_search: get_ctrls failed\n", 0, 0, 0 ); #endif goto return_results; } rc = LDAP_SUCCESS; #ifdef NEW_LOGGING LDAP_LOG(( "operation", LDAP_LEVEL_ARGS, "do_search: conn %d attrs:", conn->c_connid )); #else Debug( LDAP_DEBUG_ARGS, " attrs:", 0, 0, 0 ); #endif if ( al != NULL ) { for ( anew = al; anew; anew=anew->an_next ) { #ifdef NEW_LOGGING LDAP_LOG(( "operation", LDAP_LEVEL_ARGS, "do_search: %s", anew->an_name.bv_val )); #else Debug( LDAP_DEBUG_ARGS, " %s", anew->an_name.bv_val, 0, 0 ); #endif } } #ifdef NEW_LOGGING LDAP_LOG(( "operation", LDAP_LEVEL_ARGS, "\n" )); #else Debug( LDAP_DEBUG_ARGS, "\n", 0, 0, 0 ); #endif Statslog( LDAP_DEBUG_STATS, "conn=%ld op=%d SRCH base=\"%s\" scope=%d filter=\"%s\"\n", op->o_connid, op->o_opid, pbase.bv_val, scope, fstr.bv_val ); manageDSAit = get_manageDSAit( op ); if ( scope == LDAP_SCOPE_BASE ) { Entry *entry = NULL; if ( strcasecmp( nbase.bv_val, LDAP_ROOT_DSE ) == 0 ) { #ifdef LDAP_CONNECTIONLESS /* Ignore LDAPv2 CLDAP DSE queries */ if (op->o_protocol==LDAP_VERSION2 && conn->c_is_udp) { goto return_results; } #endif /* check restrictions */ rc = backend_check_restrictions( NULL, conn, op, NULL, &text ) ; if( rc != LDAP_SUCCESS ) { send_ldap_result( conn, op, rc, NULL, text, NULL, NULL ); goto return_results; } rc = root_dse_info( conn, &entry, &text ); } #if defined( SLAPD_SCHEMA_DN ) else if ( strcasecmp( nbase.bv_val, SLAPD_SCHEMA_DN ) == 0 ) { /* check restrictions */ rc = backend_check_restrictions( NULL, conn, op, NULL, &text ) ; if( rc != LDAP_SUCCESS ) { send_ldap_result( conn, op, rc, NULL, text, NULL, NULL ); goto return_results; } rc = schema_info( &entry, &text ); } #endif if( rc != LDAP_SUCCESS ) { send_ldap_result( conn, op, rc, NULL, text, NULL, NULL ); goto return_results; } else if ( entry != NULL ) { rc = test_filter( NULL, conn, op, entry, filter ); if( rc == LDAP_COMPARE_TRUE ) { send_search_entry( NULL, conn, op, entry, al, attrsonly, NULL ); } entry_free( entry ); send_ldap_result( conn, op, LDAP_SUCCESS, NULL, NULL, NULL, NULL ); goto return_results; } } if( !nbase.bv_len && default_search_nbase.bv_len ) { ch_free( pbase.bv_val ); ch_free( nbase.bv_val ); ber_dupbv( &pbase, &default_search_base ); ber_dupbv( &nbase, &default_search_nbase ); } /* * We could be serving multiple database backends. Select the * appropriate one, or send a referral to our "referral server" * if we don't hold it. */ if ( (be = select_backend( &nbase, manageDSAit, 1 )) == NULL ) { struct berval **ref = referral_rewrite( default_referral, NULL, &pbase, scope ); send_ldap_result( conn, op, rc = LDAP_REFERRAL, NULL, NULL, ref ? ref : default_referral, NULL ); ber_bvecfree( ref ); goto return_results; } /* check restrictions */ rc = backend_check_restrictions( be, conn, op, NULL, &text ) ; if( rc != LDAP_SUCCESS ) { send_ldap_result( conn, op, rc, NULL, text, NULL, NULL ); goto return_results; } /* check for referrals */ rc = backend_check_referrals( be, conn, op, &pbase, &nbase ); if ( rc != LDAP_SUCCESS ) { goto return_results; } /* deref the base if needed */ suffix_alias( be, &nbase ); /* actually do the search and send the result(s) */ if ( be->be_search ) { (*be->be_search)( be, conn, op, &pbase, &nbase, scope, deref, sizelimit, timelimit, filter, fstr.bv_val, al, attrsonly ); } else { send_ldap_result( conn, op, rc = LDAP_UNWILLING_TO_PERFORM, NULL, "operation not supported within namingContext", NULL, NULL ); } return_results:; free( base.bv_val ); if( pbase.bv_val != NULL) free( pbase.bv_val ); if( nbase.bv_val != NULL) free( nbase.bv_val ); if( fstr.bv_val != NULL) free( fstr.bv_val ); if( filter != NULL) filter_free( filter ); for (; al; al=anew ) { anew = al->an_next; free(al->an_name.bv_val); free(al); } return rc; }