@@ -338,8 +338,7 @@ class ComplexDeinterleavingGraph {
338
338
NodePtr identifyPartialReduction (Value *R, Value *I);
339
339
NodePtr identifyDotProduct (Value *Inst);
340
340
341
- NodePtr identifyNode (Value *R, Value *I);
342
- NodePtr identifyNode (Value *R, Value *I, bool &FromCache);
341
+ NodePtr identifyNode (Value *R, Value *I, bool *FromCache = nullptr );
343
342
344
343
// / Determine if a sum of complex numbers can be formed from \p RealAddends
345
344
// / and \p ImagAddens. If \p Accumulator is not null, add the result to it.
@@ -990,7 +989,7 @@ ComplexDeinterleavingGraph::identifyDotProduct(Value *V) {
990
989
BImag = UnwrapCast (BImag);
991
990
992
991
bool WasANodeFromCache = false ;
993
- NodePtr Node = identifyNode (AReal, AImag, WasANodeFromCache);
992
+ NodePtr Node = identifyNode (AReal, AImag, & WasANodeFromCache);
994
993
995
994
// In the case that a node was identified to figure out the rotation, ensure
996
995
// that trying to identify a node with AReal and AImag post-unwrap results in
@@ -1053,17 +1052,12 @@ ComplexDeinterleavingGraph::identifyPartialReduction(Value *R, Value *I) {
1053
1052
}
1054
1053
1055
1054
ComplexDeinterleavingGraph::NodePtr
1056
- ComplexDeinterleavingGraph::identifyNode (Value *R, Value *I) {
1057
- bool _;
1058
- return identifyNode (R, I, _);
1059
- }
1060
-
1061
- ComplexDeinterleavingGraph::NodePtr
1062
- ComplexDeinterleavingGraph::identifyNode (Value *R, Value *I, bool &FromCache) {
1055
+ ComplexDeinterleavingGraph::identifyNode (Value *R, Value *I, bool *FromCache) {
1063
1056
auto It = CachedResult.find ({R, I});
1064
1057
if (It != CachedResult.end ()) {
1065
1058
LLVM_DEBUG (dbgs () << " - Folding to existing node\n " );
1066
- FromCache = true ;
1059
+ if (FromCache != nullptr )
1060
+ *FromCache = true ;
1067
1061
return It->second ;
1068
1062
}
1069
1063
@@ -1690,7 +1684,6 @@ bool ComplexDeinterleavingGraph::collectPotentialReductions(BasicBlock *B) {
1690
1684
}
1691
1685
1692
1686
void ComplexDeinterleavingGraph::identifyReductionNodes () {
1693
- dbgs () << " identifyReductionNodes\n " ;
1694
1687
SmallVector<bool > Processed (ReductionInfo.size (), false );
1695
1688
SmallVector<Instruction *> OperationInstruction;
1696
1689
for (auto &P : ReductionInfo)
@@ -1746,7 +1739,6 @@ void ComplexDeinterleavingGraph::identifyReductionNodes() {
1746
1739
RealPHI = ReductionInfo[Real].first ;
1747
1740
ImagPHI = nullptr ;
1748
1741
PHIsFound = false ;
1749
- dbgs () << " identifyNode from Phi " << *RealPHI << " / " << *Real << " \n " ;
1750
1742
auto Node = identifyNode (Real->getOperand (0 ), Real->getOperand (1 ));
1751
1743
if (Node && PHIsFound) {
1752
1744
LLVM_DEBUG (
0 commit comments