huffman.hh

Go to the documentation of this file.

/*
 * Copyright (c) 2019, 2020 Inria
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met: redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer;
 * redistributions in binary form must reproduce the above copyright
 * notice, this list of conditions and the following disclaimer in the
 * documentation and/or other materials provided with the distribution;
 * neither the name of the copyright holders nor the names of its
 * contributors may be used to endorse or promote products derived from
 * this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#ifndef __MEM_CACHE_COMPRESSORS_ENCODERS_HUFFMAN_HH__
#define __MEM_CACHE_COMPRESSORS_ENCODERS_HUFFMAN_HH__
 
#include <cassert>
#include <cstdint>
#include <map>
#include <memory>
#include <queue>
#include <vector>
 
#include "mem/cache/compressors/encoders/base.hh"
 
namespace Compressor {
namespace Encoder {
 
class Huffman : public Base
{
  public:
    Huffman(uint64_t max_code_length);
    ~Huffman() = default;
 
    void sample(uint64_t value, uint64_t frequency);
 
    void generateCodeMaps();
 
    Code encode(const uint64_t val) const override;
    uint64_t decode(const uint64_t code) const override;
 
  private:
    class Node
    {
      private:
        const uint64_t _frequency;
 
        const uint64_t _value;
 
        std::unique_ptr<Node> _left;
 
        std::unique_ptr<Node> _right;
 
      public:
        Node(uint64_t value, uint64_t frequency)
          : _frequency(frequency), _value(value), _left(), _right()
        {
        }
 
        Node(Node* left, Node* right)
          : _frequency(left->getFrequency() + right->getFrequency()),
            _value(0), _left(left), _right(right)
        {
        }
 
        uint64_t getFrequency() const { return _frequency; }
 
        bool
        isLeaf() const
        {
            return (_left == nullptr) && (_right == nullptr);
        }
 
        uint64_t
        getValue() const
        {
            assert(isLeaf());
            return _value;
        }
 
        const Node* getLeftSubTree() const { return _left.get(); }
        const Node* getRightSubTree() const { return _right.get(); }
    };
 
    const unsigned maxCodeLength;
 
    std::map<uint64_t, Code> valueToCode;
    std::map<uint64_t, uint64_t> codeToValue;
 
    struct NodeComparator
    {
        bool
        operator()(const Node* lhs, const Node* rhs) const
        {
            return lhs->getFrequency() > rhs->getFrequency();
        }
    };
    std::priority_queue<Node*, std::vector<Node*>, NodeComparator> trees;
 
    std::unique_ptr<Node> buildTree();
 
    void generateCodes(const Node* node, const Code& current_code);
};
 
} // namespace Encoder
} // namespace Compressor
 
#endif //__MEM_CACHE_COMPRESSORS_ENCODERS_HUFFMAN_HH__