Improve base::RandBytes() performance by 1.75x-2.10x on POSIX.

base/rand_util_unittest.cc

 // Copyright (c) 2011 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 "base/rand_util.h"
 
 #include <algorithm>
 #include <limits>
 
+#include "base/logging.h"
+#include "base/memory/scoped_ptr.h"
+#include "base/time/time.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace {
 
 const int kIntMin = std::numeric_limits<int>::min();
 const int kIntMax = std::numeric_limits<int>::max();
 
 }  // namespace
 
 TEST(RandUtilTest, SameMinAndMax) {
@@ skipping 93 matching lines @@
     uint64 value = base::RandUint64();
     found_ones |= value;
     found_zeros &= value;
 
     if (found_zeros == kAllZeros && found_ones == kAllOnes)
       return;
   }
 
   FAIL() << "Didn't achieve all bit values in maximum number of tries.";
 }
+
+// Benchmark test for RandBytes().  Disabled since it's intentionally slow and
+// does not test anything that isn't already tested by the existing RandBytes()
+// tests.
+TEST(RandUtilTest, DISABLED_RandBytesPerf) {
+  // Benchmark the performance of |kTestIterations| of RandBytes() using a
+  // buffer size of |kTestBufferSize|.
+  const int kTestIterations = 10;
+  const size_t kTestBufferSize = 1 * 1024 * 1024;
+
+  scoped_ptr<uint8[]> buffer(new uint8[kTestBufferSize]);
+  const base::TimeTicks now = base::TimeTicks::HighResNow();
+  for (int i = 0; i < kTestIterations; ++i)
+    base::RandBytes(buffer.get(), kTestBufferSize);
+  const base::TimeTicks end = base::TimeTicks::HighResNow();
+
+  LOG(INFO) << "RandBytes(" << kTestBufferSize << ") took: "
+            << (end - now).InMicroseconds() << "µs";
+}