f99cd158a9
There's currently an off-by-one bug in fdt_subnode_offset_namelen() which causes it to keep searching after it's finished the subnodes of the given parent, and into the subnodes of siblings of the original node which come after it in the tree. This patch fixes the bug. It also extends the subnode_offset testcase (updating all of the 'test_tree1' example trees in the process) to catch it. Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
105 lines
3 KiB
C
105 lines
3 KiB
C
/*
|
|
* libfdt - Flat Device Tree manipulation
|
|
* Testcase for fdt_nop_node()
|
|
* 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>
|
|
#include <ctype.h>
|
|
#include <stdint.h>
|
|
|
|
#include <fdt.h>
|
|
#include <libfdt.h>
|
|
|
|
#include "tests.h"
|
|
#include "testdata.h"
|
|
|
|
#define SPACE 65536
|
|
|
|
#define CHECK(code) \
|
|
{ \
|
|
err = (code); \
|
|
if (err) \
|
|
FAIL(#code ": %s", fdt_strerror(err)); \
|
|
}
|
|
|
|
#define OFF_CHECK(off, code) \
|
|
{ \
|
|
(off) = (code); \
|
|
if (off < 0) \
|
|
FAIL(#code ": %s", fdt_strerror(off)); \
|
|
}
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
void *fdt;
|
|
int err;
|
|
int offset, s1, s2;
|
|
|
|
test_init(argc, argv);
|
|
|
|
fdt = xmalloc(SPACE);
|
|
|
|
/* First create empty tree with SW */
|
|
CHECK(fdt_create(fdt, SPACE));
|
|
|
|
CHECK(fdt_finish_reservemap(fdt));
|
|
CHECK(fdt_begin_node(fdt, ""));
|
|
CHECK(fdt_end_node(fdt));
|
|
CHECK(fdt_finish(fdt));
|
|
|
|
verbose_printf("Built empty tree, totalsize = %d\n",
|
|
fdt_totalsize(fdt));
|
|
|
|
CHECK(fdt_open_into(fdt, fdt, SPACE));
|
|
|
|
CHECK(fdt_add_mem_rsv(fdt, TEST_ADDR_1, TEST_SIZE_1));
|
|
CHECK(fdt_add_mem_rsv(fdt, TEST_ADDR_2, TEST_SIZE_2));
|
|
|
|
CHECK(fdt_setprop_string(fdt, 0, "compatible", "test_tree1"));
|
|
CHECK(fdt_setprop_cell(fdt, 0, "prop-int", TEST_VALUE_1));
|
|
CHECK(fdt_setprop_string(fdt, 0, "prop-str", TEST_STRING_1));
|
|
|
|
OFF_CHECK(offset, fdt_add_subnode(fdt, 0, "subnode@1"));
|
|
s1 = offset;
|
|
CHECK(fdt_setprop_string(fdt, s1, "compatible", "subnode1"));
|
|
CHECK(fdt_setprop_cell(fdt, s1, "prop-int", TEST_VALUE_1));
|
|
OFF_CHECK(offset, fdt_add_subnode(fdt, s1, "subsubnode"));
|
|
CHECK(fdt_setprop(fdt, offset, "compatible",
|
|
"subsubnode1\0subsubnode", 23));
|
|
CHECK(fdt_setprop_cell(fdt, offset, "prop-int", TEST_VALUE_1));
|
|
OFF_CHECK(offset, fdt_add_subnode(fdt, s1, "ss1"));
|
|
|
|
OFF_CHECK(offset, fdt_add_subnode(fdt, 0, "subnode@2"));
|
|
s2 = offset;
|
|
CHECK(fdt_setprop_cell(fdt, s2, "linux,phandle", PHANDLE_1));
|
|
CHECK(fdt_setprop_cell(fdt, s2, "prop-int", TEST_VALUE_2));
|
|
OFF_CHECK(offset, fdt_add_subnode(fdt, s2, "subsubnode@0"));
|
|
CHECK(fdt_setprop_cell(fdt, offset, "linux,phandle", PHANDLE_2));
|
|
CHECK(fdt_setprop(fdt, offset, "compatible",
|
|
"subsubnode2\0subsubnode", 23));
|
|
CHECK(fdt_setprop_cell(fdt, offset, "prop-int", TEST_VALUE_2));
|
|
OFF_CHECK(offset, fdt_add_subnode(fdt, s2, "ss2"));
|
|
|
|
CHECK(fdt_pack(fdt));
|
|
|
|
save_blob("rw_tree1.test.dtb", fdt);
|
|
|
|
PASS();
|
|
}
|