X-Git-Url: https://sigrok.org/gitweb/?p=pulseview.git;a=blobdiff_plain;f=test%2Flogicdatasnapshot.cpp;h=2c24bd3ca0851fb08ca5d5bc9f0e4526dd23682e;hp=6e1f26364d778feb7e16a0e1a8edb306c1d6410a;hb=3db297c4f9c6cf3023e68b1f9e37ac4ea1c7ef3c;hpb=ecda6ca9b83e5ed9988c64ed9fc4e4a33b8a5457

diff --git a/test/logicdatasnapshot.cpp b/test/logicdatasnapshot.cpp
index 6e1f2636..2c24bd3c 100644
--- a/test/logicdatasnapshot.cpp
+++ b/test/logicdatasnapshot.cpp
@@ -18,6 +18,9 @@
  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
  */
 
+#define __STDC_LIMIT_MACROS
+#include <stdint.h>
+
 #include <boost/test/unit_test.hpp>
 
 #include "../logicdatasnapshot.h"
@@ -37,6 +40,28 @@ void push_logic(LogicDataSnapshot &s, unsigned int length, uint8_t value)
 	delete[] (uint8_t*)logic.data;
 }
 
+BOOST_AUTO_TEST_CASE(Pow2)
+{
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(-2, 0), -2);
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(-1, 0), -1);
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(0, 0), 0);
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(1, 0), 1);
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(2, 0), 2);
+
+	BOOST_CHECK_EQUAL(
+		LogicDataSnapshot::pow2_ceil(INT64_MIN, 0), INT64_MIN);
+	BOOST_CHECK_EQUAL(
+		LogicDataSnapshot::pow2_ceil(INT64_MAX, 0), INT64_MAX);
+
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(-3, 1), -2);
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(-2, 1), -2);
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(-1, 1), 0);
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(0, 1), 0);
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(1, 1), 2);
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(2, 1), 2);
+	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(3, 1), 4);
+}
+
 BOOST_AUTO_TEST_CASE(Basic)
 {
 	// Create an empty LogicDataSnapshot object
@@ -162,14 +187,14 @@ BOOST_AUTO_TEST_CASE(LargeData)
 		BOOST_TEST_MESSAGE("Testing mip_map[0].data[" << i << "]");
 
 		const uint8_t sample = (uint8_t)((i*16) >> 8);
-		BOOST_CHECK_EQUAL(*((uint8_t*)s._mip_map[0].data + i++),
+		BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF,
 			prev_sample ^ sample);
 		prev_sample = sample;
 
 		for(int j = 1; i < s._mip_map[0].length && j < 16; j++)
 		{
 			BOOST_TEST_MESSAGE("Testing mip_map[0].data[" << i << "]");
-			BOOST_CHECK_EQUAL(*((uint8_t*)s._mip_map[0].data + i++), 0);
+			BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF, 0);
 		}
 	}
 
@@ -188,8 +213,7 @@ BOOST_AUTO_TEST_CASE(LargeData)
 		const uint8_t expected = sample ^ prev_sample;
 		prev_sample = i;
 
-		BOOST_CHECK_EQUAL(*((uint8_t*)s._mip_map[1].data + i),
-			expected);
+		BOOST_CHECK_EQUAL(s.get_subsample(1, i) & 0xFF, expected);
 	}
 
 	// Check mip map level 2
@@ -207,8 +231,7 @@ BOOST_AUTO_TEST_CASE(LargeData)
 		const uint8_t expected = (sample ^ prev_sample) | 0x0F;
 		prev_sample = sample;
 
-		BOOST_CHECK_EQUAL(*((uint8_t*)s._mip_map[2].data + i),
-			expected);
+		BOOST_CHECK_EQUAL(s.get_subsample(2, i) & 0xFF, expected);
 	}
 
 	// Check mip map level 3
@@ -234,15 +257,75 @@ BOOST_AUTO_TEST_CASE(LargeData)
 	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;
 	}
 
-	BOOST_REQUIRE_EQUAL(edges[31].first, 999999);
+	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;) {
+		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 + 1);
+
+	for(int i = 0; i < edges.size(); i++)
+		BOOST_CHECK_EQUAL(edges[i].second, false);
 }
 
 BOOST_AUTO_TEST_SUITE_END()