Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 1 | //===-- llvm-bcanalyzer.cpp - Bitcode Analyzer --------------------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | 5f5a573 | 2007-12-29 20:44:31 +0000 | [diff] [blame] | 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This tool may be invoked in the following manner: |
| 11 | // llvm-bcanalyzer [options] - Read LLVM bitcode from stdin |
| 12 | // llvm-bcanalyzer [options] x.bc - Read LLVM bitcode from the x.bc file |
| 13 | // |
| 14 | // Options: |
| 15 | // --help - Output information about command line switches |
| 16 | // --dump - Dump low-level bitcode structure in readable format |
| 17 | // |
| 18 | // This tool provides analytical information about a bitcode file. It is |
| 19 | // intended as an aid to developers of bitcode reading and writing software. It |
| 20 | // produces on std::out a summary of the bitcode file that shows various |
| 21 | // statistics about the contents of the file. By default this information is |
| 22 | // detailed and contains information about individual bitcode blocks and the |
| 23 | // functions in the module. |
| 24 | // The tool is also able to print a bitcode file in a straight forward text |
| 25 | // format that shows the containment and relationships of the information in |
| 26 | // the bitcode file (-dump option). |
| 27 | // |
| 28 | //===----------------------------------------------------------------------===// |
| 29 | |
| 30 | #include "llvm/Analysis/Verifier.h" |
| 31 | #include "llvm/Bitcode/BitstreamReader.h" |
| 32 | #include "llvm/Bitcode/LLVMBitCodes.h" |
Chris Lattner | abd0e44 | 2009-04-06 20:54:32 +0000 | [diff] [blame^] | 33 | #include "llvm/Bitcode/ReaderWriter.h" |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 34 | #include "llvm/Support/CommandLine.h" |
| 35 | #include "llvm/Support/ManagedStatic.h" |
| 36 | #include "llvm/Support/MemoryBuffer.h" |
Chris Lattner | e6012df | 2009-03-06 05:34:10 +0000 | [diff] [blame] | 37 | #include "llvm/Support/PrettyStackTrace.h" |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 38 | #include "llvm/System/Signals.h" |
| 39 | #include <map> |
| 40 | #include <fstream> |
| 41 | #include <iostream> |
| 42 | #include <algorithm> |
| 43 | using namespace llvm; |
| 44 | |
| 45 | static cl::opt<std::string> |
| 46 | InputFilename(cl::Positional, cl::desc("<input bitcode>"), cl::init("-")); |
| 47 | |
| 48 | static cl::opt<std::string> |
| 49 | OutputFilename("-o", cl::init("-"), cl::desc("<output file>")); |
| 50 | |
| 51 | static cl::opt<bool> Dump("dump", cl::desc("Dump low level bitcode trace")); |
| 52 | |
| 53 | //===----------------------------------------------------------------------===// |
| 54 | // Bitcode specific analysis. |
| 55 | //===----------------------------------------------------------------------===// |
| 56 | |
| 57 | static cl::opt<bool> NoHistogram("disable-histogram", |
| 58 | cl::desc("Do not print per-code histogram")); |
| 59 | |
| 60 | static cl::opt<bool> |
| 61 | NonSymbolic("non-symbolic", |
| 62 | cl::desc("Emit numberic info in dump even if" |
| 63 | " symbolic info is available")); |
| 64 | |
| 65 | /// CurStreamType - If we can sniff the flavor of this stream, we can produce |
| 66 | /// better dump info. |
| 67 | static enum { |
| 68 | UnknownBitstream, |
| 69 | LLVMIRBitstream |
| 70 | } CurStreamType; |
| 71 | |
| 72 | |
| 73 | /// GetBlockName - Return a symbolic block name if known, otherwise return |
| 74 | /// null. |
| 75 | static const char *GetBlockName(unsigned BlockID) { |
| 76 | // Standard blocks for all bitcode files. |
| 77 | if (BlockID < bitc::FIRST_APPLICATION_BLOCKID) { |
| 78 | if (BlockID == bitc::BLOCKINFO_BLOCK_ID) |
| 79 | return "BLOCKINFO_BLOCK"; |
| 80 | return 0; |
| 81 | } |
| 82 | |
| 83 | if (CurStreamType != LLVMIRBitstream) return 0; |
| 84 | |
| 85 | switch (BlockID) { |
| 86 | default: return 0; |
| 87 | case bitc::MODULE_BLOCK_ID: return "MODULE_BLOCK"; |
| 88 | case bitc::PARAMATTR_BLOCK_ID: return "PARAMATTR_BLOCK"; |
| 89 | case bitc::TYPE_BLOCK_ID: return "TYPE_BLOCK"; |
| 90 | case bitc::CONSTANTS_BLOCK_ID: return "CONSTANTS_BLOCK"; |
| 91 | case bitc::FUNCTION_BLOCK_ID: return "FUNCTION_BLOCK"; |
| 92 | case bitc::TYPE_SYMTAB_BLOCK_ID: return "TYPE_SYMTAB"; |
| 93 | case bitc::VALUE_SYMTAB_BLOCK_ID: return "VALUE_SYMTAB"; |
| 94 | } |
| 95 | } |
| 96 | |
| 97 | /// GetCodeName - Return a symbolic code name if known, otherwise return |
| 98 | /// null. |
| 99 | static const char *GetCodeName(unsigned CodeID, unsigned BlockID) { |
| 100 | // Standard blocks for all bitcode files. |
| 101 | if (BlockID < bitc::FIRST_APPLICATION_BLOCKID) { |
| 102 | if (BlockID == bitc::BLOCKINFO_BLOCK_ID) { |
| 103 | switch (CodeID) { |
| 104 | default: return 0; |
| 105 | case bitc::MODULE_CODE_VERSION: return "VERSION"; |
| 106 | } |
| 107 | } |
| 108 | return 0; |
| 109 | } |
| 110 | |
| 111 | if (CurStreamType != LLVMIRBitstream) return 0; |
| 112 | |
| 113 | switch (BlockID) { |
| 114 | default: return 0; |
| 115 | case bitc::MODULE_BLOCK_ID: |
| 116 | switch (CodeID) { |
| 117 | default: return 0; |
| 118 | case bitc::MODULE_CODE_VERSION: return "VERSION"; |
| 119 | case bitc::MODULE_CODE_TRIPLE: return "TRIPLE"; |
| 120 | case bitc::MODULE_CODE_DATALAYOUT: return "DATALAYOUT"; |
| 121 | case bitc::MODULE_CODE_ASM: return "ASM"; |
| 122 | case bitc::MODULE_CODE_SECTIONNAME: return "SECTIONNAME"; |
| 123 | case bitc::MODULE_CODE_DEPLIB: return "DEPLIB"; |
| 124 | case bitc::MODULE_CODE_GLOBALVAR: return "GLOBALVAR"; |
| 125 | case bitc::MODULE_CODE_FUNCTION: return "FUNCTION"; |
| 126 | case bitc::MODULE_CODE_ALIAS: return "ALIAS"; |
| 127 | case bitc::MODULE_CODE_PURGEVALS: return "PURGEVALS"; |
Nick Lewycky | b90b841 | 2008-11-07 14:52:51 +0000 | [diff] [blame] | 128 | case bitc::MODULE_CODE_GCNAME: return "GCNAME"; |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 129 | } |
| 130 | case bitc::PARAMATTR_BLOCK_ID: |
| 131 | switch (CodeID) { |
| 132 | default: return 0; |
| 133 | case bitc::PARAMATTR_CODE_ENTRY: return "ENTRY"; |
| 134 | } |
| 135 | case bitc::TYPE_BLOCK_ID: |
| 136 | switch (CodeID) { |
| 137 | default: return 0; |
Nick Lewycky | b90b841 | 2008-11-07 14:52:51 +0000 | [diff] [blame] | 138 | case bitc::TYPE_CODE_NUMENTRY: return "NUMENTRY"; |
| 139 | case bitc::TYPE_CODE_VOID: return "VOID"; |
| 140 | case bitc::TYPE_CODE_FLOAT: return "FLOAT"; |
| 141 | case bitc::TYPE_CODE_DOUBLE: return "DOUBLE"; |
| 142 | case bitc::TYPE_CODE_LABEL: return "LABEL"; |
| 143 | case bitc::TYPE_CODE_OPAQUE: return "OPAQUE"; |
| 144 | case bitc::TYPE_CODE_INTEGER: return "INTEGER"; |
| 145 | case bitc::TYPE_CODE_POINTER: return "POINTER"; |
| 146 | case bitc::TYPE_CODE_FUNCTION: return "FUNCTION"; |
| 147 | case bitc::TYPE_CODE_STRUCT: return "STRUCT"; |
| 148 | case bitc::TYPE_CODE_ARRAY: return "ARRAY"; |
| 149 | case bitc::TYPE_CODE_VECTOR: return "VECTOR"; |
| 150 | case bitc::TYPE_CODE_X86_FP80: return "X86_FP80"; |
| 151 | case bitc::TYPE_CODE_FP128: return "FP128"; |
| 152 | case bitc::TYPE_CODE_PPC_FP128: return "PPC_FP128"; |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 153 | } |
| 154 | |
| 155 | case bitc::CONSTANTS_BLOCK_ID: |
| 156 | switch (CodeID) { |
| 157 | default: return 0; |
| 158 | case bitc::CST_CODE_SETTYPE: return "SETTYPE"; |
| 159 | case bitc::CST_CODE_NULL: return "NULL"; |
| 160 | case bitc::CST_CODE_UNDEF: return "UNDEF"; |
| 161 | case bitc::CST_CODE_INTEGER: return "INTEGER"; |
| 162 | case bitc::CST_CODE_WIDE_INTEGER: return "WIDE_INTEGER"; |
| 163 | case bitc::CST_CODE_FLOAT: return "FLOAT"; |
| 164 | case bitc::CST_CODE_AGGREGATE: return "AGGREGATE"; |
| 165 | case bitc::CST_CODE_STRING: return "STRING"; |
| 166 | case bitc::CST_CODE_CSTRING: return "CSTRING"; |
| 167 | case bitc::CST_CODE_CE_BINOP: return "CE_BINOP"; |
| 168 | case bitc::CST_CODE_CE_CAST: return "CE_CAST"; |
| 169 | case bitc::CST_CODE_CE_GEP: return "CE_GEP"; |
| 170 | case bitc::CST_CODE_CE_SELECT: return "CE_SELECT"; |
| 171 | case bitc::CST_CODE_CE_EXTRACTELT: return "CE_EXTRACTELT"; |
| 172 | case bitc::CST_CODE_CE_INSERTELT: return "CE_INSERTELT"; |
| 173 | case bitc::CST_CODE_CE_SHUFFLEVEC: return "CE_SHUFFLEVEC"; |
| 174 | case bitc::CST_CODE_CE_CMP: return "CE_CMP"; |
| 175 | case bitc::CST_CODE_INLINEASM: return "INLINEASM"; |
| 176 | } |
| 177 | case bitc::FUNCTION_BLOCK_ID: |
| 178 | switch (CodeID) { |
| 179 | default: return 0; |
| 180 | case bitc::FUNC_CODE_DECLAREBLOCKS: return "DECLAREBLOCKS"; |
| 181 | |
| 182 | case bitc::FUNC_CODE_INST_BINOP: return "INST_BINOP"; |
| 183 | case bitc::FUNC_CODE_INST_CAST: return "INST_CAST"; |
| 184 | case bitc::FUNC_CODE_INST_GEP: return "INST_GEP"; |
| 185 | case bitc::FUNC_CODE_INST_SELECT: return "INST_SELECT"; |
| 186 | case bitc::FUNC_CODE_INST_EXTRACTELT: return "INST_EXTRACTELT"; |
| 187 | case bitc::FUNC_CODE_INST_INSERTELT: return "INST_INSERTELT"; |
| 188 | case bitc::FUNC_CODE_INST_SHUFFLEVEC: return "INST_SHUFFLEVEC"; |
| 189 | case bitc::FUNC_CODE_INST_CMP: return "INST_CMP"; |
| 190 | |
| 191 | case bitc::FUNC_CODE_INST_RET: return "INST_RET"; |
| 192 | case bitc::FUNC_CODE_INST_BR: return "INST_BR"; |
| 193 | case bitc::FUNC_CODE_INST_SWITCH: return "INST_SWITCH"; |
| 194 | case bitc::FUNC_CODE_INST_INVOKE: return "INST_INVOKE"; |
| 195 | case bitc::FUNC_CODE_INST_UNWIND: return "INST_UNWIND"; |
| 196 | case bitc::FUNC_CODE_INST_UNREACHABLE: return "INST_UNREACHABLE"; |
| 197 | |
| 198 | case bitc::FUNC_CODE_INST_PHI: return "INST_PHI"; |
| 199 | case bitc::FUNC_CODE_INST_MALLOC: return "INST_MALLOC"; |
| 200 | case bitc::FUNC_CODE_INST_FREE: return "INST_FREE"; |
| 201 | case bitc::FUNC_CODE_INST_ALLOCA: return "INST_ALLOCA"; |
| 202 | case bitc::FUNC_CODE_INST_LOAD: return "INST_LOAD"; |
| 203 | case bitc::FUNC_CODE_INST_STORE: return "INST_STORE"; |
| 204 | case bitc::FUNC_CODE_INST_CALL: return "INST_CALL"; |
| 205 | case bitc::FUNC_CODE_INST_VAARG: return "INST_VAARG"; |
Christopher Lamb | 44d62f6 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 206 | case bitc::FUNC_CODE_INST_STORE2: return "INST_STORE2"; |
Nick Lewycky | 2c3eced | 2008-03-01 21:47:06 +0000 | [diff] [blame] | 207 | case bitc::FUNC_CODE_INST_GETRESULT: return "INST_GETRESULT"; |
Nick Lewycky | b90b841 | 2008-11-07 14:52:51 +0000 | [diff] [blame] | 208 | case bitc::FUNC_CODE_INST_EXTRACTVAL: return "INST_EXTRACTVAL"; |
| 209 | case bitc::FUNC_CODE_INST_INSERTVAL: return "INST_INSERTVAL"; |
| 210 | case bitc::FUNC_CODE_INST_CMP2: return "INST_CMP2"; |
| 211 | case bitc::FUNC_CODE_INST_VSELECT: return "INST_VSELECT"; |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 212 | } |
| 213 | case bitc::TYPE_SYMTAB_BLOCK_ID: |
| 214 | switch (CodeID) { |
| 215 | default: return 0; |
| 216 | case bitc::TST_CODE_ENTRY: return "ENTRY"; |
| 217 | } |
| 218 | case bitc::VALUE_SYMTAB_BLOCK_ID: |
| 219 | switch (CodeID) { |
| 220 | default: return 0; |
| 221 | case bitc::VST_CODE_ENTRY: return "ENTRY"; |
| 222 | case bitc::VST_CODE_BBENTRY: return "BBENTRY"; |
| 223 | } |
| 224 | } |
| 225 | } |
| 226 | |
| 227 | |
| 228 | struct PerBlockIDStats { |
| 229 | /// NumInstances - This the number of times this block ID has been seen. |
| 230 | unsigned NumInstances; |
| 231 | |
| 232 | /// NumBits - The total size in bits of all of these blocks. |
| 233 | uint64_t NumBits; |
| 234 | |
| 235 | /// NumSubBlocks - The total number of blocks these blocks contain. |
| 236 | unsigned NumSubBlocks; |
| 237 | |
| 238 | /// NumAbbrevs - The total number of abbreviations. |
| 239 | unsigned NumAbbrevs; |
| 240 | |
| 241 | /// NumRecords - The total number of records these blocks contain, and the |
| 242 | /// number that are abbreviated. |
| 243 | unsigned NumRecords, NumAbbreviatedRecords; |
| 244 | |
| 245 | /// CodeFreq - Keep track of the number of times we see each code. |
| 246 | std::vector<unsigned> CodeFreq; |
| 247 | |
| 248 | PerBlockIDStats() |
| 249 | : NumInstances(0), NumBits(0), |
| 250 | NumSubBlocks(0), NumAbbrevs(0), NumRecords(0), NumAbbreviatedRecords(0) {} |
| 251 | }; |
| 252 | |
| 253 | static std::map<unsigned, PerBlockIDStats> BlockIDStats; |
| 254 | |
| 255 | |
| 256 | |
| 257 | /// Error - All bitcode analysis errors go through this function, making this a |
| 258 | /// good place to breakpoint if debugging. |
| 259 | static bool Error(const std::string &Err) { |
| 260 | std::cerr << Err << "\n"; |
| 261 | return true; |
| 262 | } |
| 263 | |
| 264 | /// ParseBlock - Read a block, updating statistics, etc. |
| 265 | static bool ParseBlock(BitstreamReader &Stream, unsigned IndentLevel) { |
| 266 | std::string Indent(IndentLevel*2, ' '); |
| 267 | uint64_t BlockBitStart = Stream.GetCurrentBitNo(); |
| 268 | unsigned BlockID = Stream.ReadSubBlockID(); |
| 269 | |
| 270 | // Get the statistics for this BlockID. |
| 271 | PerBlockIDStats &BlockStats = BlockIDStats[BlockID]; |
| 272 | |
| 273 | BlockStats.NumInstances++; |
| 274 | |
| 275 | // BLOCKINFO is a special part of the stream. |
| 276 | if (BlockID == bitc::BLOCKINFO_BLOCK_ID) { |
| 277 | if (Dump) std::cerr << Indent << "<BLOCKINFO_BLOCK/>\n"; |
| 278 | if (Stream.ReadBlockInfoBlock()) |
| 279 | return Error("Malformed BlockInfoBlock"); |
| 280 | uint64_t BlockBitEnd = Stream.GetCurrentBitNo(); |
| 281 | BlockStats.NumBits += BlockBitEnd-BlockBitStart; |
| 282 | return false; |
| 283 | } |
| 284 | |
| 285 | unsigned NumWords = 0; |
| 286 | if (Stream.EnterSubBlock(BlockID, &NumWords)) |
| 287 | return Error("Malformed block record"); |
| 288 | |
| 289 | const char *BlockName = 0; |
| 290 | if (Dump) { |
| 291 | std::cerr << Indent << "<"; |
| 292 | if ((BlockName = GetBlockName(BlockID))) |
| 293 | std::cerr << BlockName; |
| 294 | else |
| 295 | std::cerr << "UnknownBlock" << BlockID; |
| 296 | |
| 297 | if (NonSymbolic && BlockName) |
| 298 | std::cerr << " BlockID=" << BlockID; |
| 299 | |
| 300 | std::cerr << " NumWords=" << NumWords |
| 301 | << " BlockCodeSize=" << Stream.GetAbbrevIDWidth() << ">\n"; |
| 302 | } |
| 303 | |
| 304 | SmallVector<uint64_t, 64> Record; |
| 305 | |
| 306 | // Read all the records for this block. |
| 307 | while (1) { |
| 308 | if (Stream.AtEndOfStream()) |
| 309 | return Error("Premature end of bitstream"); |
| 310 | |
| 311 | // Read the code for this record. |
| 312 | unsigned AbbrevID = Stream.ReadCode(); |
| 313 | switch (AbbrevID) { |
| 314 | case bitc::END_BLOCK: { |
| 315 | if (Stream.ReadBlockEnd()) |
| 316 | return Error("Error at end of block"); |
| 317 | uint64_t BlockBitEnd = Stream.GetCurrentBitNo(); |
| 318 | BlockStats.NumBits += BlockBitEnd-BlockBitStart; |
| 319 | if (Dump) { |
| 320 | std::cerr << Indent << "</"; |
| 321 | if (BlockName) |
| 322 | std::cerr << BlockName << ">\n"; |
| 323 | else |
| 324 | std::cerr << "UnknownBlock" << BlockID << ">\n"; |
| 325 | } |
| 326 | return false; |
| 327 | } |
| 328 | case bitc::ENTER_SUBBLOCK: { |
| 329 | uint64_t SubBlockBitStart = Stream.GetCurrentBitNo(); |
| 330 | if (ParseBlock(Stream, IndentLevel+1)) |
| 331 | return true; |
| 332 | ++BlockStats.NumSubBlocks; |
| 333 | uint64_t SubBlockBitEnd = Stream.GetCurrentBitNo(); |
| 334 | |
| 335 | // Don't include subblock sizes in the size of this block. |
| 336 | BlockBitStart += SubBlockBitEnd-SubBlockBitStart; |
| 337 | break; |
| 338 | } |
| 339 | case bitc::DEFINE_ABBREV: |
| 340 | Stream.ReadAbbrevRecord(); |
| 341 | ++BlockStats.NumAbbrevs; |
| 342 | break; |
| 343 | default: |
| 344 | ++BlockStats.NumRecords; |
| 345 | if (AbbrevID != bitc::UNABBREV_RECORD) |
| 346 | ++BlockStats.NumAbbreviatedRecords; |
| 347 | |
| 348 | Record.clear(); |
| 349 | unsigned Code = Stream.ReadRecord(AbbrevID, Record); |
| 350 | |
| 351 | // Increment the # occurrences of this code. |
| 352 | if (BlockStats.CodeFreq.size() <= Code) |
| 353 | BlockStats.CodeFreq.resize(Code+1); |
| 354 | BlockStats.CodeFreq[Code]++; |
| 355 | |
| 356 | if (Dump) { |
| 357 | std::cerr << Indent << " <"; |
| 358 | if (const char *CodeName = GetCodeName(Code, BlockID)) |
| 359 | std::cerr << CodeName; |
| 360 | else |
| 361 | std::cerr << "UnknownCode" << Code; |
| 362 | if (NonSymbolic && GetCodeName(Code, BlockID)) |
| 363 | std::cerr << " codeid=" << Code; |
| 364 | if (AbbrevID != bitc::UNABBREV_RECORD) |
| 365 | std::cerr << " abbrevid=" << AbbrevID; |
| 366 | |
| 367 | for (unsigned i = 0, e = Record.size(); i != e; ++i) |
| 368 | std::cerr << " op" << i << "=" << (int64_t)Record[i]; |
| 369 | |
| 370 | std::cerr << "/>\n"; |
| 371 | } |
| 372 | |
| 373 | break; |
| 374 | } |
| 375 | } |
| 376 | } |
| 377 | |
| 378 | static void PrintSize(double Bits) { |
| 379 | std::cerr << Bits << "b/" << Bits/8 << "B/" << Bits/32 << "W"; |
| 380 | } |
| 381 | |
| 382 | |
| 383 | /// AnalyzeBitcode - Analyze the bitcode file specified by InputFilename. |
| 384 | static int AnalyzeBitcode() { |
| 385 | // Read the input file. |
Chris Lattner | abd0e44 | 2009-04-06 20:54:32 +0000 | [diff] [blame^] | 386 | MemoryBuffer *MemBuf = MemoryBuffer::getFileOrSTDIN(InputFilename.c_str()); |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 387 | |
Chris Lattner | abd0e44 | 2009-04-06 20:54:32 +0000 | [diff] [blame^] | 388 | if (MemBuf == 0) |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 389 | return Error("Error reading '" + InputFilename + "'."); |
| 390 | |
Chris Lattner | abd0e44 | 2009-04-06 20:54:32 +0000 | [diff] [blame^] | 391 | if (MemBuf->getBufferSize() & 3) |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 392 | return Error("Bitcode stream should be a multiple of 4 bytes in length"); |
| 393 | |
Chris Lattner | abd0e44 | 2009-04-06 20:54:32 +0000 | [diff] [blame^] | 394 | unsigned char *BufPtr = (unsigned char *)MemBuf->getBufferStart(); |
| 395 | unsigned char *EndBufPtr = BufPtr+MemBuf->getBufferSize(); |
| 396 | |
| 397 | // If we have a wrapper header, parse it and ignore the non-bc file contents. |
| 398 | // The magic number is 0x0B17C0DE stored in little endian. |
| 399 | if (isBitcodeWrapper(BufPtr, EndBufPtr)) |
| 400 | if (SkipBitcodeWrapperHeader(BufPtr, EndBufPtr)) |
| 401 | return Error("Invalid bitcode wrapper header"); |
| 402 | |
| 403 | BitstreamReader Stream(BufPtr, EndBufPtr); |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 404 | |
| 405 | |
| 406 | // Read the stream signature. |
| 407 | char Signature[6]; |
| 408 | Signature[0] = Stream.Read(8); |
| 409 | Signature[1] = Stream.Read(8); |
| 410 | Signature[2] = Stream.Read(4); |
| 411 | Signature[3] = Stream.Read(4); |
| 412 | Signature[4] = Stream.Read(4); |
| 413 | Signature[5] = Stream.Read(4); |
| 414 | |
| 415 | // Autodetect the file contents, if it is one we know. |
| 416 | CurStreamType = UnknownBitstream; |
| 417 | if (Signature[0] == 'B' && Signature[1] == 'C' && |
| 418 | Signature[2] == 0x0 && Signature[3] == 0xC && |
| 419 | Signature[4] == 0xE && Signature[5] == 0xD) |
| 420 | CurStreamType = LLVMIRBitstream; |
| 421 | |
| 422 | unsigned NumTopBlocks = 0; |
| 423 | |
| 424 | // Parse the top-level structure. We only allow blocks at the top-level. |
| 425 | while (!Stream.AtEndOfStream()) { |
| 426 | unsigned Code = Stream.ReadCode(); |
| 427 | if (Code != bitc::ENTER_SUBBLOCK) |
| 428 | return Error("Invalid record at top-level"); |
| 429 | |
| 430 | if (ParseBlock(Stream, 0)) |
| 431 | return true; |
| 432 | ++NumTopBlocks; |
| 433 | } |
| 434 | |
| 435 | if (Dump) std::cerr << "\n\n"; |
| 436 | |
Chris Lattner | abd0e44 | 2009-04-06 20:54:32 +0000 | [diff] [blame^] | 437 | uint64_t BufferSizeBits = (EndBufPtr-BufPtr)*CHAR_BIT; |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 438 | // Print a summary of the read file. |
| 439 | std::cerr << "Summary of " << InputFilename << ":\n"; |
| 440 | std::cerr << " Total size: "; |
| 441 | PrintSize(BufferSizeBits); |
| 442 | std::cerr << "\n"; |
| 443 | std::cerr << " Stream type: "; |
| 444 | switch (CurStreamType) { |
| 445 | default: assert(0 && "Unknown bitstream type"); |
| 446 | case UnknownBitstream: std::cerr << "unknown\n"; break; |
| 447 | case LLVMIRBitstream: std::cerr << "LLVM IR\n"; break; |
| 448 | } |
| 449 | std::cerr << " # Toplevel Blocks: " << NumTopBlocks << "\n"; |
| 450 | std::cerr << "\n"; |
| 451 | |
| 452 | // Emit per-block stats. |
| 453 | std::cerr << "Per-block Summary:\n"; |
| 454 | for (std::map<unsigned, PerBlockIDStats>::iterator I = BlockIDStats.begin(), |
| 455 | E = BlockIDStats.end(); I != E; ++I) { |
| 456 | std::cerr << " Block ID #" << I->first; |
| 457 | if (const char *BlockName = GetBlockName(I->first)) |
| 458 | std::cerr << " (" << BlockName << ")"; |
| 459 | std::cerr << ":\n"; |
| 460 | |
| 461 | const PerBlockIDStats &Stats = I->second; |
| 462 | std::cerr << " Num Instances: " << Stats.NumInstances << "\n"; |
| 463 | std::cerr << " Total Size: "; |
| 464 | PrintSize(Stats.NumBits); |
| 465 | std::cerr << "\n"; |
| 466 | std::cerr << " % of file: " |
| 467 | << Stats.NumBits/(double)BufferSizeBits*100 << "\n"; |
| 468 | if (Stats.NumInstances > 1) { |
| 469 | std::cerr << " Average Size: "; |
| 470 | PrintSize(Stats.NumBits/(double)Stats.NumInstances); |
| 471 | std::cerr << "\n"; |
| 472 | std::cerr << " Tot/Avg SubBlocks: " << Stats.NumSubBlocks << "/" |
| 473 | << Stats.NumSubBlocks/(double)Stats.NumInstances << "\n"; |
| 474 | std::cerr << " Tot/Avg Abbrevs: " << Stats.NumAbbrevs << "/" |
| 475 | << Stats.NumAbbrevs/(double)Stats.NumInstances << "\n"; |
| 476 | std::cerr << " Tot/Avg Records: " << Stats.NumRecords << "/" |
| 477 | << Stats.NumRecords/(double)Stats.NumInstances << "\n"; |
| 478 | } else { |
| 479 | std::cerr << " Num SubBlocks: " << Stats.NumSubBlocks << "\n"; |
| 480 | std::cerr << " Num Abbrevs: " << Stats.NumAbbrevs << "\n"; |
| 481 | std::cerr << " Num Records: " << Stats.NumRecords << "\n"; |
| 482 | } |
| 483 | if (Stats.NumRecords) |
| 484 | std::cerr << " % Abbrev Recs: " << (Stats.NumAbbreviatedRecords/ |
| 485 | (double)Stats.NumRecords)*100 << "\n"; |
| 486 | std::cerr << "\n"; |
| 487 | |
| 488 | // Print a histogram of the codes we see. |
| 489 | if (!NoHistogram && !Stats.CodeFreq.empty()) { |
| 490 | std::vector<std::pair<unsigned, unsigned> > FreqPairs; // <freq,code> |
| 491 | for (unsigned i = 0, e = Stats.CodeFreq.size(); i != e; ++i) |
| 492 | if (unsigned Freq = Stats.CodeFreq[i]) |
| 493 | FreqPairs.push_back(std::make_pair(Freq, i)); |
| 494 | std::stable_sort(FreqPairs.begin(), FreqPairs.end()); |
| 495 | std::reverse(FreqPairs.begin(), FreqPairs.end()); |
| 496 | |
| 497 | std::cerr << "\tCode Histogram:\n"; |
| 498 | for (unsigned i = 0, e = FreqPairs.size(); i != e; ++i) { |
| 499 | std::cerr << "\t\t" << FreqPairs[i].first << "\t"; |
| 500 | if (const char *CodeName = GetCodeName(FreqPairs[i].second, I->first)) |
| 501 | std::cerr << CodeName << "\n"; |
| 502 | else |
| 503 | std::cerr << "UnknownCode" << FreqPairs[i].second << "\n"; |
| 504 | } |
| 505 | std::cerr << "\n"; |
| 506 | |
| 507 | } |
| 508 | } |
| 509 | return 0; |
| 510 | } |
| 511 | |
| 512 | |
| 513 | int main(int argc, char **argv) { |
Chris Lattner | e6012df | 2009-03-06 05:34:10 +0000 | [diff] [blame] | 514 | // Print a stack trace if we signal out. |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 515 | sys::PrintStackTraceOnErrorSignal(); |
Chris Lattner | e6012df | 2009-03-06 05:34:10 +0000 | [diff] [blame] | 516 | PrettyStackTraceProgram X(argc, argv); |
| 517 | llvm_shutdown_obj Y; // Call llvm_shutdown() on exit. |
| 518 | cl::ParseCommandLineOptions(argc, argv, "llvm-bcanalyzer file analyzer\n"); |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 519 | |
| 520 | return AnalyzeBitcode(); |
| 521 | } |