@@ -1608,7 +1608,7 @@ void EscapeAnalysis::ConnectionGraph::verify() const {
1608
1608
continue ;
1609
1609
1610
1610
if (auto ai = dyn_cast<ApplyInst>(&i)) {
1611
- if (EA->canOptimizeArrayUninitializedCall (ai, this ).isValid ())
1611
+ if (EA->canOptimizeArrayUninitializedCall (ai).isValid ())
1612
1612
continue ;
1613
1613
}
1614
1614
for (auto result : i.getResults ()) {
@@ -1826,8 +1826,7 @@ bool EscapeAnalysis::buildConnectionGraphForDestructor(
1826
1826
}
1827
1827
1828
1828
EscapeAnalysis::ArrayUninitCall
1829
- EscapeAnalysis::canOptimizeArrayUninitializedCall (
1830
- ApplyInst *ai, const ConnectionGraph *conGraph) {
1829
+ EscapeAnalysis::canOptimizeArrayUninitializedCall (ApplyInst *ai) {
1831
1830
ArrayUninitCall call;
1832
1831
// This must be an exact match so we don't accidentally optimize
1833
1832
// "array.uninitialized_intrinsic".
@@ -1873,8 +1872,7 @@ bool EscapeAnalysis::canOptimizeArrayUninitializedResult(
1873
1872
if (!ai)
1874
1873
return false ;
1875
1874
1876
- auto *conGraph = getConnectionGraph (ai->getFunction ());
1877
- return canOptimizeArrayUninitializedCall (ai, conGraph).isValid ();
1875
+ return canOptimizeArrayUninitializedCall (ai).isValid ();
1878
1876
}
1879
1877
1880
1878
// Handle @_semantics("array.uninitialized")
@@ -1924,7 +1922,7 @@ void EscapeAnalysis::analyzeInstruction(SILInstruction *I,
1924
1922
return ;
1925
1923
case ArrayCallKind::kArrayUninitialized : {
1926
1924
ArrayUninitCall call = canOptimizeArrayUninitializedCall (
1927
- cast<ApplyInst>(FAS.getInstruction ()), ConGraph );
1925
+ cast<ApplyInst>(FAS.getInstruction ()));
1928
1926
if (call.isValid ()) {
1929
1927
createArrayUninitializedSubgraph (call, ConGraph);
1930
1928
return ;
0 commit comments