feeder.c revision 149950 
1/*-
2 * Copyright (c) 1999 Cameron Grant <cg@freebsd.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 */
26
27#include <dev/sound/pcm/sound.h>
28
29#include "feeder_if.h"
30
31SND_DECLARE_FILE("$FreeBSD: head/sys/dev/sound/pcm/feeder.c 149950 2005-09-10 17:47:39Z netchild $");
32
33MALLOC_DEFINE(M_FEEDER, "feeder", "pcm feeder");
34
35#define MAXFEEDERS 	256
36#undef FEEDER_DEBUG
37
38struct feedertab_entry {
39	SLIST_ENTRY(feedertab_entry) link;
40	struct feeder_class *feederclass;
41	struct pcm_feederdesc *desc;
42
43	int idx;
44};
45static SLIST_HEAD(, feedertab_entry) feedertab;
46
47/*****************************************************************************/
48
49void
50feeder_register(void *p)
51{
52	static int feedercnt = 0;
53
54	struct feeder_class *fc = p;
55	struct feedertab_entry *fte;
56	int i;
57
58	if (feedercnt == 0) {
59		KASSERT(fc->desc == NULL, ("first feeder not root: %s", fc->name));
60
61		SLIST_INIT(&feedertab);
62		fte = malloc(sizeof(*fte), M_FEEDER, M_NOWAIT | M_ZERO);
63		if (fte == NULL) {
64			printf("can't allocate memory for root feeder: %s\n",
65			    fc->name);
66
67			return;
68		}
69		fte->feederclass = fc;
70		fte->desc = NULL;
71		fte->idx = feedercnt;
72		SLIST_INSERT_HEAD(&feedertab, fte, link);
73		feedercnt++;
74
75		/* we've got our root feeder so don't veto pcm loading anymore */
76		pcm_veto_load = 0;
77
78		return;
79	}
80
81	KASSERT(fc->desc != NULL, ("feeder '%s' has no descriptor", fc->name));
82
83	/* beyond this point failure is non-fatal but may result in some translations being unavailable */
84	i = 0;
85	while ((feedercnt < MAXFEEDERS) && (fc->desc[i].type > 0)) {
86		/* printf("adding feeder %s, %x -> %x\n", fc->name, fc->desc[i].in, fc->desc[i].out); */
87		fte = malloc(sizeof(*fte), M_FEEDER, M_NOWAIT | M_ZERO);
88		if (fte == NULL) {
89			printf("can't allocate memory for feeder '%s', %x -> %x\n", fc->name, fc->desc[i].in, fc->desc[i].out);
90
91			return;
92		}
93		fte->feederclass = fc;
94		fte->desc = &fc->desc[i];
95		fte->idx = feedercnt;
96		fte->desc->idx = feedercnt;
97		SLIST_INSERT_HEAD(&feedertab, fte, link);
98		i++;
99	}
100	feedercnt++;
101	if (feedercnt >= MAXFEEDERS)
102		printf("MAXFEEDERS (%d >= %d) exceeded\n", feedercnt, MAXFEEDERS);
103}
104
105static void
106feeder_unregisterall(void *p)
107{
108	struct feedertab_entry *fte, *next;
109
110	next = SLIST_FIRST(&feedertab);
111	while (next != NULL) {
112		fte = next;
113		next = SLIST_NEXT(fte, link);
114		free(fte, M_FEEDER);
115	}
116}
117
118static int
119cmpdesc(struct pcm_feederdesc *n, struct pcm_feederdesc *m)
120{
121	return ((n->type == m->type) &&
122		((n->in == 0) || (n->in == m->in)) &&
123		((n->out == 0) || (n->out == m->out)) &&
124		(n->flags == m->flags));
125}
126
127static void
128feeder_destroy(struct pcm_feeder *f)
129{
130	FEEDER_FREE(f);
131	kobj_delete((kobj_t)f, M_FEEDER);
132}
133
134static struct pcm_feeder *
135feeder_create(struct feeder_class *fc, struct pcm_feederdesc *desc)
136{
137	struct pcm_feeder *f;
138	int err;
139
140	f = (struct pcm_feeder *)kobj_create((kobj_class_t)fc, M_FEEDER, M_NOWAIT | M_ZERO);
141	if (f == NULL)
142		return NULL;
143
144	f->align = fc->align;
145	f->data = fc->data;
146	f->source = NULL;
147	f->parent = NULL;
148	f->class = fc;
149	f->desc = &(f->desc_static);
150
151	if (desc) {
152		*(f->desc) = *desc;
153	} else {
154		f->desc->type = FEEDER_ROOT;
155		f->desc->in = 0;
156		f->desc->out = 0;
157		f->desc->flags = 0;
158		f->desc->idx = 0;
159	}
160
161	err = FEEDER_INIT(f);
162	if (err) {
163		printf("feeder_init(%p) on %s returned %d\n", f, fc->name, err);
164		feeder_destroy(f);
165
166		return NULL;
167	}
168
169	return f;
170}
171
172struct feeder_class *
173feeder_getclass(struct pcm_feederdesc *desc)
174{
175	struct feedertab_entry *fte;
176
177	SLIST_FOREACH(fte, &feedertab, link) {
178		if ((desc == NULL) && (fte->desc == NULL))
179			return fte->feederclass;
180		if ((fte->desc != NULL) && (desc != NULL) && cmpdesc(desc, fte->desc))
181			return fte->feederclass;
182	}
183	return NULL;
184}
185
186int
187chn_addfeeder(struct pcm_channel *c, struct feeder_class *fc, struct pcm_feederdesc *desc)
188{
189	struct pcm_feeder *nf;
190
191	nf = feeder_create(fc, desc);
192	if (nf == NULL)
193		return ENOSPC;
194
195	nf->source = c->feeder;
196
197	/* XXX we should use the lowest common denominator for align */
198	if (nf->align > 0)
199		c->align += nf->align;
200	else if (nf->align < 0 && c->align < -nf->align)
201		c->align = -nf->align;
202	if (c->feeder != NULL)
203		c->feeder->parent = nf;
204	c->feeder = nf;
205
206	return 0;
207}
208
209int
210chn_removefeeder(struct pcm_channel *c)
211{
212	struct pcm_feeder *f;
213
214	if (c->feeder == NULL)
215		return -1;
216	f = c->feeder;
217	c->feeder = c->feeder->source;
218	feeder_destroy(f);
219
220	return 0;
221}
222
223struct pcm_feeder *
224chn_findfeeder(struct pcm_channel *c, u_int32_t type)
225{
226	struct pcm_feeder *f;
227
228	f = c->feeder;
229	while (f != NULL) {
230		if (f->desc->type == type)
231			return f;
232		f = f->source;
233	}
234
235	return NULL;
236}
237
238static int
239chainok(struct pcm_feeder *test, struct pcm_feeder *stop)
240{
241	u_int32_t visited[MAXFEEDERS / 32];
242	u_int32_t idx, mask;
243
244	bzero(visited, sizeof(visited));
245	while (test && (test != stop)) {
246		idx = test->desc->idx;
247		if (idx < 0)
248			panic("bad idx %d", idx);
249		if (idx >= MAXFEEDERS)
250			panic("bad idx %d", idx);
251		mask = 1 << (idx & 31);
252		idx >>= 5;
253		if (visited[idx] & mask)
254			return 0;
255		visited[idx] |= mask;
256		test = test->source;
257	}
258
259	return 1;
260}
261
262static struct pcm_feeder *
263feeder_fmtchain(u_int32_t *to, struct pcm_feeder *source, struct pcm_feeder *stop, int maxdepth)
264{
265	struct feedertab_entry *fte;
266	struct pcm_feeder *try, *ret;
267
268	/* printf("trying %s (%x -> %x)...\n", source->class->name, source->desc->in, source->desc->out); */
269	if (fmtvalid(source->desc->out, to)) {
270		/* printf("got it\n"); */
271		return source;
272	}
273
274	if (maxdepth < 0)
275		return NULL;
276
277	SLIST_FOREACH(fte, &feedertab, link) {
278		if (fte->desc == NULL)
279			continue;
280		if (fte->desc->type != FEEDER_FMT)
281			continue;
282		if (fte->desc->in == source->desc->out) {
283			try = feeder_create(fte->feederclass, fte->desc);
284			if (try) {
285				try->source = source;
286				ret = chainok(try, stop)? feeder_fmtchain(to, try, stop, maxdepth - 1) : NULL;
287				if (ret != NULL)
288					return ret;
289				feeder_destroy(try);
290			}
291		}
292	}
293	/* printf("giving up %s...\n", source->class->name); */
294
295	return NULL;
296}
297
298u_int32_t
299chn_fmtchain(struct pcm_channel *c, u_int32_t *to)
300{
301	struct pcm_feeder *try, *del, *stop;
302	u_int32_t tmpfrom[2], best, *from;
303	int i, max, bestmax;
304
305	KASSERT(c != NULL, ("c == NULL"));
306	KASSERT(c->feeder != NULL, ("c->feeder == NULL"));
307	KASSERT(to != NULL, ("to == NULL"));
308	KASSERT(to[0] != 0, ("to[0] == 0"));
309
310	stop = c->feeder;
311
312	if (c->direction == PCMDIR_REC && c->feeder->desc->type == FEEDER_ROOT) {
313		from = chn_getcaps(c)->fmtlist;
314	} else {
315		tmpfrom[0] = c->feeder->desc->out;
316		tmpfrom[1] = 0;
317		from = tmpfrom;
318	}
319
320	i = 0;
321	best = 0;
322	bestmax = 100;
323	while (from[i] != 0)
324		i++;
325	while (i > 0) {
326		i--;
327		c->feeder->desc->out = from[i];
328		try = NULL;
329		max = 0;
330		while (try == NULL && max < 8) {
331			try = feeder_fmtchain(to, c->feeder, stop, max);
332			if (try == NULL)
333				max++;
334		}
335		if (try != NULL && max < bestmax) {
336			bestmax = max;
337			best = from[i];
338		}
339		while (try != NULL && try != stop) {
340			del = try;
341			try = try->source;
342			feeder_destroy(del);
343		}
344	}
345	if (best == 0)
346		return 0;
347
348	c->feeder->desc->out = best;
349	try = feeder_fmtchain(to, c->feeder, stop, bestmax);
350	if (try == NULL)
351		return 0;
352
353	c->feeder = try;
354	c->align = 0;
355#ifdef FEEDER_DEBUG
356	printf("\n\nchain: ");
357#endif
358	while (try && (try != stop)) {
359#ifdef FEEDER_DEBUG
360		printf("%s [%d]", try->class->name, try->desc->idx);
361		if (try->source)
362			printf(" -> ");
363#endif
364		if (try->source)
365			try->source->parent = try;
366		if (try->align > 0)
367			c->align += try->align;
368		else if (try->align < 0 && c->align < -try->align)
369			c->align = -try->align;
370		try = try->source;
371	}
372#ifdef FEEDER_DEBUG
373	printf("%s [%d]\n", try->class->name, try->desc->idx);
374#endif
375
376	if (c->direction == PCMDIR_REC) {
377		try = c->feeder;
378		while (try != NULL) {
379			if (try->desc->type == FEEDER_ROOT)
380				return try->desc->out;
381			try = try->source;
382		}
383		return best;
384	} else
385		return c->feeder->desc->out;
386}
387
388void
389feeder_printchain(struct pcm_feeder *head)
390{
391	struct pcm_feeder *f;
392
393	printf("feeder chain (head @%p)\n", head);
394	f = head;
395	while (f != NULL) {
396		printf("%s/%d @ %p\n", f->class->name, f->desc->idx, f);
397		f = f->source;
398	}
399	printf("[end]\n\n");
400}
401
402/*****************************************************************************/
403
404static int
405feed_root(struct pcm_feeder *feeder, struct pcm_channel *ch, u_int8_t *buffer, u_int32_t count, void *source)
406{
407	struct snd_dbuf *src = source;
408	int l;
409	u_int8_t x;
410
411	KASSERT(count > 0, ("feed_root: count == 0"));
412	/* count &= ~((1 << ch->align) - 1); */
413	KASSERT(count > 0, ("feed_root: aligned count == 0 (align = %d)", ch->align));
414
415	l = min(count, sndbuf_getready(src));
416	sndbuf_dispose(src, buffer, l);
417
418	/* When recording only return as much data as available */
419	if (ch->direction == PCMDIR_REC)
420		return l;
421
422/*
423	if (l < count)
424		printf("appending %d bytes\n", count - l);
425*/
426
427	x = (sndbuf_getfmt(src) & AFMT_SIGNED)? 0 : 0x80;
428	while (l < count)
429		buffer[l++] = x;
430
431	return count;
432}
433
434static kobj_method_t feeder_root_methods[] = {
435    	KOBJMETHOD(feeder_feed,		feed_root),
436	{ 0, 0 }
437};
438static struct feeder_class feeder_root_class = {
439	.name =		"feeder_root",
440	.methods =	feeder_root_methods,
441	.size =		sizeof(struct pcm_feeder),
442	.align =	0,
443	.desc =		NULL,
444	.data =		NULL,
445};
446SYSINIT(feeder_root, SI_SUB_DRIVERS, SI_ORDER_FIRST, feeder_register, &feeder_root_class);
447SYSUNINIT(feeder_root, SI_SUB_DRIVERS, SI_ORDER_FIRST, feeder_unregisterall, NULL);
448
449
450
451
452
453