Change HpackHuffmanDecoder::CanonicalToSource() return type.

net/spdy/core/hpack/hpack_huffman_decoder.cc

 // Copyright 2016 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.
 //
 // Decoder for strings encoded using the HPACK Huffman Code (see
 // https://httpwg.github.io/specs/rfc7541.html#huffman.code).
 //
 // This implementation is inspired by the One-Shift algorithm described in
 // "On the Implementation of Minimum Redundancy Prefix Codes", by Alistair
 // Moffat and Andrew Turpin, 1997.
@@ skipping 274 matching lines @@
   // What is the position of the canonical symbol being decoded within
   // the canonical symbols of length |code_length|?
   HuffmanWord ordinal_in_length =
       ((bits - first_lj_code) >> (kHuffmanWordLength - code_length));
 
   // Combined these two to produce the position of the canonical symbol
   // being decoded within all of the canonical symbols.
   return first_canonical + ordinal_in_length;
 }
 
-char HpackHuffmanDecoder::CanonicalToSource(HuffmanWord canonical) {
+uint8_t HpackHuffmanDecoder::CanonicalToSource(HuffmanWord canonical) {
   DCHECK_LT(canonical, 256u);
-  return static_cast<char>(kCanonicalToSymbol[canonical]);
+  return kCanonicalToSymbol[canonical];
 }
 
 // TODO(jamessynge): Maybe further refactorings, including just passing in a
 // SpdyStringPiece instead of an HpackInputStream, thus avoiding the PeekBits
 // calls, and also allowing us to separate the code into portions dealing with
 // long strings, and a later portion dealing with the last few bytes of strings.
 // TODO(jamessynge): Determine if that is worth it by adding some counters to
 // measure the distribution of string sizes seen in practice.
 bool HpackHuffmanDecoder::DecodeString(HpackInputStream* in, SpdyString* out) {
   out->clear();
@@ skipping 83 matching lines @@
       // Get some more bits for decoding (up to 8). |peeked_success| is true
       // if we got any bits.
       peeked_success = in->PeekBits(&bits_available, &bits);
     }
     DLOG_IF(WARNING, (VLOG_IS_ON(2) && bits_available < 32 && !peeked_success))
         << "no more peeking possible";
   }
 }
 
 }  // namespace net