2006-11-27 06:21:28 +01:00
|
|
|
/*
|
|
|
|
* libfdt - Flat Device Tree manipulation
|
|
|
|
* Basic testcase for read-only access
|
|
|
|
* 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
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
2007-03-23 05:16:54 +01:00
|
|
|
#include <stdint.h>
|
2006-11-27 06:21:28 +01:00
|
|
|
|
|
|
|
#include <libfdt.h>
|
|
|
|
|
|
|
|
#include "tests.h"
|
|
|
|
#include "testdata.h"
|
|
|
|
|
|
|
|
int main(int argc, char *argv[])
|
|
|
|
{
|
2006-12-15 05:12:47 +01:00
|
|
|
void *fdt;
|
2007-11-19 07:26:22 +01:00
|
|
|
const struct fdt_node_header *nh;
|
2006-11-27 06:21:28 +01:00
|
|
|
|
|
|
|
test_init(argc, argv);
|
2006-11-28 07:20:01 +01:00
|
|
|
fdt = load_blob_arg(argc, argv);
|
2007-09-18 03:44:04 +02:00
|
|
|
|
2007-11-19 07:26:22 +01:00
|
|
|
nh = fdt_offset_ptr(fdt, 0, sizeof(*nh));
|
2006-11-27 06:21:28 +01:00
|
|
|
|
|
|
|
if (! nh)
|
|
|
|
FAIL("NULL retrieving root node");
|
|
|
|
|
2006-12-04 02:52:45 +01:00
|
|
|
if (fdt32_to_cpu(nh->tag) != FDT_BEGIN_NODE)
|
2006-11-27 06:21:28 +01:00
|
|
|
FAIL("Wrong tag on root node");
|
|
|
|
|
|
|
|
if (strlen(nh->name) != 0)
|
|
|
|
FAIL("Wrong name for root node, \"%s\" instead of empty",
|
|
|
|
nh->name);
|
|
|
|
|
|
|
|
PASS();
|
|
|
|
}
|