summaryrefslogtreecommitdiffstats
path: root/utils/regtools/tester.cpp
blob: 1beba5fe9b87b22f54f34ee12a5d8f008b426764 (plain)
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
/***************************************************************************
 *             __________               __   ___.
 *   Open      \______   \ ____   ____ |  | _\_ |__   _______  ___
 *   Source     |       _//  _ \_/ ___\|  |/ /| __ \ /  _ \  \/  /
 *   Jukebox    |    |   (  <_> )  \___|    < | \_\ (  <_> > <  <
 *   Firmware   |____|_  /\____/ \___  >__|_ \|___  /\____/__/\_ \
 *                     \/            \/     \/    \/            \/
 * $Id$
 *
 * Copyright (C) 2012 by Amaury Pouly
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
 * KIND, either express or implied.
 *
 ****************************************************************************/
#include "soc_desc.hpp"
#include <stdio.h>
#include <stdlib.h>
#include <map>
#include <cstring>

template< typename T >
bool build_map(const char *type, const std::vector< T >& vec,
    std::map< std::string, size_t >& map)
{
    for(size_t i =  0; i < vec.size(); i++)
    {
        if(map.find(vec[i].name) != map.end())
        {
            printf("soc has duplicate %s '%s'\n", type, vec[i].name.c_str());
            return false;
        }
        map[vec[i].name] = i;
    }
    return true;
}

template< typename T >
bool build_map(const char *type, const std::vector< T >& a, const std::vector< T >& b,
        std::vector< std::pair< size_t, size_t > >& m)
{
    std::map< std::string, size_t > ma, mb;
    if(!build_map(type, a, ma) || !build_map(type, b, mb))
        return false;
    std::map< std::string, size_t >::iterator it;
    for(it = ma.begin(); it != ma.end(); ++it)
    {
        if(mb.find(it->first) == mb.end())
        {
            printf("%s '%s' exists in only one file\n", type, it->first.c_str());
            return false;
        }
        m.push_back(std::make_pair(it->second, mb[it->first]));
    }
    for(it = mb.begin(); it != mb.end(); ++it)
    {
        if(ma.find(it->first) == ma.end())
        {
            printf("%s '%s' exists in only one file\n", type, it->first.c_str());
            return false;
        }
    }
    return true;
}

bool compare_value(const soc_t& soc, const soc_dev_t& dev, const soc_reg_t& reg,
        const soc_reg_field_t& field, const soc_reg_field_value_t& a, const soc_reg_field_value_t& b)
{
    if(a.value != b.value)
    {
        printf("register field value '%s.%s.%s.%s.%s' have different values\n", soc.name.c_str(),
            dev.name.c_str(), reg.name.c_str(), field.name.c_str(), a.name.c_str());
        return false;
    }
    if(a.desc != b.desc)
    {
        printf("register field value '%s.%s.%s.%s.%s' have different descriptions\n", soc.name.c_str(),
            dev.name.c_str(), reg.name.c_str(), field.name.c_str(), a.name.c_str());
        return false;
    }
    return true;
}

bool compare_field(const soc_t& soc, const soc_dev_t& dev, const soc_reg_t& reg,
        const soc_reg_field_t& a, const soc_reg_field_t& b)
{
    if(a.first_bit != b.first_bit || a.last_bit != b.last_bit)
    {
        printf("register address '%s.%s.%s.%s' have different bit ranges\n", soc.name.c_str(),
            dev.name.c_str(), reg.name.c_str(), a.name.c_str());
        return false;
    }
    if(a.desc != b.desc)
    {
        printf("register address '%s.%s.%s.%s' have different descriptions\n", soc.name.c_str(),
            dev.name.c_str(), reg.name.c_str(), a.name.c_str());
        return false;
    }
    /* values */
    std::vector< std::pair< size_t, size_t > > map;
    if(!build_map("field value", a.value, b.value, map))
        return false;
    for(size_t i = 0; i < map.size(); i++)
        if(!compare_value(soc, dev, reg, a, a.value[map[i].first], b.value[map[i].second]))
            return false;
    return true;
}

bool compare_reg_addr(const soc_t& soc, const soc_dev_t& dev, const soc_reg_t& reg,
        const soc_reg_addr_t& a, const soc_reg_addr_t& b)
{
    if(a.addr != b.addr)
    {
        printf("register address '%s.%s.%s.%s' have different values\n", soc.name.c_str(),
            dev.name.c_str(), reg.name.c_str(), a.name.c_str());
        return false;
    }
    else
        return true;
}

bool compare_reg(const soc_t& soc, const soc_dev_t& dev, const soc_reg_t& a,
        const soc_reg_t& b)
{
    if(a.desc != b.desc)
    {
        printf("register '%s.%s.%s' have different descriptions\n", soc.name.c_str(),
            dev.name.c_str(), a.name.c_str());
        return false;
    }
    if(a.flags != b.flags)
    {
        printf("device '%s.%s.%s' have different flags\n", soc.name.c_str(),
            dev.name.c_str(), a.name.c_str());
        return false;
    }
    if(a.formula.type != b.formula.type)
    {
        printf("device '%s.%s.%s' have different formula types\n", soc.name.c_str(),
            dev.name.c_str(), a.name.c_str());
        return false;
    }
    if(a.formula.string != b.formula.string)
    {
        printf("device '%s.%s.%s' have different formula string\n", soc.name.c_str(),
            dev.name.c_str(), a.name.c_str());
        return false;
    }
    /* addresses */
    std::vector< std::pair< size_t, size_t > > map;
    if(!build_map("register address", a.addr, b.addr, map))
        return false;
    for(size_t i = 0; i < map.size(); i++)
        if(!compare_reg_addr(soc, dev, a, a.addr[map[i].first], b.addr[map[i].second]))
            return false;
    /* field */
    map.clear();
    if(!build_map("field", a.field, b.field, map))
        return false;
    for(size_t i = 0; i < map.size(); i++)
        if(!compare_field(soc, dev, a, a.field[map[i].first], b.field[map[i].second]))
            return false;
    return true;
}

bool compare_dev_addr(const soc_t& soc, const soc_dev_t& dev, const soc_dev_addr_t& a,
        const soc_dev_addr_t& b)
{
    if(a.addr != b.addr)
    {
        printf("device address '%s.%s.%s' have different values\n", soc.name.c_str(),
            dev.name.c_str(), a.name.c_str());
        return false;
    }
    else
        return true;
}

bool compare_dev(const soc_t& soc, const soc_dev_t& a, const soc_dev_t& b)
{
    if(a.long_name != b.long_name)
    {
        printf("device '%s.%s' have different long names\n", soc.name.c_str(),
            a.name.c_str());
        return false;
    }
    if(a.desc != b.desc)
    {
        printf("device '%s.%s' have different descriptions\n", soc.name.c_str(),
            a.name.c_str());
        return false;
    }
    if(a.version != b.version)
    {
        printf("device '%s.%s' have different versions\n", soc.name.c_str(),
            a.name.c_str());
        return false;
    }
    /* addresses */
    std::vector< std::pair< size_t, size_t > > map;
    if(!build_map("device address", a.addr, b.addr, map))
        return false;
    for(size_t i = 0; i < map.size(); i++)
        if(!compare_dev_addr(soc, a, a.addr[map[i].first], b.addr[map[i].second]))
            return false;
    /* reg */
    map.clear();
    if(!build_map("register", a.reg, b.reg, map))
        return false;
    for(size_t i = 0; i < map.size(); i++)
        if(!compare_reg(soc, a, a.reg[map[i].first], b.reg[map[i].second]))
            return false;
    return true;
}

bool compare_soc(const soc_t& a, const soc_t& b)
{
    if(a.name != b.name)
    {
        return printf("soc have different names\n");
        return false;
    }
    if(a.desc != b.desc)
    {
        printf("soc '%s' have different descriptions\n", a.name.c_str());
        return false;
    }
    std::vector< std::pair< size_t, size_t > > map;
    if(!build_map("device", a.dev, b.dev, map))
        return false;
    for(size_t i = 0; i< map.size(); i++)
        if(!compare_dev(a, a.dev[map[i].first], b.dev[map[i].second]))
            return false;
    return true;
}

int do_compare(int argc, char **argv)
{
    if(argc != 2)
        return printf("compare mode expects two arguments\n");
    soc_t soc[2];
    if(!soc_desc_parse_xml(argv[0], soc[0]))
        return printf("cannot read file '%s'\n", argv[0]);
    if(!soc_desc_parse_xml(argv[1], soc[1]))
        return printf("cannot read file '%s'\n", argv[1]);
    if(compare_soc(soc[0], soc[1]))
        printf("Files are identical.\n");
    return 0;
}

int do_write(int argc, char **argv)
{
    if(argc != 2)
        return printf("write mode expects two arguments\n");
    soc_t soc;
    if(!soc_desc_parse_xml(argv[0], soc))
        return printf("cannot read file '%s'\n", argv[0]);
    if(!soc_desc_produce_xml(argv[1], soc))
        return printf("cannot write file '%s'\n", argv[1]);
    return 0;
}

int do_check(int argc, char **argv)
{
    for(int i = 0; i < argc; i++)
    {
        soc_t soc;
        if(!soc_desc_parse_xml(argv[i], soc))
        {
            printf("cannot read file '%s'\n", argv[i]);
            continue;
        }
        printf("[%s]\n", argv[i]);
        std::vector< soc_error_t > errs = soc.errors(true);
        for(size_t i = 0; i < errs.size(); i++)
        {
            const soc_error_t& e = errs[i];
            switch(e.level)
            {
                case SOC_ERROR_WARNING: printf("[WARN ] "); break;
                case SOC_ERROR_FATAL: printf("[FATAL] "); break;
                default: printf("[ UNK ] "); break;
            }
            printf("%s: %s\n", e.location.c_str(), e.message.c_str());
        }
    }
    return 0;
}

int do_eval(int argc, char **argv)
{
    std::map< std::string, soc_word_t > map;
    for(int i = 0; i < argc; i++)
    {
        std::string error;
        std::string formula(argv[i]);
        soc_word_t result;
        if(strcmp(argv[i], "--var") == 0)
        {
            if(i + 1 >= argc)
                break;
            i++;
            std::string str(argv[i]);
            size_t pos = str.find('=');
            if(pos == std::string::npos)
            {
                printf("invalid variable string '%s'\n", str.c_str());
                continue;
            }
            std::string name = str.substr(0, pos);
            std::string val = str.substr(pos + 1);
            char *end;
            soc_word_t v = strtoul(val.c_str(), &end, 0);
            if(*end)
            {
                printf("invalid variable string '%s'\n", str.c_str());
                continue;
            }
            printf("%s = %#lx\n", name.c_str(), (unsigned long)v);
            map[name] = v;
            continue;
        }
        if(!soc_desc_evaluate_formula(formula, map, result, error))
            printf("error: %s\n", error.c_str());
        else
            printf("result: %lu (%#lx)\n", (unsigned long)result, (unsigned long)result);
    }
    return 0;
}

void usage()
{
    printf("usage: tester <mode> [options]\n");
    printf("modes:\n");
    printf("  compare <desc file> <desc file>\n");
    printf("  write <read file> <write file>\n");
    printf("  check <files...>\n");
    printf("  eval [<formula>|--var <name>=<val>]...\n");
    exit(1);
}

int main(int argc, char **argv)
{
    if(argc < 2)
        usage();
    std::string mode = argv[1];
    if(mode == "compare")
        return do_compare(argc - 2, argv +  2);
    else if(mode == "write")
        return do_write(argc - 2, argv +  2);
    else if(mode == "check")
        return do_check(argc - 2, argv +  2);
    else if(mode == "eval")
        return do_eval(argc - 2, argv +  2);
    else
        usage();
    return 0;
}