fuzzers for VerifyNameMatch and VerifyNameInSubtree

net/base/fuzzed_data_provider.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.
 
 #include "net/base/fuzzed_data_provider.h"
 
 #include <algorithm>
 #include <limits>
 
 #include "base/logging.h"
 
 namespace net {
 
 FuzzedDataProvider::FuzzedDataProvider(const uint8_t* data, size_t size)
     : remaining_data_(reinterpret_cast<const char*>(data), size) {}
 
 FuzzedDataProvider::~FuzzedDataProvider() {}
 
 base::StringPiece FuzzedDataProvider::ConsumeBytes(size_t length) {
   length = std::min(length, remaining_data_.length());
   base::StringPiece result(remaining_data_.data(), length);
   remaining_data_ = remaining_data_.substr(length);
   return result;
 }
 
+base::StringPiece FuzzedDataProvider::ConsumeRemainingBytes() {
+  return ConsumeBytes(remaining_data_.length());
+}
+
 uint32_t FuzzedDataProvider::ConsumeValueInRange(uint32_t min, uint32_t max) {
   CHECK_LE(min, max);
 
   uint32_t range = max - min;
   uint32_t offset = 0;
   uint32_t result = 0;
 
   while ((range >> offset) > 0 && !remaining_data_.empty()) {
     // Pull bytes off the end of the seed data. Experimentally, this seems to
     // allow the fuzzer to more easily explore the input space. This makes
@@ skipping 22 matching lines @@
     return ConsumeValueInRange(0, std::numeric_limits<uint32_t>::max());
   return ConsumeValueInRange(0, (1 << num_bits) - 1);
 }
 
 bool FuzzedDataProvider::ConsumeBool() {
   // Double negation so this returns false once there's no more data.
   return !!ConsumeBits(1);
 }
 
 }  // namespace net