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
|
/**
* Copyright (c) 2002, 2005 Billy Biggs <vektor@dumbterm.net>.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110, USA.
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include <dlfcn.h>
#include <stdio.h>
#include <stdlib.h>
#define LOG_MODULE "deinterlace"
#define LOG_VERBOSE
/*
#define LOG
*/
#include "deinterlace.h"
#include "xine_internal.h"
typedef struct methodlist_item_s methodlist_item_t;
struct methodlist_item_s
{
deinterlace_method_t *method;
methodlist_item_t *next;
};
static methodlist_item_t *methodlist = 0;
void register_deinterlace_method( deinterlace_method_t *method )
{
methodlist_item_t **dest = &methodlist;
methodlist_item_t *cur = methodlist;
while( cur ) {
if( cur->method == method ) return;
dest = &(cur->next);
cur = cur->next;
}
*dest = malloc( sizeof( methodlist_item_t ) );
if( *dest ) {
(*dest)->method = method;
(*dest)->next = 0;
} else {
printf( "deinterlace: Can't allocate memory.\n" );
}
}
int get_num_deinterlace_methods( void )
{
methodlist_item_t *cur = methodlist;
int count = 0;
while( cur ) {
count++;
cur = cur->next;
}
return count;
}
deinterlace_method_t *get_deinterlace_method( int i )
{
methodlist_item_t *cur = methodlist;
if( !cur ) return 0;
while( i-- ) {
if( !cur->next ) return 0;
cur = cur->next;
}
return cur->method;
}
void filter_deinterlace_methods( int accel, int fields_available )
{
methodlist_item_t *prev = 0;
methodlist_item_t *cur = methodlist;
while( cur ) {
methodlist_item_t *next = cur->next;
int drop = 0;
if( (cur->method->accelrequired & accel) != cur->method->accelrequired ) {
/* This method is no good, drop it from the list. */
lprintf( "%s disabled: required CPU accelleration features unavailable.\n",
cur->method->short_name );
drop = 1;
}
if( cur->method->fields_required > fields_available ) {
/* This method is no good, drop it from the list. */
lprintf( "%s disabled: requires %d field buffers, only %d available.\n",
cur->method->short_name, cur->method->fields_required,
fields_available );
drop = 1;
}
if( drop ) {
if( prev ) {
prev->next = next;
} else {
methodlist = next;
}
free( cur );
} else {
prev = cur;
}
cur = next;
}
}
|
