3611efdcef
This includes an update of the selinux package and the ability in the CRI configuration to set the upper bounds for the selinux category labels that are generated. Signed-off-by: Michael Crosby <michael@thepasture.io>
46 lines
750 B
Go
46 lines
750 B
Go
// +build go1.9
|
|
|
|
package bitset
|
|
|
|
import "math/bits"
|
|
|
|
func popcntSlice(s []uint64) uint64 {
|
|
var cnt int
|
|
for _, x := range s {
|
|
cnt += bits.OnesCount64(x)
|
|
}
|
|
return uint64(cnt)
|
|
}
|
|
|
|
func popcntMaskSlice(s, m []uint64) uint64 {
|
|
var cnt int
|
|
for i := range s {
|
|
cnt += bits.OnesCount64(s[i] &^ m[i])
|
|
}
|
|
return uint64(cnt)
|
|
}
|
|
|
|
func popcntAndSlice(s, m []uint64) uint64 {
|
|
var cnt int
|
|
for i := range s {
|
|
cnt += bits.OnesCount64(s[i] & m[i])
|
|
}
|
|
return uint64(cnt)
|
|
}
|
|
|
|
func popcntOrSlice(s, m []uint64) uint64 {
|
|
var cnt int
|
|
for i := range s {
|
|
cnt += bits.OnesCount64(s[i] | m[i])
|
|
}
|
|
return uint64(cnt)
|
|
}
|
|
|
|
func popcntXorSlice(s, m []uint64) uint64 {
|
|
var cnt int
|
|
for i := range s {
|
|
cnt += bits.OnesCount64(s[i] ^ m[i])
|
|
}
|
|
return uint64(cnt)
|
|
}
|