1/* $NetBSD$ */ 2 3/* search.c - shell backend search function */ 4/* OpenLDAP: pkg/ldap/servers/slapd/back-shell/search.c,v 1.29.2.5 2010/04/13 20:23:39 kurt Exp */ 5/* This work is part of OpenLDAP Software <http://www.openldap.org/>. 6 * 7 * Copyright 1998-2010 The OpenLDAP Foundation. 8 * All rights reserved. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted only as authorized by the OpenLDAP 12 * Public License. 13 * 14 * A copy of this license is available in the file LICENSE in the 15 * top-level directory of the distribution or, alternatively, at 16 * <http://www.OpenLDAP.org/license.html>. 17 */ 18/* Portions Copyright (c) 1995 Regents of the University of Michigan. 19 * All rights reserved. 20 * 21 * Redistribution and use in source and binary forms are permitted 22 * provided that this notice is preserved and that due credit is given 23 * to the University of Michigan at Ann Arbor. The name of the University 24 * may not be used to endorse or promote products derived from this 25 * software without specific prior written permission. This software 26 * is provided ``as is'' without express or implied warranty. 27 */ 28/* ACKNOWLEDGEMENTS: 29 * This work was originally developed by the University of Michigan 30 * (as part of U-MICH LDAP). 31 */ 32 33#include "portable.h" 34 35#include <stdio.h> 36 37#include <ac/socket.h> 38#include <ac/string.h> 39 40#include "slap.h" 41#include "shell.h" 42 43int 44shell_back_search( 45 Operation *op, 46 SlapReply *rs ) 47{ 48 struct shellinfo *si = (struct shellinfo *) op->o_bd->be_private; 49 FILE *rfp, *wfp; 50 AttributeName *an; 51 52 if ( si->si_search == NULL ) { 53 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM, 54 "search not implemented" ); 55 return( -1 ); 56 } 57 58 if ( forkandexec( si->si_search, &rfp, &wfp ) == (pid_t)-1 ) { 59 send_ldap_error( op, rs, LDAP_OTHER, 60 "could not fork/exec" ); 61 return( -1 ); 62 } 63 64 /* write out the request to the search process */ 65 fprintf( wfp, "SEARCH\n" ); 66 fprintf( wfp, "msgid: %ld\n", (long) op->o_msgid ); 67 print_suffixes( wfp, op->o_bd ); 68 fprintf( wfp, "base: %s\n", op->o_req_dn.bv_val ); 69 fprintf( wfp, "scope: %d\n", op->oq_search.rs_scope ); 70 fprintf( wfp, "deref: %d\n", op->oq_search.rs_deref ); 71 fprintf( wfp, "sizelimit: %d\n", op->oq_search.rs_slimit ); 72 fprintf( wfp, "timelimit: %d\n", op->oq_search.rs_tlimit ); 73 fprintf( wfp, "filter: %s\n", op->oq_search.rs_filterstr.bv_val ); 74 fprintf( wfp, "attrsonly: %d\n", op->oq_search.rs_attrsonly ? 1 : 0 ); 75 fprintf( wfp, "attrs:%s", op->oq_search.rs_attrs == NULL ? " all" : "" ); 76 for ( an = op->oq_search.rs_attrs; an && an->an_name.bv_val; an++ ) { 77 fprintf( wfp, " %s", an->an_name.bv_val ); 78 } 79 fprintf( wfp, "\n" ); 80 fclose( wfp ); 81 82 /* read in the results and send them along */ 83 rs->sr_attrs = op->oq_search.rs_attrs; 84 read_and_send_results( op, rs, rfp ); 85 86 fclose( rfp ); 87 return( 0 ); 88} 89