[test] Move cctest/test-bit-vector to unittests

... /utils/bit-vector-unittest.

Bug: v8:12781
Change-Id: I26b9c2b8a911b513d65d54476b78a0bbac7aa78f
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3596445Reviewed-by: Leszek Swirski <leszeks@chromium.org>
Commit-Queue: 王澳 <wangao.james@bytedance.com>
Cr-Commit-Position: refs/heads/main@{#80086}

test/cctest/BUILD.gn

@@ -195,7 +195,6 @@ v8_source_set("cctest_sources") {
     "test-atomicops.cc",
     "test-bignum-dtoa.cc",
     "test-bignum.cc",
-    "test-bit-vector.cc",
     "test-circular-queue.cc",
     "test-code-layout.cc",
     "test-code-pages.cc",

test/unittests/BUILD.gn

@@ -399,6 +399,7 @@ v8_source_set("unittests_sources") {
     "torque/torque-unittest.cc",
     "torque/torque-utils-unittest.cc",
     "utils/allocation-unittest.cc",
+    "utils/bit-vector-unittest.cc",
     "utils/detachable-vector-unittest.cc",
     "utils/locked-queue-unittest.cc",
     "utils/utils-unittest.cc",

test/cctest/test-bit-vector.cc → test/unittests/utils/bit-vector-unittest.cc

-// Copyright 2012 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
-//       with the distribution.
-//     * Neither the name of Google Inc. nor the names of its
-//       contributors may be used to endorse or promote products derived
-//       from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// Copyright 2022 the V8 project 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 "src/utils/bit-vector.h"
 
 #include <stdlib.h>
 
 #include "src/init/v8.h"
-
-#include "src/utils/bit-vector.h"
-#include "test/cctest/cctest.h"
+#include "test/unittests/test-utils.h"
+#include "testing/gtest/include/gtest/gtest.h"
 
 namespace v8 {
 namespace internal {
 
-TEST(BitVector) {
+using BitVectorTest = TestWithIsolate;
+
+TEST_F(BitVectorTest, BitVector) {
   v8::internal::AccountingAllocator allocator;
   Zone zone(&allocator, ZONE_NAME);
   {
     BitVector v(15, &zone);
     v.Add(1);
-    CHECK(v.Contains(1));
+    EXPECT_TRUE(v.Contains(1));
     v.Remove(0);
-    CHECK(!v.Contains(0));
+    EXPECT_TRUE(!v.Contains(0));
     v.Add(0);
     v.Add(1);
     BitVector w(15, &zone);
     w.Add(1);
     v.Intersect(w);
-    CHECK(!v.Contains(0));
-    CHECK(v.Contains(1));
+    EXPECT_TRUE(!v.Contains(0));
+    EXPECT_TRUE(v.Contains(1));
   }
 
   {
@@ -61,19 +41,19 @@ TEST(BitVector) {
     v.Add(33);
     BitVector::Iterator iter = v.begin();
     BitVector::Iterator end = v.end();
-    CHECK_NE(iter, end);
-    CHECK_EQ(27, *iter);
+    EXPECT_NE(iter, end);
+    EXPECT_EQ(27, *iter);
     ++iter;
-    CHECK_NE(iter, end);
-    CHECK_EQ(30, *iter);
+    EXPECT_NE(iter, end);
+    EXPECT_EQ(30, *iter);
     ++iter;
-    CHECK_NE(iter, end);
-    CHECK_EQ(31, *iter);
+    EXPECT_NE(iter, end);
+    EXPECT_EQ(31, *iter);
     ++iter;
-    CHECK_NE(iter, end);
-    CHECK_EQ(33, *iter);
+    EXPECT_NE(iter, end);
+    EXPECT_EQ(33, *iter);
     ++iter;
-    CHECK(!(iter != end));
+    EXPECT_TRUE(!(iter != end));
   }
 
   {
@@ -82,8 +62,8 @@ TEST(BitVector) {
     BitVector w(15, &zone);
     w.Add(1);
     v.Union(w);
-    CHECK(v.Contains(0));
-    CHECK(v.Contains(1));
+    EXPECT_TRUE(v.Contains(0));
+    EXPECT_TRUE(v.Contains(1));
   }
 
   {
@@ -91,14 +71,14 @@ TEST(BitVector) {
     v.Add(0);
     BitVector w(15, &zone);
     w.CopyFrom(v);
-    CHECK(w.Contains(0));
+    EXPECT_TRUE(w.Contains(0));
     w.Add(1);
     BitVector u(w, &zone);
-    CHECK(u.Contains(0));
-    CHECK(u.Contains(1));
+    EXPECT_TRUE(u.Contains(0));
+    EXPECT_TRUE(u.Contains(1));
     v.Union(w);
-    CHECK(v.Contains(0));
-    CHECK(v.Contains(1));
+    EXPECT_TRUE(v.Contains(0));
+    EXPECT_TRUE(v.Contains(1));
   }
 
   {
@@ -107,8 +87,8 @@ TEST(BitVector) {
     BitVector w(35, &zone);
     w.Add(33);
     v.Union(w);
-    CHECK(v.Contains(0));
-    CHECK(v.Contains(33));
+    EXPECT_TRUE(v.Contains(0));
+    EXPECT_TRUE(v.Contains(33));
   }
 
   {
@@ -118,35 +98,35 @@ TEST(BitVector) {
     BitVector w(35, &zone);
     w.Add(33);
     v.Intersect(w);
-    CHECK(!v.Contains(32));
-    CHECK(v.Contains(33));
+    EXPECT_TRUE(!v.Contains(32));
+    EXPECT_TRUE(v.Contains(33));
     BitVector r(35, &zone);
     r.CopyFrom(v);
-    CHECK(!r.Contains(32));
-    CHECK(r.Contains(33));
+    EXPECT_TRUE(!r.Contains(32));
+    EXPECT_TRUE(r.Contains(33));
   }
 
   {
     BitVector v(35, &zone);
     v.Add(32);
     v.Add(33);
-    CHECK(v.Contains(32));
-    CHECK(v.Contains(33));
-    CHECK(!v.Contains(22));
-    CHECK(!v.Contains(34));
+    EXPECT_TRUE(v.Contains(32));
+    EXPECT_TRUE(v.Contains(33));
+    EXPECT_TRUE(!v.Contains(22));
+    EXPECT_TRUE(!v.Contains(34));
     v.Resize(50, &zone);
-    CHECK(v.Contains(32));
-    CHECK(v.Contains(33));
-    CHECK(!v.Contains(22));
-    CHECK(!v.Contains(34));
-    CHECK(!v.Contains(43));
+    EXPECT_TRUE(v.Contains(32));
+    EXPECT_TRUE(v.Contains(33));
+    EXPECT_TRUE(!v.Contains(22));
+    EXPECT_TRUE(!v.Contains(34));
+    EXPECT_TRUE(!v.Contains(43));
     v.Resize(300, &zone);
-    CHECK(v.Contains(32));
-    CHECK(v.Contains(33));
-    CHECK(!v.Contains(22));
-    CHECK(!v.Contains(34));
-    CHECK(!v.Contains(43));
-    CHECK(!v.Contains(243));
+    EXPECT_TRUE(v.Contains(32));
+    EXPECT_TRUE(v.Contains(33));
+    EXPECT_TRUE(!v.Contains(22));
+    EXPECT_TRUE(!v.Contains(34));
+    EXPECT_TRUE(!v.Contains(43));
+    EXPECT_TRUE(!v.Contains(243));
   }
 }