blob: e220ffa09599a13813311de1f43ffe7c247cdae4 [file] [log] [blame]
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001//===-- llvm-bcanalyzer.cpp - Bitcode Analyzer --------------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattner5f5a5732007-12-29 20:44:31 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00007//
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 Lattnerabd0e442009-04-06 20:54:32 +000033#include "llvm/Bitcode/ReaderWriter.h"
Dan Gohmanf17a25c2007-07-18 16:29:46 +000034#include "llvm/Support/CommandLine.h"
35#include "llvm/Support/ManagedStatic.h"
36#include "llvm/Support/MemoryBuffer.h"
Chris Lattnere6012df2009-03-06 05:34:10 +000037#include "llvm/Support/PrettyStackTrace.h"
Dan Gohmanf17a25c2007-07-18 16:29:46 +000038#include "llvm/System/Signals.h"
39#include <map>
40#include <fstream>
41#include <iostream>
42#include <algorithm>
43using namespace llvm;
44
45static cl::opt<std::string>
46 InputFilename(cl::Positional, cl::desc("<input bitcode>"), cl::init("-"));
47
48static cl::opt<std::string>
49 OutputFilename("-o", cl::init("-"), cl::desc("<output file>"));
50
51static cl::opt<bool> Dump("dump", cl::desc("Dump low level bitcode trace"));
52
53//===----------------------------------------------------------------------===//
54// Bitcode specific analysis.
55//===----------------------------------------------------------------------===//
56
57static cl::opt<bool> NoHistogram("disable-histogram",
58 cl::desc("Do not print per-code histogram"));
59
60static cl::opt<bool>
61NonSymbolic("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.
67static enum {
68 UnknownBitstream,
69 LLVMIRBitstream
70} CurStreamType;
71
72
73/// GetBlockName - Return a symbolic block name if known, otherwise return
74/// null.
Chris Lattner71101322009-04-26 22:21:57 +000075static const char *GetBlockName(unsigned BlockID,
76 const BitstreamReader &StreamFile) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +000077 // Standard blocks for all bitcode files.
78 if (BlockID < bitc::FIRST_APPLICATION_BLOCKID) {
79 if (BlockID == bitc::BLOCKINFO_BLOCK_ID)
80 return "BLOCKINFO_BLOCK";
81 return 0;
82 }
83
Chris Lattner71101322009-04-26 22:21:57 +000084 // Check to see if we have a blockinfo record for this block, with a name.
85 if (const BitstreamReader::BlockInfo *Info =
86 StreamFile.getBlockInfo(BlockID)) {
87 if (!Info->Name.empty())
88 return Info->Name.c_str();
89 }
90
91
Dan Gohmanf17a25c2007-07-18 16:29:46 +000092 if (CurStreamType != LLVMIRBitstream) return 0;
93
94 switch (BlockID) {
95 default: return 0;
96 case bitc::MODULE_BLOCK_ID: return "MODULE_BLOCK";
97 case bitc::PARAMATTR_BLOCK_ID: return "PARAMATTR_BLOCK";
98 case bitc::TYPE_BLOCK_ID: return "TYPE_BLOCK";
99 case bitc::CONSTANTS_BLOCK_ID: return "CONSTANTS_BLOCK";
100 case bitc::FUNCTION_BLOCK_ID: return "FUNCTION_BLOCK";
101 case bitc::TYPE_SYMTAB_BLOCK_ID: return "TYPE_SYMTAB";
102 case bitc::VALUE_SYMTAB_BLOCK_ID: return "VALUE_SYMTAB";
103 }
104}
105
106/// GetCodeName - Return a symbolic code name if known, otherwise return
107/// null.
Chris Lattner71101322009-04-26 22:21:57 +0000108static const char *GetCodeName(unsigned CodeID, unsigned BlockID,
109 const BitstreamReader &StreamFile) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000110 // Standard blocks for all bitcode files.
111 if (BlockID < bitc::FIRST_APPLICATION_BLOCKID) {
112 if (BlockID == bitc::BLOCKINFO_BLOCK_ID) {
113 switch (CodeID) {
114 default: return 0;
Chris Lattner71101322009-04-26 22:21:57 +0000115 case bitc::BLOCKINFO_CODE_SETBID: return "SETBID";
116 case bitc::BLOCKINFO_CODE_BLOCKNAME: return "BLOCKNAME";
117 case bitc::BLOCKINFO_CODE_SETRECORDNAME: return "SETRECORDNAME";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000118 }
119 }
120 return 0;
121 }
122
Chris Lattner71101322009-04-26 22:21:57 +0000123 // Check to see if we have a blockinfo record for this record, with a name.
124 if (const BitstreamReader::BlockInfo *Info =
125 StreamFile.getBlockInfo(BlockID)) {
126 for (unsigned i = 0, e = Info->RecordNames.size(); i != e; ++i)
127 if (Info->RecordNames[i].first == CodeID)
128 return Info->RecordNames[i].second.c_str();
129 }
130
131
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000132 if (CurStreamType != LLVMIRBitstream) return 0;
133
134 switch (BlockID) {
135 default: return 0;
136 case bitc::MODULE_BLOCK_ID:
137 switch (CodeID) {
138 default: return 0;
139 case bitc::MODULE_CODE_VERSION: return "VERSION";
140 case bitc::MODULE_CODE_TRIPLE: return "TRIPLE";
141 case bitc::MODULE_CODE_DATALAYOUT: return "DATALAYOUT";
142 case bitc::MODULE_CODE_ASM: return "ASM";
143 case bitc::MODULE_CODE_SECTIONNAME: return "SECTIONNAME";
144 case bitc::MODULE_CODE_DEPLIB: return "DEPLIB";
145 case bitc::MODULE_CODE_GLOBALVAR: return "GLOBALVAR";
146 case bitc::MODULE_CODE_FUNCTION: return "FUNCTION";
147 case bitc::MODULE_CODE_ALIAS: return "ALIAS";
148 case bitc::MODULE_CODE_PURGEVALS: return "PURGEVALS";
Nick Lewyckyb90b8412008-11-07 14:52:51 +0000149 case bitc::MODULE_CODE_GCNAME: return "GCNAME";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000150 }
151 case bitc::PARAMATTR_BLOCK_ID:
152 switch (CodeID) {
153 default: return 0;
154 case bitc::PARAMATTR_CODE_ENTRY: return "ENTRY";
155 }
156 case bitc::TYPE_BLOCK_ID:
157 switch (CodeID) {
158 default: return 0;
Nick Lewyckyb90b8412008-11-07 14:52:51 +0000159 case bitc::TYPE_CODE_NUMENTRY: return "NUMENTRY";
160 case bitc::TYPE_CODE_VOID: return "VOID";
161 case bitc::TYPE_CODE_FLOAT: return "FLOAT";
162 case bitc::TYPE_CODE_DOUBLE: return "DOUBLE";
163 case bitc::TYPE_CODE_LABEL: return "LABEL";
164 case bitc::TYPE_CODE_OPAQUE: return "OPAQUE";
165 case bitc::TYPE_CODE_INTEGER: return "INTEGER";
166 case bitc::TYPE_CODE_POINTER: return "POINTER";
167 case bitc::TYPE_CODE_FUNCTION: return "FUNCTION";
168 case bitc::TYPE_CODE_STRUCT: return "STRUCT";
169 case bitc::TYPE_CODE_ARRAY: return "ARRAY";
170 case bitc::TYPE_CODE_VECTOR: return "VECTOR";
171 case bitc::TYPE_CODE_X86_FP80: return "X86_FP80";
172 case bitc::TYPE_CODE_FP128: return "FP128";
173 case bitc::TYPE_CODE_PPC_FP128: return "PPC_FP128";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000174 }
175
176 case bitc::CONSTANTS_BLOCK_ID:
177 switch (CodeID) {
178 default: return 0;
179 case bitc::CST_CODE_SETTYPE: return "SETTYPE";
180 case bitc::CST_CODE_NULL: return "NULL";
181 case bitc::CST_CODE_UNDEF: return "UNDEF";
182 case bitc::CST_CODE_INTEGER: return "INTEGER";
183 case bitc::CST_CODE_WIDE_INTEGER: return "WIDE_INTEGER";
184 case bitc::CST_CODE_FLOAT: return "FLOAT";
185 case bitc::CST_CODE_AGGREGATE: return "AGGREGATE";
186 case bitc::CST_CODE_STRING: return "STRING";
187 case bitc::CST_CODE_CSTRING: return "CSTRING";
188 case bitc::CST_CODE_CE_BINOP: return "CE_BINOP";
189 case bitc::CST_CODE_CE_CAST: return "CE_CAST";
190 case bitc::CST_CODE_CE_GEP: return "CE_GEP";
191 case bitc::CST_CODE_CE_SELECT: return "CE_SELECT";
192 case bitc::CST_CODE_CE_EXTRACTELT: return "CE_EXTRACTELT";
193 case bitc::CST_CODE_CE_INSERTELT: return "CE_INSERTELT";
194 case bitc::CST_CODE_CE_SHUFFLEVEC: return "CE_SHUFFLEVEC";
195 case bitc::CST_CODE_CE_CMP: return "CE_CMP";
196 case bitc::CST_CODE_INLINEASM: return "INLINEASM";
197 }
198 case bitc::FUNCTION_BLOCK_ID:
199 switch (CodeID) {
200 default: return 0;
201 case bitc::FUNC_CODE_DECLAREBLOCKS: return "DECLAREBLOCKS";
202
203 case bitc::FUNC_CODE_INST_BINOP: return "INST_BINOP";
204 case bitc::FUNC_CODE_INST_CAST: return "INST_CAST";
205 case bitc::FUNC_CODE_INST_GEP: return "INST_GEP";
206 case bitc::FUNC_CODE_INST_SELECT: return "INST_SELECT";
207 case bitc::FUNC_CODE_INST_EXTRACTELT: return "INST_EXTRACTELT";
208 case bitc::FUNC_CODE_INST_INSERTELT: return "INST_INSERTELT";
209 case bitc::FUNC_CODE_INST_SHUFFLEVEC: return "INST_SHUFFLEVEC";
210 case bitc::FUNC_CODE_INST_CMP: return "INST_CMP";
211
212 case bitc::FUNC_CODE_INST_RET: return "INST_RET";
213 case bitc::FUNC_CODE_INST_BR: return "INST_BR";
214 case bitc::FUNC_CODE_INST_SWITCH: return "INST_SWITCH";
215 case bitc::FUNC_CODE_INST_INVOKE: return "INST_INVOKE";
216 case bitc::FUNC_CODE_INST_UNWIND: return "INST_UNWIND";
217 case bitc::FUNC_CODE_INST_UNREACHABLE: return "INST_UNREACHABLE";
218
219 case bitc::FUNC_CODE_INST_PHI: return "INST_PHI";
220 case bitc::FUNC_CODE_INST_MALLOC: return "INST_MALLOC";
221 case bitc::FUNC_CODE_INST_FREE: return "INST_FREE";
222 case bitc::FUNC_CODE_INST_ALLOCA: return "INST_ALLOCA";
223 case bitc::FUNC_CODE_INST_LOAD: return "INST_LOAD";
224 case bitc::FUNC_CODE_INST_STORE: return "INST_STORE";
225 case bitc::FUNC_CODE_INST_CALL: return "INST_CALL";
226 case bitc::FUNC_CODE_INST_VAARG: return "INST_VAARG";
Christopher Lamb44d62f62007-12-11 08:59:05 +0000227 case bitc::FUNC_CODE_INST_STORE2: return "INST_STORE2";
Nick Lewycky2c3eced2008-03-01 21:47:06 +0000228 case bitc::FUNC_CODE_INST_GETRESULT: return "INST_GETRESULT";
Nick Lewyckyb90b8412008-11-07 14:52:51 +0000229 case bitc::FUNC_CODE_INST_EXTRACTVAL: return "INST_EXTRACTVAL";
230 case bitc::FUNC_CODE_INST_INSERTVAL: return "INST_INSERTVAL";
231 case bitc::FUNC_CODE_INST_CMP2: return "INST_CMP2";
232 case bitc::FUNC_CODE_INST_VSELECT: return "INST_VSELECT";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000233 }
234 case bitc::TYPE_SYMTAB_BLOCK_ID:
235 switch (CodeID) {
236 default: return 0;
237 case bitc::TST_CODE_ENTRY: return "ENTRY";
238 }
239 case bitc::VALUE_SYMTAB_BLOCK_ID:
240 switch (CodeID) {
241 default: return 0;
242 case bitc::VST_CODE_ENTRY: return "ENTRY";
243 case bitc::VST_CODE_BBENTRY: return "BBENTRY";
244 }
245 }
246}
247
248
249struct PerBlockIDStats {
250 /// NumInstances - This the number of times this block ID has been seen.
251 unsigned NumInstances;
252
253 /// NumBits - The total size in bits of all of these blocks.
254 uint64_t NumBits;
255
256 /// NumSubBlocks - The total number of blocks these blocks contain.
257 unsigned NumSubBlocks;
258
259 /// NumAbbrevs - The total number of abbreviations.
260 unsigned NumAbbrevs;
261
262 /// NumRecords - The total number of records these blocks contain, and the
263 /// number that are abbreviated.
264 unsigned NumRecords, NumAbbreviatedRecords;
265
266 /// CodeFreq - Keep track of the number of times we see each code.
267 std::vector<unsigned> CodeFreq;
268
269 PerBlockIDStats()
270 : NumInstances(0), NumBits(0),
271 NumSubBlocks(0), NumAbbrevs(0), NumRecords(0), NumAbbreviatedRecords(0) {}
272};
273
274static std::map<unsigned, PerBlockIDStats> BlockIDStats;
275
276
277
278/// Error - All bitcode analysis errors go through this function, making this a
279/// good place to breakpoint if debugging.
280static bool Error(const std::string &Err) {
281 std::cerr << Err << "\n";
282 return true;
283}
284
285/// ParseBlock - Read a block, updating statistics, etc.
Chris Lattner25a6abf2009-04-26 20:59:02 +0000286static bool ParseBlock(BitstreamCursor &Stream, unsigned IndentLevel) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000287 std::string Indent(IndentLevel*2, ' ');
288 uint64_t BlockBitStart = Stream.GetCurrentBitNo();
289 unsigned BlockID = Stream.ReadSubBlockID();
290
291 // Get the statistics for this BlockID.
292 PerBlockIDStats &BlockStats = BlockIDStats[BlockID];
293
294 BlockStats.NumInstances++;
295
296 // BLOCKINFO is a special part of the stream.
297 if (BlockID == bitc::BLOCKINFO_BLOCK_ID) {
298 if (Dump) std::cerr << Indent << "<BLOCKINFO_BLOCK/>\n";
299 if (Stream.ReadBlockInfoBlock())
300 return Error("Malformed BlockInfoBlock");
301 uint64_t BlockBitEnd = Stream.GetCurrentBitNo();
302 BlockStats.NumBits += BlockBitEnd-BlockBitStart;
303 return false;
304 }
305
306 unsigned NumWords = 0;
307 if (Stream.EnterSubBlock(BlockID, &NumWords))
308 return Error("Malformed block record");
309
310 const char *BlockName = 0;
311 if (Dump) {
312 std::cerr << Indent << "<";
Chris Lattner71101322009-04-26 22:21:57 +0000313 if ((BlockName = GetBlockName(BlockID, *Stream.getBitStreamReader())))
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000314 std::cerr << BlockName;
315 else
316 std::cerr << "UnknownBlock" << BlockID;
317
318 if (NonSymbolic && BlockName)
319 std::cerr << " BlockID=" << BlockID;
320
321 std::cerr << " NumWords=" << NumWords
322 << " BlockCodeSize=" << Stream.GetAbbrevIDWidth() << ">\n";
323 }
324
325 SmallVector<uint64_t, 64> Record;
326
327 // Read all the records for this block.
328 while (1) {
329 if (Stream.AtEndOfStream())
330 return Error("Premature end of bitstream");
331
332 // Read the code for this record.
333 unsigned AbbrevID = Stream.ReadCode();
334 switch (AbbrevID) {
335 case bitc::END_BLOCK: {
336 if (Stream.ReadBlockEnd())
337 return Error("Error at end of block");
338 uint64_t BlockBitEnd = Stream.GetCurrentBitNo();
339 BlockStats.NumBits += BlockBitEnd-BlockBitStart;
340 if (Dump) {
341 std::cerr << Indent << "</";
342 if (BlockName)
343 std::cerr << BlockName << ">\n";
344 else
345 std::cerr << "UnknownBlock" << BlockID << ">\n";
346 }
347 return false;
348 }
349 case bitc::ENTER_SUBBLOCK: {
350 uint64_t SubBlockBitStart = Stream.GetCurrentBitNo();
351 if (ParseBlock(Stream, IndentLevel+1))
352 return true;
353 ++BlockStats.NumSubBlocks;
354 uint64_t SubBlockBitEnd = Stream.GetCurrentBitNo();
355
356 // Don't include subblock sizes in the size of this block.
357 BlockBitStart += SubBlockBitEnd-SubBlockBitStart;
358 break;
359 }
360 case bitc::DEFINE_ABBREV:
361 Stream.ReadAbbrevRecord();
362 ++BlockStats.NumAbbrevs;
363 break;
364 default:
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000365 Record.clear();
Chris Lattner7cbe0072009-04-06 22:44:40 +0000366
367 ++BlockStats.NumRecords;
Chris Lattnerc1894162009-04-07 02:56:46 +0000368 if (AbbrevID != bitc::UNABBREV_RECORD)
Chris Lattner7cbe0072009-04-06 22:44:40 +0000369 ++BlockStats.NumAbbreviatedRecords;
Chris Lattner7cbe0072009-04-06 22:44:40 +0000370
Chris Lattner7cbe0072009-04-06 22:44:40 +0000371 const char *BlobStart = 0;
372 unsigned BlobLen = 0;
Chris Lattnerc1894162009-04-07 02:56:46 +0000373 unsigned Code = Stream.ReadRecord(AbbrevID, Record, BlobStart, BlobLen);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000374
375 // Increment the # occurrences of this code.
376 if (BlockStats.CodeFreq.size() <= Code)
377 BlockStats.CodeFreq.resize(Code+1);
378 BlockStats.CodeFreq[Code]++;
379
380 if (Dump) {
381 std::cerr << Indent << " <";
Chris Lattner71101322009-04-26 22:21:57 +0000382 if (const char *CodeName =
383 GetCodeName(Code, BlockID, *Stream.getBitStreamReader()))
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000384 std::cerr << CodeName;
385 else
386 std::cerr << "UnknownCode" << Code;
Chris Lattner71101322009-04-26 22:21:57 +0000387 if (NonSymbolic &&
388 GetCodeName(Code, BlockID, *Stream.getBitStreamReader()))
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000389 std::cerr << " codeid=" << Code;
390 if (AbbrevID != bitc::UNABBREV_RECORD)
391 std::cerr << " abbrevid=" << AbbrevID;
392
393 for (unsigned i = 0, e = Record.size(); i != e; ++i)
394 std::cerr << " op" << i << "=" << (int64_t)Record[i];
395
Chris Lattnerc1894162009-04-07 02:56:46 +0000396 std::cerr << "/>";
397
398 if (BlobStart) {
399 std::cerr << " blob data = ";
400 bool BlobIsPrintable = true;
401 for (unsigned i = 0; i != BlobLen; ++i)
402 if (!isprint(BlobStart[i])) {
403 BlobIsPrintable = false;
404 break;
405 }
406
407 if (BlobIsPrintable)
408 std::cerr << "'" << std::string(BlobStart, BlobStart+BlobLen) <<"'";
409 else
410 std::cerr << "unprintable, " << BlobLen << " bytes.";
411 }
412
413 std::cerr << "\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000414 }
415
416 break;
417 }
418 }
419}
420
421static void PrintSize(double Bits) {
422 std::cerr << Bits << "b/" << Bits/8 << "B/" << Bits/32 << "W";
423}
424
425
426/// AnalyzeBitcode - Analyze the bitcode file specified by InputFilename.
427static int AnalyzeBitcode() {
428 // Read the input file.
Chris Lattnerabd0e442009-04-06 20:54:32 +0000429 MemoryBuffer *MemBuf = MemoryBuffer::getFileOrSTDIN(InputFilename.c_str());
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000430
Chris Lattnerabd0e442009-04-06 20:54:32 +0000431 if (MemBuf == 0)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000432 return Error("Error reading '" + InputFilename + "'.");
433
Chris Lattnerabd0e442009-04-06 20:54:32 +0000434 if (MemBuf->getBufferSize() & 3)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000435 return Error("Bitcode stream should be a multiple of 4 bytes in length");
436
Chris Lattnerabd0e442009-04-06 20:54:32 +0000437 unsigned char *BufPtr = (unsigned char *)MemBuf->getBufferStart();
438 unsigned char *EndBufPtr = BufPtr+MemBuf->getBufferSize();
439
440 // If we have a wrapper header, parse it and ignore the non-bc file contents.
441 // The magic number is 0x0B17C0DE stored in little endian.
442 if (isBitcodeWrapper(BufPtr, EndBufPtr))
443 if (SkipBitcodeWrapperHeader(BufPtr, EndBufPtr))
444 return Error("Invalid bitcode wrapper header");
445
Chris Lattner25a6abf2009-04-26 20:59:02 +0000446 BitstreamReader StreamFile(BufPtr, EndBufPtr);
447 BitstreamCursor Stream(StreamFile);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000448
449 // Read the stream signature.
450 char Signature[6];
451 Signature[0] = Stream.Read(8);
452 Signature[1] = Stream.Read(8);
453 Signature[2] = Stream.Read(4);
454 Signature[3] = Stream.Read(4);
455 Signature[4] = Stream.Read(4);
456 Signature[5] = Stream.Read(4);
457
458 // Autodetect the file contents, if it is one we know.
459 CurStreamType = UnknownBitstream;
460 if (Signature[0] == 'B' && Signature[1] == 'C' &&
461 Signature[2] == 0x0 && Signature[3] == 0xC &&
462 Signature[4] == 0xE && Signature[5] == 0xD)
463 CurStreamType = LLVMIRBitstream;
464
465 unsigned NumTopBlocks = 0;
466
467 // Parse the top-level structure. We only allow blocks at the top-level.
468 while (!Stream.AtEndOfStream()) {
469 unsigned Code = Stream.ReadCode();
470 if (Code != bitc::ENTER_SUBBLOCK)
471 return Error("Invalid record at top-level");
472
473 if (ParseBlock(Stream, 0))
474 return true;
475 ++NumTopBlocks;
476 }
477
478 if (Dump) std::cerr << "\n\n";
479
Chris Lattnerabd0e442009-04-06 20:54:32 +0000480 uint64_t BufferSizeBits = (EndBufPtr-BufPtr)*CHAR_BIT;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000481 // Print a summary of the read file.
482 std::cerr << "Summary of " << InputFilename << ":\n";
483 std::cerr << " Total size: ";
484 PrintSize(BufferSizeBits);
485 std::cerr << "\n";
486 std::cerr << " Stream type: ";
487 switch (CurStreamType) {
488 default: assert(0 && "Unknown bitstream type");
489 case UnknownBitstream: std::cerr << "unknown\n"; break;
490 case LLVMIRBitstream: std::cerr << "LLVM IR\n"; break;
491 }
492 std::cerr << " # Toplevel Blocks: " << NumTopBlocks << "\n";
493 std::cerr << "\n";
494
495 // Emit per-block stats.
496 std::cerr << "Per-block Summary:\n";
497 for (std::map<unsigned, PerBlockIDStats>::iterator I = BlockIDStats.begin(),
498 E = BlockIDStats.end(); I != E; ++I) {
499 std::cerr << " Block ID #" << I->first;
Chris Lattner71101322009-04-26 22:21:57 +0000500 if (const char *BlockName = GetBlockName(I->first, StreamFile))
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000501 std::cerr << " (" << BlockName << ")";
502 std::cerr << ":\n";
503
504 const PerBlockIDStats &Stats = I->second;
505 std::cerr << " Num Instances: " << Stats.NumInstances << "\n";
506 std::cerr << " Total Size: ";
507 PrintSize(Stats.NumBits);
508 std::cerr << "\n";
509 std::cerr << " % of file: "
510 << Stats.NumBits/(double)BufferSizeBits*100 << "\n";
511 if (Stats.NumInstances > 1) {
512 std::cerr << " Average Size: ";
513 PrintSize(Stats.NumBits/(double)Stats.NumInstances);
514 std::cerr << "\n";
515 std::cerr << " Tot/Avg SubBlocks: " << Stats.NumSubBlocks << "/"
516 << Stats.NumSubBlocks/(double)Stats.NumInstances << "\n";
517 std::cerr << " Tot/Avg Abbrevs: " << Stats.NumAbbrevs << "/"
518 << Stats.NumAbbrevs/(double)Stats.NumInstances << "\n";
519 std::cerr << " Tot/Avg Records: " << Stats.NumRecords << "/"
520 << Stats.NumRecords/(double)Stats.NumInstances << "\n";
521 } else {
522 std::cerr << " Num SubBlocks: " << Stats.NumSubBlocks << "\n";
523 std::cerr << " Num Abbrevs: " << Stats.NumAbbrevs << "\n";
524 std::cerr << " Num Records: " << Stats.NumRecords << "\n";
525 }
526 if (Stats.NumRecords)
527 std::cerr << " % Abbrev Recs: " << (Stats.NumAbbreviatedRecords/
528 (double)Stats.NumRecords)*100 << "\n";
529 std::cerr << "\n";
530
531 // Print a histogram of the codes we see.
532 if (!NoHistogram && !Stats.CodeFreq.empty()) {
533 std::vector<std::pair<unsigned, unsigned> > FreqPairs; // <freq,code>
534 for (unsigned i = 0, e = Stats.CodeFreq.size(); i != e; ++i)
535 if (unsigned Freq = Stats.CodeFreq[i])
536 FreqPairs.push_back(std::make_pair(Freq, i));
537 std::stable_sort(FreqPairs.begin(), FreqPairs.end());
538 std::reverse(FreqPairs.begin(), FreqPairs.end());
539
540 std::cerr << "\tCode Histogram:\n";
541 for (unsigned i = 0, e = FreqPairs.size(); i != e; ++i) {
542 std::cerr << "\t\t" << FreqPairs[i].first << "\t";
Chris Lattner71101322009-04-26 22:21:57 +0000543 if (const char *CodeName =
544 GetCodeName(FreqPairs[i].second, I->first, StreamFile))
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000545 std::cerr << CodeName << "\n";
546 else
547 std::cerr << "UnknownCode" << FreqPairs[i].second << "\n";
548 }
549 std::cerr << "\n";
550
551 }
552 }
553 return 0;
554}
555
556
557int main(int argc, char **argv) {
Chris Lattnere6012df2009-03-06 05:34:10 +0000558 // Print a stack trace if we signal out.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000559 sys::PrintStackTraceOnErrorSignal();
Chris Lattnere6012df2009-03-06 05:34:10 +0000560 PrettyStackTraceProgram X(argc, argv);
561 llvm_shutdown_obj Y; // Call llvm_shutdown() on exit.
562 cl::ParseCommandLineOptions(argc, argv, "llvm-bcanalyzer file analyzer\n");
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000563
564 return AnalyzeBitcode();
565}