File: bit-population-count.cpp

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-11
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,418,840 kB
  • sloc: cpp: 5,290,826; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,898; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,913; xml: 953; cs: 573; fortran: 539
file content (81 lines) | stat: -rw-r--r-- 2,993 bytes parent folder | download | duplicates (23)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#include "flang/Common/bit-population-count.h"
#include "testing.h"

using Fortran::common::BitPopulationCount;
using Fortran::common::Parity;

int main() {
  MATCH(0, BitPopulationCount(std::uint64_t{0}));
  MATCH(false, Parity(std::uint64_t{0}));
  MATCH(64, BitPopulationCount(~std::uint64_t{0}));
  MATCH(false, Parity(~std::uint64_t{0}));
  for (int j{0}; j < 64; ++j) {
    std::uint64_t x = std::uint64_t{1} << j;
    MATCH(1, BitPopulationCount(x));
    MATCH(true, Parity(x));
    MATCH(63, BitPopulationCount(~x));
    MATCH(true, Parity(~x));
    for (int k{0}; k < j; ++k) {
      std::uint64_t y = x | (std::uint64_t{1} << k);
      MATCH(2, BitPopulationCount(y));
      MATCH(false, Parity(y));
      MATCH(62, BitPopulationCount(~y));
      MATCH(false, Parity(~y));
    }
  }
  MATCH(0, BitPopulationCount(std::uint32_t{0}));
  MATCH(false, Parity(std::uint32_t{0}));
  MATCH(32, BitPopulationCount(~std::uint32_t{0}));
  MATCH(false, Parity(~std::uint32_t{0}));
  for (int j{0}; j < 32; ++j) {
    std::uint32_t x = std::uint32_t{1} << j;
    MATCH(1, BitPopulationCount(x));
    MATCH(true, Parity(x));
    MATCH(31, BitPopulationCount(~x));
    MATCH(true, Parity(~x));
    for (int k{0}; k < j; ++k) {
      std::uint32_t y = x | (std::uint32_t{1} << k);
      MATCH(2, BitPopulationCount(y));
      MATCH(false, Parity(y));
      MATCH(30, BitPopulationCount(~y));
      MATCH(false, Parity(~y));
    }
  }
  MATCH(0, BitPopulationCount(std::uint16_t{0}));
  MATCH(false, Parity(std::uint16_t{0}));
  MATCH(16, BitPopulationCount(static_cast<std::uint16_t>(~0)));
  MATCH(false, Parity(static_cast<std::uint16_t>(~0)));
  for (int j{0}; j < 16; ++j) {
    std::uint16_t x = std::uint16_t{1} << j;
    MATCH(1, BitPopulationCount(x));
    MATCH(true, Parity(x));
    MATCH(15, BitPopulationCount(static_cast<std::uint16_t>(~x)));
    MATCH(true, Parity(static_cast<std::uint16_t>(~x)));
    for (int k{0}; k < j; ++k) {
      std::uint16_t y = x | (std::uint16_t{1} << k);
      MATCH(2, BitPopulationCount(y));
      MATCH(false, Parity(y));
      MATCH(14, BitPopulationCount(static_cast<std::uint16_t>(~y)));
      MATCH(false, Parity(static_cast<std::uint16_t>(~y)));
    }
  }
  MATCH(0, BitPopulationCount(std::uint8_t{0}));
  MATCH(false, Parity(std::uint8_t{0}));
  MATCH(8, BitPopulationCount(static_cast<std::uint8_t>(~0)));
  MATCH(false, Parity(static_cast<std::uint8_t>(~0)));
  for (int j{0}; j < 8; ++j) {
    std::uint8_t x = std::uint8_t{1} << j;
    MATCH(1, BitPopulationCount(x));
    MATCH(true, Parity(x));
    MATCH(7, BitPopulationCount(static_cast<std::uint8_t>(~x)));
    MATCH(true, Parity(static_cast<std::uint8_t>(~x)));
    for (int k{0}; k < j; ++k) {
      std::uint8_t y = x | (std::uint8_t{1} << k);
      MATCH(2, BitPopulationCount(y));
      MATCH(false, Parity(y));
      MATCH(6, BitPopulationCount(static_cast<std::uint8_t>(~y)));
      MATCH(false, Parity(static_cast<std::uint8_t>(~y)));
    }
  }
  return testing::Complete();
}