qemu/dtc/tests/sw_tree1.c

   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 <libfdt.h>
  28
  29 #include "tests.h"
  30 #include "testdata.h"
  31
  32 #define SPACE   65536
  33
  34 #define CHECK(code) \
  35         { \
  36                 err = (code); \
  37                 if (err) \
  38                         FAIL(#code ": %s", fdt_strerror(err)); \
  39         }
  40
  41 int main(int argc, char *argv[])
  42 {
  43         void *fdt;
  44         int err;
  45
  46         test_init(argc, argv);
  47
  48         fdt = xmalloc(SPACE);
  49         CHECK(fdt_create(fdt, SPACE));
  50
  51         CHECK(fdt_add_reservemap_entry(fdt, TEST_ADDR_1, TEST_SIZE_1));
  52         CHECK(fdt_add_reservemap_entry(fdt, TEST_ADDR_2, TEST_SIZE_2));
  53         CHECK(fdt_finish_reservemap(fdt));
  54
  55         CHECK(fdt_begin_node(fdt, ""));
  56         CHECK(fdt_property_string(fdt, "compatible", "test_tree1"));
  57         CHECK(fdt_property_u32(fdt, "prop-int", TEST_VALUE_1));
  58         CHECK(fdt_property_u64(fdt, "prop-int64", TEST_VALUE64_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_begin_node(fdt, "ss1"));
  70         CHECK(fdt_end_node(fdt));
  71         CHECK(fdt_end_node(fdt));
  72
  73         CHECK(fdt_begin_node(fdt, "subnode@2"));
  74         CHECK(fdt_property_cell(fdt, "linux,phandle", PHANDLE_1));
  75         CHECK(fdt_property_cell(fdt, "prop-int", TEST_VALUE_2));
  76         CHECK(fdt_begin_node(fdt, "subsubnode@0"));
  77         CHECK(fdt_property_cell(fdt, "phandle", PHANDLE_2));
  78         CHECK(fdt_property(fdt, "compatible", "subsubnode2\0subsubnode",
  79                            23));
  80         CHECK(fdt_property_cell(fdt, "prop-int", TEST_VALUE_2));
  81         CHECK(fdt_end_node(fdt));
  82         CHECK(fdt_begin_node(fdt, "ss2"));
  83         CHECK(fdt_end_node(fdt));
  84
  85         CHECK(fdt_end_node(fdt));
  86
  87         CHECK(fdt_end_node(fdt));
  88
  89         save_blob("unfinished_tree1.test.dtb", fdt);
  90
  91         CHECK(fdt_finish(fdt));
  92
  93         verbose_printf("Completed tree, totalsize = %d\n",
  94                        fdt_totalsize(fdt));
  95
  96         save_blob("sw_tree1.test.dtb", fdt);
  97
  98         PASS();
  99 }