llvm-ar.cpp revision 3baf01bd95586875274f6f36cf9931c8ebff2c39
1//===-- llvm-ar.cpp - LLVM archive librarian utility ----------------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 10// Builds up (relatively) standard unix archive files (.a) containing LLVM 11// bitcode or other files. 12// 13//===----------------------------------------------------------------------===// 14 15#include "Archive.h" 16#include "llvm/IR/LLVMContext.h" 17#include "llvm/IR/Module.h" 18#include "llvm/Support/CommandLine.h" 19#include "llvm/Support/FileSystem.h" 20#include "llvm/Support/Format.h" 21#include "llvm/Support/ManagedStatic.h" 22#include "llvm/Support/PrettyStackTrace.h" 23#include "llvm/Support/Signals.h" 24#include "llvm/Support/raw_ostream.h" 25#include <algorithm> 26#include <cstdlib> 27#include <fstream> 28#include <memory> 29using namespace llvm; 30 31// Option for compatibility with AIX, not used but must allow it to be present. 32static cl::opt<bool> 33X32Option ("X32_64", cl::Hidden, 34 cl::desc("Ignored option for compatibility with AIX")); 35 36// llvm-ar operation code and modifier flags. This must come first. 37static cl::opt<std::string> 38Options(cl::Positional, cl::Required, cl::desc("{operation}[modifiers]...")); 39 40// llvm-ar remaining positional arguments. 41static cl::list<std::string> 42RestOfArgs(cl::Positional, cl::OneOrMore, 43 cl::desc("[relpos] [count] <archive-file> [members]...")); 44 45// MoreHelp - Provide additional help output explaining the operations and 46// modifiers of llvm-ar. This object instructs the CommandLine library 47// to print the text of the constructor when the --help option is given. 48static cl::extrahelp MoreHelp( 49 "\nOPERATIONS:\n" 50 " d[NsS] - delete file(s) from the archive\n" 51 " m[abiSs] - move file(s) in the archive\n" 52 " p[kN] - print file(s) found in the archive\n" 53 " q[ufsS] - quick append file(s) to the archive\n" 54 " r[abfiuRsS] - replace or insert file(s) into the archive\n" 55 " t - display contents of archive\n" 56 " x[No] - extract file(s) from the archive\n" 57 "\nMODIFIERS (operation specific):\n" 58 " [a] - put file(s) after [relpos]\n" 59 " [b] - put file(s) before [relpos] (same as [i])\n" 60 " [f] - truncate inserted file names\n" 61 " [i] - put file(s) before [relpos] (same as [b])\n" 62 " [k] - always print bitcode files (default is to skip them)\n" 63 " [N] - use instance [count] of name\n" 64 " [o] - preserve original dates\n" 65 " [P] - use full path names when matching\n" 66 " [R] - recurse through directories when inserting\n" 67 " [s] - create an archive index (cf. ranlib)\n" 68 " [S] - do not build a symbol table\n" 69 " [u] - update only files newer than archive contents\n" 70 "\nMODIFIERS (generic):\n" 71 " [c] - do not warn if the library had to be created\n" 72 " [v] - be verbose about actions taken\n" 73 " [V] - be *really* verbose about actions taken\n" 74); 75 76// This enumeration delineates the kinds of operations on an archive 77// that are permitted. 78enum ArchiveOperation { 79 NoOperation, ///< An operation hasn't been specified 80 Print, ///< Print the contents of the archive 81 Delete, ///< Delete the specified members 82 Move, ///< Move members to end or as given by {a,b,i} modifiers 83 QuickAppend, ///< Quickly append to end of archive 84 ReplaceOrInsert, ///< Replace or Insert members 85 DisplayTable, ///< Display the table of contents 86 Extract ///< Extract files back to file system 87}; 88 89// Modifiers to follow operation to vary behavior 90bool AddAfter = false; ///< 'a' modifier 91bool AddBefore = false; ///< 'b' modifier 92bool Create = false; ///< 'c' modifier 93bool TruncateNames = false; ///< 'f' modifier 94bool InsertBefore = false; ///< 'i' modifier 95bool DontSkipBitcode = false; ///< 'k' modifier 96bool UseCount = false; ///< 'N' modifier 97bool OriginalDates = false; ///< 'o' modifier 98bool FullPath = false; ///< 'P' modifier 99bool SymTable = true; ///< 's' & 'S' modifiers 100bool OnlyUpdate = false; ///< 'u' modifier 101bool Verbose = false; ///< 'v' modifier 102bool ReallyVerbose = false; ///< 'V' modifier 103 104// Relative Positional Argument (for insert/move). This variable holds 105// the name of the archive member to which the 'a', 'b' or 'i' modifier 106// refers. Only one of 'a', 'b' or 'i' can be specified so we only need 107// one variable. 108std::string RelPos; 109 110// Select which of multiple entries in the archive with the same name should be 111// used (specified with -N) for the delete and extract operations. 112int Count = 1; 113 114// This variable holds the name of the archive file as given on the 115// command line. 116std::string ArchiveName; 117 118// This variable holds the list of member files to proecess, as given 119// on the command line. 120std::vector<std::string> Members; 121 122// This variable holds the (possibly expanded) list of path objects that 123// correspond to files we will 124std::set<std::string> Paths; 125 126// The Archive object to which all the editing operations will be sent. 127Archive* TheArchive = 0; 128 129// The name this program was invoked as. 130static const char *program_name; 131 132// show_help - Show the error message, the help message and exit. 133LLVM_ATTRIBUTE_NORETURN static void 134show_help(const std::string &msg) { 135 errs() << program_name << ": " << msg << "\n\n"; 136 cl::PrintHelpMessage(); 137 if (TheArchive) 138 delete TheArchive; 139 std::exit(1); 140} 141 142// fail - Show the error message and exit. 143LLVM_ATTRIBUTE_NORETURN static void 144fail(const std::string &msg) { 145 errs() << program_name << ": " << msg << "\n\n"; 146 if (TheArchive) 147 delete TheArchive; 148 std::exit(1); 149} 150 151// getRelPos - Extract the member filename from the command line for 152// the [relpos] argument associated with a, b, and i modifiers 153void getRelPos() { 154 if(RestOfArgs.size() == 0) 155 show_help("Expected [relpos] for a, b, or i modifier"); 156 RelPos = RestOfArgs[0]; 157 RestOfArgs.erase(RestOfArgs.begin()); 158} 159 160// getCount - Extract the [count] argument associated with the N modifier 161// from the command line and check its value. 162void getCount() { 163 if(RestOfArgs.size() == 0) 164 show_help("Expected [count] value with N modifier"); 165 166 Count = atoi(RestOfArgs[0].c_str()); 167 RestOfArgs.erase(RestOfArgs.begin()); 168 169 // Non-positive counts are not allowed 170 if (Count < 1) 171 show_help("Invalid [count] value (not a positive integer)"); 172} 173 174// getArchive - Get the archive file name from the command line 175void getArchive() { 176 if(RestOfArgs.size() == 0) 177 show_help("An archive name must be specified"); 178 ArchiveName = RestOfArgs[0]; 179 RestOfArgs.erase(RestOfArgs.begin()); 180} 181 182// getMembers - Copy over remaining items in RestOfArgs to our Members vector 183// This is just for clarity. 184void getMembers() { 185 if(RestOfArgs.size() > 0) 186 Members = std::vector<std::string>(RestOfArgs); 187} 188 189// parseCommandLine - Parse the command line options as presented and return the 190// operation specified. Process all modifiers and check to make sure that 191// constraints on modifier/operation pairs have not been violated. 192ArchiveOperation parseCommandLine() { 193 194 // Keep track of number of operations. We can only specify one 195 // per execution. 196 unsigned NumOperations = 0; 197 198 // Keep track of the number of positional modifiers (a,b,i). Only 199 // one can be specified. 200 unsigned NumPositional = 0; 201 202 // Keep track of which operation was requested 203 ArchiveOperation Operation = NoOperation; 204 205 for(unsigned i=0; i<Options.size(); ++i) { 206 switch(Options[i]) { 207 case 'd': ++NumOperations; Operation = Delete; break; 208 case 'm': ++NumOperations; Operation = Move ; break; 209 case 'p': ++NumOperations; Operation = Print; break; 210 case 'q': ++NumOperations; Operation = QuickAppend; break; 211 case 'r': ++NumOperations; Operation = ReplaceOrInsert; break; 212 case 't': ++NumOperations; Operation = DisplayTable; break; 213 case 'x': ++NumOperations; Operation = Extract; break; 214 case 'c': Create = true; break; 215 case 'f': TruncateNames = true; break; 216 case 'k': DontSkipBitcode = true; break; 217 case 'l': /* accepted but unused */ break; 218 case 'o': OriginalDates = true; break; 219 case 'P': FullPath = true; break; 220 case 's': SymTable = true; break; 221 case 'S': SymTable = false; break; 222 case 'u': OnlyUpdate = true; break; 223 case 'v': Verbose = true; break; 224 case 'V': Verbose = ReallyVerbose = true; break; 225 case 'a': 226 getRelPos(); 227 AddAfter = true; 228 NumPositional++; 229 break; 230 case 'b': 231 getRelPos(); 232 AddBefore = true; 233 NumPositional++; 234 break; 235 case 'i': 236 getRelPos(); 237 InsertBefore = true; 238 NumPositional++; 239 break; 240 case 'N': 241 getCount(); 242 UseCount = true; 243 break; 244 default: 245 cl::PrintHelpMessage(); 246 } 247 } 248 249 // At this point, the next thing on the command line must be 250 // the archive name. 251 getArchive(); 252 253 // Everything on the command line at this point is a member. 254 getMembers(); 255 256 // Perform various checks on the operation/modifier specification 257 // to make sure we are dealing with a legal request. 258 if (NumOperations == 0) 259 show_help("You must specify at least one of the operations"); 260 if (NumOperations > 1) 261 show_help("Only one operation may be specified"); 262 if (NumPositional > 1) 263 show_help("You may only specify one of a, b, and i modifiers"); 264 if (AddAfter || AddBefore || InsertBefore) { 265 if (Operation != Move && Operation != ReplaceOrInsert) 266 show_help("The 'a', 'b' and 'i' modifiers can only be specified with " 267 "the 'm' or 'r' operations"); 268 } 269 if (OriginalDates && Operation != Extract) 270 show_help("The 'o' modifier is only applicable to the 'x' operation"); 271 if (TruncateNames && Operation!=QuickAppend && Operation!=ReplaceOrInsert) 272 show_help("The 'f' modifier is only applicable to the 'q' and 'r' " 273 "operations"); 274 if (OnlyUpdate && Operation != ReplaceOrInsert) 275 show_help("The 'u' modifier is only applicable to the 'r' operation"); 276 if (Count > 1 && Members.size() > 1) 277 show_help("Only one member name may be specified with the 'N' modifier"); 278 279 // Return the parsed operation to the caller 280 return Operation; 281} 282 283// buildPaths - Convert the strings in the Members vector to sys::Path objects 284// and make sure they are valid and exist exist. This check is only needed for 285// the operations that add/replace files to the archive ('q' and 'r') 286bool buildPaths(bool checkExistence, std::string* ErrMsg) { 287 for (unsigned i = 0; i < Members.size(); i++) { 288 sys::Path aPath; 289 if (!aPath.set(Members[i])) 290 fail(std::string("File member name invalid: ") + Members[i]); 291 if (checkExistence) { 292 bool Exists; 293 if (sys::fs::exists(aPath.str(), Exists) || !Exists) 294 fail(std::string("File does not exist: ") + Members[i]); 295 std::string Err; 296 sys::PathWithStatus PwS(aPath); 297 const sys::FileStatus *si = PwS.getFileStatus(false, &Err); 298 if (!si) 299 fail(Err); 300 if (si->isDir) 301 fail(aPath.str() + " Is a directory"); 302 303 Paths.insert(aPath.str()); 304 } else { 305 Paths.insert(aPath.str()); 306 } 307 } 308 return false; 309} 310 311// printSymbolTable - print out the archive's symbol table. 312void printSymbolTable() { 313 outs() << "\nArchive Symbol Table:\n"; 314 const Archive::SymTabType& symtab = TheArchive->getSymbolTable(); 315 for (Archive::SymTabType::const_iterator I=symtab.begin(), E=symtab.end(); 316 I != E; ++I ) { 317 unsigned offset = TheArchive->getFirstFileOffset() + I->second; 318 outs() << " " << format("%9u", offset) << "\t" << I->first <<"\n"; 319 } 320} 321 322// doPrint - Implements the 'p' operation. This function traverses the archive 323// looking for members that match the path list. It is careful to uncompress 324// things that should be and to skip bitcode files unless the 'k' modifier was 325// given. 326bool doPrint(std::string* ErrMsg) { 327 if (buildPaths(false, ErrMsg)) 328 return true; 329 unsigned countDown = Count; 330 for (Archive::iterator I = TheArchive->begin(), E = TheArchive->end(); 331 I != E; ++I ) { 332 if (Paths.empty() || 333 (std::find(Paths.begin(), Paths.end(), I->getPath()) != Paths.end())) { 334 if (countDown == 1) { 335 const char* data = reinterpret_cast<const char*>(I->getData()); 336 337 // Skip things that don't make sense to print 338 if (I->isSVR4SymbolTable() || 339 I->isBSD4SymbolTable() || (!DontSkipBitcode && I->isBitcode())) 340 continue; 341 342 if (Verbose) 343 outs() << "Printing " << I->getPath().str() << "\n"; 344 345 unsigned len = I->getSize(); 346 outs().write(data, len); 347 } else { 348 countDown--; 349 } 350 } 351 } 352 return false; 353} 354 355// putMode - utility function for printing out the file mode when the 't' 356// operation is in verbose mode. 357void 358printMode(unsigned mode) { 359 if (mode & 004) 360 outs() << "r"; 361 else 362 outs() << "-"; 363 if (mode & 002) 364 outs() << "w"; 365 else 366 outs() << "-"; 367 if (mode & 001) 368 outs() << "x"; 369 else 370 outs() << "-"; 371} 372 373// doDisplayTable - Implement the 't' operation. This function prints out just 374// the file names of each of the members. However, if verbose mode is requested 375// ('v' modifier) then the file type, permission mode, user, group, size, and 376// modification time are also printed. 377bool 378doDisplayTable(std::string* ErrMsg) { 379 if (buildPaths(false, ErrMsg)) 380 return true; 381 for (Archive::iterator I = TheArchive->begin(), E = TheArchive->end(); 382 I != E; ++I ) { 383 if (Paths.empty() || 384 (std::find(Paths.begin(), Paths.end(), I->getPath()) != Paths.end())) { 385 if (Verbose) { 386 // FIXME: Output should be this format: 387 // Zrw-r--r-- 500/ 500 525 Nov 8 17:42 2004 Makefile 388 if (I->isBitcode()) 389 outs() << "b"; 390 else 391 outs() << " "; 392 unsigned mode = I->getMode(); 393 printMode((mode >> 6) & 007); 394 printMode((mode >> 3) & 007); 395 printMode(mode & 007); 396 outs() << " " << format("%4u", I->getUser()); 397 outs() << "/" << format("%4u", I->getGroup()); 398 outs() << " " << format("%8u", I->getSize()); 399 outs() << " " << format("%20s", I->getModTime().str().substr(4).c_str()); 400 outs() << " " << I->getPath().str() << "\n"; 401 } else { 402 outs() << I->getPath().str() << "\n"; 403 } 404 } 405 } 406 if (ReallyVerbose) 407 printSymbolTable(); 408 return false; 409} 410 411// doExtract - Implement the 'x' operation. This function extracts files back to 412// the file system. 413bool 414doExtract(std::string* ErrMsg) { 415 if (buildPaths(false, ErrMsg)) 416 return true; 417 for (Archive::iterator I = TheArchive->begin(), E = TheArchive->end(); 418 I != E; ++I ) { 419 if (Paths.empty() || 420 (std::find(Paths.begin(), Paths.end(), I->getPath()) != Paths.end())) { 421 422 // Make sure the intervening directories are created 423 if (I->hasPath()) { 424 sys::Path dirs(I->getPath()); 425 dirs.eraseComponent(); 426 if (dirs.createDirectoryOnDisk(/*create_parents=*/true, ErrMsg)) 427 return true; 428 } 429 430 // Open up a file stream for writing 431 std::ios::openmode io_mode = std::ios::out | std::ios::trunc | 432 std::ios::binary; 433 std::ofstream file(I->getPath().str().c_str(), io_mode); 434 435 // Get the data and its length 436 const char* data = reinterpret_cast<const char*>(I->getData()); 437 unsigned len = I->getSize(); 438 439 // Write the data. 440 file.write(data,len); 441 file.close(); 442 443 // If we're supposed to retain the original modification times, etc. do so 444 // now. 445 if (OriginalDates) { 446 sys::PathWithStatus PWS(I->getPath()); 447 PWS.setStatusInfoOnDisk(I->getFileStatus()); 448 } 449 } 450 } 451 return false; 452} 453 454// doDelete - Implement the delete operation. This function deletes zero or more 455// members from the archive. Note that if the count is specified, there should 456// be no more than one path in the Paths list or else this algorithm breaks. 457// That check is enforced in parseCommandLine (above). 458bool 459doDelete(std::string* ErrMsg) { 460 if (buildPaths(false, ErrMsg)) 461 return true; 462 if (Paths.empty()) 463 return false; 464 unsigned countDown = Count; 465 for (Archive::iterator I = TheArchive->begin(), E = TheArchive->end(); 466 I != E; ) { 467 if (std::find(Paths.begin(), Paths.end(), I->getPath()) != Paths.end()) { 468 if (countDown == 1) { 469 Archive::iterator J = I; 470 ++I; 471 TheArchive->erase(J); 472 } else 473 countDown--; 474 } else { 475 ++I; 476 } 477 } 478 479 // We're done editting, reconstruct the archive. 480 if (TheArchive->writeToDisk(SymTable,TruncateNames,ErrMsg)) 481 return true; 482 if (ReallyVerbose) 483 printSymbolTable(); 484 return false; 485} 486 487// doMore - Implement the move operation. This function re-arranges just the 488// order of the archive members so that when the archive is written the move 489// of the members is accomplished. Note the use of the RelPos variable to 490// determine where the items should be moved to. 491bool 492doMove(std::string* ErrMsg) { 493 if (buildPaths(false, ErrMsg)) 494 return true; 495 496 // By default and convention the place to move members to is the end of the 497 // archive. 498 Archive::iterator moveto_spot = TheArchive->end(); 499 500 // However, if the relative positioning modifiers were used, we need to scan 501 // the archive to find the member in question. If we don't find it, its no 502 // crime, we just move to the end. 503 if (AddBefore || InsertBefore || AddAfter) { 504 for (Archive::iterator I = TheArchive->begin(), E= TheArchive->end(); 505 I != E; ++I ) { 506 if (RelPos == I->getPath().str()) { 507 if (AddAfter) { 508 moveto_spot = I; 509 moveto_spot++; 510 } else { 511 moveto_spot = I; 512 } 513 break; 514 } 515 } 516 } 517 518 // Keep a list of the paths remaining to be moved 519 std::set<std::string> remaining(Paths); 520 521 // Scan the archive again, this time looking for the members to move to the 522 // moveto_spot. 523 for (Archive::iterator I = TheArchive->begin(), E= TheArchive->end(); 524 I != E && !remaining.empty(); ++I ) { 525 std::set<std::string>::iterator found = 526 std::find(remaining.begin(),remaining.end(), I->getPath()); 527 if (found != remaining.end()) { 528 if (I != moveto_spot) 529 TheArchive->splice(moveto_spot,*TheArchive,I); 530 remaining.erase(found); 531 } 532 } 533 534 // We're done editting, reconstruct the archive. 535 if (TheArchive->writeToDisk(SymTable,TruncateNames,ErrMsg)) 536 return true; 537 if (ReallyVerbose) 538 printSymbolTable(); 539 return false; 540} 541 542// doQuickAppend - Implements the 'q' operation. This function just 543// indiscriminantly adds the members to the archive and rebuilds it. 544bool 545doQuickAppend(std::string* ErrMsg) { 546 // Get the list of paths to append. 547 if (buildPaths(true, ErrMsg)) 548 return true; 549 if (Paths.empty()) 550 return false; 551 552 // Append them quickly. 553 for (std::set<std::string>::iterator PI = Paths.begin(), PE = Paths.end(); 554 PI != PE; ++PI) { 555 if (TheArchive->addFileBefore(sys::Path(*PI),TheArchive->end(),ErrMsg)) 556 return true; 557 } 558 559 // We're done editting, reconstruct the archive. 560 if (TheArchive->writeToDisk(SymTable,TruncateNames,ErrMsg)) 561 return true; 562 if (ReallyVerbose) 563 printSymbolTable(); 564 return false; 565} 566 567// doReplaceOrInsert - Implements the 'r' operation. This function will replace 568// any existing files or insert new ones into the archive. 569bool 570doReplaceOrInsert(std::string* ErrMsg) { 571 572 // Build the list of files to be added/replaced. 573 if (buildPaths(true, ErrMsg)) 574 return true; 575 if (Paths.empty()) 576 return false; 577 578 // Keep track of the paths that remain to be inserted. 579 std::set<std::string> remaining(Paths); 580 581 // Default the insertion spot to the end of the archive 582 Archive::iterator insert_spot = TheArchive->end(); 583 584 // Iterate over the archive contents 585 for (Archive::iterator I = TheArchive->begin(), E = TheArchive->end(); 586 I != E && !remaining.empty(); ++I ) { 587 588 // Determine if this archive member matches one of the paths we're trying 589 // to replace. 590 591 std::set<std::string>::iterator found = remaining.end(); 592 for (std::set<std::string>::iterator RI = remaining.begin(), 593 RE = remaining.end(); RI != RE; ++RI ) { 594 std::string compare(*RI); 595 if (TruncateNames && compare.length() > 15) { 596 const char* nm = compare.c_str(); 597 unsigned len = compare.length(); 598 size_t slashpos = compare.rfind('/'); 599 if (slashpos != std::string::npos) { 600 nm += slashpos + 1; 601 len -= slashpos +1; 602 } 603 if (len > 15) 604 len = 15; 605 compare.assign(nm,len); 606 } 607 if (compare == I->getPath().str()) { 608 found = RI; 609 break; 610 } 611 } 612 613 if (found != remaining.end()) { 614 std::string Err; 615 sys::PathWithStatus PwS(*found); 616 const sys::FileStatus *si = PwS.getFileStatus(false, &Err); 617 if (!si) 618 return true; 619 if (!si->isDir) { 620 if (OnlyUpdate) { 621 // Replace the item only if it is newer. 622 if (si->modTime > I->getModTime()) 623 if (I->replaceWith(sys::Path(*found), ErrMsg)) 624 return true; 625 } else { 626 // Replace the item regardless of time stamp 627 if (I->replaceWith(sys::Path(*found), ErrMsg)) 628 return true; 629 } 630 } else { 631 // We purposefully ignore directories. 632 } 633 634 // Remove it from our "to do" list 635 remaining.erase(found); 636 } 637 638 // Determine if this is the place where we should insert 639 if ((AddBefore || InsertBefore) && RelPos == I->getPath().str()) 640 insert_spot = I; 641 else if (AddAfter && RelPos == I->getPath().str()) { 642 insert_spot = I; 643 insert_spot++; 644 } 645 } 646 647 // If we didn't replace all the members, some will remain and need to be 648 // inserted at the previously computed insert-spot. 649 if (!remaining.empty()) { 650 for (std::set<std::string>::iterator PI = remaining.begin(), 651 PE = remaining.end(); PI != PE; ++PI) { 652 if (TheArchive->addFileBefore(sys::Path(*PI),insert_spot, ErrMsg)) 653 return true; 654 } 655 } 656 657 // We're done editting, reconstruct the archive. 658 if (TheArchive->writeToDisk(SymTable,TruncateNames,ErrMsg)) 659 return true; 660 if (ReallyVerbose) 661 printSymbolTable(); 662 return false; 663} 664 665// main - main program for llvm-ar .. see comments in the code 666int main(int argc, char **argv) { 667 program_name = argv[0]; 668 // Print a stack trace if we signal out. 669 sys::PrintStackTraceOnErrorSignal(); 670 PrettyStackTraceProgram X(argc, argv); 671 LLVMContext &Context = getGlobalContext(); 672 llvm_shutdown_obj Y; // Call llvm_shutdown() on exit. 673 674 // Have the command line options parsed and handle things 675 // like --help and --version. 676 cl::ParseCommandLineOptions(argc, argv, 677 "LLVM Archiver (llvm-ar)\n\n" 678 " This program archives bitcode files into single libraries\n" 679 ); 680 681 int exitCode = 0; 682 683 // Do our own parsing of the command line because the CommandLine utility 684 // can't handle the grouped positional parameters without a dash. 685 ArchiveOperation Operation = parseCommandLine(); 686 687 // Check the path name of the archive 688 sys::Path ArchivePath; 689 if (!ArchivePath.set(ArchiveName)) { 690 errs() << argv[0] << ": Archive name invalid: " << ArchiveName << "\n"; 691 return 1; 692 } 693 694 // Create or open the archive object. 695 bool Exists; 696 if (llvm::sys::fs::exists(ArchivePath.str(), Exists) || !Exists) { 697 // Produce a warning if we should and we're creating the archive 698 if (!Create) 699 errs() << argv[0] << ": creating " << ArchivePath.str() << "\n"; 700 TheArchive = Archive::CreateEmpty(ArchivePath, Context); 701 TheArchive->writeToDisk(); 702 } else { 703 std::string Error; 704 TheArchive = Archive::OpenAndLoad(ArchivePath, Context, &Error); 705 if (TheArchive == 0) { 706 errs() << argv[0] << ": error loading '" << ArchivePath.str() << "': " 707 << Error << "!\n"; 708 return 1; 709 } 710 } 711 712 // Make sure we're not fooling ourselves. 713 assert(TheArchive && "Unable to instantiate the archive"); 714 715 // Perform the operation 716 std::string ErrMsg; 717 bool haveError = false; 718 switch (Operation) { 719 case Print: haveError = doPrint(&ErrMsg); break; 720 case Delete: haveError = doDelete(&ErrMsg); break; 721 case Move: haveError = doMove(&ErrMsg); break; 722 case QuickAppend: haveError = doQuickAppend(&ErrMsg); break; 723 case ReplaceOrInsert: haveError = doReplaceOrInsert(&ErrMsg); break; 724 case DisplayTable: haveError = doDisplayTable(&ErrMsg); break; 725 case Extract: haveError = doExtract(&ErrMsg); break; 726 case NoOperation: 727 errs() << argv[0] << ": No operation was selected.\n"; 728 break; 729 } 730 if (haveError) { 731 errs() << argv[0] << ": " << ErrMsg << "\n"; 732 return 1; 733 } 734 735 delete TheArchive; 736 TheArchive = 0; 737 738 // Return result code back to operating system. 739 return exitCode; 740} 741