X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=clients%2Ftools%2Fldapdelete.c;h=359a5c541d4571889a914152ccb338e72b504e6a;hb=ab82ec5fb4bd05fb064571bd34f9eaffc7524fa5;hp=7614b50b50def2297ad46880671677745334795a;hpb=78f9fb45d41cd62fdfe9382c674d8fe680b4c17e;p=openldap diff --git a/clients/tools/ldapdelete.c b/clients/tools/ldapdelete.c index 7614b50b50..359a5c541d 100644 --- a/clients/tools/ldapdelete.c +++ b/clients/tools/ldapdelete.c @@ -1,8 +1,34 @@ /* ldapdelete.c - simple program to delete an entry using LDAP */ /* $OpenLDAP$ */ -/* - * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved. - * COPYING RESTRICTIONS APPLY, see COPYRIGHT file +/* This work is part of OpenLDAP Software . + * + * Copyright 1998-2009 The OpenLDAP Foundation. + * Portions Copyright 1998-2003 Kurt D. Zeilenga. + * All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted only as authorized by the OpenLDAP + * Public License. + * + * A copy of this license is available in the file LICENSE in the + * top-level directory of the distribution or, alternatively, at + * . + */ +/* Portions Copyright (c) 1992-1996 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. + */ +/* ACKNOWLEDGEMENTS: + * This work was originally developed by the University of Michigan + * (as part of U-MICH LDAP). Additional significant contributors + * include: + * Kurt D. Zeilenga */ #include "portable.h" @@ -13,6 +39,8 @@ #include #include #include +#include +#include #include #include "lutil.h" @@ -21,12 +49,9 @@ #include "common.h" -#define _OLV_APP "ldapdelete" -#define _OLV_STATIC -#include "ol_version.h" - static int prune = 0; +static int sizelimit = -1; static int dodelete LDAP_P(( @@ -35,37 +60,42 @@ static int dodelete LDAP_P(( static int deletechildren LDAP_P(( LDAP *ld, - const char *dn )); + const char *dn, + int subentries )); void usage( void ) { - fprintf( stderr, -"Delete entries from an LDAP server\n\n" -"usage: %s [options] [dn]...\n" -" dn: list of DNs to delete. If not given, it will be readed from stdin\n" -" or from the file specified with \"-f file\".\n" -"Delete Options:\n" -" -r delete recursively\n" - , prog ); + fprintf( stderr, _("Delete entries from an LDAP server\n\n")); + fprintf( stderr, _("usage: %s [options] [dn]...\n"), prog); + fprintf( stderr, _(" dn: list of DNs to delete. If not given, it will be readed from stdin\n")); + fprintf( stderr, _(" or from the file specified with \"-f file\".\n")); + fprintf( stderr, _("Delete Options:\n")); + fprintf( stderr, _(" -c continuous operation mode (do not stop on errors)\n")); + fprintf( stderr, _(" -f file read operations from `file'\n")); + fprintf( stderr, _(" -M enable Manage DSA IT control (-MM to make critical)\n")); + fprintf( stderr, _(" -P version protocol version (default: 3)\n")); + fprintf( stderr, _(" -r delete recursively\n")); tool_common_usage(); exit( EXIT_FAILURE ); } const char options[] = "r" - "cCd:D:e:f:h:H:IkKMnO:p:P:QR:U:vVw:WxX:y:Y:Z"; + "cd:D:e:f:h:H:IMnNO:o:p:P:QR:U:vVw:WxX:y:Y:z:Z"; int handle_private_option( int i ) { + int ival; + char *next; switch ( i ) { #if 0 int crit; char *control, *cvalue; - case 'E': /* delete controls */ + case 'E': /* delete extensions */ if( protocol == LDAP_VERSION2 ) { - fprintf( stderr, "%s: -E incompatible with LDAPv%d\n", + fprintf( stderr, _("%s: -E incompatible with LDAPv%d\n"), prog, protocol ); exit( EXIT_FAILURE ); } @@ -85,7 +115,7 @@ handle_private_option( int i ) if ( (cvalue = strchr( control, '=' )) != NULL ) { *cvalue++ = '\0'; } - fprintf( stderr, "Invalid delete control name: %s\n", control ); + fprintf( stderr, _("Invalid delete extension name: %s\n"), control ); usage(); #endif @@ -93,6 +123,29 @@ handle_private_option( int i ) prune = 1; break; + case 'z': /* size limit */ + if ( strcasecmp( optarg, "none" ) == 0 ) { + sizelimit = 0; + + } else if ( strcasecmp( optarg, "max" ) == 0 ) { + sizelimit = LDAP_MAXINT; + + } else { + ival = strtol( optarg, &next, 10 ); + if ( next == NULL || next[0] != '\0' ) { + fprintf( stderr, + _("Unable to parse size limit \"%s\"\n"), optarg ); + exit( EXIT_FAILURE ); + } + sizelimit = ival; + } + if( sizelimit < 0 || sizelimit > LDAP_MAXINT ) { + fprintf( stderr, _("%s: invalid sizelimit (%d) specified\n"), + prog, sizelimit ); + exit( EXIT_FAILURE ); + } + break; + default: return 0; } @@ -113,12 +166,11 @@ int main( int argc, char **argv ) { char buf[ 4096 ]; - FILE *fp; + FILE *fp = NULL; LDAP *ld; int rc, retval; - fp = NULL; - + tool_init( TOOL_DELETE ); prog = lutil_progname( "ldapdelete", argc, argv ); tool_args( argc, argv ); @@ -129,9 +181,9 @@ main( int argc, char **argv ) exit( EXIT_FAILURE ); } } else { - if ( optind >= argc ) { - fp = stdin; - } + if ( optind >= argc ) { + fp = stdin; + } } ld = tool_conn_setup( 0, &private_conn_setup ); @@ -139,21 +191,24 @@ main( int argc, char **argv ) if ( pw_file || want_bindpw ) { if ( pw_file ) { rc = lutil_get_filed_password( pw_file, &passwd ); - if( rc ) return EXIT_FAILURE; + if( rc ) { + if ( fp && fp != stdin ) + fclose( fp ); + return EXIT_FAILURE; + } } else { - passwd.bv_val = getpassphrase( "Enter LDAP Password: " ); + passwd.bv_val = getpassphrase( _("Enter LDAP Password: ") ); passwd.bv_len = passwd.bv_val ? strlen( passwd.bv_val ) : 0; } } tool_bind( ld ); - if ( authzid || manageDSAit || noop ) - tool_server_controls( ld, NULL, 0 ); + tool_server_controls( ld, NULL, 0 ); retval = rc = 0; - if ( fp == NULL ) { + if ( fp == NULL ) { for ( ; optind < argc; ++optind ) { rc = dodelete( ld, argv[ optind ] ); @@ -173,11 +228,13 @@ main( int argc, char **argv ) retval = rc; } } + if ( fp != stdin ) + fclose( fp ); } - ldap_unbind( ld ); - - return( retval ); + tool_unbind( ld ); + tool_destroy(); + return retval; } @@ -188,21 +245,26 @@ static int dodelete( int id; int rc, code; char *matcheddn = NULL, *text = NULL, **refs = NULL; + LDAPControl **ctrls = NULL; LDAPMessage *res; + int subentries = 0; if ( verbose ) { - printf( "%sdeleting entry \"%s\"\n", - (not ? "!" : ""), dn ); + printf( _("%sdeleting entry \"%s\"\n"), + (dont ? "!" : ""), dn ); } - if ( not ) { + if ( dont ) { return LDAP_SUCCESS; } /* If prune is on, remove a whole subtree. Delete the children of the * DN recursively, then the DN requested. */ - if ( prune ) deletechildren( ld, dn ); + if ( prune ) { +retry:; + deletechildren( ld, dn, subentries ); + } rc = ldap_delete_ext( ld, dn, NULL, NULL, &id ); if ( rc != LDAP_SUCCESS ) { @@ -211,41 +273,75 @@ static int dodelete( return rc; } - rc = ldap_result( ld, LDAP_RES_ANY, LDAP_MSG_ALL, NULL, &res ); - if ( rc < 0 ) { - ldap_perror( ld, "ldapdelete: ldap_result" ); - return rc; + for ( ; ; ) { + struct timeval tv; + + if ( tool_check_abandon( ld, id ) ) { + return LDAP_CANCELLED; + } + + tv.tv_sec = 0; + tv.tv_usec = 100000; + + rc = ldap_result( ld, LDAP_RES_ANY, LDAP_MSG_ALL, &tv, &res ); + if ( rc < 0 ) { + tool_perror( "ldap_result", rc, NULL, NULL, NULL, NULL ); + return rc; + } + + if ( rc != 0 ) { + break; + } } - rc = ldap_parse_result( ld, res, &code, &matcheddn, &text, &refs, NULL, 1 ); + rc = ldap_parse_result( ld, res, &code, &matcheddn, &text, &refs, &ctrls, 1 ); + + switch ( rc ) { + case LDAP_SUCCESS: + break; + + case LDAP_NOT_ALLOWED_ON_NONLEAF: + if ( prune && !subentries ) { + subentries = 1; + goto retry; + } + /* fallthru */ - if( rc != LDAP_SUCCESS ) { + default: fprintf( stderr, "%s: ldap_parse_result: %s (%d)\n", prog, ldap_err2string( rc ), rc ); return rc; } - if( verbose || code != LDAP_SUCCESS || - (matcheddn && *matcheddn) || (text && *text) || (refs && *refs) ) + if( code != LDAP_SUCCESS ) { + tool_perror( "ldap_delete", code, NULL, matcheddn, text, refs ); + } else if ( verbose && + ((matcheddn && *matcheddn) || (text && *text) || (refs && *refs) )) { - printf( "Delete Result: %s (%d)\n", ldap_err2string( code ), code ); + printf( _("Delete Result: %s (%d)\n"), + ldap_err2string( code ), code ); if( text && *text ) { - printf( "Additional info: %s\n", text ); + printf( _("Additional info: %s\n"), text ); } if( matcheddn && *matcheddn ) { - printf( "Matched DN: %s\n", matcheddn ); + printf( _("Matched DN: %s\n"), matcheddn ); } if( refs ) { int i; for( i=0; refs[i]; i++ ) { - printf("Referral: %s\n", refs[i] ); + printf(_("Referral: %s\n"), refs[i] ); } } } + if (ctrls) { + tool_print_ctrls( ld, ctrls ); + ldap_controls_free( ctrls ); + } + ber_memfree( text ); ber_memfree( matcheddn ); ber_memvfree( (void **) refs ); @@ -255,27 +351,58 @@ static int dodelete( /* * Delete all the children of an entry recursively until leaf nodes are reached. - * */ static int deletechildren( LDAP *ld, - const char *dn ) + const char *base, + int subentries ) { LDAPMessage *res, *e; int entries; - int rc; - static char *attrs[] = { "1.1", NULL }; + int rc = LDAP_SUCCESS, srch_rc; + static char *attrs[] = { LDAP_NO_ATTRS, NULL }; + LDAPControl c, *ctrls[2], **ctrlsp = NULL; + BerElement *ber = NULL; + + if ( verbose ) printf ( _("deleting children of: %s\n"), base ); + + if ( subentries ) { + /* + * Do a one level search at base for subentry children. + */ + + if ((ber = ber_alloc_t(LBER_USE_DER)) == NULL) { + return EXIT_FAILURE; + } + rc = ber_printf( ber, "b", 1 ); + if ( rc == -1 ) { + ber_free( ber, 1 ); + fprintf( stderr, _("Subentries control encoding error!\n")); + return EXIT_FAILURE; + } + if ( ber_flatten2( ber, &c.ldctl_value, 0 ) == -1 ) { + return EXIT_FAILURE; + } + c.ldctl_oid = LDAP_CONTROL_SUBENTRIES; + c.ldctl_iscritical = 1; + ctrls[0] = &c; + ctrls[1] = NULL; + ctrlsp = ctrls; + } - if ( verbose ) printf ( "deleting children of: %s\n", dn ); /* - * Do a one level search at dn for children. For each, delete its children. + * Do a one level search at base for children. For each, delete its children. */ - - rc = ldap_search_ext_s( ld, dn, LDAP_SCOPE_ONELEVEL, NULL, attrs, 1, - NULL, NULL, NULL, -1, &res ); - if ( rc != LDAP_SUCCESS ) { - ldap_perror( ld, "ldap_search" ); - return( rc ); +more:; + srch_rc = ldap_search_ext_s( ld, base, LDAP_SCOPE_ONELEVEL, NULL, attrs, 1, + ctrlsp, NULL, NULL, sizelimit, &res ); + switch ( srch_rc ) { + case LDAP_SUCCESS: + case LDAP_SIZELIMIT_EXCEEDED: + break; + default: + tool_perror( "ldap_search", srch_rc, NULL, NULL, NULL, NULL ); + return( srch_rc ); } entries = ldap_count_entries( ld, res ); @@ -289,33 +416,33 @@ static int deletechildren( char *dn = ldap_get_dn( ld, e ); if( dn == NULL ) { - ldap_perror( ld, "ldap_prune" ); - ldap_get_option( ld, LDAP_OPT_ERROR_NUMBER, &rc ); + ldap_get_option( ld, LDAP_OPT_RESULT_CODE, &rc ); + tool_perror( "ldap_prune", rc, NULL, NULL, NULL, NULL ); ber_memfree( dn ); return rc; } - rc = deletechildren( ld, dn ); - if ( rc == -1 ) { - ldap_perror( ld, "ldap_prune" ); + rc = deletechildren( ld, dn, 0 ); + if ( rc != LDAP_SUCCESS ) { + tool_perror( "ldap_prune", rc, NULL, NULL, NULL, NULL ); ber_memfree( dn ); return rc; } if ( verbose ) { - printf( "\tremoving %s\n", dn ); + printf( _("\tremoving %s\n"), dn ); } - rc = ldap_delete_s( ld, dn ); - if ( rc == -1 ) { - ldap_perror( ld, "ldap_delete" ); + rc = ldap_delete_ext_s( ld, dn, NULL, NULL ); + if ( rc != LDAP_SUCCESS ) { + tool_perror( "ldap_delete", rc, NULL, NULL, NULL, NULL ); ber_memfree( dn ); return rc; } if ( verbose ) { - printf( "\t%s removed\n", dn ); + printf( _("\t%s removed\n"), dn ); } ber_memfree( dn ); @@ -323,5 +450,10 @@ static int deletechildren( } ldap_msgfree( res ); + + if ( srch_rc == LDAP_SIZELIMIT_EXCEEDED ) { + goto more; + } + return rc; }