X-Git-Url: https://sigrok.org/gitweb/?p=pulseview.git;a=blobdiff_plain;f=pv%2Fdata%2Fdecode%2Frowdata.cpp;h=3d250f49472eb03194d1001c6dd693c2ef644ae2;hp=83074e00d566c290ff0a3dafa2b8a8288671de00;hb=1e948182f3f9353bd74875a37cacc833312a8c8e;hpb=efdec55aec1a137460fa362a381ed1904182bfed

diff --git a/pv/data/decode/rowdata.cpp b/pv/data/decode/rowdata.cpp
index 83074e00..3d250f49 100644
--- a/pv/data/decode/rowdata.cpp
+++ b/pv/data/decode/rowdata.cpp
@@ -17,7 +17,11 @@
  * along with this program; if not, see <http://www.gnu.org/licenses/>.
  */
 
-#include "rowdata.hpp"
+#include <cassert>
+
+#include <pv/data/decode/decoder.hpp>
+#include <pv/data/decode/row.hpp>
+#include <pv/data/decode/rowdata.hpp>
 
 using std::vector;
 
@@ -25,8 +29,16 @@ namespace pv {
 namespace data {
 namespace decode {
 
-RowData::RowData()
+RowData::RowData(Row* row) :
+	row_(row),
+	prev_ann_start_sample_(0)
+{
+	assert(row);
+}
+
+const Row* RowData::row() const
 {
+	return row_;
 }
 
 uint64_t RowData::get_max_sample() const
@@ -36,21 +48,112 @@ uint64_t RowData::get_max_sample() const
 	return annotations_.back().end_sample();
 }
 
+uint64_t RowData::get_annotation_count() const
+{
+	return annotations_.size();
+}
+
 void RowData::get_annotation_subset(
-	vector<pv::data::decode::Annotation> &dest,
+	deque<const pv::data::decode::Annotation*> &dest,
 	uint64_t start_sample, uint64_t end_sample) const
 {
-	for (const auto& annotation : annotations_)
-		if (annotation.end_sample() > start_sample &&
-			annotation.start_sample() <= end_sample)
-			dest.push_back(annotation);
+	// Determine whether we must apply per-class filtering or not
+	bool all_ann_classes_enabled = true;
+	bool all_ann_classes_disabled = true;
+
+	uint32_t max_ann_class_id = 0;
+	for (AnnotationClass* c : row_->ann_classes()) {
+		if (!c->visible())
+			all_ann_classes_enabled = false;
+		else
+			all_ann_classes_disabled = false;
+		if (c->id > max_ann_class_id)
+			max_ann_class_id = c->id;
+	}
+
+	if (all_ann_classes_enabled) {
+		// No filtering, send everyting out as-is
+		for (const auto& annotation : annotations_)
+			if ((annotation.end_sample() > start_sample) &&
+				(annotation.start_sample() <= end_sample))
+				dest.push_back(&annotation);
+	} else {
+		if (!all_ann_classes_disabled) {
+			// Filter out invisible annotation classes
+			vector<size_t> class_visible;
+			class_visible.resize(max_ann_class_id + 1, 0);
+			for (AnnotationClass* c : row_->ann_classes())
+				if (c->visible())
+					class_visible[c->id] = 1;
+
+			for (const auto& annotation : annotations_)
+				if ((class_visible[annotation.ann_class_id()]) &&
+					(annotation.end_sample() > start_sample) &&
+					(annotation.start_sample() <= end_sample))
+					dest.push_back(&annotation);
+		}
+	}
+}
+
+const deque<Annotation>& RowData::annotations() const
+{
+	return annotations_;
 }
 
-void RowData::push_annotation(const Annotation &a)
+const Annotation* RowData::emplace_annotation(srd_proto_data *pdata)
 {
-	annotations_.push_back(a);
+	const srd_proto_data_annotation *const pda = (const srd_proto_data_annotation*)pdata->data;
+
+	uint32_t ann_class_id = pda->ann_class;
+
+	// Look up the longest annotation text to see if we have it in storage.
+	// This implies that if the longest text is the same, the shorter texts
+	// are expected to be the same, too. PDs that violate this assumption
+	// should be considered broken.
+	const char* const* ann_texts = (char**)pda->ann_text;
+	const QString ann0 = QString::fromUtf8(ann_texts[0]);
+	vector<QString>* storage_entry = &(ann_texts_[ann0]);
+
+	if (storage_entry->empty()) {
+		while (*ann_texts) {
+			storage_entry->emplace_back(QString::fromUtf8(*ann_texts));
+			ann_texts++;
+		}
+		storage_entry->shrink_to_fit();
+	}
+
+
+	const Annotation* result = nullptr;
+
+	// We insert the annotation in a way so that the annotation list
+	// is sorted by start sample. Otherwise, we'd have to sort when
+	// painting, which is expensive
+
+	if (pdata->start_sample < prev_ann_start_sample_) {
+		// Find location to insert the annotation at
+
+		auto it = annotations_.end();
+		do {
+			it--;
+		} while ((it->start_sample() > pdata->start_sample) && (it != annotations_.begin()));
+
+		// Allow inserting at the front
+		if (it != annotations_.begin())
+			it++;
+
+		it = annotations_.emplace(it, pdata->start_sample, pdata->end_sample,
+			storage_entry, ann_class_id, this);
+		result = &(*it);
+	} else {
+		annotations_.emplace_back(pdata->start_sample, pdata->end_sample,
+			storage_entry, ann_class_id, this);
+		result = &(annotations_.back());
+		prev_ann_start_sample_ = pdata->start_sample;
+	}
+
+	return result;
 }
 
-} // decode
-} // data
-} // pv
+}  // namespace decode
+}  // namespace data
+}  // namespace pv