@@ -1085,10 +1085,10 @@ bool SemaHLSL::handleRootSignatureElements(
1085
1085
ArrayRef<hlsl::RootSignatureElement> Elements) {
1086
1086
using RangeInfo = llvm::hlsl::rootsig::RangeInfo;
1087
1087
using OverlappingRanges = llvm::hlsl::rootsig::OverlappingRanges;
1088
- using InfoPair = std::pair<RangeInfo, const hlsl::RootSignatureElement *>;
1088
+ using InfoPairT = std::pair<RangeInfo, const hlsl::RootSignatureElement *>;
1089
1089
1090
1090
// 1. Collect RangeInfos
1091
- llvm::SmallVector<InfoPair > InfoPairs;
1091
+ llvm::SmallVector<InfoPairT > InfoPairs;
1092
1092
for (const hlsl::RootSignatureElement &RootSigElem : Elements) {
1093
1093
const llvm::hlsl::rootsig::RootElement &Elem = RootSigElem.getElement ();
1094
1094
if (const auto *Descriptor =
@@ -1149,18 +1149,18 @@ bool SemaHLSL::handleRootSignatureElements(
1149
1149
// The last Table->NumClauses elements of Infos are the owned Clauses
1150
1150
// generated RangeInfo
1151
1151
auto TableInfos =
1152
- MutableArrayRef<InfoPair >(InfoPairs).take_back (Table->NumClauses );
1153
- for (InfoPair &Pair : TableInfos)
1152
+ MutableArrayRef<InfoPairT >(InfoPairs).take_back (Table->NumClauses );
1153
+ for (InfoPairT &Pair : TableInfos)
1154
1154
Pair.first .Visibility = Table->Visibility ;
1155
1155
}
1156
1156
}
1157
1157
1158
1158
// 2. Sort with the RangeInfo <operator to prepare it for findOverlapping
1159
1159
std::sort (InfoPairs.begin (), InfoPairs.end (),
1160
- [](InfoPair A, InfoPair B) { return A.first < B.first ; });
1160
+ [](InfoPairT A, InfoPairT B) { return A.first < B.first ; });
1161
1161
1162
1162
llvm::SmallVector<RangeInfo> Infos;
1163
- for (const InfoPair &Pair : InfoPairs)
1163
+ for (const InfoPairT &Pair : InfoPairs)
1164
1164
Infos.push_back (Pair.first );
1165
1165
1166
1166
// Helpers to report diagnostics
0 commit comments