HomeSort by: relevance | last modified time | path
    Searched refs:Memo (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
FastISelEmitter.cpp 581 InstructionMemo Memo(
602 std::move(Memo));
639 const InstructionMemo &Memo = PI->second;
640 std::string PredicateCheck = Memo.PredicateCheck;
651 "name:" + Memo.Name + " predicate: " + PredicateCheck);
657 for (unsigned i = 0; i < Memo.PhysRegs.size(); ++i) {
658 if (Memo.PhysRegs[i] != "")
660 << "TII.get(TargetOpcode::COPY), " << Memo.PhysRegs[i]
665 if (Memo.SubRegNo.empty()) {
666 Operands.PrintManglingSuffix(OS, Memo.PhysRegs, ImmediatePredicates
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
InlineFunction.cpp 280 auto Memo = MemoMap.find(ChildPad);
281 if (Memo == MemoMap.end()) {
288 Value *ChildUnwindDestToken = Memo->second;
318 auto Memo = MemoMap.find(ChildPad);
319 if (Memo == MemoMap.end()) {
326 ChildUnwindDestToken = Memo->second;
350 // parent pad. Record this in the memo map, and check to see if the
391 /// quadratic run-time given that approach, it uses a memo map to avoid
404 auto Memo = MemoMap.find(EHPad);
405 if (Memo != MemoMap.end()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonGenInsert.cpp 1200 PairMapType Memo; // Memoization map for distance calculation.
1203 pruneUsesTooFar(I->first, RPO, Memo);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAG.cpp 9248 UseMemo Memo = { *UI, i, &Use };
9249 Uses.push_back(Memo);

Completed in 89 milliseconds