/external/dtc/tests/ |
D | references.dts | 8 linux,phandle = <0x2000>; 13 phandle = <0x1>; 26 /* Explicit phandle with implicit value */ 28 * a phandle (perhaps for reference by nodes that will be dynamically 29 * added) without explicitly allocating it a phandle. 33 linux,phandle = <&n5>; 34 phandle = <&n5>;
|
D | multilabel_merge.dts | 10 linux,phandle = <0x2000>; 15 phandle = <0x1>; 29 /* Explicit phandle with implicit value */ 31 * a phandle (perhaps for reference by nodes that will be dynamically 32 * added) without explicitly allocating it a phandle. 36 linux,phandle = <&n5>; 37 phandle = <&nz>; 53 p2: py: phandle = <0x1>;
|
D | multilabel.dts | 12 linux,phandle = <0x2000>; 17 p2: py: phandle = <0x1>; 31 /* Explicit phandle with implicit value */ 33 * a phandle (perhaps for reference by nodes that will be dynamically 34 * added) without explicitly allocating it a phandle. 38 linux,phandle = <&n5>; 39 phandle = <&nz>;
|
D | overlay_overlay_manual_fixups.dts | 42 /* Test that we add a new node (by phandle) */ 67 test-phandle = <0xffffffff /*&test*/>, <&local>; 75 test-several-phandle = <&local>, <&local>; 92 test-phandle = <4>; 97 test-several-phandle = <0 4>; 108 "/fragment@6/__overlay__:test-phandle:0",
|
D | get_phandle.c | 33 uint32_t phandle; in check_phandle() local 39 phandle = fdt_get_phandle(fdt, offset); in check_phandle() 40 if (phandle != checkhandle) in check_phandle() 42 path, phandle, checkhandle); in check_phandle()
|
D | node_offset_by_phandle.c | 31 static void check_search(void *fdt, uint32_t phandle, int target) in check_search() argument 35 offset = fdt_node_offset_by_phandle(fdt, phandle); in check_search() 39 "instead of %d", phandle, offset, target); in check_search()
|
D | overlay_overlay.dts | 40 /* Test that we add a new node (by phandle) */ 65 test-phandle = <&test>, <&local>; 73 test-several-phandle = <&local>, <&local>;
|
D | dup-phandle.dts | 5 linux,phandle = <1>; 8 linux,phandle = <1>;
|
D | overlay_base_manual_symbols.dts | 12 phandle = <&test>; /* Force phandle generation */
|
D | test_tree1_wrong1.dts | 28 linux,phandle = <0x2000>; 35 phandle = <0x2001>;
|
D | test_tree1_wrong2.dts | 28 linux,phandle = <0x2000>; 35 phandle = <0x2001>;
|
D | test_tree1_wrong3.dts | 28 linux,phandle = <0x2000>; 35 phandle = <0x2001>;
|
D | test_tree1_wrong8.dts | 28 linux,phandle = <0x2000>; 36 phandle = <0x2001>;
|
D | test_tree1_wrong5.dts | 29 linux,phandle = <0x2000>; 36 phandle = <0x2001>;
|
D | include1.dts | 18 linux,phandle = <0x2000>; 24 phandle = <0x2001>;
|
D | test_tree1_wrong4.dts | 29 linux,phandle = <0x2000>; 36 phandle = <0x2001>;
|
D | test_tree1_wrong9.dts | 30 linux,phandle = <0x2000>; 37 phandle = <0x2001>;
|
D | test_tree1_wrong7.dts | 29 linux,phandle = <0x2000>; 36 phandle = <0x2001>;
|
D | test_tree1_wrong6.dts | 30 linux,phandle = <0x2000>; 37 phandle = <0x2001>;
|
D | test_tree1.dts | 30 linux,phandle = <0x2000>; 37 phandle = <0x2001>;
|
/external/dtc/ |
D | checks.c | 406 cell_t phandle; in check_phandle_prop() local 436 phandle = propval_cell(prop); in check_phandle_prop() 438 if ((phandle == 0) || (phandle == -1)) { in check_phandle_prop() 440 node->fullpath, phandle, prop->name); in check_phandle_prop() 444 return phandle; in check_phandle_prop() 452 cell_t phandle, linux_phandle; in check_explicit_phandles() local 455 assert(!node->phandle); in check_explicit_phandles() 457 phandle = check_phandle_prop(c, dti, node, "phandle"); in check_explicit_phandles() 461 if (!phandle && !linux_phandle) in check_explicit_phandles() 465 if (linux_phandle && phandle && (phandle != linux_phandle)) in check_explicit_phandles() [all …]
|
D | livetree.c | 532 struct node *get_node_by_phandle(struct node *tree, cell_t phandle) in get_node_by_phandle() argument 536 assert((phandle != 0) && (phandle != -1)); in get_node_by_phandle() 538 if (tree->phandle == phandle) { in get_node_by_phandle() 545 node = get_node_by_phandle(child, phandle); in get_node_by_phandle() 565 static cell_t phandle = 1; /* FIXME: ick, static local */ in get_node_phandle() local 567 if ((node->phandle != 0) && (node->phandle != -1)) in get_node_phandle() 568 return node->phandle; in get_node_phandle() 570 while (get_node_by_phandle(root, phandle)) in get_node_phandle() 571 phandle++; in get_node_phandle() 573 node->phandle = phandle; in get_node_phandle() [all …]
|
/external/dtc/libfdt/ |
D | fdt_overlay.c | 54 uint32_t phandle; in overlay_get_target() local 59 phandle = overlay_get_target_phandle(fdto, fragment); in overlay_get_target() 60 if (phandle == (uint32_t)-1) in overlay_get_target() 63 if (phandle) in overlay_get_target() 64 return fdt_node_offset_by_phandle(fdt, phandle); in overlay_get_target() 357 uint32_t phandle; in overlay_fixup_one_phandle() local 374 phandle = fdt_get_phandle(fdt, symbol_off); in overlay_fixup_one_phandle() 375 if (!phandle) in overlay_fixup_one_phandle() 384 phandle_prop = cpu_to_fdt32(phandle); in overlay_fixup_one_phandle()
|
D | fdt_ro.c | 98 uint32_t phandle; in fdt_get_max_phandle() local 106 phandle = fdt_get_phandle(fdt, offset); in fdt_get_max_phandle() 107 if (phandle == (uint32_t)-1) in fdt_get_max_phandle() 110 if (phandle > max_phandle) in fdt_get_max_phandle() 111 max_phandle = phandle; in fdt_get_max_phandle() 525 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle) in fdt_node_offset_by_phandle() argument 529 if ((phandle == 0) || (phandle == -1)) in fdt_node_offset_by_phandle() 543 if (fdt_get_phandle(fdt, offset) == phandle) in fdt_node_offset_by_phandle()
|
/external/dtc/Documentation/ |
D | dt-object-internal.txt | 123 The basic unit of addressing in Device Tree is the phandle. Turns out it's 126 to phandle values. This is a valid assumption as long as the author uses 127 reference syntax and does not assign phandle values manually (which might 145 phandle = <0x00000001>; 150 phandle = <0x00000002>; 217 Note that the target's ocp label is undefined, so the phandle 220 the label lookup should store the runtime phandle value of the ocp node. 232 phandle value is located. 275 phandle = <0x00000001>; 307 the run time loader must apply an offset to each phandle in every dynamic [all …]
|