Lines Matching defs:pattern
82 // Start as a no-match pattern. A negative match location is used so that
84 std::unique_ptr<Pattern> pattern =
93 // Check if found pattern is better than previous
94 if (temp_pattern->getSizeBits() < pattern->getSizeBits()) {
95 pattern = std::move(temp_pattern);
100 patternStats[pattern->getPatternNumber()]++;
103 if ((numEntries < dictionarySize) && pattern->shouldAllocate()) {
107 return pattern;
140 // Append to pattern list
148 // Set compression latency (Accounts for pattern matching, length
160 CPack::decompressWord(const Pattern* pattern)
167 std::advance(entry_it, pattern->getMatchLocation());
171 if (pattern->decompress(*entry_it, data)) {
209 // We store the frequency of each pattern
212 .name(name() + ".pattern")
213 .desc("Number of data entries that were compressed to this pattern.")
218 patternStats.subdesc(i, "Number of data entries that match pattern " +