HomeSort by relevance Sort by last modified time
    Searched refs:Dag (Results 1 - 20 of 20) sorted by null

  /external/swiftshader/third_party/LLVM/utils/TableGen/
PseudoLoweringEmitter.cpp 24 // a single dag, so we can do fancier things.
27 addDagOperandMapping(Record *Rec, DagInit *Dag, CodeGenInstruction &Insn,
30 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
31 if (DefInit *DI = dynamic_cast<DefInit*>(Dag->getArg(i))) {
57 } else if (IntInit *II = dynamic_cast<IntInit*>(Dag->getArg(i))) {
61 } else if (DagInit *SubDag = dynamic_cast<DagInit*>(Dag->getArg(i))) {
80 DagInit *Dag = Rec->getValueAsDag("ResultInst");
81 assert(Dag && "Missing result instruction in pseudo expansion!");
82 DEBUG(dbgs() << " Result: " << *Dag << "\n");
84 DefInit *OpDef = dynamic_cast<DefInit*>(Dag->getOperator())
    [all...]
PseudoLoweringEmitter.h 50 unsigned addDagOperandMapping(Record *Rec, DagInit *Dag,
CodeGenDAGPatterns.cpp 1 //===- CodeGenDAGPatterns.cpp - Read DAG patterns from .td file -----------===//
699 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
702 // calculate the complexity of all patterns a dag can potentially map to.
    [all...]
  /external/llvm/utils/TableGen/
PseudoLoweringEmitter.cpp 55 unsigned addDagOperandMapping(Record *Rec, DagInit *Dag,
71 // a single dag, so we can do fancier things.
74 addDagOperandMapping(Record *Rec, DagInit *Dag, CodeGenInstruction &Insn,
77 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
78 if (DefInit *DI = dyn_cast<DefInit>(Dag->getArg(i))) {
104 } else if (IntInit *II = dyn_cast<IntInit>(Dag->getArg(i))) {
108 } else if (DagInit *SubDag = dyn_cast<DagInit>(Dag->getArg(i))) {
127 DagInit *Dag = Rec->getValueAsDag("ResultInst");
128 assert(Dag && "Missing result instruction in pseudo expansion!");
129 DEBUG(dbgs() << " Result: " << *Dag << "\n")
    [all...]
CodeGenDAGPatterns.cpp 1 //===- CodeGenDAGPatterns.cpp - Read DAG patterns from .td file -----------===//
29 #define DEBUG_TYPE "dag-patterns"
824 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
827 // calculate the complexity of all patterns a dag can potentially map to.
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/
PseudoLoweringEmitter.cpp 55 unsigned addDagOperandMapping(Record *Rec, DagInit *Dag,
71 // a single dag, so we can do fancier things.
74 addDagOperandMapping(Record *Rec, DagInit *Dag, CodeGenInstruction &Insn,
77 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
78 if (DefInit *DI = dyn_cast<DefInit>(Dag->getArg(i))) {
104 } else if (IntInit *II = dyn_cast<IntInit>(Dag->getArg(i))) {
108 } else if (DagInit *SubDag = dyn_cast<DagInit>(Dag->getArg(i))) {
127 DagInit *Dag = Rec->getValueAsDag("ResultInst");
128 assert(Dag && "Missing result instruction in pseudo expansion!");
129 LLVM_DEBUG(dbgs() << " Result: " << *Dag << "\n")
    [all...]
RISCVCompressInstEmitter.cpp 25 // class CompressPat<dag input, dag output> {
26 // dag Input = input;
27 // dag Output = output;
107 void addDagOperandMapping(Record *Rec, DagInit *Dag, CodeGenInstruction &Inst,
148 // Only source instruction operands are allowed to not match Input Dag
168 << " Dag Operand Type: '" << DagOpType->getName()
175 /// The patterns in the Dag contain different types of operands:
178 /// maps Dag operands to its corresponding instruction operands. For register
179 /// operands and fixed registers it expects the Dag operand type to be containe
    [all...]
CodeGenDAGPatterns.cpp 1 //===- CodeGenDAGPatterns.cpp - Read DAG patterns from .td file -----------===//
32 #define DEBUG_TYPE "dag-patterns"
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/TableGen/
JSONBackend.cpp 95 } else if (auto *Dag = dyn_cast<DagInit>(&I)) {
96 obj["kind"] = "dag";
97 obj["operator"] = translateInit(*Dag->getOperator());
98 if (auto name = Dag->getName())
101 for (unsigned i = 0, limit = Dag->getNumArgs(); i < limit; ++i) {
103 arg.push_back(translateInit(*Dag->getArg(i)));
104 if (auto argname = Dag->getArgName(i))
TGLexer.h 46 Bit, Bits, Class, Code, Dag, Def, Foreach, Defm, Field, In, Int, Let, List,
TGParser.cpp 777 /// Type ::= DAG // dag type
787 case tgtok::Dag: Lex.Lex(); return DagRecTy::get();
    [all...]
  /external/swiftshader/third_party/LLVM/lib/TableGen/
TGLexer.h 44 Bit, Bits, Class, Code, Dag, Def, Defm, Field, In, Int, Let, List,
TGParser.cpp 578 /// Type ::= DAG // dag type
588 case tgtok::Dag: Lex.Lex(); return DagRecTy::get();
    [all...]
  /external/llvm/lib/TableGen/
TGLexer.h 46 Bit, Bits, Class, Code, Dag, Def, Foreach, Defm, Field, In, Int, Let, List,
TGParser.cpp 656 /// Type ::= DAG // dag type
666 case tgtok::Dag: Lex.Lex(); return DagRecTy::get();
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/
AMDGPUISelLowering.h 37 SDValue getFFBX_U32(SelectionDAG &DAG, SDValue Op, const SDLoc &DL, unsigned Opc) const;
40 static unsigned numBitsUnsigned(SDValue Op, SelectionDAG &DAG);
41 static unsigned numBitsSigned(SDValue Op, SelectionDAG &DAG);
46 SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, SelectionDAG &DAG) const;
47 SDValue LowerCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) const;
51 SDValue LowerFREM(SDValue Op, SelectionDAG &DAG) const;
52 SDValue LowerFCEIL(SDValue Op, SelectionDAG &DAG) const;
53 SDValue LowerFTRUNC(SDValue Op, SelectionDAG &DAG) const;
54 SDValue LowerFRINT(SDValue Op, SelectionDAG &DAG) const;
55 SDValue LowerFNEARBYINT(SDValue Op, SelectionDAG &DAG) const
    [all...]
  /external/llvm/include/llvm/CodeGen/
MachineScheduler.h 18 // scheduled. Targets can override the DAG builder and scheduler without
26 // The default scheduler, ScheduleDAGMILive, builds the DAG and drives list
28 // intervals. Most targets don't need to override the DAG builder and list
38 // The DAG builder can also be customized in a sense by adding DAG mutations
39 // that will run after DAG building and before list scheduling. DAG mutations
45 // ScheduleDAGMI *DAG = new ScheduleDAGMI(C, CustomStrategy(C));
46 // DAG->addMutation(new CustomDependencies(DAG->TII, DAG->TRI))
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
MachineScheduler.h 18 // scheduled. Targets can override the DAG builder and scheduler without
26 // The default scheduler, ScheduleDAGMILive, builds the DAG and drives list
28 // intervals. Most targets don't need to override the DAG builder and list
38 // The DAG builder can also be customized in a sense by adding DAG mutations
39 // that will run after DAG building and before list scheduling. DAG mutations
45 // ScheduleDAGMI *DAG = createGenericSchedLive(C);
46 // DAG->addMutation(new CustomDAGMutation(...));
47 // return DAG;
    [all...]
  /external/llvm/lib/CodeGen/
MachineScheduler.cpp 90 // DAG subtrees must have at least this many nodes.
315 /// consistent with the DAG builder, which traverses the interior of the
318 /// This design avoids exposing scheduling boundaries to the DAG builder,
319 /// simplifying the DAG builder's support for "special" target instructions.
399 /// handle calls, the DAG builder needs to be modified to create register
436 // boundary at the bottom of the region. The DAG does not include RegionEnd,
681 // Build the DAG.
691 // Initialize the strategy before modifying the DAG.
699 // Initialize ready queues now that the DAG and priority data are finalized.
732 // Notify the scheduling strategy before updating the DAG
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
MachineScheduler.cpp 125 // DAG subtrees must have at least this many nodes.
342 /// consistent with the DAG builder, which traverses the interior of the
345 /// This design avoids exposing scheduling boundaries to the DAG builder,
346 /// simplifying the DAG builder's support for "special" target instructions.
427 /// handle calls, the DAG builder needs to be modified to create register
519 // points to the scheduling boundary at the bottom of the region. The DAG
757 // Build the DAG.
773 // Initialize the strategy before modifying the DAG.
777 // Initialize ready queues now that the DAG and priority data are finalized.
810 // Notify the scheduling strategy before updating the DAG
    [all...]

Completed in 1041 milliseconds