// Copyright (c) Google LLC 2019

//

// Use of this source code is governed by an MIT-style

// license that can be found in the LICENSE file or at

// https://opensource.org/licenses/MIT.

#ifndef BRUNSLI_DEC_BRUNSLI_INPUT_H_

#define BRUNSLI_DEC_BRUNSLI_INPUT_H_

#include <brunsli/types.h>

#include "../common/platform.h"

namespace brunsli {

static const int kBitMask[] = {0,    1,    3,     7,     15,   31,

                               63,   127,  255,   511,   1023, 2047,

                               4095, 8191, 16383, 32767, 65535};

struct WordSource {

  WordSource(const uint8_t* data, size_t len, bool optimistic)

      : data_(data),

        len_(len & ~1),

        pos_(0),

        error_(false),

        optimistic_(optimistic) {}

  uint16_t GetNextWord() {

    uint16_t val = 0;

    if (pos_ < len_) { /* NB: both pos_ and len_ are even. */

      val = BRUNSLI_UNALIGNED_LOAD16LE(data_ + pos_);

    } else {

      error_ = true;

    }

    // TODO(eustas): take care of overflows?

    pos_ += 2;

    return val;

  }

  bool CanRead(size_t n) {

    if (optimistic_) return true;

    size_t delta = 2 * n;

    size_t projected_end = pos_ + delta;

    // Check for overflow; just in case.

    if (projected_end < pos_) return false;

    return projected_end <= len_;

  }

  const uint8_t* data_;

  size_t len_;

  size_t pos_;

  bool error_;

  bool optimistic_;

};

struct BitSource {

  BitSource() {}

  void Init(WordSource* in) {

    val_ = in->GetNextWord();

    bit_pos_ = 0;

  }

  uint32_t ReadBits(int nbits, WordSource* in) {

    if (bit_pos_ + nbits > 16) {

      uint32_t new_bits = in->GetNextWord();

      val_ |= new_bits << 16;

    }

    uint32_t result = (val_ >> bit_pos_) & kBitMask[nbits];

    bit_pos_ += nbits;

    if (bit_pos_ > 16) {

      bit_pos_ -= 16;

      val_ >>= 16;

    }

    return result;

  }

  bool Finish() {

    size_t n_bits = 16 - bit_pos_;

    if (n_bits > 0) {

      int padding_bits = (val_ >> bit_pos_) & kBitMask[n_bits];

      if (padding_bits != 0) return false;

    }

    return true;

  }

  uint32_t val_;

  int bit_pos_;

};

}  // namespace brunsli

#endif  // BRUNSLI_DEC_BRUNSLI_INPUT_H_