summaryrefslogtreecommitdiff
path: root/rep/ept/core/apt/recordparser.cpp.gcov.html
diff options
context:
space:
mode:
authorEnrico Zini <enrico@enricozini.org>2009-09-29 15:08:02 +0100
committerEnrico Zini <enrico@enricozini.org>2009-09-29 15:08:02 +0100
commit006621455482edd8abf46a05292120745f99f7ec (patch)
treeff1318ccc409a3dd0519035ce2949ac8a48e969e /rep/ept/core/apt/recordparser.cpp.gcov.html
downloadlibept-006621455482edd8abf46a05292120745f99f7ec.tar.gz
Initial import
Diffstat (limited to 'rep/ept/core/apt/recordparser.cpp.gcov.html')
-rw-r--r--rep/ept/core/apt/recordparser.cpp.gcov.html239
1 files changed, 239 insertions, 0 deletions
diff --git a/rep/ept/core/apt/recordparser.cpp.gcov.html b/rep/ept/core/apt/recordparser.cpp.gcov.html
new file mode 100644
index 0000000..de47e25
--- /dev/null
+++ b/rep/ept/core/apt/recordparser.cpp.gcov.html
@@ -0,0 +1,239 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
+<html lang="en">
+
+<head>
+ <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+ <title>LCOV - lcov.info - ept/core/apt/recordparser.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">LTP GCOV extension - 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 class="headerItem" width="20%">Current&nbsp;view:</td>
+ <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/core/apt</a> - recordparser.cpp</td>
+ </tr>
+ <tr>
+ <td class="headerItem" width="20%">Test:</td>
+ <td class="headerValue" width="80%" colspan=4>lcov.info</td>
+ </tr>
+ <tr>
+ <td class="headerItem" width="20%">Date:</td>
+ <td class="headerValue" width="20%">2008-08-14</td>
+ <td width="20%"></td>
+ <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
+ <td class="headerValue" width="20%">62</td>
+ </tr>
+ <tr>
+ <td class="headerItem" width="20%">Code&nbsp;covered:</td>
+ <td class="headerValue" width="20%">95.2 %</td>
+ <td width="20%"></td>
+ <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
+ <td class="headerValue" width="20%">59</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="source">
+<span class="lineNum"> 1 </span> : /** \file
+<span class="lineNum"> 2 </span> : * Parser for APT records
+<span class="lineNum"> 3 </span> : */
+<span class="lineNum"> 4 </span> :
+<span class="lineNum"> 5 </span> : /*
+<span class="lineNum"> 6 </span> : * Copyright (C) 2007 Enrico Zini &lt;enrico@enricozini.org&gt;
+<span class="lineNum"> 7 </span> : *
+<span class="lineNum"> 8 </span> : * This library is free software; you can redistribute it and/or
+<span class="lineNum"> 9 </span> : * modify it under the terms of the GNU Lesser General Public
+<span class="lineNum"> 10 </span> : * License as published by the Free Software Foundation; either
+<span class="lineNum"> 11 </span> : * version 2.1 of the License, or (at your option) any later version.
+<span class="lineNum"> 12 </span> : *
+<span class="lineNum"> 13 </span> : * This library is distributed in the hope that it will be useful,
+<span class="lineNum"> 14 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of
+<span class="lineNum"> 15 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+<span class="lineNum"> 16 </span> : * Lesser General Public License for more details.
+<span class="lineNum"> 17 </span> : *
+<span class="lineNum"> 18 </span> : * You should have received a copy of the GNU Lesser General Public
+<span class="lineNum"> 19 </span> : * License along with this library; if not, write to the Free Software
+<span class="lineNum"> 20 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+<span class="lineNum"> 21 </span> : */
+<span class="lineNum"> 22 </span> :
+<span class="lineNum"> 23 </span> : #include &lt;ept/core/apt/recordparser.h&gt;
+<span class="lineNum"> 24 </span> :
+<span class="lineNum"> 25 </span> : #include &lt;algorithm&gt;
+<span class="lineNum"> 26 </span> : #include &lt;cctype&gt;
+<span class="lineNum"> 27 </span> :
+<span class="lineNum"> 28 </span> : //#include &lt;iostream&gt;
+<span class="lineNum"> 29 </span> :
+<span class="lineNum"> 30 </span> : using namespace std;
+<span class="lineNum"> 31 </span> :
+<span class="lineNum"> 32 </span> : namespace ept {
+<span class="lineNum"> 33 </span> : namespace core {
+<span class="lineNum"> 34 </span> : namespace record {
+<span class="lineNum"> 35 </span> :
+<span class="lineNum"> 36 </span> : struct rpcompare
+<span class="lineNum"> 37 </span> : {
+<span class="lineNum"> 38 </span> : const RecordParser&amp; rp;
+<span class="lineNum"> 39 </span><span class="lineCov"> 1310 : rpcompare(const RecordParser&amp; rp) : rp(rp) {}</span>
+<span class="lineNum"> 40 </span><span class="lineCov"> 89600 : bool operator()(size_t a, size_t b)</span>
+<span class="lineNum"> 41 </span> : {
+<span class="lineNum"> 42 </span><span class="lineCov"> 89600 : return rp.name(a) &lt; rp.name(b);</span>
+<span class="lineNum"> 43 </span> : }
+<span class="lineNum"> 44 </span> : };
+<span class="lineNum"> 45 </span> :
+<span class="lineNum"> 46 </span><span class="lineCov"> 1310 : void RecordParser::scan(const std::string&amp; str)</span>
+<span class="lineNum"> 47 </span> : {
+<span class="lineNum"> 48 </span><span class="lineCov"> 1310 : buffer = str;</span>
+<span class="lineNum"> 49 </span><span class="lineCov"> 1310 : ends.clear();</span>
+<span class="lineNum"> 50 </span><span class="lineCov"> 1310 : sorted.clear();</span>
+<span class="lineNum"> 51 </span> :
+<span class="lineNum"> 52 </span> : //cerr &lt;&lt; &quot;PARSE &quot; &lt;&lt; endl &lt;&lt; buffer &lt;&lt; &quot;*****&quot; &lt;&lt; endl;
+<span class="lineNum"> 53 </span> :
+<span class="lineNum"> 54 </span> : // Scan the buffer, taking note of all ending offsets of the various fields
+<span class="lineNum"> 55 </span><span class="lineCov"> 1310 : size_t pos = 0;</span>
+<span class="lineNum"> 56 </span><span class="lineCov"> 1310 : size_t idx = 0;</span>
+<span class="lineNum"> 57 </span><span class="lineCov"> 29815 : while (pos &lt; buffer.size() - 1)</span>
+<span class="lineNum"> 58 </span> : {
+<span class="lineNum"> 59 </span> : //cerr &lt;&lt; &quot;PREPOS &quot; &lt;&lt; pos &lt;&lt; &quot; left: &quot; &lt;&lt; buffer.substr(pos, 10) &lt;&lt; endl;
+<span class="lineNum"> 60 </span><span class="lineCov"> 28505 : pos = buffer.find(&quot;\n&quot;, pos);</span>
+<span class="lineNum"> 61 </span> : //cerr &lt;&lt; &quot;POSTPOS &quot; &lt;&lt; pos &lt;&lt; &quot; left: &quot; &lt;&lt; (pos == string::npos ? &quot;NONE&quot; : buffer.substr(pos, 10)) &lt;&lt; endl;
+<span class="lineNum"> 62 </span> :
+<span class="lineNum"> 63 </span> : // The buffer does not end with a newline
+<span class="lineNum"> 64 </span><span class="lineCov"> 28505 : if (pos == string::npos)</span>
+<span class="lineNum"> 65 </span> : {
+<span class="lineNum"> 66 </span> : //cerr &lt;&lt; &quot;ENDNOTEOL&quot; &lt;&lt; endl;
+<span class="lineNum"> 67 </span><span class="lineCov"> 1 : pos = buffer.size();</span>
+<span class="lineNum"> 68 </span><span class="lineCov"> 1 : ends.push_back(pos);</span>
+<span class="lineNum"> 69 </span><span class="lineCov"> 1 : sorted.push_back(idx++);</span>
+<span class="lineNum"> 70 </span><span class="lineCov"> 1 : break;</span>
+<span class="lineNum"> 71 </span> : }
+<span class="lineNum"> 72 </span> :
+<span class="lineNum"> 73 </span><span class="lineCov"> 28504 : ++pos;</span>
+<span class="lineNum"> 74 </span> : //cerr &lt;&lt; &quot;POSTPOSINC &quot; &lt;&lt; pos &lt;&lt; &quot; left: &quot; &lt;&lt; buffer.substr(pos, 10) &lt;&lt; endl;
+<span class="lineNum"> 75 </span> :
+<span class="lineNum"> 76 </span> : // The buffer ends with a newline
+<span class="lineNum"> 77 </span><span class="lineCov"> 28504 : if (pos == buffer.size())</span>
+<span class="lineNum"> 78 </span> : {
+<span class="lineNum"> 79 </span> : //cerr &lt;&lt; &quot;ENDEOL&quot; &lt;&lt; endl;
+<span class="lineNum"> 80 </span><span class="lineCov"> 1309 : ends.push_back(pos);</span>
+<span class="lineNum"> 81 </span><span class="lineCov"> 1309 : sorted.push_back(idx++);</span>
+<span class="lineNum"> 82 </span><span class="lineCov"> 1309 : break;</span>
+<span class="lineNum"> 83 </span> : }
+<span class="lineNum"> 84 </span> :
+<span class="lineNum"> 85 </span> : // Terminate parsing on double newlines
+<span class="lineNum"> 86 </span><span class="lineCov"> 27195 : if (buffer[pos] == '\n')</span>
+<span class="lineNum"> 87 </span> : {
+<span class="lineNum"> 88 </span> : //cerr &lt;&lt; &quot;ENDDOUBLENL&quot; &lt;&lt; endl;
+<span class="lineNum"> 89 </span><span class="lineNoCov"> 0 : ends.push_back(pos);</span>
+<span class="lineNum"> 90 </span><span class="lineNoCov"> 0 : sorted.push_back(idx++);</span>
+<span class="lineNum"> 91 </span><span class="lineNoCov"> 0 : break;</span>
+<span class="lineNum"> 92 </span> : }
+<span class="lineNum"> 93 </span> :
+<span class="lineNum"> 94 </span> : // Mark the end of the field if it's not a continuation line
+<span class="lineNum"> 95 </span><span class="lineCov"> 27195 : if (!isspace(buffer[pos]))</span>
+<span class="lineNum"> 96 </span> : {
+<span class="lineNum"> 97 </span> : //cerr &lt;&lt; &quot;INNERFIELD&quot; &lt;&lt; endl;
+<span class="lineNum"> 98 </span><span class="lineCov"> 17224 : ends.push_back(pos);</span>
+<span class="lineNum"> 99 </span><span class="lineCov"> 17224 : sorted.push_back(idx++);</span>
+<span class="lineNum"> 100 </span> : } //else
+<span class="lineNum"> 101 </span> : //cerr &lt;&lt; &quot;CONTLINE&quot; &lt;&lt; endl;
+<span class="lineNum"> 102 </span> : }
+<span class="lineNum"> 103 </span> :
+<span class="lineNum"> 104 </span> : // Sort the sorted array
+<span class="lineNum"> 105 </span><span class="lineCov"> 1310 : sort(sorted.begin(), sorted.end(), rpcompare(*this));</span>
+<span class="lineNum"> 106 </span> :
+<span class="lineNum"> 107 </span> : //for (size_t i = 0; i &lt; ends.size(); ++i)
+<span class="lineNum"> 108 </span> : // cerr &lt;&lt; ends[i] &lt;&lt; &quot;\t&quot; &lt;&lt; name(i) &lt;&lt; &quot;\t&quot; &lt;&lt; sorted[i] &lt;&lt; &quot;\t&quot; &lt;&lt; name(sorted[i]) &lt;&lt; endl;
+<span class="lineNum"> 109 </span><span class="lineCov"> 1310 : }</span>
+<span class="lineNum"> 110 </span> :
+<span class="lineNum"> 111 </span><span class="lineCov"> 187124 : std::string RecordParser::field(size_t idx) const</span>
+<span class="lineNum"> 112 </span> : {
+<span class="lineNum"> 113 </span><span class="lineCov"> 187124 : if (idx &gt;= ends.size())</span>
+<span class="lineNum"> 114 </span><span class="lineCov"> 1 : return string();</span>
+<span class="lineNum"> 115 </span><span class="lineCov"> 187123 : if (idx == 0)</span>
+<span class="lineNum"> 116 </span><span class="lineCov"> 16577 : return buffer.substr(0, ends[0]);</span>
+<span class="lineNum"> 117 </span> : else
+<span class="lineNum"> 118 </span><span class="lineCov"> 170546 : return buffer.substr(ends[idx-1], ends[idx]-ends[idx-1]);</span>
+<span class="lineNum"> 119 </span> : }
+<span class="lineNum"> 120 </span> :
+<span class="lineNum"> 121 </span><span class="lineCov"> 185814 : std::string RecordParser::name(size_t idx) const</span>
+<span class="lineNum"> 122 </span> : {
+<span class="lineNum"> 123 </span><span class="lineCov"> 185814 : string res = field(idx);</span>
+<span class="lineNum"> 124 </span><span class="lineCov"> 185814 : size_t pos = res.find(&quot;:&quot;);</span>
+<span class="lineNum"> 125 </span><span class="lineCov"> 185814 : if (pos == string::npos)</span>
+<span class="lineNum"> 126 </span><span class="lineCov"> 2 : return res;</span>
+<span class="lineNum"> 127 </span><span class="lineCov"> 185812 : return res.substr(0, pos);</span>
+<span class="lineNum"> 128 </span> : }
+<span class="lineNum"> 129 </span> :
+<span class="lineNum"> 130 </span><span class="lineCov"> 1310 : std::string RecordParser::lookup(size_t idx) const</span>
+<span class="lineNum"> 131 </span> : {
+<span class="lineNum"> 132 </span><span class="lineCov"> 1310 : string res = field(idx);</span>
+<span class="lineNum"> 133 </span><span class="lineCov"> 1310 : size_t pos = res.find(&quot;:&quot;);</span>
+<span class="lineNum"> 134 </span><span class="lineCov"> 1310 : if (pos == string::npos)</span>
+<span class="lineNum"> 135 </span><span class="lineCov"> 1 : return res;</span>
+<span class="lineNum"> 136 </span> : // Skip initial whitespace after the :
+<span class="lineNum"> 137 </span><span class="lineCov"> 1309 : for (++pos; pos &lt; res.size() &amp;&amp; isspace(res[pos]); ++pos)</span>
+<span class="lineNum"> 138 </span> : ;
+<span class="lineNum"> 139 </span><span class="lineCov"> 1309 : res = res.substr(pos);</span>
+<span class="lineNum"> 140 </span> : // Trim spaces at the end
+<span class="lineNum"> 141 </span><span class="lineCov"> 3927 : while (!res.empty() &amp;&amp; isspace(res[res.size() - 1]))</span>
+<span class="lineNum"> 142 </span><span class="lineCov"> 1309 : res.resize(res.size() - 1);</span>
+<span class="lineNum"> 143 </span><span class="lineCov"> 1309 : return res;</span>
+<span class="lineNum"> 144 </span> : }
+<span class="lineNum"> 145 </span> :
+<span class="lineNum"> 146 </span><span class="lineCov"> 1310 : size_t RecordParser::index(const std::string&amp; str) const</span>
+<span class="lineNum"> 147 </span> : {
+<span class="lineNum"> 148 </span> : int begin, end;
+<span class="lineNum"> 149 </span> :
+<span class="lineNum"> 150 </span> : /* Binary search */
+<span class="lineNum"> 151 </span><span class="lineCov"> 1310 : begin = -1, end = size();</span>
+<span class="lineNum"> 152 </span><span class="lineCov"> 7924 : while (end - begin &gt; 1)</span>
+<span class="lineNum"> 153 </span> : {
+<span class="lineNum"> 154 </span><span class="lineCov"> 5304 : int cur = (end + begin) / 2;</span>
+<span class="lineNum"> 155 </span> : //cerr &lt;&lt; &quot;Test &quot; &lt;&lt; cur &lt;&lt; &quot; &quot; &lt;&lt; str &lt;&lt; &quot; &lt; &quot; &lt;&lt; name(cur) &lt;&lt; endl;
+<span class="lineNum"> 156 </span><span class="lineCov"> 5304 : if (name(sorted[cur]) &gt; str)</span>
+<span class="lineNum"> 157 </span><span class="lineCov"> 1724 : end = cur;</span>
+<span class="lineNum"> 158 </span> : else
+<span class="lineNum"> 159 </span><span class="lineCov"> 3580 : begin = cur;</span>
+<span class="lineNum"> 160 </span> : }
+<span class="lineNum"> 161 </span> :
+<span class="lineNum"> 162 </span><span class="lineCov"> 1310 : if (begin == -1 || name(sorted[begin]) != str)</span>
+<span class="lineNum"> 163 </span><span class="lineCov"> 1 : return size();</span>
+<span class="lineNum"> 164 </span> : else
+<span class="lineNum"> 165 </span><span class="lineCov"> 1309 : return sorted[begin];</span>
+<span class="lineNum"> 166 </span> : }
+<span class="lineNum"> 167 </span> :
+<span class="lineNum"> 168 </span> : }
+<span class="lineNum"> 169 </span> : }
+<span class="lineNum"> 170 </span> : }
+<span class="lineNum"> 171 </span> :
+<span class="lineNum"> 172 </span> : // vim:set ts=4 sw=4:
+</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="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
+ </table>
+ <br>
+
+</body>
+</html>