|
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 int main(int argc, char *argv[]) |
|
43 { |
|
44 void *fdt; |
|
45 int err; |
|
46 |
|
47 test_init(argc, argv); |
|
48 |
|
49 fdt = xmalloc(SPACE); |
|
50 CHECK(fdt_create(fdt, SPACE)); |
|
51 |
|
52 CHECK(fdt_add_reservemap_entry(fdt, TEST_ADDR_1, TEST_SIZE_1)); |
|
53 CHECK(fdt_add_reservemap_entry(fdt, TEST_ADDR_2, TEST_SIZE_2)); |
|
54 CHECK(fdt_finish_reservemap(fdt)); |
|
55 |
|
56 CHECK(fdt_begin_node(fdt, "")); |
|
57 CHECK(fdt_property_string(fdt, "compatible", "test_tree1")); |
|
58 CHECK(fdt_property_cell(fdt, "prop-int", TEST_VALUE_1)); |
|
59 CHECK(fdt_property_string(fdt, "prop-str", TEST_STRING_1)); |
|
60 |
|
61 CHECK(fdt_begin_node(fdt, "subnode@1")); |
|
62 CHECK(fdt_property_string(fdt, "compatible", "subnode1")); |
|
63 CHECK(fdt_property_cell(fdt, "prop-int", TEST_VALUE_1)); |
|
64 CHECK(fdt_begin_node(fdt, "subsubnode")); |
|
65 CHECK(fdt_property(fdt, "compatible", "subsubnode1\0subsubnode", |
|
66 23)); |
|
67 CHECK(fdt_property_cell(fdt, "prop-int", TEST_VALUE_1)); |
|
68 CHECK(fdt_end_node(fdt)); |
|
69 CHECK(fdt_end_node(fdt)); |
|
70 |
|
71 CHECK(fdt_begin_node(fdt, "subnode@2")); |
|
72 CHECK(fdt_property_cell(fdt, "linux,phandle", PHANDLE_1)); |
|
73 CHECK(fdt_property_cell(fdt, "prop-int", TEST_VALUE_2)); |
|
74 CHECK(fdt_begin_node(fdt, "subsubnode@0")); |
|
75 CHECK(fdt_property_cell(fdt, "linux,phandle", PHANDLE_2)); |
|
76 CHECK(fdt_property(fdt, "compatible", "subsubnode2\0subsubnode", |
|
77 23)); |
|
78 CHECK(fdt_property_cell(fdt, "prop-int", TEST_VALUE_2)); |
|
79 CHECK(fdt_end_node(fdt)); |
|
80 CHECK(fdt_end_node(fdt)); |
|
81 |
|
82 CHECK(fdt_end_node(fdt)); |
|
83 |
|
84 save_blob("unfinished_tree1.test.dtb", fdt); |
|
85 |
|
86 CHECK(fdt_finish(fdt)); |
|
87 |
|
88 verbose_printf("Completed tree, totalsize = %d\n", |
|
89 fdt_totalsize(fdt)); |
|
90 |
|
91 save_blob("sw_tree1.test.dtb", fdt); |
|
92 |
|
93 PASS(); |
|
94 } |