1 // Copyright 2014 The Chromium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
5 #include "net/spdy/hpack_input_stream.h"
9 #include "base/basictypes.h"
10 #include "base/logging.h"
14 using base::StringPiece
;
17 HpackInputStream::HpackInputStream(uint32 max_string_literal_size
,
19 : max_string_literal_size_(max_string_literal_size
),
23 HpackInputStream::~HpackInputStream() {}
25 bool HpackInputStream::HasMoreData() const {
26 return !buffer_
.empty();
29 bool HpackInputStream::MatchPrefixAndConsume(HpackPrefix prefix
) {
30 DCHECK_GT(prefix
.bit_size
, 0u);
31 DCHECK_LE(prefix
.bit_size
, 8u);
34 size_t peeked_count
= 0;
36 if (!PeekBits(&peeked_count
, &peeked
))
39 if ((peeked
>> (32 - prefix
.bit_size
)) == prefix
.bits
) {
40 ConsumeBits(prefix
.bit_size
);
46 bool HpackInputStream::PeekNextOctet(uint8
* next_octet
) {
47 if ((bit_offset_
> 0) || buffer_
.empty())
50 *next_octet
= buffer_
[0];
54 bool HpackInputStream::DecodeNextOctet(uint8
* next_octet
) {
55 if (!PeekNextOctet(next_octet
))
58 buffer_
.remove_prefix(1);
62 bool HpackInputStream::DecodeNextUint32(uint32
* I
) {
63 size_t N
= 8 - bit_offset_
;
71 uint8 next_marker
= (1 << N
) - 1;
73 if (!DecodeNextOctet(&next_octet
))
75 *I
= next_octet
& next_marker
;
77 bool has_more
= (*I
== next_marker
);
79 while (has_more
&& (shift
< 32)) {
81 if (!DecodeNextOctet(&next_octet
))
83 has_more
= (next_octet
& 0x80) != 0;
85 uint32 addend
= next_octet
<< shift
;
86 // Check for overflow.
87 if ((addend
>> shift
) != next_octet
) {
97 bool HpackInputStream::DecodeNextIdentityString(StringPiece
* str
) {
99 if (!DecodeNextUint32(&size
))
102 if (size
> max_string_literal_size_
)
105 if (size
> buffer_
.size())
108 *str
= StringPiece(buffer_
.data(), size
);
109 buffer_
.remove_prefix(size
);
113 bool HpackInputStream::DecodeNextHuffmanString(const HpackHuffmanTable
& table
,
115 uint32 encoded_size
= 0;
116 if (!DecodeNextUint32(&encoded_size
))
119 if (encoded_size
> buffer_
.size())
122 HpackInputStream
bounded_reader(
123 max_string_literal_size_
,
124 StringPiece(buffer_
.data(), encoded_size
));
125 buffer_
.remove_prefix(encoded_size
);
127 // HpackHuffmanTable will not decode beyond |max_string_literal_size_|.
128 return table
.DecodeString(&bounded_reader
, max_string_literal_size_
, str
);
131 bool HpackInputStream::PeekBits(size_t* peeked_count
, uint32
* out
) {
132 size_t byte_offset
= (bit_offset_
+ *peeked_count
) / 8;
133 size_t bit_offset
= (bit_offset_
+ *peeked_count
) % 8;
135 if (*peeked_count
>= 32 || byte_offset
>= buffer_
.size()) {
138 // We'll read the minimum of the current byte remainder,
139 // and the remaining unfilled bits of |out|.
140 size_t bits_to_read
= std::min(32 - *peeked_count
, 8 - bit_offset
);
142 uint32 new_bits
= static_cast<uint32
>(buffer_
[byte_offset
]);
143 // Shift byte remainder to most-signifcant bits of |new_bits|.
144 // This drops the leading |bit_offset| bits of the byte.
145 new_bits
= new_bits
<< (24 + bit_offset
);
146 // Shift bits to the most-significant open bits of |out|.
147 new_bits
= new_bits
>> *peeked_count
;
149 CHECK_EQ(*out
& new_bits
, 0u);
152 *peeked_count
+= bits_to_read
;
156 void HpackInputStream::ConsumeBits(size_t bit_count
) {
157 size_t byte_count
= (bit_offset_
+ bit_count
) / 8;
158 bit_offset_
= (bit_offset_
+ bit_count
) % 8;
159 CHECK_GE(buffer_
.size(), byte_count
);
160 if (bit_offset_
!= 0) {
161 CHECK_GT(buffer_
.size(), 0u);
163 buffer_
.remove_prefix(byte_count
);
166 void HpackInputStream::ConsumeByteRemainder() {
167 if (bit_offset_
!= 0) {
168 ConsumeBits(8 - bit_offset_
);