File tree Expand file tree Collapse file tree 2 files changed +20
-4
lines changed Expand file tree Collapse file tree 2 files changed +20
-4
lines changed Original file line number Diff line number Diff line change @@ -1578,8 +1578,8 @@ void Formatter::EmitSendDescriptorInfoGED(
1578
1578
switch (getScratchSpaceGRFsSize (desc)) {
1579
1579
case 0 : ss << " 1grf" ; break ;
1580
1580
case 1 : ss << " 2grfs" ; break ;
1581
- case 2 : ss << " 4grfs " ; break ;
1582
- case 3 : ss << " 8grfs " ; break ;
1581
+ case 2 : ss << " ?grfs " ; break ;
1582
+ case 3 : ss << " 4grfs " ; break ;
1583
1583
}
1584
1584
uint32_t off = getScratchSpaceAddressOffset (desc);
1585
1585
ss << " from 0x" << std::hex << off << " )" ;
@@ -1728,8 +1728,8 @@ void Formatter::EmitSendDescriptorInfo(
1728
1728
switch (getBitField (desc, 12 , 2 )) {
1729
1729
case 0 : ss << " 1grf" ; break ;
1730
1730
case 1 : ss << " 2grfs" ; break ;
1731
- case 2 : ss << " 4grfs " ; break ;
1732
- case 3 : ss << " 8grfs " ; break ;
1731
+ case 2 : ss << " ?grfs " ; break ;
1732
+ case 3 : ss << " 4grfs " ; break ;
1733
1733
}
1734
1734
uint32_t off = getBitField (desc, 0 , 12 );
1735
1735
ss << " from 0x" << std::hex << off << " )" ;
Original file line number Diff line number Diff line change @@ -66,6 +66,9 @@ class BitSet {
66
66
// len: range length in bits
67
67
inline bool intersects (const BitSet<N,I> &rhs, size_t off, size_t len) const ;
68
68
69
+ // if the given rhs is completely the same as itself
70
+ bool equal (const BitSet<N, I> &rhs) const ;
71
+
69
72
// THERE EXISTS WORD w such that ((w & mask) == eq)
70
73
// bool testAnyEq(size_t off, size_t len, const I &mask, const I &eq) const;
71
74
// FOR ALL ...
@@ -181,6 +184,19 @@ inline bool BitSet<N, I>::intersects(
181
184
return false ;
182
185
}
183
186
187
+ template <size_t N, typename I>
188
+ inline bool BitSet<N, I>::equal(const BitSet<N, I> &rhs) const {
189
+ bool result = true ;
190
+ for (size_t i = 0 ; i < N / BITS_PER_WORD; i++) {
191
+ result = (words[i] == rhs.words [i]) ? true : false ;
192
+ if (!result)
193
+ break ;
194
+ }
195
+ // padding will remain 0 since both padding are 0's
196
+ // 0 & 0 is 0 so no need special handling on padding
197
+ return result;
198
+ }
199
+
184
200
template <size_t N, typename I>
185
201
inline bool BitSet<N,I>::andNot(const BitSet<N,I> &rhs)
186
202
{
You can’t perform that action at this time.
0 commit comments