Tests: Add tests for Segment class

diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt
index 3a4bdc113d499bdf762c499caef508c098104131..edfee7a5bfa85ef7e76819ee64cc450869d60232 100644 (file)
--- a/test/CMakeLists.txt
+++ b/test/CMakeLists.txt
@@ -89,6 +89,7 @@ set(pulseview_TEST_SOURCES
        ${PROJECT_SOURCE_DIR}/pv/widgets/wellarray.cpp
        data/analogsegment.cpp
        data/logicsegment.cpp
+       data/segment.cpp
        view/ruler.cpp
        test.cpp
        util.cpp

diff --git a/test/data/segment.cpp b/test/data/segment.cpp
new file mode 100644 (file)
index 0000000..ee03a8b
--- /dev/null
+++ b/test/data/segment.cpp
@@ -0,0 +1,263 @@
+/*
+ * This file is part of the PulseView project.
+ *
+ * Copyright (C) 2016 Soeren Apel <soeren@apelpie.net>
+ * Copyright (C) 2013 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 <stdint.h>
+
+#include <boost/test/unit_test.hpp>
+
+#include <pv/data/segment.hpp>
+
+using pv::data::Segment;
+
+BOOST_AUTO_TEST_SUITE(SegmentTest)
+
+
+/* --- For debugging only
+BOOST_AUTO_TEST_CASE(SmallSize8Single)
+{
+       Segment s(1, sizeof(uint8_t));
+       uint32_t num_samples = 10;
+
+       //----- Chunk size << pv::data::Segment::MaxChunkSize @ 8bit, added in 1 call ----//
+       uint8_t* const data = new uint8_t[num_samples];
+       for (uint32_t i = 0; i < num_samples; i++)
+               data[i] = i;
+
+       s.append_samples(data, num_samples);
+       delete[] data;
+
+       BOOST_CHECK(s.get_sample_count() == num_samples);
+
+       for (uint32_t i = 0; i < num_samples; i++) {
+               uint8_t* sample_data = s.get_raw_samples(i, 1);
+               BOOST_CHECK_EQUAL(*sample_data, i);
+               delete[] sample_data;
+       }
+} */
+
+/* --- For debugging only
+BOOST_AUTO_TEST_CASE(MediumSize8Single)
+{
+       Segment s(1, sizeof(uint8_t));
+       uint32_t num_samples = pv::data::Segment::MaxChunkSize;
+
+       //----- Chunk size == pv::data::Segment::MaxChunkSize @ 8bit, added in 1 call ----//
+       uint8_t* const data = new uint8_t[num_samples];
+       for (uint32_t i = 0; i < num_samples; i++)
+               data[i] = i;
+
+       s.append_samples(data, num_samples);
+       delete[] data;
+
+       BOOST_CHECK(s.get_sample_count() == num_samples);
+
+       for (uint32_t i = 0; i < num_samples; i++) {
+               uint8_t* sample_data = s.get_raw_samples(i, 1);
+               BOOST_CHECK_EQUAL(*sample_data, i % 256);
+               delete[] sample_data;
+       }
+} */
+
+/* --- For debugging only
+BOOST_AUTO_TEST_CASE(MaxSize8Single)
+{
+       Segment s(1, sizeof(uint8_t));
+
+       // We want to see proper behavior across chunk boundaries
+       uint32_t num_samples = 2*pv::data::Segment::MaxChunkSize;
+
+       //----- Chunk size >> pv::data::Segment::MaxChunkSize @ 8bit, added in 1 call ----//
+       uint8_t* const data = new uint8_t[num_samples];
+       for (uint32_t i = 0; i < num_samples; i++)
+               data[i] = i;
+
+       s.append_samples(data, num_samples);
+       delete[] data;
+
+       BOOST_CHECK(s.get_sample_count() == num_samples);
+
+       for (uint32_t i = 0; i < num_samples; i++) {
+               uint8_t* sample_data = s.get_raw_samples(i, 1);
+               BOOST_CHECK_EQUAL(*sample_data, i % 256);
+               delete[] sample_data;
+       }
+} */
+
+/* --- For debugging only
+BOOST_AUTO_TEST_CASE(MediumSize24Single)
+{
+       Segment s(1, 3);
+
+       // Chunk size is num*unit_size, so with pv::data::Segment::MaxChunkSize/unit_size, we reach the maximum size
+       uint32_t num_samples = pv::data::Segment::MaxChunkSize / 3;
+
+       //----- Chunk size == pv::data::Segment::MaxChunkSize @ 24bit, added in 1 call ----//
+       uint8_t* const data = new uint8_t[num_samples * 3];
+       for (uint32_t i = 0; i < num_samples * 3; i++)
+               data[i] = i % 256;
+
+       s.append_samples(data, num_samples);
+       delete[] data;
+
+       BOOST_CHECK(s.get_sample_count() == num_samples);
+
+       for (uint32_t i = 0; i < num_samples; i++) {
+               uint8_t* sample_data = s.get_raw_samples(i, 1);
+               BOOST_CHECK_EQUAL(*((uint8_t*)sample_data),      3*i    % 256);
+               BOOST_CHECK_EQUAL(*((uint8_t*)(sample_data+1)), (3*i+1) % 256);
+               BOOST_CHECK_EQUAL(*((uint8_t*)(sample_data+2)), (3*i+2) % 256);
+               delete[] sample_data;
+       }
+} */
+
+/* --- For debugging only
+BOOST_AUTO_TEST_CASE(MediumSize32Single)
+{
+       Segment s(1, sizeof(uint32_t));
+
+       // Chunk size is num*unit_size, so with pv::data::Segment::MaxChunkSize/unit_size, we reach the maximum size
+       uint32_t num_samples = pv::data::Segment::MaxChunkSize / sizeof(uint32_t);
+
+       //----- Chunk size == pv::data::Segment::MaxChunkSize @ 32bit, added in 1 call ----//
+       uint32_t* const data = new uint32_t[num_samples];
+       for (uint32_t i = 0; i < num_samples; i++)
+               data[i] = i;
+
+       s.append_samples(data, num_samples);
+       delete[] data;
+
+       BOOST_CHECK(s.get_sample_count() == num_samples);
+
+       for (uint32_t i = 0; i < num_samples; i++) {
+               uint8_t* sample_data = s.get_raw_samples(i, 1);
+               BOOST_CHECK_EQUAL(*((uint32_t*)sample_data), i);
+               delete[] sample_data;
+       }
+} */
+
+/* --- For debugging only
+BOOST_AUTO_TEST_CASE(MaxSize32Single)
+{
+       Segment s(1, sizeof(uint32_t));
+
+       // Chunk size is num*unit_size, so with pv::data::Segment::MaxChunkSize/unit_size, we reach the maximum size
+       // Also, we want to see proper behavior across chunk boundaries
+       uint32_t num_samples = 2*(pv::data::Segment::MaxChunkSize / sizeof(uint32_t));
+
+       //----- Chunk size >> pv::data::Segment::MaxChunkSize @ 32bit, added in 1 call ----//
+       uint32_t* const data = new uint32_t[num_samples];
+       for (uint32_t i = 0; i < num_samples; i++)
+               data[i] = i;
+
+       s.append_samples(data, num_samples);
+       delete[] data;
+
+       BOOST_CHECK(s.get_sample_count() == num_samples);
+
+       for (uint32_t i = 0; i < num_samples; i++) {
+               uint8_t* sample_data = s.get_raw_samples(i, 1);
+               BOOST_CHECK_EQUAL(*((uint32_t*)sample_data), i);
+               delete[] sample_data;
+       }
+} */
+
+/* --- For debugging only
+BOOST_AUTO_TEST_CASE(MediumSize32Multi)
+{
+       Segment s(1, sizeof(uint32_t));
+
+       // Chunk size is num*unit_size, so with pv::data::Segment::MaxChunkSize/unit_size, we reach the maximum size
+       uint32_t num_samples = pv::data::Segment::MaxChunkSize / sizeof(uint32_t);
+
+       //----- Chunk size == pv::data::Segment::MaxChunkSize @ 32bit, added in num_samples calls ----//
+       uint32_t data;
+       for (uint32_t i = 0; i < num_samples; i++) {
+               data = i;
+               s.append_samples(&data, 1);
+       }
+
+       BOOST_CHECK(s.get_sample_count() == num_samples);
+
+       for (uint32_t i = 0; i < num_samples; i++) {
+               uint8_t* sample_data = s.get_raw_samples(i, 1);
+               BOOST_CHECK_EQUAL(*((uint32_t*)sample_data), i);
+               delete[] sample_data;
+       }
+} */
+
+BOOST_AUTO_TEST_CASE(MaxSize32Multi)
+{
+       Segment s(1, sizeof(uint32_t));
+
+       // Chunk size is num*unit_size, so with pv::data::Segment::MaxChunkSize/unit_size, we reach the maximum size
+       uint32_t num_samples = 2*(pv::data::Segment::MaxChunkSize / sizeof(uint32_t));
+
+       //----- Chunk size == pv::data::Segment::MaxChunkSize @ 32bit, added in num_samples calls ----//
+       uint32_t data;
+       for (uint32_t i = 0; i < num_samples; i++) {
+               data = i;
+               s.append_samples(&data, 1);
+       }
+
+       BOOST_CHECK(s.get_sample_count() == num_samples);
+
+       for (uint32_t i = 0; i < num_samples; i++) {
+               uint8_t* sample_data = s.get_raw_samples(i, 1);
+               BOOST_CHECK_EQUAL(*((uint32_t*)sample_data), i);
+               delete[] sample_data;
+       }
+
+       uint8_t* sample_data = s.get_raw_samples(0, num_samples);
+       for (uint32_t i = 0; i < num_samples; i++) {
+               BOOST_CHECK_EQUAL(*((uint32_t*)(sample_data + i * sizeof(uint32_t))), i);
+       }
+       delete[] sample_data;
+}
+
+BOOST_AUTO_TEST_CASE(MaxSize32MultiIterated)
+{
+       Segment s(1, sizeof(uint32_t));
+
+       // Chunk size is num*unit_size, so with pv::data::Segment::MaxChunkSize/unit_size, we reach the maximum size
+       uint32_t num_samples = 2*(pv::data::Segment::MaxChunkSize / sizeof(uint32_t));
+
+       //----- Chunk size == pv::data::Segment::MaxChunkSize @ 32bit, added in num_samples calls ----//
+       uint32_t data;
+       for (uint32_t i = 0; i < num_samples; i++) {
+               data = i;
+               s.append_samples(&data, 1);
+       }
+
+       BOOST_CHECK(s.get_sample_count() == num_samples);
+
+       pv::data::SegmentRawDataIterator* it = s.begin_raw_sample_iteration(0);
+
+       for (uint32_t i = 0; i < num_samples; i++) {
+               uint8_t* sample_data = it->value;
+               BOOST_CHECK_EQUAL(*((uint32_t*)sample_data), i);
+               s.continue_raw_sample_iteration(it, 1);
+       }
+
+       s.end_raw_sample_iteration(it);
+}
+
+BOOST_AUTO_TEST_SUITE_END()