-
Notifications
You must be signed in to change notification settings - Fork 0
/
mbin_parse.c
173 lines (163 loc) · 3.79 KB
/
mbin_parse.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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
/*-
* Copyright (c) 2009 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.
*/
/*
* This file contains funtions for printing binary numbers.
*/
#include <stdio.h>
#include <stdint.h>
#include <ctype.h>
#include "math_bin.h"
uint32_t
mbin_parse32_abc(const char *ptr, const char *end)
{
uint32_t temp = 0;
char c;
while (1) {
if (ptr == end)
break;
if (*ptr == 0)
break;
c = *ptr++;
if (c >= 'a' && c <= 'z')
temp |= 1 << (c - 'a');
else if (c >= 'A' && c <= 'Z')
temp |= 1 << (c - 'A');
}
return (temp);
}
void
mbin_parse32_add(const char *ptr, uint32_t *ptable, uint32_t mask)
{
if (ptr == NULL)
return;
while (ptr[0]) {
if (ptr[0] == '(') {
mbin_parse32_factor(ptr, ptable, mask, 0, 0, 0);
}
/* skip line */
while (1) {
if (ptr[0] == 0)
break;
if (ptr[0] == '\n') {
ptr++;
break;
}
ptr++;
}
}
}
void
mbin_parse32_xor(const char *ptr, uint32_t *ptable, uint32_t mask)
{
if (ptr == NULL)
return;
while (ptr[0]) {
if (ptr[0] == '(') {
mbin_parse32_factor(ptr, ptable, mask, 0, 0, 1);
}
/* skip line */
while (1) {
if (ptr[0] == 0)
break;
if (ptr[0] == '\n') {
ptr++;
break;
}
ptr++;
}
}
}
void
mbin_parse32_factor(const char *ptr, uint32_t *ptable, uint32_t mask,
uint32_t var, uint8_t level, uint8_t is_xor)
{
const char *old;
char any;
uint32_t temp;
if (ptr[0] != '(')
return;
/* skip beginning parenthesis */
ptr++;
old = ptr;
any = 0;
while (1) {
if (ptr[0] == 0 || ptr[0] == '\n') {
break;
}
if (ptr[0] == '^' || ptr[0] == ',' || ptr[0] == ')') {
if (any) {
any = 0;
temp = var | mbin_parse32_abc(old, ptr);
old = ptr + 1;
while (1) {
if (old[0] == 0 || old[0] == '\n') {
/*
* final
*/
if (ptable == NULL) {
printf("(");
if (level < 32)
mbin_print32_const(1UL << level);
printf(")*(");
mbin_print32_abc(temp & mask);
printf(",)\n");
} else {
if (level < 32) {
if (is_xor)
ptable[temp & mask] ^= (1UL << level);
else
ptable[temp & mask] -= (1UL << level);
}
}
break;
}
if (old[0] == '(') {
/*
* recurse
*/
mbin_parse32_factor(old,
ptable, mask, temp, level, is_xor);
break;
}
old++;
}
}
if (ptr[0] == ')') {
break;
}
if (ptr[0] == ',') {
level++;
}
old = ++ptr;
} else if (isspace(ptr[0]) || (ptr[0] == '0')) {
/* skip whitespace and zeros */
ptr++;
} else {
/* expression */
any = 1;
ptr++;
}
}
}