1/* $OpenLDAP$ */ 2/* This work is part of OpenLDAP Software <http://www.openldap.org/>. 3 * 4 * Copyright 1999-2011 The OpenLDAP Foundation. 5 * Portions Copyright 1999 John C. Quillan. 6 * Portions Copyright 2002 myinternet Limited. 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 file LICENSE in the 14 * top-level directory of the distribution or, alternatively, at 15 * <http://www.OpenLDAP.org/license.html>. 16 */ 17 18#include "perl_back.h" 19 20/********************************************************** 21 * 22 * Search 23 * 24 **********************************************************/ 25int 26perl_back_search( 27 Operation *op, 28 SlapReply *rs ) 29{ 30 PerlBackend *perl_back = (PerlBackend *)op->o_bd->be_private; 31 int count ; 32 AttributeName *an; 33 Entry *e; 34 char *buf; 35 int i; 36 37 PERL_SET_CONTEXT( PERL_INTERPRETER ); 38 ldap_pvt_thread_mutex_lock( &perl_interpreter_mutex ); 39 40 { 41 dSP; ENTER; SAVETMPS; 42 43 PUSHMARK(sp) ; 44 XPUSHs( perl_back->pb_obj_ref ); 45 XPUSHs(sv_2mortal(newSVpv( op->o_req_ndn.bv_val , 0))); 46 XPUSHs(sv_2mortal(newSViv( op->ors_scope ))); 47 XPUSHs(sv_2mortal(newSViv( op->ors_deref ))); 48 XPUSHs(sv_2mortal(newSViv( op->ors_slimit ))); 49 XPUSHs(sv_2mortal(newSViv( op->ors_tlimit ))); 50 XPUSHs(sv_2mortal(newSVpv( op->ors_filterstr.bv_val , 0))); 51 XPUSHs(sv_2mortal(newSViv( op->ors_attrsonly ))); 52 53 for ( an = op->ors_attrs; an && an->an_name.bv_val; an++ ) { 54 XPUSHs(sv_2mortal(newSVpv( an->an_name.bv_val , 0))); 55 } 56 PUTBACK; 57 58 count = call_method("search", G_ARRAY ); 59 60 SPAGAIN; 61 62 if (count < 1) { 63 croak("Big trouble in back_search\n") ; 64 } 65 66 if ( count > 1 ) { 67 68 for ( i = 1; i < count; i++ ) { 69 70 buf = POPp; 71 72 if ( (e = str2entry( buf )) == NULL ) { 73 Debug( LDAP_DEBUG_ANY, "str2entry(%s) failed\n", buf, 0, 0 ); 74 75 } else { 76 int send_entry; 77 78 if (perl_back->pb_filter_search_results) 79 send_entry = (test_filter( op, e, op->ors_filter ) == LDAP_COMPARE_TRUE); 80 else 81 send_entry = 1; 82 83 if (send_entry) { 84 rs->sr_entry = e; 85 rs->sr_attrs = op->ors_attrs; 86 rs->sr_flags = REP_ENTRY_MODIFIABLE; 87 rs->sr_err = LDAP_SUCCESS; 88 rs->sr_err = send_search_entry( op, rs ); 89 rs->sr_flags = 0; 90 rs->sr_attrs = NULL; 91 rs->sr_entry = NULL; 92 if ( rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ) { 93 goto done; 94 } 95 } 96 97 entry_free( e ); 98 } 99 } 100 } 101 102 /* 103 * We grab the return code last because the stack comes 104 * from perl in reverse order. 105 * 106 * ex perl: return ( 0, $res_1, $res_2 ); 107 * 108 * ex stack: <$res_2> <$res_1> <0> 109 */ 110 111 rs->sr_err = POPi; 112 113done:; 114 PUTBACK; FREETMPS; LEAVE; 115 } 116 117 ldap_pvt_thread_mutex_unlock( &perl_interpreter_mutex ); 118 119 send_ldap_result( op, rs ); 120 121 return 0; 122} 123