Skip to content

Commit 959d840

Browse files
committed
[AMDGPU] Remove unused SplitGraph::Node::getFullCost
1 parent b8b8fbe commit 959d840

File tree

1 file changed

+0
-19
lines changed

1 file changed

+0
-19
lines changed

llvm/lib/Target/AMDGPU/AMDGPUSplitModule.cpp

Lines changed: 0 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -438,12 +438,6 @@ class SplitGraph::Node {
438438
visitAllDependencies([&](const Node &N) { BV.set(N.getID()); });
439439
}
440440

441-
/// Uses \ref visitAllDependencies to aggregate the individual cost of this
442-
/// node and all of its dependencies.
443-
///
444-
/// This is cached.
445-
CostType getFullCost() const;
446-
447441
private:
448442
void markAsGraphEntry() { IsGraphEntry = true; }
449443

@@ -454,9 +448,6 @@ class SplitGraph::Node {
454448
bool IsEntryFnCC : 1;
455449
bool IsGraphEntry : 1;
456450

457-
// TODO: Cache dependencies as well?
458-
mutable CostType FullCost = 0;
459-
460451
// TODO: Use a single sorted vector (with all incoming/outgoing edges grouped
461452
// together)
462453
EdgesVec IncomingEdges;
@@ -485,16 +476,6 @@ void SplitGraph::Node::visitAllDependencies(
485476
}
486477
}
487478

488-
CostType SplitGraph::Node::getFullCost() const {
489-
if (FullCost)
490-
return FullCost;
491-
492-
assert(FullCost == 0);
493-
visitAllDependencies(
494-
[&](const Node &N) { FullCost += N.getIndividualCost(); });
495-
return FullCost;
496-
}
497-
498479
void SplitGraph::buildGraph(CallGraph &CG) {
499480
SplitModuleTimer SMT("buildGraph", "graph construction");
500481
LLVM_DEBUG(

0 commit comments

Comments
 (0)