| <!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 - core/device.c</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">core</a> - device.c<span style="font-size: 80%;"> (source / <a href="device.c.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="headerCovTableEntryMed">84.9 %</td> |
| <td class="headerCovTableEntry">568</td> |
| <td class="headerCovTableEntry">482</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="headerCovTableEntryMed">89.7 %</td> |
| <td class="headerCovTableEntry">68</td> |
| <td class="headerCovTableEntry">61</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> : : /*</span> |
| <span id="L3"><span class="lineNum"> 3</span> : : * Manipulate the device tree</span> |
| <span id="L4"><span class="lineNum"> 4</span> : : *</span> |
| <span id="L5"><span class="lineNum"> 5</span> : : * Copyright 2013-2019 IBM Corp.</span> |
| <span id="L6"><span class="lineNum"> 6</span> : : */</span> |
| <span id="L7"><span class="lineNum"> 7</span> : : </span> |
| <span id="L8"><span class="lineNum"> 8</span> : : #include <stdarg.h></span> |
| <span id="L9"><span class="lineNum"> 9</span> : : #include <device.h></span> |
| <span id="L10"><span class="lineNum"> 10</span> : : #include <stdlib.h></span> |
| <span id="L11"><span class="lineNum"> 11</span> : : #include <skiboot.h></span> |
| <span id="L12"><span class="lineNum"> 12</span> : : #include <libfdt/libfdt.h></span> |
| <span id="L13"><span class="lineNum"> 13</span> : : #include <libfdt/libfdt_internal.h></span> |
| <span id="L14"><span class="lineNum"> 14</span> : : #include <ccan/str/str.h></span> |
| <span id="L15"><span class="lineNum"> 15</span> : : #include <ccan/endian/endian.h></span> |
| <span id="L16"><span class="lineNum"> 16</span> : : #include <inttypes.h></span> |
| <span id="L17"><span class="lineNum"> 17</span> : : </span> |
| <span id="L18"><span class="lineNum"> 18</span> : : /* Used to give unique handles. */</span> |
| <span id="L19"><span class="lineNum"> 19</span> : : u32 last_phandle = 0;</span> |
| <span id="L20"><span class="lineNum"> 20</span> : : </span> |
| <span id="L21"><span class="lineNum"> 21</span> : : struct dt_node *dt_root;</span> |
| <span id="L22"><span class="lineNum"> 22</span> : : struct dt_node *dt_chosen;</span> |
| <span id="L23"><span class="lineNum"> 23</span> : : </span> |
| <span id="L24"><span class="lineNum"> 24</span> :<span class="tlaGNC tlaBgGNC"> 3472 : static const char *take_name(const char *name)</span></span> |
| <span id="L25"><span class="lineNum"> 25</span> : : {</span> |
| <span id="L26"><span class="lineNum"> 26</span> :<span class="tlaGNC"> 3472 : if (!is_rodata(name) && !(name = strdup(name))) {</span></span> |
| <span id="L27"><span class="lineNum"> 27</span> :<span class="tlaUNC tlaBgUNC"> 0 : prerror("Failed to allocate copy of name");</span></span> |
| <span id="L28"><span class="lineNum"> 28</span> :<span class="tlaUNC"> 0 : abort();</span></span> |
| <span id="L29"><span class="lineNum"> 29</span> : : }</span> |
| <span id="L30"><span class="lineNum"> 30</span> :<span class="tlaGNC tlaBgGNC"> 3472 : return name;</span></span> |
| <span id="L31"><span class="lineNum"> 31</span> : : }</span> |
| <span id="L32"><span class="lineNum"> 32</span> : : </span> |
| <span id="L33"><span class="lineNum"> 33</span> :<span class="tlaGNC"> 3353 : static void free_name(const char *name)</span></span> |
| <span id="L34"><span class="lineNum"> 34</span> : : {</span> |
| <span id="L35"><span class="lineNum"> 35</span> :<span class="tlaGNC"> 3295 : if (!is_rodata(name))</span></span> |
| <span id="L36"><span class="lineNum"> 36</span> :<span class="tlaGNC"> 3352 : free((char *)name);</span></span> |
| <span id="L37"><span class="lineNum"> 37</span> :<span class="tlaGNC"> 3353 : }</span></span> |
| <span id="L38"><span class="lineNum"> 38</span> : : </span> |
| <span id="L39"><span class="lineNum"> 39</span> :<span class="tlaGNC"> 736 : static struct dt_node *new_node(const char *name)</span></span> |
| <span id="L40"><span class="lineNum"> 40</span> : : {</span> |
| <span id="L41"><span class="lineNum"> 41</span> :<span class="tlaGNC"> 736 : struct dt_node *node = malloc(sizeof *node);</span></span> |
| <span id="L42"><span class="lineNum"> 42</span> :<span class="tlaGNC"> 736 : if (!node) {</span></span> |
| <span id="L43"><span class="lineNum"> 43</span> :<span class="tlaUNC tlaBgUNC"> 0 : prerror("Failed to allocate node\n");</span></span> |
| <span id="L44"><span class="lineNum"> 44</span> :<span class="tlaUNC"> 0 : abort();</span></span> |
| <span id="L45"><span class="lineNum"> 45</span> : : }</span> |
| <span id="L46"><span class="lineNum"> 46</span> : : </span> |
| <span id="L47"><span class="lineNum"> 47</span> :<span class="tlaGNC tlaBgGNC"> 736 : node->name = take_name(name);</span></span> |
| <span id="L48"><span class="lineNum"> 48</span> :<span class="tlaGNC"> 736 : node->parent = NULL;</span></span> |
| <span id="L49"><span class="lineNum"> 49</span> :<span class="tlaGNC"> 736 : list_head_init(&node->properties);</span></span> |
| <span id="L50"><span class="lineNum"> 50</span> :<span class="tlaGNC"> 736 : list_head_init(&node->children);</span></span> |
| <span id="L51"><span class="lineNum"> 51</span> : : /* FIXME: locking? */</span> |
| <span id="L52"><span class="lineNum"> 52</span> :<span class="tlaGNC"> 736 : node->phandle = new_phandle();</span></span> |
| <span id="L53"><span class="lineNum"> 53</span> :<span class="tlaGNC"> 736 : return node;</span></span> |
| <span id="L54"><span class="lineNum"> 54</span> : : }</span> |
| <span id="L55"><span class="lineNum"> 55</span> : : </span> |
| <span id="L56"><span class="lineNum"> 56</span> :<span class="tlaGNC"> 49 : struct dt_node *dt_new_root(const char *name)</span></span> |
| <span id="L57"><span class="lineNum"> 57</span> : : {</span> |
| <span id="L58"><span class="lineNum"> 58</span> :<span class="tlaGNC"> 49 : return new_node(name);</span></span> |
| <span id="L59"><span class="lineNum"> 59</span> : : }</span> |
| <span id="L60"><span class="lineNum"> 60</span> : : </span> |
| <span id="L61"><span class="lineNum"> 61</span> :<span class="tlaGNC"> 13085 : static const char *get_unitname(const struct dt_node *node)</span></span> |
| <span id="L62"><span class="lineNum"> 62</span> : : {</span> |
| <span id="L63"><span class="lineNum"> 63</span> :<span class="tlaGNC"> 13085 : const char *c = strchr(node->name, '@');</span></span> |
| <span id="L64"><span class="lineNum"> 64</span> : : </span> |
| <span id="L65"><span class="lineNum"> 65</span> :<span class="tlaGNC"> 13085 : if (!c)</span></span> |
| <span id="L66"><span class="lineNum"> 66</span> :<span class="tlaGNC"> 11247 : return NULL;</span></span> |
| <span id="L67"><span class="lineNum"> 67</span> : : </span> |
| <span id="L68"><span class="lineNum"> 68</span> :<span class="tlaGNC"> 1838 : return c + 1;</span></span> |
| <span id="L69"><span class="lineNum"> 69</span> : : }</span> |
| <span id="L70"><span class="lineNum"> 70</span> : : </span> |
| <span id="L71"><span class="lineNum"> 71</span> :<span class="tlaGNC"> 6151 : int dt_cmp_subnodes(const struct dt_node *a, const struct dt_node *b)</span></span> |
| <span id="L72"><span class="lineNum"> 72</span> : : {</span> |
| <span id="L73"><span class="lineNum"> 73</span> :<span class="tlaGNC"> 6151 : const char *a_unit = get_unitname(a);</span></span> |
| <span id="L74"><span class="lineNum"> 74</span> :<span class="tlaGNC"> 6151 : const char *b_unit = get_unitname(b);</span></span> |
| <span id="L75"><span class="lineNum"> 75</span> : : </span> |
| <span id="L76"><span class="lineNum"> 76</span> :<span class="tlaGNC"> 6151 : ptrdiff_t basenamelen = a_unit - a->name;</span></span> |
| <span id="L77"><span class="lineNum"> 77</span> : : </span> |
| <span id="L78"><span class="lineNum"> 78</span> : : /* sort hex unit addresses by number */</span> |
| <span id="L79"><span class="lineNum"> 79</span> :<span class="tlaGNC"> 6151 : if (a_unit && b_unit && !strncmp(a->name, b->name, basenamelen)) {</span></span> |
| <span id="L80"><span class="lineNum"> 80</span> : : unsigned long long a_num, b_num;</span> |
| <span id="L81"><span class="lineNum"> 81</span> : : char *a_end, *b_end;</span> |
| <span id="L82"><span class="lineNum"> 82</span> : : </span> |
| <span id="L83"><span class="lineNum"> 83</span> :<span class="tlaGNC"> 295 : a_num = strtoul(a_unit, &a_end, 16);</span></span> |
| <span id="L84"><span class="lineNum"> 84</span> :<span class="tlaGNC"> 295 : b_num = strtoul(b_unit, &b_end, 16);</span></span> |
| <span id="L85"><span class="lineNum"> 85</span> : : </span> |
| <span id="L86"><span class="lineNum"> 86</span> : : /* only compare if the unit addr parsed correctly */</span> |
| <span id="L87"><span class="lineNum"> 87</span> :<span class="tlaGNC"> 295 : if (*a_end == 0 && *b_end == 0)</span></span> |
| <span id="L88"><span class="lineNum"> 88</span> :<span class="tlaGNC"> 294 : return (a_num > b_num) - (a_num < b_num);</span></span> |
| <span id="L89"><span class="lineNum"> 89</span> : : }</span> |
| <span id="L90"><span class="lineNum"> 90</span> : : </span> |
| <span id="L91"><span class="lineNum"> 91</span> :<span class="tlaGNC"> 5857 : return strcmp(a->name, b->name);</span></span> |
| <span id="L92"><span class="lineNum"> 92</span> : : }</span> |
| <span id="L93"><span class="lineNum"> 93</span> : : </span> |
| <span id="L94"><span class="lineNum"> 94</span> :<span class="tlaGNC"> 696 : bool dt_attach_root(struct dt_node *parent, struct dt_node *root)</span></span> |
| <span id="L95"><span class="lineNum"> 95</span> : : {</span> |
| <span id="L96"><span class="lineNum"> 96</span> : : struct dt_node *node;</span> |
| <span id="L97"><span class="lineNum"> 97</span> : : </span> |
| <span id="L98"><span class="lineNum"> 98</span> :<span class="tlaGNC"> 696 : assert(!root->parent);</span></span> |
| <span id="L99"><span class="lineNum"> 99</span> : : </span> |
| <span id="L100"><span class="lineNum"> 100</span> :<span class="tlaGNC"> 696 : if (list_empty(&parent->children)) {</span></span> |
| <span id="L101"><span class="lineNum"> 101</span> :<span class="tlaGNC"> 110 : list_add(&parent->children, &root->list);</span></span> |
| <span id="L102"><span class="lineNum"> 102</span> :<span class="tlaGNC"> 110 : root->parent = parent;</span></span> |
| <span id="L103"><span class="lineNum"> 103</span> : : </span> |
| <span id="L104"><span class="lineNum"> 104</span> :<span class="tlaGNC"> 110 : return true;</span></span> |
| <span id="L105"><span class="lineNum"> 105</span> : : }</span> |
| <span id="L106"><span class="lineNum"> 106</span> : : </span> |
| <span id="L107"><span class="lineNum"> 107</span> :<span class="tlaGNC"> 6133 : dt_for_each_child(parent, node) {</span></span> |
| <span id="L108"><span class="lineNum"> 108</span> :<span class="tlaGNC"> 6028 : int cmp = dt_cmp_subnodes(node, root);</span></span> |
| <span id="L109"><span class="lineNum"> 109</span> : : </span> |
| <span id="L110"><span class="lineNum"> 110</span> : : /* Look for duplicates */</span> |
| <span id="L111"><span class="lineNum"> 111</span> :<span class="tlaGNC"> 6028 : if (cmp == 0) {</span></span> |
| <span id="L112"><span class="lineNum"> 112</span> :<span class="tlaGNC"> 4 : prerror("DT: %s failed, duplicate %s\n",</span></span> |
| <span id="L113"><span class="lineNum"> 113</span> : : __func__, root->name);</span> |
| <span id="L114"><span class="lineNum"> 114</span> :<span class="tlaGNC"> 4 : return false;</span></span> |
| <span id="L115"><span class="lineNum"> 115</span> : : }</span> |
| <span id="L116"><span class="lineNum"> 116</span> : : </span> |
| <span id="L117"><span class="lineNum"> 117</span> : : /* insert before the first node that's larger</span> |
| <span id="L118"><span class="lineNum"> 118</span> : : * the the node we're inserting */</span> |
| <span id="L119"><span class="lineNum"> 119</span> :<span class="tlaGNC"> 6024 : if (cmp > 0)</span></span> |
| <span id="L120"><span class="lineNum"> 120</span> :<span class="tlaGNC"> 477 : break;</span></span> |
| <span id="L121"><span class="lineNum"> 121</span> : : }</span> |
| <span id="L122"><span class="lineNum"> 122</span> : : </span> |
| <span id="L123"><span class="lineNum"> 123</span> :<span class="tlaGNC"> 582 : list_add_before(&parent->children, &node->list, &root->list);</span></span> |
| <span id="L124"><span class="lineNum"> 124</span> :<span class="tlaGNC"> 582 : root->parent = parent;</span></span> |
| <span id="L125"><span class="lineNum"> 125</span> : : </span> |
| <span id="L126"><span class="lineNum"> 126</span> :<span class="tlaGNC"> 582 : return true;</span></span> |
| <span id="L127"><span class="lineNum"> 127</span> : : }</span> |
| <span id="L128"><span class="lineNum"> 128</span> : : </span> |
| <span id="L129"><span class="lineNum"> 129</span> :<span class="tlaGNC"> 705 : static inline void dt_destroy(struct dt_node *dn)</span></span> |
| <span id="L130"><span class="lineNum"> 130</span> : : {</span> |
| <span id="L131"><span class="lineNum"> 131</span> :<span class="tlaGNC"> 705 : if (!dn)</span></span> |
| <span id="L132"><span class="lineNum"> 132</span> :<span class="tlaUNC tlaBgUNC"> 0 : return;</span></span> |
| <span id="L133"><span class="lineNum"> 133</span> : : </span> |
| <span id="L134"><span class="lineNum"> 134</span> :<span class="tlaGNC tlaBgGNC"> 705 : free_name(dn->name);</span></span> |
| <span id="L135"><span class="lineNum"> 135</span> :<span class="tlaGNC"> 705 : free(dn);</span></span> |
| <span id="L136"><span class="lineNum"> 136</span> : : }</span> |
| <span id="L137"><span class="lineNum"> 137</span> : : </span> |
| <span id="L138"><span class="lineNum"> 138</span> :<span class="tlaGNC"> 598 : struct dt_node *dt_new(struct dt_node *parent, const char *name)</span></span> |
| <span id="L139"><span class="lineNum"> 139</span> : : {</span> |
| <span id="L140"><span class="lineNum"> 140</span> : : struct dt_node *new;</span> |
| <span id="L141"><span class="lineNum"> 141</span> :<span class="tlaGNC"> 598 : assert(parent);</span></span> |
| <span id="L142"><span class="lineNum"> 142</span> : : </span> |
| <span id="L143"><span class="lineNum"> 143</span> :<span class="tlaGNC"> 598 : new = new_node(name);</span></span> |
| <span id="L144"><span class="lineNum"> 144</span> :<span class="tlaGNC"> 598 : if (!dt_attach_root(parent, new)) {</span></span> |
| <span id="L145"><span class="lineNum"> 145</span> :<span class="tlaGNC"> 1 : dt_destroy(new);</span></span> |
| <span id="L146"><span class="lineNum"> 146</span> :<span class="tlaGNC"> 1 : return NULL;</span></span> |
| <span id="L147"><span class="lineNum"> 147</span> : : }</span> |
| <span id="L148"><span class="lineNum"> 148</span> :<span class="tlaGNC"> 597 : return new;</span></span> |
| <span id="L149"><span class="lineNum"> 149</span> : : }</span> |
| <span id="L150"><span class="lineNum"> 150</span> : : </span> |
| <span id="L151"><span class="lineNum"> 151</span> : : /*</span> |
| <span id="L152"><span class="lineNum"> 152</span> : : * low level variant, we export this because there are "weird" address</span> |
| <span id="L153"><span class="lineNum"> 153</span> : : * formats, such as LPC/ISA bus addresses which have a letter to identify</span> |
| <span id="L154"><span class="lineNum"> 154</span> : : * which bus space the address is inside of.</span> |
| <span id="L155"><span class="lineNum"> 155</span> : : */</span> |
| <span id="L156"><span class="lineNum"> 156</span> :<span class="tlaGNC"> 634 : struct dt_node *__dt_find_by_name_addr(struct dt_node *parent, const char *name,</span></span> |
| <span id="L157"><span class="lineNum"> 157</span> : : const char *addr)</span> |
| <span id="L158"><span class="lineNum"> 158</span> : : {</span> |
| <span id="L159"><span class="lineNum"> 159</span> : : struct dt_node *node;</span> |
| <span id="L160"><span class="lineNum"> 160</span> : : </span> |
| <span id="L161"><span class="lineNum"> 161</span> :<span class="tlaGNC"> 634 : if (list_empty(&parent->children))</span></span> |
| <span id="L162"><span class="lineNum"> 162</span> :<span class="tlaGNC"> 413 : return NULL;</span></span> |
| <span id="L163"><span class="lineNum"> 163</span> : : </span> |
| <span id="L164"><span class="lineNum"> 164</span> :<span class="tlaGNC"> 963 : dt_for_each_child(parent, node) {</span></span> |
| <span id="L165"><span class="lineNum"> 165</span> :<span class="tlaGNC"> 783 : const char *unit = get_unitname(node);</span></span> |
| <span id="L166"><span class="lineNum"> 166</span> : : int len;</span> |
| <span id="L167"><span class="lineNum"> 167</span> : : </span> |
| <span id="L168"><span class="lineNum"> 168</span> :<span class="tlaGNC"> 783 : if (!unit)</span></span> |
| <span id="L169"><span class="lineNum"> 169</span> :<span class="tlaGNC"> 15 : continue;</span></span> |
| <span id="L170"><span class="lineNum"> 170</span> : : </span> |
| <span id="L171"><span class="lineNum"> 171</span> : : /* match the name */</span> |
| <span id="L172"><span class="lineNum"> 172</span> :<span class="tlaGNC"> 768 : len = (int) (unit - node->name) - 1;</span></span> |
| <span id="L173"><span class="lineNum"> 173</span> :<span class="tlaGNC"> 768 : if (strncmp(node->name, name, len))</span></span> |
| <span id="L174"><span class="lineNum"> 174</span> :<span class="tlaGNC"> 697 : continue;</span></span> |
| <span id="L175"><span class="lineNum"> 175</span> : : </span> |
| <span id="L176"><span class="lineNum"> 176</span> : : /* match the unit */</span> |
| <span id="L177"><span class="lineNum"> 177</span> :<span class="tlaGNC"> 71 : if (strcmp(unit, addr) == 0)</span></span> |
| <span id="L178"><span class="lineNum"> 178</span> :<span class="tlaGNC"> 41 : return node;</span></span> |
| <span id="L179"><span class="lineNum"> 179</span> : : }</span> |
| <span id="L180"><span class="lineNum"> 180</span> : : </span> |
| <span id="L181"><span class="lineNum"> 181</span> :<span class="tlaGNC"> 671 : dt_for_each_child(parent, node) {</span></span> |
| <span id="L182"><span class="lineNum"> 182</span> :<span class="tlaGNC"> 563 : struct dt_node *ret = __dt_find_by_name_addr(node, name, addr);</span></span> |
| <span id="L183"><span class="lineNum"> 183</span> : : </span> |
| <span id="L184"><span class="lineNum"> 184</span> :<span class="tlaGNC"> 563 : if (ret)</span></span> |
| <span id="L185"><span class="lineNum"> 185</span> :<span class="tlaGNC"> 72 : return ret;</span></span> |
| <span id="L186"><span class="lineNum"> 186</span> : : }</span> |
| <span id="L187"><span class="lineNum"> 187</span> : : </span> |
| <span id="L188"><span class="lineNum"> 188</span> :<span class="tlaGNC"> 108 : return NULL;</span></span> |
| <span id="L189"><span class="lineNum"> 189</span> : : }</span> |
| <span id="L190"><span class="lineNum"> 190</span> : : </span> |
| <span id="L191"><span class="lineNum"> 191</span> :<span class="tlaGNC"> 71 : struct dt_node *dt_find_by_name_addr(struct dt_node *parent, const char *name,</span></span> |
| <span id="L192"><span class="lineNum"> 192</span> : : uint64_t addr)</span> |
| <span id="L193"><span class="lineNum"> 193</span> : : {</span> |
| <span id="L194"><span class="lineNum"> 194</span> : : char addr_str[16 + 1]; /* max size of a 64bit int */</span> |
| <span id="L195"><span class="lineNum"> 195</span> :<span class="tlaGNC"> 71 : snprintf(addr_str, sizeof(addr_str), "%" PRIx64, addr);</span></span> |
| <span id="L196"><span class="lineNum"> 196</span> : : </span> |
| <span id="L197"><span class="lineNum"> 197</span> :<span class="tlaGNC"> 71 : return __dt_find_by_name_addr(parent, name, addr_str);</span></span> |
| <span id="L198"><span class="lineNum"> 198</span> : : }</span> |
| <span id="L199"><span class="lineNum"> 199</span> : : </span> |
| <span id="L200"><span class="lineNum"> 200</span> :<span class="tlaGNC"> 87 : struct dt_node *dt_new_addr(struct dt_node *parent, const char *name,</span></span> |
| <span id="L201"><span class="lineNum"> 201</span> : : uint64_t addr)</span> |
| <span id="L202"><span class="lineNum"> 202</span> : : {</span> |
| <span id="L203"><span class="lineNum"> 203</span> : : char *lname;</span> |
| <span id="L204"><span class="lineNum"> 204</span> : : struct dt_node *new;</span> |
| <span id="L205"><span class="lineNum"> 205</span> : : size_t len;</span> |
| <span id="L206"><span class="lineNum"> 206</span> : : </span> |
| <span id="L207"><span class="lineNum"> 207</span> :<span class="tlaGNC"> 87 : assert(parent);</span></span> |
| <span id="L208"><span class="lineNum"> 208</span> :<span class="tlaGNC"> 87 : len = strlen(name) + STR_MAX_CHARS(addr) + 2;</span></span> |
| <span id="L209"><span class="lineNum"> 209</span> :<span class="tlaGNC"> 87 : lname = malloc(len);</span></span> |
| <span id="L210"><span class="lineNum"> 210</span> :<span class="tlaGNC"> 87 : if (!lname)</span></span> |
| <span id="L211"><span class="lineNum"> 211</span> :<span class="tlaUNC tlaBgUNC"> 0 : return NULL;</span></span> |
| <span id="L212"><span class="lineNum"> 212</span> :<span class="tlaGNC tlaBgGNC"> 87 : snprintf(lname, len, "%s@%llx", name, (long long)addr);</span></span> |
| <span id="L213"><span class="lineNum"> 213</span> :<span class="tlaGNC"> 87 : new = new_node(lname);</span></span> |
| <span id="L214"><span class="lineNum"> 214</span> :<span class="tlaGNC"> 87 : free(lname);</span></span> |
| <span id="L215"><span class="lineNum"> 215</span> :<span class="tlaGNC"> 87 : if (!dt_attach_root(parent, new)) {</span></span> |
| <span id="L216"><span class="lineNum"> 216</span> :<span class="tlaGNC"> 1 : dt_destroy(new);</span></span> |
| <span id="L217"><span class="lineNum"> 217</span> :<span class="tlaGNC"> 1 : return NULL;</span></span> |
| <span id="L218"><span class="lineNum"> 218</span> : : }</span> |
| <span id="L219"><span class="lineNum"> 219</span> :<span class="tlaGNC"> 86 : return new;</span></span> |
| <span id="L220"><span class="lineNum"> 220</span> : : }</span> |
| <span id="L221"><span class="lineNum"> 221</span> : : </span> |
| <span id="L222"><span class="lineNum"> 222</span> :<span class="tlaGNC"> 2 : struct dt_node *dt_new_2addr(struct dt_node *parent, const char *name,</span></span> |
| <span id="L223"><span class="lineNum"> 223</span> : : uint64_t addr0, uint64_t addr1)</span> |
| <span id="L224"><span class="lineNum"> 224</span> : : {</span> |
| <span id="L225"><span class="lineNum"> 225</span> : : char *lname;</span> |
| <span id="L226"><span class="lineNum"> 226</span> : : struct dt_node *new;</span> |
| <span id="L227"><span class="lineNum"> 227</span> : : size_t len;</span> |
| <span id="L228"><span class="lineNum"> 228</span> :<span class="tlaGNC"> 2 : assert(parent);</span></span> |
| <span id="L229"><span class="lineNum"> 229</span> : : </span> |
| <span id="L230"><span class="lineNum"> 230</span> :<span class="tlaGNC"> 2 : len = strlen(name) + 2*STR_MAX_CHARS(addr0) + 3;</span></span> |
| <span id="L231"><span class="lineNum"> 231</span> :<span class="tlaGNC"> 2 : lname = malloc(len);</span></span> |
| <span id="L232"><span class="lineNum"> 232</span> :<span class="tlaGNC"> 2 : if (!lname)</span></span> |
| <span id="L233"><span class="lineNum"> 233</span> :<span class="tlaUNC tlaBgUNC"> 0 : return NULL;</span></span> |
| <span id="L234"><span class="lineNum"> 234</span> :<span class="tlaGNC tlaBgGNC"> 2 : snprintf(lname, len, "%s@%llx,%llx",</span></span> |
| <span id="L235"><span class="lineNum"> 235</span> : : name, (long long)addr0, (long long)addr1);</span> |
| <span id="L236"><span class="lineNum"> 236</span> :<span class="tlaGNC"> 2 : new = new_node(lname);</span></span> |
| <span id="L237"><span class="lineNum"> 237</span> :<span class="tlaGNC"> 2 : free(lname);</span></span> |
| <span id="L238"><span class="lineNum"> 238</span> :<span class="tlaGNC"> 2 : if (!dt_attach_root(parent, new)) {</span></span> |
| <span id="L239"><span class="lineNum"> 239</span> :<span class="tlaGNC"> 1 : dt_destroy(new);</span></span> |
| <span id="L240"><span class="lineNum"> 240</span> :<span class="tlaGNC"> 1 : return NULL;</span></span> |
| <span id="L241"><span class="lineNum"> 241</span> : : }</span> |
| <span id="L242"><span class="lineNum"> 242</span> :<span class="tlaGNC"> 1 : return new;</span></span> |
| <span id="L243"><span class="lineNum"> 243</span> : : }</span> |
| <span id="L244"><span class="lineNum"> 244</span> : : </span> |
| <span id="L245"><span class="lineNum"> 245</span> :<span class="tlaUNC tlaBgUNC"> 0 : static struct dt_node *__dt_copy(struct dt_node *node, struct dt_node *parent,</span></span> |
| <span id="L246"><span class="lineNum"> 246</span> : : bool root)</span> |
| <span id="L247"><span class="lineNum"> 247</span> : : {</span> |
| <span id="L248"><span class="lineNum"> 248</span> : : struct dt_property *prop, *new_prop;</span> |
| <span id="L249"><span class="lineNum"> 249</span> : : struct dt_node *new_node, *child;</span> |
| <span id="L250"><span class="lineNum"> 250</span> : : </span> |
| <span id="L251"><span class="lineNum"> 251</span> :<span class="tlaUNC"> 0 : new_node = dt_new(parent, node->name);</span></span> |
| <span id="L252"><span class="lineNum"> 252</span> :<span class="tlaUNC"> 0 : if (!new_node)</span></span> |
| <span id="L253"><span class="lineNum"> 253</span> :<span class="tlaUNC"> 0 : return NULL;</span></span> |
| <span id="L254"><span class="lineNum"> 254</span> : : </span> |
| <span id="L255"><span class="lineNum"> 255</span> :<span class="tlaUNC"> 0 : list_for_each(&node->properties, prop, list) {</span></span> |
| <span id="L256"><span class="lineNum"> 256</span> :<span class="tlaUNC"> 0 : new_prop = dt_add_property(new_node, prop->name, prop->prop,</span></span> |
| <span id="L257"><span class="lineNum"> 257</span> : : prop->len);</span> |
| <span id="L258"><span class="lineNum"> 258</span> :<span class="tlaUNC"> 0 : if (!new_prop)</span></span> |
| <span id="L259"><span class="lineNum"> 259</span> :<span class="tlaUNC"> 0 : goto fail;</span></span> |
| <span id="L260"><span class="lineNum"> 260</span> : : }</span> |
| <span id="L261"><span class="lineNum"> 261</span> : : </span> |
| <span id="L262"><span class="lineNum"> 262</span> :<span class="tlaUNC"> 0 : list_for_each(&node->children, child, list) {</span></span> |
| <span id="L263"><span class="lineNum"> 263</span> :<span class="tlaUNC"> 0 : child = __dt_copy(child, new_node, false);</span></span> |
| <span id="L264"><span class="lineNum"> 264</span> :<span class="tlaUNC"> 0 : if (!child)</span></span> |
| <span id="L265"><span class="lineNum"> 265</span> :<span class="tlaUNC"> 0 : goto fail;</span></span> |
| <span id="L266"><span class="lineNum"> 266</span> : : }</span> |
| <span id="L267"><span class="lineNum"> 267</span> : : </span> |
| <span id="L268"><span class="lineNum"> 268</span> :<span class="tlaUNC"> 0 : return new_node;</span></span> |
| <span id="L269"><span class="lineNum"> 269</span> : : </span> |
| <span id="L270"><span class="lineNum"> 270</span> :<span class="tlaUNC"> 0 : fail:</span></span> |
| <span id="L271"><span class="lineNum"> 271</span> : : /* dt_free will recurse for us, so only free when we unwind to the</span> |
| <span id="L272"><span class="lineNum"> 272</span> : : * top-level failure */</span> |
| <span id="L273"><span class="lineNum"> 273</span> :<span class="tlaUNC"> 0 : if (root)</span></span> |
| <span id="L274"><span class="lineNum"> 274</span> :<span class="tlaUNC"> 0 : dt_free(new_node);</span></span> |
| <span id="L275"><span class="lineNum"> 275</span> :<span class="tlaUNC"> 0 : return NULL;</span></span> |
| <span id="L276"><span class="lineNum"> 276</span> : : }</span> |
| <span id="L277"><span class="lineNum"> 277</span> : : </span> |
| <span id="L278"><span class="lineNum"> 278</span> :<span class="tlaUNC"> 0 : struct dt_node *dt_copy(struct dt_node *node, struct dt_node *parent)</span></span> |
| <span id="L279"><span class="lineNum"> 279</span> : : {</span> |
| <span id="L280"><span class="lineNum"> 280</span> :<span class="tlaUNC"> 0 : return __dt_copy(node, parent, true);</span></span> |
| <span id="L281"><span class="lineNum"> 281</span> : : }</span> |
| <span id="L282"><span class="lineNum"> 282</span> : : </span> |
| <span id="L283"><span class="lineNum"> 283</span> :<span class="tlaGNC tlaBgGNC"> 10 : char *dt_get_path(const struct dt_node *node)</span></span> |
| <span id="L284"><span class="lineNum"> 284</span> : : {</span> |
| <span id="L285"><span class="lineNum"> 285</span> :<span class="tlaGNC"> 10 : unsigned int len = 0;</span></span> |
| <span id="L286"><span class="lineNum"> 286</span> : : const struct dt_node *n;</span> |
| <span id="L287"><span class="lineNum"> 287</span> : : char *path, *p;</span> |
| <span id="L288"><span class="lineNum"> 288</span> : : </span> |
| <span id="L289"><span class="lineNum"> 289</span> : : /* Dealing with NULL is for test/debug purposes */</span> |
| <span id="L290"><span class="lineNum"> 290</span> :<span class="tlaGNC"> 10 : if (!node)</span></span> |
| <span id="L291"><span class="lineNum"> 291</span> :<span class="tlaUNC tlaBgUNC"> 0 : return strdup("<NULL>");</span></span> |
| <span id="L292"><span class="lineNum"> 292</span> : : </span> |
| <span id="L293"><span class="lineNum"> 293</span> :<span class="tlaGNC tlaBgGNC"> 36 : for (n = node; n; n = n->parent) {</span></span> |
| <span id="L294"><span class="lineNum"> 294</span> :<span class="tlaGNC"> 26 : len += strlen(n->name);</span></span> |
| <span id="L295"><span class="lineNum"> 295</span> :<span class="tlaGNC"> 26 : if (n->parent || n == node)</span></span> |
| <span id="L296"><span class="lineNum"> 296</span> :<span class="tlaGNC"> 17 : len++;</span></span> |
| <span id="L297"><span class="lineNum"> 297</span> : : }</span> |
| <span id="L298"><span class="lineNum"> 298</span> :<span class="tlaGNC"> 10 : path = zalloc(len + 1);</span></span> |
| <span id="L299"><span class="lineNum"> 299</span> :<span class="tlaGNC"> 10 : assert(path);</span></span> |
| <span id="L300"><span class="lineNum"> 300</span> :<span class="tlaGNC"> 10 : p = path + len;</span></span> |
| <span id="L301"><span class="lineNum"> 301</span> :<span class="tlaGNC"> 36 : for (n = node; n; n = n->parent) {</span></span> |
| <span id="L302"><span class="lineNum"> 302</span> :<span class="tlaGNC"> 26 : len = strlen(n->name);</span></span> |
| <span id="L303"><span class="lineNum"> 303</span> :<span class="tlaGNC"> 26 : p -= len;</span></span> |
| <span id="L304"><span class="lineNum"> 304</span> :<span class="tlaGNC"> 26 : memcpy(p, n->name, len);</span></span> |
| <span id="L305"><span class="lineNum"> 305</span> :<span class="tlaGNC"> 26 : if (n->parent || n == node)</span></span> |
| <span id="L306"><span class="lineNum"> 306</span> :<span class="tlaGNC"> 17 : *(--p) = '/';</span></span> |
| <span id="L307"><span class="lineNum"> 307</span> : : }</span> |
| <span id="L308"><span class="lineNum"> 308</span> :<span class="tlaGNC"> 10 : assert(p == path);</span></span> |
| <span id="L309"><span class="lineNum"> 309</span> : : </span> |
| <span id="L310"><span class="lineNum"> 310</span> :<span class="tlaGNC"> 10 : return p;</span></span> |
| <span id="L311"><span class="lineNum"> 311</span> : : }</span> |
| <span id="L312"><span class="lineNum"> 312</span> : : </span> |
| <span id="L313"><span class="lineNum"> 313</span> :<span class="tlaGNC"> 1589 : static const char *__dt_path_split(const char *p,</span></span> |
| <span id="L314"><span class="lineNum"> 314</span> : : const char **namep, unsigned int *namel,</span> |
| <span id="L315"><span class="lineNum"> 315</span> : : const char **addrp, unsigned int *addrl)</span> |
| <span id="L316"><span class="lineNum"> 316</span> : : {</span> |
| <span id="L317"><span class="lineNum"> 317</span> : : const char *at, *sl;</span> |
| <span id="L318"><span class="lineNum"> 318</span> : : </span> |
| <span id="L319"><span class="lineNum"> 319</span> :<span class="tlaGNC"> 1589 : *namel = *addrl = 0;</span></span> |
| <span id="L320"><span class="lineNum"> 320</span> : : </span> |
| <span id="L321"><span class="lineNum"> 321</span> : : /* Skip initial '/' */</span> |
| <span id="L322"><span class="lineNum"> 322</span> :<span class="tlaGNC"> 1715 : while (*p == '/')</span></span> |
| <span id="L323"><span class="lineNum"> 323</span> :<span class="tlaGNC"> 126 : p++;</span></span> |
| <span id="L324"><span class="lineNum"> 324</span> : : </span> |
| <span id="L325"><span class="lineNum"> 325</span> : : /* Check empty path */</span> |
| <span id="L326"><span class="lineNum"> 326</span> :<span class="tlaGNC"> 1589 : if (*p == 0)</span></span> |
| <span id="L327"><span class="lineNum"> 327</span> :<span class="tlaUNC tlaBgUNC"> 0 : return p;</span></span> |
| <span id="L328"><span class="lineNum"> 328</span> : : </span> |
| <span id="L329"><span class="lineNum"> 329</span> :<span class="tlaGNC tlaBgGNC"> 1589 : at = strchr(p, '@');</span></span> |
| <span id="L330"><span class="lineNum"> 330</span> :<span class="tlaGNC"> 1589 : sl = strchr(p, '/');</span></span> |
| <span id="L331"><span class="lineNum"> 331</span> :<span class="tlaGNC"> 1589 : if (sl == NULL)</span></span> |
| <span id="L332"><span class="lineNum"> 332</span> :<span class="tlaGNC"> 1503 : sl = p + strlen(p);</span></span> |
| <span id="L333"><span class="lineNum"> 333</span> :<span class="tlaGNC"> 1589 : if (sl < at)</span></span> |
| <span id="L334"><span class="lineNum"> 334</span> :<span class="tlaGNC"> 2 : at = NULL;</span></span> |
| <span id="L335"><span class="lineNum"> 335</span> :<span class="tlaGNC"> 1589 : if (at) {</span></span> |
| <span id="L336"><span class="lineNum"> 336</span> :<span class="tlaGNC"> 144 : *addrp = at + 1;</span></span> |
| <span id="L337"><span class="lineNum"> 337</span> :<span class="tlaGNC"> 144 : *addrl = sl - at - 1;</span></span> |
| <span id="L338"><span class="lineNum"> 338</span> : : }</span> |
| <span id="L339"><span class="lineNum"> 339</span> :<span class="tlaGNC"> 1589 : *namep = p;</span></span> |
| <span id="L340"><span class="lineNum"> 340</span> :<span class="tlaGNC"> 1589 : *namel = at ? (at - p) : (sl - p);</span></span> |
| <span id="L341"><span class="lineNum"> 341</span> : : </span> |
| <span id="L342"><span class="lineNum"> 342</span> :<span class="tlaGNC"> 1589 : return sl;</span></span> |
| <span id="L343"><span class="lineNum"> 343</span> : : }</span> |
| <span id="L344"><span class="lineNum"> 344</span> : : </span> |
| <span id="L345"><span class="lineNum"> 345</span> :<span class="tlaGNC"> 93 : struct dt_node *dt_find_by_path(struct dt_node *root, const char *path)</span></span> |
| <span id="L346"><span class="lineNum"> 346</span> : : {</span> |
| <span id="L347"><span class="lineNum"> 347</span> : : struct dt_node *n;</span> |
| <span id="L348"><span class="lineNum"> 348</span> :<span class="tlaGNC"> 93 : const char *pn, *pa, *p = path, *nn, *na;</span></span> |
| <span id="L349"><span class="lineNum"> 349</span> : : unsigned int pnl, pal, nnl, nal;</span> |
| <span id="L350"><span class="lineNum"> 350</span> : : bool match;</span> |
| <span id="L351"><span class="lineNum"> 351</span> : : </span> |
| <span id="L352"><span class="lineNum"> 352</span> : : /* Walk path components */</span> |
| <span id="L353"><span class="lineNum"> 353</span> :<span class="tlaGNC"> 192 : while (*p) {</span></span> |
| <span id="L354"><span class="lineNum"> 354</span> : : /* Extract next path component */</span> |
| <span id="L355"><span class="lineNum"> 355</span> :<span class="tlaGNC"> 160 : p = __dt_path_split(p, &pn, &pnl, &pa, &pal);</span></span> |
| <span id="L356"><span class="lineNum"> 356</span> :<span class="tlaGNC"> 160 : if (pnl == 0 && pal == 0)</span></span> |
| <span id="L357"><span class="lineNum"> 357</span> :<span class="tlaUNC tlaBgUNC"> 0 : break;</span></span> |
| <span id="L358"><span class="lineNum"> 358</span> : : </span> |
| <span id="L359"><span class="lineNum"> 359</span> : : /* Compare with each child node */</span> |
| <span id="L360"><span class="lineNum"> 360</span> :<span class="tlaGNC tlaBgGNC"> 160 : match = false;</span></span> |
| <span id="L361"><span class="lineNum"> 361</span> :<span class="tlaGNC"> 1490 : list_for_each(&root->children, n, list) {</span></span> |
| <span id="L362"><span class="lineNum"> 362</span> :<span class="tlaGNC"> 1429 : match = true;</span></span> |
| <span id="L363"><span class="lineNum"> 363</span> :<span class="tlaGNC"> 1429 : __dt_path_split(n->name, &nn, &nnl, &na, &nal);</span></span> |
| <span id="L364"><span class="lineNum"> 364</span> :<span class="tlaGNC"> 1429 : if (pnl && (pnl != nnl || strncmp(pn, nn, pnl)))</span></span> |
| <span id="L365"><span class="lineNum"> 365</span> :<span class="tlaGNC"> 1330 : match = false;</span></span> |
| <span id="L366"><span class="lineNum"> 366</span> :<span class="tlaGNC"> 1429 : if (pal && (pal != nal || strncmp(pa, na, pal)))</span></span> |
| <span id="L367"><span class="lineNum"> 367</span> :<span class="tlaUNC tlaBgUNC"> 0 : match = false;</span></span> |
| <span id="L368"><span class="lineNum"> 368</span> :<span class="tlaGNC tlaBgGNC"> 1429 : if (match) {</span></span> |
| <span id="L369"><span class="lineNum"> 369</span> :<span class="tlaGNC"> 99 : root = n;</span></span> |
| <span id="L370"><span class="lineNum"> 370</span> :<span class="tlaGNC"> 99 : break;</span></span> |
| <span id="L371"><span class="lineNum"> 371</span> : : }</span> |
| <span id="L372"><span class="lineNum"> 372</span> : : }</span> |
| <span id="L373"><span class="lineNum"> 373</span> : : </span> |
| <span id="L374"><span class="lineNum"> 374</span> : : /* No child match */</span> |
| <span id="L375"><span class="lineNum"> 375</span> :<span class="tlaGNC"> 160 : if (!match)</span></span> |
| <span id="L376"><span class="lineNum"> 376</span> :<span class="tlaGNC"> 61 : return NULL;</span></span> |
| <span id="L377"><span class="lineNum"> 377</span> : : }</span> |
| <span id="L378"><span class="lineNum"> 378</span> :<span class="tlaGNC"> 32 : return root;</span></span> |
| <span id="L379"><span class="lineNum"> 379</span> : : }</span> |
| <span id="L380"><span class="lineNum"> 380</span> : : </span> |
| <span id="L381"><span class="lineNum"> 381</span> :<span class="tlaGNC"> 38 : struct dt_node *dt_find_by_name(struct dt_node *root, const char *name)</span></span> |
| <span id="L382"><span class="lineNum"> 382</span> : : {</span> |
| <span id="L383"><span class="lineNum"> 383</span> : : struct dt_node *child, *match;</span> |
| <span id="L384"><span class="lineNum"> 384</span> : : </span> |
| <span id="L385"><span class="lineNum"> 385</span> :<span class="tlaGNC"> 45 : list_for_each(&root->children, child, list) {</span></span> |
| <span id="L386"><span class="lineNum"> 386</span> :<span class="tlaGNC"> 27 : if (!strcmp(child->name, name))</span></span> |
| <span id="L387"><span class="lineNum"> 387</span> :<span class="tlaGNC"> 13 : return child;</span></span> |
| <span id="L388"><span class="lineNum"> 388</span> : : </span> |
| <span id="L389"><span class="lineNum"> 389</span> :<span class="tlaGNC"> 14 : match = dt_find_by_name(child, name);</span></span> |
| <span id="L390"><span class="lineNum"> 390</span> :<span class="tlaGNC"> 14 : if (match)</span></span> |
| <span id="L391"><span class="lineNum"> 391</span> :<span class="tlaGNC"> 7 : return match;</span></span> |
| <span id="L392"><span class="lineNum"> 392</span> : : }</span> |
| <span id="L393"><span class="lineNum"> 393</span> : : </span> |
| <span id="L394"><span class="lineNum"> 394</span> :<span class="tlaGNC"> 18 : return NULL;</span></span> |
| <span id="L395"><span class="lineNum"> 395</span> : : }</span> |
| <span id="L396"><span class="lineNum"> 396</span> : : </span> |
| <span id="L397"><span class="lineNum"> 397</span> :<span class="tlaGNC"> 9 : struct dt_node *dt_find_by_name_before_addr(struct dt_node *root, const char *name)</span></span> |
| <span id="L398"><span class="lineNum"> 398</span> : : {</span> |
| <span id="L399"><span class="lineNum"> 399</span> : : struct dt_node *child, *match;</span> |
| <span id="L400"><span class="lineNum"> 400</span> : : char *child_name;</span> |
| <span id="L401"><span class="lineNum"> 401</span> : : </span> |
| <span id="L402"><span class="lineNum"> 402</span> :<span class="tlaGNC"> 14 : list_for_each(&root->children, child, list) {</span></span> |
| <span id="L403"><span class="lineNum"> 403</span> :<span class="tlaGNC"> 7 : child_name = strdup(child->name);</span></span> |
| <span id="L404"><span class="lineNum"> 404</span> :<span class="tlaGNC"> 7 : if (!child_name)</span></span> |
| <span id="L405"><span class="lineNum"> 405</span> :<span class="tlaUNC tlaBgUNC"> 0 : return NULL;</span></span> |
| <span id="L406"><span class="lineNum"> 406</span> : : </span> |
| <span id="L407"><span class="lineNum"> 407</span> :<span class="tlaGNC tlaBgGNC"> 7 : child_name = strtok(child_name, "@");</span></span> |
| <span id="L408"><span class="lineNum"> 408</span> :<span class="tlaGNC"> 7 : if (!strcmp(child_name, name))</span></span> |
| <span id="L409"><span class="lineNum"> 409</span> :<span class="tlaGNC"> 2 : match = child;</span></span> |
| <span id="L410"><span class="lineNum"> 410</span> : : else</span> |
| <span id="L411"><span class="lineNum"> 411</span> :<span class="tlaGNC"> 5 : match = dt_find_by_name_before_addr(child, name);</span></span> |
| <span id="L412"><span class="lineNum"> 412</span> : : </span> |
| <span id="L413"><span class="lineNum"> 413</span> :<span class="tlaGNC"> 7 : free(child_name);</span></span> |
| <span id="L414"><span class="lineNum"> 414</span> :<span class="tlaGNC"> 7 : if (match)</span></span> |
| <span id="L415"><span class="lineNum"> 415</span> :<span class="tlaGNC"> 2 : return match;</span></span> |
| <span id="L416"><span class="lineNum"> 416</span> : : }</span> |
| <span id="L417"><span class="lineNum"> 417</span> : : </span> |
| <span id="L418"><span class="lineNum"> 418</span> :<span class="tlaGNC"> 7 : return NULL;</span></span> |
| <span id="L419"><span class="lineNum"> 419</span> : : }</span> |
| <span id="L420"><span class="lineNum"> 420</span> : : </span> |
| <span id="L421"><span class="lineNum"> 421</span> :<span class="tlaGNC"> 12 : struct dt_node *dt_new_check(struct dt_node *parent, const char *name)</span></span> |
| <span id="L422"><span class="lineNum"> 422</span> : : {</span> |
| <span id="L423"><span class="lineNum"> 423</span> :<span class="tlaGNC"> 12 : struct dt_node *node = dt_find_by_name(parent, name);</span></span> |
| <span id="L424"><span class="lineNum"> 424</span> : : </span> |
| <span id="L425"><span class="lineNum"> 425</span> :<span class="tlaGNC"> 12 : if (!node) {</span></span> |
| <span id="L426"><span class="lineNum"> 426</span> :<span class="tlaGNC"> 11 : node = dt_new(parent, name);</span></span> |
| <span id="L427"><span class="lineNum"> 427</span> :<span class="tlaGNC"> 11 : assert(node);</span></span> |
| <span id="L428"><span class="lineNum"> 428</span> : : }</span> |
| <span id="L429"><span class="lineNum"> 429</span> : : </span> |
| <span id="L430"><span class="lineNum"> 430</span> :<span class="tlaGNC"> 12 : return node;</span></span> |
| <span id="L431"><span class="lineNum"> 431</span> : : }</span> |
| <span id="L432"><span class="lineNum"> 432</span> : : </span> |
| <span id="L433"><span class="lineNum"> 433</span> : : </span> |
| <span id="L434"><span class="lineNum"> 434</span> :<span class="tlaGNC"> 2 : struct dt_node *dt_find_by_phandle(struct dt_node *root, u32 phandle)</span></span> |
| <span id="L435"><span class="lineNum"> 435</span> : : {</span> |
| <span id="L436"><span class="lineNum"> 436</span> : : struct dt_node *node;</span> |
| <span id="L437"><span class="lineNum"> 437</span> : : </span> |
| <span id="L438"><span class="lineNum"> 438</span> :<span class="tlaGNC"> 10 : dt_for_each_node(root, node)</span></span> |
| <span id="L439"><span class="lineNum"> 439</span> :<span class="tlaGNC"> 9 : if (node->phandle == phandle)</span></span> |
| <span id="L440"><span class="lineNum"> 440</span> :<span class="tlaGNC"> 1 : return node;</span></span> |
| <span id="L441"><span class="lineNum"> 441</span> :<span class="tlaGNC"> 1 : return NULL;</span></span> |
| <span id="L442"><span class="lineNum"> 442</span> : : }</span> |
| <span id="L443"><span class="lineNum"> 443</span> : : </span> |
| <span id="L444"><span class="lineNum"> 444</span> :<span class="tlaGNC"> 2736 : static struct dt_property *new_property(struct dt_node *node,</span></span> |
| <span id="L445"><span class="lineNum"> 445</span> : : const char *name, size_t size)</span> |
| <span id="L446"><span class="lineNum"> 446</span> : : {</span> |
| <span id="L447"><span class="lineNum"> 447</span> :<span class="tlaGNC"> 2736 : struct dt_property *p = malloc(sizeof(*p) + size);</span></span> |
| <span id="L448"><span class="lineNum"> 448</span> : : char *path;</span> |
| <span id="L449"><span class="lineNum"> 449</span> : : </span> |
| <span id="L450"><span class="lineNum"> 450</span> :<span class="tlaGNC"> 2736 : if (!p) {</span></span> |
| <span id="L451"><span class="lineNum"> 451</span> :<span class="tlaUNC tlaBgUNC"> 0 : path = dt_get_path(node);</span></span> |
| <span id="L452"><span class="lineNum"> 452</span> :<span class="tlaUNC"> 0 : prerror("Failed to allocate property \"%s\" for %s of %zu bytes\n",</span></span> |
| <span id="L453"><span class="lineNum"> 453</span> : : name, path, size);</span> |
| <span id="L454"><span class="lineNum"> 454</span> :<span class="tlaUNC"> 0 : free(path);</span></span> |
| <span id="L455"><span class="lineNum"> 455</span> :<span class="tlaUNC"> 0 : abort();</span></span> |
| <span id="L456"><span class="lineNum"> 456</span> : : }</span> |
| <span id="L457"><span class="lineNum"> 457</span> :<span class="tlaGNC tlaBgGNC"> 2736 : if (dt_find_property(node, name)) {</span></span> |
| <span id="L458"><span class="lineNum"> 458</span> :<span class="tlaUNC tlaBgUNC"> 0 : path = dt_get_path(node);</span></span> |
| <span id="L459"><span class="lineNum"> 459</span> :<span class="tlaUNC"> 0 : prerror("Duplicate property \"%s\" in node %s\n",</span></span> |
| <span id="L460"><span class="lineNum"> 460</span> : : name, path);</span> |
| <span id="L461"><span class="lineNum"> 461</span> :<span class="tlaUNC"> 0 : free(path);</span></span> |
| <span id="L462"><span class="lineNum"> 462</span> :<span class="tlaUNC"> 0 : abort();</span></span> |
| <span id="L463"><span class="lineNum"> 463</span> : : </span> |
| <span id="L464"><span class="lineNum"> 464</span> : : }</span> |
| <span id="L465"><span class="lineNum"> 465</span> : : </span> |
| <span id="L466"><span class="lineNum"> 466</span> :<span class="tlaGNC tlaBgGNC"> 2736 : p->name = take_name(name);</span></span> |
| <span id="L467"><span class="lineNum"> 467</span> :<span class="tlaGNC"> 2736 : p->len = size;</span></span> |
| <span id="L468"><span class="lineNum"> 468</span> :<span class="tlaGNC"> 2736 : list_add_tail(&node->properties, &p->list);</span></span> |
| <span id="L469"><span class="lineNum"> 469</span> :<span class="tlaGNC"> 2736 : return p;</span></span> |
| <span id="L470"><span class="lineNum"> 470</span> : : }</span> |
| <span id="L471"><span class="lineNum"> 471</span> : : </span> |
| <span id="L472"><span class="lineNum"> 472</span> :<span class="tlaGNC"> 587 : struct dt_property *dt_add_property(struct dt_node *node,</span></span> |
| <span id="L473"><span class="lineNum"> 473</span> : : const char *name,</span> |
| <span id="L474"><span class="lineNum"> 474</span> : : const void *val, size_t size)</span> |
| <span id="L475"><span class="lineNum"> 475</span> : : {</span> |
| <span id="L476"><span class="lineNum"> 476</span> : : struct dt_property *p;</span> |
| <span id="L477"><span class="lineNum"> 477</span> : : </span> |
| <span id="L478"><span class="lineNum"> 478</span> : : /*</span> |
| <span id="L479"><span class="lineNum"> 479</span> : : * Filter out phandle properties, we re-generate them</span> |
| <span id="L480"><span class="lineNum"> 480</span> : : * when flattening</span> |
| <span id="L481"><span class="lineNum"> 481</span> : : */</span> |
| <span id="L482"><span class="lineNum"> 482</span> :<span class="tlaGNC"> 587 : if (strcmp(name, "linux,phandle") == 0 ||</span></span> |
| <span id="L483"><span class="lineNum"> 483</span> :<span class="tlaGNC"> 587 : strcmp(name, "phandle") == 0) {</span></span> |
| <span id="L484"><span class="lineNum"> 484</span> :<span class="tlaGNC"> 9 : assert(size == 4);</span></span> |
| <span id="L485"><span class="lineNum"> 485</span> :<span class="tlaGNC"> 9 : node->phandle = *(const u32 *)val;</span></span> |
| <span id="L486"><span class="lineNum"> 486</span> :<span class="tlaGNC"> 9 : if (node->phandle >= last_phandle)</span></span> |
| <span id="L487"><span class="lineNum"> 487</span> :<span class="tlaGNC"> 4 : set_last_phandle(node->phandle);</span></span> |
| <span id="L488"><span class="lineNum"> 488</span> :<span class="tlaGNC"> 9 : return NULL;</span></span> |
| <span id="L489"><span class="lineNum"> 489</span> : : }</span> |
| <span id="L490"><span class="lineNum"> 490</span> : : </span> |
| <span id="L491"><span class="lineNum"> 491</span> :<span class="tlaGNC"> 578 : p = new_property(node, name, size);</span></span> |
| <span id="L492"><span class="lineNum"> 492</span> :<span class="tlaGNC"> 578 : if (size)</span></span> |
| <span id="L493"><span class="lineNum"> 493</span> :<span class="tlaGNC"> 413 : memcpy(p->prop, val, size);</span></span> |
| <span id="L494"><span class="lineNum"> 494</span> :<span class="tlaGNC"> 578 : return p;</span></span> |
| <span id="L495"><span class="lineNum"> 495</span> : : }</span> |
| <span id="L496"><span class="lineNum"> 496</span> : : </span> |
| <span id="L497"><span class="lineNum"> 497</span> :<span class="tlaGNC"> 112 : void dt_resize_property(struct dt_property **prop, size_t len)</span></span> |
| <span id="L498"><span class="lineNum"> 498</span> : : {</span> |
| <span id="L499"><span class="lineNum"> 499</span> :<span class="tlaGNC"> 112 : size_t new_len = sizeof(**prop) + len;</span></span> |
| <span id="L500"><span class="lineNum"> 500</span> : : </span> |
| <span id="L501"><span class="lineNum"> 501</span> :<span class="tlaGNC"> 112 : *prop = realloc(*prop, new_len);</span></span> |
| <span id="L502"><span class="lineNum"> 502</span> :<span class="tlaGNC"> 112 : (*prop)->len = len;</span></span> |
| <span id="L503"><span class="lineNum"> 503</span> : : </span> |
| <span id="L504"><span class="lineNum"> 504</span> : : /* Fix up linked lists in case we moved. (note: not an empty list). */</span> |
| <span id="L505"><span class="lineNum"> 505</span> :<span class="tlaGNC"> 112 : (*prop)->list.next->prev = &(*prop)->list;</span></span> |
| <span id="L506"><span class="lineNum"> 506</span> :<span class="tlaGNC"> 112 : (*prop)->list.prev->next = &(*prop)->list;</span></span> |
| <span id="L507"><span class="lineNum"> 507</span> :<span class="tlaGNC"> 112 : }</span></span> |
| <span id="L508"><span class="lineNum"> 508</span> : : </span> |
| <span id="L509"><span class="lineNum"> 509</span> :<span class="tlaGNC"> 275 : struct dt_property *dt_add_property_string(struct dt_node *node,</span></span> |
| <span id="L510"><span class="lineNum"> 510</span> : : const char *name,</span> |
| <span id="L511"><span class="lineNum"> 511</span> : : const char *value)</span> |
| <span id="L512"><span class="lineNum"> 512</span> : : {</span> |
| <span id="L513"><span class="lineNum"> 513</span> :<span class="tlaGNC"> 275 : size_t len = 0;</span></span> |
| <span id="L514"><span class="lineNum"> 514</span> :<span class="tlaGNC"> 275 : if (value)</span></span> |
| <span id="L515"><span class="lineNum"> 515</span> :<span class="tlaGNC"> 275 : len = strlen(value) + 1;</span></span> |
| <span id="L516"><span class="lineNum"> 516</span> :<span class="tlaGNC"> 275 : return dt_add_property(node, name, value, len);</span></span> |
| <span id="L517"><span class="lineNum"> 517</span> : : }</span> |
| <span id="L518"><span class="lineNum"> 518</span> : : </span> |
| <span id="L519"><span class="lineNum"> 519</span> :<span class="tlaGNC"> 3 : struct dt_property *dt_add_property_nstr(struct dt_node *node,</span></span> |
| <span id="L520"><span class="lineNum"> 520</span> : : const char *name,</span> |
| <span id="L521"><span class="lineNum"> 521</span> : : const char *value, unsigned int vlen)</span> |
| <span id="L522"><span class="lineNum"> 522</span> : : {</span> |
| <span id="L523"><span class="lineNum"> 523</span> : : struct dt_property *p;</span> |
| <span id="L524"><span class="lineNum"> 524</span> :<span class="tlaGNC"> 3 : char *tmp = zalloc(vlen + 1);</span></span> |
| <span id="L525"><span class="lineNum"> 525</span> : : </span> |
| <span id="L526"><span class="lineNum"> 526</span> :<span class="tlaGNC"> 3 : if (!tmp)</span></span> |
| <span id="L527"><span class="lineNum"> 527</span> :<span class="tlaUNC tlaBgUNC"> 0 : return NULL;</span></span> |
| <span id="L528"><span class="lineNum"> 528</span> : : </span> |
| <span id="L529"><span class="lineNum"> 529</span> :<span class="tlaGNC tlaBgGNC"> 3 : strncpy(tmp, value, vlen);</span></span> |
| <span id="L530"><span class="lineNum"> 530</span> :<span class="tlaGNC"> 3 : p = dt_add_property(node, name, tmp, strlen(tmp)+1);</span></span> |
| <span id="L531"><span class="lineNum"> 531</span> :<span class="tlaGNC"> 3 : free(tmp);</span></span> |
| <span id="L532"><span class="lineNum"> 532</span> : : </span> |
| <span id="L533"><span class="lineNum"> 533</span> :<span class="tlaGNC"> 3 : return p;</span></span> |
| <span id="L534"><span class="lineNum"> 534</span> : : }</span> |
| <span id="L535"><span class="lineNum"> 535</span> : : </span> |
| <span id="L536"><span class="lineNum"> 536</span> :<span class="tlaGNC"> 2109 : struct dt_property *__dt_add_property_cells(struct dt_node *node,</span></span> |
| <span id="L537"><span class="lineNum"> 537</span> : : const char *name,</span> |
| <span id="L538"><span class="lineNum"> 538</span> : : int count, ...)</span> |
| <span id="L539"><span class="lineNum"> 539</span> : : {</span> |
| <span id="L540"><span class="lineNum"> 540</span> : : struct dt_property *p;</span> |
| <span id="L541"><span class="lineNum"> 541</span> : : fdt32_t *val;</span> |
| <span id="L542"><span class="lineNum"> 542</span> : : unsigned int i;</span> |
| <span id="L543"><span class="lineNum"> 543</span> : : va_list args;</span> |
| <span id="L544"><span class="lineNum"> 544</span> : : </span> |
| <span id="L545"><span class="lineNum"> 545</span> :<span class="tlaGNC"> 2109 : p = new_property(node, name, count * sizeof(u32));</span></span> |
| <span id="L546"><span class="lineNum"> 546</span> :<span class="tlaGNC"> 2109 : val = (fdt32_t *)p->prop;</span></span> |
| <span id="L547"><span class="lineNum"> 547</span> :<span class="tlaGNC"> 2109 : va_start(args, count);</span></span> |
| <span id="L548"><span class="lineNum"> 548</span> :<span class="tlaGNC"> 4482 : for (i = 0; i < count; i++)</span></span> |
| <span id="L549"><span class="lineNum"> 549</span> :<span class="tlaGNC"> 2373 : val[i] = cpu_to_fdt32(va_arg(args, u32));</span></span> |
| <span id="L550"><span class="lineNum"> 550</span> :<span class="tlaGNC"> 2109 : va_end(args);</span></span> |
| <span id="L551"><span class="lineNum"> 551</span> :<span class="tlaGNC"> 2109 : return p;</span></span> |
| <span id="L552"><span class="lineNum"> 552</span> : : }</span> |
| <span id="L553"><span class="lineNum"> 553</span> : : </span> |
| <span id="L554"><span class="lineNum"> 554</span> :<span class="tlaGNC"> 18 : struct dt_property *__dt_add_property_u64s(struct dt_node *node,</span></span> |
| <span id="L555"><span class="lineNum"> 555</span> : : const char *name,</span> |
| <span id="L556"><span class="lineNum"> 556</span> : : int count, ...)</span> |
| <span id="L557"><span class="lineNum"> 557</span> : : {</span> |
| <span id="L558"><span class="lineNum"> 558</span> : : struct dt_property *p;</span> |
| <span id="L559"><span class="lineNum"> 559</span> : : fdt64_t *val;</span> |
| <span id="L560"><span class="lineNum"> 560</span> : : unsigned int i;</span> |
| <span id="L561"><span class="lineNum"> 561</span> : : va_list args;</span> |
| <span id="L562"><span class="lineNum"> 562</span> : : </span> |
| <span id="L563"><span class="lineNum"> 563</span> :<span class="tlaGNC"> 18 : p = new_property(node, name, count * sizeof(u64));</span></span> |
| <span id="L564"><span class="lineNum"> 564</span> :<span class="tlaGNC"> 18 : val = (fdt64_t *)p->prop;</span></span> |
| <span id="L565"><span class="lineNum"> 565</span> :<span class="tlaGNC"> 18 : va_start(args, count);</span></span> |
| <span id="L566"><span class="lineNum"> 566</span> :<span class="tlaGNC"> 62 : for (i = 0; i < count; i++)</span></span> |
| <span id="L567"><span class="lineNum"> 567</span> :<span class="tlaGNC"> 44 : val[i] = cpu_to_fdt64(va_arg(args, u64));</span></span> |
| <span id="L568"><span class="lineNum"> 568</span> :<span class="tlaGNC"> 18 : va_end(args);</span></span> |
| <span id="L569"><span class="lineNum"> 569</span> :<span class="tlaGNC"> 18 : return p;</span></span> |
| <span id="L570"><span class="lineNum"> 570</span> : : }</span> |
| <span id="L571"><span class="lineNum"> 571</span> : : </span> |
| <span id="L572"><span class="lineNum"> 572</span> :<span class="tlaGNC"> 31 : struct dt_property *__dt_add_property_strings(struct dt_node *node,</span></span> |
| <span id="L573"><span class="lineNum"> 573</span> : : const char *name,</span> |
| <span id="L574"><span class="lineNum"> 574</span> : : int count, ...)</span> |
| <span id="L575"><span class="lineNum"> 575</span> : : {</span> |
| <span id="L576"><span class="lineNum"> 576</span> : : struct dt_property *p;</span> |
| <span id="L577"><span class="lineNum"> 577</span> : : unsigned int i, size;</span> |
| <span id="L578"><span class="lineNum"> 578</span> : : va_list args;</span> |
| <span id="L579"><span class="lineNum"> 579</span> : : const char *sstr;</span> |
| <span id="L580"><span class="lineNum"> 580</span> : : char *s;</span> |
| <span id="L581"><span class="lineNum"> 581</span> : : </span> |
| <span id="L582"><span class="lineNum"> 582</span> :<span class="tlaGNC"> 31 : va_start(args, count);</span></span> |
| <span id="L583"><span class="lineNum"> 583</span> :<span class="tlaGNC"> 82 : for (i = size = 0; i < count; i++) {</span></span> |
| <span id="L584"><span class="lineNum"> 584</span> :<span class="tlaGNC"> 51 : sstr = va_arg(args, const char *);</span></span> |
| <span id="L585"><span class="lineNum"> 585</span> :<span class="tlaGNC"> 51 : if (sstr)</span></span> |
| <span id="L586"><span class="lineNum"> 586</span> :<span class="tlaGNC"> 51 : size += strlen(sstr) + 1;</span></span> |
| <span id="L587"><span class="lineNum"> 587</span> : : }</span> |
| <span id="L588"><span class="lineNum"> 588</span> :<span class="tlaGNC"> 31 : va_end(args);</span></span> |
| <span id="L589"><span class="lineNum"> 589</span> :<span class="tlaGNC"> 31 : if (!size)</span></span> |
| <span id="L590"><span class="lineNum"> 590</span> :<span class="tlaUNC tlaBgUNC"> 0 : size = 1;</span></span> |
| <span id="L591"><span class="lineNum"> 591</span> :<span class="tlaGNC tlaBgGNC"> 31 : p = new_property(node, name, size);</span></span> |
| <span id="L592"><span class="lineNum"> 592</span> :<span class="tlaGNC"> 31 : s = (char *)p->prop;</span></span> |
| <span id="L593"><span class="lineNum"> 593</span> :<span class="tlaGNC"> 31 : *s = 0;</span></span> |
| <span id="L594"><span class="lineNum"> 594</span> :<span class="tlaGNC"> 31 : va_start(args, count);</span></span> |
| <span id="L595"><span class="lineNum"> 595</span> :<span class="tlaGNC"> 82 : for (i = 0; i < count; i++) { </span></span> |
| <span id="L596"><span class="lineNum"> 596</span> :<span class="tlaGNC"> 51 : sstr = va_arg(args, const char *);</span></span> |
| <span id="L597"><span class="lineNum"> 597</span> :<span class="tlaGNC"> 51 : if (sstr) {</span></span> |
| <span id="L598"><span class="lineNum"> 598</span> :<span class="tlaGNC"> 51 : strcpy(s, sstr);</span></span> |
| <span id="L599"><span class="lineNum"> 599</span> :<span class="tlaGNC"> 51 : s = s + strlen(sstr) + 1;</span></span> |
| <span id="L600"><span class="lineNum"> 600</span> : : }</span> |
| <span id="L601"><span class="lineNum"> 601</span> : : }</span> |
| <span id="L602"><span class="lineNum"> 602</span> :<span class="tlaGNC"> 31 : va_end(args);</span></span> |
| <span id="L603"><span class="lineNum"> 603</span> :<span class="tlaGNC"> 31 : return p;</span></span> |
| <span id="L604"><span class="lineNum"> 604</span> : : }</span> |
| <span id="L605"><span class="lineNum"> 605</span> : : </span> |
| <span id="L606"><span class="lineNum"> 606</span> :<span class="tlaGNC"> 1 : void dt_del_property(struct dt_node *node, struct dt_property *prop)</span></span> |
| <span id="L607"><span class="lineNum"> 607</span> : : {</span> |
| <span id="L608"><span class="lineNum"> 608</span> :<span class="tlaGNC"> 1 : list_del_from(&node->properties, &prop->list);</span></span> |
| <span id="L609"><span class="lineNum"> 609</span> :<span class="tlaGNC"> 1 : free_name(prop->name);</span></span> |
| <span id="L610"><span class="lineNum"> 610</span> :<span class="tlaGNC"> 1 : free(prop);</span></span> |
| <span id="L611"><span class="lineNum"> 611</span> :<span class="tlaGNC"> 1 : }</span></span> |
| <span id="L612"><span class="lineNum"> 612</span> : : </span> |
| <span id="L613"><span class="lineNum"> 613</span> :<span class="tlaGNC"> 134 : u32 dt_property_get_cell(const struct dt_property *prop, u32 index)</span></span> |
| <span id="L614"><span class="lineNum"> 614</span> : : {</span> |
| <span id="L615"><span class="lineNum"> 615</span> :<span class="tlaGNC"> 134 : assert(prop->len >= (index+1)*sizeof(u32));</span></span> |
| <span id="L616"><span class="lineNum"> 616</span> : : /* Always aligned, so this works. */</span> |
| <span id="L617"><span class="lineNum"> 617</span> :<span class="tlaGNC"> 134 : return fdt32_to_cpu(((const fdt32_t *)prop->prop)[index]);</span></span> |
| <span id="L618"><span class="lineNum"> 618</span> : : }</span> |
| <span id="L619"><span class="lineNum"> 619</span> : : </span> |
| <span id="L620"><span class="lineNum"> 620</span> :<span class="tlaUNC tlaBgUNC"> 0 : u64 dt_property_get_u64(const struct dt_property *prop, u32 index)</span></span> |
| <span id="L621"><span class="lineNum"> 621</span> : : {</span> |
| <span id="L622"><span class="lineNum"> 622</span> :<span class="tlaUNC"> 0 : assert(prop->len >= (index+1)*sizeof(u64));</span></span> |
| <span id="L623"><span class="lineNum"> 623</span> : : /* Always aligned, so this works. */</span> |
| <span id="L624"><span class="lineNum"> 624</span> :<span class="tlaUNC"> 0 : return fdt64_to_cpu(((const fdt64_t *)prop->prop)[index]);</span></span> |
| <span id="L625"><span class="lineNum"> 625</span> : : }</span> |
| <span id="L626"><span class="lineNum"> 626</span> : : </span> |
| <span id="L627"><span class="lineNum"> 627</span> :<span class="tlaGNC tlaBgGNC"> 125 : void dt_property_set_cell(struct dt_property *prop, u32 index, u32 val)</span></span> |
| <span id="L628"><span class="lineNum"> 628</span> : : {</span> |
| <span id="L629"><span class="lineNum"> 629</span> :<span class="tlaGNC"> 125 : assert(prop->len >= (index+1)*sizeof(u32));</span></span> |
| <span id="L630"><span class="lineNum"> 630</span> : : /* Always aligned, so this works. */</span> |
| <span id="L631"><span class="lineNum"> 631</span> :<span class="tlaGNC"> 125 : ((fdt32_t *)prop->prop)[index] = cpu_to_fdt32(val);</span></span> |
| <span id="L632"><span class="lineNum"> 632</span> :<span class="tlaGNC"> 125 : }</span></span> |
| <span id="L633"><span class="lineNum"> 633</span> : : </span> |
| <span id="L634"><span class="lineNum"> 634</span> : : /* First child of this node. */</span> |
| <span id="L635"><span class="lineNum"> 635</span> :<span class="tlaGNC"> 324 : struct dt_node *dt_first(const struct dt_node *root)</span></span> |
| <span id="L636"><span class="lineNum"> 636</span> : : {</span> |
| <span id="L637"><span class="lineNum"> 637</span> :<span class="tlaGNC"> 324 : return list_top(&root->children, struct dt_node, list);</span></span> |
| <span id="L638"><span class="lineNum"> 638</span> : : }</span> |
| <span id="L639"><span class="lineNum"> 639</span> : : </span> |
| <span id="L640"><span class="lineNum"> 640</span> : : /* Return next node, or NULL. */</span> |
| <span id="L641"><span class="lineNum"> 641</span> :<span class="tlaGNC"> 4339 : struct dt_node *dt_next(const struct dt_node *root,</span></span> |
| <span id="L642"><span class="lineNum"> 642</span> : : const struct dt_node *prev)</span> |
| <span id="L643"><span class="lineNum"> 643</span> : : {</span> |
| <span id="L644"><span class="lineNum"> 644</span> :<span class="tlaGNC"> 4339 : if (!prev) {</span></span> |
| <span id="L645"><span class="lineNum"> 645</span> :<span class="tlaGNC"> 12 : struct dt_node *first = dt_first(root);</span></span> |
| <span id="L646"><span class="lineNum"> 646</span> : : </span> |
| <span id="L647"><span class="lineNum"> 647</span> :<span class="tlaGNC"> 12 : if (!first)</span></span> |
| <span id="L648"><span class="lineNum"> 648</span> :<span class="tlaUNC tlaBgUNC"> 0 : return NULL;</span></span> |
| <span id="L649"><span class="lineNum"> 649</span> : : else</span> |
| <span id="L650"><span class="lineNum"> 650</span> :<span class="tlaGNC tlaBgGNC"> 12 : return first;</span></span> |
| <span id="L651"><span class="lineNum"> 651</span> : : }</span> |
| <span id="L652"><span class="lineNum"> 652</span> : : </span> |
| <span id="L653"><span class="lineNum"> 653</span> : : /* Children? */</span> |
| <span id="L654"><span class="lineNum"> 654</span> :<span class="tlaGNC"> 4327 : if (!list_empty(&prev->children))</span></span> |
| <span id="L655"><span class="lineNum"> 655</span> :<span class="tlaGNC"> 133 : return dt_first(prev);</span></span> |
| <span id="L656"><span class="lineNum"> 656</span> : : </span> |
| <span id="L657"><span class="lineNum"> 657</span> : : do {</span> |
| <span id="L658"><span class="lineNum"> 658</span> : : /* More siblings? */</span> |
| <span id="L659"><span class="lineNum"> 659</span> :<span class="tlaGNC"> 4325 : if (prev->list.next != &prev->parent->children.n)</span></span> |
| <span id="L660"><span class="lineNum"> 660</span> :<span class="tlaGNC"> 4136 : return list_entry(prev->list.next, struct dt_node,list);</span></span> |
| <span id="L661"><span class="lineNum"> 661</span> : : </span> |
| <span id="L662"><span class="lineNum"> 662</span> : : /* No more siblings, move up to parent. */</span> |
| <span id="L663"><span class="lineNum"> 663</span> :<span class="tlaGNC"> 189 : prev = prev->parent;</span></span> |
| <span id="L664"><span class="lineNum"> 664</span> :<span class="tlaGNC"> 189 : } while (prev != root);</span></span> |
| <span id="L665"><span class="lineNum"> 665</span> : : </span> |
| <span id="L666"><span class="lineNum"> 666</span> :<span class="tlaGNC"> 58 : return NULL;</span></span> |
| <span id="L667"><span class="lineNum"> 667</span> : : }</span> |
| <span id="L668"><span class="lineNum"> 668</span> : : </span> |
| <span id="L669"><span class="lineNum"> 669</span> :<span class="tlaGNC"> 518 : struct dt_property *__dt_find_property(struct dt_node *node, const char *name)</span></span> |
| <span id="L670"><span class="lineNum"> 670</span> : : {</span> |
| <span id="L671"><span class="lineNum"> 671</span> : : struct dt_property *i;</span> |
| <span id="L672"><span class="lineNum"> 672</span> : : </span> |
| <span id="L673"><span class="lineNum"> 673</span> :<span class="tlaGNC"> 2947 : list_for_each(&node->properties, i, list)</span></span> |
| <span id="L674"><span class="lineNum"> 674</span> :<span class="tlaGNC"> 2543 : if (strcmp(i->name, name) == 0)</span></span> |
| <span id="L675"><span class="lineNum"> 675</span> :<span class="tlaGNC"> 114 : return i;</span></span> |
| <span id="L676"><span class="lineNum"> 676</span> :<span class="tlaGNC"> 404 : return NULL;</span></span> |
| <span id="L677"><span class="lineNum"> 677</span> : : }</span> |
| <span id="L678"><span class="lineNum"> 678</span> : : </span> |
| <span id="L679"><span class="lineNum"> 679</span> :<span class="tlaGNC"> 4126 : const struct dt_property *dt_find_property(const struct dt_node *node,</span></span> |
| <span id="L680"><span class="lineNum"> 680</span> : : const char *name)</span> |
| <span id="L681"><span class="lineNum"> 681</span> : : {</span> |
| <span id="L682"><span class="lineNum"> 682</span> : : const struct dt_property *i;</span> |
| <span id="L683"><span class="lineNum"> 683</span> : : </span> |
| <span id="L684"><span class="lineNum"> 684</span> :<span class="tlaGNC"> 22750 : list_for_each(&node->properties, i, list)</span></span> |
| <span id="L685"><span class="lineNum"> 685</span> :<span class="tlaGNC"> 19036 : if (strcmp(i->name, name) == 0)</span></span> |
| <span id="L686"><span class="lineNum"> 686</span> :<span class="tlaGNC"> 412 : return i;</span></span> |
| <span id="L687"><span class="lineNum"> 687</span> :<span class="tlaGNC"> 3714 : return NULL;</span></span> |
| <span id="L688"><span class="lineNum"> 688</span> : : }</span> |
| <span id="L689"><span class="lineNum"> 689</span> : : </span> |
| <span id="L690"><span class="lineNum"> 690</span> :<span class="tlaUNC tlaBgUNC"> 0 : void dt_check_del_prop(struct dt_node *node, const char *name)</span></span> |
| <span id="L691"><span class="lineNum"> 691</span> : : {</span> |
| <span id="L692"><span class="lineNum"> 692</span> : : struct dt_property *p;</span> |
| <span id="L693"><span class="lineNum"> 693</span> : : </span> |
| <span id="L694"><span class="lineNum"> 694</span> :<span class="tlaUNC"> 0 : p = __dt_find_property(node, name);</span></span> |
| <span id="L695"><span class="lineNum"> 695</span> :<span class="tlaUNC"> 0 : if (p)</span></span> |
| <span id="L696"><span class="lineNum"> 696</span> :<span class="tlaUNC"> 0 : dt_del_property(node, p);</span></span> |
| <span id="L697"><span class="lineNum"> 697</span> :<span class="tlaUNC"> 0 : }</span></span> |
| <span id="L698"><span class="lineNum"> 698</span> :<span class="tlaGNC tlaBgGNC"> 55 : const struct dt_property *dt_require_property(const struct dt_node *node,</span></span> |
| <span id="L699"><span class="lineNum"> 699</span> : : const char *name, int wanted_len)</span> |
| <span id="L700"><span class="lineNum"> 700</span> : : {</span> |
| <span id="L701"><span class="lineNum"> 701</span> :<span class="tlaGNC"> 55 : const struct dt_property *p = dt_find_property(node, name);</span></span> |
| <span id="L702"><span class="lineNum"> 702</span> : : </span> |
| <span id="L703"><span class="lineNum"> 703</span> :<span class="tlaGNC"> 55 : if (!p) {</span></span> |
| <span id="L704"><span class="lineNum"> 704</span> :<span class="tlaUNC tlaBgUNC"> 0 : const char *path = dt_get_path(node);</span></span> |
| <span id="L705"><span class="lineNum"> 705</span> : : </span> |
| <span id="L706"><span class="lineNum"> 706</span> :<span class="tlaUNC"> 0 : prerror("DT: Missing required property %s/%s\n",</span></span> |
| <span id="L707"><span class="lineNum"> 707</span> : : path, name);</span> |
| <span id="L708"><span class="lineNum"> 708</span> :<span class="tlaUNC"> 0 : assert(false);</span></span> |
| <span id="L709"><span class="lineNum"> 709</span> : : }</span> |
| <span id="L710"><span class="lineNum"> 710</span> :<span class="tlaGNC tlaBgGNC"> 55 : if (wanted_len >= 0 && p->len != wanted_len) {</span></span> |
| <span id="L711"><span class="lineNum"> 711</span> :<span class="tlaUNC tlaBgUNC"> 0 : const char *path = dt_get_path(node);</span></span> |
| <span id="L712"><span class="lineNum"> 712</span> : : </span> |
| <span id="L713"><span class="lineNum"> 713</span> :<span class="tlaUNC"> 0 : prerror("DT: Unexpected property length %s/%s\n",</span></span> |
| <span id="L714"><span class="lineNum"> 714</span> : : path, name);</span> |
| <span id="L715"><span class="lineNum"> 715</span> :<span class="tlaUNC"> 0 : prerror("DT: Expected len: %d got len: %zu\n",</span></span> |
| <span id="L716"><span class="lineNum"> 716</span> : : wanted_len, p->len);</span> |
| <span id="L717"><span class="lineNum"> 717</span> :<span class="tlaUNC"> 0 : assert(false);</span></span> |
| <span id="L718"><span class="lineNum"> 718</span> : : }</span> |
| <span id="L719"><span class="lineNum"> 719</span> : : </span> |
| <span id="L720"><span class="lineNum"> 720</span> :<span class="tlaGNC tlaBgGNC"> 55 : return p;</span></span> |
| <span id="L721"><span class="lineNum"> 721</span> : : }</span> |
| <span id="L722"><span class="lineNum"> 722</span> : : </span> |
| <span id="L723"><span class="lineNum"> 723</span> :<span class="tlaGNC"> 289 : bool dt_has_node_property(const struct dt_node *node,</span></span> |
| <span id="L724"><span class="lineNum"> 724</span> : : const char *name, const char *val)</span> |
| <span id="L725"><span class="lineNum"> 725</span> : : {</span> |
| <span id="L726"><span class="lineNum"> 726</span> :<span class="tlaGNC"> 289 : const struct dt_property *p = dt_find_property(node, name);</span></span> |
| <span id="L727"><span class="lineNum"> 727</span> : : </span> |
| <span id="L728"><span class="lineNum"> 728</span> :<span class="tlaGNC"> 289 : if (!p)</span></span> |
| <span id="L729"><span class="lineNum"> 729</span> :<span class="tlaGNC"> 172 : return false;</span></span> |
| <span id="L730"><span class="lineNum"> 730</span> :<span class="tlaGNC"> 117 : if (!val)</span></span> |
| <span id="L731"><span class="lineNum"> 731</span> :<span class="tlaUNC tlaBgUNC"> 0 : return true;</span></span> |
| <span id="L732"><span class="lineNum"> 732</span> : : </span> |
| <span id="L733"><span class="lineNum"> 733</span> :<span class="tlaGNC tlaBgGNC"> 117 : return p->len == strlen(val) + 1 && memcmp(p->prop, val, p->len) == 0;</span></span> |
| <span id="L734"><span class="lineNum"> 734</span> : : }</span> |
| <span id="L735"><span class="lineNum"> 735</span> : : </span> |
| <span id="L736"><span class="lineNum"> 736</span> :<span class="tlaGNC"> 448 : bool dt_prop_find_string(const struct dt_property *p, const char *s)</span></span> |
| <span id="L737"><span class="lineNum"> 737</span> : : {</span> |
| <span id="L738"><span class="lineNum"> 738</span> : : const char *c, *end;</span> |
| <span id="L739"><span class="lineNum"> 739</span> : : </span> |
| <span id="L740"><span class="lineNum"> 740</span> :<span class="tlaGNC"> 448 : if (!p)</span></span> |
| <span id="L741"><span class="lineNum"> 741</span> :<span class="tlaGNC"> 350 : return false;</span></span> |
| <span id="L742"><span class="lineNum"> 742</span> :<span class="tlaGNC"> 98 : c = p->prop;</span></span> |
| <span id="L743"><span class="lineNum"> 743</span> :<span class="tlaGNC"> 98 : end = c + p->len;</span></span> |
| <span id="L744"><span class="lineNum"> 744</span> : : </span> |
| <span id="L745"><span class="lineNum"> 745</span> :<span class="tlaGNC"> 234 : while(c < end) {</span></span> |
| <span id="L746"><span class="lineNum"> 746</span> :<span class="tlaGNC"> 160 : if (!strcasecmp(s, c))</span></span> |
| <span id="L747"><span class="lineNum"> 747</span> :<span class="tlaGNC"> 24 : return true;</span></span> |
| <span id="L748"><span class="lineNum"> 748</span> :<span class="tlaGNC"> 136 : c += strlen(c) + 1;</span></span> |
| <span id="L749"><span class="lineNum"> 749</span> : : }</span> |
| <span id="L750"><span class="lineNum"> 750</span> :<span class="tlaGNC"> 74 : return false;</span></span> |
| <span id="L751"><span class="lineNum"> 751</span> : : }</span> |
| <span id="L752"><span class="lineNum"> 752</span> : : </span> |
| <span id="L753"><span class="lineNum"> 753</span> :<span class="tlaGNC"> 444 : bool dt_node_is_compatible(const struct dt_node *node, const char *compat)</span></span> |
| <span id="L754"><span class="lineNum"> 754</span> : : {</span> |
| <span id="L755"><span class="lineNum"> 755</span> :<span class="tlaGNC"> 444 : const struct dt_property *p = dt_find_property(node, "compatible");</span></span> |
| <span id="L756"><span class="lineNum"> 756</span> : : </span> |
| <span id="L757"><span class="lineNum"> 757</span> :<span class="tlaGNC"> 444 : return dt_prop_find_string(p, compat);</span></span> |
| <span id="L758"><span class="lineNum"> 758</span> : : }</span> |
| <span id="L759"><span class="lineNum"> 759</span> : : </span> |
| <span id="L760"><span class="lineNum"> 760</span> :<span class="tlaGNC"> 19 : struct dt_node *dt_find_compatible_node(struct dt_node *root,</span></span> |
| <span id="L761"><span class="lineNum"> 761</span> : : struct dt_node *prev,</span> |
| <span id="L762"><span class="lineNum"> 762</span> : : const char *compat)</span> |
| <span id="L763"><span class="lineNum"> 763</span> : : {</span> |
| <span id="L764"><span class="lineNum"> 764</span> :<span class="tlaGNC"> 19 : struct dt_node *node = prev;</span></span> |
| <span id="L765"><span class="lineNum"> 765</span> : : </span> |
| <span id="L766"><span class="lineNum"> 766</span> :<span class="tlaGNC"> 431 : while ((node = dt_next(root, node)))</span></span> |
| <span id="L767"><span class="lineNum"> 767</span> :<span class="tlaGNC"> 428 : if (dt_node_is_compatible(node, compat))</span></span> |
| <span id="L768"><span class="lineNum"> 768</span> :<span class="tlaGNC"> 16 : return node;</span></span> |
| <span id="L769"><span class="lineNum"> 769</span> :<span class="tlaGNC"> 3 : return NULL;</span></span> |
| <span id="L770"><span class="lineNum"> 770</span> : : }</span> |
| <span id="L771"><span class="lineNum"> 771</span> : : </span> |
| <span id="L772"><span class="lineNum"> 772</span> :<span class="tlaGNC"> 1 : u64 dt_prop_get_u64(const struct dt_node *node, const char *prop)</span></span> |
| <span id="L773"><span class="lineNum"> 773</span> : : {</span> |
| <span id="L774"><span class="lineNum"> 774</span> :<span class="tlaGNC"> 1 : const struct dt_property *p = dt_require_property(node, prop, 8);</span></span> |
| <span id="L775"><span class="lineNum"> 775</span> : : </span> |
| <span id="L776"><span class="lineNum"> 776</span> :<span class="tlaGNC"> 1 : return ((u64)dt_property_get_cell(p, 0) << 32)</span></span> |
| <span id="L777"><span class="lineNum"> 777</span> :<span class="tlaGNC"> 1 : | dt_property_get_cell(p, 1);</span></span> |
| <span id="L778"><span class="lineNum"> 778</span> : : }</span> |
| <span id="L779"><span class="lineNum"> 779</span> : : </span> |
| <span id="L780"><span class="lineNum"> 780</span> :<span class="tlaGNC"> 4 : u64 dt_prop_get_u64_def(const struct dt_node *node, const char *prop, u64 def)</span></span> |
| <span id="L781"><span class="lineNum"> 781</span> : : {</span> |
| <span id="L782"><span class="lineNum"> 782</span> :<span class="tlaGNC"> 4 : const struct dt_property *p = dt_find_property(node, prop);</span></span> |
| <span id="L783"><span class="lineNum"> 783</span> : : </span> |
| <span id="L784"><span class="lineNum"> 784</span> :<span class="tlaGNC"> 4 : if (!p)</span></span> |
| <span id="L785"><span class="lineNum"> 785</span> :<span class="tlaGNC"> 1 : return def;</span></span> |
| <span id="L786"><span class="lineNum"> 786</span> : : </span> |
| <span id="L787"><span class="lineNum"> 787</span> :<span class="tlaGNC"> 3 : return ((u64)dt_property_get_cell(p, 0) << 32)</span></span> |
| <span id="L788"><span class="lineNum"> 788</span> :<span class="tlaGNC"> 3 : | dt_property_get_cell(p, 1);</span></span> |
| <span id="L789"><span class="lineNum"> 789</span> : : }</span> |
| <span id="L790"><span class="lineNum"> 790</span> : : </span> |
| <span id="L791"><span class="lineNum"> 791</span> :<span class="tlaGNC"> 5 : u32 dt_prop_get_u32(const struct dt_node *node, const char *prop)</span></span> |
| <span id="L792"><span class="lineNum"> 792</span> : : {</span> |
| <span id="L793"><span class="lineNum"> 793</span> :<span class="tlaGNC"> 5 : const struct dt_property *p = dt_require_property(node, prop, 4);</span></span> |
| <span id="L794"><span class="lineNum"> 794</span> : : </span> |
| <span id="L795"><span class="lineNum"> 795</span> :<span class="tlaGNC"> 5 : return dt_property_get_cell(p, 0);</span></span> |
| <span id="L796"><span class="lineNum"> 796</span> : : }</span> |
| <span id="L797"><span class="lineNum"> 797</span> : : </span> |
| <span id="L798"><span class="lineNum"> 798</span> :<span class="tlaGNC"> 86 : u32 dt_prop_get_u32_def(const struct dt_node *node, const char *prop, u32 def)</span></span> |
| <span id="L799"><span class="lineNum"> 799</span> : : {</span> |
| <span id="L800"><span class="lineNum"> 800</span> :<span class="tlaGNC"> 86 : const struct dt_property *p = dt_find_property(node, prop);</span></span> |
| <span id="L801"><span class="lineNum"> 801</span> : : </span> |
| <span id="L802"><span class="lineNum"> 802</span> :<span class="tlaGNC"> 86 : if (!p)</span></span> |
| <span id="L803"><span class="lineNum"> 803</span> :<span class="tlaGNC"> 5 : return def;</span></span> |
| <span id="L804"><span class="lineNum"> 804</span> : : </span> |
| <span id="L805"><span class="lineNum"> 805</span> :<span class="tlaGNC"> 81 : return dt_property_get_cell(p, 0);</span></span> |
| <span id="L806"><span class="lineNum"> 806</span> : : }</span> |
| <span id="L807"><span class="lineNum"> 807</span> : : </span> |
| <span id="L808"><span class="lineNum"> 808</span> :<span class="tlaGNC"> 5 : const void *dt_prop_get(const struct dt_node *node, const char *prop)</span></span> |
| <span id="L809"><span class="lineNum"> 809</span> : : {</span> |
| <span id="L810"><span class="lineNum"> 810</span> :<span class="tlaGNC"> 5 : const struct dt_property *p = dt_require_property(node, prop, -1);</span></span> |
| <span id="L811"><span class="lineNum"> 811</span> : : </span> |
| <span id="L812"><span class="lineNum"> 812</span> :<span class="tlaGNC"> 5 : return p->prop;</span></span> |
| <span id="L813"><span class="lineNum"> 813</span> : : }</span> |
| <span id="L814"><span class="lineNum"> 814</span> : : </span> |
| <span id="L815"><span class="lineNum"> 815</span> :<span class="tlaGNC"> 2 : const void *dt_prop_get_def(const struct dt_node *node, const char *prop,</span></span> |
| <span id="L816"><span class="lineNum"> 816</span> : : void *def)</span> |
| <span id="L817"><span class="lineNum"> 817</span> : : {</span> |
| <span id="L818"><span class="lineNum"> 818</span> :<span class="tlaGNC"> 2 : const struct dt_property *p = dt_find_property(node, prop);</span></span> |
| <span id="L819"><span class="lineNum"> 819</span> : : </span> |
| <span id="L820"><span class="lineNum"> 820</span> :<span class="tlaGNC"> 2 : return p ? p->prop : def;</span></span> |
| <span id="L821"><span class="lineNum"> 821</span> : : }</span> |
| <span id="L822"><span class="lineNum"> 822</span> : : </span> |
| <span id="L823"><span class="lineNum"> 823</span> :<span class="tlaGNC"> 2 : const void *dt_prop_get_def_size(const struct dt_node *node, const char *prop,</span></span> |
| <span id="L824"><span class="lineNum"> 824</span> : : void *def, size_t *len)</span> |
| <span id="L825"><span class="lineNum"> 825</span> : : {</span> |
| <span id="L826"><span class="lineNum"> 826</span> :<span class="tlaGNC"> 2 : const struct dt_property *p = dt_find_property(node, prop);</span></span> |
| <span id="L827"><span class="lineNum"> 827</span> :<span class="tlaGNC"> 2 : *len = 0;</span></span> |
| <span id="L828"><span class="lineNum"> 828</span> :<span class="tlaGNC"> 2 : if (p)</span></span> |
| <span id="L829"><span class="lineNum"> 829</span> :<span class="tlaGNC"> 1 : *len = p->len;</span></span> |
| <span id="L830"><span class="lineNum"> 830</span> : : </span> |
| <span id="L831"><span class="lineNum"> 831</span> :<span class="tlaGNC"> 2 : return p ? p->prop : def;</span></span> |
| <span id="L832"><span class="lineNum"> 832</span> : : }</span> |
| <span id="L833"><span class="lineNum"> 833</span> : : </span> |
| <span id="L834"><span class="lineNum"> 834</span> :<span class="tlaGNC"> 4 : u32 dt_prop_get_cell(const struct dt_node *node, const char *prop, u32 cell)</span></span> |
| <span id="L835"><span class="lineNum"> 835</span> : : {</span> |
| <span id="L836"><span class="lineNum"> 836</span> :<span class="tlaGNC"> 4 : const struct dt_property *p = dt_require_property(node, prop, -1);</span></span> |
| <span id="L837"><span class="lineNum"> 837</span> : : </span> |
| <span id="L838"><span class="lineNum"> 838</span> :<span class="tlaGNC"> 4 : return dt_property_get_cell(p, cell);</span></span> |
| <span id="L839"><span class="lineNum"> 839</span> : : }</span> |
| <span id="L840"><span class="lineNum"> 840</span> : : </span> |
| <span id="L841"><span class="lineNum"> 841</span> :<span class="tlaGNC"> 2 : u32 dt_prop_get_cell_def(const struct dt_node *node, const char *prop,</span></span> |
| <span id="L842"><span class="lineNum"> 842</span> : : u32 cell, u32 def)</span> |
| <span id="L843"><span class="lineNum"> 843</span> : : {</span> |
| <span id="L844"><span class="lineNum"> 844</span> :<span class="tlaGNC"> 2 : const struct dt_property *p = dt_find_property(node, prop);</span></span> |
| <span id="L845"><span class="lineNum"> 845</span> : : </span> |
| <span id="L846"><span class="lineNum"> 846</span> :<span class="tlaGNC"> 2 : if (!p)</span></span> |
| <span id="L847"><span class="lineNum"> 847</span> :<span class="tlaGNC"> 1 : return def;</span></span> |
| <span id="L848"><span class="lineNum"> 848</span> : : </span> |
| <span id="L849"><span class="lineNum"> 849</span> :<span class="tlaGNC"> 1 : return dt_property_get_cell(p, cell);</span></span> |
| <span id="L850"><span class="lineNum"> 850</span> : : }</span> |
| <span id="L851"><span class="lineNum"> 851</span> : : </span> |
| <span id="L852"><span class="lineNum"> 852</span> :<span class="tlaGNC"> 702 : void dt_free(struct dt_node *node)</span></span> |
| <span id="L853"><span class="lineNum"> 853</span> : : {</span> |
| <span id="L854"><span class="lineNum"> 854</span> : : struct dt_node *child;</span> |
| <span id="L855"><span class="lineNum"> 855</span> : : struct dt_property *p;</span> |
| <span id="L856"><span class="lineNum"> 856</span> : : </span> |
| <span id="L857"><span class="lineNum"> 857</span> :<span class="tlaGNC"> 1378 : while ((child = list_top(&node->children, struct dt_node, list)))</span></span> |
| <span id="L858"><span class="lineNum"> 858</span> :<span class="tlaGNC"> 676 : dt_free(child);</span></span> |
| <span id="L859"><span class="lineNum"> 859</span> : : </span> |
| <span id="L860"><span class="lineNum"> 860</span> :<span class="tlaGNC"> 3349 : while ((p = list_pop(&node->properties, struct dt_property, list))) {</span></span> |
| <span id="L861"><span class="lineNum"> 861</span> :<span class="tlaGNC"> 2647 : free_name(p->name);</span></span> |
| <span id="L862"><span class="lineNum"> 862</span> :<span class="tlaGNC"> 2647 : free(p);</span></span> |
| <span id="L863"><span class="lineNum"> 863</span> : : }</span> |
| <span id="L864"><span class="lineNum"> 864</span> : : </span> |
| <span id="L865"><span class="lineNum"> 865</span> :<span class="tlaGNC"> 702 : if (node->parent)</span></span> |
| <span id="L866"><span class="lineNum"> 866</span> :<span class="tlaGNC"> 677 : list_del_from(&node->parent->children, &node->list);</span></span> |
| <span id="L867"><span class="lineNum"> 867</span> :<span class="tlaGNC"> 702 : dt_destroy(node);</span></span> |
| <span id="L868"><span class="lineNum"> 868</span> :<span class="tlaGNC"> 702 : }</span></span> |
| <span id="L869"><span class="lineNum"> 869</span> : : </span> |
| <span id="L870"><span class="lineNum"> 870</span> :<span class="tlaGNC"> 8 : int dt_expand_node(struct dt_node *node, const void *fdt, int fdt_node)</span></span> |
| <span id="L871"><span class="lineNum"> 871</span> : : {</span> |
| <span id="L872"><span class="lineNum"> 872</span> : : const struct fdt_property *prop;</span> |
| <span id="L873"><span class="lineNum"> 873</span> : : int offset, nextoffset, err;</span> |
| <span id="L874"><span class="lineNum"> 874</span> : : struct dt_node *child;</span> |
| <span id="L875"><span class="lineNum"> 875</span> : : const char *name;</span> |
| <span id="L876"><span class="lineNum"> 876</span> : : uint32_t tag;</span> |
| <span id="L877"><span class="lineNum"> 877</span> : : </span> |
| <span id="L878"><span class="lineNum"> 878</span> :<span class="tlaGNC"> 8 : if (((err = fdt_check_header(fdt)) != 0)</span></span> |
| <span id="L879"><span class="lineNum"> 879</span> :<span class="tlaGNC"> 8 : || ((err = fdt_check_node_offset_(fdt, fdt_node)) < 0)) {</span></span> |
| <span id="L880"><span class="lineNum"> 880</span> :<span class="tlaUNC tlaBgUNC"> 0 : prerror("FDT: Error %d parsing node 0x%x\n", err, fdt_node);</span></span> |
| <span id="L881"><span class="lineNum"> 881</span> :<span class="tlaUNC"> 0 : return -1;</span></span> |
| <span id="L882"><span class="lineNum"> 882</span> : : }</span> |
| <span id="L883"><span class="lineNum"> 883</span> : : </span> |
| <span id="L884"><span class="lineNum"> 884</span> :<span class="tlaGNC tlaBgGNC"> 8 : nextoffset = err;</span></span> |
| <span id="L885"><span class="lineNum"> 885</span> : : do {</span> |
| <span id="L886"><span class="lineNum"> 886</span> :<span class="tlaGNC"> 47 : offset = nextoffset;</span></span> |
| <span id="L887"><span class="lineNum"> 887</span> : : </span> |
| <span id="L888"><span class="lineNum"> 888</span> :<span class="tlaGNC"> 47 : tag = fdt_next_tag(fdt, offset, &nextoffset);</span></span> |
| <span id="L889"><span class="lineNum"> 889</span> :<span class="tlaGNC"> 47 : switch (tag) {</span></span> |
| <span id="L890"><span class="lineNum"> 890</span> :<span class="tlaGNC"> 32 : case FDT_PROP:</span></span> |
| <span id="L891"><span class="lineNum"> 891</span> :<span class="tlaGNC"> 32 : prop = fdt_offset_ptr_(fdt, offset);</span></span> |
| <span id="L892"><span class="lineNum"> 892</span> :<span class="tlaGNC"> 32 : name = fdt_string(fdt, fdt32_to_cpu(prop->nameoff));</span></span> |
| <span id="L893"><span class="lineNum"> 893</span> :<span class="tlaGNC"> 32 : dt_add_property(node, name, prop->data,</span></span> |
| <span id="L894"><span class="lineNum"> 894</span> :<span class="tlaGNC"> 32 : fdt32_to_cpu(prop->len));</span></span> |
| <span id="L895"><span class="lineNum"> 895</span> :<span class="tlaGNC"> 32 : break;</span></span> |
| <span id="L896"><span class="lineNum"> 896</span> :<span class="tlaGNC"> 7 : case FDT_BEGIN_NODE:</span></span> |
| <span id="L897"><span class="lineNum"> 897</span> :<span class="tlaGNC"> 7 : name = fdt_get_name(fdt, offset, NULL);</span></span> |
| <span id="L898"><span class="lineNum"> 898</span> :<span class="tlaGNC"> 7 : child = dt_new_root(name);</span></span> |
| <span id="L899"><span class="lineNum"> 899</span> :<span class="tlaGNC"> 7 : assert(child);</span></span> |
| <span id="L900"><span class="lineNum"> 900</span> :<span class="tlaGNC"> 7 : nextoffset = dt_expand_node(child, fdt, offset);</span></span> |
| <span id="L901"><span class="lineNum"> 901</span> : : </span> |
| <span id="L902"><span class="lineNum"> 902</span> : : /*</span> |
| <span id="L903"><span class="lineNum"> 903</span> : : * This may fail in case of duplicate, keep it</span> |
| <span id="L904"><span class="lineNum"> 904</span> : : * going for now, we may ultimately want to</span> |
| <span id="L905"><span class="lineNum"> 905</span> : : * assert</span> |
| <span id="L906"><span class="lineNum"> 906</span> : : */</span> |
| <span id="L907"><span class="lineNum"> 907</span> :<span class="tlaGNC"> 7 : if (!dt_attach_root(node, child))</span></span> |
| <span id="L908"><span class="lineNum"> 908</span> : : /**</span> |
| <span id="L909"><span class="lineNum"> 909</span> : : * @fwts-label DTHasDuplicateNodeID</span> |
| <span id="L910"><span class="lineNum"> 910</span> : : * @fwts-advice OPAL will parse the Flattened</span> |
| <span id="L911"><span class="lineNum"> 911</span> : : * Device Tree(FDT), which can be generated</span> |
| <span id="L912"><span class="lineNum"> 912</span> : : * from different firmware sources. During</span> |
| <span id="L913"><span class="lineNum"> 913</span> : : * expansion of FDT, OPAL observed a node</span> |
| <span id="L914"><span class="lineNum"> 914</span> : : * assigned multiple times (a duplicate). This</span> |
| <span id="L915"><span class="lineNum"> 915</span> : : * indicates either a Hostboot bug *OR*, more</span> |
| <span id="L916"><span class="lineNum"> 916</span> : : * likely, a bug in the platform XML. Check</span> |
| <span id="L917"><span class="lineNum"> 917</span> : : * the platform XML for duplicate IDs for</span> |
| <span id="L918"><span class="lineNum"> 918</span> : : * this type of device. Because of this</span> |
| <span id="L919"><span class="lineNum"> 919</span> : : * duplicate node, OPAL won't add the hardware</span> |
| <span id="L920"><span class="lineNum"> 920</span> : : * device found with a duplicate node ID into</span> |
| <span id="L921"><span class="lineNum"> 921</span> : : * DT, rendering the corresponding device not</span> |
| <span id="L922"><span class="lineNum"> 922</span> : : * functional.</span> |
| <span id="L923"><span class="lineNum"> 923</span> : : */</span> |
| <span id="L924"><span class="lineNum"> 924</span> :<span class="tlaUNC tlaBgUNC"> 0 : prlog(PR_ERR, "DT: Found duplicate node: %s\n",</span></span> |
| <span id="L925"><span class="lineNum"> 925</span> : : child->name);</span> |
| <span id="L926"><span class="lineNum"> 926</span> :<span class="tlaGNC tlaBgGNC"> 7 : break;</span></span> |
| <span id="L927"><span class="lineNum"> 927</span> :<span class="tlaUNC tlaBgUNC"> 0 : case FDT_END:</span></span> |
| <span id="L928"><span class="lineNum"> 928</span> :<span class="tlaUNC"> 0 : return -1;</span></span> |
| <span id="L929"><span class="lineNum"> 929</span> : : }</span> |
| <span id="L930"><span class="lineNum"> 930</span> :<span class="tlaGNC tlaBgGNC"> 47 : } while (tag != FDT_END_NODE);</span></span> |
| <span id="L931"><span class="lineNum"> 931</span> : : </span> |
| <span id="L932"><span class="lineNum"> 932</span> :<span class="tlaGNC"> 8 : return nextoffset;</span></span> |
| <span id="L933"><span class="lineNum"> 933</span> : : }</span> |
| <span id="L934"><span class="lineNum"> 934</span> : : </span> |
| <span id="L935"><span class="lineNum"> 935</span> :<span class="tlaUNC tlaBgUNC"> 0 : void dt_expand(const void *fdt)</span></span> |
| <span id="L936"><span class="lineNum"> 936</span> : : {</span> |
| <span id="L937"><span class="lineNum"> 937</span> :<span class="tlaUNC"> 0 : prlog(PR_DEBUG, "FDT: Parsing fdt @%p\n", fdt);</span></span> |
| <span id="L938"><span class="lineNum"> 938</span> : : </span> |
| <span id="L939"><span class="lineNum"> 939</span> :<span class="tlaUNC"> 0 : if (dt_expand_node(dt_root, fdt, 0) < 0)</span></span> |
| <span id="L940"><span class="lineNum"> 940</span> :<span class="tlaUNC"> 0 : abort();</span></span> |
| <span id="L941"><span class="lineNum"> 941</span> :<span class="tlaUNC"> 0 : }</span></span> |
| <span id="L942"><span class="lineNum"> 942</span> : : </span> |
| <span id="L943"><span class="lineNum"> 943</span> :<span class="tlaGNC tlaBgGNC"> 97 : u64 dt_get_number(const void *pdata, unsigned int cells)</span></span> |
| <span id="L944"><span class="lineNum"> 944</span> : : {</span> |
| <span id="L945"><span class="lineNum"> 945</span> :<span class="tlaGNC"> 97 : const __be32 *p = pdata;</span></span> |
| <span id="L946"><span class="lineNum"> 946</span> :<span class="tlaGNC"> 97 : u64 ret = 0;</span></span> |
| <span id="L947"><span class="lineNum"> 947</span> : : </span> |
| <span id="L948"><span class="lineNum"> 948</span> :<span class="tlaGNC"> 273 : while(cells--)</span></span> |
| <span id="L949"><span class="lineNum"> 949</span> :<span class="tlaGNC"> 176 : ret = (ret << 32) | be32_to_cpu(*(p++));</span></span> |
| <span id="L950"><span class="lineNum"> 950</span> :<span class="tlaGNC"> 97 : return ret;</span></span> |
| <span id="L951"><span class="lineNum"> 951</span> : : }</span> |
| <span id="L952"><span class="lineNum"> 952</span> : : </span> |
| <span id="L953"><span class="lineNum"> 953</span> :<span class="tlaGNC"> 39 : u32 dt_n_address_cells(const struct dt_node *node)</span></span> |
| <span id="L954"><span class="lineNum"> 954</span> : : {</span> |
| <span id="L955"><span class="lineNum"> 955</span> :<span class="tlaGNC"> 39 : if (!node->parent)</span></span> |
| <span id="L956"><span class="lineNum"> 956</span> :<span class="tlaUNC tlaBgUNC"> 0 : return 0;</span></span> |
| <span id="L957"><span class="lineNum"> 957</span> :<span class="tlaGNC tlaBgGNC"> 39 : return dt_prop_get_u32_def(node->parent, "#address-cells", 2);</span></span> |
| <span id="L958"><span class="lineNum"> 958</span> : : }</span> |
| <span id="L959"><span class="lineNum"> 959</span> : : </span> |
| <span id="L960"><span class="lineNum"> 960</span> :<span class="tlaGNC"> 33 : u32 dt_n_size_cells(const struct dt_node *node)</span></span> |
| <span id="L961"><span class="lineNum"> 961</span> : : {</span> |
| <span id="L962"><span class="lineNum"> 962</span> :<span class="tlaGNC"> 33 : if (!node->parent)</span></span> |
| <span id="L963"><span class="lineNum"> 963</span> :<span class="tlaUNC tlaBgUNC"> 0 : return 0;</span></span> |
| <span id="L964"><span class="lineNum"> 964</span> :<span class="tlaGNC tlaBgGNC"> 33 : return dt_prop_get_u32_def(node->parent, "#size-cells", 1);</span></span> |
| <span id="L965"><span class="lineNum"> 965</span> : : }</span> |
| <span id="L966"><span class="lineNum"> 966</span> : : </span> |
| <span id="L967"><span class="lineNum"> 967</span> :<span class="tlaGNC"> 33 : u64 dt_get_address(const struct dt_node *node, unsigned int index,</span></span> |
| <span id="L968"><span class="lineNum"> 968</span> : : u64 *out_size)</span> |
| <span id="L969"><span class="lineNum"> 969</span> : : {</span> |
| <span id="L970"><span class="lineNum"> 970</span> : : const struct dt_property *p;</span> |
| <span id="L971"><span class="lineNum"> 971</span> :<span class="tlaGNC"> 33 : u32 na = dt_n_address_cells(node);</span></span> |
| <span id="L972"><span class="lineNum"> 972</span> :<span class="tlaGNC"> 33 : u32 ns = dt_n_size_cells(node);</span></span> |
| <span id="L973"><span class="lineNum"> 973</span> : : u32 pos, n;</span> |
| <span id="L974"><span class="lineNum"> 974</span> : : </span> |
| <span id="L975"><span class="lineNum"> 975</span> :<span class="tlaGNC"> 33 : p = dt_require_property(node, "reg", -1);</span></span> |
| <span id="L976"><span class="lineNum"> 976</span> :<span class="tlaGNC"> 33 : n = (na + ns) * sizeof(u32);</span></span> |
| <span id="L977"><span class="lineNum"> 977</span> :<span class="tlaGNC"> 33 : pos = n * index;</span></span> |
| <span id="L978"><span class="lineNum"> 978</span> :<span class="tlaGNC"> 33 : assert((pos + n) <= p->len);</span></span> |
| <span id="L979"><span class="lineNum"> 979</span> :<span class="tlaGNC"> 33 : if (out_size)</span></span> |
| <span id="L980"><span class="lineNum"> 980</span> :<span class="tlaGNC"> 29 : *out_size = dt_get_number(p->prop + pos + na * sizeof(u32), ns);</span></span> |
| <span id="L981"><span class="lineNum"> 981</span> :<span class="tlaGNC"> 33 : return dt_get_number(p->prop + pos, na);</span></span> |
| <span id="L982"><span class="lineNum"> 982</span> : : }</span> |
| <span id="L983"><span class="lineNum"> 983</span> : : </span> |
| <span id="L984"><span class="lineNum"> 984</span> :<span class="tlaGNC"> 89 : u32 __dt_get_chip_id(const struct dt_node *node)</span></span> |
| <span id="L985"><span class="lineNum"> 985</span> : : {</span> |
| <span id="L986"><span class="lineNum"> 986</span> : : const struct dt_property *prop;</span> |
| <span id="L987"><span class="lineNum"> 987</span> : : </span> |
| <span id="L988"><span class="lineNum"> 988</span> :<span class="tlaGNC"> 313 : for (; node; node = node->parent) {</span></span> |
| <span id="L989"><span class="lineNum"> 989</span> :<span class="tlaGNC"> 258 : prop = dt_find_property(node, "ibm,chip-id");</span></span> |
| <span id="L990"><span class="lineNum"> 990</span> :<span class="tlaGNC"> 258 : if (prop)</span></span> |
| <span id="L991"><span class="lineNum"> 991</span> :<span class="tlaGNC"> 34 : return dt_property_get_cell(prop, 0);</span></span> |
| <span id="L992"><span class="lineNum"> 992</span> : : }</span> |
| <span id="L993"><span class="lineNum"> 993</span> :<span class="tlaGNC"> 55 : return 0xffffffff;</span></span> |
| <span id="L994"><span class="lineNum"> 994</span> : : }</span> |
| <span id="L995"><span class="lineNum"> 995</span> : : </span> |
| <span id="L996"><span class="lineNum"> 996</span> :<span class="tlaGNC"> 11 : u32 dt_get_chip_id(const struct dt_node *node)</span></span> |
| <span id="L997"><span class="lineNum"> 997</span> : : {</span> |
| <span id="L998"><span class="lineNum"> 998</span> :<span class="tlaGNC"> 11 : u32 id = __dt_get_chip_id(node);</span></span> |
| <span id="L999"><span class="lineNum"> 999</span> :<span class="tlaGNC"> 11 : assert(id != 0xffffffff);</span></span> |
| <span id="L1000"><span class="lineNum"> 1000</span> :<span class="tlaGNC"> 11 : return id;</span></span> |
| <span id="L1001"><span class="lineNum"> 1001</span> : : }</span> |
| <span id="L1002"><span class="lineNum"> 1002</span> : : </span> |
| <span id="L1003"><span class="lineNum"> 1003</span> :<span class="tlaGNC"> 6 : struct dt_node *dt_find_compatible_node_on_chip(struct dt_node *root,</span></span> |
| <span id="L1004"><span class="lineNum"> 1004</span> : : struct dt_node *prev,</span> |
| <span id="L1005"><span class="lineNum"> 1005</span> : : const char *compat,</span> |
| <span id="L1006"><span class="lineNum"> 1006</span> : : uint32_t chip_id)</span> |
| <span id="L1007"><span class="lineNum"> 1007</span> : : {</span> |
| <span id="L1008"><span class="lineNum"> 1008</span> :<span class="tlaGNC"> 6 : struct dt_node *node = prev;</span></span> |
| <span id="L1009"><span class="lineNum"> 1009</span> : : </span> |
| <span id="L1010"><span class="lineNum"> 1010</span> :<span class="tlaGNC"> 80 : while ((node = dt_next(root, node))) {</span></span> |
| <span id="L1011"><span class="lineNum"> 1011</span> :<span class="tlaGNC"> 78 : u32 cid = __dt_get_chip_id(node);</span></span> |
| <span id="L1012"><span class="lineNum"> 1012</span> :<span class="tlaGNC"> 92 : if (cid == chip_id &&</span></span> |
| <span id="L1013"><span class="lineNum"> 1013</span> :<span class="tlaGNC"> 14 : dt_node_is_compatible(node, compat))</span></span> |
| <span id="L1014"><span class="lineNum"> 1014</span> :<span class="tlaGNC"> 4 : return node;</span></span> |
| <span id="L1015"><span class="lineNum"> 1015</span> : : }</span> |
| <span id="L1016"><span class="lineNum"> 1016</span> :<span class="tlaGNC"> 2 : return NULL;</span></span> |
| <span id="L1017"><span class="lineNum"> 1017</span> : : }</span> |
| <span id="L1018"><span class="lineNum"> 1018</span> : : </span> |
| <span id="L1019"><span class="lineNum"> 1019</span> :<span class="tlaUNC tlaBgUNC"> 0 : unsigned int dt_count_addresses(const struct dt_node *node)</span></span> |
| <span id="L1020"><span class="lineNum"> 1020</span> : : {</span> |
| <span id="L1021"><span class="lineNum"> 1021</span> : : const struct dt_property *p;</span> |
| <span id="L1022"><span class="lineNum"> 1022</span> :<span class="tlaUNC"> 0 : u32 na = dt_n_address_cells(node);</span></span> |
| <span id="L1023"><span class="lineNum"> 1023</span> :<span class="tlaUNC"> 0 : u32 ns = dt_n_size_cells(node);</span></span> |
| <span id="L1024"><span class="lineNum"> 1024</span> : : u32 n;</span> |
| <span id="L1025"><span class="lineNum"> 1025</span> : : </span> |
| <span id="L1026"><span class="lineNum"> 1026</span> :<span class="tlaUNC"> 0 : p = dt_require_property(node, "reg", -1);</span></span> |
| <span id="L1027"><span class="lineNum"> 1027</span> :<span class="tlaUNC"> 0 : n = (na + ns) * sizeof(u32);</span></span> |
| <span id="L1028"><span class="lineNum"> 1028</span> : : </span> |
| <span id="L1029"><span class="lineNum"> 1029</span> :<span class="tlaUNC"> 0 : if (n == 0)</span></span> |
| <span id="L1030"><span class="lineNum"> 1030</span> :<span class="tlaUNC"> 0 : return 0;</span></span> |
| <span id="L1031"><span class="lineNum"> 1031</span> : : </span> |
| <span id="L1032"><span class="lineNum"> 1032</span> :<span class="tlaUNC"> 0 : return p->len / n;</span></span> |
| <span id="L1033"><span class="lineNum"> 1033</span> : : }</span> |
| <span id="L1034"><span class="lineNum"> 1034</span> : : </span> |
| <span id="L1035"><span class="lineNum"> 1035</span> : : /* Translates an address from the given bus into its parent's address space */</span> |
| <span id="L1036"><span class="lineNum"> 1036</span> :<span class="tlaGNC tlaBgGNC"> 6 : static u64 dt_translate_one(const struct dt_node *bus, u64 addr)</span></span> |
| <span id="L1037"><span class="lineNum"> 1037</span> : : {</span> |
| <span id="L1038"><span class="lineNum"> 1038</span> : : u32 ranges_count, na, ns, parent_na;</span> |
| <span id="L1039"><span class="lineNum"> 1039</span> : : const struct dt_property *p;</span> |
| <span id="L1040"><span class="lineNum"> 1040</span> : : const u32 *ranges;</span> |
| <span id="L1041"><span class="lineNum"> 1041</span> : : int i, stride;</span> |
| <span id="L1042"><span class="lineNum"> 1042</span> : : </span> |
| <span id="L1043"><span class="lineNum"> 1043</span> :<span class="tlaGNC"> 6 : assert(bus->parent);</span></span> |
| <span id="L1044"><span class="lineNum"> 1044</span> : : </span> |
| <span id="L1045"><span class="lineNum"> 1045</span> :<span class="tlaGNC"> 6 : na = dt_prop_get_u32_def(bus, "#address-cells", 2);</span></span> |
| <span id="L1046"><span class="lineNum"> 1046</span> :<span class="tlaGNC"> 6 : ns = dt_prop_get_u32_def(bus, "#size-cells", 2);</span></span> |
| <span id="L1047"><span class="lineNum"> 1047</span> :<span class="tlaGNC"> 6 : parent_na = dt_n_address_cells(bus);</span></span> |
| <span id="L1048"><span class="lineNum"> 1048</span> : : </span> |
| <span id="L1049"><span class="lineNum"> 1049</span> :<span class="tlaGNC"> 6 : stride = na + ns + parent_na;</span></span> |
| <span id="L1050"><span class="lineNum"> 1050</span> : : </span> |
| <span id="L1051"><span class="lineNum"> 1051</span> : : /*</span> |
| <span id="L1052"><span class="lineNum"> 1052</span> : : * FIXME: We should handle arbitrary length addresses, rather than</span> |
| <span id="L1053"><span class="lineNum"> 1053</span> : : * limiting it to 64bit. If someone wants/needs that they</span> |
| <span id="L1054"><span class="lineNum"> 1054</span> : : * can implement the bignum math for it :)</span> |
| <span id="L1055"><span class="lineNum"> 1055</span> : : */</span> |
| <span id="L1056"><span class="lineNum"> 1056</span> :<span class="tlaGNC"> 6 : assert(na <= 2);</span></span> |
| <span id="L1057"><span class="lineNum"> 1057</span> :<span class="tlaGNC"> 6 : assert(parent_na <= 2);</span></span> |
| <span id="L1058"><span class="lineNum"> 1058</span> : : </span> |
| <span id="L1059"><span class="lineNum"> 1059</span> : : /* We should never be trying to translate an address without a ranges */</span> |
| <span id="L1060"><span class="lineNum"> 1060</span> :<span class="tlaGNC"> 6 : p = dt_require_property(bus, "ranges", -1);</span></span> |
| <span id="L1061"><span class="lineNum"> 1061</span> : : </span> |
| <span id="L1062"><span class="lineNum"> 1062</span> :<span class="tlaGNC"> 6 : ranges = (u32 *) &p->prop;</span></span> |
| <span id="L1063"><span class="lineNum"> 1063</span> :<span class="tlaGNC"> 6 : ranges_count = (p->len / 4) / (na + parent_na + ns);</span></span> |
| <span id="L1064"><span class="lineNum"> 1064</span> : : </span> |
| <span id="L1065"><span class="lineNum"> 1065</span> : : /* An empty ranges property implies 1-1 translation */</span> |
| <span id="L1066"><span class="lineNum"> 1066</span> :<span class="tlaGNC"> 6 : if (ranges_count == 0)</span></span> |
| <span id="L1067"><span class="lineNum"> 1067</span> :<span class="tlaUNC tlaBgUNC"> 0 : return addr;</span></span> |
| <span id="L1068"><span class="lineNum"> 1068</span> : : </span> |
| <span id="L1069"><span class="lineNum"> 1069</span> :<span class="tlaGNC tlaBgGNC"> 7 : for (i = 0; i < ranges_count; i++, ranges += stride) {</span></span> |
| <span id="L1070"><span class="lineNum"> 1070</span> : : /* ranges format: <child base> <parent base> <size> */</span> |
| <span id="L1071"><span class="lineNum"> 1071</span> :<span class="tlaGNC"> 7 : u64 child_base = dt_get_number(ranges, na);</span></span> |
| <span id="L1072"><span class="lineNum"> 1072</span> :<span class="tlaGNC"> 7 : u64 parent_base = dt_get_number(ranges + na, parent_na);</span></span> |
| <span id="L1073"><span class="lineNum"> 1073</span> :<span class="tlaGNC"> 7 : u64 size = dt_get_number(ranges + na + parent_na, ns);</span></span> |
| <span id="L1074"><span class="lineNum"> 1074</span> : : </span> |
| <span id="L1075"><span class="lineNum"> 1075</span> :<span class="tlaGNC"> 7 : if (addr >= child_base && addr < child_base + size)</span></span> |
| <span id="L1076"><span class="lineNum"> 1076</span> :<span class="tlaGNC"> 6 : return (addr - child_base) + parent_base;</span></span> |
| <span id="L1077"><span class="lineNum"> 1077</span> : : }</span> |
| <span id="L1078"><span class="lineNum"> 1078</span> : : </span> |
| <span id="L1079"><span class="lineNum"> 1079</span> : : /* input address was outside the any of our mapped ranges */</span> |
| <span id="L1080"><span class="lineNum"> 1080</span> :<span class="tlaUNC tlaBgUNC"> 0 : return 0;</span></span> |
| <span id="L1081"><span class="lineNum"> 1081</span> : : }</span> |
| <span id="L1082"><span class="lineNum"> 1082</span> : : </span> |
| <span id="L1083"><span class="lineNum"> 1083</span> :<span class="tlaGNC tlaBgGNC"> 4 : u64 dt_translate_address(const struct dt_node *node, unsigned int index,</span></span> |
| <span id="L1084"><span class="lineNum"> 1084</span> : : u64 *out_size)</span> |
| <span id="L1085"><span class="lineNum"> 1085</span> : : {</span> |
| <span id="L1086"><span class="lineNum"> 1086</span> :<span class="tlaGNC"> 4 : u64 addr = dt_get_address(node, index, NULL);</span></span> |
| <span id="L1087"><span class="lineNum"> 1087</span> :<span class="tlaGNC"> 4 : struct dt_node *bus = node->parent;</span></span> |
| <span id="L1088"><span class="lineNum"> 1088</span> : : </span> |
| <span id="L1089"><span class="lineNum"> 1089</span> : : /* FIXME: One day we will probably want to use this, but for now just</span> |
| <span id="L1090"><span class="lineNum"> 1090</span> : : * force it it to be zero since we only support returning a u64 or u32</span> |
| <span id="L1091"><span class="lineNum"> 1091</span> : : */</span> |
| <span id="L1092"><span class="lineNum"> 1092</span> :<span class="tlaGNC"> 4 : assert(!out_size);</span></span> |
| <span id="L1093"><span class="lineNum"> 1093</span> : : </span> |
| <span id="L1094"><span class="lineNum"> 1094</span> : : /* apply each translation until we hit the root bus */</span> |
| <span id="L1095"><span class="lineNum"> 1095</span> :<span class="tlaGNC"> 10 : while (bus->parent) {</span></span> |
| <span id="L1096"><span class="lineNum"> 1096</span> :<span class="tlaGNC"> 6 : addr = dt_translate_one(bus, addr);</span></span> |
| <span id="L1097"><span class="lineNum"> 1097</span> :<span class="tlaGNC"> 6 : bus = bus->parent;</span></span> |
| <span id="L1098"><span class="lineNum"> 1098</span> : : }</span> |
| <span id="L1099"><span class="lineNum"> 1099</span> : : </span> |
| <span id="L1100"><span class="lineNum"> 1100</span> :<span class="tlaGNC"> 4 : return addr;</span></span> |
| <span id="L1101"><span class="lineNum"> 1101</span> : : }</span> |
| <span id="L1102"><span class="lineNum"> 1102</span> : : </span> |
| <span id="L1103"><span class="lineNum"> 1103</span> :<span class="tlaUNC tlaBgUNC"> 0 : bool dt_node_is_enabled(struct dt_node *node)</span></span> |
| <span id="L1104"><span class="lineNum"> 1104</span> : : {</span> |
| <span id="L1105"><span class="lineNum"> 1105</span> :<span class="tlaUNC"> 0 : const struct dt_property *p = dt_find_property(node, "status");</span></span> |
| <span id="L1106"><span class="lineNum"> 1106</span> : : </span> |
| <span id="L1107"><span class="lineNum"> 1107</span> :<span class="tlaUNC"> 0 : if (!p)</span></span> |
| <span id="L1108"><span class="lineNum"> 1108</span> :<span class="tlaUNC"> 0 : return true;</span></span> |
| <span id="L1109"><span class="lineNum"> 1109</span> : : </span> |
| <span id="L1110"><span class="lineNum"> 1110</span> :<span class="tlaUNC"> 0 : return p->len > 1 && p->prop[0] == 'o' && p->prop[1] == 'k';</span></span> |
| <span id="L1111"><span class="lineNum"> 1111</span> : : }</span> |
| <span id="L1112"><span class="lineNum"> 1112</span> : : </span> |
| <span id="L1113"><span class="lineNum"> 1113</span> : : /*</span> |
| <span id="L1114"><span class="lineNum"> 1114</span> : : * Function to fixup the phandle in the subtree.</span> |
| <span id="L1115"><span class="lineNum"> 1115</span> : : */</span> |
| <span id="L1116"><span class="lineNum"> 1116</span> :<span class="tlaGNC tlaBgGNC"> 1 : void dt_adjust_subtree_phandle(struct dt_node *dev,</span></span> |
| <span id="L1117"><span class="lineNum"> 1117</span> : : const char** (get_properties_to_fix)(struct dt_node *n))</span> |
| <span id="L1118"><span class="lineNum"> 1118</span> : : {</span> |
| <span id="L1119"><span class="lineNum"> 1119</span> : : struct dt_node *node;</span> |
| <span id="L1120"><span class="lineNum"> 1120</span> : : struct dt_property *prop;</span> |
| <span id="L1121"><span class="lineNum"> 1121</span> :<span class="tlaGNC"> 1 : u32 phandle, max_phandle = 0, import_phandle = new_phandle();</span></span> |
| <span id="L1122"><span class="lineNum"> 1122</span> : : __be32 p;</span> |
| <span id="L1123"><span class="lineNum"> 1123</span> : : const char **name;</span> |
| <span id="L1124"><span class="lineNum"> 1124</span> : : </span> |
| <span id="L1125"><span class="lineNum"> 1125</span> :<span class="tlaGNC"> 7 : dt_for_each_node(dev, node) {</span></span> |
| <span id="L1126"><span class="lineNum"> 1126</span> : : const char **props_to_update;</span> |
| <span id="L1127"><span class="lineNum"> 1127</span> :<span class="tlaGNC"> 6 : node->phandle += import_phandle;</span></span> |
| <span id="L1128"><span class="lineNum"> 1128</span> : : </span> |
| <span id="L1129"><span class="lineNum"> 1129</span> : : /*</span> |
| <span id="L1130"><span class="lineNum"> 1130</span> : : * calculate max_phandle(new_tree), needed to update</span> |
| <span id="L1131"><span class="lineNum"> 1131</span> : : * last_phandle.</span> |
| <span id="L1132"><span class="lineNum"> 1132</span> : : */</span> |
| <span id="L1133"><span class="lineNum"> 1133</span> :<span class="tlaGNC"> 6 : if (node->phandle >= max_phandle)</span></span> |
| <span id="L1134"><span class="lineNum"> 1134</span> :<span class="tlaGNC"> 6 : max_phandle = node->phandle;</span></span> |
| <span id="L1135"><span class="lineNum"> 1135</span> : : </span> |
| <span id="L1136"><span class="lineNum"> 1136</span> :<span class="tlaGNC"> 6 : props_to_update = get_properties_to_fix(node);</span></span> |
| <span id="L1137"><span class="lineNum"> 1137</span> :<span class="tlaGNC"> 6 : if (!props_to_update)</span></span> |
| <span id="L1138"><span class="lineNum"> 1138</span> :<span class="tlaGNC"> 4 : continue;</span></span> |
| <span id="L1139"><span class="lineNum"> 1139</span> :<span class="tlaGNC"> 4 : for (name = props_to_update; *name != NULL; name++) {</span></span> |
| <span id="L1140"><span class="lineNum"> 1140</span> :<span class="tlaGNC"> 2 : prop = __dt_find_property(node, *name);</span></span> |
| <span id="L1141"><span class="lineNum"> 1141</span> :<span class="tlaGNC"> 2 : if (!prop)</span></span> |
| <span id="L1142"><span class="lineNum"> 1142</span> :<span class="tlaUNC tlaBgUNC"> 0 : continue;</span></span> |
| <span id="L1143"><span class="lineNum"> 1143</span> :<span class="tlaGNC tlaBgGNC"> 2 : phandle = dt_prop_get_u32(node, *name);</span></span> |
| <span id="L1144"><span class="lineNum"> 1144</span> :<span class="tlaGNC"> 2 : phandle += import_phandle;</span></span> |
| <span id="L1145"><span class="lineNum"> 1145</span> :<span class="tlaGNC"> 2 : p = cpu_to_be32(phandle);</span></span> |
| <span id="L1146"><span class="lineNum"> 1146</span> :<span class="tlaGNC"> 2 : memcpy((char *)&prop->prop, &p, prop->len);</span></span> |
| <span id="L1147"><span class="lineNum"> 1147</span> : : }</span> |
| <span id="L1148"><span class="lineNum"> 1148</span> : : }</span> |
| <span id="L1149"><span class="lineNum"> 1149</span> : : </span> |
| <span id="L1150"><span class="lineNum"> 1150</span> :<span class="tlaGNC"> 1 : set_last_phandle(max_phandle);</span></span> |
| <span id="L1151"><span class="lineNum"> 1151</span> :<span class="tlaGNC"> 1 : }</span></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> |
