[pulseview.git] / test / data / logicsegment.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, see <http://www.gnu.org/licenses/>.
 */

#include <extdef.h>

#include <cstdint>

#include <boost/test/unit_test.hpp>

#include <pv/data/logicsegment.hpp>

#if 0
using pv::data::LogicSegment;
using std::vector;
#endif

// Dummy, remove again when unit tests are fixed.
BOOST_AUTO_TEST_SUITE(DummyTestSuite)
BOOST_AUTO_TEST_CASE(DummyTestCase)
{
	BOOST_CHECK_EQUAL(1, 1);
}
BOOST_AUTO_TEST_SUITE_END()

#if 0
BOOST_AUTO_TEST_SUITE(LogicSegmentTest)

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

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

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

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

	LogicSegment s(logic);

	//----- Test LogicSegment::push_logic -----//

	BOOST_CHECK(s.get_sample_count() == 0);
	for (unsigned int i = 0; i < LogicSegment::ScaleStepCount; i++)
	{
		const LogicSegment::MipMapLevel &m = s.mip_map_[i];
		BOOST_CHECK_EQUAL(m.length, 0);
		BOOST_CHECK_EQUAL(m.data_length, 0);
		BOOST_CHECK(m.data == nullptr);
	}

	// 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 < LogicSegment::ScaleStepCount; i++)
	{
		const LogicSegment::MipMapLevel &m = s.mip_map_[i];
		BOOST_CHECK_EQUAL(m.length, 0);
		BOOST_CHECK_EQUAL(m.data_length, 0);
		BOOST_CHECK(m.data == nullptr);
	}

	// 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 LogicSegment::MipMapLevel &m0 = s.mip_map_[0];
	BOOST_CHECK_EQUAL(m0.length, 1);
	BOOST_CHECK_EQUAL(m0.data_length, LogicSegment::MipMapDataUnit);
	BOOST_REQUIRE(m0.data != nullptr);
	BOOST_CHECK_EQUAL(((uint8_t*)m0.data)[0], 0x11);

	// The higher levels should still be empty
	for (unsigned int i = 1; i < LogicSegment::ScaleStepCount; i++)
	{
		const LogicSegment::MipMapLevel &m = s.mip_map_[i];
		BOOST_CHECK_EQUAL(m.length, 0);
		BOOST_CHECK_EQUAL(m.data_length, 0);
		BOOST_CHECK(m.data == nullptr);
	}

	// 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, LogicSegment::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 LogicSegment::MipMapLevel &m1 = s.mip_map_[1];
	BOOST_CHECK_EQUAL(m1.length, 1);
	BOOST_CHECK_EQUAL(m1.data_length, LogicSegment::MipMapDataUnit);
	BOOST_REQUIRE(m1.data != nullptr);
	BOOST_CHECK_EQUAL(((uint8_t*)m1.data)[0], 0x11);

	//----- Test LogicSegment::get_subsampled_edges -----//

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

	LogicSegment 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,
		LogicSegment::MipMapDataUnit);
	BOOST_REQUIRE(s.mip_map_[0].data != nullptr);

	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,
		LogicSegment::MipMapDataUnit);
	BOOST_REQUIRE(s.mip_map_[1].data != nullptr);

	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,
		LogicSegment::MipMapDataUnit);
	BOOST_REQUIRE(s.mip_map_[2].data != nullptr);

	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,
		LogicSegment::MipMapDataUnit);
	BOOST_REQUIRE(s.mip_map_[3].data != nullptr);

	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 < LogicSegment::ScaleStepCount; i++)
	{
		const LogicSegment::MipMapLevel &m = s.mip_map_[i];
		BOOST_CHECK_EQUAL(m.length, 0);
		BOOST_CHECK_EQUAL(m.data_length, 0);
		BOOST_CHECK(m.data == nullptr);
	}

	//----- Test LogicSegment::get_subsampled_edges -----//
	// Check in normal case
	vector<LogicSegment::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<LogicSegment::EdgePair> edges;

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

	LogicSegment 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,
		LogicSegment::MipMapDataUnit);
	BOOST_REQUIRE(s.mip_map_[0].data != nullptr);

	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/LogicSegment::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 < LogicSegment::ScaleStepCount; i++) {
		const LogicSegment::MipMapLevel &m = s.mip_map_[i];
		BOOST_CHECK_EQUAL(m.length, 0);
		BOOST_CHECK_EQUAL(m.data_length, 0);
		BOOST_CHECK(m.data == nullptr);
	}

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

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

	LogicSegment 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,
		LogicSegment::MipMapDataUnit);
	BOOST_REQUIRE(s.mip_map_[0].data != nullptr);

	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/LogicSegment::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 < LogicSegment::ScaleStepCount; i++) {
		const LogicSegment::MipMapLevel &m = s.mip_map_[i];
		BOOST_CHECK_EQUAL(m.length, 0);
		BOOST_CHECK_EQUAL(m.data_length, 0);
		BOOST_CHECK(m.data == nullptr);
	}

	//----- 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 LogicSegment -----//
	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;
	}

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

	vector<LogicSegment::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 channels)
 * Probe signals are either all-high, or all-low, but are interleaved such that
 * they would toggle during every sample if treated like 8 channels.
 * 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;

	LogicSegment s(logic);

	vector<LogicSegment::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;

	LogicSegment s(logic);

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

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

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