search for: instructionlist

...nction::iterator i = F.begin(), e = F.end(); i != e; ++i) { BasicBlock &B=*i; runOnBasicBlock(B); } return false; } bool MParSchedule::runOnBasicBlock(BasicBlock &B) { // fill the Instruction list and the available values list InstructionList.clear(); //ValueList.clear(); //FIXME: check if not clearing the Value List might cause problems? list<Schedule*> *ScheduleList=new list<Schedule*>::list(); for(BasicBlock::iterator j=B.begin(),bbe=B.end();j!=bbe;++j) { InstructionList.push_back(j...

...arseMetadataAttachment(): 1601 case bitc::METADATA_ATTACHMENT: { 1602 unsigned RecordLength = Record.size(); 1603 if (Record.empty() || (RecordLength - 1) % 2 == 1) 1604 return Error ("Invalid METADATA_ATTACHMENT reader!"); 1605 Instruction *Inst = InstructionList[Record[0]]; 1606 for (unsigned i = 1; i != RecordLength; i = i+2) { 1607 unsigned Kind = Record[i]; 1608 Value *Node = MDValueList.getValueFwdRef(Record[i+1]); 1609 TheMetadata.addMD(Kind, cast<MDNode>(Node), Inst); 1610 } 1611 break; 16...

...> 1601 case bitc::METADATA_ATTACHMENT: { > 1602 unsigned RecordLength = Record.size(); > 1603 if (Record.empty() || (RecordLength - 1) % 2 == 1) > 1604 return Error ("Invalid METADATA_ATTACHMENT reader!"); > 1605 Instruction *Inst = InstructionList[Record[0]]; > 1606 for (unsigned i = 1; i != RecordLength; i = i+2) { > 1607 unsigned Kind = Record[i]; > 1608 Value *Node = MDValueList.getValueFwdRef(Record[i+1]); > 1609 TheMetadata.addMD(Kind, cast<MDNode>(Node), Inst); > 1610 }...

Hi there, I have a question on the LLVM internals. Is it possible to dump an InstructionList (i.e. a (possibly) naively scheduled assembly) prior register allocation? Does LLVM use infinite (virtual) registers similar to MachSUIF? This is, of course, meant for a given target in contrast to MachSUIF that features the SUIFvm ISA as low-level IR and such a dump is possible at this point. Plu...

...+ return Error("Malformed block record"); > + UseRelativeIDs = true; > + } else { > + if (Stream.EnterSubBlock(bitc::FUNCTION_BLOCK_ID)) > + return Error("Malformed block record"); > + UseRelativeIDs = false; > + } Likewise. > > InstructionList.clear(); > unsigned ModuleValueListSize = ValueList.size(); ... > @@ -2260,8 +2275,10 @@ bool BitcodeReader::ParseFunctionBody(Function *F) { > } > else { > BasicBlock *FalseDest = getBasicBlock(Record[1]); > - Value *Cond = getFnValueByID(Record[2...

Hi,all I tried to run the generated whole-program bitcode of BIND,but I got some information: 0 lli 0x0000000000feda16 1 lli 0x0000000000fed88f 2 libpthread.so.0 0x0000003df340eee0 3 libc.so.6 0x0000003df28332f5 gsignal + 53 4 libc.so.6 0x0000003df2834b20 abort + 384 5 libc.so.6 0x0000003df282c2fa __assert_fail + 234 6 lli

Hi all, I've been looking into how to make llvm bitcode files smaller. There is one simple change that appears to shrink linked bitcode files by about 15%. See this spreadsheet for some rough data: https://docs.google.com/spreadsheet/ccc?key=0AjRrJHQc4_bddEtJdjdIek5fMDdIdFFIZldZXzdWa0E The change is in how operand ids are encoded in bitcode files. Rather than use an "absolute

Hi I am currently trying to schedule instructions with my own algorithm. For that i need to get the data dependency between the instructions. So currently i am dooing s.t. like: for(BasicBlock::iterator j=B.begin(),bbe=B.end();j!=bbe;++j) { InstructionList.push_back(j); if (const AllocaInst *AI = dyn_cast<AllocaInst>(j)) { ValueList.push_back(AI); } else if(PHINode *PHI=dyn_cast<PHINode>(j)) { ValueList.push_back(PHI); } else if(GetElementPtrInst *GEPI= dyn_cast...

On Tue, 2006-05-30 at 14:48 +0200, Silken Tiger wrote: > Hi > > Thanks for all your feedback. I just found the reason for the compile failure > for my analysis pass: I had to add my object to the namespace llvm instead of > anonymous. This took me some time since i was looking for an linking > failure... but as errors go i should have looked at the error message a >

Hi Thanks for all your feedback. I just found the reason for the compile failure for my analysis pass: I had to add my object to the namespace llvm instead of anonymous. This took me some time since i was looking for an linking failure... but as errors go i should have looked at the error message a little closer. So for all those trying to add an analysis path: * add the object name to the

...dule*> *> BlockSchedule; list<Schedule*>* lookupBasicBlock(BasicBlock *); private: bool in_ValueList(Value *val); list<const Value*> ValueList; list<Instruction*> InstructionList; }; }; It gets Registered in the cpp file via: RegisterAnalysis<MParSchedule> X("MParSchedule","Maximal Parallel Schedule"); This pass has been tested as optimization pass with opt, and everything worked in this configuration. Thanks ST

...cessOrdering); + else + FailureOrdering = GetDecodedOrdering(Record[OpNum+3]); + + I = new AtomicCmpXchgInst(Ptr, Cmp, New, SuccessOrdering, FailureOrdering, + SynchScope); cast<AtomicCmpXchgInst>(I)->setVolatile(Record[OpNum]); InstructionList.push_back(I); break; diff --git a/lib/Bitcode/Writer/BitcodeWriter.cpp b/lib/Bitcode/Writer/BitcodeWriter.cpp index 718cd12..0093c0f 100644 --- a/lib/Bitcode/Writer/BitcodeWriter.cpp +++ b/lib/Bitcode/Writer/BitcodeWriter.cpp @@ -1441,9 +1441,11 @@ static void WriteInstruction(const Instruct...