automotive/dbc
1
0 Fork 0
Code Issues 4 Pull Requests Actions Packages Projects Releases Wiki Activity

simlyfy

Browse Source
This commit is contained in:
deeaitch committed 2026-10-20 13:38:21 -04:00
1 parent 849ce31e2f
commit a55d1c58ed
272 files changed
+41866 -261
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

build-coverage/html/core/tree_node.cpp.gcov.html
+183
View File
@@ -0,0 +1,183 @@
<!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 - coverage.info - core/tree_node.cpp</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" title="Click to go to top-level">top level</a> - <a href="index.html" title="Click to go to directory core">core</a> - tree_node.cpp<span style="font-size: 80%;"> (source / <a href="tree_node.cpp.func-c.html" title="Click to go to function table">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">coverage.info</td>
<td></td>
<td class="headerItem">Lines:</td>
<td class="headerCovTableEntryHi">98.1&nbsp;%</td>
<td class="headerCovTableEntry">53</td>
<td class="headerCovTableEntry">52</td>
</tr>
<tr>
<td class="headerItem">Test Date:</td>
<td class="headerValue">2026-10-20 13:34:58</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntryHi">100.0&nbsp;%</td>
<td class="headerCovTableEntry">15</td>
<td class="headerCovTableEntry">15</td>
</tr>
<tr>
<td></td>
<td></td>
<td></td>
<td class="headerItem">Branches:</td>
<td class="headerCovTableEntryMed">76.2&nbsp;%</td>
<td class="headerCovTableEntry">42</td>
<td class="headerCovTableEntry">32</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> : : /**</span>
<span id="L2"><span class="lineNum"> 2</span> : : * @file tree_node.cpp</span>
<span id="L3"><span class="lineNum"> 3</span> : : * @brief Tree node ownership and navigation.</span>
<span id="L4"><span class="lineNum"> 4</span> : : *</span>
<span id="L5"><span class="lineNum"> 5</span> : : * Created: 2026-03-13</span>
<span id="L6"><span class="lineNum"> 6</span> : : * Author: Deeaitch (Dim. Himro)</span>
<span id="L7"><span class="lineNum"> 7</span> : : *</span>
<span id="L8"><span class="lineNum"> 8</span> : : * Licensed under the MIT License.</span>
<span id="L9"><span class="lineNum"> 9</span> : : * See LICENSE file in the project root for full license text.</span>
<span id="L10"><span class="lineNum"> 10</span> : : */</span>
<span id="L11"><span class="lineNum"> 11</span> : : </span>
<span id="L12"><span class="lineNum"> 12</span> : : #include &quot;tree_node.h&quot;</span>
<span id="L13"><span class="lineNum"> 13</span> : : #include &lt;stdexcept&gt;</span>
<span id="L14"><span class="lineNum"> 14</span> : : </span>
<span id="L15"><span class="lineNum"> 15</span> :<span class="tlaGNC"> 22 : TreeNode::TreeNode()</span></span>
<span id="L16"><span class="lineNum"> 16</span> [<span class="tlaGBC" title="Branch 0 was taken 22 times"> + </span><span class="tlaUNC" title="Branch 1 was not taken"> - </span>]:<span class="tlaGNC"> 66 : : m_type(NodeType::Root), m_name(&quot;dbc&quot;) {</span></span>
<span id="L17"><span class="lineNum"> 17</span> :<span class="tlaGNC"> 22 : }</span></span>
<span id="L18"><span class="lineNum"> 18</span> : : </span>
<span id="L19"><span class="lineNum"> 19</span> :<span class="tlaGNC"> 97 : TreeNode::TreeNode(const FrameInfo &amp;frame)</span></span>
<span id="L20"><span class="lineNum"> 20</span> [<span class="tlaGBC" title="Branch 0 was taken 97 times"> + </span><span class="tlaUNC" title="Branch 1 was not taken"> - </span>]:<span class="tlaGNC"> 97 : : m_type(NodeType::Frame), m_name(frame.name), m_frame(std::make_unique&lt;FrameInfo&gt;(frame)) {</span></span>
<span id="L21"><span class="lineNum"> 21</span> :<span class="tlaGNC"> 97 : }</span></span>
<span id="L22"><span class="lineNum"> 22</span> : : </span>
<span id="L23"><span class="lineNum"> 23</span> :<span class="tlaGNC"> 110 : TreeNode::TreeNode(const SignalInfo &amp;signal)</span></span>
<span id="L24"><span class="lineNum"> 24</span> [<span class="tlaGBC" title="Branch 0 was taken 110 times"> + </span><span class="tlaUNC" title="Branch 1 was not taken"> - </span>]:<span class="tlaGNC"> 110 : : m_type(NodeType::Signal), m_name(signal.name), m_signal(std::make_unique&lt;SignalInfo&gt;(signal)) {</span></span>
<span id="L25"><span class="lineNum"> 25</span> :<span class="tlaGNC"> 110 : }</span></span>
<span id="L26"><span class="lineNum"> 26</span> : : </span>
<span id="L27"><span class="lineNum"> 27</span> :<span class="tlaGNC"> 206 : void TreeNode::AddChild(std::unique_ptr&lt;TreeNode&gt; &amp;&amp;child) {</span></span>
<span id="L28"><span class="lineNum"> 28</span> [<span class="tlaGBC" title="Branch 0 was taken 205 times"> + </span><span class="tlaGBC" title="Branch 1 was taken 1 time"> + </span>]:<span class="tlaGNC"> 206 : if (child) {</span></span>
<span id="L29"><span class="lineNum"> 29</span> [<span class="tlaGBC" title="Branch 0 was taken 271 times"> + </span><span class="tlaGBC" title="Branch 1 was taken 203 times"> + </span>]:<span class="tlaGNC"> 474 : for (const TreeNode *ancestor = this; ancestor; ancestor = ancestor-&gt;m_parent) {</span></span>
<span id="L30"><span class="lineNum"> 30</span> [<span class="tlaGBC" title="Branch 0 was taken 2 times"> + </span><span class="tlaGBC" title="Branch 1 was taken 269 times"> + </span>]:<span class="tlaGNC"> 271 : if (ancestor == child.get())</span></span>
<span id="L31"><span class="lineNum"> 31</span> [<span class="tlaGBC" title="Branch 0 was taken 2 times"> + </span><span class="tlaUNC" title="Branch 1 was not taken"> - </span>]:<span class="tlaGNC"> 2 : throw std::invalid_argument(&quot;Cannot insert a node into its own subtree&quot;);</span></span>
<span id="L32"><span class="lineNum"> 32</span> : : }</span>
<span id="L33"><span class="lineNum"> 33</span> [<span class="tlaUNC" title="Branch 0 was not taken"> - </span><span class="tlaGBC" title="Branch 1 was taken 203 times"> + </span>]:<span class="tlaGNC"> 203 : if (child-&gt;m_parent)</span></span>
<span id="L34"><span class="lineNum"> 34</span> [<span class="tlaUNC" title="Branch 0 was not executed"> # </span><span class="tlaUNC" title="Branch 1 was not executed"> # </span>]:<span class="tlaUNC"> 0 : throw std::invalid_argument(&quot;Child is already attached&quot;);</span></span>
<span id="L35"><span class="lineNum"> 35</span> :<span class="tlaGNC"> 203 : m_children.push_back(std::move(child));</span></span>
<span id="L36"><span class="lineNum"> 36</span> :<span class="tlaGNC"> 203 : m_children.back()-&gt;m_parent = this;</span></span>
<span id="L37"><span class="lineNum"> 37</span> :<span class="tlaGNC"> 203 : m_children.back()-&gt;m_row = m_children.size() - 1U;</span></span>
<span id="L38"><span class="lineNum"> 38</span> : : }</span>
<span id="L39"><span class="lineNum"> 39</span> :<span class="tlaGNC"> 204 : }</span></span>
<span id="L40"><span class="lineNum"> 40</span> : : </span>
<span id="L41"><span class="lineNum"> 41</span> :<span class="tlaGNC"> 2120 : std::size_t TreeNode::GetChildCount() const {</span></span>
<span id="L42"><span class="lineNum"> 42</span> :<span class="tlaGNC"> 2120 : return m_children.size();</span></span>
<span id="L43"><span class="lineNum"> 43</span> : : }</span>
<span id="L44"><span class="lineNum"> 44</span> : : </span>
<span id="L45"><span class="lineNum"> 45</span> :<span class="tlaGNC"> 3430 : const TreeNode *TreeNode::GetChild(std::size_t index) const {</span></span>
<span id="L46"><span class="lineNum"> 46</span> [<span class="tlaGBC" title="Branch 0 was taken 1107 times"> + </span><span class="tlaGBC" title="Branch 1 was taken 2323 times"> + </span>]:<span class="tlaGNC"> 3430 : if (index &gt;= m_children.size())</span></span>
<span id="L47"><span class="lineNum"> 47</span> :<span class="tlaGNC"> 1107 : return nullptr;</span></span>
<span id="L48"><span class="lineNum"> 48</span> : : </span>
<span id="L49"><span class="lineNum"> 49</span> :<span class="tlaGNC"> 2323 : return m_children[index].get();</span></span>
<span id="L50"><span class="lineNum"> 50</span> : : }</span>
<span id="L51"><span class="lineNum"> 51</span> : : </span>
<span id="L52"><span class="lineNum"> 52</span> :<span class="tlaGNC"> 91 : TreeNode *TreeNode::GetChild(std::size_t index) {</span></span>
<span id="L53"><span class="lineNum"> 53</span> [<span class="tlaGBC" title="Branch 0 was taken 2 times"> + </span><span class="tlaGBC" title="Branch 1 was taken 89 times"> + </span>]:<span class="tlaGNC"> 91 : if (index &gt;= m_children.size())</span></span>
<span id="L54"><span class="lineNum"> 54</span> :<span class="tlaGNC"> 2 : return nullptr;</span></span>
<span id="L55"><span class="lineNum"> 55</span> : : </span>
<span id="L56"><span class="lineNum"> 56</span> :<span class="tlaGNC"> 89 : return m_children[index].get();</span></span>
<span id="L57"><span class="lineNum"> 57</span> : : }</span>
<span id="L58"><span class="lineNum"> 58</span> : : </span>
<span id="L59"><span class="lineNum"> 59</span> :<span class="tlaGNC"> 44 : NodeType TreeNode::GetType() const {</span></span>
<span id="L60"><span class="lineNum"> 60</span> :<span class="tlaGNC"> 44 : return m_type;</span></span>
<span id="L61"><span class="lineNum"> 61</span> : : }</span>
<span id="L62"><span class="lineNum"> 62</span> : : </span>
<span id="L63"><span class="lineNum"> 63</span> :<span class="tlaGNC"> 29 : const std::string &amp;TreeNode::GetName() const {</span></span>
<span id="L64"><span class="lineNum"> 64</span> :<span class="tlaGNC"> 29 : return m_name;</span></span>
<span id="L65"><span class="lineNum"> 65</span> : : }</span>
<span id="L66"><span class="lineNum"> 66</span> : : </span>
<span id="L67"><span class="lineNum"> 67</span> :<span class="tlaGNC"> 274 : const FrameInfo *TreeNode::GetFrame() const {</span></span>
<span id="L68"><span class="lineNum"> 68</span> :<span class="tlaGNC"> 274 : return m_frame.get();</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"> 281 : const SignalInfo *TreeNode::GetSignal() const {</span></span>
<span id="L72"><span class="lineNum"> 72</span> :<span class="tlaGNC"> 281 : return m_signal.get();</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> :<span class="tlaGNC"> 1875 : const TreeNode *TreeNode::GetParent() const {</span></span>
<span id="L76"><span class="lineNum"> 76</span> :<span class="tlaGNC"> 1875 : return m_parent;</span></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> :<span class="tlaGNC"> 1547 : std::size_t TreeNode::GetRow() const {</span></span>
<span id="L80"><span class="lineNum"> 80</span> :<span class="tlaGNC"> 1547 : return m_row;</span></span>
<span id="L81"><span class="lineNum"> 81</span> : : }</span>
<span id="L82"><span class="lineNum"> 82</span> : : </span>
<span id="L83"><span class="lineNum"> 83</span> :<span class="tlaGNC"> 23 : std::optional&lt;FrameKey&gt; TreeNode::GetFrameKey() const {</span></span>
<span id="L84"><span class="lineNum"> 84</span> [<span class="tlaGBC" title="Branch 0 was taken 13 times"> + </span><span class="tlaGBC" title="Branch 1 was taken 10 times"> + </span>]:<span class="tlaGNC"> 23 : if (m_frame)</span></span>
<span id="L85"><span class="lineNum"> 85</span> :<span class="tlaGNC"> 13 : return FrameKey(m_frame-&gt;canId, m_frame-&gt;isExtended);</span></span>
<span id="L86"><span class="lineNum"> 86</span> [<span class="tlaGBC" title="Branch 0 was taken 8 times"> + </span><span class="tlaGBC" title="Branch 1 was taken 2 times"> + </span><span class="tlaGBC" title="Branch 2 was taken 6 times"> + </span><span class="tlaGBC" title="Branch 3 was taken 2 times"> + </span> :<span class="tlaGNC"> 10 : if (m_signal &amp;&amp; m_parent &amp;&amp; m_parent-&gt;GetType() == NodeType::Frame)</span></span>
<span class="lineNum"> </span> <span class="tlaGBC" title="Branch 4 was taken 6 times"> + </span><span class="tlaUNC" title="Branch 5 was not taken"> - </span><span class="tlaGBC" title="Branch 6 was taken 6 times"> + </span><span class="tlaGBC" title="Branch 7 was taken 4 times"> + </span>]
<span id="L87"><span class="lineNum"> 87</span> :<span class="tlaGNC"> 6 : return m_parent-&gt;GetFrameKey();</span></span>
<span id="L88"><span class="lineNum"> 88</span> :<span class="tlaGNC"> 4 : return std::nullopt;</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"> 9 : std::optional&lt;SignalKey&gt; TreeNode::GetSignalKey() const {</span></span>
<span id="L92"><span class="lineNum"> 92</span> [<span class="tlaGBC" title="Branch 0 was taken 9 times"> + </span><span class="tlaUNC" title="Branch 1 was not taken"> - </span>]:<span class="tlaGNC"> 9 : const std::optional&lt;FrameKey&gt; frame = GetFrameKey();</span></span>
<span id="L93"><span class="lineNum"> 93</span> [<span class="tlaGBC" title="Branch 0 was taken 6 times"> + </span><span class="tlaGBC" title="Branch 1 was taken 3 times"> + </span><span class="tlaGBC" title="Branch 2 was taken 5 times"> + </span><span class="tlaGBC" title="Branch 3 was taken 1 time"> + </span> :<span class="tlaGNC"> 9 : if (m_signal &amp;&amp; frame)</span></span>
<span class="lineNum"> </span> <span class="tlaGBC" title="Branch 4 was taken 5 times"> + </span><span class="tlaGBC" title="Branch 5 was taken 4 times"> + </span>]
<span id="L94"><span class="lineNum"> 94</span> [<span class="tlaGBC" title="Branch 0 was taken 5 times"> + </span><span class="tlaUNC" title="Branch 1 was not taken"> - </span>]:<span class="tlaGNC"> 5 : return SignalKey(*frame, m_signal-&gt;name);</span></span>
<span id="L95"><span class="lineNum"> 95</span> :<span class="tlaGNC"> 4 : return std::nullopt;</span></span>
<span id="L96"><span class="lineNum"> 96</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>