Replace our homegrown ARRAY_SIZE() with Chrome's arraysize().

test/cctest/test-random-number-generator.cc

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 23 matching lines @@
 using namespace v8::internal;
 
 
 static const int kMaxRuns = 12345;
 static const int kRandomSeeds[] = {
   -1, 1, 42, 100, 1234567890, 987654321
 };
 
 
 TEST(RandomSeedFlagIsUsed) {
-  for (unsigned n = 0; n < ARRAY_SIZE(kRandomSeeds); ++n) {
+  for (unsigned n = 0; n < arraysize(kRandomSeeds); ++n) {
     FLAG_random_seed = kRandomSeeds[n];
     v8::Isolate* i = v8::Isolate::New();
     v8::base::RandomNumberGenerator& rng1 =
         *reinterpret_cast<Isolate*>(i)->random_number_generator();
     v8::base::RandomNumberGenerator rng2(kRandomSeeds[n]);
     for (int k = 1; k <= kMaxRuns; ++k) {
       int64_t i1, i2;
       rng1.NextBytes(&i1, sizeof(i1));
       rng2.NextBytes(&i2, sizeof(i2));
       CHECK_EQ(i2, i1);
       CHECK_EQ(rng2.NextInt(), rng1.NextInt());
       CHECK_EQ(rng2.NextInt(k), rng1.NextInt(k));
       CHECK_EQ(rng2.NextDouble(), rng1.NextDouble());
     }
     i->Dispose();
   }
 }