12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394 |
- #
- #
- # Nim's Runtime Library
- # (c) Copyright 2012 Andreas Rumpf
- #
- # See the file "copying.txt", included in this
- # distribution, for details about the copyright.
- #
- ## Contains the used algorithms for counting bits.
- from std/private/bitops_utils import forwardImpl, castToUnsigned
- const useBuiltins* = not defined(noIntrinsicsBitOpts)
- const noUndefined* = defined(noUndefinedBitOpts)
- const useGCC_builtins* = (defined(gcc) or defined(llvm_gcc) or
- defined(clang)) and useBuiltins
- const useICC_builtins* = defined(icc) and useBuiltins
- const useVCC_builtins* = defined(vcc) and useBuiltins
- const arch64* = sizeof(int) == 8
- template countBitsImpl(n: uint32): int =
- # generic formula is from: https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetParallel
- var v = uint32(n)
- v = v - ((v shr 1'u32) and 0x55555555'u32)
- v = (v and 0x33333333'u32) + ((v shr 2'u32) and 0x33333333'u32)
- (((v + (v shr 4'u32) and 0xF0F0F0F'u32) * 0x1010101'u32) shr 24'u32).int
- template countBitsImpl(n: uint64): int =
- # generic formula is from: https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetParallel
- var v = uint64(n)
- v = v - ((v shr 1'u64) and 0x5555555555555555'u64)
- v = (v and 0x3333333333333333'u64) + ((v shr 2'u64) and 0x3333333333333333'u64)
- v = (v + (v shr 4'u64) and 0x0F0F0F0F0F0F0F0F'u64)
- ((v * 0x0101010101010101'u64) shr 56'u64).int
- when useGCC_builtins:
- # Returns the number of set 1-bits in value.
- proc builtin_popcount(x: cuint): cint {.importc: "__builtin_popcount", cdecl.}
- proc builtin_popcountll(x: culonglong): cint {.
- importc: "__builtin_popcountll", cdecl.}
- elif useVCC_builtins:
- # Counts the number of one bits (population count) in a 16-, 32-, or 64-byte unsigned integer.
- func builtin_popcnt16(a2: uint16): uint16 {.
- importc: "__popcnt16", header: "<intrin.h>".}
- func builtin_popcnt32(a2: uint32): uint32 {.
- importc: "__popcnt", header: "<intrin.h>".}
- func builtin_popcnt64(a2: uint64): uint64 {.
- importc: "__popcnt64", header: "<intrin.h>".}
- elif useICC_builtins:
- # Intel compiler intrinsics: http://fulla.fnal.gov/intel/compiler_c/main_cls/intref_cls/common/intref_allia_misc.htm
- # see also: https://software.intel.com/en-us/node/523362
- # Count the number of bits set to 1 in an integer a, and return that count in dst.
- func builtin_popcnt32(a: cint): cint {.
- importc: "_popcnt", header: "<immintrin.h>".}
- func builtin_popcnt64(a: uint64): cint {.
- importc: "_popcnt64", header: "<immintrin.h>".}
- func countSetBitsImpl*(x: SomeInteger): int {.inline.} =
- ## Counts the set bits in an integer (also called `Hamming weight`:idx:).
- # TODO: figure out if ICC support _popcnt32/_popcnt64 on platform without POPCNT.
- # like GCC and MSVC
- let x = x.castToUnsigned
- when nimvm:
- result = forwardImpl(countBitsImpl, x)
- else:
- when useGCC_builtins:
- when sizeof(x) <= 4: result = builtin_popcount(x.cuint).int
- else: result = builtin_popcountll(x.culonglong).int
- elif useVCC_builtins:
- when sizeof(x) <= 2: result = builtin_popcnt16(x.uint16).int
- elif sizeof(x) <= 4: result = builtin_popcnt32(x.uint32).int
- elif arch64: result = builtin_popcnt64(x.uint64).int
- else: result = builtin_popcnt32((x.uint64 and 0xFFFFFFFF'u64).uint32).int +
- builtin_popcnt32((x.uint64 shr 32'u64).uint32).int
- elif useICC_builtins:
- when sizeof(x) <= 4: result = builtin_popcnt32(x.cint).int
- elif arch64: result = builtin_popcnt64(x.uint64).int
- else: result = builtin_popcnt32((x.uint64 and 0xFFFFFFFF'u64).cint).int +
- builtin_popcnt32((x.uint64 shr 32'u64).cint).int
- else:
- when sizeof(x) <= 4: result = countBitsImpl(x.uint32)
- else: result = countBitsImpl(x.uint64)
- proc countBits32*(n: uint32): int {.compilerproc, inline.} =
- result = countSetBitsImpl(n)
- proc countBits64*(n: uint64): int {.compilerproc, inline.} =
- result = countSetBitsImpl(n)
|