[pulseview.git] / test / data / logicsnapshot.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
 */

#include <extdef.h>

#include <stdint.h>

#include <boost/test/unit_test.hpp>

#include "../../pv/data/logicsnapshot.h"

using pv::data::LogicSnapshot;
using std::vector;

BOOST_AUTO_TEST_SUITE(LogicSnapshotTest)

void push_logic(LogicSnapshot &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(LogicSnapshot::pow2_ceil(0, 0), 0);
	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(1, 0), 1);
	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(2, 0), 2);

	BOOST_CHECK_EQUAL(
		LogicSnapshot::pow2_ceil(INT64_MIN, 0), INT64_MIN);
	BOOST_CHECK_EQUAL(
		LogicSnapshot::pow2_ceil(INT64_MAX, 0), INT64_MAX);

	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(0, 1), 0);
	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(1, 1), 2);
	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(2, 1), 2);
	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(3, 1), 4);
}

BOOST_AUTO_TEST_CASE(Basic)
{
	// Create an empty LogicSnapshot object
	sr_datafeed_logic logic;
	logic.length = 0;
	logic.unitsize = 1;
	logic.data = NULL;

	LogicSnapshot s(logic);

	//----- Test LogicSnapshot::push_logic -----//

	BOOST_CHECK(s.get_sample_count() == 0);
	for (unsigned int i = 0; i < LogicSnapshot::ScaleStepCount; i++)
	{
		const LogicSnapshot::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 (unsigned int i = 0; i < LogicSnapshot::ScaleStepCount; i++)
	{
		const LogicSnapshot::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 LogicSnapshot::MipMapLevel &m0 = s._mip_map[0];
	BOOST_CHECK_EQUAL(m0.length, 1);
	BOOST_CHECK_EQUAL(m0.data_length, LogicSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(m0.data != NULL);
	BOOST_CHECK_EQUAL(((uint8_t*)m0.data)[0], 0x11);

	// The higher levels should still be empty
	for (unsigned int i = 1; i < LogicSnapshot::ScaleStepCount; i++)
	{
		const LogicSnapshot::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, LogicSnapshot::MipMapDataUnit);

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

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

	//----- Test LogicSnapshot::get_subsampled_edges -----//

	// Test a full view at full zoom.
	vector<LogicSnapshot::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, 256);

	// 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, 18);
}

BOOST_AUTO_TEST_CASE(LargeData)
{
	uint8_t prev_sample;
	const unsigned 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 (unsigned int i = 0; i < Length; i++)
		*data++ = (uint8_t)(i >> 8);

	LogicSnapshot 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,
		LogicSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(s._mip_map[0].data != NULL);

	prev_sample = 0;
	for (unsigned 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,
		LogicSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(s._mip_map[1].data != NULL);

	prev_sample = 0;
	for (unsigned 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,
		LogicSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(s._mip_map[2].data != NULL);

	prev_sample = 0;
	for (unsigned 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,
		LogicSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(s._mip_map[3].data != NULL);

	for (unsigned 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 (unsigned int i = 4; i < LogicSnapshot::ScaleStepCount; i++)
	{
		const LogicSnapshot::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 LogicSnapshot::get_subsampled_edges -----//
	// Check in normal case
	vector<LogicSnapshot::EdgePair> edges;
	s.get_subsampled_edges(edges, 0, Length-1, 1, 7);

	BOOST_CHECK_EQUAL(edges.size(), 32);

	for (unsigned 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, 1000000);

	// 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<LogicSnapshot::EdgePair> edges;

	//----- Create a LogicSnapshot -----//
	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;
	}

	LogicSnapshot 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,
		LogicSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(s._mip_map[0].data != NULL);

	for (unsigned 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/LogicSnapshot::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 (unsigned int i = 1; i < LogicSnapshot::ScaleStepCount; i++) {
		const LogicSnapshot::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 (unsigned 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<LogicSnapshot::EdgePair> edges;

	//----- Create a LogicSnapshot -----//
	sr_datafeed_logic logic;
	logic.unitsize = 8;
	logic.length = Length * 8;
	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 < Period; j++)
			*p++ = 0;
	}

	LogicSnapshot 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,
		LogicSnapshot::MipMapDataUnit);
	BOOST_REQUIRE(s._mip_map[0].data != NULL);

	for (unsigned 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 (; i < s._mip_map[0].length &&
			j < Period/LogicSnapshot::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 (unsigned int i = 1; i < LogicSnapshot::ScaleStepCount; i++) {
		const LogicSnapshot::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);
	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);
	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 LogicSnapshot -----//
	sr_datafeed_logic logic;
	logic.unitsize = 1;
	logic.length = Length;
	logic.data = new uint8_t[Length];
	uint8_t *data = (uint8_t*)logic.data;

	for (unsigned 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;
	}

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

	vector<LogicSnapshot::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);
}

/*
 * This test checks the rendering of wide data (more than 8 probes)
 * Probe signals are either all-high, or all-low, but are interleaved such that
 * they would toggle during every sample if treated like 8 probes.
 * The packet contains a large number of samples, so the mipmap generation kicks
 * in.
 *
 * The signals should not toggle (have exactly two edges: the start and end)
 */
BOOST_AUTO_TEST_CASE(WideData)
{
	const int Length = 512<<10;
	uint16_t *data = new uint16_t[Length];

	sr_datafeed_logic logic;
	logic.unitsize = sizeof(data[0]);
	logic.length = Length * sizeof(data[0]);
	logic.data = data;

	for (int i = 0; i < Length; i++)
		data[i] = 0x0FF0;

	LogicSnapshot s(logic);

	vector<LogicSnapshot::EdgePair> edges;

	edges.clear();
	s.get_subsampled_edges(edges, 0, Length-1, 1, 0);
	BOOST_CHECK_EQUAL(edges.size(), 2);

	edges.clear();
	s.get_subsampled_edges(edges, 0, Length-1, 1, 8);
	BOOST_CHECK_EQUAL(edges.size(), 2);

	// Cleanup
	delete [] data;
}

/*
 * This test is a replica of sixteen.sr attached to Bug #33.
 */
BOOST_AUTO_TEST_CASE(Sixteen)
{
	const int Length = 8;
	uint16_t data[Length];

	sr_datafeed_logic logic;
	logic.unitsize = sizeof(data[0]);
	logic.length = Length * sizeof(data[0]);
	logic.data = data;

	for (int i = 0; i < Length; i++)
		data[i] = 0xFFFE;

	LogicSnapshot s(logic);

	vector<LogicSnapshot::EdgePair> edges;
	s.get_subsampled_edges(edges, 0, 2, 0.0004, 1);

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

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
cef18fc6 JH	21	#include <extdef.h>
cef18fc6 JH	22
8743e7cb JH	23	#include <stdint.h>
8743e7cb JH	24
4ceab49a JH	25	#include <boost/test/unit_test.hpp>
4ceab49a JH	26
1b1ec774	27	#include "../../pv/data/logicsnapshot.h"
4ceab49a	28
1b1ec774	29	using pv::data::LogicSnapshot;
819f4c25	30	using std::vector;
51e77110	31
1b1ec774	32	BOOST_AUTO_TEST_SUITE(LogicSnapshotTest)
ecda6ca9	33
1b1ec774	34	void push_logic(LogicSnapshot &s, unsigned int length, uint8_t value)
4ceab49a JH	35	{
	36	sr_datafeed_logic logic;
	37	logic.unitsize = 1;
	38	logic.length = length;
	39	logic.data = new uint8_t[length];
	40	memset(logic.data, value, length * logic.unitsize);
	41	s.append_payload(logic);
	42	delete[] (uint8_t*)logic.data;
	43	}
	44
8743e7cb JH	45	BOOST_AUTO_TEST_CASE(Pow2)
8743e7cb JH	46	{
1b1ec774 JH	47	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(0, 0), 0);
	48	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(1, 0), 1);
	49	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(2, 0), 2);
8743e7cb JH	50
8743e7cb JH	51	BOOST_CHECK_EQUAL(
1b1ec774	52	LogicSnapshot::pow2_ceil(INT64_MIN, 0), INT64_MIN);
8743e7cb	53	BOOST_CHECK_EQUAL(
1b1ec774	54	LogicSnapshot::pow2_ceil(INT64_MAX, 0), INT64_MAX);
8743e7cb	55
1b1ec774 JH	56	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(0, 1), 0);
	57	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(1, 1), 2);
	58	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(2, 1), 2);
	59	BOOST_CHECK_EQUAL(LogicSnapshot::pow2_ceil(3, 1), 4);
8743e7cb JH	60	}
8743e7cb JH	61
ecda6ca9	62	BOOST_AUTO_TEST_CASE(Basic)
4ceab49a	63	{
1b1ec774	64	// Create an empty LogicSnapshot object
4ceab49a JH	65	sr_datafeed_logic logic;
	66	logic.length = 0;
	67	logic.unitsize = 1;
	68	logic.data = NULL;
	69
1b1ec774	70	LogicSnapshot s(logic);
4ceab49a	71
1b1ec774	72	//----- Test LogicSnapshot::push_logic -----//
0b02e057	73
4ceab49a	74	BOOST_CHECK(s.get_sample_count() == 0);
1b1ec774	75	for (unsigned int i = 0; i < LogicSnapshot::ScaleStepCount; i++)
4ceab49a	76	{
1b1ec774	77	const LogicSnapshot::MipMapLevel &m = s._mip_map[i];
4ceab49a JH	78	BOOST_CHECK_EQUAL(m.length, 0);
	79	BOOST_CHECK_EQUAL(m.data_length, 0);
	80	BOOST_CHECK(m.data == NULL);
	81	}
	82
	83	// Push 8 samples of all zeros
	84	push_logic(s, 8, 0);
	85
	86	BOOST_CHECK(s.get_sample_count() == 8);
	87
	88	// There should not be enough samples to have a single mip map sample
1b1ec774	89	for (unsigned int i = 0; i < LogicSnapshot::ScaleStepCount; i++)
4ceab49a	90	{
1b1ec774	91	const LogicSnapshot::MipMapLevel &m = s._mip_map[i];
4ceab49a JH	92	BOOST_CHECK_EQUAL(m.length, 0);
	93	BOOST_CHECK_EQUAL(m.data_length, 0);
	94	BOOST_CHECK(m.data == NULL);
	95	}
	96
	97	// Push 8 samples of 0x11s to bring the total up to 16
	98	push_logic(s, 8, 0x11);
	99
	100	// There should now be enough data for exactly one sample
	101	// in mip map level 0, and that sample should be 0
1b1ec774	102	const LogicSnapshot::MipMapLevel &m0 = s._mip_map[0];
4ceab49a	103	BOOST_CHECK_EQUAL(m0.length, 1);
1b1ec774	104	BOOST_CHECK_EQUAL(m0.data_length, LogicSnapshot::MipMapDataUnit);
4ceab49a JH	105	BOOST_REQUIRE(m0.data != NULL);
	106	BOOST_CHECK_EQUAL(((uint8_t*)m0.data)[0], 0x11);
	107
	108	// The higher levels should still be empty
1b1ec774	109	for (unsigned int i = 1; i < LogicSnapshot::ScaleStepCount; i++)
4ceab49a	110	{
1b1ec774	111	const LogicSnapshot::MipMapLevel &m = s._mip_map[i];
4ceab49a JH	112	BOOST_CHECK_EQUAL(m.length, 0);
	113	BOOST_CHECK_EQUAL(m.data_length, 0);
	114	BOOST_CHECK(m.data == NULL);
	115	}
	116
	117	// Push 240 samples of all zeros to bring the total up to 256
	118	push_logic(s, 240, 0);
	119
	120	BOOST_CHECK_EQUAL(m0.length, 16);
1b1ec774	121	BOOST_CHECK_EQUAL(m0.data_length, LogicSnapshot::MipMapDataUnit);
4ceab49a JH	122
4ceab49a JH	123	BOOST_CHECK_EQUAL(((uint8_t*)m0.data)[1], 0x11);
333d5bbc	124	for (unsigned int i = 2; i < m0.length; i++)
4ceab49a JH	125	BOOST_CHECK_EQUAL(((uint8_t*)m0.data)[i], 0);
4ceab49a JH	126
1b1ec774	127	const LogicSnapshot::MipMapLevel &m1 = s._mip_map[1];
4ceab49a	128	BOOST_CHECK_EQUAL(m1.length, 1);
1b1ec774	129	BOOST_CHECK_EQUAL(m1.data_length, LogicSnapshot::MipMapDataUnit);
4ceab49a JH	130	BOOST_REQUIRE(m1.data != NULL);
4ceab49a JH	131	BOOST_CHECK_EQUAL(((uint8_t*)m1.data)[0], 0x11);
0b02e057	132
1b1ec774	133	//----- Test LogicSnapshot::get_subsampled_edges -----//
0b02e057 JH	134
0b02e057 JH	135	// Test a full view at full zoom.
1b1ec774	136	vector<LogicSnapshot::EdgePair> edges;
0b02e057 JH	137	s.get_subsampled_edges(edges, 0, 255, 1, 0);
	138	BOOST_REQUIRE_EQUAL(edges.size(), 4);
	139
	140	BOOST_CHECK_EQUAL(edges[0].first, 0);
	141	BOOST_CHECK_EQUAL(edges[1].first, 8);
	142	BOOST_CHECK_EQUAL(edges[2].first, 16);
175d6573	143	BOOST_CHECK_EQUAL(edges[3].first, 256);
0b02e057 JH	144
	145	// Test a subset at high zoom
	146	edges.clear();
	147	s.get_subsampled_edges(edges, 6, 17, 0.05f, 0);
	148	BOOST_REQUIRE_EQUAL(edges.size(), 4);
	149
	150	BOOST_CHECK_EQUAL(edges[0].first, 6);
	151	BOOST_CHECK_EQUAL(edges[1].first, 8);
	152	BOOST_CHECK_EQUAL(edges[2].first, 16);
175d6573	153	BOOST_CHECK_EQUAL(edges[3].first, 18);
4ceab49a	154	}
ecda6ca9 JH	155
	156	BOOST_AUTO_TEST_CASE(LargeData)
	157	{
	158	uint8_t prev_sample;
38f5609e	159	const unsigned int Length = 1000000;
ecda6ca9 JH	160
	161	sr_datafeed_logic logic;
	162	logic.unitsize = 1;
	163	logic.length = Length;
	164	logic.data = new uint8_t[Length];
	165	uint8_t data = (uint8_t)logic.data;
	166
333d5bbc	167	for (unsigned int i = 0; i < Length; i++)
ecda6ca9 JH	168	*data++ = (uint8_t)(i >> 8);
ecda6ca9 JH	169
1b1ec774	170	LogicSnapshot s(logic);
ecda6ca9 JH	171	delete[] (uint8_t*)logic.data;
	172
	173	BOOST_CHECK(s.get_sample_count() == Length);
	174
	175	// Check mip map level 0
	176	BOOST_CHECK_EQUAL(s._mip_map[0].length, 62500);
	177	BOOST_CHECK_EQUAL(s._mip_map[0].data_length,
1b1ec774	178	LogicSnapshot::MipMapDataUnit);
ecda6ca9 JH	179	BOOST_REQUIRE(s._mip_map[0].data != NULL);
	180
	181	prev_sample = 0;
333d5bbc	182	for (unsigned int i = 0; i < s._mip_map[0].length;)
ecda6ca9 JH	183	{
	184	BOOST_TEST_MESSAGE("Testing mip_map[0].data[" << i << "]");
	185
	186	const uint8_t sample = (uint8_t)((i*16) >> 8);
b2bcbe51	187	BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF,
ecda6ca9 JH	188	prev_sample ^ sample);
	189	prev_sample = sample;
	190
333d5bbc	191	for (int j = 1; i < s._mip_map[0].length && j < 16; j++)
ecda6ca9 JH	192	{
ecda6ca9 JH	193	BOOST_TEST_MESSAGE("Testing mip_map[0].data[" << i << "]");
b2bcbe51	194	BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF, 0);
ecda6ca9 JH	195	}
	196	}
	197
	198	// Check mip map level 1
	199	BOOST_CHECK_EQUAL(s._mip_map[1].length, 3906);
	200	BOOST_CHECK_EQUAL(s._mip_map[1].data_length,
1b1ec774	201	LogicSnapshot::MipMapDataUnit);
ecda6ca9 JH	202	BOOST_REQUIRE(s._mip_map[1].data != NULL);
	203
	204	prev_sample = 0;
333d5bbc	205	for (unsigned int i = 0; i < s._mip_map[1].length; i++)
ecda6ca9 JH	206	{
	207	BOOST_TEST_MESSAGE("Testing mip_map[1].data[" << i << "]");
	208
	209	const uint8_t sample = i;
	210	const uint8_t expected = sample ^ prev_sample;
	211	prev_sample = i;
	212
b2bcbe51	213	BOOST_CHECK_EQUAL(s.get_subsample(1, i) & 0xFF, expected);
ecda6ca9 JH	214	}
	215
	216	// Check mip map level 2
	217	BOOST_CHECK_EQUAL(s._mip_map[2].length, 244);
	218	BOOST_CHECK_EQUAL(s._mip_map[2].data_length,
1b1ec774	219	LogicSnapshot::MipMapDataUnit);
ecda6ca9 JH	220	BOOST_REQUIRE(s._mip_map[2].data != NULL);
	221
	222	prev_sample = 0;
333d5bbc	223	for (unsigned int i = 0; i < s._mip_map[2].length; i++)
ecda6ca9 JH	224	{
	225	BOOST_TEST_MESSAGE("Testing mip_map[2].data[" << i << "]");
	226
	227	const uint8_t sample = i << 4;
	228	const uint8_t expected = (sample ^ prev_sample) \| 0x0F;
	229	prev_sample = sample;
	230
b2bcbe51	231	BOOST_CHECK_EQUAL(s.get_subsample(2, i) & 0xFF, expected);
ecda6ca9 JH	232	}
	233
	234	// Check mip map level 3
	235	BOOST_CHECK_EQUAL(s._mip_map[3].length, 15);
	236	BOOST_CHECK_EQUAL(s._mip_map[3].data_length,
1b1ec774	237	LogicSnapshot::MipMapDataUnit);
ecda6ca9 JH	238	BOOST_REQUIRE(s._mip_map[3].data != NULL);
ecda6ca9 JH	239
333d5bbc	240	for (unsigned int i = 0; i < s._mip_map[3].length; i++)
ecda6ca9 JH	241	BOOST_CHECK_EQUAL(((uint8_t)s._mip_map[3].data + i),
	242	0xFF);
	243
	244	// Check the higher levels
1b1ec774	245	for (unsigned int i = 4; i < LogicSnapshot::ScaleStepCount; i++)
ecda6ca9	246	{
1b1ec774	247	const LogicSnapshot::MipMapLevel &m = s._mip_map[i];
ecda6ca9 JH	248	BOOST_CHECK_EQUAL(m.length, 0);
	249	BOOST_CHECK_EQUAL(m.data_length, 0);
	250	BOOST_CHECK(m.data == NULL);
	251	}
	252
1b1ec774	253	//----- Test LogicSnapshot::get_subsampled_edges -----//
ac7aa636	254	// Check in normal case
1b1ec774	255	vector<LogicSnapshot::EdgePair> edges;
ecda6ca9	256	s.get_subsampled_edges(edges, 0, Length-1, 1, 7);
ecda6ca9	257
39f6e56e JH	258	BOOST_CHECK_EQUAL(edges.size(), 32);
39f6e56e JH	259
333d5bbc	260	for (unsigned int i = 0; i < edges.size() - 1; i++)
ecda6ca9	261	{
39f6e56e JH	262	BOOST_CHECK_EQUAL(edges[i].first, i * 32768);
39f6e56e JH	263	BOOST_CHECK_EQUAL(edges[i].second, i & 1);
ecda6ca9 JH	264	}
ecda6ca9 JH	265
175d6573	266	BOOST_CHECK_EQUAL(edges[31].first, 1000000);
ac7aa636 JH	267
	268	// Check in very low zoom case
	269	edges.clear();
	270	s.get_subsampled_edges(edges, 0, Length-1, 50e6f, 7);
	271
	272	BOOST_CHECK_EQUAL(edges.size(), 2);
ecda6ca9 JH	273	}
ecda6ca9 JH	274
3db297c4 JH	275	BOOST_AUTO_TEST_CASE(Pulses)
	276	{
	277	const int Cycles = 3;
	278	const int Period = 64;
	279	const int Length = Cycles * Period;
	280
1b1ec774	281	vector<LogicSnapshot::EdgePair> edges;
3db297c4	282
1b1ec774	283	//----- Create a LogicSnapshot -----//
3db297c4 JH	284	sr_datafeed_logic logic;
	285	logic.unitsize = 1;
	286	logic.length = Length;
	287	logic.data = (uint64_t*)new uint8_t[Length];
	288	uint8_t p = (uint8_t)logic.data;
	289
333d5bbc	290	for (int i = 0; i < Cycles; i++) {
3db297c4	291	*p++ = 0xFF;
333d5bbc	292	for (int j = 1; j < Period; j++)
3db297c4 JH	293	*p++ = 0x00;
	294	}
	295
1b1ec774	296	LogicSnapshot s(logic);
821f23af	297	delete[] (uint8_t*)logic.data;
3db297c4 JH	298
	299	//----- Check the mip-map -----//
	300	// Check mip map level 0
	301	BOOST_CHECK_EQUAL(s._mip_map[0].length, 12);
	302	BOOST_CHECK_EQUAL(s._mip_map[0].data_length,
1b1ec774	303	LogicSnapshot::MipMapDataUnit);
3db297c4 JH	304	BOOST_REQUIRE(s._mip_map[0].data != NULL);
3db297c4 JH	305
333d5bbc	306	for (unsigned int i = 0; i < s._mip_map[0].length;) {
3db297c4 JH	307	BOOST_TEST_MESSAGE("Testing mip_map[0].data[" << i << "]");
	308	BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF, 0xFF);
	309
333d5bbc	310	for (int j = 1;
3db297c4	311	i < s._mip_map[0].length &&
1b1ec774	312	j < Period/LogicSnapshot::MipMapScaleFactor; j++) {
3db297c4 JH	313	BOOST_TEST_MESSAGE(
	314	"Testing mip_map[0].data[" << i << "]");
	315	BOOST_CHECK_EQUAL(s.get_subsample(0, i++) & 0xFF, 0x00);
	316	}
	317	}
	318
	319	// Check the higher levels are all inactive
1b1ec774 JH	320	for (unsigned int i = 1; i < LogicSnapshot::ScaleStepCount; i++) {
1b1ec774 JH	321	const LogicSnapshot::MipMapLevel &m = s._mip_map[i];
3db297c4 JH	322	BOOST_CHECK_EQUAL(m.length, 0);
	323	BOOST_CHECK_EQUAL(m.data_length, 0);
	324	BOOST_CHECK(m.data == NULL);
	325	}
	326
	327	//----- Test get_subsampled_edges at reduced scale -----//
	328	s.get_subsampled_edges(edges, 0, Length-1, 16.0f, 2);
7d0d64f9	329	BOOST_REQUIRE_EQUAL(edges.size(), Cycles + 2);
3db297c4	330
7d0d64f9	331	BOOST_CHECK_EQUAL(0, false);
333d5bbc	332	for (unsigned int i = 1; i < edges.size(); i++)
3db297c4 JH	333	BOOST_CHECK_EQUAL(edges[i].second, false);
	334	}
	335
910b16ec JH	336	BOOST_AUTO_TEST_CASE(LongPulses)
	337	{
	338	const int Cycles = 3;
	339	const int Period = 64;
	340	const int PulseWidth = 16;
	341	const int Length = Cycles * Period;
	342
	343	int j;
1b1ec774	344	vector<LogicSnapshot::EdgePair> edges;
910b16ec	345
1b1ec774	346	//----- Create a LogicSnapshot -----//
910b16ec	347	sr_datafeed_logic logic;
4f767cf7	348	logic.unitsize = 8;
37fdce0a	349	logic.length = Length * 8;
4f767cf7 JH	350	logic.data = (uint64_t*)new uint64_t[Length];
4f767cf7 JH	351	uint64_t p = (uint64_t)logic.data;
910b16ec	352
333d5bbc UH	353	for (int i = 0; i < Cycles; i++) {
333d5bbc UH	354	for (j = 0; j < PulseWidth; j++)
4f767cf7	355	*p++ = ~0;
333d5bbc	356	for (; j < Period; j++)
4f767cf7	357	*p++ = 0;
910b16ec JH	358	}
910b16ec JH	359
1b1ec774	360	LogicSnapshot s(logic);
ba3c4dae	361	delete[] (uint64_t*)logic.data;
910b16ec JH	362
	363	//----- Check the mip-map -----//
	364	// Check mip map level 0
	365	BOOST_CHECK_EQUAL(s._mip_map[0].length, 12);
	366	BOOST_CHECK_EQUAL(s._mip_map[0].data_length,
1b1ec774	367	LogicSnapshot::MipMapDataUnit);
910b16ec JH	368	BOOST_REQUIRE(s._mip_map[0].data != NULL);
910b16ec JH	369
333d5bbc UH	370	for (unsigned int i = 0; i < s._mip_map[0].length;) {
333d5bbc UH	371	for (j = 0; i < s._mip_map[0].length && j < 2; j++) {
910b16ec JH	372	BOOST_TEST_MESSAGE(
910b16ec JH	373	"Testing mip_map[0].data[" << i << "]");
4f767cf7	374	BOOST_CHECK_EQUAL(s.get_subsample(0, i++), ~0);
910b16ec JH	375	}
910b16ec JH	376
333d5bbc	377	for (; i < s._mip_map[0].length &&
1b1ec774	378	j < Period/LogicSnapshot::MipMapScaleFactor; j++) {
910b16ec JH	379	BOOST_TEST_MESSAGE(
910b16ec JH	380	"Testing mip_map[0].data[" << i << "]");
4f767cf7	381	BOOST_CHECK_EQUAL(s.get_subsample(0, i++), 0);
910b16ec JH	382	}
	383	}
	384
	385	// Check the higher levels are all inactive
1b1ec774 JH	386	for (unsigned int i = 1; i < LogicSnapshot::ScaleStepCount; i++) {
1b1ec774 JH	387	const LogicSnapshot::MipMapLevel &m = s._mip_map[i];
910b16ec JH	388	BOOST_CHECK_EQUAL(m.length, 0);
	389	BOOST_CHECK_EQUAL(m.data_length, 0);
	390	BOOST_CHECK(m.data == NULL);
	391	}
	392
	393	//----- Test get_subsampled_edges at a full scale -----//
	394	s.get_subsampled_edges(edges, 0, Length-1, 16.0f, 2);
	395	BOOST_REQUIRE_EQUAL(edges.size(), Cycles * 2 + 1);
	396
333d5bbc	397	for (int i = 0; i < Cycles; i++) {
910b16ec JH	398	BOOST_CHECK_EQUAL(edges[i2].first, i Period);
	399	BOOST_CHECK_EQUAL(edges[i*2].second, true);
	400	BOOST_CHECK_EQUAL(edges[i2+1].first, i Period + PulseWidth);
	401	BOOST_CHECK_EQUAL(edges[i*2+1].second, false);
	402	}
	403
175d6573	404	BOOST_CHECK_EQUAL(edges.back().first, Length);
910b16ec JH	405	BOOST_CHECK_EQUAL(edges.back().second, false);
	406
	407	//----- Test get_subsampled_edges at a simplified scale -----//
	408	edges.clear();
	409	s.get_subsampled_edges(edges, 0, Length-1, 17.0f, 2);
	410
7d0d64f9 JH	411	BOOST_CHECK_EQUAL(edges[0].first, 0);
	412	BOOST_CHECK_EQUAL(edges[0].second, true);
	413	BOOST_CHECK_EQUAL(edges[1].first, 16);
	414	BOOST_CHECK_EQUAL(edges[1].second, false);
	415
333d5bbc	416	for (int i = 1; i < Cycles; i++) {
7d0d64f9 JH	417	BOOST_CHECK_EQUAL(edges[i+1].first, i * Period);
7d0d64f9 JH	418	BOOST_CHECK_EQUAL(edges[i+1].second, false);
910b16ec JH	419	}
910b16ec JH	420
175d6573	421	BOOST_CHECK_EQUAL(edges.back().first, Length);
910b16ec JH	422	BOOST_CHECK_EQUAL(edges.back().second, false);
	423	}
	424
a126c277 JH	425	BOOST_AUTO_TEST_CASE(LisaMUsbHid)
	426	{
	427	/* This test was created from the beginning of the USB_DM signal in
	428	* sigrok-dumps-usb/lisa_m_usbhid/lisa_m_usbhid.sr
	429	*/
	430
	431	const int Edges[] = {
	432	7028, 7033, 7036, 7041, 7044, 7049, 7053, 7066, 7073, 7079,
	433	7086, 7095, 7103, 7108, 7111, 7116, 7119, 7124, 7136, 7141,
	434	7148, 7162, 7500
	435	};
	436	const int Length = Edges[countof(Edges) - 1];
	437
	438	bool state = false;
	439	int lastEdgePos = 0;
	440
1b1ec774	441	//----- Create a LogicSnapshot -----//
a126c277 JH	442	sr_datafeed_logic logic;
	443	logic.unitsize = 1;
	444	logic.length = Length;
	445	logic.data = new uint8_t[Length];
	446	uint8_t data = (uint8_t)logic.data;
	447
333d5bbc	448	for (unsigned int i = 0; i < countof(Edges); i++) {
a126c277 JH	449	const int edgePos = Edges[i];
	450	memset(&data[lastEdgePos], state ? 0x02 : 0,
	451	edgePos - lastEdgePos - 1);
	452
	453	lastEdgePos = edgePos;
	454	state = !state;
	455	}
	456
1b1ec774	457	LogicSnapshot s(logic);
a126c277 JH	458	delete[] (uint64_t*)logic.data;
a126c277 JH	459
1b1ec774	460	vector<LogicSnapshot::EdgePair> edges;
a126c277 JH	461
	462
	463	/* The trailing edge of the pulse train is falling in the source data.
	464	* Check this is always true at different scales
	465	*/
	466
	467	edges.clear();
	468	s.get_subsampled_edges(edges, 0, Length-1, 33.333332f, 1);
	469	BOOST_CHECK_EQUAL(edges[edges.size() - 2].second, false);
	470	}
	471
6092d96f AG	472	/*
	473	* This test checks the rendering of wide data (more than 8 probes)
	474	* Probe signals are either all-high, or all-low, but are interleaved such that
	475	* they would toggle during every sample if treated like 8 probes.
	476	* The packet contains a large number of samples, so the mipmap generation kicks
	477	* in.
	478	*
	479	* The signals should not toggle (have exactly two edges: the start and end)
	480	*/
	481	BOOST_AUTO_TEST_CASE(WideData)
	482	{
	483	const int Length = 512<<10;
	484	uint16_t *data = new uint16_t[Length];
	485
	486	sr_datafeed_logic logic;
	487	logic.unitsize = sizeof(data[0]);
	488	logic.length = Length * sizeof(data[0]);
	489	logic.data = data;
	490
9ba4ca35	491	for (int i = 0; i < Length; i++)
6092d96f AG	492	data[i] = 0x0FF0;
	493
	494	LogicSnapshot s(logic);
	495
	496	vector<LogicSnapshot::EdgePair> edges;
	497
	498	edges.clear();
	499	s.get_subsampled_edges(edges, 0, Length-1, 1, 0);
	500	BOOST_CHECK_EQUAL(edges.size(), 2);
	501
	502	edges.clear();
	503	s.get_subsampled_edges(edges, 0, Length-1, 1, 8);
	504	BOOST_CHECK_EQUAL(edges.size(), 2);
	505
	506	// Cleanup
	507	delete [] data;
	508	}
a126c277	509
c6013ca7 JH	510	/*
	511	* This test is a replica of sixteen.sr attached to Bug #33.
	512	*/
	513	BOOST_AUTO_TEST_CASE(Sixteen)
	514	{
	515	const int Length = 8;
	516	uint16_t data[Length];
	517
	518	sr_datafeed_logic logic;
	519	logic.unitsize = sizeof(data[0]);
	520	logic.length = Length * sizeof(data[0]);
	521	logic.data = data;
	522
9ba4ca35	523	for (int i = 0; i < Length; i++)
c6013ca7 JH	524	data[i] = 0xFFFE;
	525
	526	LogicSnapshot s(logic);
	527
	528	vector<LogicSnapshot::EdgePair> edges;
	529	s.get_subsampled_edges(edges, 0, 2, 0.0004, 1);
	530
	531	BOOST_CHECK_EQUAL(edges.size(), 2);
	532	}
	533
ecda6ca9	534	BOOST_AUTO_TEST_SUITE_END()