// Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifndef QUICHE_HTTP2_HPACK_HPACK_HEADER_TABLE_H_
#define QUICHE_HTTP2_HPACK_HPACK_HEADER_TABLE_H_

#include <cstddef>
#include <memory>
#include <vector>

#include "absl/container/chunked_queue.h"
#include "absl/container/flat_hash_map.h"
#include "absl/container/flat_hash_set.h"
#include "absl/hash/hash.h"
#include "absl/strings/string_view.h"
#include "quiche/http2/hpack/hpack_entry.h"
#include "quiche/common/platform/api/quiche_export.h"

// All section references below are to http://tools.ietf.org/html/rfc7541.

namespace spdy {

namespace test {
class HpackHeaderTablePeer;
}  // namespace test

// Return value of GetByName() and GetByNameAndValue() if matching entry is not
// found.  This value is never used in HPACK for indexing entries, see
// https://httpwg.org/specs/rfc7541.html#index.address.space.
inline constexpr size_t kHpackEntryNotFound = 0;

// A data structure for the static table (2.3.1) and the dynamic table (2.3.2).
class QUICHE_EXPORT HpackHeaderTable {
 public:
  friend class test::HpackHeaderTablePeer;

  // Use a lightweight, memory efficient container for the static table, which
  // is initialized once and never changed after.
  using StaticEntryTable = std::vector<HpackEntry>;

  // HpackHeaderTable takes advantage of the deque property that references
  // remain valid, so long as insertions & deletions are at the head & tail.
  using DynamicEntryTable = absl::chunked_queue<HpackEntry, 4, 64>;

  using NameValueToEntryMap = absl::flat_hash_map<HpackLookupEntry, size_t>;
  using NameToEntryMap = absl::flat_hash_map<absl::string_view, size_t>;

  HpackHeaderTable();
  HpackHeaderTable(const HpackHeaderTable&) = delete;
  HpackHeaderTable& operator=(const HpackHeaderTable&) = delete;

  ~HpackHeaderTable();

  // Last-acknowledged value of SETTINGS_HEADER_TABLE_SIZE.
  size_t settings_size_bound() const { return settings_size_bound_; }

  // Current and maximum estimated byte size of the table, as described in
  // 4.1. Notably, this is /not/ the number of entries in the table.
  size_t size() const { return size_; }
  size_t max_size() const { return max_size_; }

  // The HPACK indexing scheme used by GetByName() and GetByNameAndValue() is
  // defined at https://httpwg.org/specs/rfc7541.html#index.address.space.

  // Returns the index of the lowest-index entry matching |name|,
  // or kHpackEntryNotFound if no matching entry is found.
  size_t GetByName(absl::string_view name);

  // Returns the index of the lowest-index entry matching |name| and |value|,
  // or kHpackEntryNotFound if no matching entry is found.
  size_t GetByNameAndValue(absl::string_view name, absl::string_view value);

  // Sets the maximum size of the header table, evicting entries if
  // necessary as described in 5.2. The value of `max_size` must not exceed
  // `settings_size_bound()`.
  void SetMaxSize(size_t max_size);

  // Sets the SETTINGS_HEADER_TABLE_SIZE bound of the table. Will call
  // SetMaxSize() as needed to preserve max_size() <= settings_size_bound().
  void SetSettingsHeaderTableSize(size_t settings_size);

  // Determine the set of entries which would be evicted by the insertion
  // of |name| & |value| into the table, as per section 4.4. No eviction
  // actually occurs. The set is returned via range [begin_out, end_out).
  void EvictionSet(absl::string_view name, absl::string_view value,
                   DynamicEntryTable::iterator* begin_out,
                   DynamicEntryTable::iterator* end_out);

  // Adds an entry for the representation, evicting entries as needed. |name|
  // and |value| must not point to an entry in |dynamic_entries_| which is about
  // to be evicted, but they may point to an entry which is not.
  void TryAddEntry(absl::string_view name, absl::string_view value);

 private:
  // Returns number of evictions required to enter |name| & |value|.
  size_t EvictionCountForEntry(absl::string_view name,
                               absl::string_view value) const;

  // Returns number of evictions required to reclaim |reclaim_size| table size.
  size_t EvictionCountToReclaim(size_t reclaim_size) const;

  // Evicts |count| oldest entries from the table.
  void Evict(size_t count);

  // |static_entries_|, |static_index_|, and |static_name_index_| are owned by
  // HpackStaticTable singleton.

  // Stores HpackEntries.
  const StaticEntryTable& static_entries_;
  DynamicEntryTable dynamic_entries_;

  // Tracks the index of the unique HpackEntry for a given header name and
  // value.  Keys consist of string_views that point to strings stored in
  // |static_entries_|.
  const NameValueToEntryMap& static_index_;

  // Tracks the index of the first static entry for each name in the static
  // table.  Each key is a string_view that points to a name string stored in
  // |static_entries_|.
  const NameToEntryMap& static_name_index_;

  struct NameValueHash {
    using is_transparent = void;
    size_t operator()(const HpackEntry* entry) const {
      return absl::HashOf(entry->name(), entry->value());
    }
    size_t operator()(const HpackLookupEntry& entry) const {
      return absl::HashOf(entry.name, entry.value);
    }
  };
  struct NameValueEq {
    using is_transparent = void;
    bool operator()(const HpackEntry* lhs, const HpackEntry* rhs) const {
      return lhs->name() == rhs->name() && lhs->value() == rhs->value();
    }
    bool operator()(const HpackEntry* lhs, const HpackLookupEntry& rhs) const {
      return lhs->name() == rhs.name && lhs->value() == rhs.value;
    }
  };

  struct NameHash {
    using is_transparent = void;
    size_t operator()(const HpackEntry* entry) const {
      return absl::HashOf(entry->name());
    }
    size_t operator()(absl::string_view name) const {
      return absl::HashOf(name);
    }
  };
  struct NameEq {
    using is_transparent = void;
    bool operator()(const HpackEntry* lhs, const HpackEntry* rhs) const {
      return lhs->name() == rhs->name();
    }
    bool operator()(const HpackEntry* lhs, absl::string_view rhs) const {
      return lhs->name() == rhs;
    }
  };

  using DynamicIndexSet =
      absl::flat_hash_set<const HpackEntry*, NameValueHash, NameValueEq>;
  using DynamicNameIndexSet =
      absl::flat_hash_set<const HpackEntry*, NameHash, NameEq>;

  // Tracks the most recently inserted HpackEntry for a given header name and
  // value. Stored as a set of HpackEntry pointers to look up string data in
  // |dynamic_entries_| without duplicating string keys.
  DynamicIndexSet dynamic_index_;

  // Tracks the most recently inserted HpackEntry for a given header name.
  // Stored as a set of HpackEntry pointers to look up string data in
  // |dynamic_entries_| without duplicating string keys.
  DynamicNameIndexSet dynamic_name_index_;

  // Last acknowledged value for SETTINGS_HEADER_TABLE_SIZE.
  size_t settings_size_bound_;

  // Estimated current and maximum byte size of the table.
  // |max_size_| <= |settings_size_bound_|
  size_t size_;
  size_t max_size_;

  // Total number of dynamic table insertions so far
  // (including entries that have been evicted).
  size_t dynamic_table_insertions_;
};

}  // namespace spdy

#endif  // QUICHE_HTTP2_HPACK_HPACK_HEADER_TABLE_H_