mirror of
https://github.com/dgibson/dtc.git
synced 2025-10-13 16:27:39 -04:00
bad5b28049
This fixes a great many sparse warnings on the fdt and libfdt sources. These are mostly due to incorrect mixing of endian annotated and native integer types. This includes fixing a couple of quasi-bugs where we had endian conversions the wrong way around (this will have the right effect in practice, but is certainly conceptually incorrect). This doesn't make the whole tree sparse clean: there are many warnings in bison and lex generated code, and there are a handful of other remaining warnings that are (for now) more trouble than they're worth to fix (and are not genuine bugs). Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
70 lines
1.8 KiB
C
70 lines
1.8 KiB
C
/*
|
|
* dumptrees - utility for libfdt testing
|
|
*
|
|
* (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2006.
|
|
*
|
|
*
|
|
* 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 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 General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
|
|
* USA
|
|
*/
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
#include <fcntl.h>
|
|
#include <stdint.h>
|
|
|
|
#include <libfdt.h>
|
|
|
|
#include "testdata.h"
|
|
|
|
static struct {
|
|
void *blob;
|
|
const char *filename;
|
|
} trees[] = {
|
|
#define TREE(name) { &_##name, #name ".dtb" }
|
|
TREE(test_tree1),
|
|
TREE(bad_node_char), TREE(bad_node_format), TREE(bad_prop_char),
|
|
TREE(ovf_size_strings),
|
|
};
|
|
|
|
#define NUM_TREES (sizeof(trees) / sizeof(trees[0]))
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < NUM_TREES; i++) {
|
|
void *blob = trees[i].blob;
|
|
const char *filename = trees[i].filename;
|
|
int size;
|
|
int fd;
|
|
int ret;
|
|
|
|
size = fdt_totalsize(blob);
|
|
|
|
printf("Tree \"%s\", %d bytes\n", filename, size);
|
|
|
|
fd = open(filename, O_WRONLY | O_CREAT | O_TRUNC, 0666);
|
|
if (fd < 0)
|
|
perror("open()");
|
|
|
|
ret = write(fd, blob, size);
|
|
if (ret != size)
|
|
perror("write()");
|
|
|
|
close(fd);
|
|
}
|
|
exit(0);
|
|
}
|