4 // Fraunhofer Institute for Open Communication Systems (FOKUS)
5 // Competence Center NETwork research (NET), St. Augustin, GERMANY
6 // Stefan Bund <g0dil@berlios.de>
8 // This program is free software; you can redistribute it and/or modify
9 // it under the terms of the GNU General Public License as published by
10 // the Free Software Foundation; either version 2 of the License, or
11 // (at your option) any later version.
13 // This program is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License
19 // along with this program; if not, write to the
20 // Free Software Foundation, Inc.,
21 // 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
24 \brief ListBParser.test unit tests */
26 //#include "ListBParser.test.hh"
27 //#include "ListBParser.test.ih"
32 #include "../Utils/auto_unit_test.hh"
33 #include <boost/test/test_tools.hpp>
36 ///////////////////////////////cc.p////////////////////////////////////////
39 struct VoidPacket : public senf::PacketTypeBase
42 struct VectorParser : public senf::PacketParserBase
44 # include SENF_PARSER()
46 SENF_PARSER_PRIVATE_FIELD( size, senf::UInt8Parser );
47 SENF_PARSER_VECTOR( vec, size, senf::UInt16Parser );
49 SENF_PARSER_FINALIZE(VectorParser);
52 typedef senf::ListParser<
53 senf::detail::ListBParser_Policy<
55 senf::detail::PrefixAuxParserPolicy<senf::UInt16Parser> > > MyListBParser;
58 BOOST_AUTO_UNIT_TEST(ListBParser)
60 senf::PacketInterpreterBase::ptr pi (senf::PacketInterpreter<VoidPacket>::create(
61 MyListBParser::init_bytes));
63 MyListBParser p (pi->data().begin(),&pi->data());
65 BOOST_CHECK_EQUAL( p.size(), 0u );
66 BOOST_CHECK_EQUAL( p.bytes(), 2u );
67 BOOST_CHECK( p.empty() );
69 // the mutators are really tested together with the container wrappers since they are based
70 // on the container wrapper. Here we only need one call to make the list larger ...
73 p = MyListBParser(pi->data().begin(),&pi->data());
74 BOOST_CHECK_EQUAL( p.bytes(), 3u );
75 BOOST_CHECK_EQUAL( p.size(), 1u );
76 BOOST_CHECK( ! p.empty() );
79 BOOST_AUTO_UNIT_TEST(ListBParser_container)
81 senf::PacketInterpreterBase::ptr pi (senf::PacketInterpreter<VoidPacket>::create(
82 MyListBParser::init_bytes));
85 MyListBParser::container c (MyListBParser(pi->data().begin(),&pi->data()));
87 BOOST_CHECK_EQUAL( c.size(), 0u );
88 BOOST_CHECK_EQUAL( c.bytes(), 2u );
89 BOOST_CHECK( c.begin() == c.end() );
92 BOOST_CHECK_EQUAL( c.size(), 1u );
93 BOOST_CHECK_EQUAL( c.bytes(), 3u );
95 BOOST_CHECK_EQUAL( c.front().vec().size(), 0u );
96 c.front().vec().push_back(0x1234u);
97 BOOST_CHECK_EQUAL( c.bytes(), 5u );
100 senf::PacketInterpreterBase::ptr pi2 (senf::PacketInterpreter<VoidPacket>::create(
101 MyListBParser::init_bytes));
102 MyListBParser::container c2 (MyListBParser(pi2->data().begin(),&pi2->data()));
103 c2.push_back_space();
105 VectorParser::vec_t::container c2v (c2.front().vec());
106 c2v.push_back(0x2345u);
107 c2v.push_back(0x3456u);
110 BOOST_CHECK_EQUAL(c2.size(), 1u);
111 BOOST_CHECK_EQUAL(c2.bytes(), 7u);
113 c.insert(c.end(),c2.back());
114 BOOST_CHECK_EQUAL( c.size(), 2u );
115 BOOST_CHECK_EQUAL( c.bytes(), 10u );
116 BOOST_CHECK_EQUAL( c.back().vec()[0], 0x2345u );
117 BOOST_CHECK_EQUAL( c.back().bytes(), c2.back().bytes() );
119 c2.back().vec()[0] << 0x1357u;
120 c.insert(boost::next(c.begin()), 2u, c2.back());
121 BOOST_CHECK_EQUAL( c.size(), 4u );
122 BOOST_CHECK_EQUAL( c.bytes(), 20u );
123 BOOST_CHECK_EQUAL( (*boost::next(c.begin())).vec()[0], 0x1357u );
124 BOOST_CHECK_EQUAL( (*boost::next(c.begin(),2)).vec()[0], 0x1357u );
126 c2.back().vec()[0] << 0x2468u;
127 c.insert(c.begin(),c2.begin(),c2.end());
128 BOOST_CHECK_EQUAL( c.size(), 5u );
129 BOOST_CHECK_EQUAL( c.bytes(), 25u );
130 BOOST_CHECK_EQUAL( c.front().vec()[0], 0x2468u );
132 c.erase(c.begin(),2);
133 BOOST_CHECK_EQUAL( c.size(), 3u );
134 BOOST_CHECK_EQUAL( c.bytes(), 17u );
135 BOOST_CHECK_EQUAL( c.front().vec()[0],0x1357u );
136 BOOST_CHECK_EQUAL( c.back().vec()[0], 0x2345u );
138 c.erase((boost::next(c.begin(),2)),c.end());
139 BOOST_CHECK_EQUAL( c.size(), 2u );
140 BOOST_CHECK_EQUAL( c.bytes(), 12u );
141 BOOST_CHECK_EQUAL( c.front().vec()[0],0x1357u );
142 BOOST_CHECK_EQUAL( c.back().vec()[0], 0x1357u );
145 BOOST_CHECK_EQUAL( c.size(), 0u );
146 BOOST_CHECK_EQUAL( c.bytes(), 2u );
155 typedef unsigned value_type;
156 static unsigned get(unsigned v) { return v/2; }
157 static unsigned set(unsigned v) { return 2*v; }
160 struct TestListParser
161 : public senf::PacketParserBase
163 # include SENF_PARSER()
165 SENF_PARSER_PRIVATE_FIELD ( size1 , senf::UInt8Parser );
166 SENF_PARSER_PRIVATE_FIELD ( size2 , senf::UInt8Parser );
167 SENF_PARSER_FIELD ( dummy , senf::UInt32Parser );
168 SENF_PARSER_LIST ( list1 , bytes(size1) , VectorParser );
169 SENF_PARSER_LIST ( list2 , transform(TestTransform, bytes(size2)) ,
172 SENF_PARSER_FINALIZE(TestListParser);
177 BOOST_AUTO_UNIT_TEST(listBytesMacro)
179 unsigned char data[] = { 8, // size1
181 0x01, 0x02, 0x03, 0x04, // dummy
182 0x01, // list1()[0].size()
183 0x05, 0x06, // list1().vec()[0]
184 0x02, // list1()[1].size()
185 0x07, 0x08, // list1()[1].vec()[0]
186 0x09, 0x0A, // list1()[1].vec()[1]
187 0x00, // list2()[0].size()
188 0x02, // list2()[1].size()
189 0x0B, 0x0C, // list2()[1].vec()[0]
190 0x0D, 0x0E, // list2()[1].vec()[1]
191 0x01, // list2()[2].size()
192 0x0F, 0x10 }; // list2()[2].vec()[0]
194 senf::DataPacket p (senf::DataPacket::create(data));
195 TestListParser parser (p.data().begin(), &p.data());
197 BOOST_CHECK_EQUAL( parser.list1().size(), 2u );
198 BOOST_CHECK_EQUAL( parser.list2().size(), 3u );
199 BOOST_CHECK_EQUAL( parser.dummy(), 0x01020304u );
201 TestListParser::list2_t::container list2 (parser.list2());
204 TestListParser::list1_t::container list (parser.list1());
205 BOOST_CHECK_EQUAL( list.size(), 2u );
207 TestListParser::list1_t::container::iterator i (list.begin());
208 BOOST_CHECK_EQUAL( i->vec().size(), 1u );
209 BOOST_CHECK_EQUAL( i->vec()[0], 0x0506u );
212 BOOST_CHECK_EQUAL( i->vec().size(), 2u );
213 BOOST_CHECK_EQUAL( i->vec()[0], 0x0708u );
214 BOOST_CHECK_EQUAL( i->vec()[1], 0x090Au );
217 BOOST_CHECK( i == list.end() );
221 TestListParser::list2_t::container list (parser.list2());
222 BOOST_CHECK_EQUAL( list.size(), 3u );
224 TestListParser::list2_t::container::iterator i (list.begin());
225 BOOST_CHECK_EQUAL( i->vec().size(), 0u );
228 BOOST_CHECK_EQUAL( i->vec().size(), 2u );
229 BOOST_CHECK_EQUAL( i->vec()[0], 0x0B0Cu );
230 BOOST_CHECK_EQUAL( i->vec()[1], 0x0D0Eu );
233 BOOST_CHECK_EQUAL( i->vec().size(), 1u );
234 BOOST_CHECK_EQUAL( i->vec()[0], 0x0F10u );
237 BOOST_CHECK( i == list.end() );
243 ///////////////////////////////cc.e////////////////////////////////////////
250 // comment-column: 40
251 // c-file-style: "senf"
252 // indent-tabs-mode: nil
253 // ispell-local-dictionary: "american"
254 // compile-command: "scons -u test"