diff options
Diffstat (limited to 'drivers/media/video/bt8xx/bttv-driver.c')
| -rw-r--r-- | drivers/media/video/bt8xx/bttv-driver.c | 33 |
1 files changed, 28 insertions, 5 deletions
diff --git a/drivers/media/video/bt8xx/bttv-driver.c b/drivers/media/video/bt8xx/bttv-driver.c index 939d1e512974..a6724019c66f 100644 --- a/drivers/media/video/bt8xx/bttv-driver.c +++ b/drivers/media/video/bt8xx/bttv-driver.c | |||
| @@ -1299,7 +1299,7 @@ set_tvnorm(struct bttv *btv, unsigned int norm) | |||
| 1299 | 1299 | ||
| 1300 | tvnorm = &bttv_tvnorms[norm]; | 1300 | tvnorm = &bttv_tvnorms[norm]; |
| 1301 | 1301 | ||
| 1302 | if (!memcmp(&bttv_tvnorms[btv->tvnorm].cropcap, &tvnorm->cropcap, | 1302 | if (memcmp(&bttv_tvnorms[btv->tvnorm].cropcap, &tvnorm->cropcap, |
| 1303 | sizeof (tvnorm->cropcap))) { | 1303 | sizeof (tvnorm->cropcap))) { |
| 1304 | bttv_crop_reset(&btv->crop[0], norm); | 1304 | bttv_crop_reset(&btv->crop[0], norm); |
| 1305 | btv->crop[1] = btv->crop[0]; /* current = default */ | 1305 | btv->crop[1] = btv->crop[0]; /* current = default */ |
| @@ -3800,11 +3800,34 @@ bttv_irq_next_video(struct bttv *btv, struct bttv_buffer_set *set) | |||
| 3800 | if (!V4L2_FIELD_HAS_BOTH(item->vb.field) && | 3800 | if (!V4L2_FIELD_HAS_BOTH(item->vb.field) && |
| 3801 | (item->vb.queue.next != &btv->capture)) { | 3801 | (item->vb.queue.next != &btv->capture)) { |
| 3802 | item = list_entry(item->vb.queue.next, struct bttv_buffer, vb.queue); | 3802 | item = list_entry(item->vb.queue.next, struct bttv_buffer, vb.queue); |
| 3803 | /* Mike Isely <isely@pobox.com> - Only check | ||
| 3804 | * and set up the bottom field in the logic | ||
| 3805 | * below. Don't ever do the top field. This | ||
| 3806 | * of course means that if we set up the | ||
| 3807 | * bottom field in the above code that we'll | ||
| 3808 | * actually skip a field. But that's OK. | ||
| 3809 | * Having processed only a single buffer this | ||
| 3810 | * time, then the next time around the first | ||
| 3811 | * available buffer should be for a top field. | ||
| 3812 | * That will then cause us here to set up a | ||
| 3813 | * top then a bottom field in the normal way. | ||
| 3814 | * The alternative to this understanding is | ||
| 3815 | * that we set up the second available buffer | ||
| 3816 | * as a top field, but that's out of order | ||
| 3817 | * since this driver always processes the top | ||
| 3818 | * field first - the effect will be the two | ||
| 3819 | * buffers being returned in the wrong order, | ||
| 3820 | * with the second buffer also being delayed | ||
| 3821 | * by one field time (owing to the fifo nature | ||
| 3822 | * of videobuf). Worse still, we'll be stuck | ||
| 3823 | * doing fields out of order now every time | ||
| 3824 | * until something else causes a field to be | ||
| 3825 | * dropped. By effectively forcing a field to | ||
| 3826 | * drop this way then we always get back into | ||
| 3827 | * sync within a single frame time. (Out of | ||
| 3828 | * order fields can screw up deinterlacing | ||
| 3829 | * algorithms.) */ | ||
| 3803 | if (!V4L2_FIELD_HAS_BOTH(item->vb.field)) { | 3830 | if (!V4L2_FIELD_HAS_BOTH(item->vb.field)) { |
| 3804 | if (NULL == set->top && | ||
| 3805 | V4L2_FIELD_TOP == item->vb.field) { | ||
| 3806 | set->top = item; | ||
| 3807 | } | ||
| 3808 | if (NULL == set->bottom && | 3831 | if (NULL == set->bottom && |
| 3809 | V4L2_FIELD_BOTTOM == item->vb.field) { | 3832 | V4L2_FIELD_BOTTOM == item->vb.field) { |
| 3810 | set->bottom = item; | 3833 | set->bottom = item; |
