€• h      Œsphinx.addnodes”Œdocument”“”)”}”(Œ	rawsource”Œ ”Œchildren”]”(Œtranslations”ŒLanguagesNode”“”)”}”(hhh]”(h Œpending_xref”“”)”}”(hhh]”Œdocutils.nodes”ŒText”“”ŒChinese (Simplified)”…””}”Œparent”hsbaŒ
attributes”}”(Œids”]”Œclasses”]”Œnames”]”Œdupnames”]”Œbackrefs”]”Œ	refdomain”Œstd”Œreftype”Œdoc”Œ	reftarget”Œ*/translations/zh_CN/devicetree/of_unittest”Œmodname”NŒ	classname”NŒrefexplicit”ˆuŒtagname”hhhubh)”}”(hhh]”hŒChinese (Traditional)”…””}”hh2sbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ*/translations/zh_TW/devicetree/of_unittest”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒItalian”…””}”hhFsbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ*/translations/it_IT/devicetree/of_unittest”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒJapanese”…””}”hhZsbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ*/translations/ja_JP/devicetree/of_unittest”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒKorean”…””}”hhnsbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ*/translations/ko_KR/devicetree/of_unittest”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒSpanish”…””}”hh‚sbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ*/translations/sp_SP/devicetree/of_unittest”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubeh}”(h]”h ]”h"]”h$]”h&]”Œcurrent_language”ŒEnglish”uh1h
hhŒ	_document”hŒsource”NŒline”NubhŒcomment”“”)”}”(hŒ SPDX-License-Identifier: GPL-2.0”h]”hŒ SPDX-License-Identifier: GPL-2.0”…””}”hh£sbah}”(h]”h ]”h"]”h$]”h&]”Œ	xml:space”Œpreserve”uh1h¡hhhžhhŸŒD/var/lib/git/docbuild/linux/Documentation/devicetree/of_unittest.rst”h KubhŒsection”“”)”}”(hhh]”(hŒtitle”“”)”}”(hŒ!Open Firmware Devicetree Unittest”h]”hŒ!Open Firmware Devicetree Unittest”…””}”(hh»hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¹hh¶hžhhŸh³h KubhŒ	paragraph”“”)”}”(hŒ4Author: Gaurav Minocha <gaurav.minocha.os@gmail.com>”h]”(hŒAuthor: Gaurav Minocha <”…””}”(hhËhžhhŸNh NubhŒ	reference”“”)”}”(hŒgaurav.minocha.os@gmail.com”h]”hŒgaurav.minocha.os@gmail.com”…””}”(hhÕhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”Œ"mailto:gaurav.minocha.os@gmail.com”uh1hÓhhËubhŒ>”…””}”(hhËhžhhŸNh Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h Khh¶hžhubhµ)”}”(hhh]”(hº)”}”(hŒ1. Introduction”h]”hŒ1. Introduction”…””}”(hhòhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¹hhïhžhhŸh³h K
ubhÊ)”}”(hŒ This document explains how the test data required for executing OF unittest
is attached to the live tree dynamically, independent of the machine's
architecture.”h]”hŒ¢This document explains how the test data required for executing OF unittest
is attached to the live tree dynamically, independent of the machineâ€™s
architecture.”…””}”(hj   hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KhhïhžhubhÊ)”}”(hŒFIt is recommended to read the following documents before moving ahead.”h]”hŒFIt is recommended to read the following documents before moving ahead.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KhhïhžhubhŒenumerated_list”“”)”}”(hhh]”(hŒ	list_item”“”)”}”(hŒ(Documentation/devicetree/usage-model.rst”h]”hÊ)”}”(hj%  h]”hŒ(Documentation/devicetree/usage-model.rst”…””}”(hj'  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h Khj#  ubah}”(h]”h ]”h"]”h$]”h&]”uh1j!  hj  hžhhŸh³h Nubj"  )”}”(hŒ,http://www.devicetree.org/Device_Tree_Usage
”h]”hÊ)”}”(hŒ+http://www.devicetree.org/Device_Tree_Usage”h]”hÔ)”}”(hj@  h]”hŒ+http://www.devicetree.org/Device_Tree_Usage”…””}”(hjB  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”j@  uh1hÓhj>  ubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h Khj:  ubah}”(h]”h ]”h"]”h$]”h&]”uh1j!  hj  hžhhŸh³h Nubeh}”(h]”h ]”h"]”h$]”h&]”Œenumtype”Œarabic”Œprefix”Œ(”Œsuffix”Œ)”uh1j  hhïhžhhŸh³h KubhÊ)”}”(hX  OF Selftest has been designed to test the interface (include/linux/of.h)
provided to device driver developers to fetch the device information..etc.
from the unflattened device tree data structure. This interface is used by
most of the device drivers in various use cases.”h]”hX  OF Selftest has been designed to test the interface (include/linux/of.h)
provided to device driver developers to fetch the device information..etc.
from the unflattened device tree data structure. This interface is used by
most of the device drivers in various use cases.”…””}”(hjh  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h Khhïhžhubeh}”(h]”Œintroduction”ah ]”h"]”Œ1. introduction”ah$]”h&]”uh1h´hh¶hžhhŸh³h K
ubhµ)”}”(hhh]”(hº)”}”(hŒ2. Verbose Output (EXPECT)”h]”hŒ2. Verbose Output (EXPECT)”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¹hj~  hžhhŸh³h KubhÊ)”}”(hXu  If unittest detects a problem it will print a warning or error message to
the console.  Unittest also triggers warning and error messages from other
kernel code as a result of intentionally bad unittest data.  This has led
to confusion as to whether the triggered messages are an expected result
of a test or whether there is a real problem that is independent of unittest.”h]”hXu  If unittest detects a problem it will print a warning or error message to
the console.  Unittest also triggers warning and error messages from other
kernel code as a result of intentionally bad unittest data.  This has led
to confusion as to whether the triggered messages are an expected result
of a test or whether there is a real problem that is independent of unittest.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h Khj~  hžhubhÊ)”}”(hX  'EXPECT \ : text' (begin) and 'EXPECT / : text' (end) messages have been
added to unittest to report that a warning or error is expected.  The
begin is printed before triggering the warning or error, and the end is
printed after triggering the warning or error.”h]”hX  â€˜EXPECT   : textâ€™ (begin) and â€˜EXPECT / : textâ€™ (end) messages have been
added to unittest to report that a warning or error is expected.  The
begin is printed before triggering the warning or error, and the end is
printed after triggering the warning or error.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K$hj~  hžhubhÊ)”}”(hXR  The EXPECT messages result in very noisy console messages that are difficult
to read.  The script scripts/dtc/of_unittest_expect was created to filter
this verbosity and highlight mismatches between triggered warnings and
errors vs expected warnings and errors.  More information is available
from 'scripts/dtc/of_unittest_expect --help'.”h]”hXV  The EXPECT messages result in very noisy console messages that are difficult
to read.  The script scripts/dtc/of_unittest_expect was created to filter
this verbosity and highlight mismatches between triggered warnings and
errors vs expected warnings and errors.  More information is available
from â€˜scripts/dtc/of_unittest_expect --helpâ€™.”…””}”(hj«  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K)hj~  hžhubeh}”(h]”Œverbose-output-expect”ah ]”h"]”Œ2. verbose output (expect)”ah$]”h&]”uh1h´hh¶hžhhŸh³h Kubhµ)”}”(hhh]”(hº)”}”(hŒ3. Test-data”h]”hŒ3. Test-data”…””}”(hjÄ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¹hjÁ  hžhhŸh³h K1ubhÊ)”}”(hŒÅThe Device Tree Source file (drivers/of/unittest-data/testcases.dts) contains
the test data required for executing the unit tests automated in
drivers/of/unittest.c. See the content of the folder::”h]”hŒÄThe Device Tree Source file (drivers/of/unittest-data/testcases.dts) contains
the test data required for executing the unit tests automated in
drivers/of/unittest.c. See the content of the folder:”…””}”(hjÒ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K3hjÁ  hžhubhŒliteral_block”“”)”}”(hŒ%drivers/of/unittest-data/tests-*.dtsi”h]”hŒ%drivers/of/unittest-data/tests-*.dtsi”…””}”hjâ  sbah}”(h]”h ]”h"]”h$]”h&]”h±h²uh1jà  hŸh³h K7hjÁ  hžhubhÊ)”}”(hŒKfor the Device Tree Source Include files (.dtsi) included in testcases.dts.”h]”hŒKfor the Device Tree Source Include files (.dtsi) included in testcases.dts.”…””}”(hjð  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K9hjÁ  hžhubhÊ)”}”(hŒXWhen the kernel is build with CONFIG_OF_UNITTEST enabled, then the following make
rule::”h]”hŒWWhen the kernel is build with CONFIG_OF_UNITTEST enabled, then the following make
rule:”…””}”(hjþ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K;hjÁ  hžhubjá  )”}”(hŒD$(obj)/%.dtb: $(src)/%.dts FORCE
        $(call if_changed_dep, dtc)”h]”hŒD$(obj)/%.dtb: $(src)/%.dts FORCE
        $(call if_changed_dep, dtc)”…””}”hj  sbah}”(h]”h ]”h"]”h$]”h&]”h±h²uh1jà  hŸh³h K>hjÁ  hžhubhÊ)”}”(hŒxis used to compile the DT source file (testcases.dts) into a binary blob
(testcases.dtb), also referred as flattened DT.”h]”hŒxis used to compile the DT source file (testcases.dts) into a binary blob
(testcases.dtb), also referred as flattened DT.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KAhjÁ  hžhubhÊ)”}”(hŒmAfter that, using the following rule the binary blob above is wrapped as an
assembly file (testcases.dtb.S)::”h]”hŒlAfter that, using the following rule the binary blob above is wrapped as an
assembly file (testcases.dtb.S):”…””}”(hj(  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KDhjÁ  hžhubjá  )”}”(hŒ:$(obj)/%.dtb.S: $(obj)/%.dtb
        $(call cmd, dt_S_dtb)”h]”hŒ:$(obj)/%.dtb.S: $(obj)/%.dtb
        $(call cmd, dt_S_dtb)”…””}”hj6  sbah}”(h]”h ]”h"]”h$]”h&]”h±h²uh1jà  hŸh³h KGhjÁ  hžhubhÊ)”}”(hŒiThe assembly file is compiled into an object file (testcases.dtb.o), and is
linked into the kernel image.”h]”hŒiThe assembly file is compiled into an object file (testcases.dtb.o), and is
linked into the kernel image.”…””}”(hjD  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KJhjÁ  hžhubhµ)”}”(hhh]”(hº)”}”(hŒ3.1. Adding the test data”h]”hŒ3.1. Adding the test data”…””}”(hjU  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¹hjR  hžhhŸh³h KOubhÊ)”}”(hŒ#Un-flattened device tree structure:”h]”hŒ#Un-flattened device tree structure:”…””}”(hjc  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KQhjR  hžhubhÊ)”}”(hŒkUn-flattened device tree consists of connected device_node(s) in form of a tree
structure described below::”h]”hŒjUn-flattened device tree consists of connected device_node(s) in form of a tree
structure described below:”…””}”(hjq  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KShjR  hžhubjá  )”}”(hŒÅ// following struct members are used to construct the tree
struct device_node {
    ...
    struct  device_node *parent;
    struct  device_node *child;
    struct  device_node *sibling;
    ...
};”h]”hŒÅ// following struct members are used to construct the tree
struct device_node {
    ...
    struct  device_node *parent;
    struct  device_node *child;
    struct  device_node *sibling;
    ...
};”…””}”hj  sbah}”(h]”h ]”h"]”h$]”h&]”h±h²uh1jà  hŸh³h KVhjR  hžhubhÊ)”}”(hX¤  Figure 1, describes a generic structure of machine's un-flattened device tree
considering only child and sibling pointers. There exists another pointer,
``*parent``, that is used to traverse the tree in the reverse direction. So, at
a particular level the child node and all the sibling nodes will have a parent
pointer pointing to a common node (e.g. child1, sibling2, sibling3, sibling4's
parent points to root node)::”h]”(hŒ›Figure 1, describes a generic structure of machineâ€™s un-flattened device tree
considering only child and sibling pointers. There exists another pointer,
”…””}”(hj  hžhhŸNh NubhŒliteral”“”)”}”(hŒ``*parent``”h]”hŒ*parent”…””}”(hj—  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1j•  hj  ubhX  , that is used to traverse the tree in the reverse direction. So, at
a particular level the child node and all the sibling nodes will have a parent
pointer pointing to a common node (e.g. child1, sibling2, sibling3, sibling4â€™s
parent points to root node):”…””}”(hj  hžhhŸNh Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K_hjR  hžhubjá  )”}”(hX¢  root ('/')
|
child1 -> sibling2 -> sibling3 -> sibling4 -> null
|         |           |           |
|         |           |          null
|         |           |
|         |        child31 -> sibling32 -> null
|         |           |          |
|         |          null       null
|         |
|      child21 -> sibling22 -> sibling23 -> null
|         |          |            |
|        null       null         null
|
child11 -> sibling12 -> sibling13 -> sibling14 -> null
|           |           |            |
|           |           |           null
|           |           |
null        null       child131 -> null
                        |
                        null”h]”hX¢  root ('/')
|
child1 -> sibling2 -> sibling3 -> sibling4 -> null
|         |           |           |
|         |           |          null
|         |           |
|         |        child31 -> sibling32 -> null
|         |           |          |
|         |          null       null
|         |
|      child21 -> sibling22 -> sibling23 -> null
|         |          |            |
|        null       null         null
|
child11 -> sibling12 -> sibling13 -> sibling14 -> null
|           |           |            |
|           |           |           null
|           |           |
null        null       child131 -> null
                        |
                        null”…””}”hj¯  sbah}”(h]”h ]”h"]”h$]”h&]”h±h²uh1jà  hŸh³h KfhjR  hžhubhÊ)”}”(hŒ7Figure 1: Generic structure of un-flattened device tree”h]”hŒ7Figure 1: Generic structure of un-flattened device tree”…””}”(hj½  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K|hjR  hžhubhÊ)”}”(hX  Before executing OF unittest, it is required to attach the test data to
machine's device tree (if present). So, when selftest_data_add() is called,
at first it reads the flattened device tree data linked into the kernel image
via the following kernel symbols::”h]”hX  Before executing OF unittest, it is required to attach the test data to
machineâ€™s device tree (if present). So, when selftest_data_add() is called,
at first it reads the flattened device tree data linked into the kernel image
via the following kernel symbols:”…””}”(hjË  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KhjR  hžhubjá  )”}”(hŒ…__dtb_testcases_begin - address marking the start of test data blob
__dtb_testcases_end   - address marking the end of test data blob”h]”hŒ…__dtb_testcases_begin - address marking the start of test data blob
__dtb_testcases_end   - address marking the end of test data blob”…””}”hjÙ  sbah}”(h]”h ]”h"]”h$]”h&]”h±h²uh1jà  hŸh³h K„hjR  hžhubhÊ)”}”(hX  Secondly, it calls of_fdt_unflatten_tree() to unflatten the flattened
blob. And finally, if the machine's device tree (i.e live tree) is present,
then it attaches the unflattened test data tree to the live tree, else it
attaches itself as a live device tree.”h]”hX  Secondly, it calls of_fdt_unflatten_tree() to unflatten the flattened
blob. And finally, if the machineâ€™s device tree (i.e live tree) is present,
then it attaches the unflattened test data tree to the live tree, else it
attaches itself as a live device tree.”…””}”(hjç  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K‡hjR  hžhubhÊ)”}”(hŒÞattach_node_and_children() uses of_attach_node() to attach the nodes into the
live tree as explained below. To explain the same, the test data tree described
in Figure 2 is attached to the live tree described in Figure 1::”h]”hŒÝattach_node_and_children() uses of_attach_node() to attach the nodes into the
live tree as explained below. To explain the same, the test data tree described
in Figure 2 is attached to the live tree described in Figure 1:”…””}”(hjõ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KŒhjR  hžhubjá  )”}”(hŒÜroot ('/')
    |
testcase-data
    |
test-child0 -> test-sibling1 -> test-sibling2 -> test-sibling3 -> null
    |               |                |                |
test-child01      null             null             null”h]”hŒÜroot ('/')
    |
testcase-data
    |
test-child0 -> test-sibling1 -> test-sibling2 -> test-sibling3 -> null
    |               |                |                |
test-child01      null             null             null”…””}”hj  sbah}”(h]”h ]”h"]”h$]”h&]”h±h²uh1jà  hŸh³h KhjR  hžhubhÊ)”}”(hŒ=Figure 2: Example test data tree to be attached to live tree.”h]”hŒ=Figure 2: Example test data tree to be attached to live tree.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K™hjR  hžhubhÊ)”}”(hŒ»According to the scenario above, the live tree is already present so it isn't
required to attach the root('/') node. All other nodes are attached by calling
of_attach_node() on each node.”h]”hŒÁAccording to the scenario above, the live tree is already present so it isnâ€™t
required to attach the root(â€˜/â€™) node. All other nodes are attached by calling
of_attach_node() on each node.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K›hjR  hžhubhÊ)”}”(hXU  In the function of_attach_node(), the new node is attached as the child of the
given parent in live tree. But, if parent already has a child then the new node
replaces the current child and turns it into its sibling. So, when the testcase
data node is attached to the live tree above (Figure 1), the final structure is
as shown in Figure 3::”h]”hXT  In the function of_attach_node(), the new node is attached as the child of the
given parent in live tree. But, if parent already has a child then the new node
replaces the current child and turns it into its sibling. So, when the testcase
data node is attached to the live tree above (Figure 1), the final structure is
as shown in Figure 3:”…””}”(hj-  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KŸhjR  hžhubjá  )”}”(hX„  root ('/')
|
testcase-data -> child1 -> sibling2 -> sibling3 -> sibling4 -> null
|               |          |           |           |
(...)             |          |           |          null
                |          |         child31 -> sibling32 -> null
                |          |           |           |
                |          |          null        null
                |          |
                |        child21 -> sibling22 -> sibling23 -> null
                |          |           |            |
                |         null        null         null
                |
                child11 -> sibling12 -> sibling13 -> sibling14 -> null
                |          |            |            |
                null       null          |           null
                                        |
                                        child131 -> null
                                        |
                                        null
-----------------------------------------------------------------------

root ('/')
|
testcase-data -> child1 -> sibling2 -> sibling3 -> sibling4 -> null
|               |          |           |           |
|             (...)      (...)       (...)        null
|
test-sibling3 -> test-sibling2 -> test-sibling1 -> test-child0 -> null
|                |                   |                |
null             null                null         test-child01”h]”hX„  root ('/')
|
testcase-data -> child1 -> sibling2 -> sibling3 -> sibling4 -> null
|               |          |           |           |
(...)             |          |           |          null
                |          |         child31 -> sibling32 -> null
                |          |           |           |
                |          |          null        null
                |          |
                |        child21 -> sibling22 -> sibling23 -> null
                |          |           |            |
                |         null        null         null
                |
                child11 -> sibling12 -> sibling13 -> sibling14 -> null
                |          |            |            |
                null       null          |           null
                                        |
                                        child131 -> null
                                        |
                                        null
-----------------------------------------------------------------------

root ('/')
|
testcase-data -> child1 -> sibling2 -> sibling3 -> sibling4 -> null
|               |          |           |           |
|             (...)      (...)       (...)        null
|
test-sibling3 -> test-sibling2 -> test-sibling1 -> test-child0 -> null
|                |                   |                |
null             null                null         test-child01”…””}”hj;  sbah}”(h]”h ]”h"]”h$]”h&]”h±h²uh1jà  hŸh³h K¥hjR  hžhubhÊ)”}”(hŒGFigure 3: Live device tree structure after attaching the testcase-data.”h]”hŒGFigure 3: Live device tree structure after attaching the testcase-data.”…””}”(hjI  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KÆhjR  hžhubhÊ)”}”(hX3  Astute readers would have noticed that test-child0 node becomes the last
sibling compared to the earlier structure (Figure 2). After attaching first
test-child0 the test-sibling1 is attached that pushes the child node
(i.e. test-child0) to become a sibling and makes itself a child node,
as mentioned above.”h]”hX3  Astute readers would have noticed that test-child0 node becomes the last
sibling compared to the earlier structure (Figure 2). After attaching first
test-child0 the test-sibling1 is attached that pushes the child node
(i.e. test-child0) to become a sibling and makes itself a child node,
as mentioned above.”…””}”(hjW  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KÉhjR  hžhubhÊ)”}”(hŒøIf a duplicate node is found (i.e. if a node with same full_name property is
already present in the live tree), then the node isn't attached rather its
properties are updated to the live tree's node by calling the function
update_node_properties().”h]”hŒüIf a duplicate node is found (i.e. if a node with same full_name property is
already present in the live tree), then the node isnâ€™t attached rather its
properties are updated to the live treeâ€™s node by calling the function
update_node_properties().”…””}”(hje  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KÏhjR  hžhubeh}”(h]”Œadding-the-test-data”ah ]”h"]”Œ3.1. adding the test data”ah$]”h&]”uh1h´hjÁ  hžhhŸh³h KOubhµ)”}”(hhh]”(hº)”}”(hŒ3.2. Removing the test data”h]”hŒ3.2. Removing the test data”…””}”(hj~  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¹hj{  hžhhŸh³h KÖubhÊ)”}”(hXu  Once the test case execution is complete, selftest_data_remove is called in
order to remove the device nodes attached initially (first the leaf nodes are
detached and then moving up the parent nodes are removed, and eventually the
whole tree). selftest_data_remove() calls detach_node_and_children() that uses
of_detach_node() to detach the nodes from the live device tree.”h]”hXu  Once the test case execution is complete, selftest_data_remove is called in
order to remove the device nodes attached initially (first the leaf nodes are
detached and then moving up the parent nodes are removed, and eventually the
whole tree). selftest_data_remove() calls detach_node_and_children() that uses
of_detach_node() to detach the nodes from the live device tree.”…””}”(hjŒ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KØhj{  hžhubhÊ)”}”(hŒÅTo detach a node, of_detach_node() either updates the child pointer of given
node's parent to its sibling or attaches the previous sibling to the given
node's sibling, as appropriate. That is it :)”h]”hŒÉTo detach a node, of_detach_node() either updates the child pointer of given
nodeâ€™s parent to its sibling or attaches the previous sibling to the given
nodeâ€™s sibling, as appropriate. That is it :)”…””}”(hjš  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h KÞhj{  hžhubeh}”(h]”Œremoving-the-test-data”ah ]”h"]”Œ3.2. removing the test data”ah$]”h&]”uh1h´hjÁ  hžhhŸh³h KÖubeh}”(h]”Œ	test-data”ah ]”h"]”Œ3. test-data”ah$]”h&]”uh1h´hh¶hžhhŸh³h K1ubeh}”(h]”Œ!open-firmware-devicetree-unittest”ah ]”h"]”Œ!open firmware devicetree unittest”ah$]”h&]”uh1h´hhhžhhŸh³h Kubeh}”(h]”h ]”h"]”h$]”h&]”Œsource”h³uh1hŒcurrent_source”NŒcurrent_line”NŒsettings”Œdocutils.frontend”ŒValues”“”)”}”(h¹NŒ	generator”NŒ	datestamp”NŒsource_link”NŒ
source_url”NŒtoc_backlinks”Œentry”Œfootnote_backlinks”KŒsectnum_xform”KŒstrip_comments”NŒstrip_elements_with_classes”NŒstrip_classes”NŒreport_level”KŒ
halt_level”KŒexit_status_level”KŒdebug”NŒwarning_stream”NŒ	traceback”ˆŒinput_encoding”Œ	utf-8-sig”Œinput_encoding_error_handler”Œstrict”Œoutput_encoding”Œutf-8”Œoutput_encoding_error_handler”jã  Œerror_encoding”Œutf-8”Œerror_encoding_error_handler”Œbackslashreplace”Œlanguage_code”Œen”Œrecord_dependencies”NŒconfig”NŒ	id_prefix”hŒauto_id_prefix”Œid”Œdump_settings”NŒdump_internals”NŒdump_transforms”NŒdump_pseudo_xml”NŒexpose_internals”NŒstrict_visitor”NŒ_disable_config”NŒ_source”h³Œ_destination”NŒ_config_files”]”Œ7/var/lib/git/docbuild/linux/Documentation/docutils.conf”aŒfile_insertion_enabled”ˆŒraw_enabled”KŒline_length_limit”M'Œpep_references”NŒpep_base_url”Œhttps://peps.python.org/”Œpep_file_url_template”Œpep-%04d”Œrfc_references”NŒrfc_base_url”Œ&https://datatracker.ietf.org/doc/html/”Œ	tab_width”KŒtrim_footnote_reference_space”‰Œsyntax_highlight”Œlong”Œsmart_quotes”ˆŒsmartquotes_locales”]”Œcharacter_level_inline_markup”‰Œdoctitle_xform”‰Œdocinfo_xform”KŒsectsubtitle_xform”‰Œimage_loading”Œlink”Œembed_stylesheet”‰Œcloak_email_addresses”ˆŒsection_self_link”‰Œenv”NubŒreporter”NŒindirect_targets”]”Œsubstitution_defs”}”Œsubstitution_names”}”Œrefnames”}”Œrefids”}”Œnameids”}”(j½  jº  j{  jx  j¾  j»  jµ  j²  jx  ju  j­  jª  uŒ	nametypes”}”(j½  ‰j{  ‰j¾  ‰jµ  ‰jx  ‰j­  ‰uh}”(jº  h¶jx  hïj»  j~  j²  jÁ  ju  jR  jª  j{  uŒfootnote_refs”}”Œcitation_refs”}”Œautofootnotes”]”Œautofootnote_refs”]”Œsymbol_footnotes”]”Œsymbol_footnote_refs”]”Œ	footnotes”]”Œ	citations”]”Œautofootnote_start”KŒsymbol_footnote_start”K Œ
id_counter”Œcollections”ŒCounter”“”}”…”R”Œparse_messages”]”Œtransform_messages”]”Œtransformer”NŒinclude_log”]”Œ
decoration”Nhžhub.