view test/hotspot/gtest/utilities/test_count_trailing_zeros.cpp @ 50525:767cdb97f103

8204210: Implementation: JEP 333: ZGC: A Scalable Low-Latency Garbage Collector (Experimental) Reviewed-by: pliden, stefank, eosterlund, ehelin, sjohanss, rbackman, coleenp, ihse, jgeorge, lmesnik, rkennke Contributed-by: per.liden@oracle.com, stefan.karlsson@oracle.com, erik.osterlund@oracle.com, mikael.gerdin@oracle.com, kim.barrett@oracle.com, nils.eliasson@oracle.com, rickard.backman@oracle.com, rwestrel@redhat.com, coleen.phillimore@oracle.com, robbin.ehn@oracle.com, gerard.ziemski@oracle.com, hugh.wilkinson@intel.com, sandhya.viswanathan@intel.com, bill.npo.wheeler@intel.com, vinay.k.awasthi@intel.com, yasuenag@gmail.com
author pliden
date Tue, 12 Jun 2018 17:40:28 +0200
parents cda23e690843
children bc20d0376402
line wrap: on
line source
/*
 * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 *
 */

#include "precompiled.hpp"
#include "utilities/count_trailing_zeros.hpp"
#include "utilities/globalDefinitions.hpp"
#include "unittest.hpp"

TEST(count_trailing_zeros, one_or_two_set_bits) {
  unsigned i = 0;               // Position of a set bit.
  for (uintx ix = 1; ix != 0; ix <<= 1, ++i) {
    unsigned j = 0;             // Position of a set bit.
    for (uintx jx = 1; jx != 0; jx <<= 1, ++j) {
      uintx value = ix | jx;
      EXPECT_EQ(MIN2(i, j), count_trailing_zeros(value))
        << "value = " << value;
    }
  }
}

TEST(count_trailing_zeros, all_ones_followed_by_all_zeros) {
  unsigned i = BitsPerWord - 1; // Index of most significant set bit.
  uintx value = ~(uintx)0;
  for ( ; value != 0; value >>= 1, --i) {
    EXPECT_EQ(0u, count_trailing_zeros(value))
      << "value = " << value;
  }
}

TEST(count_trailing_zeros, all_zeros_followed_by_all_ones) {
  unsigned i = 0;               // Index of least significant set bit.
  uintx value = ~(uintx)0;
  for ( ; value != 0; value <<= 1, ++i) {
    EXPECT_EQ(i, count_trailing_zeros(value))
      << "value = " << value;
  }
}