-
Notifications
You must be signed in to change notification settings - Fork 0
/
mbin_bits.c
134 lines (109 loc) · 3.22 KB
/
mbin_bits.c
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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
/*-
* Copyright (c) 2012 Hans Petter Selasky
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <stdint.h>
#include <sys/endian.h>
#include "math_bin.h"
uint32_t
mbin_get_bits32(const uint32_t *ptr, uint32_t *poff, uint32_t bits)
{
uint32_t rem;
uint32_t tmp;
uint32_t offset = *poff;
rem = 32 - (offset & 31);
if (rem >= bits) {
tmp = (le32toh(ptr[(offset / 32)]) >> (32 - rem));
} else {
tmp = ((le32toh(ptr[(offset / 32)]) >> (32 - rem)) |
(le32toh(ptr[(offset / 32) + 1]) << rem));
}
if (bits != 32)
tmp &= (1 << bits) - 1;
offset += bits;
*poff = offset;
return (tmp);
}
void
mbin_put_bits32(uint32_t *ptr, uint32_t *poff, uint32_t bits,
uint32_t value)
{
uint32_t rem;
uint32_t tmp;
uint32_t offset = *poff;
if (bits < 32)
value &= (1 << bits) - 1;
rem = 32 - (offset & 31);
if (rem >= bits) {
tmp = value << (32 - rem);
ptr[(offset / 32)] |= htole32(tmp);
} else {
tmp = value << (32 - rem);
ptr[(offset / 32)] |= htole32(tmp);
tmp = value >> rem;
ptr[(offset / 32) + 1] |= htole32(tmp);
}
offset += bits;
*poff = offset;
}
uint32_t
mbin_get_rev_bits32(const uint32_t *ptr, uint32_t *poff, uint32_t bits)
{
uint32_t rem;
uint32_t tmp;
uint32_t offset = *poff;
offset -= bits;
rem = 32 - (offset & 31);
if (rem >= bits) {
tmp = (le32toh(ptr[(offset / 32)]) >> (32 - rem));
} else {
tmp = ((le32toh(ptr[(offset / 32)]) >> (32 - rem)) |
(le32toh(ptr[(offset / 32) + 1]) << rem));
}
if (bits < 32)
tmp &= (1 << bits) - 1;
*poff = offset;
return (tmp);
}
void
mbin_put_rev_bits32(uint32_t *ptr, uint32_t *poff, uint32_t bits,
uint32_t value)
{
uint32_t rem;
uint32_t tmp;
uint32_t offset = *poff;
if (bits < 32)
value &= (1 << bits) - 1;
offset += bits;
rem = 32 - (offset & 31);
if (rem >= bits) {
tmp = value << (32 - rem);
ptr[(offset / 32)] |= htole32(tmp);
} else {
tmp = value << (32 - rem);
ptr[(offset / 32)] |= htole32(tmp);
tmp = value >> rem;
ptr[(offset / 32) + 1] |= htole32(tmp);
}
*poff = offset;
}