5 bt848/bt878/cx2388x risc code generator.
7 (c) 2000-03 Gerd Knorr <kraxel@bytesex.org> [SuSE Labs]
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 #include <linux/module.h>
26 #include <linux/init.h>
27 #include <linux/pci.h>
28 #include <linux/interrupt.h>
29 #include <linux/videodev2.h>
31 #include <asm/pgtable.h>
33 #include "btcx-risc.h"
35 static unsigned int btcx_debug;
36 module_param(btcx_debug, int, 0644);
37 MODULE_PARM_DESC(btcx_debug,"debug messages, default is 0 (no)");
39 /* ---------------------------------------------------------- */
40 /* allocate/free risc memory */
44 void btcx_riscmem_free(struct pci_dev *pci,
45 struct btcx_riscmem *risc)
47 if (NULL == risc->cpu)
51 printk("btcx: riscmem free [%d] dma=%lx\n",
52 memcnt, (unsigned long)risc->dma);
54 pci_free_consistent(pci, risc->size, risc->cpu, risc->dma);
55 memset(risc,0,sizeof(*risc));
58 int btcx_riscmem_alloc(struct pci_dev *pci,
59 struct btcx_riscmem *risc,
65 if (NULL != risc->cpu && risc->size < size)
66 btcx_riscmem_free(pci,risc);
67 if (NULL == risc->cpu) {
68 cpu = pci_alloc_consistent(pci, size, &dma);
76 printk("btcx: riscmem alloc [%d] dma=%lx cpu=%p size=%d\n",
77 memcnt, (unsigned long)dma, cpu, size);
80 memset(risc->cpu,0,risc->size);
84 /* ---------------------------------------------------------- */
85 /* screen overlay helpers */
88 btcx_screen_clips(int swidth, int sheight, struct v4l2_rect *win,
89 struct v4l2_clip *clips, unsigned int n)
95 clips[n].c.width = -win->left;
96 clips[n].c.height = win->height;
99 if (win->left + win->width > swidth) {
101 clips[n].c.left = swidth - win->left;
103 clips[n].c.width = win->width - clips[n].c.left;
104 clips[n].c.height = win->height;
111 clips[n].c.width = win->width;
112 clips[n].c.height = -win->top;
115 if (win->top + win->height > sheight) {
118 clips[n].c.top = sheight - win->top;
119 clips[n].c.width = win->width;
120 clips[n].c.height = win->height - clips[n].c.top;
127 btcx_align(struct v4l2_rect *win, struct v4l2_clip *clips, unsigned int n, int mask)
133 nx = (win->left + mask) & ~mask;
134 nw = (win->width) & ~mask;
135 if (nx + nw > win->left + win->width)
141 printk(KERN_DEBUG "btcx: window align %dx%d+%d+%d [dx=%d]\n",
142 win->width, win->height, win->left, win->top, dx);
145 for (i = 0; i < n; i++) {
146 nx = (clips[i].c.left-dx) & ~mask;
147 nw = (clips[i].c.width) & ~mask;
148 if (nx + nw < clips[i].c.left-dx + clips[i].c.width)
150 clips[i].c.left = nx;
151 clips[i].c.width = nw;
153 printk(KERN_DEBUG "btcx: clip align %dx%d+%d+%d\n",
154 clips[i].c.width, clips[i].c.height,
155 clips[i].c.left, clips[i].c.top);
161 btcx_sort_clips(struct v4l2_clip *clips, unsigned int nclips)
163 struct v4l2_clip swap;
168 for (i = nclips-2; i >= 0; i--) {
169 for (n = 0, j = 0; j <= i; j++) {
170 if (clips[j].c.left > clips[j+1].c.left) {
172 clips[j] = clips[j+1];
183 btcx_calc_skips(int line, int width, int *maxy,
184 struct btcx_skiplist *skips, unsigned int *nskips,
185 const struct v4l2_clip *clips, unsigned int nclips)
187 unsigned int clip,skip;
192 for (clip = 0; clip < nclips; clip++) {
195 if (clips[clip].c.left + clips[clip].c.width <= 0)
197 if (clips[clip].c.left > (signed)width)
201 if (line > clips[clip].c.top+clips[clip].c.height-1)
203 if (line < clips[clip].c.top) {
204 if (maxline > clips[clip].c.top-1)
205 maxline = clips[clip].c.top-1;
208 if (maxline > clips[clip].c.top+clips[clip].c.height-1)
209 maxline = clips[clip].c.top+clips[clip].c.height-1;
211 /* horizontal range */
212 if (0 == skip || clips[clip].c.left > skips[skip-1].end) {
214 skips[skip].start = clips[clip].c.left;
215 if (skips[skip].start < 0)
216 skips[skip].start = 0;
217 skips[skip].end = clips[clip].c.left + clips[clip].c.width;
218 if (skips[skip].end > width)
219 skips[skip].end = width;
222 /* overlaps -- expand last one */
223 end = clips[clip].c.left + clips[clip].c.width;
224 if (skips[skip-1].end < end)
225 skips[skip-1].end = end;
226 if (skips[skip-1].end > width)
227 skips[skip-1].end = width;
234 printk(KERN_DEBUG "btcx: skips line %d-%d:",line,maxline);
235 for (skip = 0; skip < *nskips; skip++) {
236 printk(" %d-%d",skips[skip].start,skips[skip].end);