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

  /external/llvm/lib/Transforms/Instrumentation/
PathProfiling.cpp 11 // profiling converts the CFG into a DAG by replacing backedges with edges
13 // along the new DAG are enumrated, i.e. each path is given a path number.
20 // requirements are formatting the llvm CFG into the Ball-Larus DAG, path
25 // DAG - Directed Acyclic Graph.
26 // Ball-Larus DAG - A CFG with an entry node, an exit node, and backedges
30 // Ball-Larus DAG.
194 // Calculates a spanning tree of the DAG ignoring cycles. Whichever
315 BLInstrumentationDag* dag,
331 BLInstrumentationDag* dag);
335 bool splitCritical(BLInstrumentationEdge* edge, BLInstrumentationDag* dag);
1271 BLInstrumentationDag dag = BLInstrumentationDag(F); local
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.h 103 /// Perform platform specific DAG postprocessing.
134 VLIWMachineScheduler *DAG;
156 DAG(0), SchedModel(0), Available(ID, Name+".A"),
167 void init(VLIWMachineScheduler *dag, const TargetSchedModel *smodel) {
168 DAG = dag;
191 VLIWMachineScheduler *DAG;
208 DAG(0), SchedModel(0), TRI(0), Top(TopQID, "TopQ"), Bot(BotQID, "BotQ") {}
210 virtual void initialize(ScheduleDAGMI *dag);
HexagonMachineScheduler.cpp 23 /// Platform specific modifications to DAG.
142 /// only includes instructions that have DAG nodes, not scheduling boundaries.
153 // Postprocess the DAG to add platform specific artificial dependencies.
159 // Initialize the strategy before modifying the DAG.
195 void ConvergingVLIWScheduler::initialize(ScheduleDAGMI *dag) {
196 DAG = static_cast<VLIWMachineScheduler*>(dag);
197 SchedModel = DAG->getSchedModel();
198 TRI = DAG->TRI;
200 Top.init(DAG, SchedModel)
    [all...]
  /external/llvm/lib/Target/R600/
R600MachineScheduler.h 36 const ScheduleDAGMI *DAG;
78 DAG(0), TII(0), TRI(0), MRI(0) {
94 virtual void initialize(ScheduleDAGMI *dag);
R600MachineScheduler.cpp 28 void R600SchedStrategy::initialize(ScheduleDAGMI *dag) {
30 DAG = dag;
31 TII = static_cast<const R600InstrInfo*>(DAG->TII);
32 TRI = static_cast<const R600RegisterInfo*>(DAG->TRI);
33 MRI = &DAG->MRI;
43 const AMDGPUSubtarget &ST = DAG->TM.getSubtarget<AMDGPUSubtarget>();
103 SU->dump(DAG);
110 for (unsigned i = 0; i < DAG->SUnits.size(); i++) {
111 const SUnit &S = DAG->SUnits[i]
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.h 34 /// the DAG and must be handled explicitly by schedulers.
39 SelectionDAG *DAG; // DAG of the current basic block
51 void Run(SelectionDAG *dag, MachineBasicBlock *bb);
82 /// BuildSchedGraph - Build the SUnit graph from the selection dag that we
SelectionDAGBuilder.h 1 //===-- SelectionDAGBuilder.h - Selection-DAG building --------------------===//
83 /// CurDebugLoc - current file + line number. Changes as we build the DAG.
287 SelectionDAG &DAG;
322 /// no subsequent DAG nodes should be created.
328 SelectionDAGBuilder(SelectionDAG &dag, FunctionLoweringInfo &funcinfo,
330 : SDNodeOrder(0), TM(dag.getTarget()), TLI(dag.getTargetLoweringInfo()),
331 DAG(dag), FuncInfo(funcinfo), OptLevel(ol),
354 /// getRoot - Return the current virtual root of the Selection DAG,
    [all...]
LegalizeVectorOps.cpp 36 SelectionDAG& DAG;
83 VectorLegalizer(SelectionDAG& dag) :
84 DAG(dag), TLI(dag.getTargetLoweringInfo()), Changed(false) {}
90 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
91 E = prior(DAG.allnodes_end()); I != llvm::next(E); ++I) {
113 DAG.AssignTopologicalOrder();
114 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
115 E = prior(DAG.allnodes_end()); I != llvm::next(E); ++I
    [all...]
LegalizeTypes.h 1 //===-- LegalizeTypes.h - Definition of the DAG Type Legalizer class ------===//
37 SelectionDAG &DAG;
68 return TLI.getTypeAction(*DAG.getContext(), VT);
73 return TLI.getTypeAction(*DAG.getContext(), VT) == TargetLowering::TypeLegal;
119 explicit DAGTypeLegalizer(SelectionDAG &dag)
120 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
127 /// top-down traversal of the dag, legalizing types as it goes. Returns
138 SelectionDAG &getDAG() const { return DAG; }
    [all...]
ScheduleDAGSDNodes.cpp 49 : ScheduleDAG(mf), BB(0), DAG(0),
54 void ScheduleDAGSDNodes::Run(SelectionDAG *dag, MachineBasicBlock *bb) {
56 DAG = dag;
58 // Clear the scheduler's SUnit DAG.
79 const TargetLowering &TLI = DAG->getTargetLoweringInfo();
135 static void CloneNodeWithValues(SDNode *N, SelectionDAG *DAG,
145 SDVTList VTList = DAG->getVTList(&VTs[0], VTs.size());
155 DAG->MorphNodeTo(N, N->getOpcode(), VTList, &Ops[0], Ops.size());
162 static bool AddGlue(SDNode *N, SDValue Glue, bool AddGlue, SelectionDAG *DAG) {
    [all...]
LegalizeDAG.cpp 53 SelectionDAG &DAG;
64 explicit SelectionDAGLegalize(SelectionDAG &DAG);
159 DAG.RemoveDeadNode(N);
165 DAG.ReplaceAllUsesWith(Old, New);
169 DAG.ReplaceAllUsesWith(Old, New);
173 DAG.ReplaceAllUsesWith(Old, New);
194 return DAG.getVectorShuffle(NVT, dl, N1, N2, &Mask[0]);
208 return DAG.getVectorShuffle(NVT, dl, N1, N2, &NewMask[0]);
211 SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag)
212 : SelectionDAG::DAGUpdateListener(dag),
    [all...]
  /external/llvm/utils/vim/
tablegen.vim 17 syn keyword tgKeyword def let in code dag field include defm foreach
  /external/llvm/lib/TableGen/
TGLexer.cpp 273 .Case("dag", tgtok::Dag)
  /external/llvm/include/llvm/Target/
TargetLowering.h 651 /// hasTargetDAGCombine - If true, the target has custom DAG combine
    [all...]
  /external/llvm/
tblgen-rules.mk 97 $(call transform-td-to-out,dag-isel)
llvm-tblgen-rules.mk 153 $(call transform-td-to-out,dag-isel)
  /ndk/sources/host-tools/nawk-20071023/
FIXES 222 dag-erling smorgrav, des@ofug.org). subject to reversion if
248 portable. thanks to dag-erling smorgrav for code.
    [all...]
  /external/llvm/lib/CodeGen/
MachineScheduler.cpp 65 // DAG subtrees must have at least this many nodes.
180 /// consistent with the DAG builder, which traverses the interior of the
183 /// This design avoids exposing scheduling boundaries to the DAG builder,
184 /// simplifying the DAG builder's support for "special" target instructions.
235 // boundary at the bottom of the region. The DAG does not include RegionEnd,
512 /// only includes instructions that have DAG nodes, not scheduling boundaries.
530 // Initialize the strategy before modifying the DAG.
538 // Initialize ready queues now that the DAG and priority data are finalized.
563 /// Build the DAG and setup three register pressure trackers.
572 // Build the DAG, and compute current register pressure
    [all...]
  /external/libpcap/
configure     [all...]
  /prebuilts/tools/common/eclipse/
org.eclipse.ui.workbench.texteditor_3.6.1.r361_v20100714-0800.jar 

Completed in 2105 milliseconds