1 /*

     2  * libfdt - Flat Device Tree manipulation

     3  *	Testcase for fdt_nop_node()

     4  * Copyright (C) 2006 David Gibson, IBM Corporation.

     5  *

     6  * This library is free software; you can redistribute it and/or

     7  * modify it under the terms of the GNU Lesser General Public License

     8  * as published by the Free Software Foundation; either version 2.1 of

     9  * the License, or (at your option) any later version.

    10  *

    11  * This library is distributed in the hope that it will be useful, but

    12  * WITHOUT ANY WARRANTY; without even the implied warranty of

    13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

    14  * Lesser General Public License for more details.

    15  *

    16  * You should have received a copy of the GNU Lesser General Public

    17  * License along with this library; if not, write to the Free Software

    18  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA

    19  */

    20 

    21 #include <stdlib.h>

    22 #include <stdio.h>

    23 #include <string.h>

    24 #include <ctype.h>

    25 #include <stdint.h>

    26 

    27 #include <fdt.h>

    28 #include <libfdt.h>

    29 

    30 #include "tests.h"

    31 #include "testdata.h"

    32 

    33 #define SPACE	65536

    34 

    35 #define CHECK(code) \

    36 	{ \

    37 		err = (code); \

    38 		if (err) \

    39 			FAIL(#code ": %s", fdt_strerror(err)); \

    40 	}

    41 

    42 #define OFF_CHECK(off, code) \

    43 	{ \

    44 		(off) = (code); \

    45 		if (off < 0) \

    46 			FAIL(#code ": %s", fdt_strerror(off)); \

    47 	}

    48 

    49 int main(int argc, char *argv[])

    50 {

    51 	void *fdt;

    52 	int err;

    53 	int offset;

    54 

    55 	test_init(argc, argv);

    56 

    57 	fdt = xmalloc(SPACE);

    58 

    59 	/* First create empty tree with SW */

    60 	CHECK(fdt_create(fdt, SPACE));

    61 

    62 	CHECK(fdt_finish_reservemap(fdt));

    63 	CHECK(fdt_begin_node(fdt, ""));

    64 	CHECK(fdt_end_node(fdt));

    65 	CHECK(fdt_finish(fdt));

    66 

    67 	verbose_printf("Built empty tree, totalsize = %d\n",

    68 		       fdt_totalsize(fdt));

    69 

    70 	CHECK(fdt_open_into(fdt, fdt, SPACE));

    71 

    72 	CHECK(fdt_add_mem_rsv(fdt, TEST_ADDR_1, TEST_SIZE_1));

    73 	CHECK(fdt_add_mem_rsv(fdt, TEST_ADDR_2, TEST_SIZE_2));

    74 

    75 	CHECK(fdt_setprop_string(fdt, 0, "compatible", "test_tree1"));

    76 	CHECK(fdt_setprop_cell(fdt, 0, "prop-int", TEST_VALUE_1));

    77 	CHECK(fdt_setprop_string(fdt, 0, "prop-str", TEST_STRING_1));

    78 

    79 	OFF_CHECK(offset, fdt_add_subnode(fdt, 0, "subnode@1"));

    80 	CHECK(fdt_setprop_string(fdt, offset, "compatible", "subnode1"));

    81 	CHECK(fdt_setprop_cell(fdt, offset, "prop-int", TEST_VALUE_1));

    82 	OFF_CHECK(offset, fdt_add_subnode(fdt, offset, "subsubnode"));

    83 	CHECK(fdt_setprop(fdt, offset, "compatible",

    84 			  "subsubnode1\0subsubnode", 23));

    85 	CHECK(fdt_setprop_cell(fdt, offset, "prop-int", TEST_VALUE_1));

    86 

    87 	OFF_CHECK(offset, fdt_add_subnode(fdt, 0, "subnode@2"));

    88 	CHECK(fdt_setprop_cell(fdt, offset, "linux,phandle", PHANDLE_1));

    89 	CHECK(fdt_setprop_cell(fdt, offset, "prop-int", TEST_VALUE_2));

    90 	OFF_CHECK(offset, fdt_add_subnode(fdt, offset, "subsubnode@0"));

    91 	CHECK(fdt_setprop_cell(fdt, offset, "linux,phandle", PHANDLE_2));

    92 	CHECK(fdt_setprop(fdt, offset, "compatible",

    93 			  "subsubnode2\0subsubnode", 23));

    94 	CHECK(fdt_setprop_cell(fdt, offset, "prop-int", TEST_VALUE_2));

    95 

    96 	CHECK(fdt_pack(fdt));

    97 

    98 	save_blob("rw_tree1.test.dtb", fdt);

    99 

   100 	PASS();

   101 }