OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:SDep
(Results
1 - 13
of
13
) sorted by null
/external/llvm/include/llvm/Target/
TargetSubtargetInfo.h
22
class
SDep
;
63
SDep
& dep) const { }
/external/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp
273
SDep
::Kind Kind = MO.isUse() ?
SDep
::Anti :
SDep
::Output;
274
unsigned AOLatency = (Kind ==
SDep
::Anti) ? 0 : 1;
280
(Kind !=
SDep
::Output || !MO.isDead() ||
282
DefSU->addPred(
SDep
(SU, Kind, AOLatency, /*Reg=*/Reg));
291
(Kind !=
SDep
::Output || !MO.isDead() ||
293
DefSU->addPred(
SDep
(SU, Kind, AOLatency, /*Reg=*/ *Alias));
326
const
SDep
& dep =
SDep
(SU, SDep::Data, LDataLatency, Reg)
[
all
...]
ScheduleDAG.cpp
88
bool SUnit::addPred(const
SDep
&D) {
90
for (SmallVector<
SDep
, 4>::const_iterator I = Preds.begin(), E = Preds.end();
95
SDep
P = D;
99
if (D.getKind() ==
SDep
::Data) {
125
void SUnit::removePred(const
SDep
&D) {
127
for (SmallVector<
SDep
, 4>::iterator I = Preds.begin(), E = Preds.end();
132
SDep
P = D;
135
for (SmallVector<
SDep
, 4>::iterator II = N->Succs.begin(),
146
if (P.getKind() ==
SDep
::Data) {
311
case
SDep
::Data: dbgs() << "val "; break
[
all
...]
AggressiveAntiDepBreaker.cpp
278
static void AntiDepEdges(const SUnit *SU, std::vector<const
SDep
*>& Edges) {
282
if ((P->getKind() ==
SDep
::Anti) || (P->getKind() ==
SDep
::Output)) {
295
const
SDep
*Next = 0;
307
(NextDepth == PredTotalLatency && P->getKind() ==
SDep
::Anti)) {
794
std::vector<const
SDep
*> Edges;
813
const
SDep
*Edge = Edges[i];
816
if ((Edge->getKind() !=
SDep
::Anti) &&
817
(Edge->getKind() !=
SDep
::Output)) continue;
860
(P->getKind() !=
SDep
::Anti || P->getReg() != AntiDepReg)
[
all
...]
CriticalAntiDepBreaker.cpp
159
static const
SDep
*CriticalPathStep(const SUnit *SU) {
160
const
SDep
*Next = 0;
171
(NextDepth == PredTotalLatency && P->getKind() ==
SDep
::Anti)) {
528
if (const
SDep
*Edge = CriticalPathStep(CriticalPathSU)) {
532
if (Edge->getKind() ==
SDep
::Anti) {
554
(P->getKind() !=
SDep
::Anti || P->getReg() != AntiDepReg) :
555
(P->getKind() ==
SDep
::Data && P->getReg() == AntiDepReg)) {
ScheduleDAGInstrs.h
189
SDep
& dep) const;
PostRASchedulerList.cpp
170
void ReleaseSucc(SUnit *SU,
SDep
*SuccEdge);
536
void SchedulePostRATDList::ReleaseSucc(SUnit *SU,
SDep
*SuccEdge) {
/external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGFast.cpp
82
void AddPred(SUnit *SU, const
SDep
&D) {
88
void RemovePred(SUnit *SU, const
SDep
&D) {
93
void ReleasePred(SUnit *SU,
SDep
*PredEdge);
134
void ScheduleDAGFast::ReleasePred(SUnit *SU,
SDep
*PredEdge) {
275
SDep
ChainPred;
276
SmallVector<
SDep
, 4> ChainSuccs;
277
SmallVector<
SDep
, 4> LoadPreds;
278
SmallVector<
SDep
, 4> NodePreds;
279
SmallVector<
SDep
, 4> NodeSuccs;
304
const
SDep
&Pred = LoadPreds[i]
[
all
...]
ScheduleDAGSDNodes.h
32
/// SDNode-based scheduling graphs do not use
SDep
::Anti or
SDep
::Output
101
SDep
& dep) const { }
104
unsigned OpIdx,
SDep
& dep) const;
ScheduleDAGRRList.cpp
203
void AddPred(SUnit *SU, const
SDep
&D) {
211
void RemovePred(SUnit *SU, const
SDep
&D) {
222
void ReleasePred(SUnit *SU, const
SDep
*PredEdge);
224
void ReleaseSucc(SUnit *SU, const
SDep
*SuccEdge);
231
void CapturePred(
SDep
*PredEdge);
366
void ScheduleDAGRRList::ReleasePred(SUnit *SU, const
SDep
*PredEdge) {
658
void ScheduleDAGRRList::CapturePred(
SDep
*PredEdge) {
854
SmallVector<
SDep
, 4> ChainPreds;
855
SmallVector<
SDep
, 4> ChainSuccs;
856
SmallVector<
SDep
, 4> LoadPreds
[
all
...]
ScheduleDAGList.cpp
81
void ReleaseSucc(SUnit *SU, const
SDep
&D);
108
void ScheduleDAGList::ReleaseSucc(SUnit *SU, const
SDep
&D) {
ScheduleDAGSDNodes.cpp
448
const
SDep
&dep =
SDep
(OpSU, isChain ?
SDep
::Order :
SDep
::Data,
451
ComputeOperandLatency(OpN, N, i, const_cast<
SDep
&>(dep));
452
ST.adjustSchedDependency(OpSU, SU, const_cast<
SDep
&>(dep));
579
unsigned OpIdx,
SDep
& dep) const{
584
if (dep.getKind() !=
SDep
::Data)
/external/llvm/include/llvm/CodeGen/
ScheduleDAG.h
42
///
SDep
- Scheduling dependency. This represents one direction of an
44
class
SDep
{
89
///
SDep
- Construct a null
SDep
. This is only for use by container
91
/// have null
SDep
edges.
92
SDep
() : Dep(0, Data) {}
94
///
SDep
- Construct an
SDep
with the specified values.
95
SDep
(SUnit *S, Kind kind, unsigned latency = 1, unsigned Reg = 0,
103
"
SDep
::Anti and SDep::Output must use a non-zero Reg!")
[
all
...]
Completed in 91 milliseconds