aboutsummaryrefslogtreecommitdiff
path: root/prevl.c
blob: e061a93b0f26f2e602d2425f214d98853b0a908c (plain)
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
#include "defines.h"

/*--------------- prevl ---------------*/

static t_class *prevl_class;

typedef struct _prevl
{
    t_object x_obj;
	t_float m_lo;
	t_float m_hi;
	int m_buffer_size;
	int m_buffer_index;
	t_float *m_buffer;  // circular buffer
} t_prevl;

static void prevl_set(t_prevl *x, t_float lo, t_float hi, t_float size);

static void prevl_perform_float(t_prevl *x, t_float f)
{
	int index;
	index=x->m_buffer_index+1;
	index=(index==x->m_buffer_size)?0:index;
	x->m_buffer_index=index;
	x->m_buffer[index]=f;
}

static void prevl_bang(t_prevl *x)
{
	int lo,hi,n,index,size;
	t_atom *ap,*app;
	t_float *buffer, *bp;

    prevl_set(x, x->m_lo, x->m_hi, x->m_buffer_size);
	lo=(int)x->m_lo;
	hi=(int)x->m_hi;

	n=hi-lo;
	size=x->m_buffer_size;
	index=x->m_buffer_index;
    ap = (t_atom *)getbytes(sizeof(t_atom)*n);
	app=ap;
	buffer=x->m_buffer;
	bp=buffer+index-lo;
	bp=(bp>=buffer)?bp:bp+size; // wrap
	
	if (bp-buffer>=n)
	{ // no wrap-around needed
		index=n;
		while(index--){
		  SETFLOAT(app, *bp--);
		  app++;
		}
//		post("not wrapped, app-ap=%i",app-ap);
	}
	else // need to wrap
	{
		int ps, nn;
		ps = bp-buffer;
		nn=n;
//		post("        nn=%i",nn);
		for(;ps>=0;ps--)  // don't we miss one sample in signal??? 
		{
//			post("ps=%i",ps);
 			SETFLOAT(app, buffer[ps]);
			app++;
			nn--;
		}
		ps=size-1;
//		post("       nn=%i",nn);
		for(;nn>0;nn--)
		{
//			post("ps=%i",ps);
 			SETFLOAT(app, buffer[ps--]);
			app++;
		}

	}

	outlet_list(x->x_obj.ob_outlet,gensym("list"),n,ap);
	freebytes(ap, sizeof(t_atom)*n);
}

static void prevl_clear(t_prevl *x)
{
	int i,s;
	t_float *f;
	f=x->m_buffer;
	s=x->m_buffer_size;
	for (i=0;i<s;i++)
		*f++=0.0;
}

static void prevl_set(t_prevl *x, t_float lo, t_float hi, t_float size)
{
	if (size<1)
	{
		size=1;
		logpost(x, 2, "[prevl] size is minimum 1");
	}
	if (hi>size)
	{
		logpost(x, 2, "[prevl] higher bound (%g) cannot be greater than the buffer size (%g)",
                hi, size);	
		hi=size;
	}
	if (lo<0)
	{
		logpost(x, 2, "[prevl] lower bound cannot be negative");	
		lo=0;
	}
	if (hi<1)
	{
		logpost(x, 2, "[prevl] higher bound (%g) cannot be smaller than 1", hi);
		hi=1;
	}
	if (hi<=lo)
	{
		logpost(x, 2, "[prevl] higher bound (%g) must be greater than lower bound (%g)",
                hi, lo);	
		lo=hi-1.0;
	}


	x->m_hi=(t_float)((int)hi);
	x->m_lo=(t_float)((int)lo);

    if (x->m_buffer_size != size)
    {
        x->m_buffer_size=(int)size;
        freebytes(x->m_buffer, x->m_buffer_size);
        x->m_buffer = (t_float*)getbytes(sizeof(t_float)*x->m_buffer_size);
        prevl_clear(x);
        x->m_buffer_index=0;
    }
}

static void *prevl_new(t_float lo, t_float hi, t_float size)
{
	t_prevl *x=(t_prevl *)pd_new(prevl_class);
	outlet_new(&x->x_obj, gensym("list"));
	x->m_buffer_size=0;
	x->m_buffer=0;
	prevl_set(x, lo, hi, size);

    floatinlet_new(&x->x_obj, &x->m_lo);
    floatinlet_new(&x->x_obj, &x->m_hi);

	return (void *)x;
}

static void prevl_free(t_prevl *x)
{
	freebytes(x->m_buffer, x->m_buffer_size);
}

void prevl_setup(void)
{
    prevl_class = class_new(gensym("prevl"),
    	(t_newmethod)prevl_new, (t_method)prevl_free,
		sizeof(t_prevl), 
		CLASS_DEFAULT,
	    A_DEFFLOAT, A_DEFFLOAT, A_DEFFLOAT,0);

	class_addmethod(prevl_class, (t_method)prevl_clear, gensym("clear"),0);
    class_addfloat(prevl_class, (t_method)prevl_perform_float);
    class_addbang(prevl_class, (t_method)prevl_bang);
}