| <!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 - hw/test/phys-map-test.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">hw/test</a> - phys-map-test.c<span style="font-size: 80%;"> (source / <a href="phys-map-test.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="headerCovTableEntryLo">60.6 %</td> |
| <td class="headerCovTableEntry">104</td> |
| <td class="headerCovTableEntry">63</td> |
| </tr> |
| <tr> |
| <td class="headerItem">Test Date:</td> |
| <td class="headerValue">2025-12-23 15:01:56</td> |
| <td></td> |
| <td class="headerItem">Functions:</td> |
| <td class="headerCovTableEntryLo">66.7 %</td> |
| <td class="headerCovTableEntry">6</td> |
| <td class="headerCovTableEntry">4</td> |
| </tr> |
| <tr> |
| <td></td> |
| <td></td> |
| <td></td> |
| <td class="headerItem">Branches:</td> |
| <td class="headerCovTableEntryHi">-</td> |
| <td class="headerCovTableEntry">0</td> |
| <td class="headerCovTableEntry">0</td> |
| </tr> |
| <tr><td><img src="../../glass.png" width=3 height=3 alt=""></td></tr> |
| </table> |
| </td> |
| </tr> |
| |
| <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr> |
| </table> |
| |
| <table cellpadding=0 cellspacing=0 border=0> |
| <tr> |
| <td><br></td> |
| </tr> |
| <tr> |
| <td> |
| <pre class="sourceHeading"> Branch data Line data Source code</pre> |
| <pre class="source"> |
| <span id="L1"><span class="lineNum"> 1</span> : : // SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later</span> |
| <span id="L2"><span class="lineNum"> 2</span> : : /*</span> |
| <span id="L3"><span class="lineNum"> 3</span> : : * Physical memory map test</span> |
| <span id="L4"><span class="lineNum"> 4</span> : : *</span> |
| <span id="L5"><span class="lineNum"> 5</span> : : * Copyright 2013-2017 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 "../../core/test/stubs.c"</span> |
| <span id="L9"><span class="lineNum"> 9</span> : : #include "../phys-map.c"</span> |
| <span id="L10"><span class="lineNum"> 10</span> : : </span> |
| <span id="L11"><span class="lineNum"> 11</span> : : enum proc_gen proc_gen;</span> |
| <span id="L12"><span class="lineNum"> 12</span> : : </span> |
| <span id="L13"><span class="lineNum"> 13</span> :<span class="tlaUNC tlaBgUNC"> 0 : static inline void print_entry(const struct phys_map_entry *e)</span></span> |
| <span id="L14"><span class="lineNum"> 14</span> : : {</span> |
| <span id="L15"><span class="lineNum"> 15</span> :<span class="tlaUNC"> 0 : printf("type:%i index:%i addr:%016lx size:%016lx",</span></span> |
| <span id="L16"><span class="lineNum"> 16</span> :<span class="tlaUNC"> 0 : e->type, e->index, e->addr, e->size);</span></span> |
| <span id="L17"><span class="lineNum"> 17</span> :<span class="tlaUNC"> 0 : }</span></span> |
| <span id="L18"><span class="lineNum"> 18</span> : : </span> |
| <span id="L19"><span class="lineNum"> 19</span> : : /* Check table directly for overlaps */</span> |
| <span id="L20"><span class="lineNum"> 20</span> :<span class="tlaGNC tlaBgGNC"> 3 : static void check_table_directly(void)</span></span> |
| <span id="L21"><span class="lineNum"> 21</span> : : {</span> |
| <span id="L22"><span class="lineNum"> 22</span> : : const struct phys_map_entry *e, *prev;</span> |
| <span id="L23"><span class="lineNum"> 23</span> : : uint64_t start, end, pstart, pend;</span> |
| <span id="L24"><span class="lineNum"> 24</span> : : bool passed;</span> |
| <span id="L25"><span class="lineNum"> 25</span> : : </span> |
| <span id="L26"><span class="lineNum"> 26</span> : : /* Loop over table entries ... */</span> |
| <span id="L27"><span class="lineNum"> 27</span> :<span class="tlaGNC"> 283 : for (e = phys_map->table; !phys_map_entry_null(e); e++) {</span></span> |
| <span id="L28"><span class="lineNum"> 28</span> : : </span> |
| <span id="L29"><span class="lineNum"> 29</span> :<span class="tlaGNC"> 280 : start = e->addr;</span></span> |
| <span id="L30"><span class="lineNum"> 30</span> :<span class="tlaGNC"> 280 : end = e->addr + e->size;</span></span> |
| <span id="L31"><span class="lineNum"> 31</span> : : /* ... see if they overlap with previous entries */</span> |
| <span id="L32"><span class="lineNum"> 32</span> :<span class="tlaGNC"> 13391 : for (prev = phys_map->table; prev != e; prev++) {</span></span> |
| <span id="L33"><span class="lineNum"> 33</span> :<span class="tlaGNC"> 13111 : passed = true;</span></span> |
| <span id="L34"><span class="lineNum"> 34</span> : : /* Check for overlaping regions */</span> |
| <span id="L35"><span class="lineNum"> 35</span> :<span class="tlaGNC"> 13111 : pstart = prev->addr;</span></span> |
| <span id="L36"><span class="lineNum"> 36</span> :<span class="tlaGNC"> 13111 : pend = prev->addr + prev->size;</span></span> |
| <span id="L37"><span class="lineNum"> 37</span> :<span class="tlaGNC"> 13111 : if ((start > pstart) && (start < pend))</span></span> |
| <span id="L38"><span class="lineNum"> 38</span> :<span class="tlaUNC tlaBgUNC"> 0 : passed = false;</span></span> |
| <span id="L39"><span class="lineNum"> 39</span> :<span class="tlaGNC tlaBgGNC"> 13111 : if ((end > pstart) && (end < pend))</span></span> |
| <span id="L40"><span class="lineNum"> 40</span> :<span class="tlaUNC tlaBgUNC"> 0 : passed = false;</span></span> |
| <span id="L41"><span class="lineNum"> 41</span> : : </span> |
| <span id="L42"><span class="lineNum"> 42</span> : : /* Check for duplicate entries */</span> |
| <span id="L43"><span class="lineNum"> 43</span> :<span class="tlaGNC tlaBgGNC"> 13111 : if ((e->type == prev->type) &&</span></span> |
| <span id="L44"><span class="lineNum"> 44</span> :<span class="tlaGNC"> 941 : (e->index == prev->index))</span></span> |
| <span id="L45"><span class="lineNum"> 45</span> :<span class="tlaUNC tlaBgUNC"> 0 : passed = false;</span></span> |
| <span id="L46"><span class="lineNum"> 46</span> : : </span> |
| <span id="L47"><span class="lineNum"> 47</span> :<span class="tlaGNC tlaBgGNC"> 13111 : if (passed)</span></span> |
| <span id="L48"><span class="lineNum"> 48</span> :<span class="tlaGNC"> 13111 : continue;</span></span> |
| <span id="L49"><span class="lineNum"> 49</span> : : </span> |
| <span id="L50"><span class="lineNum"> 50</span> :<span class="tlaUNC tlaBgUNC"> 0 : printf("Phys map direct test FAILED: Entry overlaps\n");</span></span> |
| <span id="L51"><span class="lineNum"> 51</span> :<span class="tlaUNC"> 0 : printf("First: ");</span></span> |
| <span id="L52"><span class="lineNum"> 52</span> :<span class="tlaUNC"> 0 : print_entry(prev);</span></span> |
| <span id="L53"><span class="lineNum"> 53</span> :<span class="tlaUNC"> 0 : printf("\n");</span></span> |
| <span id="L54"><span class="lineNum"> 54</span> :<span class="tlaUNC"> 0 : printf("Second: ");</span></span> |
| <span id="L55"><span class="lineNum"> 55</span> :<span class="tlaUNC"> 0 : print_entry(e);</span></span> |
| <span id="L56"><span class="lineNum"> 56</span> :<span class="tlaUNC"> 0 : printf("\n");</span></span> |
| <span id="L57"><span class="lineNum"> 57</span> :<span class="tlaUNC"> 0 : assert(0);</span></span> |
| <span id="L58"><span class="lineNum"> 58</span> : : }</span> |
| <span id="L59"><span class="lineNum"> 59</span> : : }</span> |
| <span id="L60"><span class="lineNum"> 60</span> :<span class="tlaGNC tlaBgGNC"> 3 : }</span></span> |
| <span id="L61"><span class="lineNum"> 61</span> : : </span> |
| <span id="L62"><span class="lineNum"> 62</span> : : struct map_call_entry {</span> |
| <span id="L63"><span class="lineNum"> 63</span> : : uint64_t start;</span> |
| <span id="L64"><span class="lineNum"> 64</span> : : uint64_t end;</span> |
| <span id="L65"><span class="lineNum"> 65</span> : : };</span> |
| <span id="L66"><span class="lineNum"> 66</span> : : </span> |
| <span id="L67"><span class="lineNum"> 67</span> :<span class="tlaGNC"> 13671 : static inline bool map_call_entry_null(const struct map_call_entry *t)</span></span> |
| <span id="L68"><span class="lineNum"> 68</span> : : {</span> |
| <span id="L69"><span class="lineNum"> 69</span> :<span class="tlaGNC"> 13671 : if ((t->start == 0) &&</span></span> |
| <span id="L70"><span class="lineNum"> 70</span> :<span class="tlaGNC"> 283 : (t->end == 0))</span></span> |
| <span id="L71"><span class="lineNum"> 71</span> :<span class="tlaGNC"> 283 : return true;</span></span> |
| <span id="L72"><span class="lineNum"> 72</span> :<span class="tlaGNC"> 13388 : return false;</span></span> |
| <span id="L73"><span class="lineNum"> 73</span> : : }</span> |
| <span id="L74"><span class="lineNum"> 74</span> : : </span> |
| <span id="L75"><span class="lineNum"> 75</span> : : /* Check calls to map to see if they overlap.</span> |
| <span id="L76"><span class="lineNum"> 76</span> : : * Creates a new table for each of the entries it gets to check against</span> |
| <span id="L77"><span class="lineNum"> 77</span> : : */</span> |
| <span id="L78"><span class="lineNum"> 78</span> : : </span> |
| <span id="L79"><span class="lineNum"> 79</span> : : /* Pick a chip ID, any ID. */</span> |
| <span id="L80"><span class="lineNum"> 80</span> : : #define FAKE_CHIP_ID 8</span> |
| <span id="L81"><span class="lineNum"> 81</span> : : </span> |
| <span id="L82"><span class="lineNum"> 82</span> :<span class="tlaUNC tlaBgUNC"> 0 : struct proc_chip *get_chip(uint32_t chip_id __unused)</span></span> |
| <span id="L83"><span class="lineNum"> 83</span> : : {</span> |
| <span id="L84"><span class="lineNum"> 84</span> :<span class="tlaUNC"> 0 : return NULL;</span></span> |
| <span id="L85"><span class="lineNum"> 85</span> : : }</span> |
| <span id="L86"><span class="lineNum"> 86</span> : : </span> |
| <span id="L87"><span class="lineNum"> 87</span> :<span class="tlaGNC tlaBgGNC"> 3 : static void check_map_call(void)</span></span> |
| <span id="L88"><span class="lineNum"> 88</span> : : {</span> |
| <span id="L89"><span class="lineNum"> 89</span> : : uint64_t start, size, end;</span> |
| <span id="L90"><span class="lineNum"> 90</span> : : const struct phys_map_entry *e;</span> |
| <span id="L91"><span class="lineNum"> 91</span> : : struct map_call_entry *tbl, *t, *tnext;</span> |
| <span id="L92"><span class="lineNum"> 92</span> :<span class="tlaGNC"> 3 : int tbl_size = 0;</span></span> |
| <span id="L93"><span class="lineNum"> 93</span> : : bool passed;</span> |
| <span id="L94"><span class="lineNum"> 94</span> : : </span> |
| <span id="L95"><span class="lineNum"> 95</span> :<span class="tlaGNC"> 283 : for (e = phys_map->table; !phys_map_entry_null(e); e++)</span></span> |
| <span id="L96"><span class="lineNum"> 96</span> :<span class="tlaGNC"> 280 : tbl_size++;</span></span> |
| <span id="L97"><span class="lineNum"> 97</span> : : </span> |
| <span id="L98"><span class="lineNum"> 98</span> :<span class="tlaGNC"> 3 : tbl_size++; /* allow for null entry at end */</span></span> |
| <span id="L99"><span class="lineNum"> 99</span> :<span class="tlaGNC"> 3 : tbl_size *= sizeof(struct map_call_entry);</span></span> |
| <span id="L100"><span class="lineNum"> 100</span> :<span class="tlaGNC"> 3 : tbl = malloc(tbl_size);</span></span> |
| <span id="L101"><span class="lineNum"> 101</span> :<span class="tlaGNC"> 3 : assert(tbl != NULL);</span></span> |
| <span id="L102"><span class="lineNum"> 102</span> :<span class="tlaGNC"> 3 : memset(tbl, 0, tbl_size);</span></span> |
| <span id="L103"><span class="lineNum"> 103</span> : : </span> |
| <span id="L104"><span class="lineNum"> 104</span> : : /* Loop over table entries ... */</span> |
| <span id="L105"><span class="lineNum"> 105</span> :<span class="tlaGNC"> 283 : for (e = phys_map->table; !phys_map_entry_null(e); e++) {</span></span> |
| <span id="L106"><span class="lineNum"> 106</span> :<span class="tlaGNC"> 280 : __phys_map_get(FAKE_CHIP_ID, FAKE_CHIP_ID, e->type, e->index, &start, &size);</span></span> |
| <span id="L107"><span class="lineNum"> 107</span> : : </span> |
| <span id="L108"><span class="lineNum"> 108</span> : : /* Check for alignment */</span> |
| <span id="L109"><span class="lineNum"> 109</span> :<span class="tlaGNC"> 280 : if ((e->type != SYSTEM_MEM) && (e->type != RESV)) {</span></span> |
| <span id="L110"><span class="lineNum"> 110</span> : : /* Size is power of 2? */</span> |
| <span id="L111"><span class="lineNum"> 111</span> :<span class="tlaGNC"> 245 : assert(__builtin_popcountl(size) == 1);</span></span> |
| <span id="L112"><span class="lineNum"> 112</span> : : /* Start is aligned to size? */</span> |
| <span id="L113"><span class="lineNum"> 113</span> :<span class="tlaGNC"> 245 : assert((start % size) == 0);</span></span> |
| <span id="L114"><span class="lineNum"> 114</span> : : }</span> |
| <span id="L115"><span class="lineNum"> 115</span> : : </span> |
| <span id="L116"><span class="lineNum"> 116</span> :<span class="tlaGNC"> 280 : end = start + size;</span></span> |
| <span id="L117"><span class="lineNum"> 117</span> :<span class="tlaGNC"> 13391 : for (t = tbl; !map_call_entry_null(t); t++) {</span></span> |
| <span id="L118"><span class="lineNum"> 118</span> :<span class="tlaGNC"> 13111 : passed = true;</span></span> |
| <span id="L119"><span class="lineNum"> 119</span> : : </span> |
| <span id="L120"><span class="lineNum"> 120</span> : : /* Check for overlaping regions */</span> |
| <span id="L121"><span class="lineNum"> 121</span> :<span class="tlaGNC"> 13111 : if ((start > t->start) && (start < t->end))</span></span> |
| <span id="L122"><span class="lineNum"> 122</span> :<span class="tlaUNC tlaBgUNC"> 0 : passed = false;</span></span> |
| <span id="L123"><span class="lineNum"> 123</span> :<span class="tlaGNC tlaBgGNC"> 13111 : if ((end > t->start) && (end < t->end))</span></span> |
| <span id="L124"><span class="lineNum"> 124</span> :<span class="tlaUNC tlaBgUNC"> 0 : passed = false;</span></span> |
| <span id="L125"><span class="lineNum"> 125</span> : : </span> |
| <span id="L126"><span class="lineNum"> 126</span> :<span class="tlaGNC tlaBgGNC"> 13111 : if (passed)</span></span> |
| <span id="L127"><span class="lineNum"> 127</span> :<span class="tlaGNC"> 13111 : continue;</span></span> |
| <span id="L128"><span class="lineNum"> 128</span> : : </span> |
| <span id="L129"><span class="lineNum"> 129</span> :<span class="tlaUNC tlaBgUNC"> 0 : printf("Phys map call test FAILED: Entry overlaps\n");</span></span> |
| <span id="L130"><span class="lineNum"> 130</span> :<span class="tlaUNC"> 0 : printf("First: addr:%016lx size:%016lx\n",</span></span> |
| <span id="L131"><span class="lineNum"> 131</span> :<span class="tlaUNC"> 0 : t->start, t->end - t->start);</span></span> |
| <span id="L132"><span class="lineNum"> 132</span> :<span class="tlaUNC"> 0 : printf("Second: addr:%016lx size:%016lx\n ",</span></span> |
| <span id="L133"><span class="lineNum"> 133</span> : : start, size);</span> |
| <span id="L134"><span class="lineNum"> 134</span> :<span class="tlaUNC"> 0 : print_entry(e);</span></span> |
| <span id="L135"><span class="lineNum"> 135</span> :<span class="tlaUNC"> 0 : printf("\n");</span></span> |
| <span id="L136"><span class="lineNum"> 136</span> :<span class="tlaUNC"> 0 : assert(0);</span></span> |
| <span id="L137"><span class="lineNum"> 137</span> : : }</span> |
| <span id="L138"><span class="lineNum"> 138</span> : : /* Insert entry at end of table */</span> |
| <span id="L139"><span class="lineNum"> 139</span> :<span class="tlaGNC tlaBgGNC"> 280 : t->start = start;</span></span> |
| <span id="L140"><span class="lineNum"> 140</span> :<span class="tlaGNC"> 280 : t->end = end;</span></span> |
| <span id="L141"><span class="lineNum"> 141</span> : : }</span> |
| <span id="L142"><span class="lineNum"> 142</span> : : </span> |
| <span id="L143"><span class="lineNum"> 143</span> :<span class="tlaGNC"> 280 : for (t = tbl; !map_call_entry_null(t + 1); t++) {</span></span> |
| <span id="L144"><span class="lineNum"> 144</span> :<span class="tlaGNC"> 277 : tnext = t + 1;</span></span> |
| <span id="L145"><span class="lineNum"> 145</span> : : /* Make sure the table is sorted */</span> |
| <span id="L146"><span class="lineNum"> 146</span> :<span class="tlaGNC"> 277 : if (t->start > tnext->start) {</span></span> |
| <span id="L147"><span class="lineNum"> 147</span> :<span class="tlaUNC tlaBgUNC"> 0 : printf("Phys map test FAILED: Entry not sorted\n");</span></span> |
| <span id="L148"><span class="lineNum"> 148</span> :<span class="tlaUNC"> 0 : printf("First: addr:%016lx size:%016lx\n",</span></span> |
| <span id="L149"><span class="lineNum"> 149</span> :<span class="tlaUNC"> 0 : t->start, t->end - t->start);</span></span> |
| <span id="L150"><span class="lineNum"> 150</span> :<span class="tlaUNC"> 0 : printf("Second: addr:%016lx size:%016lx\n",</span></span> |
| <span id="L151"><span class="lineNum"> 151</span> :<span class="tlaUNC"> 0 : tnext->start, tnext->end - tnext->start);</span></span> |
| <span id="L152"><span class="lineNum"> 152</span> :<span class="tlaUNC"> 0 : assert(0);</span></span> |
| <span id="L153"><span class="lineNum"> 153</span> : : }</span> |
| <span id="L154"><span class="lineNum"> 154</span> : : </span> |
| <span id="L155"><span class="lineNum"> 155</span> : : /* Look for holes in the table in MMIO region */</span> |
| <span id="L156"><span class="lineNum"> 156</span> : : /* We assume over 1PB is MMIO. */</span> |
| <span id="L157"><span class="lineNum"> 157</span> :<span class="tlaGNC tlaBgGNC"> 277 : if ((t->end != tnext->start) &&</span></span> |
| <span id="L158"><span class="lineNum"> 158</span> :<span class="tlaGNC"> 8 : (t->start > 0x0004000000000000)) {</span></span> |
| <span id="L159"><span class="lineNum"> 159</span> :<span class="tlaUNC tlaBgUNC"> 0 : printf("Phys map test FAILED: Hole in map\n");</span></span> |
| <span id="L160"><span class="lineNum"> 160</span> :<span class="tlaUNC"> 0 : printf("First: addr:%016lx size:%016lx\n",</span></span> |
| <span id="L161"><span class="lineNum"> 161</span> :<span class="tlaUNC"> 0 : t->start, t->end - t->start);</span></span> |
| <span id="L162"><span class="lineNum"> 162</span> :<span class="tlaUNC"> 0 : printf("Second: addr:%016lx size:%016lx\n",</span></span> |
| <span id="L163"><span class="lineNum"> 163</span> :<span class="tlaUNC"> 0 : tnext->start, tnext->end - tnext->start);</span></span> |
| <span id="L164"><span class="lineNum"> 164</span> :<span class="tlaUNC"> 0 : assert(0);</span></span> |
| <span id="L165"><span class="lineNum"> 165</span> : : }</span> |
| <span id="L166"><span class="lineNum"> 166</span> : : }</span> |
| <span id="L167"><span class="lineNum"> 167</span> : : </span> |
| <span id="L168"><span class="lineNum"> 168</span> :<span class="tlaGNC tlaBgGNC"> 3 : free(tbl);</span></span> |
| <span id="L169"><span class="lineNum"> 169</span> :<span class="tlaGNC"> 3 : }</span></span> |
| <span id="L170"><span class="lineNum"> 170</span> : : </span> |
| <span id="L171"><span class="lineNum"> 171</span> : : /* Fake PVR definitions. See include/processor.h */</span> |
| <span id="L172"><span class="lineNum"> 172</span> : : unsigned long fake_pvr[] = {</span> |
| <span id="L173"><span class="lineNum"> 173</span> : : 0x004e0200, /* PVR_P9 */</span> |
| <span id="L174"><span class="lineNum"> 174</span> : : 0x004f0100, /* PVR_P9P */</span> |
| <span id="L175"><span class="lineNum"> 175</span> : : 0x00800100, /* PVR_P10 */</span> |
| <span id="L176"><span class="lineNum"> 176</span> : : };</span> |
| <span id="L177"><span class="lineNum"> 177</span> : : </span> |
| <span id="L178"><span class="lineNum"> 178</span> :<span class="tlaGNC"> 1 : int main(void)</span></span> |
| <span id="L179"><span class="lineNum"> 179</span> : : {</span> |
| <span id="L180"><span class="lineNum"> 180</span> :<span class="tlaGNC"> 4 : for (int i = 0; i < ARRAY_SIZE(fake_pvr); i++) {</span></span> |
| <span id="L181"><span class="lineNum"> 181</span> :<span class="tlaGNC"> 3 : switch(PVR_TYPE(fake_pvr[i])) {</span></span> |
| <span id="L182"><span class="lineNum"> 182</span> :<span class="tlaGNC"> 2 : case PVR_TYPE_P9:</span></span> |
| <span id="L183"><span class="lineNum"> 183</span> : : case PVR_TYPE_P9P:</span> |
| <span id="L184"><span class="lineNum"> 184</span> :<span class="tlaGNC"> 2 : proc_gen = proc_gen_p9;</span></span> |
| <span id="L185"><span class="lineNum"> 185</span> :<span class="tlaGNC"> 2 : break;</span></span> |
| <span id="L186"><span class="lineNum"> 186</span> :<span class="tlaGNC"> 1 : case PVR_TYPE_P10:</span></span> |
| <span id="L187"><span class="lineNum"> 187</span> :<span class="tlaGNC"> 1 : proc_gen = proc_gen_p10;</span></span> |
| <span id="L188"><span class="lineNum"> 188</span> :<span class="tlaGNC"> 1 : break;</span></span> |
| <span id="L189"><span class="lineNum"> 189</span> :<span class="tlaUNC tlaBgUNC"> 0 : default:</span></span> |
| <span id="L190"><span class="lineNum"> 190</span> :<span class="tlaUNC"> 0 : printf("Unknown PVR 0x%lx\n", fake_pvr[i]);</span></span> |
| <span id="L191"><span class="lineNum"> 191</span> :<span class="tlaUNC"> 0 : return 1;</span></span> |
| <span id="L192"><span class="lineNum"> 192</span> : : break;</span> |
| <span id="L193"><span class="lineNum"> 193</span> : : }</span> |
| <span id="L194"><span class="lineNum"> 194</span> : : </span> |
| <span id="L195"><span class="lineNum"> 195</span> :<span class="tlaGNC tlaBgGNC"> 3 : phys_map_init(fake_pvr[i]);</span></span> |
| <span id="L196"><span class="lineNum"> 196</span> : : </span> |
| <span id="L197"><span class="lineNum"> 197</span> : : /* Run tests */</span> |
| <span id="L198"><span class="lineNum"> 198</span> :<span class="tlaGNC"> 3 : check_table_directly();</span></span> |
| <span id="L199"><span class="lineNum"> 199</span> :<span class="tlaGNC"> 3 : check_map_call();</span></span> |
| <span id="L200"><span class="lineNum"> 200</span> : : }</span> |
| <span id="L201"><span class="lineNum"> 201</span> : : </span> |
| <span id="L202"><span class="lineNum"> 202</span> :<span class="tlaGNC"> 1 : return(0);</span></span> |
| <span id="L203"><span class="lineNum"> 203</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> |
