vector<LogicDataSnapshot::EdgePair> edges;
s.get_subsampled_edges(edges, 0, Length-1, 1, 7);
- BOOST_REQUIRE_EQUAL(edges.size(), 32);
- for(int i = 0; i < 31; i++)
+ BOOST_CHECK_EQUAL(edges.size(), 32);
+
+ for(int i = 0; i < edges.size() - 1; i++)
{
- BOOST_REQUIRE_EQUAL(edges[i].first, i * 32768);
- BOOST_REQUIRE_EQUAL(edges[i].second, i & 1);
+ BOOST_CHECK_EQUAL(edges[i].first, i * 32768);
+ BOOST_CHECK_EQUAL(edges[i].second, i & 1);
+ }
+
+ BOOST_CHECK_EQUAL(edges[31].first, 999999);
+}
+
+BOOST_AUTO_TEST_CASE(Pulses)
+{
+ const int Cycles = 3;
+ const int Period = 64;
+ const int Length = Cycles * Period;
+
+ vector<LogicDataSnapshot::EdgePair> edges;
+
+ //----- Create a LogicDataSnapshot -----//
+ sr_datafeed_logic logic;
+ logic.unitsize = 1;
+ logic.length = Length;
+ logic.data = (uint64_t*)new uint8_t[Length];
+ uint8_t *p = (uint8_t*)logic.data;
+
+ for(int i = 0; i < Cycles; i++) {
+ *p++ = 0xFF;
+ for(int j = 1; j < Period; j++)
+ *p++ = 0x00;
+ }
+
+ LogicDataSnapshot s(logic);
+ delete[] (uint8_t*)logic.data;
+
+ //----- Check the mip-map -----//
+ // Check mip map level 0
+ BOOST_CHECK_EQUAL(s._mip_map[0].length, 12);
+ BOOST_CHECK_EQUAL(s._mip_map[0].data_length,
+ LogicDataSnapshot::MipMapDataUnit);
+ BOOST_REQUIRE(s._mip_map[0].data != NULL);
+
+ for(int i = 0; i < s._mip_map[0].length;) {
+ BOOST_TEST_MESSAGE("Testing mip_map[0].data[" << i << "]");
+ BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF, 0xFF);
+
+ for(int j = 1;
+ i < s._mip_map[0].length &&
+ j < Period/LogicDataSnapshot::MipMapScaleFactor; j++) {
+ BOOST_TEST_MESSAGE(
+ "Testing mip_map[0].data[" << i << "]");
+ BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF, 0x00);
+ }
+ }
+
+ // Check the higher levels are all inactive
+ for(int i = 1; i < LogicDataSnapshot::ScaleStepCount; i++) {
+ const LogicDataSnapshot::MipMapLevel &m = s._mip_map[i];
+ BOOST_CHECK_EQUAL(m.length, 0);
+ BOOST_CHECK_EQUAL(m.data_length, 0);
+ BOOST_CHECK(m.data == NULL);
+ }
+
+ //----- Test get_subsampled_edges at reduced scale -----//
+ s.get_subsampled_edges(edges, 0, Length-1, 16.0f, 2);
+ BOOST_REQUIRE_EQUAL(edges.size(), Cycles + 2);
+
+ BOOST_CHECK_EQUAL(0, false);
+ for(int i = 1; i < edges.size(); i++)
+ BOOST_CHECK_EQUAL(edges[i].second, false);
+}
+
+BOOST_AUTO_TEST_CASE(LongPulses)
+{
+ const int Cycles = 3;
+ const int Period = 64;
+ const int PulseWidth = 16;
+ const int Length = Cycles * Period;
+
+ int j;
+ vector<LogicDataSnapshot::EdgePair> edges;
+
+ //----- Create a LogicDataSnapshot -----//
+ sr_datafeed_logic logic;
+ logic.unitsize = 1;
+ logic.length = Length;
+ logic.data = (uint64_t*)new uint8_t[Length];
+ uint8_t *p = (uint8_t*)logic.data;
+
+ for(int i = 0; i < Cycles; i++) {
+ for(j = 0; j < PulseWidth; j++)
+ *p++ = 0xFF;
+ for(j; j < Period; j++)
+ *p++ = 0x00;
+ }
+
+ LogicDataSnapshot s(logic);
+
+ //----- Check the mip-map -----//
+ // Check mip map level 0
+ BOOST_CHECK_EQUAL(s._mip_map[0].length, 12);
+ BOOST_CHECK_EQUAL(s._mip_map[0].data_length,
+ LogicDataSnapshot::MipMapDataUnit);
+ BOOST_REQUIRE(s._mip_map[0].data != NULL);
+
+ for(int i = 0; i < s._mip_map[0].length;) {
+ for(j = 0; i < s._mip_map[0].length && j < 2; j++) {
+ BOOST_TEST_MESSAGE(
+ "Testing mip_map[0].data[" << i << "]");
+ BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF, 0xFF);
+ }
+
+ for(j; i < s._mip_map[0].length &&
+ j < Period/LogicDataSnapshot::MipMapScaleFactor; j++) {
+ BOOST_TEST_MESSAGE(
+ "Testing mip_map[0].data[" << i << "]");
+ BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF, 0x00);
+ }
+ }
+
+ // Check the higher levels are all inactive
+ for(int i = 1; i < LogicDataSnapshot::ScaleStepCount; i++) {
+ const LogicDataSnapshot::MipMapLevel &m = s._mip_map[i];
+ BOOST_CHECK_EQUAL(m.length, 0);
+ BOOST_CHECK_EQUAL(m.data_length, 0);
+ BOOST_CHECK(m.data == NULL);
+ }
+
+ //----- Test get_subsampled_edges at a full scale -----//
+ s.get_subsampled_edges(edges, 0, Length-1, 16.0f, 2);
+ BOOST_REQUIRE_EQUAL(edges.size(), Cycles * 2 + 1);
+
+ for(int i = 0; i < Cycles; i++) {
+ BOOST_CHECK_EQUAL(edges[i*2].first, i * Period);
+ BOOST_CHECK_EQUAL(edges[i*2].second, true);
+ BOOST_CHECK_EQUAL(edges[i*2+1].first, i * Period + PulseWidth);
+ BOOST_CHECK_EQUAL(edges[i*2+1].second, false);
+ }
+
+ BOOST_CHECK_EQUAL(edges.back().first, Length-1);
+ BOOST_CHECK_EQUAL(edges.back().second, false);
+
+ //----- Test get_subsampled_edges at a simplified scale -----//
+ edges.clear();
+ s.get_subsampled_edges(edges, 0, Length-1, 17.0f, 2);
+
+ BOOST_CHECK_EQUAL(edges[0].first, 0);
+ BOOST_CHECK_EQUAL(edges[0].second, true);
+ BOOST_CHECK_EQUAL(edges[1].first, 16);
+ BOOST_CHECK_EQUAL(edges[1].second, false);
+
+ for(int i = 1; i < Cycles; i++) {
+ BOOST_CHECK_EQUAL(edges[i+1].first, i * Period);
+ BOOST_CHECK_EQUAL(edges[i+1].second, false);
}
- BOOST_REQUIRE_EQUAL(edges[31].first, 999999);
+ BOOST_CHECK_EQUAL(edges.back().first, Length-1);
+ BOOST_CHECK_EQUAL(edges.back().second, false);
}
BOOST_AUTO_TEST_SUITE_END()
projects / pulseview.git / blobdiff