1193640Sariff#!/usr/bin/awk -f
2193640Sariff#
3193640Sariff# Copyright (c) 2008-2009 Ariff Abdullah <ariff@FreeBSD.org>
4193640Sariff# All rights reserved.
5193640Sariff#
6193640Sariff# Redistribution and use in source and binary forms, with or without
7193640Sariff# modification, are permitted provided that the following conditions
8193640Sariff# are met:
9193640Sariff# 1. Redistributions of source code must retain the above copyright
10193640Sariff#    notice, this list of conditions and the following disclaimer.
11193640Sariff# 2. Redistributions in binary form must reproduce the above copyright
12193640Sariff#    notice, this list of conditions and the following disclaimer in the
13193640Sariff#    documentation and/or other materials provided with the distribution.
14193640Sariff#
15193640Sariff# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16193640Sariff# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17193640Sariff# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18193640Sariff# ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19193640Sariff# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20193640Sariff# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21193640Sariff# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22193640Sariff# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23193640Sariff# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24193640Sariff# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25193640Sariff# SUCH DAMAGE.
26193640Sariff#
27193640Sariff# $FreeBSD$
28193640Sariff#
29193640Sariff
30193640Sarifffunction floor(x, r)
31193640Sariff{
32193640Sariff	r = int(x);
33193640Sariff	if (r > x)
34193640Sariff		r--;
35193640Sariff	return (r + 0);
36193640Sariff}
37193640Sariff
38193640Sarifffunction shl(x, y)
39193640Sariff{
40193640Sariff	while (y > 0) {
41193640Sariff		x *= 2;
42193640Sariff		y--;
43193640Sariff	}
44193640Sariff	return (x);
45193640Sariff}
46193640Sariff
47193640Sarifffunction shr(x, y)
48193640Sariff{
49193640Sariff	while (y > 0 && x != 0) {
50193640Sariff		x = floor(x / 2);
51193640Sariff		y--;
52193640Sariff	}
53193640Sariff	return (x);
54193640Sariff}
55193640Sariff
56193640Sarifffunction calcdiv(r, x, y, z)
57193640Sariff{
58193640Sariff	y = floor(FXONE / x);
59193640Sariff	z = FXSHIFT;
60193640Sariff
61193640Sariff	while (shr((y * x), z) < 1)
62193640Sariff		y++;
63193640Sariff
64193640Sariff	while ((y % 2) == 0 && z > 0) {
65193640Sariff		y = floor(y / 2);
66193640Sariff		z--;
67193640Sariff	}
68193640Sariff
69193640Sariff	r["mul"] = y;
70193640Sariff	r["shift"] = z;
71193640Sariff}
72193640Sariff
73193640SariffBEGIN {
74193640Sariff	FXSHIFT = 16;
75193640Sariff	FXONE   = shl(1, FXSHIFT);
76193640Sariff
77193640Sariff	SND_CHN_MAX = 18;
78193640Sariff
79193640Sariff	PCM_8_BPS  = 1;
80193640Sariff	PCM_16_BPS = 2;
81193640Sariff	PCM_24_BPS = 3;
82193640Sariff	PCM_32_BPS = 4;
83193640Sariff
84193640Sariff	SND_MAX_ALIGN = SND_CHN_MAX * PCM_32_BPS;
85193640Sariff
86193640Sariff	for (i = 1; i <= SND_CHN_MAX; i++) {
87193640Sariff		aligns[PCM_8_BPS * i]  = 1;
88193640Sariff		aligns[PCM_16_BPS * i] = 1;
89193640Sariff		aligns[PCM_24_BPS * i] = 1;
90193640Sariff		aligns[PCM_32_BPS * i] = 1;
91193640Sariff	}
92193640Sariff
93193640Sariff	printf("#ifndef _SND_FXDIV_GEN_H_\n");
94193640Sariff	printf("#define _SND_FXDIV_GEN_H_\n\n");
95193640Sariff
96193640Sariff	printf("/*\n");
97193640Sariff	printf(" * Generated using snd_fxdiv_gen.awk, heaven, wind and awesome.\n");
98193640Sariff	printf(" *\n");
99193640Sariff	printf(" * DO NOT EDIT!\n");
100193640Sariff	printf(" */\n\n");
101193640Sariff	printf("#ifdef SND_USE_FXDIV\n\n");
102193640Sariff
103193640Sariff	printf("/*\n");
104193640Sariff	printf(" * Fast unsigned 32bit integer division and rounding, accurate for\n");
105193640Sariff	printf(" * x = 1 - %d. This table should be enough to handle possible\n", FXONE);
106193640Sariff	printf(" * division for 1 - 72 (more can be generated though..).\n");
107193640Sariff	printf(" *\n");
108193640Sariff	printf(" * 72 = SND_CHN_MAX * PCM_32_BPS, which is why....\n");
109193640Sariff	printf(" */\n\n");
110193640Sariff
111193640Sariff	printf("static const uint32_t snd_fxdiv_table[][2] = {\n");
112193640Sariff
113193640Sariff	for (i = 1; i <= SND_MAX_ALIGN; i++) {
114193640Sariff		if (aligns[i] != 1)
115193640Sariff			continue;
116193640Sariff		calcdiv(r, i);
117193640Sariff		printf("\t[0x%02x] = { 0x%04x, 0x%02x },",		\
118193640Sariff		    i, r["mul"], r["shift"]);
119193640Sariff		printf("\t/* x / %-2d = (x * %-5d) >> %-2d */\n",	\
120193640Sariff		    i, r["mul"], r["shift"]);
121193640Sariff	}
122193640Sariff
123193640Sariff	printf("};\n\n");
124193640Sariff
125193640Sariff	printf("#define SND_FXDIV_MAX\t\t0x%08x\n", FXONE);
126193640Sariff	printf("#define SND_FXDIV(x, y)\t\t(((uint32_t)(x) *\t\t\t\\\n");
127193640Sariff	printf("\t\t\t\t    snd_fxdiv_table[y][0]) >>\t\t\\\n");
128193640Sariff	printf("\t\t\t\t    snd_fxdiv_table[y][1])\n");
129193640Sariff	printf("#define SND_FXROUND(x, y)\t(SND_FXDIV(x, y) * (y))\n");
130193640Sariff	printf("#define SND_FXMOD(x, y)\t\t((x) - SND_FXROUND(x, y))\n\n");
131193640Sariff
132193640Sariff	printf("#else\t/* !SND_USE_FXDIV */\n\n");
133193640Sariff
134193640Sariff	printf("#define SND_FXDIV_MAX\t\t0x%08x\n", 131072);
135193640Sariff	printf("#define SND_FXDIV(x, y)\t\t((x) / (y))\n");
136193640Sariff	printf("#define SND_FXROUND(x, y)\t((x) - ((x) %% (y)))\n");
137193640Sariff	printf("#define SND_FXMOD(x, y)\t\t((x) %% (y))\n\n");
138193640Sariff
139193640Sariff	printf("#endif\t/* SND_USE_FXDIV */\n\n");
140193640Sariff
141193640Sariff	printf("#endif\t/* !_SND_FXDIV_GEN_H_ */\n");
142193640Sariff}
143