virtual Expected<TypeLeafKind>
visitTypeBegin(const CVRecord<TypeLeafKind> &Record) override {
- TypeLeafKind Kind = Record.Type;
+ // An implementation can calculate of visitTypeBegin() can calculate the
+ // kind based on an arbitrary factor, including the Type that is already
+ // specified in the Record. So, as we go through the pipeline invoking
+ // each visitor, update the state in a copy of the record so that each
+ // visitor in the pipeline sees the most recently value of the type.
+ CVRecord<TypeLeafKind> RecordCopy = Record;
for (auto Visitor : Pipeline) {
- if (auto ExpectedKind = Visitor->visitTypeBegin(Record))
- Kind = *ExpectedKind;
- else
+ if (auto ExpectedKind = Visitor->visitTypeBegin(RecordCopy)) {
+ RecordCopy.Type = *ExpectedKind;
+ } else
return ExpectedKind.takeError();
}
- return Kind;
+ return RecordCopy.Type;
}
virtual Error visitTypeEnd(const CVRecord<TypeLeafKind> &Record) override {
for (auto Visitor : Pipeline) {
Expected<TypeLeafKind>
visitTypeBegin(const CVRecord<TypeLeafKind> &Rec) override {
++Index;
- RawRecord = &Rec;
+ RawRecord = Rec;
return Rec.Type;
}
private:
template <typename T> Error verify(T &Rec) {
- uint32_t Hash = getTpiHash(Rec, *RawRecord);
+ uint32_t Hash = getTpiHash(Rec, RawRecord);
if (Hash % NumHashBuckets != HashValues[Index])
return errorInvalidHash();
return Error::success();
}
FixedStreamArray<support::ulittle32_t> HashValues;
- const CVRecord<TypeLeafKind> *RawRecord;
+ CVRecord<TypeLeafKind> RawRecord;
uint32_t NumHashBuckets;
uint32_t Index = -1;
};