mirror of
https://github.com/RPCSX/llvm.git
synced 2024-11-30 23:20:54 +00:00
Recommit "Use unique_ptr to manager FilterChooser ownership."
Just using insert of a pair this time instead of emplace. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@217018 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
6426140b90
commit
732b026119
@ -230,7 +230,7 @@ protected:
|
||||
std::vector<unsigned> VariableInstructions;
|
||||
|
||||
// Map of well-known segment value to its delegate.
|
||||
std::map<unsigned, const FilterChooser*> FilterChooserMap;
|
||||
std::map<unsigned, std::unique_ptr<const FilterChooser>> FilterChooserMap;
|
||||
|
||||
// Number of instructions which fall under FilteredInstructions category.
|
||||
unsigned NumFiltered;
|
||||
@ -530,12 +530,6 @@ Filter::Filter(FilterChooser &owner, unsigned startBit, unsigned numBits,
|
||||
}
|
||||
|
||||
Filter::~Filter() {
|
||||
std::map<unsigned, const FilterChooser*>::iterator filterIterator;
|
||||
for (filterIterator = FilterChooserMap.begin();
|
||||
filterIterator != FilterChooserMap.end();
|
||||
filterIterator++) {
|
||||
delete filterIterator->second;
|
||||
}
|
||||
}
|
||||
|
||||
// Divides the decoding task into sub tasks and delegates them to the
|
||||
@ -557,14 +551,13 @@ void Filter::recurse() {
|
||||
|
||||
// Delegates to an inferior filter chooser for further processing on this
|
||||
// group of instructions whose segment values are variable.
|
||||
FilterChooserMap.insert(std::pair<unsigned, const FilterChooser*>(
|
||||
(unsigned)-1,
|
||||
new FilterChooser(Owner->AllInstructions,
|
||||
VariableInstructions,
|
||||
Owner->Operands,
|
||||
BitValueArray,
|
||||
*Owner)
|
||||
));
|
||||
FilterChooserMap.insert(std::make_pair(
|
||||
-1U,
|
||||
make_unique<FilterChooser>(Owner->AllInstructions,
|
||||
VariableInstructions,
|
||||
Owner->Operands,
|
||||
BitValueArray,
|
||||
*Owner)));
|
||||
}
|
||||
|
||||
// No need to recurse for a singleton filtered instruction.
|
||||
@ -590,14 +583,13 @@ void Filter::recurse() {
|
||||
|
||||
// Delegates to an inferior filter chooser for further processing on this
|
||||
// category of instructions.
|
||||
FilterChooserMap.insert(std::pair<unsigned, const FilterChooser*>(
|
||||
FilterChooserMap.insert(std::make_pair(
|
||||
mapIterator->first,
|
||||
new FilterChooser(Owner->AllInstructions,
|
||||
mapIterator->second,
|
||||
Owner->Operands,
|
||||
BitValueArray,
|
||||
*Owner)
|
||||
));
|
||||
make_unique<FilterChooser>(Owner->AllInstructions,
|
||||
mapIterator->second,
|
||||
Owner->Operands,
|
||||
BitValueArray,
|
||||
*Owner)));
|
||||
}
|
||||
}
|
||||
|
||||
@ -632,7 +624,8 @@ void Filter::emitTableEntry(DecoderTableInfo &TableInfo) const {
|
||||
// A new filter entry begins a new scope for fixup resolution.
|
||||
TableInfo.FixupStack.push_back(FixupList());
|
||||
|
||||
std::map<unsigned, const FilterChooser*>::const_iterator filterIterator;
|
||||
std::map<unsigned,
|
||||
std::unique_ptr<const FilterChooser>>::const_iterator filterIterator;
|
||||
|
||||
DecoderTable &Table = TableInfo.Table;
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user