cache/compressors/bdi.cc

95     // Set base value
96     base = rep_value;
105     return base;
115     size += sizeof(base)*CHAR_BIT;
157     // Push virtual base 0 to bases list
183 BDI::BDICompDataBaseDelta<TB, TD>::addBase(const TB base)
185     // Can't add base if reached limit of number of bases
190     // Push new base to end of bases list
191     bases.push_back(base);
193     // New delta is 0, as it is a difference between the new base and itself
204     // Insert new delta with respect to the given base
227             // Calculate delta relative to currently parsed base
243         // If we cannot find a base that can accommodate this new line's data,
244         // add this value as the new base and insert its respective delta of 0.
245         // If the new base can't be added, it means that we reached the base
262     // We decompress all base-delta pairs that form the 64-bit entry
266     // Get relationship between the size of an uint64_t base and size of TB
269     // Mask for a base entry
272     // Size, in bits, of a base entry. Cant be const because compiler will
277     // Concatenate all base-delta entries until they form a 64-bit entry
280         // Get base and delta entries corresponding to the current delta
285         const TB base = bases[base_index];
289         value |= static_cast<uint64_t>((base + delta) & mask);
373         // Check which base-delta size combination is the best. This is
380                 // one size smaller than the base size, otherwise just parse
382                 // size per base size, we use less area and energy, at the
411                     fatal("Invalid combination of base and delta sizes.");
433         // optimization: assume that all compressors with a given base size
436         // it loses the time of the worst base size (2 bytes per cycle)