9521dc5ecc
In a number of places through libfdt and its tests, we have *_typed() macro variants on functions which use gcc's typeof and statement expression extensions to allow passing literals where the underlying function takes a buffer and size. These seemed like a good idea at the time, but in fact they have some problems. They use typeof and statement expressions, extensions I'd prefer to avoid for portability. Plus, they have potential gotchas - although they'll deal with the size of the thing passed, they won't deal with other representation issues (like endianness) and results could be very strange if the type of the expression passed isn't what you think it is. In fact, the only users of these _typed() macros were when the value passed is a single cell (32-bit integer). Therefore, this patch removes all these _typed() macros and replaces them with explicit _cell() variants which handle a single 32-bit integer, and which also perform endian convesions as appropriate. With this in place, it now becomes easy to use standardized big-endian representation for integer valued properties in the testcases, regardless of the platform we're running on. We therefore do that, which has the additional advantage that all the example trees created during a test run are now byte-for-byte identical regardless of platform. Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
137 lines
3.5 KiB
C
137 lines
3.5 KiB
C
#ifndef _TESTS_H
|
|
#define _TESTS_H
|
|
/*
|
|
* libfdt - Flat Device Tree manipulation
|
|
* Testcase definitions
|
|
* Copyright (C) 2006 David Gibson, IBM Corporation.
|
|
*
|
|
* This library 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 2.1 of
|
|
* the License, or (at your option) any later version.
|
|
*
|
|
* This library 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
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#define DEBUG
|
|
|
|
/* Test return codes */
|
|
#define RC_PASS 0
|
|
#define RC_CONFIG 1
|
|
#define RC_FAIL 2
|
|
#define RC_BUG 99
|
|
|
|
extern int verbose_test;
|
|
extern char *test_name;
|
|
void test_init(int argc, char *argv[]);
|
|
|
|
#define ALIGN(x, a) (((x) + (a) - 1) & ~((a) - 1))
|
|
#define PALIGN(p, a) ((void *)ALIGN((unsigned long)(p), (a)))
|
|
|
|
#define streq(s1, s2) (strcmp((s1),(s2)) == 0)
|
|
|
|
/* Each test case must define this function */
|
|
void cleanup(void);
|
|
|
|
#define verbose_printf(...) \
|
|
if (verbose_test) { \
|
|
printf(__VA_ARGS__); \
|
|
fflush(stdout); \
|
|
}
|
|
#define ERR "ERR: "
|
|
#define ERROR(fmt, args...) fprintf(stderr, ERR fmt, ## args)
|
|
|
|
|
|
#define PASS() \
|
|
do { \
|
|
cleanup(); \
|
|
printf("PASS\n"); \
|
|
exit(RC_PASS); \
|
|
} while (0)
|
|
|
|
#define PASS_INCONCLUSIVE() \
|
|
do { \
|
|
cleanup(); \
|
|
printf("PASS (inconclusive)\n"); \
|
|
exit(RC_PASS); \
|
|
} while (0)
|
|
|
|
#define IRRELEVANT() \
|
|
do { \
|
|
cleanup(); \
|
|
printf("PASS (irrelevant)\n"); \
|
|
exit(RC_PASS); \
|
|
} while (0)
|
|
|
|
/* Look out, gcc extension below... */
|
|
#define FAIL(fmt, ...) \
|
|
do { \
|
|
cleanup(); \
|
|
printf("FAIL\t" fmt "\n", ##__VA_ARGS__); \
|
|
exit(RC_FAIL); \
|
|
} while (0)
|
|
|
|
#define CONFIG(fmt, ...) \
|
|
do { \
|
|
cleanup(); \
|
|
printf("Bad configuration: " fmt "\n", ##__VA_ARGS__); \
|
|
exit(RC_CONFIG); \
|
|
} while (0)
|
|
|
|
#define TEST_BUG(fmt, ...) \
|
|
do { \
|
|
cleanup(); \
|
|
printf("BUG in testsuite: " fmt "\n", ##__VA_ARGS__); \
|
|
exit(RC_BUG); \
|
|
} while (0)
|
|
|
|
static inline void *xmalloc(size_t size)
|
|
{
|
|
void *p = malloc(size);
|
|
if (! p)
|
|
FAIL("malloc() failure");
|
|
return p;
|
|
}
|
|
|
|
static inline void *xrealloc(void *p, size_t size)
|
|
{
|
|
p = realloc(p, size);
|
|
if (! p)
|
|
FAIL("realloc() failure");
|
|
return p;
|
|
}
|
|
|
|
void check_mem_rsv(void *fdt, int n, uint64_t addr, uint64_t size);
|
|
|
|
void check_property(void *fdt, int nodeoffset, const char *name,
|
|
int len, const void *val);
|
|
#define check_property_cell(fdt, nodeoffset, name, val) \
|
|
({ \
|
|
uint32_t x = cpu_to_fdt32(val); \
|
|
check_property(fdt, nodeoffset, name, sizeof(x), &x); \
|
|
})
|
|
|
|
|
|
const void *check_getprop(void *fdt, int nodeoffset, const char *name,
|
|
int len, const void *val);
|
|
#define check_getprop_cell(fdt, nodeoffset, name, val) \
|
|
({ \
|
|
uint32_t x = cpu_to_fdt32(val); \
|
|
check_getprop(fdt, nodeoffset, name, sizeof(x), &x); \
|
|
})
|
|
#define check_getprop_string(fdt, nodeoffset, name, s) \
|
|
check_getprop((fdt), (nodeoffset), (name), strlen(s)+1, (s))
|
|
int nodename_eq(const char *s1, const char *s2);
|
|
void *load_blob(const char *filename);
|
|
void *load_blob_arg(int argc, char *argv[]);
|
|
void save_blob(const char *filename, void *blob);
|
|
void *open_blob_rw(void *blob);
|
|
|
|
#endif /* _TESTS_H */
|