1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
/*
flext - C++ layer for Max/MSP and pd (pure data) externals
Copyright (c) 2001-2003 Thomas Grill (xovo@gmx.net)
For information on usage and redistribution, and for a DISCLAIMER OF ALL
WARRANTIES, see the file, "license.txt," in this distribution.
*/
/*! \file flitem.cpp
\brief Processing of method and attribute lists.
*/
#include "flext.h"
#include <string.h>
flext_base::item::item(const t_symbol *t,int inl,attritem *a):
inlet(inl),tag(t),attr(a),nxt(NULL)
{}
flext_base::item::~item()
{
if(nxt) delete nxt;
}
flext_base::itemarr::itemarr():
arr(new item *[2]),cnt(0),bits(-1)
{
arr[0] = arr[1] = NULL;
}
flext_base::itemarr::~itemarr()
{
int c = Ready()?Size():2;
for(int i = 0; i < c; ++i)
if(arr[i]) delete arr[i];
delete[] arr;
}
void flext_base::itemarr::Add(item *it)
{
if(Ready()) {
// retrieve array index
int ix = Hash(it->tag,it->inlet,bits);
// add to array slot
if(arr[ix]) {
item *a = arr[ix];
while(a->nxt) a = a->nxt;
a->nxt = it;
}
else arr[ix] = it;
}
else {
// post("ADD %i,%s",it->inlet,GetString(it->tag));
if(arr[0]) arr[1] = arr[1]->nxt = it;
else arr[0] = arr[1] = it;
++cnt;
}
}
void flext_base::itemarr::Finalize()
{
if(!Ready())
{
bits = Int2Bits(cnt); // at least enough bits to hold all items
int sz = Size();
// save stored item list
item *lst = arr[0];
delete[] arr;
arr = new item *[sz];
memset(arr,0,sz*sizeof(*arr));
while(lst) {
item *l = lst;
lst = lst->nxt;
l->nxt = NULL;
Add(l);
/*
// retrieve array index
int ix = Hash(l->tag,l->inlet,bits);
// post("ADD %i,%s -> index %i",l->inlet,GetString(l->tag),ix);
// add to array slot
if(arr[ix]) {
item *a = arr[ix];
while(a->nxt) a = a->nxt;
a->nxt = l;
}
else arr[ix] = l;
*/
}
#if 0
post("count=%i, bit=%i size=%i",Count(),bits,sz);
if(Count()) {
static char usage[1024];
int c = 0,i;
for(i = 0; i < sz; ++i) {
usage[i] = arr[i]?'x':'.';
if(arr[i]) ++c;
}
usage[i] = 0;
post("USAGE %i/%i - sparse=%i%% %s",c,Count(),(int)((float)c/Count()*100.),usage);
}
#endif
}
}
flext_base::item *flext_base::itemarr::Find(const t_symbol *tag,int inlet) const
{
item *a;
if(!Ready())
a = arr[0];
else if(Count()) {
int ix = Hash(tag,inlet,bits);
a = arr[ix];
}
else
a = NULL;
// Search first matching entry
while(a && (a->tag != tag || a->inlet != inlet)) a = a->nxt;
return a;
}
int flext_base::itemarr::Hash(const t_symbol *tag,int inlet,int bits)
{
unsigned long h = ((reinterpret_cast<unsigned long>(tag)&~7L)<<1)+inlet;
return FoldBits(h,bits);
}
// --- class item lists (methods and attributes) ----------------
class _itemarr
{
public:
enum { HASHBITS=7, HASHSIZE=1<<HASHBITS };
_itemarr(t_class *c,int i);
~_itemarr(); // will never be called
static int Hash(t_class *c,int ix);
int Hash() const { return Hash(cl,ix); }
void Add(_itemarr *a);
t_class *cl;
int ix;
flext_base::itemarr *arr;
_itemarr *nxt;
};
_itemarr::_itemarr(t_class *c,int i):
cl(c),ix(i),
arr(new flext_base::itemarr),
nxt(NULL)
{}
void _itemarr::Add(_itemarr *a)
{
if(nxt) nxt->Add(a);
else nxt = a;
}
int _itemarr::Hash(t_class *c,int ix)
{
unsigned long h = (reinterpret_cast<unsigned long>(c)&~3L)+ix;
return flext::FoldBits(h,HASHBITS);
}
static _itemarr **_arrs = NULL;
flext_base::itemarr *flext_base::GetClassArr(t_class *c,int ix)
{
if(!_arrs) {
_arrs = new _itemarr *[_itemarr::HASHSIZE];
memset(_arrs,0,_itemarr::HASHSIZE*sizeof(*_arrs));
}
int hash = _itemarr::Hash(c,ix);
_itemarr *a = _arrs[hash];
_itemarr *pa = NULL;
while(a && (a->cl != c || a->ix != ix)) pa = a,a = a->nxt;
if(!a) {
a = new _itemarr(c,ix);
if(pa)
// previous entry... extend
a->nxt = pa->nxt,pa->nxt = a;
else
// new singular entry
_arrs[hash] = a;
}
return a->arr;
}
|
