fuzzers for VerifyNameMatch and VerifyNameInSubtree

net/cert/internal/verify_name_match_verifynameinsubtree_fuzzer.cc

Index: net/cert/internal/verify_name_match_verifynameinsubtree_fuzzer.cc
diff --git a/net/cert/internal/verify_name_match_verifynameinsubtree_fuzzer.cc b/net/cert/internal/verify_name_match_verifynameinsubtree_fuzzer.cc
new file mode 100644
index 0000000000000000000000000000000000000000..0097d96b8b9ee3f85c996e5a80fd4880ec35f05f
--- /dev/null
+++ b/net/cert/internal/verify_name_match_verifynameinsubtree_fuzzer.cc
@@ -0,0 +1,25 @@
+// 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/cert/internal/verify_name_match.h"
+
+#include "net/base/fuzzed_data_provider.h"
+#include "net/der/input.h"
+
+// Entry point for LibFuzzer.
+extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
+  net::FuzzedDataProvider fuzzed_data(data, size);
+  size_t first_part_size = fuzzed_data.ConsumeValueInRange(0, 0xFFFF);
+  base::StringPiece first_part = fuzzed_data.ConsumeBytes(first_part_size);
+  base::StringPiece second_part = fuzzed_data.ConsumeRemainingBytes();
+
+  net::der::Input in1(first_part);
+  net::der::Input in2(second_part);
+  bool match = net::VerifyNameInSubtree(in1, in2);
+  bool reverse_order_match = net::VerifyNameInSubtree(in2, in1);
+  // If both InSubtree matches are true, then in1 == in2 (modulo normalization).
+  if (match && reverse_order_match)
+    CHECK(net::VerifyNameMatch(in1, in2));
+  return 0;
+}