-
Notifications
You must be signed in to change notification settings - Fork 0
/
tag_type.c
244 lines (218 loc) · 11.2 KB
/
tag_type.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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
#include <string.h>
#include <assert.h>
#include <stdlib.h>
#include <ctype.h>
#include <stdbool.h>
#include "tag_type.h"
static bool is_bad_char(char a)
{
return (isspace(a) || a == '\n');
}
static size_t next_good_char_at(char *buff, size_t from, size_t n)
{
for (size_t i = from; i < n; i++)
if (!is_bad_char(buff[i]))
return i;
return 0;
}
static void fold(char *buff, size_t from, size_t to, size_t n)
{
assert(from < to);
while (to < n) {
buff[from] = buff[to];
from++;
to++;
}
assert(from < n);
memset(&buff[from], 0, n - from);
}
static void trim_unnecessary_chars(char *buff, size_t n)
{
size_t to = 0;
for (size_t from = 0; from < n; from++) {
if (is_bad_char(buff[from])) {
to = next_good_char_at(buff, from+1, n);
if (to == 0)
break;
fold(buff, from, to, n);
}
}
}
// let it be 8k bytes, should be enough, (IDK to be honst)
#define MAX_BUFFER_SIZE 8192 + 1
static char buffer[MAX_BUFFER_SIZE];
static const char *no_tag_specified_fn(FILE *fp, uint32_t addr, size_t count) {
(void)fp;
(void)addr;
(void)count;
return NULL;
}
static_assert(sizeof(char) == 1, "char is one byte");
static const char *unsigned_char_fn(FILE *fp, uint32_t addr, size_t count)
{
assert(MAX_BUFFER_SIZE > count);
memset(buffer, 0, sizeof(buffer));
fseek(fp, addr, SEEK_SET);
fread(buffer, 1, count, fp);
rewind(fp);
trim_unnecessary_chars(buffer, count);
return buffer;
}
static const char *string_fn(FILE *fp, uint32_t addr, size_t count)
{
// count => includes the ending '\0' yoo
// we could use strcpy because we have the '\0' but just to be extra
// mega triple sure let's use memcpy, anyway memcpy will be optimized
// so yoooooooo
return unsigned_char_fn(fp, addr, count);
}
#define WHEN_TO_ADD_NEWLINE 50
struct signed_rational {
long p;
long q;
};
struct unsigned_rational {
unsigned long p;
unsigned long q;
};
#define CONVERSION_RATIONAL_FN(name, type, tfmt) \
static const char *name##_fn(FILE *fp, uint32_t addr, size_t count) \
{ \
type _buffer[count]; \
memset(_buffer, 0, sizeof(_buffer)); \
memset(buffer, 0, sizeof(buffer)); \
fseek(fp, addr, SEEK_SET); \
fread(_buffer, sizeof(_buffer[0]), count, fp); \
const char *sfmt = #tfmt" "; \
const char *nfmt = #tfmt"\n"; \
ssize_t left_over = sizeof(buffer); \
ssize_t n = 0; \
size_t add_line = 0; \
size_t current = 0; \
for (size_t i = 0; i < count; i++) { \
const char *fmt = sfmt; \
n = snprintf(NULL, 0, fmt, _buffer[i].p, _buffer[i].q); \
if (n < 0) { \
strcpy(&buffer[strlen(buffer)-3], "..."); \
buffer[strlen(buffer)] = 0; \
return buffer; \
} \
left_over = left_over - n; \
if (left_over <= 0) { \
printf("rationl_fn() cannot write more bytes into buffer\n"); \
exit(1); \
} \
add_line += n; \
if (add_line >= WHEN_TO_ADD_NEWLINE) { \
fmt = nfmt; \
add_line = 0; \
} \
n = sprintf(&buffer[current], fmt, _buffer[i].p, _buffer[i].q); \
if (n < 0) { \
printf("sprintf() failed\n"); \
exit(1); \
} \
current += n; \
} \
rewind(fp); \
buffer[strlen(buffer)] = 0; \
return buffer; \
}
CONVERSION_RATIONAL_FN(unsigned_rational, struct unsigned_rational, %#08x/%#08x)
CONVERSION_RATIONAL_FN(signed_rational, struct signed_rational, %#08x/%#08x)
#define CONVERSION_FN(name, type, tfmt) \
static const char *name##_fn(FILE *fp, uint32_t addr, size_t count) \
{ \
type _buffer[count]; \
memset(_buffer, 0, sizeof(_buffer)); \
memset(buffer, 0, sizeof(buffer)); \
if (count > 1) { \
fseek(fp, addr, SEEK_SET); \
fread(&_buffer[0], sizeof(_buffer[0]), count, fp); \
} else { \
memcpy(_buffer, &addr, sizeof(addr)); \
} \
const char *sfmt = #tfmt" "; \
const char *nfmt = #tfmt"\n"; \
ssize_t left_over = MAX_BUFFER_SIZE; \
ssize_t n = 0; \
size_t add_line = 0; \
size_t current = 0; \
for (size_t i = 0; i < count; i++) { \
const char *fmt = sfmt; \
n = snprintf(NULL, 0, fmt, _buffer[i]); \
if (n < 0) { \
printf("conversion_fn() sprintf count failed\n"); \
exit(1); \
} \
left_over = left_over - n; \
if (left_over <= 0) { \
strcpy(&buffer[strlen(buffer)-3], "..."); \
buffer[strlen(buffer)] = 0; \
return buffer; \
} \
add_line += n; \
if (add_line >= WHEN_TO_ADD_NEWLINE) { \
fmt = nfmt; \
add_line = 0; \
} \
n = sprintf(&buffer[current], fmt, _buffer[i]); \
if (n < 0) { \
printf("sprintf() failed\n"); \
exit(1); \
} \
current += n; \
} \
if (count > 1) \
rewind(fp); \
buffer[strlen(buffer)] = 0; \
return buffer; \
}
CONVERSION_FN(unsigned_short, uint16_t, %hu)
CONVERSION_FN(unsigned_long, uint32_t, %d)
CONVERSION_FN(signed_char, char, %c)
CONVERSION_FN(byte_sequence, uint8_t, %02x)
CONVERSION_FN(signed_short, int16_t, %d)
CONVERSION_FN(signed_long, int32_t, %d)
CONVERSION_FN(float_4_byte, float, %f)
CONVERSION_FN(float_8_byte, double, %f)
static struct tag_type_table {
enum tag_type tag;
const char *str;
const char *(*convert)(FILE *fp, uint32_t addr, size_t count);
}tag_type_table[] = {
{ no_tag, "no tag specified", no_tag_specified_fn },
{ tag_unsigned_char, "unsigned char", unsigned_char_fn },
{ tag_string, "string (with an ending zero)", string_fn },
{ tag_unsigned_short, "unsigned short (2 bytes)", unsigned_short_fn },
{ tag_unsigned_long, "unsigned long (4 bytes)", unsigned_long_fn },
{ tag_unsigned_rational, "unsigned rational (2 unsigned long)", unsigned_rational_fn },
{ tag_signed_char, "signed char", signed_char_fn },
{ tag_byte_sequence, "byte sequence", byte_sequence_fn },
{ tag_signed_short, "signed short", signed_short_fn },
{ tag_signed_long, "signed long", signed_long_fn },
{ tag_signed_rational, "signed rational (2 signed long)", signed_rational_fn },
{ tag_float_4bytes, "float, 4 bytes, IEEE format", float_4_byte_fn },
{ tag_float_8bytes, "float, 8 bytes, IEEE format", float_8_byte_fn },
};
enum tag_type tag_type(uint16_t t)
{
return (enum tag_type)(t);
}
const char *tag_type_conv(FILE *cr, enum tag_type t, uint32_t addr, size_t count)
{
return tag_type_table[t].convert(cr, addr, count);
}
#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof(arr[0]))
const char *no_tag_str="no tag found";
static_assert(ARRAY_SIZE(tag_type_table) == TAG_TYPE_ENUM_COUNT,
"we should have the same number of items");
const char *tag_type_to_field_str(enum tag_type t)
{
assert("we added or removed an enum" && t > 0 && t < TAG_TYPE_ENUM_COUNT);
size_t n = ARRAY_SIZE(tag_type_table);
for (size_t i = 0; i < n; i++)
if (tag_type_table[i].tag == t)
return tag_type_table[i].str;
return no_tag_str;
}