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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
|
/*****************************************************************
* gmerlin - a general purpose multimedia framework and applications
*
* Copyright (c) 2001 - 2010 Members of the Gmerlin project
* gmerlin-general@lists.sourceforge.net
* http://gmerlin.sourceforge.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 of the License, 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, see <http://www.gnu.org/licenses/>.
* *****************************************************************/
#include <string.h>
#include <config.h>
#include <gmerlin/parameter.h>
#include <gmerlin/streaminfo.h>
#include <gmerlin/utils.h>
#include <gmerlin/translation.h>
bg_chapter_list_t * bg_chapter_list_create(int num_chapters)
{
bg_chapter_list_t * ret;
ret = calloc(1, sizeof(*ret));
if(num_chapters)
{
ret->chapters = calloc(num_chapters, sizeof(*(ret->chapters)));
ret->num_chapters = num_chapters;
}
return ret;
}
bg_chapter_list_t * bg_chapter_list_copy(const bg_chapter_list_t * list)
{
int i;
bg_chapter_list_t * ret;
if(!list || !list->num_chapters)
return (bg_chapter_list_t*)0;
ret = bg_chapter_list_create(list->num_chapters);
for(i = 0; i < ret->num_chapters; i++)
{
ret->chapters[i].time = list->chapters[i].time;
ret->chapters[i].name = bg_strdup(ret->chapters[i].name,
list->chapters[i].name);
}
ret->timescale = list->timescale;
return ret;
}
void bg_chapter_list_destroy(bg_chapter_list_t * list)
{
int i;
for(i = 0; i < list->num_chapters; i++)
{
if(list->chapters[i].name)
free(list->chapters[i].name);
}
free(list->chapters);
free(list);
}
void bg_chapter_list_insert(bg_chapter_list_t * list, int index,
int64_t time, const char * name)
{
int chapters_to_add;
/* Add a chapter behind the last one */
if(index >= list->num_chapters)
{
chapters_to_add = index + 1 - list->num_chapters;
list->chapters =
realloc(list->chapters,
(chapters_to_add + list->num_chapters)*sizeof(*list->chapters));
memset(list->chapters + list->num_chapters,
0, sizeof(*list->chapters) * chapters_to_add);
list->chapters[index].name = bg_strdup(list->chapters[index].name, name);
list->chapters[index].time = time;
list->num_chapters = index + 1;
}
else
{
list->chapters = realloc(list->chapters,
(list->num_chapters + 1)*
sizeof(*list->chapters));
memmove(list->chapters + index + 1, list->chapters + index,
(list->num_chapters - index) * sizeof(*list->chapters));
list->chapters[index].name = bg_strdup((char*)0, name);
list->chapters[index].time = time;
list->num_chapters++;
}
}
void bg_chapter_list_delete(bg_chapter_list_t * list, int index)
{
if((index < 0) || (index >= list->num_chapters))
return;
if(list->chapters[index].name)
free(list->chapters[index].name);
if(index < list->num_chapters-1)
{
memmove(list->chapters + index, list->chapters + index + 1,
sizeof(*list->chapters) * (list->num_chapters - index));
}
if(!index)
list->chapters[index].time = 0;
list->num_chapters--;
}
void bg_chapter_list_set_default_names(bg_chapter_list_t * list)
{
int i;
for(i = 0; i < list->num_chapters; i++)
{
if(!list->chapters[i].name)
list->chapters[i].name = bg_sprintf(TR("Chapter %d"), i+1);
}
}
int bg_chapter_list_get_current(bg_chapter_list_t * list,
gavl_time_t time)
{
int i;
int64_t time_scaled = gavl_time_scale(list->timescale, time);
for(i = 0; i < list->num_chapters-1; i++)
{
if(time_scaled < list->chapters[i+1].time)
return i;
}
return list->num_chapters-1;
}
int bg_chapter_list_changed(bg_chapter_list_t * list,
gavl_time_t time, int * current_chapter)
{
int ret = 0;
int64_t time_scaled = gavl_time_scale(list->timescale, time);
while(*current_chapter < list->num_chapters-1)
{
if(time_scaled >= list->chapters[(*current_chapter)+1].time)
{
(*current_chapter)++;
ret = 1;
}
else
break;
}
return ret;
}
|
