[go: up one dir, main page]

File: mif.cc

package info (click to toggle)
srecord 1.58-1
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 5,144 kB
  • sloc: cpp: 26,774; sh: 7,053; makefile: 2,889; awk: 187; vhdl: 15
file content (475 lines) | stat: -rw-r--r-- 13,702 bytes parent folder | download | duplicates (2)
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
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
//
// srecord - Manipulate EPROM load files
// Copyright (C) 2009-2011 Peter Miller
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation; either version 3 of the License, or (at
// your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
//

#include <srecord/input/file/mif.h>
#include <srecord/record.h>


srecord::input_file_mif::~input_file_mif()
{
}


srecord::input_file_mif::input_file_mif(const std::string &a_file_name) :
    srecord::input_file(a_file_name),
    state(state_header),
    address(0),
    lex_radix(10),
    lex_addr_radix(16),
    lex_data_radix(16),
    width(8),
    width_in_bytes(1)
{
}


srecord::input_file::pointer
srecord::input_file_mif::create(const std::string &a_file_name)
{
    return pointer(new srecord::input_file_mif(a_file_name));
}


srecord::input_file_mif::token_t
srecord::input_file_mif::lex_addr(void)
{
    lex_radix = lex_addr_radix;
    token_t result = lex();
    lex_radix = 10;
    return result;
}


srecord::input_file_mif::token_t
srecord::input_file_mif::lex_data(void)
{
    lex_radix = lex_data_radix;
    token_t result = lex();
    lex_radix = 10;
    return result;
}


srecord::input_file_mif::token_t
srecord::input_file_mif::lex(void)
{
    for (;;)
    {
        int c = get_char();
        if (c < 0)
            return token_eof;
        switch (c)
        {
        case ' ':
        case '\t':
        case '\r':
        case '\n':
            continue;

        case '.':
            c = get_char();
            if (c == '.')
                return token_dotdot;
            if (c >= 0)
                get_char_undo(c);
            return token_dot;

        case '=':
            return token_equals;

        case ':':
            return token_colon;

        case ';':
            return token_semicolon;

        case '%':
            for (;;)
            {
                c = get_char();
                if (c < 0 || c == '%')
                    break;
            }
            continue;

        case '-':
            if (peek_char() == '-')
            {
                for (;;)
                {
                    c = get_char();
                    if (c < 0 || c == '\n')
                        break;
                }
                continue;
            }
            return token_minus;

        case '[':
            return token_bracket_left;

        case ']':
            return token_bracket_right;

        case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': case 'G':
        case 'H': case 'I': case 'J': case 'K': case 'L': case 'M': case 'N':
        case 'O': case 'P': case 'Q': case 'R': case 'S': case 'T': case 'U':
        case 'V': case 'W': case 'X': case 'Y': case 'Z':
        case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': case 'g':
        case 'h': case 'i': case 'j': case 'k': case 'l': case 'm': case 'n':
        case 'o': case 'p': case 'q': case 'r': case 's': case 't': case 'u':
        case 'v': case 'w': case 'x': case 'y': case 'z':
        case '0': case '1': case '2': case '3': case '4':
        case '5': case '6': case '7': case '8': case '9':
        case '_':
            {
                std::string id;
                for (;;)
                {
                    id += (char)c;
                    c = get_char();
                    if (c < 0)
                        break;
                    switch (c)
                    {
                    case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
                    case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
                    case 'M': case 'N': case 'O': case 'P': case 'Q': case 'R':
                    case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
                    case 'Y': case 'Z':
                    case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
                    case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
                    case 'm': case 'n': case 'o': case 'p': case 'q': case 'r':
                    case 's': case 't': case 'u': case 'v': case 'w': case 'x':
                    case 'y': case 'z':
                    case '0': case '1': case '2': case '3': case '4':
                    case '5': case '6': case '7': case '8': case '9':
                    case '_':
                        continue;

                    default:
                        get_char_undo(c);
                        break;
                    }
                    break;
                }

                //
                // See if we are looking at a number.
                //
                // The only place there is the possibility of ambiguity
                // is the "DEC" keyword, that could also be the 0xDEC
                // number.  However, this only ever occurs in the
                // radix-10 header portion, and will not be a problem
                // (because strtol will reject it).
                //
                const char *cp = id.c_str();
                char *ep = 0;
                token_value = strtol(cp, &ep, lex_radix);
                if (ep != cp && !*ep)
                    return token_number;

                //
                // See if it is a known identifier.
                //
                if (id == "ADDRESS_RADIX")
                    return token_address_radix;
                if (id == "BEGIN")
                    return token_begin;
                if (id == "BIN")
                    return token_bin;
                if (id == "CONTENT")
                    return token_content;
                if (id == "DATA_RADIX")
                    return token_data_radix;
                if (id == "DEC")
                    return token_dec;
                if (id == "DEPTH")
                    return token_depth;
                if (id == "END")
                    return token_end;
                if (id == "HEX")
                    return token_hex;
                if (id == "OCT")
                    return token_oct;
                if (id == "UNS")
                    return token_dec;
                if (id == "WIDTH")
                    return token_width;
            }
            return token_junk;

        default:
            return token_junk;
        }
    }
}


void
srecord::input_file_mif::syntax_error(const char *text)
{
    fatal_error("%s", text);
}


void
srecord::input_file_mif::get_equals(void)
{
    if (lex() != token_equals)
        syntax_error("equals (=) expected");
}


long
srecord::input_file_mif::get_number(void)
{
    if (lex() != token_number)
        syntax_error("decimal number expected");
    return token_value;
}


void
srecord::input_file_mif::get_semicolon(void)
{
    if (lex() != token_semicolon)
        syntax_error("semicolon (;) expected");
}


void
srecord::input_file_mif::get_colon(void)
{
    if (lex() != token_colon)
        syntax_error("colon (:) expected");
}


int
srecord::input_file_mif::get_radix(void)
{
    switch (lex())
    {
    case token_hex:
        return 16;

    case token_oct:
        return 8;

    case token_bin:
        return 2;

    case token_dec:
        break;

    default:
        syntax_error("radix specifier expected");
        // NOTREACHED
    }
    return 10;
}


bool
srecord::input_file_mif::read(srecord::record &record)
{
    unsigned char buffer[srecord::record::max_data_length];
    size_t bufpos = 0;
    unsigned address_range = 0;

    for (;;)
    {
        switch (state)
        {
        case state_eof:
            return false;

        case state_header:
            switch (lex())
            {
            default:
                syntax_error("header expected");

            case token_depth:
                get_equals();
                get_number();
                get_semicolon();
                break;

            case token_width:
                get_equals();
                width = get_number();
                if (width < 1 || width > sizeof(buffer) * 8)
                    syntax_error("width out of range");
                width_in_bytes = (width + 7) / 8;
                get_semicolon();
                break;

            case token_address_radix:
                get_equals();
                lex_addr_radix = get_radix();
                get_semicolon();
                break;

            case token_data_radix:
                get_equals();
                lex_data_radix = get_radix();
                get_semicolon();
                break;

            case token_content:
                if (lex() != token_begin)
                    syntax_error("BEGIN expected");
                state = state_address;
                break;
            }
            break;

        case state_address:
            address_range = 0;
            switch (lex_addr())
            {
            default:
                syntax_error("address expected");
                // NOTREACHED

            case token_number:
                address = token_value * width_in_bytes;
                get_colon();
                state = state_data;
                break;

            case token_end:
                state = state_eof;
                break;

            case token_bracket_left:
                {
                    if (lex_addr() != token_number)
                        syntax_error("start of address range expected");
                    unsigned long address_lo = token_value;
                    if (lex_addr() != token_dotdot)
                        syntax_error("dot dot (..) expected");
                    if (lex_addr() != token_number)
                        syntax_error("end of address range expected");
                    unsigned long address_hi = token_value;
                    if (address_hi < address_lo)
                        syntax_error("address range backwards");
                    address_range = address_hi + 1 - address_lo;
                    address_range *= width_in_bytes;
                    if (address_range > sizeof(buffer))
                        syntax_error("address range too large");
                    if (lex_addr() != token_bracket_right)
                        syntax_error("right bracket ']' expected");
                    get_colon();
                    address = address_lo;
                    state = state_data;
                }
                break;
            }
            break;

        case state_data:
            switch (lex_data())
            {
            default:
                syntax_error("data expected");
                // NOTREACHED

            case token_number:
                for (unsigned j = 0; j < width_in_bytes; ++j)
                {
                    unsigned jj = width_in_bytes - 1 - j;
                    buffer[bufpos + jj] = token_value >> (jj << 3);
                }
                bufpos += width_in_bytes;
                address += width_in_bytes;
                if (bufpos + width_in_bytes > sizeof(buffer))
                {
                    if (address_range != 0)
                        syntax_error("data too large for address range");
                    record =
                        srecord::record
                        (
                            srecord::record::type_data,
                            address - bufpos,
                            buffer,
                            bufpos
                        );
                    return true;
                }
                break;

            case token_semicolon:
                state = state_address;
                if (bufpos > 0)
                {
                    if (address_range != 0)
                    {
                        if (bufpos > address_range)
                            syntax_error("too much data for address range");
                        if (bufpos > 0 && bufpos < address_range)
                        {
                            // deliberately memcpy onto self
                            // to repeat the data in the buffer
                            size_t nbytes = address_range - bufpos;
                            const unsigned char *end = buffer + address_range;
                            const unsigned char *in = buffer;
                            unsigned char *out = buffer + bufpos;
                            while (out < end)
                                *out++ = *in++;
                            bufpos += nbytes;
                            address += nbytes;
                        }
                    }
                    record =
                        srecord::record
                        (
                            srecord::record::type_data,
                            address - bufpos,
                            buffer,
                            bufpos
                        );
                    return true;
                }
                break;
            }
            break;
        }
    }
}


const char *
srecord::input_file_mif::get_file_format_name(void)
    const
{
    return "Memory Initialization File (MIF, Altera)";
}


const char *
srecord::input_file_mif::format_option_name(void)
    const
{
    return "-Memory_Initialization_File";
}


// vim: set ts=8 sw=4 et :