1 //===-- Writer.cpp - Library for converting LLVM code to C ----------------===//
3 // This library implements the functionality defined in llvm/Assembly/CWriter.h
5 // TODO : Recursive types.
7 //===-----------------------------------------------------------------------==//
9 #include "llvm/Assembly/CWriter.h"
10 #include "llvm/Constants.h"
11 #include "llvm/DerivedTypes.h"
12 #include "llvm/Module.h"
13 #include "llvm/iMemory.h"
14 #include "llvm/iTerminators.h"
15 #include "llvm/iPHINode.h"
16 #include "llvm/iOther.h"
17 #include "llvm/iOperators.h"
18 #include "llvm/SymbolTable.h"
19 #include "llvm/SlotCalculator.h"
20 #include "llvm/Support/InstVisitor.h"
21 #include "llvm/Support/InstIterator.h"
22 #include "Support/StringExtras.h"
23 #include "Support/STLExtras.h"
31 class CWriter : public InstVisitor<CWriter> {
33 SlotCalculator &Table;
34 const Module *TheModule;
35 map<const Type *, string> TypeNames;
36 std::set<const Value*> MangledGlobals;
38 inline CWriter(ostream &o, SlotCalculator &Tab, const Module *M)
39 : Out(o), Table(Tab), TheModule(M) {
42 inline void write(Module *M) { printModule(M); }
44 ostream &printType(const Type *Ty, const string &VariableName = "",
45 bool IgnoreName = false);
47 void writeOperand(Value *Operand);
48 void writeOperandInternal(Value *Operand);
50 string getValueName(const Value *V);
53 void printModule(Module *M);
54 void printSymbolTable(const SymbolTable &ST);
55 void printGlobal(const GlobalVariable *GV);
56 void printFunctionSignature(const Function *F, bool Prototype);
58 void printFunction(Function *);
60 void printConstant(Constant *CPV);
61 void printConstantArray(ConstantArray *CPA);
63 // isInlinableInst - Attempt to inline instructions into their uses to build
64 // trees as much as possible. To do this, we have to consistently decide
65 // what is acceptable to inline, so that variable declarations don't get
66 // printed and an extra copy of the expr is not emitted.
68 static bool isInlinableInst(const Instruction &I) {
69 // Must be an expression, must be used exactly once. If it is dead, we
70 // emit it inline where it would go.
71 if (I.getType() == Type::VoidTy || I.use_size() != 1 ||
72 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I))
75 // Only inline instruction it it's use is in the same BB as the inst.
76 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
79 // Instruction visitation functions
80 friend class InstVisitor<CWriter>;
82 void visitReturnInst(ReturnInst &I);
83 void visitBranchInst(BranchInst &I);
85 void visitPHINode(PHINode &I) {}
86 void visitBinaryOperator(Instruction &I);
88 void visitCastInst (CastInst &I);
89 void visitCallInst (CallInst &I);
90 void visitShiftInst(ShiftInst &I) { visitBinaryOperator(I); }
92 void visitMallocInst(MallocInst &I);
93 void visitAllocaInst(AllocaInst &I);
94 void visitFreeInst (FreeInst &I);
95 void visitLoadInst (LoadInst &I);
96 void visitStoreInst (StoreInst &I);
97 void visitGetElementPtrInst(GetElementPtrInst &I);
99 void visitInstruction(Instruction &I) {
100 std::cerr << "C Writer does not know about " << I;
104 void outputLValue(Instruction *I) {
105 Out << " " << getValueName(I) << " = ";
107 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
109 void printIndexingExpression(Value *Ptr, User::op_iterator I,
110 User::op_iterator E);
114 // We dont want identifier names with ., space, - in them.
115 // So we replace them with _
116 static string makeNameProper(string x) {
118 for (string::iterator sI = x.begin(), sEnd = x.end(); sI != sEnd; sI++)
120 case '.': tmp += "d_"; break;
121 case ' ': tmp += "s_"; break;
122 case '-': tmp += "D_"; break;
129 string CWriter::getValueName(const Value *V) {
130 if (V->hasName()) { // Print out the label if it exists...
131 if (isa<GlobalValue>(V) && // Do not mangle globals...
132 cast<GlobalValue>(V)->hasExternalLinkage() && // Unless it's internal or
133 !MangledGlobals.count(V)) // Unless the name would collide if we don't
134 return makeNameProper(V->getName());
136 return "l" + utostr(V->getType()->getUniqueID()) + "_" +
137 makeNameProper(V->getName());
140 int Slot = Table.getValSlot(V);
141 assert(Slot >= 0 && "Invalid value!");
142 return "ltmp_" + itostr(Slot) + "_" + utostr(V->getType()->getUniqueID());
145 // Pass the Type* and the variable name and this prints out the variable
148 ostream &CWriter::printType(const Type *Ty, const string &NameSoFar,
149 bool IgnoreName = false) {
150 if (Ty->isPrimitiveType())
151 switch (Ty->getPrimitiveID()) {
152 case Type::VoidTyID: return Out << "void " << NameSoFar;
153 case Type::BoolTyID: return Out << "bool " << NameSoFar;
154 case Type::UByteTyID: return Out << "unsigned char " << NameSoFar;
155 case Type::SByteTyID: return Out << "signed char " << NameSoFar;
156 case Type::UShortTyID: return Out << "unsigned short " << NameSoFar;
157 case Type::ShortTyID: return Out << "short " << NameSoFar;
158 case Type::UIntTyID: return Out << "unsigned " << NameSoFar;
159 case Type::IntTyID: return Out << "int " << NameSoFar;
160 case Type::ULongTyID: return Out << "unsigned long long " << NameSoFar;
161 case Type::LongTyID: return Out << "signed long long " << NameSoFar;
162 case Type::FloatTyID: return Out << "float " << NameSoFar;
163 case Type::DoubleTyID: return Out << "double " << NameSoFar;
165 std::cerr << "Unknown primitive type: " << Ty << "\n";
169 // Check to see if the type is named.
171 map<const Type *, string>::iterator I = TypeNames.find(Ty);
172 if (I != TypeNames.end()) {
173 return Out << I->second << " " << NameSoFar;
177 switch (Ty->getPrimitiveID()) {
178 case Type::FunctionTyID: {
179 const FunctionType *MTy = cast<FunctionType>(Ty);
180 printType(MTy->getReturnType(), "");
181 Out << " " << NameSoFar << " (";
183 for (FunctionType::ParamTypes::const_iterator
184 I = MTy->getParamTypes().begin(),
185 E = MTy->getParamTypes().end(); I != E; ++I) {
186 if (I != MTy->getParamTypes().begin())
190 if (MTy->isVarArg()) {
191 if (!MTy->getParamTypes().empty())
197 case Type::StructTyID: {
198 const StructType *STy = cast<StructType>(Ty);
199 Out << NameSoFar + " {\n";
201 for (StructType::ElementTypes::const_iterator
202 I = STy->getElementTypes().begin(),
203 E = STy->getElementTypes().end(); I != E; ++I) {
205 printType(*I, "field" + utostr(Idx++));
211 case Type::PointerTyID: {
212 const PointerType *PTy = cast<PointerType>(Ty);
213 return printType(PTy->getElementType(), "(*" + NameSoFar + ")");
216 case Type::ArrayTyID: {
217 const ArrayType *ATy = cast<ArrayType>(Ty);
218 unsigned NumElements = ATy->getNumElements();
219 return printType(ATy->getElementType(),
220 NameSoFar + "[" + utostr(NumElements) + "]");
223 assert(0 && "Unhandled case in getTypeProps!");
230 void CWriter::printConstantArray(ConstantArray *CPA) {
232 // As a special case, print the array as a string if it is an array of
233 // ubytes or an array of sbytes with positive values.
235 const Type *ETy = CPA->getType()->getElementType();
236 bool isString = (ETy == Type::SByteTy || ETy == Type::UByteTy);
238 // Make sure the last character is a null char, as automatically added by C
239 if (CPA->getNumOperands() == 0 ||
240 !cast<Constant>(*(CPA->op_end()-1))->isNullValue())
245 // Do not include the last character, which we know is null
246 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
247 unsigned char C = (ETy == Type::SByteTy) ?
248 (unsigned char)cast<ConstantSInt>(CPA->getOperand(i))->getValue() :
249 (unsigned char)cast<ConstantUInt>(CPA->getOperand(i))->getValue();
255 case '\n': Out << "\\n"; break;
256 case '\t': Out << "\\t"; break;
257 case '\r': Out << "\\r"; break;
258 case '\v': Out << "\\v"; break;
259 case '\a': Out << "\\a"; break;
262 Out << ( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A');
263 Out << ((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A');
271 if (CPA->getNumOperands()) {
273 printConstant(cast<Constant>(CPA->getOperand(0)));
274 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
276 printConstant(cast<Constant>(CPA->getOperand(i)));
284 // printConstant - The LLVM Constant to C Constant converter.
285 void CWriter::printConstant(Constant *CPV) {
286 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
287 switch (CE->getOpcode()) {
288 case Instruction::Cast:
290 printType(CPV->getType());
292 printConstant(cast<Constant>(CPV->getOperand(0)));
296 case Instruction::GetElementPtr:
298 printIndexingExpression(CPV->getOperand(0),
299 CPV->op_begin()+1, CPV->op_end());
302 case Instruction::Add:
304 printConstant(cast<Constant>(CPV->getOperand(0)));
306 printConstant(cast<Constant>(CPV->getOperand(1)));
309 case Instruction::Sub:
311 printConstant(cast<Constant>(CPV->getOperand(0)));
313 printConstant(cast<Constant>(CPV->getOperand(1)));
318 std::cerr << "CWriter Error: Unhandled constant expression: "
324 switch (CPV->getType()->getPrimitiveID()) {
326 Out << (CPV == ConstantBool::False ? "0" : "1"); break;
327 case Type::SByteTyID:
328 case Type::ShortTyID:
330 Out << cast<ConstantSInt>(CPV)->getValue(); break;
332 Out << cast<ConstantSInt>(CPV)->getValue() << "ll"; break;
334 case Type::UByteTyID:
335 case Type::UShortTyID:
336 Out << cast<ConstantUInt>(CPV)->getValue(); break;
338 Out << cast<ConstantUInt>(CPV)->getValue() << "u"; break;
339 case Type::ULongTyID:
340 Out << cast<ConstantUInt>(CPV)->getValue() << "ull"; break;
342 case Type::FloatTyID:
343 case Type::DoubleTyID:
344 Out << cast<ConstantFP>(CPV)->getValue(); break;
346 case Type::ArrayTyID:
347 printConstantArray(cast<ConstantArray>(CPV));
350 case Type::StructTyID: {
352 if (CPV->getNumOperands()) {
354 printConstant(cast<Constant>(CPV->getOperand(0)));
355 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
357 printConstant(cast<Constant>(CPV->getOperand(i)));
364 case Type::PointerTyID:
365 if (isa<ConstantPointerNull>(CPV)) {
367 printType(CPV->getType(), "");
370 } else if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(CPV)) {
371 writeOperand(CPR->getValue());
376 std::cerr << "Unknown constant type: " << CPV << "\n";
381 void CWriter::writeOperandInternal(Value *Operand) {
382 if (Instruction *I = dyn_cast<Instruction>(Operand))
383 if (isInlinableInst(*I)) {
384 // Should we inline this instruction to build a tree?
391 if (Operand->hasName()) {
392 Out << getValueName(Operand);
393 } else if (Constant *CPV = dyn_cast<Constant>(Operand)) {
396 int Slot = Table.getValSlot(Operand);
397 assert(Slot >= 0 && "Malformed LLVM!");
398 Out << "ltmp_" << Slot << "_" << Operand->getType()->getUniqueID();
402 void CWriter::writeOperand(Value *Operand) {
403 if (isa<GlobalVariable>(Operand))
404 Out << "(&"; // Global variables are references as their addresses by llvm
406 writeOperandInternal(Operand);
408 if (isa<GlobalVariable>(Operand))
412 void CWriter::printModule(Module *M) {
413 // Calculate which global values have names that will collide when we throw
414 // away type information.
415 { // Scope to delete the FoundNames set when we are done with it...
416 std::set<string> FoundNames;
417 for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
418 if (I->hasName()) // If the global has a name...
419 if (FoundNames.count(I->getName())) // And the name is already used
420 MangledGlobals.insert(I); // Mangle the name
422 FoundNames.insert(I->getName()); // Otherwise, keep track of name
424 for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
425 if (I->hasName()) // If the global has a name...
426 if (FoundNames.count(I->getName())) // And the name is already used
427 MangledGlobals.insert(I); // Mangle the name
429 FoundNames.insert(I->getName()); // Otherwise, keep track of name
433 // printing stdlib inclusion
434 // Out << "#include <stdlib.h>\n";
436 // get declaration for alloca
437 Out << "/* Provide Declarations */\n"
438 << "#include <malloc.h>\n"
439 << "#include <alloca.h>\n\n"
441 // Provide a definition for null if one does not already exist.
442 << "#ifndef NULL\n#define NULL 0\n#endif\n\n"
443 << "typedef unsigned char bool;\n"
445 << "\n\n/* Global Declarations */\n";
447 // First output all the declarations for the program, because C requires
448 // Functions & globals to be declared before they are used.
451 // Loop over the symbol table, emitting all named constants...
452 if (M->hasSymbolTable())
453 printSymbolTable(*M->getSymbolTable());
455 // Global variable declarations...
457 Out << "\n/* Global Variable Declarations */\n";
458 for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I) {
459 Out << (I->hasExternalLinkage() ? "extern " : "static ");
460 printType(I->getType()->getElementType(), getValueName(I));
465 // Function declarations
467 Out << "\n/* Function Declarations */\n";
468 for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) {
469 printFunctionSignature(I, true);
474 // Output the global variable contents...
476 Out << "\n\n/* Global Data */\n";
477 for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I) {
478 if (I->hasInternalLinkage()) Out << "static ";
479 printType(I->getType()->getElementType(), getValueName(I));
481 if (I->hasInitializer()) {
483 writeOperand(I->getInitializer());
489 // Output all of the functions...
491 Out << "\n\n/* Function Bodies */\n";
492 for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
498 // printSymbolTable - Run through symbol table looking for named constants
499 // if a named constant is found, emit it's declaration...
500 // Assuming that symbol table has only types and constants.
501 void CWriter::printSymbolTable(const SymbolTable &ST) {
502 for (SymbolTable::const_iterator TI = ST.begin(); TI != ST.end(); ++TI) {
503 SymbolTable::type_const_iterator I = ST.type_begin(TI->first);
504 SymbolTable::type_const_iterator End = ST.type_end(TI->first);
506 for (; I != End; ++I)
507 if (const Type *Ty = dyn_cast<StructType>(I->second)) {
508 string Name = "struct l_" + makeNameProper(I->first);
509 Out << Name << ";\n";
510 TypeNames.insert(std::make_pair(Ty, Name));
516 for (SymbolTable::const_iterator TI = ST.begin(); TI != ST.end(); ++TI) {
517 SymbolTable::type_const_iterator I = ST.type_begin(TI->first);
518 SymbolTable::type_const_iterator End = ST.type_end(TI->first);
520 for (; I != End; ++I) {
521 const Value *V = I->second;
522 if (const Type *Ty = dyn_cast<Type>(V)) {
523 string Name = "l_" + makeNameProper(I->first);
524 if (isa<StructType>(Ty))
525 Name = "struct " + makeNameProper(Name);
529 printType(Ty, Name, true);
537 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
538 if (F->hasInternalLinkage()) Out << "static ";
540 // Loop over the arguments, printing them...
541 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
543 // Print out the return type and name...
544 printType(F->getReturnType());
545 Out << getValueName(F) << "(";
547 if (!F->isExternal()) {
550 if (F->abegin()->hasName() || !Prototype)
551 ArgName = getValueName(F->abegin());
553 printType(F->afront().getType(), ArgName);
555 for (Function::const_aiterator I = ++F->abegin(), E = F->aend();
558 if (I->hasName() || !Prototype)
559 ArgName = getValueName(I);
562 printType(I->getType(), ArgName);
566 // Loop over the arguments, printing them...
567 for (FunctionType::ParamTypes::const_iterator I =
568 FT->getParamTypes().begin(),
569 E = FT->getParamTypes().end(); I != E; ++I) {
570 if (I != FT->getParamTypes().begin()) Out << ", ";
575 // Finish printing arguments...
576 if (FT->isVarArg()) {
577 if (FT->getParamTypes().size()) Out << ", ";
578 Out << "..."; // Output varargs portion of signature!
584 void CWriter::printFunction(Function *F) {
585 if (F->isExternal()) return;
587 Table.incorporateFunction(F);
589 printFunctionSignature(F, false);
592 // print local variable information for the function
593 for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E; ++I)
594 if ((*I)->getType() != Type::VoidTy && !isInlinableInst(**I)) {
596 printType((*I)->getType(), getValueName(*I));
600 // print the basic blocks
601 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {
602 BasicBlock *Prev = BB->getPrev();
604 // Don't print the label for the basic block if there are no uses, or if the
605 // only terminator use is the precessor basic block's terminator. We have
606 // to scan the use list because PHI nodes use basic blocks too but do not
607 // require a label to be generated.
609 bool NeedsLabel = false;
610 for (Value::use_iterator UI = BB->use_begin(), UE = BB->use_end();
612 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(*UI))
613 if (TI != Prev->getTerminator()) {
618 if (NeedsLabel) Out << getValueName(BB) << ":\n";
620 // Output all of the instructions in the basic block...
621 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E; ++II){
622 if (!isInlinableInst(*II) && !isa<PHINode>(*II)) {
623 if (II->getType() != Type::VoidTy)
632 // Don't emit prefix or suffix for the terminator...
633 visit(*BB->getTerminator());
637 Table.purgeFunction();
640 // Specific Instruction type classes... note that all of the casts are
641 // neccesary because we use the instruction classes as opaque types...
643 void CWriter::visitReturnInst(ReturnInst &I) {
644 // Don't output a void return if this is the last basic block in the function
645 if (I.getNumOperands() == 0 &&
646 &*--I.getParent()->getParent()->end() == I.getParent() &&
647 !I.getParent()->size() == 1) {
652 if (I.getNumOperands()) {
654 writeOperand(I.getOperand(0));
659 static bool isGotoCodeNeccessary(BasicBlock *From, BasicBlock *To) {
660 // If PHI nodes need copies, we need the copy code...
661 if (isa<PHINode>(To->front()) ||
662 From->getNext() != To) // Not directly successor, need goto
665 // Otherwise we don't need the code.
669 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
671 for (BasicBlock::iterator I = Succ->begin();
672 PHINode *PN = dyn_cast<PHINode>(&*I); ++I) {
673 // now we have to do the printing
674 Out << string(Indent, ' ');
676 writeOperand(PN->getIncomingValue(PN->getBasicBlockIndex(CurBB)));
677 Out << "; /* for PHI node */\n";
680 if (CurBB->getNext() != Succ) {
681 Out << string(Indent, ' ') << " goto ";
687 // Brach instruction printing - Avoid printing out a brach to a basic block that
688 // immediately succeeds the current one.
690 void CWriter::visitBranchInst(BranchInst &I) {
691 if (I.isConditional()) {
692 if (isGotoCodeNeccessary(I.getParent(), I.getSuccessor(0))) {
694 writeOperand(I.getCondition());
697 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
699 if (isGotoCodeNeccessary(I.getParent(), I.getSuccessor(1))) {
700 Out << " } else {\n";
701 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
704 // First goto not neccesary, assume second one is...
706 writeOperand(I.getCondition());
709 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
714 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
720 void CWriter::visitBinaryOperator(Instruction &I) {
721 // binary instructions, shift instructions, setCond instructions.
722 if (isa<PointerType>(I.getType())) {
724 printType(I.getType());
728 if (isa<PointerType>(I.getType())) Out << "(long long)";
729 writeOperand(I.getOperand(0));
731 switch (I.getOpcode()) {
732 case Instruction::Add: Out << " + "; break;
733 case Instruction::Sub: Out << " - "; break;
734 case Instruction::Mul: Out << "*"; break;
735 case Instruction::Div: Out << "/"; break;
736 case Instruction::Rem: Out << "%"; break;
737 case Instruction::And: Out << " & "; break;
738 case Instruction::Or: Out << " | "; break;
739 case Instruction::Xor: Out << " ^ "; break;
740 case Instruction::SetEQ: Out << " == "; break;
741 case Instruction::SetNE: Out << " != "; break;
742 case Instruction::SetLE: Out << " <= "; break;
743 case Instruction::SetGE: Out << " >= "; break;
744 case Instruction::SetLT: Out << " < "; break;
745 case Instruction::SetGT: Out << " > "; break;
746 case Instruction::Shl : Out << " << "; break;
747 case Instruction::Shr : Out << " >> "; break;
748 default: std::cerr << "Invalid operator type!" << I; abort();
751 if (isa<PointerType>(I.getType())) Out << "(long long)";
752 writeOperand(I.getOperand(1));
755 void CWriter::visitCastInst(CastInst &I) {
757 printType(I.getType());
759 writeOperand(I.getOperand(0));
762 void CWriter::visitCallInst(CallInst &I) {
763 const PointerType *PTy = cast<PointerType>(I.getCalledValue()->getType());
764 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
765 const Type *RetTy = FTy->getReturnType();
767 Out << getValueName(I.getOperand(0)) << "(";
769 if (I.getNumOperands() > 1) {
770 writeOperand(I.getOperand(1));
772 for (unsigned op = 2, Eop = I.getNumOperands(); op != Eop; ++op) {
774 writeOperand(I.getOperand(op));
780 void CWriter::visitMallocInst(MallocInst &I) {
782 printType(I.getType());
783 Out << ")malloc(sizeof(";
784 printType(I.getType()->getElementType());
787 if (I.isArrayAllocation()) {
789 writeOperand(I.getOperand(0));
794 void CWriter::visitAllocaInst(AllocaInst &I) {
796 printType(I.getType());
797 Out << ") alloca(sizeof(";
798 printType(I.getType()->getElementType());
800 if (I.isArrayAllocation()) {
802 writeOperand(I.getOperand(0));
807 void CWriter::visitFreeInst(FreeInst &I) {
809 writeOperand(I.getOperand(0));
813 void CWriter::printIndexingExpression(Value *Ptr, User::op_iterator I,
814 User::op_iterator E) {
815 bool HasImplicitAddress = false;
816 // If accessing a global value with no indexing, avoid *(&GV) syndrome
817 if (GlobalValue *V = dyn_cast<GlobalValue>(Ptr)) {
818 HasImplicitAddress = true;
819 } else if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(Ptr)) {
820 HasImplicitAddress = true;
821 Ptr = CPR->getValue(); // Get to the global...
825 if (!HasImplicitAddress)
826 Out << "*"; // Implicit zero first argument: '*x' is equivalent to 'x[0]'
828 writeOperandInternal(Ptr);
832 const Constant *CI = dyn_cast<Constant>(I->get());
833 if (HasImplicitAddress && (!CI || !CI->isNullValue()))
836 writeOperandInternal(Ptr);
838 if (HasImplicitAddress && (!CI || !CI->isNullValue()))
841 // Print out the -> operator if possible...
842 if (CI && CI->isNullValue() && I+1 != E) {
843 if ((*(I+1))->getType() == Type::UByteTy) {
844 Out << (HasImplicitAddress ? "." : "->");
845 Out << "field" << cast<ConstantUInt>(*(I+1))->getValue();
847 } else { // Performing array indexing. Just skip the 0
850 } else if (HasImplicitAddress) {
855 if ((*I)->getType() == Type::UIntTy) {
860 Out << ".field" << cast<ConstantUInt>(*I)->getValue();
864 void CWriter::visitLoadInst(LoadInst &I) {
865 printIndexingExpression(I.getPointerOperand(), I.idx_begin(), I.idx_end());
868 void CWriter::visitStoreInst(StoreInst &I) {
869 printIndexingExpression(I.getPointerOperand(), I.idx_begin(), I.idx_end());
871 writeOperand(I.getOperand(0));
874 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
876 printIndexingExpression(I.getPointerOperand(), I.idx_begin(), I.idx_end());
879 //===----------------------------------------------------------------------===//
880 // External Interface declaration
881 //===----------------------------------------------------------------------===//
883 void WriteToC(const Module *M, ostream &Out) {
884 assert(M && "You can't write a null module!!");
885 SlotCalculator SlotTable(M, false);
886 CWriter W(Out, SlotTable, M);