Lines Matching defs:Filter
183 /// Filter - Filter works with FilterChooser to produce the decoding tree for
186 /// It is useful to think of a Filter as governing the switch stmts of the
190 /// chooses a best Filter to do its job.
194 /// the Filter/FilterChooser combo does not know how to distinguish among the
220 class Filter {
256 Filter(const Filter &f);
257 Filter(FilterChooser &owner, unsigned startBit, unsigned numBits, bool mixed);
259 ~Filter();
276 }; // End of class Filter
301 /// It is useful to think of a Filter as governing the switch stmts of the
307 friend class Filter;
319 std::vector<Filter> Filters;
415 Filter &bestFilter() {
420 // Called from Filter::recurse() when singleton exists. For debug purpose.
455 const Filter &Best) const;
490 // Filter Implementation //
494 Filter::Filter(const Filter &f)
502 Filter::Filter(FilterChooser &owner, unsigned startBit, unsigned numBits,
534 && "Filter returns no instruction categories");
537 Filter::~Filter() {
552 void Filter::recurse() {
576 // See also Filter::emit*().
632 void Filter::emitTableEntry(DecoderTableInfo &TableInfo) const {
707 unsigned Filter::usefulness() const {
976 // Called from Filter::recurse() when singleton exists. For debug purpose.
1361 const Filter &Best) const {
1383 Filter F(*this, startBit, numBit, true);
1385 BestIndex = 0; // Sole Filter instance to choose from.
1394 Filters.push_back(Filter(*this, StartBit, BitIndex - StartBit, true));
1396 Filters.push_back(Filter(*this, StartBit, BitIndex - StartBit, false));
1407 assert(numInstructions && "Filter created with no instructions");
1457 // Filter::recurse() set either BIT_TRUE or BIT_FALSE for each position.
1670 const Filter &Best = Filters[BestIndex];