1 /* $NetBSD: ldapdelete.c,v 1.1.1.3 2010/12/12 15:18:11 adam Exp $ */ 2 3 /* ldapdelete.c - simple program to delete an entry using LDAP */ 4 /* OpenLDAP: pkg/ldap/clients/tools/ldapdelete.c,v 1.118.2.13 2010/04/15 22:16:50 quanah Exp */ 5 /* This work is part of OpenLDAP Software <http://www.openldap.org/>. 6 * 7 * Copyright 1998-2010 The OpenLDAP Foundation. 8 * Portions Copyright 1998-2003 Kurt D. Zeilenga. 9 * All rights reserved. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted only as authorized by the OpenLDAP 13 * Public License. 14 * 15 * A copy of this license is available in the file LICENSE in the 16 * top-level directory of the distribution or, alternatively, at 17 * <http://www.OpenLDAP.org/license.html>. 18 */ 19 /* Portions Copyright (c) 1992-1996 Regents of the University of Michigan. 20 * All rights reserved. 21 * 22 * Redistribution and use in source and binary forms are permitted 23 * provided that this notice is preserved and that due credit is given 24 * to the University of Michigan at Ann Arbor. The name of the 25 * University may not be used to endorse or promote products derived 26 * from this software without specific prior written permission. This 27 * software is provided ``as is'' without express or implied warranty. 28 */ 29 /* ACKNOWLEDGEMENTS: 30 * This work was originally developed by the University of Michigan 31 * (as part of U-MICH LDAP). Additional significant contributors 32 * include: 33 * Kurt D. Zeilenga 34 */ 35 36 #include "portable.h" 37 38 #include <stdio.h> 39 40 #include <ac/stdlib.h> 41 #include <ac/ctype.h> 42 #include <ac/string.h> 43 #include <ac/unistd.h> 44 #include <ac/socket.h> 45 #include <ac/time.h> 46 47 #include <ldap.h> 48 #include "lutil.h" 49 #include "lutil_ldap.h" 50 #include "ldap_defaults.h" 51 52 #include "common.h" 53 54 55 static int prune = 0; 56 static int sizelimit = -1; 57 58 59 static int dodelete LDAP_P(( 60 LDAP *ld, 61 const char *dn)); 62 63 static int deletechildren LDAP_P(( 64 LDAP *ld, 65 const char *dn, 66 int subentries )); 67 68 void 69 usage( void ) 70 { 71 fprintf( stderr, _("Delete entries from an LDAP server\n\n")); 72 fprintf( stderr, _("usage: %s [options] [dn]...\n"), prog); 73 fprintf( stderr, _(" dn: list of DNs to delete. If not given, it will be readed from stdin\n")); 74 fprintf( stderr, _(" or from the file specified with \"-f file\".\n")); 75 fprintf( stderr, _("Delete Options:\n")); 76 fprintf( stderr, _(" -c continuous operation mode (do not stop on errors)\n")); 77 fprintf( stderr, _(" -f file read operations from `file'\n")); 78 fprintf( stderr, _(" -M enable Manage DSA IT control (-MM to make critical)\n")); 79 fprintf( stderr, _(" -P version protocol version (default: 3)\n")); 80 fprintf( stderr, _(" -r delete recursively\n")); 81 tool_common_usage(); 82 exit( EXIT_FAILURE ); 83 } 84 85 86 const char options[] = "r" 87 "cd:D:e:f:h:H:IMnNO:o:p:P:QR:U:vVw:WxX:y:Y:z:Z"; 88 89 int 90 handle_private_option( int i ) 91 { 92 int ival; 93 char *next; 94 switch ( i ) { 95 #if 0 96 int crit; 97 char *control, *cvalue; 98 case 'E': /* delete extensions */ 99 if( protocol == LDAP_VERSION2 ) { 100 fprintf( stderr, _("%s: -E incompatible with LDAPv%d\n"), 101 prog, protocol ); 102 exit( EXIT_FAILURE ); 103 } 104 105 /* should be extended to support comma separated list of 106 * [!]key[=value] parameters, e.g. -E !foo,bar=567 107 */ 108 109 crit = 0; 110 cvalue = NULL; 111 if( optarg[0] == '!' ) { 112 crit = 1; 113 optarg++; 114 } 115 116 control = strdup( optarg ); 117 if ( (cvalue = strchr( control, '=' )) != NULL ) { 118 *cvalue++ = '\0'; 119 } 120 fprintf( stderr, _("Invalid delete extension name: %s\n"), control ); 121 usage(); 122 #endif 123 124 case 'r': 125 prune = 1; 126 break; 127 128 case 'z': /* size limit */ 129 if ( strcasecmp( optarg, "none" ) == 0 ) { 130 sizelimit = 0; 131 132 } else if ( strcasecmp( optarg, "max" ) == 0 ) { 133 sizelimit = LDAP_MAXINT; 134 135 } else { 136 ival = strtol( optarg, &next, 10 ); 137 if ( next == NULL || next[0] != '\0' ) { 138 fprintf( stderr, 139 _("Unable to parse size limit \"%s\"\n"), optarg ); 140 exit( EXIT_FAILURE ); 141 } 142 sizelimit = ival; 143 } 144 if( sizelimit < 0 || sizelimit > LDAP_MAXINT ) { 145 fprintf( stderr, _("%s: invalid sizelimit (%d) specified\n"), 146 prog, sizelimit ); 147 exit( EXIT_FAILURE ); 148 } 149 break; 150 151 default: 152 return 0; 153 } 154 return 1; 155 } 156 157 158 static void 159 private_conn_setup( LDAP *ld ) 160 { 161 /* this seems prudent for searches below */ 162 int deref = LDAP_DEREF_NEVER; 163 ldap_set_option( ld, LDAP_OPT_DEREF, &deref ); 164 } 165 166 167 int 168 main( int argc, char **argv ) 169 { 170 char buf[ 4096 ]; 171 FILE *fp = NULL; 172 LDAP *ld; 173 int rc, retval; 174 175 tool_init( TOOL_DELETE ); 176 prog = lutil_progname( "ldapdelete", argc, argv ); 177 178 tool_args( argc, argv ); 179 180 if ( infile != NULL ) { 181 if (( fp = fopen( infile, "r" )) == NULL ) { 182 perror( optarg ); 183 exit( EXIT_FAILURE ); 184 } 185 } else { 186 if ( optind >= argc ) { 187 fp = stdin; 188 } 189 } 190 191 ld = tool_conn_setup( 0, &private_conn_setup ); 192 193 tool_bind( ld ); 194 195 tool_server_controls( ld, NULL, 0 ); 196 197 retval = rc = 0; 198 199 if ( fp == NULL ) { 200 for ( ; optind < argc; ++optind ) { 201 rc = dodelete( ld, argv[ optind ] ); 202 203 /* Stop on error and no -c option */ 204 if( rc != 0 ) { 205 retval = rc; 206 if( contoper == 0 ) break; 207 } 208 } 209 } else { 210 while ((rc == 0 || contoper) && fgets(buf, sizeof(buf), fp) != NULL) { 211 buf[ strlen( buf ) - 1 ] = '\0'; /* remove trailing newline */ 212 213 if ( *buf != '\0' ) { 214 rc = dodelete( ld, buf ); 215 if ( rc != 0 ) 216 retval = rc; 217 } 218 } 219 if ( fp != stdin ) 220 fclose( fp ); 221 } 222 223 tool_unbind( ld ); 224 tool_destroy(); 225 return retval; 226 } 227 228 229 static int dodelete( 230 LDAP *ld, 231 const char *dn) 232 { 233 int id; 234 int rc, code; 235 char *matcheddn = NULL, *text = NULL, **refs = NULL; 236 LDAPControl **ctrls = NULL; 237 LDAPMessage *res; 238 int subentries = 0; 239 240 if ( verbose ) { 241 printf( _("%sdeleting entry \"%s\"\n"), 242 (dont ? "!" : ""), dn ); 243 } 244 245 if ( dont ) { 246 return LDAP_SUCCESS; 247 } 248 249 /* If prune is on, remove a whole subtree. Delete the children of the 250 * DN recursively, then the DN requested. 251 */ 252 if ( prune ) { 253 retry:; 254 deletechildren( ld, dn, subentries ); 255 } 256 257 rc = ldap_delete_ext( ld, dn, NULL, NULL, &id ); 258 if ( rc != LDAP_SUCCESS ) { 259 fprintf( stderr, "%s: ldap_delete_ext: %s (%d)\n", 260 prog, ldap_err2string( rc ), rc ); 261 return rc; 262 } 263 264 for ( ; ; ) { 265 struct timeval tv; 266 267 if ( tool_check_abandon( ld, id ) ) { 268 return LDAP_CANCELLED; 269 } 270 271 tv.tv_sec = 0; 272 tv.tv_usec = 100000; 273 274 rc = ldap_result( ld, LDAP_RES_ANY, LDAP_MSG_ALL, &tv, &res ); 275 if ( rc < 0 ) { 276 tool_perror( "ldap_result", rc, NULL, NULL, NULL, NULL ); 277 return rc; 278 } 279 280 if ( rc != 0 ) { 281 break; 282 } 283 } 284 285 rc = ldap_parse_result( ld, res, &code, &matcheddn, &text, &refs, &ctrls, 1 ); 286 287 switch ( rc ) { 288 case LDAP_SUCCESS: 289 break; 290 291 case LDAP_NOT_ALLOWED_ON_NONLEAF: 292 if ( prune && !subentries ) { 293 subentries = 1; 294 goto retry; 295 } 296 /* fallthru */ 297 298 default: 299 fprintf( stderr, "%s: ldap_parse_result: %s (%d)\n", 300 prog, ldap_err2string( rc ), rc ); 301 return rc; 302 } 303 304 if( code != LDAP_SUCCESS ) { 305 tool_perror( "ldap_delete", code, NULL, matcheddn, text, refs ); 306 } else if ( verbose && 307 ((matcheddn && *matcheddn) || (text && *text) || (refs && *refs) )) 308 { 309 printf( _("Delete Result: %s (%d)\n"), 310 ldap_err2string( code ), code ); 311 312 if( text && *text ) { 313 printf( _("Additional info: %s\n"), text ); 314 } 315 316 if( matcheddn && *matcheddn ) { 317 printf( _("Matched DN: %s\n"), matcheddn ); 318 } 319 320 if( refs ) { 321 int i; 322 for( i=0; refs[i]; i++ ) { 323 printf(_("Referral: %s\n"), refs[i] ); 324 } 325 } 326 } 327 328 if (ctrls) { 329 tool_print_ctrls( ld, ctrls ); 330 ldap_controls_free( ctrls ); 331 } 332 333 ber_memfree( text ); 334 ber_memfree( matcheddn ); 335 ber_memvfree( (void **) refs ); 336 337 return code; 338 } 339 340 /* 341 * Delete all the children of an entry recursively until leaf nodes are reached. 342 */ 343 static int deletechildren( 344 LDAP *ld, 345 const char *base, 346 int subentries ) 347 { 348 LDAPMessage *res, *e; 349 int entries; 350 int rc = LDAP_SUCCESS, srch_rc; 351 static char *attrs[] = { LDAP_NO_ATTRS, NULL }; 352 LDAPControl c, *ctrls[2], **ctrlsp = NULL; 353 BerElement *ber = NULL; 354 355 if ( verbose ) printf ( _("deleting children of: %s\n"), base ); 356 357 if ( subentries ) { 358 /* 359 * Do a one level search at base for subentry children. 360 */ 361 362 if ((ber = ber_alloc_t(LBER_USE_DER)) == NULL) { 363 return EXIT_FAILURE; 364 } 365 rc = ber_printf( ber, "b", 1 ); 366 if ( rc == -1 ) { 367 ber_free( ber, 1 ); 368 fprintf( stderr, _("Subentries control encoding error!\n")); 369 return EXIT_FAILURE; 370 } 371 if ( ber_flatten2( ber, &c.ldctl_value, 0 ) == -1 ) { 372 return EXIT_FAILURE; 373 } 374 c.ldctl_oid = LDAP_CONTROL_SUBENTRIES; 375 c.ldctl_iscritical = 1; 376 ctrls[0] = &c; 377 ctrls[1] = NULL; 378 ctrlsp = ctrls; 379 } 380 381 /* 382 * Do a one level search at base for children. For each, delete its children. 383 */ 384 more:; 385 srch_rc = ldap_search_ext_s( ld, base, LDAP_SCOPE_ONELEVEL, NULL, attrs, 1, 386 ctrlsp, NULL, NULL, sizelimit, &res ); 387 switch ( srch_rc ) { 388 case LDAP_SUCCESS: 389 case LDAP_SIZELIMIT_EXCEEDED: 390 break; 391 default: 392 tool_perror( "ldap_search", srch_rc, NULL, NULL, NULL, NULL ); 393 return( srch_rc ); 394 } 395 396 entries = ldap_count_entries( ld, res ); 397 398 if ( entries > 0 ) { 399 int i; 400 401 for (e = ldap_first_entry( ld, res ), i = 0; e != NULL; 402 e = ldap_next_entry( ld, e ), i++ ) 403 { 404 char *dn = ldap_get_dn( ld, e ); 405 406 if( dn == NULL ) { 407 ldap_get_option( ld, LDAP_OPT_RESULT_CODE, &rc ); 408 tool_perror( "ldap_prune", rc, NULL, NULL, NULL, NULL ); 409 ber_memfree( dn ); 410 return rc; 411 } 412 413 rc = deletechildren( ld, dn, 0 ); 414 if ( rc != LDAP_SUCCESS ) { 415 tool_perror( "ldap_prune", rc, NULL, NULL, NULL, NULL ); 416 ber_memfree( dn ); 417 return rc; 418 } 419 420 if ( verbose ) { 421 printf( _("\tremoving %s\n"), dn ); 422 } 423 424 rc = ldap_delete_ext_s( ld, dn, NULL, NULL ); 425 if ( rc != LDAP_SUCCESS ) { 426 tool_perror( "ldap_delete", rc, NULL, NULL, NULL, NULL ); 427 ber_memfree( dn ); 428 return rc; 429 430 } 431 432 if ( verbose ) { 433 printf( _("\t%s removed\n"), dn ); 434 } 435 436 ber_memfree( dn ); 437 } 438 } 439 440 ldap_msgfree( res ); 441 442 if ( srch_rc == LDAP_SIZELIMIT_EXCEEDED ) { 443 goto more; 444 } 445 446 return rc; 447 } 448