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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
|
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package bitutil
func alignedBitAndGo(left, right, out []byte) {
var (
nbytes = len(out)
i = 0
)
if nbytes > uint64SizeBytes {
// case where we have enough bytes to operate on words
leftWords := bytesToUint64(left[i:])
rightWords := bytesToUint64(right[i:])
outWords := bytesToUint64(out[i:])
for w := range outWords {
outWords[w] = leftWords[w] & rightWords[w]
}
i += len(outWords) * uint64SizeBytes
}
// grab any remaining bytes that were fewer than a word
for ; i < nbytes; i++ {
out[i] = left[i] & right[i]
}
}
func alignedBitAndNotGo(left, right, out []byte) {
var (
nbytes = len(out)
i = 0
)
if nbytes > uint64SizeBytes {
// case where we have enough bytes to operate on words
leftWords := bytesToUint64(left[i:])
rightWords := bytesToUint64(right[i:])
outWords := bytesToUint64(out[i:])
for w := range outWords {
outWords[w] = leftWords[w] &^ rightWords[w]
}
i += len(outWords) * uint64SizeBytes
}
// grab any remaining bytes that were fewer than a word
for ; i < nbytes; i++ {
out[i] = left[i] &^ right[i]
}
}
func alignedBitOrGo(left, right, out []byte) {
var (
nbytes = len(out)
i = 0
)
if nbytes > uint64SizeBytes {
// case where we have enough bytes to operate on words
leftWords := bytesToUint64(left[i:])
rightWords := bytesToUint64(right[i:])
outWords := bytesToUint64(out[i:])
for w := range outWords {
outWords[w] = leftWords[w] | rightWords[w]
}
i += len(outWords) * uint64SizeBytes
}
// grab any remaining bytes that were fewer than a word
for ; i < nbytes; i++ {
out[i] = left[i] | right[i]
}
}
func alignedBitXorGo(left, right, out []byte) {
var (
nbytes = len(out)
i = 0
)
if nbytes > uint64SizeBytes {
// case where we have enough bytes to operate on words
leftWords := bytesToUint64(left[i:])
rightWords := bytesToUint64(right[i:])
outWords := bytesToUint64(out[i:])
for w := range outWords {
outWords[w] = leftWords[w] ^ rightWords[w]
}
i += len(outWords) * uint64SizeBytes
}
// grab any remaining bytes that were fewer than a word
for ; i < nbytes; i++ {
out[i] = left[i] ^ right[i]
}
}
|
