Reimplement how flaky tests are retried.
[chromium-blink-merge.git] / base / bits.h
blob505d2c8f75d901688186ed2e1f981b3a9a2562bc
1 // Copyright (c) 2009 The Chromium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
5 // This file defines some bit utilities.
7 #ifndef BASE_BITS_H_
8 #define BASE_BITS_H_
10 #include "base/basictypes.h"
11 #include "base/logging.h"
13 namespace base {
14 namespace bits {
16 // Returns the integer i such as 2^i <= n < 2^(i+1)
17 inline int Log2Floor(uint32 n) {
18 if (n == 0)
19 return -1;
20 int log = 0;
21 uint32 value = n;
22 for (int i = 4; i >= 0; --i) {
23 int shift = (1 << i);
24 uint32 x = value >> shift;
25 if (x != 0) {
26 value = x;
27 log += shift;
30 DCHECK_EQ(value, 1u);
31 return log;
34 // Returns the integer i such as 2^(i-1) < n <= 2^i
35 inline int Log2Ceiling(uint32 n) {
36 if (n == 0) {
37 return -1;
38 } else {
39 // Log2Floor returns -1 for 0, so the following works correctly for n=1.
40 return 1 + Log2Floor(n - 1);
44 // Round up |size| to a multiple of alignment, which must be a power of two.
45 inline size_t Align(size_t size, size_t alignment) {
46 DCHECK_EQ(alignment & (alignment - 1), 0u);
47 return (size + alignment - 1) & ~(alignment - 1);
50 } // namespace bits
51 } // namespace base
53 #endif // BASE_BITS_H_