| ScheduleDAGSDNodes.h (202878) | ScheduleDAGSDNodes.h (207618) |
|---|---|
| 1//===---- ScheduleDAGSDNodes.h - SDNode Scheduling --------------*- C++ -*-===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// --- 45 unchanged lines hidden (view full) --- 54 if (isa<RegisterSDNode>(Node)) return true; 55 if (isa<GlobalAddressSDNode>(Node)) return true; 56 if (isa<BasicBlockSDNode>(Node)) return true; 57 if (isa<FrameIndexSDNode>(Node)) return true; 58 if (isa<ConstantPoolSDNode>(Node)) return true; 59 if (isa<JumpTableSDNode>(Node)) return true; 60 if (isa<ExternalSymbolSDNode>(Node)) return true; 61 if (isa<BlockAddressSDNode>(Node)) return true; | 1//===---- ScheduleDAGSDNodes.h - SDNode Scheduling --------------*- C++ -*-===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// --- 45 unchanged lines hidden (view full) --- 54 if (isa<RegisterSDNode>(Node)) return true; 55 if (isa<GlobalAddressSDNode>(Node)) return true; 56 if (isa<BasicBlockSDNode>(Node)) return true; 57 if (isa<FrameIndexSDNode>(Node)) return true; 58 if (isa<ConstantPoolSDNode>(Node)) return true; 59 if (isa<JumpTableSDNode>(Node)) return true; 60 if (isa<ExternalSymbolSDNode>(Node)) return true; 61 if (isa<BlockAddressSDNode>(Node)) return true; |
| 62 if (Node->getOpcode() == ISD::EntryToken) return true; | 62 if (Node->getOpcode() == ISD::EntryToken || 63 isa<MDNodeSDNode>(Node)) return true; |
| 63 return false; 64 } 65 66 /// NewSUnit - Creates a new SUnit and return a ptr to it. 67 /// 68 SUnit *NewSUnit(SDNode *N) { 69#ifndef NDEBUG 70 const SUnit *Addr = 0; --- 17 unchanged lines hidden (view full) --- 88 /// excludes nodes that aren't interesting to scheduling, and represents 89 /// flagged together nodes with a single SUnit. 90 virtual void BuildSchedGraph(AliasAnalysis *AA); 91 92 /// ComputeLatency - Compute node latency. 93 /// 94 virtual void ComputeLatency(SUnit *SU); 95 | 64 return false; 65 } 66 67 /// NewSUnit - Creates a new SUnit and return a ptr to it. 68 /// 69 SUnit *NewSUnit(SDNode *N) { 70#ifndef NDEBUG 71 const SUnit *Addr = 0; --- 17 unchanged lines hidden (view full) --- 89 /// excludes nodes that aren't interesting to scheduling, and represents 90 /// flagged together nodes with a single SUnit. 91 virtual void BuildSchedGraph(AliasAnalysis *AA); 92 93 /// ComputeLatency - Compute node latency. 94 /// 95 virtual void ComputeLatency(SUnit *SU); 96 |
| 96 virtual MachineBasicBlock * 97 EmitSchedule(DenseMap<MachineBasicBlock*, MachineBasicBlock*> *EM); | 97 virtual MachineBasicBlock *EmitSchedule(); |
| 98 99 /// Schedule - Order nodes according to selected style, filling 100 /// in the Sequence member. 101 /// 102 virtual void Schedule() = 0; 103 104 virtual void dumpNode(const SUnit *SU) const; 105 --- 16 unchanged lines hidden --- | 98 99 /// Schedule - Order nodes according to selected style, filling 100 /// in the Sequence member. 101 /// 102 virtual void Schedule() = 0; 103 104 virtual void dumpNode(const SUnit *SU) const; 105 --- 16 unchanged lines hidden --- |