This repository has been archived by the owner on Dec 6, 2022. It is now read-only.
forked from mtabini/go-lua
-
Notifications
You must be signed in to change notification settings - Fork 0
/
bit32.go
106 lines (96 loc) · 2.83 KB
/
bit32.go
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
package lua
import (
"math"
)
const bitCount = 32
func trim(x uint) uint { return x & math.MaxUint32 }
func mask(n uint) uint { return ^(math.MaxUint32 << n) }
func shift(l *State, r uint, i int) int {
if i < 0 {
if i, r = -i, trim(r); i >= bitCount {
r = 0
} else {
r >>= uint(i)
}
} else {
if i >= bitCount {
r = 0
} else {
r <<= uint(i)
}
r = trim(r)
}
l.PushUnsigned(r)
return 1
}
func rotate(l *State, i int) int {
r := trim(CheckUnsigned(l, 1))
if i &= bitCount - 1; i != 0 {
r = trim((r << uint(i)) | (r >> uint(bitCount-i)))
}
l.PushUnsigned(r)
return 1
}
func bitOp(l *State, init uint, f func(a, b uint) uint) uint {
r := init
for i, n := 1, l.Top(); i <= n; i++ {
r = f(r, CheckUnsigned(l, i))
}
return trim(r)
}
func andHelper(l *State) uint {
x := bitOp(l, ^uint(0), func(a, b uint) uint { return a & b })
return x
}
func fieldArguments(l *State, fieldIndex int) (uint, uint) {
f, w := CheckInteger(l, fieldIndex), OptInteger(l, fieldIndex+1, 1)
ArgumentCheck(l, 0 <= f, fieldIndex, "field cannot be negative")
ArgumentCheck(l, 0 < w, fieldIndex+1, "width must be positive")
if f+w > bitCount {
Errorf(l, "trying to access non-existent bits")
}
return uint(f), uint(w)
}
var bitLibrary = []RegistryFunction{
{"arshift", func(l *State) int {
if r, i := CheckUnsigned(l, 1), CheckInteger(l, 2); i < 0 || 0 == (r&(1<<(bitCount-1))) {
return shift(l, r, -i)
} else {
if i >= bitCount {
r = math.MaxUint32
} else {
r = trim((r >> uint(i)) | ^(math.MaxUint32 >> uint(i)))
}
l.PushUnsigned(r)
}
return 1
}},
{"band", func(l *State) int { l.PushUnsigned(andHelper(l)); return 1 }},
{"bnot", func(l *State) int { l.PushUnsigned(trim(^CheckUnsigned(l, 1))); return 1 }},
{"bor", func(l *State) int { l.PushUnsigned(bitOp(l, 0, func(a, b uint) uint { return a | b })); return 1 }},
{"bxor", func(l *State) int { l.PushUnsigned(bitOp(l, 0, func(a, b uint) uint { return a ^ b })); return 1 }},
{"btest", func(l *State) int { l.PushBoolean(andHelper(l) != 0); return 1 }},
{"extract", func(l *State) int {
r := CheckUnsigned(l, 1)
f, w := fieldArguments(l, 2)
l.PushUnsigned((r >> f) & mask(w))
return 1
}},
{"lrotate", func(l *State) int { return rotate(l, CheckInteger(l, 2)) }},
{"lshift", func(l *State) int { return shift(l, CheckUnsigned(l, 1), CheckInteger(l, 2)) }},
{"replace", func(l *State) int {
r, v := CheckUnsigned(l, 1), CheckUnsigned(l, 2)
f, w := fieldArguments(l, 3)
m := mask(w)
v &= m
l.PushUnsigned((r & ^(m << f)) | (v << f))
return 1
}},
{"rrotate", func(l *State) int { return rotate(l, -CheckInteger(l, 2)) }},
{"rshift", func(l *State) int { return shift(l, CheckUnsigned(l, 1), -CheckInteger(l, 2)) }},
}
// Bit32Open opens the bit32 library. Usually passed to Require.
func Bit32Open(l *State) int {
NewLibrary(l, bitLibrary)
return 1
}