blob: e8b07f1ccbcc9bcb6c679134f236fbc04140d83d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
// 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.
#include "net/third_party/quiche/src/spdy/core/hpack/hpack_static_table.h"
#include "net/third_party/quiche/src/common/platform/api/quiche_string_piece.h"
#include "net/third_party/quiche/src/spdy/core/hpack/hpack_constants.h"
#include "net/third_party/quiche/src/spdy/core/hpack/hpack_entry.h"
#include "net/third_party/quiche/src/spdy/platform/api/spdy_estimate_memory_usage.h"
#include "net/third_party/quiche/src/spdy/platform/api/spdy_logging.h"
namespace spdy {
HpackStaticTable::HpackStaticTable() = default;
HpackStaticTable::~HpackStaticTable() = default;
void HpackStaticTable::Initialize(const HpackStaticEntry* static_entry_table,
size_t static_entry_count) {
CHECK(!IsInitialized());
int total_insertions = 0;
for (const HpackStaticEntry* it = static_entry_table;
it != static_entry_table + static_entry_count; ++it) {
static_entries_.push_back(
HpackEntry(quiche::QuicheStringPiece(it->name, it->name_len),
quiche::QuicheStringPiece(it->value, it->value_len),
true, // is_static
total_insertions));
HpackEntry* entry = &static_entries_.back();
CHECK(static_index_.insert(entry).second);
// Multiple static entries may have the same name, so inserts may fail.
static_name_index_.insert(std::make_pair(entry->name(), entry));
++total_insertions;
}
}
bool HpackStaticTable::IsInitialized() const {
return !static_entries_.empty();
}
size_t HpackStaticTable::EstimateMemoryUsage() const {
return SpdyEstimateMemoryUsage(static_entries_) +
SpdyEstimateMemoryUsage(static_index_) +
SpdyEstimateMemoryUsage(static_name_index_);
}
} // namespace spdy
|
