Cross Reference: /external/llvm/utils/TableGen/FixedLenDecoderEmitter.cpp

Lines Matching defs:Filter
91 /// Filter - Filter works with FilterChooser to produce the decoding tree for
94 /// It is useful to think of a Filter as governing the switch stmts of the
98 /// chooses a best Filter to do its job.
102 /// the Filter/FilterChooser combo does not know how to distinguish among the
127 class Filter {
163   Filter(const Filter &f);
164   Filter(FilterChooser &owner, unsigned startBit, unsigned numBits, bool mixed);
166   ~Filter();
182 }; // End of class Filter
206 /// It is useful to think of a Filter as governing the switch stmts of the
211   friend class Filter;
223   std::vector<Filter> Filters;
324   Filter &bestFilter() {
329   // Called from Filter::recurse() when singleton exists.  For debug purpose.
360                             const Filter &Best) const;
391 // Filter Implementation //
395 Filter::Filter(const Filter &f)
403 Filter::Filter(FilterChooser &owner, unsigned startBit, unsigned numBits,
435          && "Filter returns no instruction categories");
438 Filter::~Filter() {
453 void Filter::recurse() {
479   // See also Filter::emit().
513 void Filter::emit(raw_ostream &o, unsigned &Indentation) const {
574 unsigned Filter::usefulness() const {
671 // Called from Filter::recurse() when singleton exists.  For debug purpose.
983                                          const Filter &Best) const {
1002   Filter F(*this, startBit, numBit, true);
1004   BestIndex = 0; // Sole Filter instance to choose from.
1013     Filters.push_back(Filter(*this, StartBit, BitIndex - StartBit, true));
1015     Filters.push_back(Filter(*this, StartBit, BitIndex - StartBit, false));
1026   assert(numInstructions && "Filter created with no instructions");
1076   // Filter::recurse() set either BIT_TRUE or BIT_FALSE for each position.
1288     const Filter &Best = Filters[BestIndex];