| <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> |
| |
| <html lang="en"> |
| |
| <head> |
| <meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> |
| <title>LCOV - skiboot.info - include/device.h</title> |
| <link rel="stylesheet" type="text/css" href="../gcov.css"> |
| </head> |
| |
| <body> |
| |
| <table width="100%" border=0 cellspacing=0 cellpadding=0> |
| <tr><td class="title">LCOV - code coverage report</td></tr> |
| <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr> |
| |
| <tr> |
| <td width="100%"> |
| <table cellpadding=1 border=0 width="100%"> |
| <tr> |
| <td width="10%" class="headerItem">Current view:</td> |
| <td width="10%" class="headerValue"><a href="../index.html">top level</a> - <a href="index.html">include</a> - device.h<span style="font-size: 80%;"> (source / <a href="device.h.func-c.html">functions</a>)</span></td> |
| <td width="5%"></td> |
| <td width="5%"></td> |
| <td width="5%" class="headerCovTableHead">Coverage</td> |
| <td width="5%" class="headerCovTableHead" title="Covered + Uncovered code">Total</td> |
| <td width="5%" class="headerCovTableHead" title="Exercised code only">Hit</td> |
| </tr> |
| <tr> |
| <td class="headerItem">Test:</td> |
| <td class="headerValue">skiboot.info</td> |
| <td></td> |
| <td class="headerItem">Lines:</td> |
| <td class="headerCovTableEntryHi">100.0 %</td> |
| <td class="headerCovTableEntry">9</td> |
| <td class="headerCovTableEntry">9</td> |
| </tr> |
| <tr> |
| <td class="headerItem">Test Date:</td> |
| <td class="headerValue">2025-06-27 16:54:26</td> |
| <td></td> |
| <td class="headerItem">Functions:</td> |
| <td class="headerCovTableEntryHi">100.0 %</td> |
| <td class="headerCovTableEntry">4</td> |
| <td class="headerCovTableEntry">4</td> |
| </tr> |
| <tr> |
| <td></td> |
| <td></td> |
| <td></td> |
| <td class="headerItem">Branches:</td> |
| <td class="headerCovTableEntryHi">-</td> |
| <td class="headerCovTableEntry">0</td> |
| <td class="headerCovTableEntry">0</td> |
| </tr> |
| <tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr> |
| </table> |
| </td> |
| </tr> |
| |
| <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr> |
| </table> |
| |
| <table cellpadding=0 cellspacing=0 border=0> |
| <tr> |
| <td><br></td> |
| </tr> |
| <tr> |
| <td> |
| <pre class="sourceHeading"> Branch data Line data Source code</pre> |
| <pre class="source"> |
| <span id="L1"><span class="lineNum"> 1</span> : : // SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later</span> |
| <span id="L2"><span class="lineNum"> 2</span> : : /* Copyright 2013-2018 IBM Corp. */</span> |
| <span id="L3"><span class="lineNum"> 3</span> : : </span> |
| <span id="L4"><span class="lineNum"> 4</span> : : #ifndef __DEVICE_H</span> |
| <span id="L5"><span class="lineNum"> 5</span> : : #define __DEVICE_H</span> |
| <span id="L6"><span class="lineNum"> 6</span> : : #include <ccan/list/list.h></span> |
| <span id="L7"><span class="lineNum"> 7</span> : : #include <ccan/short_types/short_types.h></span> |
| <span id="L8"><span class="lineNum"> 8</span> : : #include <compiler.h></span> |
| <span id="L9"><span class="lineNum"> 9</span> : : </span> |
| <span id="L10"><span class="lineNum"> 10</span> : : /* Any property or node with this prefix will not be passed to the kernel. */</span> |
| <span id="L11"><span class="lineNum"> 11</span> : : #define DT_PRIVATE "skiboot,"</span> |
| <span id="L12"><span class="lineNum"> 12</span> : : </span> |
| <span id="L13"><span class="lineNum"> 13</span> : : /*</span> |
| <span id="L14"><span class="lineNum"> 14</span> : : * An in-memory representation of a node in the device tree.</span> |
| <span id="L15"><span class="lineNum"> 15</span> : : *</span> |
| <span id="L16"><span class="lineNum"> 16</span> : : * This is trivially flattened into an fdt.</span> |
| <span id="L17"><span class="lineNum"> 17</span> : : *</span> |
| <span id="L18"><span class="lineNum"> 18</span> : : * Note that the add_* routines will make a copy of the name if it's not</span> |
| <span id="L19"><span class="lineNum"> 19</span> : : * a read-only string (ie. usually a string literal).</span> |
| <span id="L20"><span class="lineNum"> 20</span> : : */</span> |
| <span id="L21"><span class="lineNum"> 21</span> : : struct dt_property {</span> |
| <span id="L22"><span class="lineNum"> 22</span> : : struct list_node list;</span> |
| <span id="L23"><span class="lineNum"> 23</span> : : const char *name;</span> |
| <span id="L24"><span class="lineNum"> 24</span> : : size_t len;</span> |
| <span id="L25"><span class="lineNum"> 25</span> : : char prop[/* len */];</span> |
| <span id="L26"><span class="lineNum"> 26</span> : : };</span> |
| <span id="L27"><span class="lineNum"> 27</span> : : </span> |
| <span id="L28"><span class="lineNum"> 28</span> : : struct dt_node {</span> |
| <span id="L29"><span class="lineNum"> 29</span> : : const char *name;</span> |
| <span id="L30"><span class="lineNum"> 30</span> : : struct list_node list;</span> |
| <span id="L31"><span class="lineNum"> 31</span> : : struct list_head properties;</span> |
| <span id="L32"><span class="lineNum"> 32</span> : : struct list_head children;</span> |
| <span id="L33"><span class="lineNum"> 33</span> : : struct dt_node *parent;</span> |
| <span id="L34"><span class="lineNum"> 34</span> : : u32 phandle;</span> |
| <span id="L35"><span class="lineNum"> 35</span> : : };</span> |
| <span id="L36"><span class="lineNum"> 36</span> : : </span> |
| <span id="L37"><span class="lineNum"> 37</span> : : /* This is shared with device_tree.c .. make it static when</span> |
| <span id="L38"><span class="lineNum"> 38</span> : : * the latter is gone (hopefully soon)</span> |
| <span id="L39"><span class="lineNum"> 39</span> : : */</span> |
| <span id="L40"><span class="lineNum"> 40</span> : : extern u32 last_phandle;</span> |
| <span id="L41"><span class="lineNum"> 41</span> : : </span> |
| <span id="L42"><span class="lineNum"> 42</span> : : extern struct dt_node *dt_root;</span> |
| <span id="L43"><span class="lineNum"> 43</span> : : extern struct dt_node *dt_chosen;</span> |
| <span id="L44"><span class="lineNum"> 44</span> : : </span> |
| <span id="L45"><span class="lineNum"> 45</span> : : /* Create a root node: ie. a parentless one. */</span> |
| <span id="L46"><span class="lineNum"> 46</span> : : struct dt_node *dt_new_root(const char *name);</span> |
| <span id="L47"><span class="lineNum"> 47</span> : : </span> |
| <span id="L48"><span class="lineNum"> 48</span> : : /* Graft a root node into this tree. */</span> |
| <span id="L49"><span class="lineNum"> 49</span> : : bool dt_attach_root(struct dt_node *parent, struct dt_node *root);</span> |
| <span id="L50"><span class="lineNum"> 50</span> : : </span> |
| <span id="L51"><span class="lineNum"> 51</span> : : /* Wrappers for last_phandle operations */</span> |
| <span id="L52"><span class="lineNum"> 52</span> :<span class="tlaGNC tlaBgGNC"> 1 : static inline u32 get_last_phandle(void)</span></span> |
| <span id="L53"><span class="lineNum"> 53</span> : : {</span> |
| <span id="L54"><span class="lineNum"> 54</span> :<span class="tlaGNC"> 1 : return last_phandle;</span></span> |
| <span id="L55"><span class="lineNum"> 55</span> : : }</span> |
| <span id="L56"><span class="lineNum"> 56</span> : : </span> |
| <span id="L57"><span class="lineNum"> 57</span> :<span class="tlaGNC"> 6 : static inline void set_last_phandle(u32 phandle)</span></span> |
| <span id="L58"><span class="lineNum"> 58</span> : : {</span> |
| <span id="L59"><span class="lineNum"> 59</span> :<span class="tlaGNC"> 6 : last_phandle = phandle;</span></span> |
| <span id="L60"><span class="lineNum"> 60</span> :<span class="tlaGNC"> 6 : }</span></span> |
| <span id="L61"><span class="lineNum"> 61</span> : : </span> |
| <span id="L62"><span class="lineNum"> 62</span> :<span class="tlaGNC"> 737 : static inline u32 new_phandle(void)</span></span> |
| <span id="L63"><span class="lineNum"> 63</span> : : {</span> |
| <span id="L64"><span class="lineNum"> 64</span> :<span class="tlaGNC"> 737 : return ++last_phandle;</span></span> |
| <span id="L65"><span class="lineNum"> 65</span> : : }</span> |
| <span id="L66"><span class="lineNum"> 66</span> : : </span> |
| <span id="L67"><span class="lineNum"> 67</span> : : /* Add a child node. */</span> |
| <span id="L68"><span class="lineNum"> 68</span> : : struct dt_node *dt_new(struct dt_node *parent, const char *name);</span> |
| <span id="L69"><span class="lineNum"> 69</span> : : struct dt_node *dt_new_addr(struct dt_node *parent, const char *name,</span> |
| <span id="L70"><span class="lineNum"> 70</span> : : uint64_t unit_addr);</span> |
| <span id="L71"><span class="lineNum"> 71</span> : : struct dt_node *dt_new_2addr(struct dt_node *parent, const char *name,</span> |
| <span id="L72"><span class="lineNum"> 72</span> : : uint64_t unit_addr0, uint64_t unit_addr1);</span> |
| <span id="L73"><span class="lineNum"> 73</span> : : struct dt_node *dt_new_check(struct dt_node *parent, const char *name);</span> |
| <span id="L74"><span class="lineNum"> 74</span> : : </span> |
| <span id="L75"><span class="lineNum"> 75</span> : : /* Copy node to new parent, including properties and subnodes */</span> |
| <span id="L76"><span class="lineNum"> 76</span> : : struct dt_node *dt_copy(struct dt_node *node, struct dt_node *parent);</span> |
| <span id="L77"><span class="lineNum"> 77</span> : : </span> |
| <span id="L78"><span class="lineNum"> 78</span> : : /* Add a property node, various forms. */</span> |
| <span id="L79"><span class="lineNum"> 79</span> : : struct dt_property *dt_add_property(struct dt_node *node,</span> |
| <span id="L80"><span class="lineNum"> 80</span> : : const char *name,</span> |
| <span id="L81"><span class="lineNum"> 81</span> : : const void *val, size_t size);</span> |
| <span id="L82"><span class="lineNum"> 82</span> : : struct dt_property *dt_add_property_string(struct dt_node *node,</span> |
| <span id="L83"><span class="lineNum"> 83</span> : : const char *name,</span> |
| <span id="L84"><span class="lineNum"> 84</span> : : const char *value);</span> |
| <span id="L85"><span class="lineNum"> 85</span> : : struct dt_property *dt_add_property_nstr(struct dt_node *node,</span> |
| <span id="L86"><span class="lineNum"> 86</span> : : const char *name,</span> |
| <span id="L87"><span class="lineNum"> 87</span> : : const char *value, unsigned int vlen);</span> |
| <span id="L88"><span class="lineNum"> 88</span> : : </span> |
| <span id="L89"><span class="lineNum"> 89</span> : : /* Given out enough GCC extensions, we will achieve enlightenment! */</span> |
| <span id="L90"><span class="lineNum"> 90</span> : : #define dt_add_property_strings(node, name, ...) \</span> |
| <span id="L91"><span class="lineNum"> 91</span> : : __dt_add_property_strings((node), ((name)), \</span> |
| <span id="L92"><span class="lineNum"> 92</span> : : sizeof((const char *[]) { __VA_ARGS__ })/sizeof(const char *), \</span> |
| <span id="L93"><span class="lineNum"> 93</span> : : __VA_ARGS__)</span> |
| <span id="L94"><span class="lineNum"> 94</span> : : </span> |
| <span id="L95"><span class="lineNum"> 95</span> : : struct dt_property *__dt_add_property_strings(struct dt_node *node,</span> |
| <span id="L96"><span class="lineNum"> 96</span> : : const char *name,</span> |
| <span id="L97"><span class="lineNum"> 97</span> : : int count, ...);</span> |
| <span id="L98"><span class="lineNum"> 98</span> : : </span> |
| <span id="L99"><span class="lineNum"> 99</span> : : /* Given out enough GCC extensions, we will achieve enlightenment! */</span> |
| <span id="L100"><span class="lineNum"> 100</span> : : #define dt_add_property_cells(node, name, ...) \</span> |
| <span id="L101"><span class="lineNum"> 101</span> : : __dt_add_property_cells((node), ((name)), \</span> |
| <span id="L102"><span class="lineNum"> 102</span> : : sizeof((u32[]) { __VA_ARGS__ })/sizeof(u32), \</span> |
| <span id="L103"><span class="lineNum"> 103</span> : : __VA_ARGS__)</span> |
| <span id="L104"><span class="lineNum"> 104</span> : : </span> |
| <span id="L105"><span class="lineNum"> 105</span> : : struct dt_property *__dt_add_property_cells(struct dt_node *node,</span> |
| <span id="L106"><span class="lineNum"> 106</span> : : const char *name,</span> |
| <span id="L107"><span class="lineNum"> 107</span> : : int count, ...);</span> |
| <span id="L108"><span class="lineNum"> 108</span> : : </span> |
| <span id="L109"><span class="lineNum"> 109</span> : : #define dt_add_property_u64s(node, name, ...) \</span> |
| <span id="L110"><span class="lineNum"> 110</span> : : __dt_add_property_u64s((node), ((name)), \</span> |
| <span id="L111"><span class="lineNum"> 111</span> : : sizeof((u64[]) { __VA_ARGS__ })/sizeof(u64), \</span> |
| <span id="L112"><span class="lineNum"> 112</span> : : __VA_ARGS__)</span> |
| <span id="L113"><span class="lineNum"> 113</span> : : </span> |
| <span id="L114"><span class="lineNum"> 114</span> : : struct dt_property *__dt_add_property_u64s(struct dt_node *node,</span> |
| <span id="L115"><span class="lineNum"> 115</span> : : const char *name,</span> |
| <span id="L116"><span class="lineNum"> 116</span> : : int count, ...);</span> |
| <span id="L117"><span class="lineNum"> 117</span> : : </span> |
| <span id="L118"><span class="lineNum"> 118</span> :<span class="tlaGNC"> 14 : static inline struct dt_property *dt_add_property_u64(struct dt_node *node,</span></span> |
| <span id="L119"><span class="lineNum"> 119</span> : : const char *name, u64 val)</span> |
| <span id="L120"><span class="lineNum"> 120</span> : : {</span> |
| <span id="L121"><span class="lineNum"> 121</span> :<span class="tlaGNC"> 14 : return dt_add_property_cells(node, name, (u32)(val >> 32),</span></span> |
| <span id="L122"><span class="lineNum"> 122</span> : : (u32)(val & 0xffffffffUL));</span> |
| <span id="L123"><span class="lineNum"> 123</span> : : }</span> |
| <span id="L124"><span class="lineNum"> 124</span> : : </span> |
| <span id="L125"><span class="lineNum"> 125</span> : : void dt_del_property(struct dt_node *node, struct dt_property *prop);</span> |
| <span id="L126"><span class="lineNum"> 126</span> : : </span> |
| <span id="L127"><span class="lineNum"> 127</span> : : void dt_check_del_prop(struct dt_node *node, const char *name);</span> |
| <span id="L128"><span class="lineNum"> 128</span> : : </span> |
| <span id="L129"><span class="lineNum"> 129</span> : : /* Warning: moves *prop! */</span> |
| <span id="L130"><span class="lineNum"> 130</span> : : void dt_resize_property(struct dt_property **prop, size_t len);</span> |
| <span id="L131"><span class="lineNum"> 131</span> : : </span> |
| <span id="L132"><span class="lineNum"> 132</span> : : void dt_property_set_cell(struct dt_property *prop, u32 index, u32 val);</span> |
| <span id="L133"><span class="lineNum"> 133</span> : : u32 dt_property_get_cell(const struct dt_property *prop, u32 index);</span> |
| <span id="L134"><span class="lineNum"> 134</span> : : u64 dt_property_get_u64(const struct dt_property *prop, u32 index);</span> |
| <span id="L135"><span class="lineNum"> 135</span> : : </span> |
| <span id="L136"><span class="lineNum"> 136</span> : : /* First child of this node. */</span> |
| <span id="L137"><span class="lineNum"> 137</span> : : struct dt_node *dt_first(const struct dt_node *root);</span> |
| <span id="L138"><span class="lineNum"> 138</span> : : </span> |
| <span id="L139"><span class="lineNum"> 139</span> : : /* Return next node, or NULL. */</span> |
| <span id="L140"><span class="lineNum"> 140</span> : : struct dt_node *dt_next(const struct dt_node *root, const struct dt_node *prev);</span> |
| <span id="L141"><span class="lineNum"> 141</span> : : </span> |
| <span id="L142"><span class="lineNum"> 142</span> : : /* Iterate nodes */</span> |
| <span id="L143"><span class="lineNum"> 143</span> : : #define dt_for_each_node(root, node) \</span> |
| <span id="L144"><span class="lineNum"> 144</span> : : for (node = dt_first(root); node; node = dt_next(root, node))</span> |
| <span id="L145"><span class="lineNum"> 145</span> : : </span> |
| <span id="L146"><span class="lineNum"> 146</span> : : #define dt_for_each_child(parent, node) \</span> |
| <span id="L147"><span class="lineNum"> 147</span> : : list_for_each(&parent->children, node, list)</span> |
| <span id="L148"><span class="lineNum"> 148</span> : : </span> |
| <span id="L149"><span class="lineNum"> 149</span> : : /* Find a string in a string list */</span> |
| <span id="L150"><span class="lineNum"> 150</span> : : bool dt_prop_find_string(const struct dt_property *p, const char *s);</span> |
| <span id="L151"><span class="lineNum"> 151</span> : : </span> |
| <span id="L152"><span class="lineNum"> 152</span> : : /* Check a compatible property */</span> |
| <span id="L153"><span class="lineNum"> 153</span> : : bool dt_node_is_compatible(const struct dt_node *node, const char *compat);</span> |
| <span id="L154"><span class="lineNum"> 154</span> : : </span> |
| <span id="L155"><span class="lineNum"> 155</span> : : /* Find a node based on compatible property */</span> |
| <span id="L156"><span class="lineNum"> 156</span> : : struct dt_node *dt_find_compatible_node(struct dt_node *root,</span> |
| <span id="L157"><span class="lineNum"> 157</span> : : struct dt_node *prev,</span> |
| <span id="L158"><span class="lineNum"> 158</span> : : const char *compat);</span> |
| <span id="L159"><span class="lineNum"> 159</span> : : </span> |
| <span id="L160"><span class="lineNum"> 160</span> : : #define dt_for_each_compatible(root, node, compat) \</span> |
| <span id="L161"><span class="lineNum"> 161</span> : : for (node = NULL; \</span> |
| <span id="L162"><span class="lineNum"> 162</span> : : (node = dt_find_compatible_node(root, node, compat)) != NULL;)</span> |
| <span id="L163"><span class="lineNum"> 163</span> : : </span> |
| <span id="L164"><span class="lineNum"> 164</span> : : struct dt_node *dt_find_compatible_node_on_chip(struct dt_node *root,</span> |
| <span id="L165"><span class="lineNum"> 165</span> : : struct dt_node *prev,</span> |
| <span id="L166"><span class="lineNum"> 166</span> : : const char *compat,</span> |
| <span id="L167"><span class="lineNum"> 167</span> : : uint32_t chip_id);</span> |
| <span id="L168"><span class="lineNum"> 168</span> : : </span> |
| <span id="L169"><span class="lineNum"> 169</span> : : #define dt_for_each_compatible_on_chip(root, node, compat, chip_id) \</span> |
| <span id="L170"><span class="lineNum"> 170</span> : : for (node = NULL; \</span> |
| <span id="L171"><span class="lineNum"> 171</span> : : (node = dt_find_compatible_node_on_chip(root, node,\</span> |
| <span id="L172"><span class="lineNum"> 172</span> : : compat, chip_id)) != NULL;)</span> |
| <span id="L173"><span class="lineNum"> 173</span> : : /* Check status property */</span> |
| <span id="L174"><span class="lineNum"> 174</span> : : bool dt_node_is_enabled(struct dt_node *node);</span> |
| <span id="L175"><span class="lineNum"> 175</span> : : </span> |
| <span id="L176"><span class="lineNum"> 176</span> : : /* Build the full path for a node. Return a new block of memory, caller</span> |
| <span id="L177"><span class="lineNum"> 177</span> : : * shall free() it</span> |
| <span id="L178"><span class="lineNum"> 178</span> : : */</span> |
| <span id="L179"><span class="lineNum"> 179</span> : : char *dt_get_path(const struct dt_node *node);</span> |
| <span id="L180"><span class="lineNum"> 180</span> : : </span> |
| <span id="L181"><span class="lineNum"> 181</span> : : /* Find a node by path */</span> |
| <span id="L182"><span class="lineNum"> 182</span> : : struct dt_node *dt_find_by_path(struct dt_node *root, const char *path);</span> |
| <span id="L183"><span class="lineNum"> 183</span> : : </span> |
| <span id="L184"><span class="lineNum"> 184</span> : : /* Find a child node by name */</span> |
| <span id="L185"><span class="lineNum"> 185</span> : : struct dt_node *dt_find_by_name(struct dt_node *root, const char *name);</span> |
| <span id="L186"><span class="lineNum"> 186</span> : : </span> |
| <span id="L187"><span class="lineNum"> 187</span> : : /* Find a child node by name and substring */</span> |
| <span id="L188"><span class="lineNum"> 188</span> : : struct dt_node *dt_find_by_name_before_addr(struct dt_node *root, const char *name);</span> |
| <span id="L189"><span class="lineNum"> 189</span> : : </span> |
| <span id="L190"><span class="lineNum"> 190</span> : : /* Find a node by phandle */</span> |
| <span id="L191"><span class="lineNum"> 191</span> : : struct dt_node *dt_find_by_phandle(struct dt_node *root, u32 phandle);</span> |
| <span id="L192"><span class="lineNum"> 192</span> : : </span> |
| <span id="L193"><span class="lineNum"> 193</span> : : /* Find a property by name. */</span> |
| <span id="L194"><span class="lineNum"> 194</span> : : const struct dt_property *dt_find_property(const struct dt_node *node,\</span> |
| <span id="L195"><span class="lineNum"> 195</span> : : const char *name);</span> |
| <span id="L196"><span class="lineNum"> 196</span> : : const struct dt_property *dt_require_property(const struct dt_node *node,</span> |
| <span id="L197"><span class="lineNum"> 197</span> : : const char *name, int wanted_len);</span> |
| <span id="L198"><span class="lineNum"> 198</span> : : </span> |
| <span id="L199"><span class="lineNum"> 199</span> : : /* non-const variant */</span> |
| <span id="L200"><span class="lineNum"> 200</span> : : struct dt_property *__dt_find_property(struct dt_node *node, const char *name);</span> |
| <span id="L201"><span class="lineNum"> 201</span> : : </span> |
| <span id="L202"><span class="lineNum"> 202</span> : : /* Find a property by name, check if it's the same as val. */</span> |
| <span id="L203"><span class="lineNum"> 203</span> : : bool dt_has_node_property(const struct dt_node *node,</span> |
| <span id="L204"><span class="lineNum"> 204</span> : : const char *name, const char *val);</span> |
| <span id="L205"><span class="lineNum"> 205</span> : : </span> |
| <span id="L206"><span class="lineNum"> 206</span> : : /* Free a node (and any children). */</span> |
| <span id="L207"><span class="lineNum"> 207</span> : : void dt_free(struct dt_node *node);</span> |
| <span id="L208"><span class="lineNum"> 208</span> : : </span> |
| <span id="L209"><span class="lineNum"> 209</span> : : /* Parse an initial fdt */</span> |
| <span id="L210"><span class="lineNum"> 210</span> : : void dt_expand(const void *fdt);</span> |
| <span id="L211"><span class="lineNum"> 211</span> : : int dt_expand_node(struct dt_node *node, const void *fdt, int fdt_node) __warn_unused_result;</span> |
| <span id="L212"><span class="lineNum"> 212</span> : : </span> |
| <span id="L213"><span class="lineNum"> 213</span> : : /* Simplified accessors */</span> |
| <span id="L214"><span class="lineNum"> 214</span> : : u64 dt_prop_get_u64(const struct dt_node *node, const char *prop);</span> |
| <span id="L215"><span class="lineNum"> 215</span> : : u64 dt_prop_get_u64_def(const struct dt_node *node, const char *prop, u64 def);</span> |
| <span id="L216"><span class="lineNum"> 216</span> : : u32 dt_prop_get_u32(const struct dt_node *node, const char *prop);</span> |
| <span id="L217"><span class="lineNum"> 217</span> : : u32 dt_prop_get_u32_def(const struct dt_node *node, const char *prop, u32 def);</span> |
| <span id="L218"><span class="lineNum"> 218</span> : : const void *dt_prop_get(const struct dt_node *node, const char *prop);</span> |
| <span id="L219"><span class="lineNum"> 219</span> : : const void *dt_prop_get_def(const struct dt_node *node, const char *prop,</span> |
| <span id="L220"><span class="lineNum"> 220</span> : : void *def);</span> |
| <span id="L221"><span class="lineNum"> 221</span> : : const void *dt_prop_get_def_size(const struct dt_node *node, const char *prop,</span> |
| <span id="L222"><span class="lineNum"> 222</span> : : void *def, size_t *len);</span> |
| <span id="L223"><span class="lineNum"> 223</span> : : u32 dt_prop_get_cell(const struct dt_node *node, const char *prop, u32 cell);</span> |
| <span id="L224"><span class="lineNum"> 224</span> : : u32 dt_prop_get_cell_def(const struct dt_node *node, const char *prop, u32 cell, u32 def);</span> |
| <span id="L225"><span class="lineNum"> 225</span> : : </span> |
| <span id="L226"><span class="lineNum"> 226</span> : : /* Parsing helpers */</span> |
| <span id="L227"><span class="lineNum"> 227</span> : : u32 dt_n_address_cells(const struct dt_node *node);</span> |
| <span id="L228"><span class="lineNum"> 228</span> : : u32 dt_n_size_cells(const struct dt_node *node);</span> |
| <span id="L229"><span class="lineNum"> 229</span> : : u64 dt_get_number(const void *pdata, unsigned int cells);</span> |
| <span id="L230"><span class="lineNum"> 230</span> : : </span> |
| <span id="L231"><span class="lineNum"> 231</span> : : /* Find an ibm,chip-id property in this node; if not found, walk up the parent</span> |
| <span id="L232"><span class="lineNum"> 232</span> : : * nodes. */</span> |
| <span id="L233"><span class="lineNum"> 233</span> : : u32 dt_get_chip_id(const struct dt_node *node);</span> |
| <span id="L234"><span class="lineNum"> 234</span> : : </span> |
| <span id="L235"><span class="lineNum"> 235</span> : : /* Same as dt_get_chip_id except Returns -1 if no chip-id property exists. */</span> |
| <span id="L236"><span class="lineNum"> 236</span> : : u32 __dt_get_chip_id(const struct dt_node *node);</span> |
| <span id="L237"><span class="lineNum"> 237</span> : : </span> |
| <span id="L238"><span class="lineNum"> 238</span> : : /* Address accessors ("reg" properties parsing). No translation,</span> |
| <span id="L239"><span class="lineNum"> 239</span> : : * only support "simple" address forms (1 or 2 cells). Asserts</span> |
| <span id="L240"><span class="lineNum"> 240</span> : : * if address doesn't exist</span> |
| <span id="L241"><span class="lineNum"> 241</span> : : */</span> |
| <span id="L242"><span class="lineNum"> 242</span> : : u64 dt_get_address(const struct dt_node *node, unsigned int index,</span> |
| <span id="L243"><span class="lineNum"> 243</span> : : u64 *out_size);</span> |
| <span id="L244"><span class="lineNum"> 244</span> : : </span> |
| <span id="L245"><span class="lineNum"> 245</span> : : /* Count "reg" property entries */</span> |
| <span id="L246"><span class="lineNum"> 246</span> : : unsigned int dt_count_addresses(const struct dt_node *node);</span> |
| <span id="L247"><span class="lineNum"> 247</span> : : </span> |
| <span id="L248"><span class="lineNum"> 248</span> : : /* Address translation</span> |
| <span id="L249"><span class="lineNum"> 249</span> : : *</span> |
| <span id="L250"><span class="lineNum"> 250</span> : : * WARNING: Current implementation is simplified and will not</span> |
| <span id="L251"><span class="lineNum"> 251</span> : : * handle complex address formats with address space indicators</span> |
| <span id="L252"><span class="lineNum"> 252</span> : : * nor will it handle "ranges" translations yet... (XX TODO)</span> |
| <span id="L253"><span class="lineNum"> 253</span> : : */</span> |
| <span id="L254"><span class="lineNum"> 254</span> : : u64 dt_translate_address(const struct dt_node *node, unsigned int index,</span> |
| <span id="L255"><span class="lineNum"> 255</span> : : u64 *out_size);</span> |
| <span id="L256"><span class="lineNum"> 256</span> : : </span> |
| <span id="L257"><span class="lineNum"> 257</span> : : /* compare function used to sort child nodes by name when added to the</span> |
| <span id="L258"><span class="lineNum"> 258</span> : : * tree. This is mainly here for testing.</span> |
| <span id="L259"><span class="lineNum"> 259</span> : : */</span> |
| <span id="L260"><span class="lineNum"> 260</span> : : int dt_cmp_subnodes(const struct dt_node *a, const struct dt_node *b);</span> |
| <span id="L261"><span class="lineNum"> 261</span> : : </span> |
| <span id="L262"><span class="lineNum"> 262</span> : : struct dt_node *__dt_find_by_name_addr(struct dt_node *parent, const char *name,</span> |
| <span id="L263"><span class="lineNum"> 263</span> : : const char *addr);</span> |
| <span id="L264"><span class="lineNum"> 264</span> : : struct dt_node *dt_find_by_name_addr(struct dt_node *parent, const char *name,</span> |
| <span id="L265"><span class="lineNum"> 265</span> : : uint64_t addr);</span> |
| <span id="L266"><span class="lineNum"> 266</span> : : </span> |
| <span id="L267"><span class="lineNum"> 267</span> : : /* phandle fixup helper */</span> |
| <span id="L268"><span class="lineNum"> 268</span> : : void dt_adjust_subtree_phandle(struct dt_node *subtree,</span> |
| <span id="L269"><span class="lineNum"> 269</span> : : const char** (get_properties_to_fix)(struct dt_node *n));</span> |
| <span id="L270"><span class="lineNum"> 270</span> : : </span> |
| <span id="L271"><span class="lineNum"> 271</span> : : #endif /* __DEVICE_H */</span> |
| </pre> |
| </td> |
| </tr> |
| </table> |
| <br> |
| |
| <table width="100%" border=0 cellspacing=0 cellpadding=0> |
| <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr> |
| <tr><td class="versionInfo">Generated by: <a href="https://github.com//linux-test-project/lcov" target="_parent">LCOV version 2.0-1</a></td></tr> |
| </table> |
| <br> |
| |
| </body> |
| </html> |
