HomeSort by: relevance | last modified time | path
    Searched defs:InstInputs (Results 1 - 3 of 3) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
PHITransAddr.h 48 /// InstInputs - The inputs for our symbolic address.
49 SmallVector<Instruction*, 4> InstInputs;
56 InstInputs.push_back(I);
66 for (unsigned i = 0, e = InstInputs.size(); i != e; ++i)
67 if (InstInputs[i]->getParent() == BB)
119 InstInputs.push_back(VI);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
PHITransAddr.cpp 51 for (unsigned i = 0, e = InstInputs.size(); i != e; ++i)
52 dbgs() << " Input #" << i << " is " << *InstInputs[i] << "\n";
58 SmallVectorImpl<Instruction*> &InstInputs) {
65 SmallVectorImpl<Instruction *>::iterator Entry = find(InstInputs, I);
66 if (Entry != InstInputs.end()) {
67 InstInputs.erase(Entry);
71 // If it isn't in the InstInputs list it is a subexpr incorporated into the
76 llvm_unreachable("Either something is missing from InstInputs or "
82 if (!VerifySubExpr(I->getOperand(i), InstInputs))
94 SmallVector<Instruction*, 8> Tmp(InstInputs.begin(), InstInputs.end())
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
CodeGenDAGPatterns.cpp 3333 std::map<std::string, TreePatternNodePtr> &InstInputs) {
3359 TreePatternNodePtr &Slot = InstInputs[Pat->getName()];
3388 std::map<std::string, TreePatternNodePtr> &InstInputs,
3404 bool isUse = HandleUse(I, Pat, InstInputs);
3430 FindPatternInputsAndOutputs(I, Pat->getChildShared(i), InstInputs,
3436 bool isUse = HandleUse(I, Pat, InstInputs);
3486 FindPatternInputsAndOutputs(I, Pat->getChildShared(NumDests), InstInputs,
3710 // InstInputs - Keep track of all of the inputs of the instruction, along
3712 std::map<std::string, TreePatternNodePtr> InstInputs;
3740 FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults
    [all...]

Completed in 57 milliseconds