@@ -13122,7 +13122,8 @@ static SDValue PerformLOADCombine(SDNode *N,
13122
13122
// Optimize trunc store (of multiple scalars) to shuffle and store. First,
13123
13123
// pack all of the elements in one place. Next, store to memory in fewer
13124
13124
// chunks.
13125
- SDValue PerformTruncatingStoreCombine(StoreSDNode *St, SelectionDAG &DAG) {
13125
+ static SDValue PerformTruncatingStoreCombine(StoreSDNode *St,
13126
+ SelectionDAG &DAG) {
13126
13127
SDValue StVal = St->getValue();
13127
13128
EVT VT = StVal.getValueType();
13128
13129
if (!St->isTruncatingStore() || !VT.isVector())
@@ -13206,7 +13207,8 @@ SDValue PerformTruncatingStoreCombine(StoreSDNode *St, SelectionDAG &DAG) {
13206
13207
// Try taking a single vector store from an truncate (which would otherwise turn
13207
13208
// into an expensive buildvector) and splitting it into a series of narrowing
13208
13209
// stores.
13209
- SDValue PerformSplittingToNarrowingStores(StoreSDNode *St, SelectionDAG &DAG) {
13210
+ static SDValue PerformSplittingToNarrowingStores(StoreSDNode *St,
13211
+ SelectionDAG &DAG) {
13210
13212
if (!St->isSimple() || St->isTruncatingStore() || !St->isUnindexed())
13211
13213
return SDValue();
13212
13214
SDValue Trunc = St->getValue();
@@ -13696,7 +13698,7 @@ static SDValue PerformShiftCombine(SDNode *N,
13696
13698
// Look for a sign/zero extend of a larger than legal load. This can be split
13697
13699
// into two extending loads, which are simpler to deal with than an arbitrary
13698
13700
// sign extend.
13699
- SDValue PerformSplittingToWideningLoad(SDNode *N, SelectionDAG &DAG) {
13701
+ static SDValue PerformSplittingToWideningLoad(SDNode *N, SelectionDAG &DAG) {
13700
13702
SDValue N0 = N->getOperand(0);
13701
13703
if (N0.getOpcode() != ISD::LOAD)
13702
13704
return SDValue();
0 commit comments