1 //===- ReductionRules.h - Reduction Rules -----------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
33     using Vector = typename GraphT::Vector;  in applyR1()  local
34     using Matrix = typename GraphT::Matrix;  in applyR1()  local
43     const Matrix &ECosts = G.getEdgeCosts(EId);  in applyR1()
44     const Vector &XCosts = G.getNodeCosts(NId);  in applyR1()
77     using Vector = typename GraphT::Vector;  in applyR2()  local
78     using Matrix = typename GraphT::Matrix;  in applyR2()  local
84     const Vector &XCosts = G.getNodeCosts(NId);  in applyR2()
96     const Matrix *YXECosts = FlipEdge1 ?  in applyR2()
97       new Matrix(G.getEdgeCosts(YXEId).transpose()) :  in applyR2()
100     const Matrix *ZXECosts = FlipEdge2 ?  in applyR2()
101       new Matrix(G.getEdgeCosts(ZXEId).transpose()) :  in applyR2()
105       YLen = YXECosts->getRows(),  in applyR2()
106       ZLen = ZXECosts->getRows();  in applyR2()
134       const Matrix &YZECosts = G.getEdgeCosts(YZEId);  in applyR2()
149   // Does this Cost vector have any register options ?
154     // An empty or spill only cost vector does not provide any register option.  in hasRegisterOptions()
158     // If there are registers in the cost vector, but all of them have infinite  in hasRegisterOptions()
174   // Note - This does not return the graph to its original (pre-reduction)
182     using Matrix = typename GraphT::Matrix;  in backpropagate()  local
203         const Matrix& edgeCosts = G.getEdgeCosts(EId);  in backpropagate()