]> sigrok.org Git - pulseview.git/blame_incremental - pv/data/decode/rowdata.cpp
RowData: Include fix
[pulseview.git] / pv / data / decode / rowdata.cpp
... / ...
CommitLineData
1/*
2 * This file is part of the PulseView project.
3 *
4 * Copyright (C) 2014 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, see <http://www.gnu.org/licenses/>.
18 */
19
20#include <cassert>
21
22#include <pv/data/decode/decoder.hpp>
23#include <pv/data/decode/row.hpp>
24#include <pv/data/decode/rowdata.hpp>
25
26using std::vector;
27
28namespace pv {
29namespace data {
30namespace decode {
31
32RowData::RowData(Row* row) :
33 row_(row),
34 prev_ann_start_sample_(0)
35{
36 assert(row);
37}
38
39uint64_t RowData::get_max_sample() const
40{
41 if (annotations_.empty())
42 return 0;
43 return annotations_.back().end_sample();
44}
45
46uint64_t RowData::get_annotation_count() const
47{
48 return annotations_.size();
49}
50
51void RowData::get_annotation_subset(
52 vector<const pv::data::decode::Annotation*> &dest,
53 uint64_t start_sample, uint64_t end_sample) const
54{
55 // Determine whether we must apply per-class filtering or not
56 bool all_ann_classes_enabled = true;
57 bool all_ann_classes_disabled = true;
58
59 uint32_t max_ann_class_id = 0;
60 for (AnnotationClass* c : row_->ann_classes()) {
61 if (!c->visible)
62 all_ann_classes_enabled = false;
63 else
64 all_ann_classes_disabled = false;
65 if (c->id > max_ann_class_id)
66 max_ann_class_id = c->id;
67 }
68
69 if (all_ann_classes_enabled) {
70 // No filtering, send everyting out as-is
71 dest.reserve(dest.size() + annotations_.size());
72 for (const auto& annotation : annotations_)
73 if ((annotation.end_sample() > start_sample) &&
74 (annotation.start_sample() <= end_sample))
75 dest.push_back(&annotation);
76 } else {
77 if (!all_ann_classes_disabled) {
78 // Filter out invisible annotation classes
79 vector<size_t> class_visible;
80 class_visible.resize(max_ann_class_id + 1, 0);
81 for (AnnotationClass* c : row_->ann_classes())
82 if (c->visible)
83 class_visible[c->id] = 1;
84
85 dest.reserve(dest.size() + annotations_.size());
86 for (const auto& annotation : annotations_)
87 if ((class_visible[annotation.ann_class()]) &&
88 (annotation.end_sample() > start_sample) &&
89 (annotation.start_sample() <= end_sample))
90 dest.push_back(&annotation);
91 }
92 }
93}
94
95void RowData::emplace_annotation(srd_proto_data *pdata)
96{
97 // We insert the annotation in a way so that the annotation list
98 // is sorted by start sample. Otherwise, we'd have to sort when
99 // painting, which is expensive
100
101 if (pdata->start_sample < prev_ann_start_sample_) {
102 // Find location to insert the annotation at
103
104 auto it = annotations_.end();
105 do {
106 it--;
107 } while ((it->start_sample() > pdata->start_sample) && (it != annotations_.begin()));
108
109 // Allow inserting at the front
110 if (it != annotations_.begin())
111 it++;
112
113 annotations_.insert(it, Annotation(pdata, row_));
114 } else {
115 annotations_.emplace_back(pdata, row_);
116 prev_ann_start_sample_ = pdata->start_sample;
117 }
118}
119
120} // namespace decode
121} // namespace data
122} // namespace pv