michael@0: /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
michael@0: /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this file,
michael@0:  * You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: #include "mozilla/MathAlgorithms.h"
michael@0: 
michael@0: using mozilla::CeilingLog2;
michael@0: using mozilla::FloorLog2;
michael@0: using mozilla::RoundUpPow2;
michael@0: 
michael@0: static void
michael@0: TestCeiling()
michael@0: {
michael@0:   for (uint32_t i = 0; i <= 1; i++)
michael@0:     MOZ_RELEASE_ASSERT(CeilingLog2(i) == 0);
michael@0: 
michael@0:   for (uint32_t i = 2; i <= 2; i++)
michael@0:     MOZ_RELEASE_ASSERT(CeilingLog2(i) == 1);
michael@0: 
michael@0:   for (uint32_t i = 3; i <= 4; i++)
michael@0:     MOZ_RELEASE_ASSERT(CeilingLog2(i) == 2);
michael@0: 
michael@0:   for (uint32_t i = 5; i <= 8; i++)
michael@0:     MOZ_RELEASE_ASSERT(CeilingLog2(i) == 3);
michael@0: 
michael@0:   for (uint32_t i = 9; i <= 16; i++)
michael@0:     MOZ_RELEASE_ASSERT(CeilingLog2(i) == 4);
michael@0: }
michael@0: 
michael@0: static void
michael@0: TestFloor()
michael@0: {
michael@0:   for (uint32_t i = 0; i <= 1; i++)
michael@0:     MOZ_RELEASE_ASSERT(FloorLog2(i) == 0);
michael@0: 
michael@0:   for (uint32_t i = 2; i <= 3; i++)
michael@0:     MOZ_RELEASE_ASSERT(FloorLog2(i) == 1);
michael@0: 
michael@0:   for (uint32_t i = 4; i <= 7; i++)
michael@0:     MOZ_RELEASE_ASSERT(FloorLog2(i) == 2);
michael@0: 
michael@0:   for (uint32_t i = 8; i <= 15; i++)
michael@0:     MOZ_RELEASE_ASSERT(FloorLog2(i) == 3);
michael@0: 
michael@0:   for (uint32_t i = 16; i <= 31; i++)
michael@0:     MOZ_RELEASE_ASSERT(FloorLog2(i) == 4);
michael@0: }
michael@0: 
michael@0: static void
michael@0: TestRoundUpPow2()
michael@0: {
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(0) == 1);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(1) == 1);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(2) == 2);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(3) == 4);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(4) == 4);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(5) == 8);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(6) == 8);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(7) == 8);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(8) == 8);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(9) == 16);
michael@0: 
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(15) == 16);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(16) == 16);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(17) == 32);
michael@0: 
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(31) == 32);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(32) == 32);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(33) == 64);
michael@0: 
michael@0:   size_t MaxPow2 = size_t(1) << (sizeof(size_t) * CHAR_BIT - 1);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(MaxPow2 - 1) == MaxPow2);
michael@0:   MOZ_RELEASE_ASSERT(RoundUpPow2(MaxPow2) == MaxPow2);
michael@0:   // not valid to round up when past the max power of two
michael@0: }
michael@0: 
michael@0: int main()
michael@0: {
michael@0:   TestCeiling();
michael@0:   TestFloor();
michael@0: 
michael@0:   TestRoundUpPow2();
michael@0:   return 0;
michael@0: }