Add files for 6a15eb2350426d285130e4c9d84c0bdb6575547a import
This commit is contained in:
@@ -0,0 +1,37 @@
|
||||
/dts-v1/;
|
||||
|
||||
/* Create some nodes and properties with multiple labels */
|
||||
|
||||
/ {
|
||||
label1: label2: prop = "value";
|
||||
|
||||
label3: label4: node {
|
||||
label5: label6: prop = "value";
|
||||
};
|
||||
};
|
||||
|
||||
/* Delete them, and everything that's part of them, i.e. the labels */
|
||||
|
||||
/ {
|
||||
/delete-property/ prop;
|
||||
/delete-node/ node;
|
||||
};
|
||||
|
||||
/*
|
||||
* Re-instate them. None of the old labels should come back
|
||||
*
|
||||
* Note: Do not add any new/extra labels here. As of the time of writing,
|
||||
* when dtc adds labels to an object, they are added to the head of the list
|
||||
* of labels, and this test is specifically about ensuring the correct
|
||||
* handling of lists of labels where the first label in the list is marked as
|
||||
* deleted. Failure to observe this note may result in the test passing when
|
||||
* it should not.
|
||||
*/
|
||||
|
||||
/ {
|
||||
prop = "value";
|
||||
|
||||
node {
|
||||
prop = "value";
|
||||
};
|
||||
};
|
||||
@@ -0,0 +1,9 @@
|
||||
/dts-v1/;
|
||||
|
||||
/ {
|
||||
prop = "value";
|
||||
|
||||
node {
|
||||
prop = "value";
|
||||
};
|
||||
};
|
||||
@@ -0,0 +1,21 @@
|
||||
/dts-v1/;
|
||||
|
||||
/* common format */
|
||||
#line 3 "foo.dts"
|
||||
/* newer gcc format */
|
||||
# 9 "baz.dts" 1
|
||||
/* flags are optional */
|
||||
# 6 "bar.dts"
|
||||
|
||||
/ {
|
||||
/*
|
||||
* Make sure optional flags don't consume integer data on next line. The issue
|
||||
* was that the {WS} in the trailing ({WS}+[0-9]+)? could cross the * line-
|
||||
* break, and consume the leading "0" of the hex constant, leaving "x12345678"
|
||||
* to be parsed as a number, which is invalid syntax.
|
||||
*/
|
||||
prop1 = <
|
||||
# 10 "qux.dts"
|
||||
0x12345678
|
||||
>;
|
||||
};
|
||||
@@ -0,0 +1,42 @@
|
||||
/*
|
||||
* libfdt - Flat Device Tree manipulation
|
||||
* Testcase for fdt_getprop()
|
||||
* Copyright (C) 2006 David Gibson, IBM Corporation.
|
||||
* Copyright (C) 2012 NVIDIA CORPORATION. All rights reserved.
|
||||
*
|
||||
* 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 <stdint.h>
|
||||
|
||||
#include <libfdt.h>
|
||||
|
||||
#include "tests.h"
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
void *fdt;
|
||||
|
||||
test_init(argc, argv);
|
||||
fdt = load_blob_arg(argc, argv);
|
||||
|
||||
check_getprop_cell(fdt, 0, "#address-cells", 1);
|
||||
check_getprop_cell(fdt, 0, "#gpio-cells", 2);
|
||||
|
||||
PASS();
|
||||
}
|
||||
@@ -0,0 +1,6 @@
|
||||
/dts-v1/;
|
||||
|
||||
/ {
|
||||
#address-cells = <1>;
|
||||
\#gpio-cells = <2>;
|
||||
};
|
||||
@@ -0,0 +1,94 @@
|
||||
/*
|
||||
* libfdt - Flat Device Tree manipulation
|
||||
* Tests that fdt_next_subnode() works as expected
|
||||
*
|
||||
* Copyright (C) 2013 Google, Inc
|
||||
*
|
||||
* Copyright (C) 2007 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 <stdint.h>
|
||||
|
||||
#include <libfdt.h>
|
||||
|
||||
#include "tests.h"
|
||||
#include "testdata.h"
|
||||
|
||||
static void test_node(void *fdt, int parent_offset)
|
||||
{
|
||||
fdt32_t subnodes;
|
||||
const fdt32_t *prop;
|
||||
int offset;
|
||||
int count;
|
||||
int len;
|
||||
|
||||
/* This property indicates the number of subnodes to expect */
|
||||
prop = fdt_getprop(fdt, parent_offset, "subnodes", &len);
|
||||
if (!prop || len != sizeof(fdt32_t)) {
|
||||
FAIL("Missing/invalid subnodes property at '%s'",
|
||||
fdt_get_name(fdt, parent_offset, NULL));
|
||||
}
|
||||
subnodes = cpu_to_fdt32(*prop);
|
||||
|
||||
count = 0;
|
||||
for (offset = fdt_first_subnode(fdt, parent_offset);
|
||||
offset >= 0;
|
||||
offset = fdt_next_subnode(fdt, offset))
|
||||
count++;
|
||||
|
||||
if (count != subnodes) {
|
||||
FAIL("Node '%s': Expected %d subnodes, got %d\n",
|
||||
fdt_get_name(fdt, parent_offset, NULL), subnodes,
|
||||
count);
|
||||
}
|
||||
}
|
||||
|
||||
static void check_fdt_next_subnode(void *fdt)
|
||||
{
|
||||
int offset;
|
||||
int count = 0;
|
||||
|
||||
for (offset = fdt_first_subnode(fdt, 0);
|
||||
offset >= 0;
|
||||
offset = fdt_next_subnode(fdt, offset)) {
|
||||
test_node(fdt, offset);
|
||||
count++;
|
||||
}
|
||||
|
||||
if (count != 2)
|
||||
FAIL("Expected %d tests, got %d\n", 2, count);
|
||||
}
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
void *fdt;
|
||||
|
||||
test_init(argc, argv);
|
||||
if (argc != 2)
|
||||
CONFIG("Usage: %s <dtb file>", argv[0]);
|
||||
|
||||
fdt = load_blob(argv[1]);
|
||||
if (!fdt)
|
||||
FAIL("No device tree available");
|
||||
|
||||
check_fdt_next_subnode(fdt);
|
||||
|
||||
PASS();
|
||||
}
|
||||
@@ -0,0 +1,44 @@
|
||||
/dts-v1/;
|
||||
|
||||
/ {
|
||||
#address-cells = <1>;
|
||||
#size-cells = <0>;
|
||||
|
||||
test1 {
|
||||
subnodes = <2>;
|
||||
linux,phandle = <0x1>;
|
||||
#address-cells = <1>;
|
||||
#size-cells = <0>;
|
||||
PowerPC,970@0 {
|
||||
name = "PowerPC,970";
|
||||
device_type = "cpu";
|
||||
reg = <0x00000000>;
|
||||
clock-frequency = <1600000000>;
|
||||
timebase-frequency = <33333333>;
|
||||
linux,boot-cpu;
|
||||
i-cache-size = <65536>;
|
||||
d-cache-size = <32768>;
|
||||
another-sub-node {
|
||||
should-be-ignored;
|
||||
yet-another {
|
||||
should-also-be-ignored;
|
||||
};
|
||||
};
|
||||
};
|
||||
|
||||
PowerPC,970@1 {
|
||||
name = "PowerPC,970";
|
||||
device_type = "cpu";
|
||||
reg = <0x00000001>;
|
||||
clock-frequency = <1600000000>;
|
||||
timebase-frequency = <33333333>;
|
||||
i-cache-size = <65536>;
|
||||
d-cache-size = <32768>;
|
||||
};
|
||||
};
|
||||
|
||||
test2 {
|
||||
subnodes = <0>;
|
||||
};
|
||||
};
|
||||
|
||||
@@ -0,0 +1,18 @@
|
||||
{
|
||||
allocation methods causes uninitialized data in alignment gap
|
||||
Memcheck:Param
|
||||
write(buf)
|
||||
fun:__write_nocancel
|
||||
fun:utilfdt_write_err
|
||||
fun:save_blob
|
||||
fun:main
|
||||
}
|
||||
{
|
||||
allocation methods causes uninitialized data in alignment gap
|
||||
Memcheck:Param
|
||||
write(buf)
|
||||
fun:__write_nocancel
|
||||
fun:utilfdt_write_err
|
||||
fun:save_blob
|
||||
fun:main
|
||||
}
|
||||
@@ -0,0 +1,43 @@
|
||||
/memreserve/ 0xdeadbeef00000000 0x100000;
|
||||
/memreserve/ 123456789 010000;
|
||||
|
||||
/ {
|
||||
compatible = "test_tree1";
|
||||
prop-int = <0xdeadbeef>;
|
||||
prop-int64 = /bits/ 64 <0xdeadbeef01abcdef>;
|
||||
prop-str = "hello world";
|
||||
#address-cells = <1>;
|
||||
#size-cells = <0>;
|
||||
|
||||
subnode@1 {
|
||||
compatible = "subnode1";
|
||||
reg = <1>;
|
||||
prop-int = [deadbeef];
|
||||
|
||||
subsubnode {
|
||||
compatible = "subsubnode1", "subsubnode";
|
||||
prop-int = <0xdeadbeef>;
|
||||
};
|
||||
|
||||
ss1 {
|
||||
};
|
||||
};
|
||||
|
||||
subnode@2 {
|
||||
reg = <2>;
|
||||
linux,phandle = <0x2000>;
|
||||
prop-int = <123456789>;
|
||||
#address-cells = <1>;
|
||||
#size-cells = <0>;
|
||||
|
||||
ssn0: subsubnode@0 {
|
||||
reg = <0>;
|
||||
phandle = <0x2001>;
|
||||
compatible = "subsubnode2", "subsubnode";
|
||||
prop-int = <0726746425>;
|
||||
};
|
||||
|
||||
ss2 {
|
||||
};
|
||||
};
|
||||
};
|
||||
@@ -0,0 +1,68 @@
|
||||
/dts-v1/;
|
||||
|
||||
/include/ "test_tree1_body.dtsi"
|
||||
|
||||
/ {
|
||||
nonexistant-property = <0xdeadbeef>;
|
||||
|
||||
nonexistant-subnode {
|
||||
prop-int = <1>;
|
||||
};
|
||||
|
||||
dellabel: deleted-by-label {
|
||||
prop-int = <1>;
|
||||
};
|
||||
|
||||
subnode@1 {
|
||||
delete-this-str = "deadbeef";
|
||||
};
|
||||
|
||||
};
|
||||
|
||||
/ {
|
||||
/delete-property/ nonexistant-property;
|
||||
|
||||
/delete-node/ nonexistant-subnode;
|
||||
|
||||
subnode@1 {
|
||||
/delete-property/ delete-this-str;
|
||||
};
|
||||
};
|
||||
|
||||
/delete-node/ &dellabel;
|
||||
|
||||
/ {
|
||||
/delete-property/ prop-str;
|
||||
};
|
||||
|
||||
/ {
|
||||
prop-str = "hello world";
|
||||
};
|
||||
|
||||
/ {
|
||||
subnode@1 {
|
||||
/delete-node/ ss1;
|
||||
};
|
||||
};
|
||||
|
||||
/ {
|
||||
subnode@1 {
|
||||
ss1 {
|
||||
};
|
||||
};
|
||||
};
|
||||
|
||||
/{
|
||||
duplabel1: foo1 = "bar";
|
||||
duplabel2: foo2 = "bar";
|
||||
};
|
||||
|
||||
/{
|
||||
duplabel1: baz1 = "qux";
|
||||
duplabel2: baz2 = "qux";
|
||||
};
|
||||
|
||||
/{
|
||||
/delete-property/ foo1;
|
||||
/delete-property/ baz2;
|
||||
};
|
||||
Reference in New Issue
Block a user