[pulseview.git] / test / logicdatasnapshot.cpp

/*
 * This file is part of the PulseView project.
 *
 * Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * 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 "../extdef.h"
#include "../pv/logicdatasnapshot.h"

using namespace std;

using pv::LogicDataSnapshot;

BOOST_AUTO_TEST_SUITE(LogicDataSnapshotTest)

void push_logic(LogicDataSnapshot &s, unsigned int length, uint8_t value)
{
	sr_datafeed_logic logic;
	logic.unitsize = 1;
	logic.length = length;
	logic.data = new uint8_t[length];
	memset(logic.data, value, length * logic.unitsize);
	s.append_payload(logic);
	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
	sr_datafeed_logic logic;
	logic.length = 0;
	logic.unitsize = 1;
	logic.data = NULL;

	LogicDataSnapshot s(logic);

	//----- Test LogicDataSnapshot::push_logic -----//

	BOOST_CHECK(s.get_sample_count() == 0);
	for(int i = 0; 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);
	}

	// Push 8 samples of all zeros
	push_logic(s, 8, 0);

	BOOST_CHECK(s.get_sample_count() == 8);

	// There should not be enough samples to have a single mip map sample
	for(int i = 0; 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);
	}

	// Push 8 samples of 0x11s to bring the total up to 16
	push_logic(s, 8, 0x11);

	// There should now be enough data for exactly one sample
	// in mip map level 0, and that sample should be 0
	const LogicDataSnapshot::MipMapLevel &m0 = s._mip_map[0];
	BOOST_CHECK_EQUAL(m0.length, 1);
	BOOST_CHECK_EQUAL(m0.data_length, LogicDataSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(m0.data != NULL);
	BOOST_CHECK_EQUAL(((uint8_t*)m0.data)[0], 0x11);

	// The higher levels should still be empty
	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);
	}

	// Push 240 samples of all zeros to bring the total up to 256
	push_logic(s, 240, 0);

	BOOST_CHECK_EQUAL(m0.length, 16);
	BOOST_CHECK_EQUAL(m0.data_length, LogicDataSnapshot::MipMapDataUnit);

	BOOST_CHECK_EQUAL(((uint8_t*)m0.data)[1], 0x11);
	for(int i = 2; i < m0.length; i++)
		BOOST_CHECK_EQUAL(((uint8_t*)m0.data)[i], 0);

	const LogicDataSnapshot::MipMapLevel &m1 = s._mip_map[1];
	BOOST_CHECK_EQUAL(m1.length, 1);
	BOOST_CHECK_EQUAL(m1.data_length, LogicDataSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(m1.data != NULL);
	BOOST_CHECK_EQUAL(((uint8_t*)m1.data)[0], 0x11);

	//----- Test LogicDataSnapshot::get_subsampled_edges -----//

	// Test a full view at full zoom.
	vector<LogicDataSnapshot::EdgePair> edges;
	s.get_subsampled_edges(edges, 0, 255, 1, 0);
	BOOST_REQUIRE_EQUAL(edges.size(), 4);

	BOOST_CHECK_EQUAL(edges[0].first, 0);
	BOOST_CHECK_EQUAL(edges[1].first, 8);
	BOOST_CHECK_EQUAL(edges[2].first, 16);
	BOOST_CHECK_EQUAL(edges[3].first, 255);

	// Test a subset at high zoom
	edges.clear();
	s.get_subsampled_edges(edges, 6, 17, 0.05f, 0);
	BOOST_REQUIRE_EQUAL(edges.size(), 4);

	BOOST_CHECK_EQUAL(edges[0].first, 6);
	BOOST_CHECK_EQUAL(edges[1].first, 8);
	BOOST_CHECK_EQUAL(edges[2].first, 16);
	BOOST_CHECK_EQUAL(edges[3].first, 17);
}

BOOST_AUTO_TEST_CASE(LargeData)
{
	uint8_t prev_sample;
	const int Length = 1000000;

	sr_datafeed_logic logic;
	logic.unitsize = 1;
	logic.length = Length;
	logic.data = new uint8_t[Length];
	uint8_t *data = (uint8_t*)logic.data;

	for(int i = 0; i < Length; i++)
		*data++ = (uint8_t)(i >> 8);

	LogicDataSnapshot s(logic);
	delete[] (uint8_t*)logic.data;

	BOOST_CHECK(s.get_sample_count() == Length);

	// Check mip map level 0
	BOOST_CHECK_EQUAL(s._mip_map[0].length, 62500);
	BOOST_CHECK_EQUAL(s._mip_map[0].data_length,
		LogicDataSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(s._mip_map[0].data != NULL);

	prev_sample = 0;
	for(int i = 0; i < s._mip_map[0].length;)
	{
		BOOST_TEST_MESSAGE("Testing mip_map[0].data[" << i << "]");

		const uint8_t sample = (uint8_t)((i*16) >> 8);
		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(s.get_subsample(0, i++) & 0xFF, 0);
		}
	}

	// Check mip map level 1
	BOOST_CHECK_EQUAL(s._mip_map[1].length, 3906);
	BOOST_CHECK_EQUAL(s._mip_map[1].data_length,
		LogicDataSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(s._mip_map[1].data != NULL);

	prev_sample = 0;
	for(int i = 0; i < s._mip_map[1].length; i++)
	{
		BOOST_TEST_MESSAGE("Testing mip_map[1].data[" << i << "]");

		const uint8_t sample = i;
		const uint8_t expected = sample ^ prev_sample;
		prev_sample = i;

		BOOST_CHECK_EQUAL(s.get_subsample(1, i) & 0xFF, expected);
	}

	// Check mip map level 2
	BOOST_CHECK_EQUAL(s._mip_map[2].length, 244);
	BOOST_CHECK_EQUAL(s._mip_map[2].data_length,
		LogicDataSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(s._mip_map[2].data != NULL);

	prev_sample = 0;
	for(int i = 0; i < s._mip_map[2].length; i++)
	{
		BOOST_TEST_MESSAGE("Testing mip_map[2].data[" << i << "]");

		const uint8_t sample = i << 4;
		const uint8_t expected = (sample ^ prev_sample) | 0x0F;
		prev_sample = sample;

		BOOST_CHECK_EQUAL(s.get_subsample(2, i) & 0xFF, expected);
	}

	// Check mip map level 3
	BOOST_CHECK_EQUAL(s._mip_map[3].length, 15);
	BOOST_CHECK_EQUAL(s._mip_map[3].data_length,
		LogicDataSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(s._mip_map[3].data != NULL);

	for(int i = 0; i < s._mip_map[3].length; i++)
		BOOST_CHECK_EQUAL(*((uint8_t*)s._mip_map[3].data + i),
			0xFF);

	// Check the higher levels
	for(int i = 4; 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 LogicDataSnapshot::get_subsampled_edges -----//
	// Check in normal case
	vector<LogicDataSnapshot::EdgePair> edges;
	s.get_subsampled_edges(edges, 0, Length-1, 1, 7);

	BOOST_CHECK_EQUAL(edges.size(), 32);

	for(int i = 0; i < edges.size() - 1; i++)
	{
		BOOST_CHECK_EQUAL(edges[i].first, i * 32768);
		BOOST_CHECK_EQUAL(edges[i].second, i & 1);
	}

	BOOST_CHECK_EQUAL(edges[31].first, 999999);

	// Check in very low zoom case
	edges.clear();
	s.get_subsampled_edges(edges, 0, Length-1, 50e6f, 7);

	BOOST_CHECK_EQUAL(edges.size(), 2);
}

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 = 8;
	logic.length = Length;
	logic.data = (uint64_t*)new uint64_t[Length];
	uint64_t *p = (uint64_t*)logic.data;

	for(int i = 0; i < Cycles; i++) {
		for(j = 0; j < PulseWidth; j++)
			*p++ = ~0;
		for(j; j < Period; j++)
			*p++ = 0;
	}

	LogicDataSnapshot s(logic);
	delete[] (uint64_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;) {
		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++), ~0);
		}

		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++), 0);
		}
	}

	// 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_CHECK_EQUAL(edges.back().first, Length-1);
	BOOST_CHECK_EQUAL(edges.back().second, false);
}

BOOST_AUTO_TEST_CASE(LisaMUsbHid)
{
	/* This test was created from the beginning of the USB_DM signal in
	 * sigrok-dumps-usb/lisa_m_usbhid/lisa_m_usbhid.sr
	 */

	const int Edges[] = {
		7028, 7033, 7036, 7041, 7044, 7049, 7053, 7066, 7073, 7079,
		7086, 7095, 7103, 7108, 7111, 7116, 7119, 7124, 7136, 7141,
		7148, 7162, 7500
	};
	const int Length = Edges[countof(Edges) - 1];

	bool state = false;
	int lastEdgePos = 0;

	//----- Create a LogicDataSnapshot -----//
	sr_datafeed_logic logic;
	logic.unitsize = 1;
	logic.length = Length;
	logic.data = new uint8_t[Length];
	uint8_t *data = (uint8_t*)logic.data;

	for(int i = 0; i < countof(Edges); i++) {
		const int edgePos = Edges[i];
		memset(&data[lastEdgePos], state ? 0x02 : 0,
			edgePos - lastEdgePos - 1);

		lastEdgePos = edgePos;
		state = !state;
	}

	LogicDataSnapshot s(logic);
	delete[] (uint64_t*)logic.data;

	vector<LogicDataSnapshot::EdgePair> edges;


	/* The trailing edge of the pulse train is falling in the source data.
	 * Check this is always true at different scales
	 */

	edges.clear();
	s.get_subsampled_edges(edges, 0, Length-1, 33.333332f, 1);
	BOOST_CHECK_EQUAL(edges[edges.size() - 2].second, false);
}


BOOST_AUTO_TEST_SUITE_END()
Commit	Line	Data
4ceab49a	1	/*
b3f22de0	2	* This file is part of the PulseView project.
4ceab49a JH	3	*
	4	* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
	5	*
	6	* This program is free software; you can redistribute it and/or modify
	7	* it under the terms of the GNU General Public License as published by
	8	* the Free Software Foundation; either version 2 of the License, or
	9	* (at your option) any later version.
	10	*
	11	* This program is distributed in the hope that it will be useful,
	12	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	14	* GNU General Public License for more details.
	15	*
	16	* You should have received a copy of the GNU General Public License
	17	* along with this program; if not, write to the Free Software
	18	* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
	19	*/
	20
8743e7cb JH	21	#define __STDC_LIMIT_MACROS
	22	#include <stdint.h>
	23
4ceab49a JH	24	#include <boost/test/unit_test.hpp>
4ceab49a JH	25
a126c277	26	#include "../extdef.h"
51e77110	27	#include "../pv/logicdatasnapshot.h"
4ceab49a	28
0b02e057 JH	29	using namespace std;
0b02e057 JH	30
51e77110 JH	31	using pv::LogicDataSnapshot;
51e77110 JH	32
ecda6ca9 JH	33	BOOST_AUTO_TEST_SUITE(LogicDataSnapshotTest)
ecda6ca9 JH	34
4ceab49a JH	35	void push_logic(LogicDataSnapshot &s, unsigned int length, uint8_t value)
	36	{
	37	sr_datafeed_logic logic;
	38	logic.unitsize = 1;
	39	logic.length = length;
	40	logic.data = new uint8_t[length];
	41	memset(logic.data, value, length * logic.unitsize);
	42	s.append_payload(logic);
	43	delete[] (uint8_t*)logic.data;
	44	}
	45
8743e7cb JH	46	BOOST_AUTO_TEST_CASE(Pow2)
	47	{
	48	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(-2, 0), -2);
	49	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(-1, 0), -1);
	50	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(0, 0), 0);
	51	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(1, 0), 1);
	52	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(2, 0), 2);
	53
	54	BOOST_CHECK_EQUAL(
	55	LogicDataSnapshot::pow2_ceil(INT64_MIN, 0), INT64_MIN);
	56	BOOST_CHECK_EQUAL(
	57	LogicDataSnapshot::pow2_ceil(INT64_MAX, 0), INT64_MAX);
	58
	59	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(-3, 1), -2);
	60	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(-2, 1), -2);
	61	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(-1, 1), 0);
	62	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(0, 1), 0);
	63	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(1, 1), 2);
	64	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(2, 1), 2);
	65	BOOST_CHECK_EQUAL(LogicDataSnapshot::pow2_ceil(3, 1), 4);
	66	}
	67
ecda6ca9	68	BOOST_AUTO_TEST_CASE(Basic)
4ceab49a JH	69	{
	70	// Create an empty LogicDataSnapshot object
	71	sr_datafeed_logic logic;
	72	logic.length = 0;
	73	logic.unitsize = 1;
	74	logic.data = NULL;
	75
	76	LogicDataSnapshot s(logic);
	77
0b02e057 JH	78	//----- Test LogicDataSnapshot::push_logic -----//
0b02e057 JH	79
4ceab49a JH	80	BOOST_CHECK(s.get_sample_count() == 0);
	81	for(int i = 0; i < LogicDataSnapshot::ScaleStepCount; i++)
	82	{
	83	const LogicDataSnapshot::MipMapLevel &m = s._mip_map[i];
	84	BOOST_CHECK_EQUAL(m.length, 0);
	85	BOOST_CHECK_EQUAL(m.data_length, 0);
	86	BOOST_CHECK(m.data == NULL);
	87	}
	88
	89	// Push 8 samples of all zeros
	90	push_logic(s, 8, 0);
	91
	92	BOOST_CHECK(s.get_sample_count() == 8);
	93
	94	// There should not be enough samples to have a single mip map sample
	95	for(int i = 0; i < LogicDataSnapshot::ScaleStepCount; i++)
	96	{
	97	const LogicDataSnapshot::MipMapLevel &m = s._mip_map[i];
	98	BOOST_CHECK_EQUAL(m.length, 0);
	99	BOOST_CHECK_EQUAL(m.data_length, 0);
	100	BOOST_CHECK(m.data == NULL);
	101	}
	102
	103	// Push 8 samples of 0x11s to bring the total up to 16
	104	push_logic(s, 8, 0x11);
	105
	106	// There should now be enough data for exactly one sample
	107	// in mip map level 0, and that sample should be 0
	108	const LogicDataSnapshot::MipMapLevel &m0 = s._mip_map[0];
	109	BOOST_CHECK_EQUAL(m0.length, 1);
	110	BOOST_CHECK_EQUAL(m0.data_length, LogicDataSnapshot::MipMapDataUnit);
	111	BOOST_REQUIRE(m0.data != NULL);
	112	BOOST_CHECK_EQUAL(((uint8_t*)m0.data)[0], 0x11);
	113
	114	// The higher levels should still be empty
	115	for(int i = 1; i < LogicDataSnapshot::ScaleStepCount; i++)
	116	{
	117	const LogicDataSnapshot::MipMapLevel &m = s._mip_map[i];
	118	BOOST_CHECK_EQUAL(m.length, 0);
	119	BOOST_CHECK_EQUAL(m.data_length, 0);
	120	BOOST_CHECK(m.data == NULL);
	121	}
	122
	123	// Push 240 samples of all zeros to bring the total up to 256
	124	push_logic(s, 240, 0);
	125
	126	BOOST_CHECK_EQUAL(m0.length, 16);
	127	BOOST_CHECK_EQUAL(m0.data_length, LogicDataSnapshot::MipMapDataUnit);
	128
	129	BOOST_CHECK_EQUAL(((uint8_t*)m0.data)[1], 0x11);
	130	for(int i = 2; i < m0.length; i++)
	131	BOOST_CHECK_EQUAL(((uint8_t*)m0.data)[i], 0);
	132
	133	const LogicDataSnapshot::MipMapLevel &m1 = s._mip_map[1];
	134	BOOST_CHECK_EQUAL(m1.length, 1);
	135	BOOST_CHECK_EQUAL(m1.data_length, LogicDataSnapshot::MipMapDataUnit);
	136	BOOST_REQUIRE(m1.data != NULL);
	137	BOOST_CHECK_EQUAL(((uint8_t*)m1.data)[0], 0x11);
0b02e057 JH	138
	139	//----- Test LogicDataSnapshot::get_subsampled_edges -----//
	140
	141	// Test a full view at full zoom.
	142	vector<LogicDataSnapshot::EdgePair> edges;
	143	s.get_subsampled_edges(edges, 0, 255, 1, 0);
	144	BOOST_REQUIRE_EQUAL(edges.size(), 4);
	145
	146	BOOST_CHECK_EQUAL(edges[0].first, 0);
	147	BOOST_CHECK_EQUAL(edges[1].first, 8);
	148	BOOST_CHECK_EQUAL(edges[2].first, 16);
	149	BOOST_CHECK_EQUAL(edges[3].first, 255);
	150
	151	// Test a subset at high zoom
	152	edges.clear();
	153	s.get_subsampled_edges(edges, 6, 17, 0.05f, 0);
	154	BOOST_REQUIRE_EQUAL(edges.size(), 4);
	155
	156	BOOST_CHECK_EQUAL(edges[0].first, 6);
	157	BOOST_CHECK_EQUAL(edges[1].first, 8);
	158	BOOST_CHECK_EQUAL(edges[2].first, 16);
	159	BOOST_CHECK_EQUAL(edges[3].first, 17);
4ceab49a	160	}
ecda6ca9 JH	161
	162	BOOST_AUTO_TEST_CASE(LargeData)
	163	{
	164	uint8_t prev_sample;
	165	const int Length = 1000000;
	166
	167	sr_datafeed_logic logic;
	168	logic.unitsize = 1;
	169	logic.length = Length;
	170	logic.data = new uint8_t[Length];
	171	uint8_t data = (uint8_t)logic.data;
	172
	173	for(int i = 0; i < Length; i++)
	174	*data++ = (uint8_t)(i >> 8);
	175
	176	LogicDataSnapshot s(logic);
	177	delete[] (uint8_t*)logic.data;
	178
	179	BOOST_CHECK(s.get_sample_count() == Length);
	180
	181	// Check mip map level 0
	182	BOOST_CHECK_EQUAL(s._mip_map[0].length, 62500);
	183	BOOST_CHECK_EQUAL(s._mip_map[0].data_length,
	184	LogicDataSnapshot::MipMapDataUnit);
	185	BOOST_REQUIRE(s._mip_map[0].data != NULL);
	186
	187	prev_sample = 0;
	188	for(int i = 0; i < s._mip_map[0].length;)
	189	{
	190	BOOST_TEST_MESSAGE("Testing mip_map[0].data[" << i << "]");
	191
	192	const uint8_t sample = (uint8_t)((i*16) >> 8);
b2bcbe51	193	BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF,
ecda6ca9 JH	194	prev_sample ^ sample);
	195	prev_sample = sample;
	196
	197	for(int j = 1; i < s._mip_map[0].length && j < 16; j++)
	198	{
	199	BOOST_TEST_MESSAGE("Testing mip_map[0].data[" << i << "]");
b2bcbe51	200	BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF, 0);
ecda6ca9 JH	201	}
	202	}
	203
	204	// Check mip map level 1
	205	BOOST_CHECK_EQUAL(s._mip_map[1].length, 3906);
	206	BOOST_CHECK_EQUAL(s._mip_map[1].data_length,
	207	LogicDataSnapshot::MipMapDataUnit);
	208	BOOST_REQUIRE(s._mip_map[1].data != NULL);
	209
	210	prev_sample = 0;
	211	for(int i = 0; i < s._mip_map[1].length; i++)
	212	{
	213	BOOST_TEST_MESSAGE("Testing mip_map[1].data[" << i << "]");
	214
	215	const uint8_t sample = i;
	216	const uint8_t expected = sample ^ prev_sample;
	217	prev_sample = i;
	218
b2bcbe51	219	BOOST_CHECK_EQUAL(s.get_subsample(1, i) & 0xFF, expected);
ecda6ca9 JH	220	}
	221
	222	// Check mip map level 2
	223	BOOST_CHECK_EQUAL(s._mip_map[2].length, 244);
	224	BOOST_CHECK_EQUAL(s._mip_map[2].data_length,
	225	LogicDataSnapshot::MipMapDataUnit);
	226	BOOST_REQUIRE(s._mip_map[2].data != NULL);
	227
	228	prev_sample = 0;
	229	for(int i = 0; i < s._mip_map[2].length; i++)
	230	{
	231	BOOST_TEST_MESSAGE("Testing mip_map[2].data[" << i << "]");
	232
	233	const uint8_t sample = i << 4;
	234	const uint8_t expected = (sample ^ prev_sample) \| 0x0F;
	235	prev_sample = sample;
	236
b2bcbe51	237	BOOST_CHECK_EQUAL(s.get_subsample(2, i) & 0xFF, expected);
ecda6ca9 JH	238	}
	239
	240	// Check mip map level 3
	241	BOOST_CHECK_EQUAL(s._mip_map[3].length, 15);
	242	BOOST_CHECK_EQUAL(s._mip_map[3].data_length,
	243	LogicDataSnapshot::MipMapDataUnit);
	244	BOOST_REQUIRE(s._mip_map[3].data != NULL);
	245
	246	for(int i = 0; i < s._mip_map[3].length; i++)
	247	BOOST_CHECK_EQUAL(((uint8_t)s._mip_map[3].data + i),
	248	0xFF);
	249
	250	// Check the higher levels
	251	for(int i = 4; i < LogicDataSnapshot::ScaleStepCount; i++)
	252	{
	253	const LogicDataSnapshot::MipMapLevel &m = s._mip_map[i];
	254	BOOST_CHECK_EQUAL(m.length, 0);
	255	BOOST_CHECK_EQUAL(m.data_length, 0);
	256	BOOST_CHECK(m.data == NULL);
	257	}
	258
	259	//----- Test LogicDataSnapshot::get_subsampled_edges -----//
ac7aa636	260	// Check in normal case
ecda6ca9	261	vector<LogicDataSnapshot::EdgePair> edges;
ecda6ca9	262	s.get_subsampled_edges(edges, 0, Length-1, 1, 7);
ecda6ca9	263
39f6e56e JH	264	BOOST_CHECK_EQUAL(edges.size(), 32);
	265
	266	for(int i = 0; i < edges.size() - 1; i++)
ecda6ca9	267	{
39f6e56e JH	268	BOOST_CHECK_EQUAL(edges[i].first, i * 32768);
39f6e56e JH	269	BOOST_CHECK_EQUAL(edges[i].second, i & 1);
ecda6ca9 JH	270	}
ecda6ca9 JH	271
39f6e56e	272	BOOST_CHECK_EQUAL(edges[31].first, 999999);
ac7aa636 JH	273
	274	// Check in very low zoom case
	275	edges.clear();
	276	s.get_subsampled_edges(edges, 0, Length-1, 50e6f, 7);
	277
	278	BOOST_CHECK_EQUAL(edges.size(), 2);
ecda6ca9 JH	279	}
ecda6ca9 JH	280
3db297c4 JH	281	BOOST_AUTO_TEST_CASE(Pulses)
	282	{
	283	const int Cycles = 3;
	284	const int Period = 64;
	285	const int Length = Cycles * Period;
	286
	287	vector<LogicDataSnapshot::EdgePair> edges;
	288
	289	//----- Create a LogicDataSnapshot -----//
	290	sr_datafeed_logic logic;
	291	logic.unitsize = 1;
	292	logic.length = Length;
	293	logic.data = (uint64_t*)new uint8_t[Length];
	294	uint8_t p = (uint8_t)logic.data;
	295
	296	for(int i = 0; i < Cycles; i++) {
	297	*p++ = 0xFF;
	298	for(int j = 1; j < Period; j++)
	299	*p++ = 0x00;
	300	}
	301
	302	LogicDataSnapshot s(logic);
821f23af	303	delete[] (uint8_t*)logic.data;
3db297c4 JH	304
	305	//----- Check the mip-map -----//
	306	// Check mip map level 0
	307	BOOST_CHECK_EQUAL(s._mip_map[0].length, 12);
	308	BOOST_CHECK_EQUAL(s._mip_map[0].data_length,
	309	LogicDataSnapshot::MipMapDataUnit);
	310	BOOST_REQUIRE(s._mip_map[0].data != NULL);
	311
	312	for(int i = 0; i < s._mip_map[0].length;) {
	313	BOOST_TEST_MESSAGE("Testing mip_map[0].data[" << i << "]");
	314	BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF, 0xFF);
	315
	316	for(int j = 1;
	317	i < s._mip_map[0].length &&
	318	j < Period/LogicDataSnapshot::MipMapScaleFactor; j++) {
	319	BOOST_TEST_MESSAGE(
	320	"Testing mip_map[0].data[" << i << "]");
	321	BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF, 0x00);
	322	}
	323	}
	324
	325	// Check the higher levels are all inactive
	326	for(int i = 1; i < LogicDataSnapshot::ScaleStepCount; i++) {
	327	const LogicDataSnapshot::MipMapLevel &m = s._mip_map[i];
	328	BOOST_CHECK_EQUAL(m.length, 0);
	329	BOOST_CHECK_EQUAL(m.data_length, 0);
	330	BOOST_CHECK(m.data == NULL);
	331	}
	332
	333	//----- Test get_subsampled_edges at reduced scale -----//
	334	s.get_subsampled_edges(edges, 0, Length-1, 16.0f, 2);
7d0d64f9	335	BOOST_REQUIRE_EQUAL(edges.size(), Cycles + 2);
3db297c4	336
7d0d64f9 JH	337	BOOST_CHECK_EQUAL(0, false);
7d0d64f9 JH	338	for(int i = 1; i < edges.size(); i++)
3db297c4 JH	339	BOOST_CHECK_EQUAL(edges[i].second, false);
	340	}
	341
910b16ec JH	342	BOOST_AUTO_TEST_CASE(LongPulses)
	343	{
	344	const int Cycles = 3;
	345	const int Period = 64;
	346	const int PulseWidth = 16;
	347	const int Length = Cycles * Period;
	348
	349	int j;
	350	vector<LogicDataSnapshot::EdgePair> edges;
	351
	352	//----- Create a LogicDataSnapshot -----//
	353	sr_datafeed_logic logic;
4f767cf7	354	logic.unitsize = 8;
910b16ec	355	logic.length = Length;
4f767cf7 JH	356	logic.data = (uint64_t*)new uint64_t[Length];
4f767cf7 JH	357	uint64_t p = (uint64_t)logic.data;
910b16ec JH	358
	359	for(int i = 0; i < Cycles; i++) {
	360	for(j = 0; j < PulseWidth; j++)
4f767cf7	361	*p++ = ~0;
910b16ec	362	for(j; j < Period; j++)
4f767cf7	363	*p++ = 0;
910b16ec JH	364	}
	365
	366	LogicDataSnapshot s(logic);
ba3c4dae	367	delete[] (uint64_t*)logic.data;
910b16ec JH	368
	369	//----- Check the mip-map -----//
	370	// Check mip map level 0
	371	BOOST_CHECK_EQUAL(s._mip_map[0].length, 12);
	372	BOOST_CHECK_EQUAL(s._mip_map[0].data_length,
	373	LogicDataSnapshot::MipMapDataUnit);
	374	BOOST_REQUIRE(s._mip_map[0].data != NULL);
	375
	376	for(int i = 0; i < s._mip_map[0].length;) {
	377	for(j = 0; i < s._mip_map[0].length && j < 2; j++) {
	378	BOOST_TEST_MESSAGE(
	379	"Testing mip_map[0].data[" << i << "]");
4f767cf7	380	BOOST_CHECK_EQUAL(s.get_subsample(0, i++), ~0);
910b16ec JH	381	}
	382
	383	for(j; i < s._mip_map[0].length &&
	384	j < Period/LogicDataSnapshot::MipMapScaleFactor; j++) {
	385	BOOST_TEST_MESSAGE(
	386	"Testing mip_map[0].data[" << i << "]");
4f767cf7	387	BOOST_CHECK_EQUAL(s.get_subsample(0, i++), 0);
910b16ec JH	388	}
	389	}
	390
	391	// Check the higher levels are all inactive
	392	for(int i = 1; i < LogicDataSnapshot::ScaleStepCount; i++) {
	393	const LogicDataSnapshot::MipMapLevel &m = s._mip_map[i];
	394	BOOST_CHECK_EQUAL(m.length, 0);
	395	BOOST_CHECK_EQUAL(m.data_length, 0);
	396	BOOST_CHECK(m.data == NULL);
	397	}
	398
	399	//----- Test get_subsampled_edges at a full scale -----//
	400	s.get_subsampled_edges(edges, 0, Length-1, 16.0f, 2);
	401	BOOST_REQUIRE_EQUAL(edges.size(), Cycles * 2 + 1);
	402
	403	for(int i = 0; i < Cycles; i++) {
	404	BOOST_CHECK_EQUAL(edges[i2].first, i Period);
	405	BOOST_CHECK_EQUAL(edges[i*2].second, true);
	406	BOOST_CHECK_EQUAL(edges[i2+1].first, i Period + PulseWidth);
	407	BOOST_CHECK_EQUAL(edges[i*2+1].second, false);
	408	}
	409
	410	BOOST_CHECK_EQUAL(edges.back().first, Length-1);
	411	BOOST_CHECK_EQUAL(edges.back().second, false);
	412
	413	//----- Test get_subsampled_edges at a simplified scale -----//
	414	edges.clear();
	415	s.get_subsampled_edges(edges, 0, Length-1, 17.0f, 2);
	416
7d0d64f9 JH	417	BOOST_CHECK_EQUAL(edges[0].first, 0);
	418	BOOST_CHECK_EQUAL(edges[0].second, true);
	419	BOOST_CHECK_EQUAL(edges[1].first, 16);
	420	BOOST_CHECK_EQUAL(edges[1].second, false);
	421
	422	for(int i = 1; i < Cycles; i++) {
	423	BOOST_CHECK_EQUAL(edges[i+1].first, i * Period);
	424	BOOST_CHECK_EQUAL(edges[i+1].second, false);
910b16ec JH	425	}
	426
	427	BOOST_CHECK_EQUAL(edges.back().first, Length-1);
	428	BOOST_CHECK_EQUAL(edges.back().second, false);
	429	}
	430
a126c277 JH	431	BOOST_AUTO_TEST_CASE(LisaMUsbHid)
	432	{
	433	/* This test was created from the beginning of the USB_DM signal in
	434	* sigrok-dumps-usb/lisa_m_usbhid/lisa_m_usbhid.sr
	435	*/
	436
	437	const int Edges[] = {
	438	7028, 7033, 7036, 7041, 7044, 7049, 7053, 7066, 7073, 7079,
	439	7086, 7095, 7103, 7108, 7111, 7116, 7119, 7124, 7136, 7141,
	440	7148, 7162, 7500
	441	};
	442	const int Length = Edges[countof(Edges) - 1];
	443
	444	bool state = false;
	445	int lastEdgePos = 0;
	446
	447	//----- Create a LogicDataSnapshot -----//
	448	sr_datafeed_logic logic;
	449	logic.unitsize = 1;
	450	logic.length = Length;
	451	logic.data = new uint8_t[Length];
	452	uint8_t data = (uint8_t)logic.data;
	453
	454	for(int i = 0; i < countof(Edges); i++) {
	455	const int edgePos = Edges[i];
	456	memset(&data[lastEdgePos], state ? 0x02 : 0,
	457	edgePos - lastEdgePos - 1);
	458
	459	lastEdgePos = edgePos;
	460	state = !state;
	461	}
	462
	463	LogicDataSnapshot s(logic);
	464	delete[] (uint64_t*)logic.data;
	465
	466	vector<LogicDataSnapshot::EdgePair> edges;
	467
	468
	469	/* The trailing edge of the pulse train is falling in the source data.
	470	* Check this is always true at different scales
	471	*/
	472
	473	edges.clear();
	474	s.get_subsampled_edges(edges, 0, Length-1, 33.333332f, 1);
	475	BOOST_CHECK_EQUAL(edges[edges.size() - 2].second, false);
	476	}
	477
	478
ecda6ca9	479	BOOST_AUTO_TEST_SUITE_END()