cannam@0
|
1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
|
cannam@0
|
2
|
cannam@0
|
3 /*
|
cannam@0
|
4 Vamp Plugin Fuzz Tester
|
cannam@0
|
5 Chris Cannam, cannam@all-day-breakfast.com
|
cannam@0
|
6 Centre for Digital Music, Queen Mary, University of London.
|
cannam@0
|
7 Copyright 2009 QMUL.
|
cannam@0
|
8
|
cannam@0
|
9 This program loads a Vamp plugin and tests its susceptibility to a
|
cannam@0
|
10 number of common pitfalls, including handling of extremes of input
|
cannam@0
|
11 data. If you can think of any additional useful tests that are
|
cannam@0
|
12 easily added, please send them to me.
|
cannam@0
|
13
|
cannam@0
|
14 Permission is hereby granted, free of charge, to any person
|
cannam@0
|
15 obtaining a copy of this software and associated documentation
|
cannam@0
|
16 files (the "Software"), to deal in the Software without
|
cannam@0
|
17 restriction, including without limitation the rights to use, copy,
|
cannam@0
|
18 modify, merge, publish, distribute, sublicense, and/or sell copies
|
cannam@0
|
19 of the Software, and to permit persons to whom the Software is
|
cannam@0
|
20 furnished to do so, subject to the following conditions:
|
cannam@0
|
21
|
cannam@0
|
22 The above copyright notice and this permission notice shall be
|
cannam@0
|
23 included in all copies or substantial portions of the Software.
|
cannam@0
|
24
|
cannam@0
|
25 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
cannam@0
|
26 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
cannam@0
|
27 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
cannam@0
|
28 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR
|
cannam@0
|
29 ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
|
cannam@0
|
30 CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
cannam@0
|
31 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
cannam@0
|
32
|
cannam@0
|
33 Except as contained in this notice, the names of the Centre for
|
cannam@0
|
34 Digital Music; Queen Mary, University of London; and Chris Cannam
|
cannam@0
|
35 shall not be used in advertising or otherwise to promote the sale,
|
cannam@0
|
36 use or other dealings in this Software without prior written
|
cannam@0
|
37 authorization.
|
cannam@0
|
38 */
|
cannam@0
|
39
|
cannam@0
|
40 #include "Test.h"
|
cannam@0
|
41
|
cannam@0
|
42 #include <vamp-hostsdk/PluginLoader.h>
|
cannam@0
|
43
|
cannam@0
|
44 using namespace Vamp;
|
cannam@0
|
45 using namespace Vamp::HostExt;
|
cannam@0
|
46
|
cannam@1
|
47 #include <cmath>
|
cannam@1
|
48
|
cannam@0
|
49 Test::Test() { }
|
cannam@0
|
50 Test::~Test() { }
|
cannam@0
|
51
|
cannam@0
|
52 Plugin *
|
cannam@0
|
53 Test::load(std::string key, float rate)
|
cannam@0
|
54 {
|
cannam@0
|
55 return PluginLoader::getInstance()->loadPlugin
|
cannam@0
|
56 (key, rate, PluginLoader::ADAPT_ALL);
|
cannam@0
|
57 }
|
cannam@0
|
58
|
cannam@1
|
59 float **
|
cannam@1
|
60 Test::createBlock(size_t channels, size_t blocksize)
|
cannam@1
|
61 {
|
cannam@1
|
62 float **b = new float *[channels];
|
cannam@1
|
63 for (size_t c = 0; c < channels; ++c) {
|
cannam@1
|
64 b[c] = new float[blocksize];
|
cannam@1
|
65 }
|
cannam@1
|
66 return b;
|
cannam@1
|
67 }
|
cannam@1
|
68
|
cannam@1
|
69 void
|
cannam@1
|
70 Test::destroyBlock(float **blocks, size_t channels)
|
cannam@1
|
71 {
|
cannam@1
|
72 for (size_t c = 0; c < channels; ++c) {
|
cannam@1
|
73 delete[] blocks[c];
|
cannam@1
|
74 }
|
cannam@1
|
75 delete[] blocks;
|
cannam@1
|
76 }
|
cannam@1
|
77
|
cannam@1
|
78 bool
|
cannam@1
|
79 Test::initDefaults(Plugin *p, size_t &channels, size_t &step, size_t &block,
|
cannam@1
|
80 Results &r)
|
cannam@1
|
81 {
|
cannam@1
|
82 channels = p->getMinChannelCount();
|
cannam@1
|
83 block = p->getPreferredBlockSize();
|
cannam@1
|
84 step = p->getPreferredStepSize();
|
cannam@1
|
85 if (block == 0) block = 1024;
|
cannam@1
|
86 if (step == 0) {
|
cannam@1
|
87 if (p->getInputDomain() == Plugin::FrequencyDomain) step = block/2;
|
cannam@1
|
88 else step = block;
|
cannam@1
|
89 }
|
cannam@1
|
90 if (!p->initialise(channels, step, block)) {
|
cannam@1
|
91 r.push_back(error("initialisation with default values failed"));
|
cannam@1
|
92 return false;
|
cannam@1
|
93 }
|
cannam@1
|
94 return true;
|
cannam@1
|
95 }
|
cannam@1
|
96
|
cannam@0
|
97 void
|
cannam@0
|
98 Test::appendFeatures(Plugin::FeatureSet &a, const Plugin::FeatureSet &b)
|
cannam@0
|
99 {
|
cannam@0
|
100 for (Plugin::FeatureSet::const_iterator i = b.begin(); i != b.end(); ++i) {
|
cannam@0
|
101 int output = i->first;
|
cannam@0
|
102 const Plugin::FeatureList &fl = i->second;
|
cannam@0
|
103 Plugin::FeatureList &target = a[output];
|
cannam@0
|
104 for (Plugin::FeatureList::const_iterator j = fl.begin(); j != fl.end(); ++j) {
|
cannam@0
|
105 target.push_back(*j);
|
cannam@0
|
106 }
|
cannam@0
|
107 }
|
cannam@0
|
108 }
|
cannam@0
|
109
|
cannam@0
|
110 bool
|
cannam@1
|
111 Test::allFeaturesValid(const Plugin::FeatureSet &b)
|
cannam@1
|
112 {
|
cannam@1
|
113 for (Plugin::FeatureSet::const_iterator i = b.begin(); i != b.end(); ++i) {
|
cannam@1
|
114 for (int j = 0; j < (int)i->second.size(); ++j) {
|
cannam@1
|
115 if (i->second[j].values.empty()) continue;
|
cannam@1
|
116 for (int k = 0; k < (int)i->second[j].values.size(); ++k) {
|
cannam@1
|
117 if (isnan(i->second[j].values[k]) ||
|
cannam@1
|
118 isinf(i->second[j].values[k])) {
|
cannam@1
|
119 return false;
|
cannam@1
|
120 }
|
cannam@1
|
121 }
|
cannam@1
|
122 }
|
cannam@1
|
123 }
|
cannam@1
|
124 return true;
|
cannam@1
|
125 }
|
cannam@1
|
126
|
cannam@1
|
127 bool
|
cannam@0
|
128 operator==(const Plugin::FeatureSet &a, const Plugin::FeatureSet &b)
|
cannam@0
|
129 {
|
cannam@0
|
130 if (a.size() != b.size()) return false;
|
cannam@0
|
131 for (Plugin::FeatureSet::const_iterator ai = a.begin();
|
cannam@0
|
132 ai != a.end(); ++ai) {
|
cannam@0
|
133 int output = ai->first;
|
cannam@0
|
134 Plugin::FeatureSet::const_iterator bi = b.find(output);
|
cannam@0
|
135 if (bi == b.end()) return false;
|
cannam@0
|
136 if (!(ai->second == bi->second)) return false;
|
cannam@0
|
137 }
|
cannam@0
|
138 return true;
|
cannam@0
|
139 }
|
cannam@0
|
140
|
cannam@0
|
141 bool
|
cannam@0
|
142 operator==(const Plugin::FeatureList &a, const Plugin::FeatureList &b)
|
cannam@0
|
143 {
|
cannam@0
|
144 if (a.size() != b.size()) return false;
|
cannam@0
|
145 for (int i = 0; i < (int)a.size(); ++i) {
|
cannam@0
|
146 if (!(a[i] == b[i])) return false;
|
cannam@0
|
147 }
|
cannam@0
|
148 return true;
|
cannam@0
|
149 }
|
cannam@0
|
150
|
cannam@0
|
151 bool
|
cannam@0
|
152 operator==(const Plugin::Feature &a, const Plugin::Feature &b)
|
cannam@0
|
153 {
|
cannam@0
|
154 if (a.hasTimestamp != b.hasTimestamp) return false;
|
cannam@0
|
155 if (a.hasTimestamp && (a.timestamp != b.timestamp)) return false;
|
cannam@0
|
156 if (a.hasDuration != b.hasDuration) return false;
|
cannam@0
|
157 if (a.hasDuration && (a.duration != b.duration)) return false;
|
cannam@0
|
158 if (a.values != b.values) return false;
|
cannam@0
|
159 if (a.label != b.label) return false;
|
cannam@0
|
160 return true;
|
cannam@0
|
161 }
|
cannam@0
|
162
|