Implement better HPACK Huffman code decoder.

net/spdy/hpack/hpack_huffman_table.cc

 // 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/spdy/hpack/hpack_huffman_table.h"
 
 #include <algorithm>
 #include <cmath>
+#include <memory>
 
 #include "base/logging.h"
 #include "base/numerics/safe_conversions.h"
 #include "net/spdy/hpack/hpack_input_stream.h"
 #include "net/spdy/hpack/hpack_output_stream.h"
 
 namespace net {
 
 using base::StringPiece;
 using std::string;
@@ skipping 237 matching lines @@
     CHECK_GT(code_by_id_.size(), symbol_id);
 
     bit_count += length_by_id_[symbol_id];
   }
   if (bit_count % 8 != 0) {
     bit_count += 8 - bit_count % 8;
   }
   return bit_count / 8;
 }
 
-bool HpackHuffmanTable::DecodeString(HpackInputStream* in,
-                                     size_t out_capacity,
-                                     string* out) const {
+bool HpackHuffmanTable::GenericDecodeString(HpackInputStream* in,
+                                            size_t out_capacity,
+                                            string* out) const {
   // Number of decode iterations required for a 32-bit code.
   const int kDecodeIterations = static_cast<int>(
       std::ceil((32.f - kDecodeTableRootBits) / kDecodeTableBranchBits));
 
   out->clear();
 
   // Current input, stored in the high |bits_available| bits of |bits|.
   uint32_t bits = 0;
   size_t bits_available = 0;
   bool peeked_success = in->PeekBits(&bits_available, &bits);
@@ skipping 36 matching lines @@
       bits = bits << entry.length;
       bits_available -= entry.length;
     }
     peeked_success = in->PeekBits(&bits_available, &bits);
   }
   NOTREACHED();
   return false;
 }
 
 }  // namespace net