1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
1 |
/// \file
|
1.1.2
by Reinhard Tartler
Import upstream version 0.99+1.0pre8 |
2 |
/// \ingroup Playtree
|
3 |
||
4 |
#include "config.h" |
|
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
5 |
#include <stdlib.h> |
6 |
#include <string.h> |
|
7 |
#include <stdio.h> |
|
8 |
#include <unistd.h> |
|
9 |
#include <errno.h> |
|
10 |
#ifdef MP_DEBUG
|
|
11 |
#include <assert.h> |
|
12 |
#endif
|
|
13 |
#include "m_config.h" |
|
14 |
#include "playtree.h" |
|
15 |
#include "mp_msg.h" |
|
16 |
||
17 |
static int |
|
18 |
play_tree_is_valid(play_tree_t* pt); |
|
19 |
||
20 |
play_tree_t* |
|
21 |
play_tree_new(void) { |
|
22 |
play_tree_t* r = calloc(1,sizeof(play_tree_t)); |
|
1.1.3
by William Grant
Import upstream version 1.0~rc1 |
23 |
if(r == NULL) { |
0.2.1
by Reinhard Tartler
Import upstream version 1.0~rc2+svn20090303 |
24 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",(int)sizeof(play_tree_t)); |
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
25 |
return NULL; |
0.2.1
by Reinhard Tartler
Import upstream version 1.0~rc2+svn20090303 |
26 |
}
|
27 |
r->entry_type = PLAY_TREE_ENTRY_NODE; |
|
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
28 |
return r; |
29 |
}
|
|
30 |
||
31 |
void
|
|
32 |
play_tree_free(play_tree_t* pt, int children) { |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
33 |
play_tree_t* iter; |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
34 |
|
35 |
#ifdef MP_DEBUG
|
|
36 |
assert(pt != NULL); |
|
37 |
#endif
|
|
38 |
||
39 |
if(children) { |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
40 |
for(iter = pt->child; iter != NULL; ) { |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
41 |
play_tree_t* nxt=iter->next; |
42 |
play_tree_free(iter,1); |
|
43 |
iter = nxt; |
|
44 |
}
|
|
45 |
pt->child = NULL; |
|
46 |
}
|
|
47 |
||
48 |
play_tree_remove(pt,0,0); |
|
49 |
||
50 |
for(iter = pt->child ; iter != NULL ; iter = iter->next) |
|
51 |
iter->parent = NULL; |
|
52 |
||
53 |
//if(pt->params) free(pt->params);
|
|
54 |
if(pt->files) { |
|
55 |
int i; |
|
56 |
for(i = 0 ; pt->files[i] != NULL ; i++) |
|
57 |
free(pt->files[i]); |
|
58 |
free(pt->files); |
|
59 |
}
|
|
60 |
||
61 |
free(pt); |
|
62 |
}
|
|
63 |
||
64 |
void
|
|
65 |
play_tree_free_list(play_tree_t* pt, int children) { |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
66 |
play_tree_t* iter; |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
67 |
|
68 |
#ifdef MP_DEBUG
|
|
69 |
assert(pt != NULL); |
|
70 |
#endif
|
|
71 |
||
72 |
for(iter = pt ; iter->prev != NULL ; iter = iter->prev) |
|
73 |
/* NOTHING */; |
|
74 |
||
75 |
while(iter) { |
|
76 |
play_tree_t* nxt = iter->next; |
|
77 |
play_tree_free(iter, children); |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
78 |
iter = nxt; |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
79 |
}
|
80 |
||
81 |
||
82 |
}
|
|
83 |
||
84 |
void
|
|
85 |
play_tree_append_entry(play_tree_t* pt, play_tree_t* entry) { |
|
86 |
play_tree_t* iter; |
|
87 |
||
88 |
#ifdef MP_DEBUG
|
|
89 |
assert(pt != NULL); |
|
90 |
assert(entry != NULL); |
|
91 |
#endif
|
|
92 |
||
93 |
if(pt == entry) |
|
94 |
return; |
|
95 |
||
96 |
for(iter = pt ; iter->next != NULL ; iter = iter->next) |
|
97 |
/* NOTHING */; |
|
98 |
||
99 |
entry->parent = iter->parent; |
|
100 |
entry->prev = iter; |
|
101 |
entry->next = NULL; |
|
102 |
iter->next = entry; |
|
103 |
}
|
|
104 |
||
105 |
void
|
|
106 |
play_tree_prepend_entry(play_tree_t* pt, play_tree_t* entry) { |
|
107 |
play_tree_t* iter; |
|
108 |
||
109 |
#ifdef MP_DEBUG
|
|
110 |
assert(pt != NULL); |
|
111 |
assert(entry != NULL); |
|
112 |
#endif
|
|
113 |
||
114 |
for(iter = pt ; iter->prev != NULL; iter = iter->prev) |
|
115 |
/* NOTHING */; |
|
116 |
||
117 |
entry->prev = NULL; |
|
118 |
entry->next = iter; |
|
119 |
entry->parent = iter->parent; |
|
120 |
||
121 |
iter->prev = entry; |
|
122 |
if(entry->parent) { |
|
123 |
#ifdef MP_DEBUG
|
|
124 |
assert(entry->parent->child == iter); |
|
125 |
#endif
|
|
126 |
entry->parent->child = entry; |
|
127 |
}
|
|
128 |
}
|
|
129 |
||
130 |
void
|
|
131 |
play_tree_insert_entry(play_tree_t* pt, play_tree_t* entry) { |
|
132 |
||
133 |
#ifdef MP_DEBUG
|
|
134 |
assert(pt != NULL); |
|
135 |
assert(entry != NULL); |
|
136 |
#endif
|
|
137 |
||
138 |
entry->parent = pt->parent; |
|
139 |
entry->prev = pt; |
|
140 |
if(pt->next) { |
|
141 |
#ifdef MP_DEBUG
|
|
142 |
assert(pt->next->prev == pt); |
|
143 |
#endif
|
|
144 |
entry->next = pt->next; |
|
145 |
entry->next->prev = entry; |
|
146 |
} else |
|
147 |
entry->next = NULL; |
|
148 |
pt->next = entry; |
|
149 |
||
150 |
}
|
|
151 |
||
152 |
void
|
|
153 |
play_tree_remove(play_tree_t* pt, int free_it, int with_children) { |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
154 |
|
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
155 |
#ifdef MP_DEBUG
|
156 |
assert(pt != NULL); |
|
157 |
#endif
|
|
158 |
||
159 |
// Middle of list
|
|
160 |
if(pt->prev && pt->next) { |
|
161 |
#ifdef MP_DEBUG
|
|
162 |
assert(pt->prev->next == pt); |
|
163 |
assert(pt->next->prev == pt); |
|
164 |
#endif
|
|
165 |
pt->prev->next = pt->next; |
|
166 |
pt->next->prev = pt->prev; |
|
167 |
} // End of list |
|
168 |
else if(pt->prev) { |
|
169 |
#ifdef MP_DEBUG
|
|
170 |
assert(pt->prev->next == pt); |
|
171 |
#endif
|
|
172 |
pt->prev->next = NULL; |
|
173 |
} // Beginning of list |
|
0.2.1
by Reinhard Tartler
Import upstream version 1.0~rc2+svn20090303 |
174 |
else if(pt->next) { |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
175 |
#ifdef MP_DEBUG
|
176 |
assert(pt->next->prev == pt); |
|
177 |
#endif
|
|
178 |
pt->next->prev = NULL; |
|
179 |
if(pt->parent) { |
|
180 |
#ifdef MP_DEBUG
|
|
181 |
assert(pt->parent->child == pt); |
|
182 |
#endif
|
|
183 |
pt->parent->child = pt->next; |
|
184 |
}
|
|
185 |
} // The only one |
|
186 |
else if(pt->parent) { |
|
187 |
#ifdef MP_DEBUG
|
|
188 |
assert(pt->parent->child == pt); |
|
189 |
#endif
|
|
190 |
pt->parent->child = NULL; |
|
191 |
}
|
|
192 |
||
193 |
pt->prev = pt->next = pt->parent = NULL; |
|
194 |
if(free_it) |
|
195 |
play_tree_free(pt,with_children); |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
196 |
|
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
197 |
}
|
198 |
||
199 |
void
|
|
200 |
play_tree_set_child(play_tree_t* pt, play_tree_t* child) { |
|
201 |
play_tree_t* iter; |
|
202 |
||
203 |
#ifdef MP_DEBUG
|
|
204 |
assert(pt != NULL); |
|
205 |
assert(pt->entry_type == PLAY_TREE_ENTRY_NODE); |
|
206 |
#endif
|
|
207 |
||
208 |
//DEBUG_FF: Where are the children freed?
|
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
209 |
// Attention in using this function!
|
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
210 |
for(iter = pt->child ; iter != NULL ; iter = iter->next) |
211 |
iter->parent = NULL; |
|
212 |
||
213 |
// Go back to first one
|
|
214 |
for(iter = child ; iter->prev != NULL ; iter = iter->prev) |
|
215 |
/* NOTHING */; |
|
216 |
||
217 |
pt->child = iter; |
|
218 |
||
219 |
for( ; iter != NULL ; iter= iter->next) |
|
220 |
iter->parent = pt; |
|
221 |
||
222 |
}
|
|
223 |
||
224 |
void
|
|
225 |
play_tree_set_parent(play_tree_t* pt, play_tree_t* parent) { |
|
226 |
play_tree_t* iter; |
|
227 |
||
228 |
#ifdef MP_DEBUG
|
|
229 |
assert(pt != NULL); |
|
230 |
#endif
|
|
231 |
||
232 |
if(pt->parent) |
|
233 |
pt->parent->child = NULL; |
|
234 |
||
235 |
for(iter = pt ; iter != NULL ; iter = iter->next) |
|
236 |
iter->parent = parent; |
|
237 |
||
238 |
if(pt->prev) { |
|
239 |
for(iter = pt->prev ; iter->prev != NULL ; iter = iter->prev) |
|
240 |
iter->parent = parent; |
|
241 |
iter->parent = parent; |
|
242 |
parent->child = iter; |
|
243 |
} else |
|
244 |
parent->child = pt; |
|
245 |
||
246 |
}
|
|
247 |
||
248 |
||
249 |
void
|
|
250 |
play_tree_add_file(play_tree_t* pt,char* file) { |
|
251 |
int n = 0; |
|
252 |
char* e; |
|
253 |
||
254 |
#ifdef MP_DEBUG
|
|
255 |
assert(pt != NULL); |
|
256 |
assert(pt->child == NULL); |
|
257 |
assert(file != NULL); |
|
258 |
#endif
|
|
259 |
||
260 |
if(pt->entry_type != PLAY_TREE_ENTRY_NODE && |
|
261 |
pt->entry_type != PLAY_TREE_ENTRY_FILE) |
|
262 |
return; |
|
263 |
||
264 |
if(pt->files) { |
|
265 |
for(n = 0 ; pt->files[n] != NULL ; n++) |
|
266 |
/* NOTHING */; |
|
267 |
}
|
|
268 |
pt->files = (char**)realloc(pt->files,(n+2)*sizeof(char*)); |
|
269 |
if(pt->files ==NULL) { |
|
270 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",(n+2)*(int)sizeof(char*)); |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
271 |
return; |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
272 |
}
|
273 |
||
274 |
e = pt->files[n] = strdup(file); |
|
275 |
pt->files[n+1] = NULL; |
|
276 |
||
277 |
pt->entry_type = PLAY_TREE_ENTRY_FILE; |
|
278 |
||
279 |
}
|
|
280 |
||
281 |
int
|
|
282 |
play_tree_remove_file(play_tree_t* pt,char* file) { |
|
283 |
int n,f = -1; |
|
284 |
||
285 |
#ifdef MP_DEBUG
|
|
286 |
assert(pt != NULL); |
|
287 |
assert(file != NULL); |
|
288 |
assert(pt->entry_type != PLAY_TREE_ENTRY_NODE); |
|
289 |
#endif
|
|
290 |
||
291 |
for(n=0 ; pt->files[n] != NULL ; n++) { |
|
292 |
if(strcmp(file,pt->files[n]) == 0) |
|
293 |
f = n; |
|
294 |
}
|
|
295 |
||
296 |
if(f < 0) // Not found |
|
297 |
return 0; |
|
298 |
||
299 |
#ifdef MP_DEBUG
|
|
300 |
assert(n > f); |
|
301 |
#endif
|
|
302 |
||
303 |
free(pt->files[f]); |
|
304 |
||
305 |
if(n > 1) { |
|
306 |
memmove(&pt->files[f],&pt->files[f+1],(n-f)*sizeof(char*)); |
|
307 |
pt->files = (char**)realloc(pt->files,n*sizeof(char*)); |
|
308 |
if(pt->files == NULL) { |
|
309 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",(n+2)*(int)sizeof(char*)); |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
310 |
return -1; |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
311 |
}
|
312 |
} else { |
|
313 |
free(pt->files); |
|
314 |
pt->files = NULL; |
|
315 |
}
|
|
316 |
||
317 |
return 1; |
|
318 |
}
|
|
319 |
||
320 |
void
|
|
321 |
play_tree_set_param(play_tree_t* pt, char* name, char* val) { |
|
322 |
int n = 0,ni = -1; |
|
323 |
||
324 |
#ifdef MP_DEBUG
|
|
325 |
assert(pt != NULL); |
|
326 |
assert(name != NULL); |
|
327 |
#endif
|
|
328 |
||
329 |
if(pt->params) { |
|
330 |
for( ; pt->params[n].name != NULL ; n++) { |
|
331 |
if(strcasecmp(pt->params[n].name,name) == 0) |
|
332 |
ni = n; |
|
333 |
}
|
|
334 |
}
|
|
335 |
||
336 |
if(ni > 0) { |
|
337 |
if(pt->params[n].value != NULL) free(pt->params[n].value); |
|
338 |
pt->params[n].value = val != NULL ? strdup(val) : NULL; |
|
339 |
return; |
|
340 |
}
|
|
341 |
||
342 |
pt->params = (play_tree_param_t*)realloc(pt->params,(n+2)*sizeof(play_tree_param_t)); |
|
343 |
if(pt->params == NULL) { |
|
344 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't realloc params (%d bytes of memory)\n",(n+2)*(int)sizeof(play_tree_param_t)); |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
345 |
return; |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
346 |
}
|
347 |
pt->params[n].name = strdup(name); |
|
348 |
pt->params[n].value = val != NULL ? strdup(val) : NULL; |
|
349 |
memset(&pt->params[n+1],0,sizeof(play_tree_param_t)); |
|
350 |
||
351 |
return; |
|
352 |
}
|
|
353 |
||
354 |
int
|
|
355 |
play_tree_unset_param(play_tree_t* pt, char* name) { |
|
356 |
int n,ni = -1; |
|
357 |
||
358 |
#ifdef MP_DEBUG
|
|
359 |
assert(pt != NULL); |
|
360 |
assert(name != NULL); |
|
361 |
assert(pt->params != NULL); |
|
362 |
#endif
|
|
363 |
||
364 |
for(n = 0 ; pt->params[n].name != NULL ; n++) { |
|
365 |
if(strcasecmp(pt->params[n].name,name) == 0) |
|
366 |
ni = n; |
|
367 |
}
|
|
368 |
||
369 |
if(ni < 0) |
|
370 |
return 0; |
|
371 |
||
372 |
if(pt->params[ni].name) free(pt->params[ni].name); |
|
373 |
if(pt->params[ni].value) free(pt->params[ni].value); |
|
374 |
||
375 |
if(n > 1) { |
|
376 |
memmove(&pt->params[ni],&pt->params[ni+1],(n-ni)*sizeof(play_tree_param_t)); |
|
377 |
pt->params = (play_tree_param_t*)realloc(pt->params,n*sizeof(play_tree_param_t)); |
|
378 |
if(pt->params == NULL) { |
|
379 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",n*(int)sizeof(play_tree_param_t)); |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
380 |
return -1; |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
381 |
}
|
382 |
} else { |
|
383 |
free(pt->params); |
|
384 |
pt->params = NULL; |
|
385 |
}
|
|
386 |
||
387 |
return 1; |
|
388 |
}
|
|
389 |
||
390 |
void
|
|
391 |
play_tree_set_params_from(play_tree_t* dest,play_tree_t* src) { |
|
392 |
int i; |
|
393 |
||
394 |
#ifdef MP_DEBUG
|
|
395 |
assert(dest != NULL); |
|
396 |
assert(src != NULL); |
|
397 |
#endif
|
|
398 |
||
399 |
if(!src->params) |
|
400 |
return; |
|
401 |
||
402 |
for(i = 0; src->params[i].name != NULL ; i++) |
|
403 |
play_tree_set_param(dest,src->params[i].name,src->params[i].value); |
|
404 |
if(src->flags & PLAY_TREE_RND) // pass the random flag too |
|
405 |
dest->flags |= PLAY_TREE_RND; |
|
406 |
||
407 |
}
|
|
408 |
||
409 |
// all children if deep < 0
|
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
410 |
void
|
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
411 |
play_tree_set_flag(play_tree_t* pt, int flags , int deep) { |
412 |
play_tree_t* i; |
|
413 |
||
414 |
pt->flags |= flags; |
|
415 |
||
416 |
if(deep && pt->child) { |
|
417 |
if(deep > 0) deep--; |
|
418 |
for(i = pt->child ; i ; i = i->next) |
|
419 |
play_tree_set_flag(i,flags,deep); |
|
420 |
}
|
|
421 |
}
|
|
422 |
||
423 |
void
|
|
424 |
play_tree_unset_flag(play_tree_t* pt, int flags , int deep) { |
|
425 |
play_tree_t* i; |
|
426 |
||
427 |
pt->flags &= ~flags; |
|
428 |
||
429 |
if(deep && pt->child) { |
|
430 |
if(deep > 0) deep--; |
|
431 |
for(i = pt->child ; i ; i = i->next) |
|
432 |
play_tree_unset_flag(i,flags,deep); |
|
433 |
}
|
|
434 |
}
|
|
435 |
||
436 |
||
437 |
//////////////////////////////////// ITERATOR //////////////////////////////////////
|
|
438 |
||
439 |
static void |
|
440 |
play_tree_iter_push_params(play_tree_iter_t* iter) { |
|
441 |
int n; |
|
442 |
play_tree_t* pt; |
|
443 |
#ifdef MP_DEBUG
|
|
444 |
assert(iter != NULL); |
|
445 |
assert(iter->config != NULL); |
|
446 |
assert(iter->tree != NULL); |
|
447 |
#endif
|
|
448 |
||
449 |
pt = iter->tree; |
|
450 |
||
451 |
// We always push a config because we can set some option
|
|
452 |
// while playing
|
|
453 |
m_config_push(iter->config); |
|
454 |
||
455 |
if(pt->params == NULL) |
|
456 |
return; |
|
457 |
||
458 |
||
459 |
for(n = 0; pt->params[n].name != NULL ; n++) { |
|
460 |
int e; |
|
461 |
if((e = m_config_set_option(iter->config,pt->params[n].name,pt->params[n].value)) < 0) { |
|
462 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Error %d while setting option '%s' with value '%s'\n",e, |
|
463 |
pt->params[n].name,pt->params[n].value); |
|
464 |
}
|
|
465 |
}
|
|
466 |
||
467 |
if(!pt->child) |
|
468 |
iter->entry_pushed = 1; |
|
469 |
return; |
|
470 |
}
|
|
471 |
||
472 |
play_tree_iter_t* |
|
473 |
play_tree_iter_new(play_tree_t* pt,m_config_t* config) { |
|
474 |
play_tree_iter_t* iter; |
|
475 |
||
476 |
#ifdef MP_DEBUG
|
|
477 |
assert(pt != NULL); |
|
478 |
assert(config != NULL); |
|
479 |
#endif
|
|
480 |
||
481 |
if( ! play_tree_is_valid(pt)) |
|
482 |
return NULL; |
|
483 |
||
484 |
iter = calloc(1,sizeof(play_tree_iter_t)); |
|
1.1.3
by William Grant
Import upstream version 1.0~rc1 |
485 |
if(! iter) { |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
486 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate new iterator (%d bytes of memory)\n",(int)sizeof(play_tree_iter_t)); |
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
487 |
return NULL; |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
488 |
}
|
489 |
iter->root = pt; |
|
490 |
iter->tree = NULL; |
|
491 |
iter->config = config; |
|
492 |
||
493 |
if(pt->parent) |
|
494 |
iter->loop = pt->parent->loop; |
|
495 |
||
496 |
return iter; |
|
497 |
}
|
|
498 |
||
499 |
void
|
|
500 |
play_tree_iter_free(play_tree_iter_t* iter) { |
|
501 |
||
502 |
#ifdef MP_DEBUG
|
|
503 |
assert(iter != NULL); |
|
504 |
#endif
|
|
505 |
||
506 |
if(iter->status_stack) { |
|
507 |
#ifdef MP_DEBUG
|
|
508 |
assert(iter->stack_size > 0); |
|
509 |
#endif
|
|
510 |
free(iter->status_stack); |
|
511 |
}
|
|
512 |
||
513 |
free(iter); |
|
514 |
}
|
|
515 |
||
516 |
static play_tree_t* |
|
517 |
play_tree_rnd_step(play_tree_t* pt) { |
|
518 |
int count = 0; |
|
519 |
int r; |
|
520 |
play_tree_t *i,*head; |
|
521 |
||
522 |
// Count how many free choice we have
|
|
523 |
for(i = pt ; i->prev ; i = i->prev) |
|
524 |
if(!(i->flags & PLAY_TREE_RND_PLAYED)) count++; |
|
525 |
head = i; |
|
526 |
if(!(i->flags & PLAY_TREE_RND_PLAYED)) count++; |
|
527 |
for(i = pt->next ; i ; i = i->next) |
|
528 |
if(!(i->flags & PLAY_TREE_RND_PLAYED)) count++; |
|
529 |
||
530 |
if(!count) return NULL; |
|
531 |
||
532 |
r = (int)((float)(count) * rand() / (RAND_MAX + 1.0)); |
|
533 |
||
534 |
for(i = head ; i ; i=i->next) { |
|
535 |
if(!(i->flags & PLAY_TREE_RND_PLAYED)) r--; |
|
536 |
if(r < 0) return i; |
|
537 |
}
|
|
538 |
||
539 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Random stepping error\n"); |
|
540 |
return NULL; |
|
541 |
}
|
|
542 |
||
543 |
||
544 |
int
|
|
545 |
play_tree_iter_step(play_tree_iter_t* iter, int d,int with_nodes) { |
|
546 |
play_tree_t* pt; |
|
547 |
||
548 |
if ( !iter ) return PLAY_TREE_ITER_ENTRY; |
|
549 |
if ( !iter->root ) return PLAY_TREE_ITER_ENTRY; |
|
550 |
||
551 |
#ifdef MP_DEBUG
|
|
552 |
assert(iter != NULL); |
|
553 |
assert(iter->root != NULL); |
|
554 |
//printf("PT : Stepping = %d\n",d);
|
|
555 |
#endif
|
|
556 |
||
557 |
if(iter->tree == NULL) { |
|
558 |
iter->tree = iter->root; |
|
559 |
return play_tree_iter_step(iter,0,with_nodes); |
|
560 |
}
|
|
561 |
||
562 |
if(iter->config && iter->entry_pushed > 0) { |
|
563 |
iter->entry_pushed = 0; |
|
564 |
m_config_pop(iter->config); |
|
565 |
}
|
|
566 |
||
567 |
if(iter->tree->parent && (iter->tree->parent->flags & PLAY_TREE_RND)) |
|
568 |
iter->mode = PLAY_TREE_ITER_RND; |
|
569 |
else
|
|
570 |
iter->mode = PLAY_TREE_ITER_NORMAL; |
|
571 |
||
572 |
iter->file = -1; |
|
573 |
if(iter->mode == PLAY_TREE_ITER_RND) |
|
574 |
pt = play_tree_rnd_step(iter->tree); |
|
575 |
else if( d > 0 ) { |
|
576 |
int i; |
|
577 |
pt = iter->tree; |
|
578 |
for(i = d ; i > 0 && pt ; i--) |
|
579 |
pt = pt->next; |
|
580 |
d = i ? i : 1; |
|
581 |
} else if(d < 0) { |
|
582 |
int i; |
|
583 |
pt = iter->tree; |
|
584 |
for(i = d ; i < 0 && pt ; i++) |
|
585 |
pt = pt->prev; |
|
586 |
d = i ? i : -1; |
|
587 |
} else |
|
588 |
pt = iter->tree; |
|
589 |
||
590 |
if(pt == NULL) { // No next |
|
591 |
// Must we loop?
|
|
592 |
if (iter->mode == PLAY_TREE_ITER_RND) { |
|
593 |
if (iter->root->loop == 0) |
|
594 |
return PLAY_TREE_ITER_END; |
|
595 |
play_tree_unset_flag(iter->root, PLAY_TREE_RND_PLAYED, -1); |
|
596 |
if (iter->root->loop > 0) iter->root->loop--; |
|
597 |
// try again
|
|
598 |
return play_tree_iter_step(iter, 0, with_nodes); |
|
599 |
} else |
|
600 |
if(iter->tree->parent && iter->tree->parent->loop != 0 && ((d > 0 && iter->loop != 0) || ( d < 0 && (iter->loop < 0 || iter->loop < iter->tree->parent->loop) ) ) ) { |
|
601 |
if(d > 0) { // Go back to the first one |
|
602 |
for(pt = iter->tree ; pt->prev != NULL; pt = pt->prev) |
|
603 |
/* NOTHNG */; |
|
604 |
if(iter->loop > 0) iter->loop--; |
|
605 |
} else if( d < 0 ) { // Or the last one |
|
606 |
for(pt = iter->tree ; pt->next != NULL; pt = pt->next) |
|
607 |
/* NOTHNG */; |
|
608 |
if(iter->loop >= 0 && iter->loop < iter->tree->parent->loop) iter->loop++; |
|
609 |
}
|
|
610 |
iter->tree = pt; |
|
611 |
return play_tree_iter_step(iter,0,with_nodes); |
|
612 |
}
|
|
613 |
// Go up one level
|
|
614 |
return play_tree_iter_up_step(iter,d,with_nodes); |
|
615 |
||
616 |
}
|
|
617 |
||
618 |
// Is there any valid child?
|
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
619 |
if(pt->child && play_tree_is_valid(pt->child)) { |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
620 |
iter->tree = pt; |
621 |
if(with_nodes) { // Stop on the node |
|
622 |
return PLAY_TREE_ITER_NODE; |
|
623 |
} else // Or follow it |
|
624 |
return play_tree_iter_down_step(iter,d,with_nodes); |
|
625 |
}
|
|
626 |
||
627 |
// Is it a valid entry?
|
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
628 |
if(! play_tree_is_valid(pt)) { |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
629 |
if(d == 0) { // Can this happen ? FF: Yes! |
630 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"What to do now ???? Infinite loop if we continue\n"); |
|
631 |
return PLAY_TREE_ITER_ERROR; |
|
632 |
} // Not a valid entry : go to next one |
|
633 |
return play_tree_iter_step(iter,d,with_nodes); |
|
634 |
}
|
|
635 |
||
636 |
#ifdef MP_DEBUG
|
|
637 |
assert(pt->files != NULL); |
|
638 |
#endif
|
|
639 |
||
640 |
iter->tree = pt; |
|
641 |
||
642 |
for(d = 0 ; iter->tree->files[d] != NULL ; d++) |
|
643 |
/* NOTHING */; |
|
644 |
iter->num_files = d; |
|
645 |
||
646 |
if(iter->config) { |
|
647 |
play_tree_iter_push_params(iter); |
|
648 |
iter->entry_pushed = 1; |
|
649 |
if(iter->mode == PLAY_TREE_ITER_RND) |
|
650 |
pt->flags |= PLAY_TREE_RND_PLAYED; |
|
651 |
}
|
|
652 |
||
653 |
return PLAY_TREE_ITER_ENTRY; |
|
654 |
||
655 |
}
|
|
656 |
||
657 |
static int |
|
658 |
play_tree_is_valid(play_tree_t* pt) { |
|
659 |
play_tree_t* iter; |
|
660 |
||
661 |
#ifdef MP_DEBUG
|
|
662 |
assert(pt != NULL); |
|
663 |
#endif
|
|
664 |
||
665 |
if(pt->entry_type != PLAY_TREE_ENTRY_NODE) { |
|
666 |
#ifdef MP_DEBUG
|
|
667 |
assert(pt->child == NULL); |
|
668 |
#endif
|
|
669 |
return 1; |
|
670 |
}
|
|
671 |
else if (pt->child != NULL) { |
|
672 |
for(iter = pt->child ; iter != NULL ; iter = iter->next) { |
|
673 |
if(play_tree_is_valid(iter)) |
|
674 |
return 1; |
|
675 |
}
|
|
676 |
}
|
|
677 |
return 0; |
|
678 |
}
|
|
679 |
||
680 |
int
|
|
681 |
play_tree_iter_up_step(play_tree_iter_t* iter, int d,int with_nodes) { |
|
682 |
||
683 |
#ifdef MP_DEBUG
|
|
684 |
assert(iter != NULL); |
|
685 |
assert(iter->tree != NULL); |
|
686 |
//printf("PT : Go UP\n");
|
|
687 |
#endif
|
|
688 |
||
689 |
iter->file = -1; |
|
690 |
if(iter->tree->parent == iter->root->parent) |
|
691 |
return PLAY_TREE_ITER_END; |
|
692 |
||
693 |
#ifdef MP_DEBUG
|
|
694 |
assert(iter->tree->parent != NULL); |
|
695 |
assert(iter->stack_size > 0); |
|
696 |
assert(iter->status_stack != NULL); |
|
697 |
#endif
|
|
698 |
||
699 |
iter->stack_size--; |
|
700 |
iter->loop = iter->status_stack[iter->stack_size]; |
|
701 |
if(iter->stack_size > 0) |
|
702 |
iter->status_stack = (int*)realloc(iter->status_stack,iter->stack_size*sizeof(int)); |
|
703 |
else { |
|
704 |
free(iter->status_stack); |
|
705 |
iter->status_stack = NULL; |
|
706 |
}
|
|
707 |
if(iter->stack_size > 0 && iter->status_stack == NULL) { |
|
708 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",iter->stack_size*(int)sizeof(char*)); |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
709 |
return PLAY_TREE_ITER_ERROR; |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
710 |
}
|
711 |
iter->tree = iter->tree->parent; |
|
712 |
||
713 |
// Pop subtree params
|
|
714 |
if(iter->config) { |
|
715 |
m_config_pop(iter->config); |
|
716 |
if(iter->mode == PLAY_TREE_ITER_RND) |
|
717 |
iter->tree->flags |= PLAY_TREE_RND_PLAYED; |
|
718 |
}
|
|
719 |
||
720 |
return play_tree_iter_step(iter,d,with_nodes); |
|
721 |
}
|
|
722 |
||
723 |
int
|
|
724 |
play_tree_iter_down_step(play_tree_iter_t* iter, int d,int with_nodes) { |
|
725 |
||
726 |
#ifdef MP_DEBUG
|
|
727 |
assert(iter->tree->files == NULL); |
|
728 |
assert(iter->tree->child != NULL); |
|
729 |
assert(iter->tree->child->parent == iter->tree); |
|
730 |
//printf("PT : Go DOWN\n");
|
|
731 |
#endif
|
|
732 |
||
733 |
iter->file = -1; |
|
734 |
||
735 |
// Push subtree params
|
|
736 |
if(iter->config) |
|
737 |
play_tree_iter_push_params(iter); |
|
738 |
||
739 |
iter->stack_size++; |
|
740 |
iter->status_stack = (int*)realloc(iter->status_stack,iter->stack_size*sizeof(int)); |
|
741 |
if(iter->status_stack == NULL) { |
|
742 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",iter->stack_size*(int)sizeof(int)); |
|
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
743 |
return PLAY_TREE_ITER_ERROR; |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
744 |
}
|
745 |
iter->status_stack[iter->stack_size-1] = iter->loop; |
|
746 |
// Set new status
|
|
747 |
iter->loop = iter->tree->loop-1; |
|
748 |
if(d >= 0) |
|
749 |
iter->tree = iter->tree->child; |
|
750 |
else { |
|
751 |
play_tree_t* pt; |
|
752 |
for(pt = iter->tree->child ; pt->next != NULL ; pt = pt->next) |
|
753 |
/*NOTING*/; |
|
754 |
iter->tree = pt; |
|
755 |
}
|
|
756 |
||
757 |
return play_tree_iter_step(iter,0,with_nodes); |
|
758 |
}
|
|
759 |
||
760 |
char* |
|
761 |
play_tree_iter_get_file(play_tree_iter_t* iter, int d) { |
|
762 |
#ifdef MP_DEBUG
|
|
763 |
assert(iter != NULL); |
|
764 |
assert(iter->tree->child == NULL); |
|
765 |
#endif
|
|
766 |
||
767 |
if(iter->tree->files == NULL) |
|
768 |
return NULL; |
|
769 |
||
770 |
#ifdef MP_DEBUG
|
|
771 |
assert(iter->num_files > 0); |
|
772 |
#endif
|
|
773 |
||
774 |
if(iter->file >= iter->num_files-1 || iter->file < -1) |
|
775 |
return NULL; |
|
776 |
||
777 |
if(d > 0) { |
|
778 |
if(iter->file >= iter->num_files - 1) |
|
779 |
iter->file = 0; |
|
780 |
else
|
|
781 |
iter->file++; |
|
782 |
} else if(d < 0) { |
|
783 |
if(iter->file <= 0) |
|
784 |
iter->file = iter->num_files - 1; |
|
785 |
else
|
|
786 |
iter->file--; |
|
787 |
}
|
|
788 |
return iter->tree->files[iter->file]; |
|
789 |
}
|
|
790 |
||
791 |
play_tree_t* |
|
792 |
play_tree_cleanup(play_tree_t* pt) { |
|
793 |
play_tree_t* iter, *tmp, *first; |
|
794 |
||
795 |
#ifdef MP_DEBUG
|
|
796 |
assert(pt != NULL); |
|
797 |
#endif
|
|
798 |
||
799 |
if( ! play_tree_is_valid(pt)) { |
|
800 |
play_tree_remove(pt,1,1); |
|
801 |
return NULL; |
|
802 |
}
|
|
803 |
||
804 |
first = pt->child; |
|
805 |
||
806 |
for(iter = pt->child ; iter != NULL ; ) { |
|
807 |
tmp = iter; |
|
808 |
iter = iter->next; |
|
809 |
if(! play_tree_is_valid(tmp)) { |
|
810 |
play_tree_remove(tmp,1,1); |
|
811 |
if(tmp == first) first = iter; |
|
812 |
}
|
|
813 |
}
|
|
814 |
||
815 |
for(iter = first ; iter != NULL ; ) { |
|
816 |
tmp = iter; |
|
817 |
iter = iter->next; |
|
818 |
play_tree_cleanup(tmp); |
|
819 |
}
|
|
820 |
||
821 |
return pt; |
|
822 |
||
823 |
}
|
|
824 |
||
825 |
play_tree_iter_t* |
|
826 |
play_tree_iter_new_copy(play_tree_iter_t* old) { |
|
827 |
play_tree_iter_t* iter; |
|
828 |
||
829 |
#ifdef MP_DEBUG
|
|
830 |
assert(old != NULL); |
|
831 |
#endif
|
|
832 |
||
833 |
iter = malloc(sizeof(play_tree_iter_t)); |
|
1.1.3
by William Grant
Import upstream version 1.0~rc1 |
834 |
if(iter == NULL) { |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
835 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",(int)sizeof(play_tree_iter_t)); |
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
836 |
return NULL; |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
837 |
}
|
838 |
;
|
|
839 |
memcpy(iter,old,sizeof(play_tree_iter_t)); |
|
840 |
if(old->status_stack) { |
|
841 |
iter->status_stack = malloc(old->stack_size * sizeof(int)); |
|
1.1.3
by William Grant
Import upstream version 1.0~rc1 |
842 |
if(iter->status_stack == NULL) { |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
843 |
mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",old->stack_size * (int)sizeof(int)); |
1.1.4
by Mario Limonciello
Import upstream version 1.0~rc2 |
844 |
free(iter); |
1
by Sebastian Dröge
Import upstream version 0.99+1.0pre7try2+cvs20051205 |
845 |
return NULL; |
846 |
}
|
|
847 |
memcpy(iter->status_stack,old->status_stack,iter->stack_size*sizeof(int)); |
|
848 |
}
|
|
849 |
iter->config = NULL; |
|
850 |
||
851 |
return iter; |
|
852 |
}
|
|
853 |
||
854 |
// HIGH Level API, by Fabian Franz (mplayer@fabian-franz.de)
|
|
855 |
//
|
|
856 |
play_tree_iter_t* pt_iter_create(play_tree_t** ppt, m_config_t* config) |
|
857 |
{
|
|
858 |
play_tree_iter_t* r=NULL; |
|
859 |
#ifdef MP_DEBUG
|
|
860 |
assert(*ppt!=NULL); |
|
861 |
#endif
|
|
862 |
||
863 |
*ppt=play_tree_cleanup(*ppt); |
|
864 |
||
865 |
if(*ppt) { |
|
866 |
r = play_tree_iter_new(*ppt,config); |
|
867 |
if (r && play_tree_iter_step(r,0,0) != PLAY_TREE_ITER_ENTRY) |
|
868 |
{
|
|
869 |
play_tree_iter_free(r); |
|
870 |
r = NULL; |
|
871 |
}
|
|
872 |
}
|
|
873 |
||
874 |
return r; |
|
875 |
}
|
|
876 |
||
877 |
void pt_iter_destroy(play_tree_iter_t** iter) |
|
878 |
{
|
|
879 |
if (iter && *iter) |
|
880 |
{
|
|
881 |
free(*iter); |
|
882 |
iter=NULL; |
|
883 |
}
|
|
884 |
}
|
|
885 |
||
886 |
char* pt_iter_get_file(play_tree_iter_t* iter, int d) |
|
887 |
{
|
|
888 |
int i=0; |
|
889 |
char* r; |
|
890 |
||
891 |
if (iter==NULL) |
|
892 |
return NULL; |
|
893 |
||
894 |
r = play_tree_iter_get_file(iter,d); |
|
895 |
||
896 |
while (!r && d!=0) |
|
897 |
{
|
|
898 |
if (play_tree_iter_step(iter,d,0) != PLAY_TREE_ITER_ENTRY) |
|
899 |
break; |
|
900 |
r=play_tree_iter_get_file(iter,d); |
|
901 |
i++; |
|
902 |
}
|
|
903 |
||
904 |
return r; |
|
905 |
}
|
|
906 |
||
907 |
void pt_iter_insert_entry(play_tree_iter_t* iter, play_tree_t* entry) |
|
908 |
{
|
|
909 |
play_tree_t *pt = iter->tree; |
|
910 |
#ifdef MP_DEBUG
|
|
911 |
assert(pt!=NULL); |
|
912 |
assert(entry!=NULL); |
|
913 |
assert(entry!=pt); |
|
914 |
#endif
|
|
915 |
||
916 |
play_tree_insert_entry(pt, entry); |
|
917 |
play_tree_set_params_from(entry,pt); |
|
918 |
}
|
|
919 |
||
920 |
void pt_iter_replace_entry(play_tree_iter_t* iter, play_tree_t* entry) |
|
921 |
{
|
|
922 |
play_tree_t *pt = iter->tree; |
|
923 |
||
924 |
pt_iter_insert_entry(iter, entry); |
|
925 |
play_tree_remove(pt, 1, 1); |
|
926 |
iter->tree=entry; |
|
927 |
}
|
|
928 |
||
929 |
//Add a new file as a new entry
|
|
930 |
void pt_add_file(play_tree_t** ppt, char* filename) |
|
931 |
{
|
|
932 |
play_tree_t *pt = *ppt, *entry = play_tree_new(); |
|
933 |
#ifdef MP_DEBUG
|
|
934 |
assert(entry!=NULL); |
|
935 |
#endif
|
|
936 |
||
937 |
play_tree_add_file(entry, filename); |
|
938 |
if (pt) |
|
939 |
play_tree_append_entry(pt, entry); |
|
940 |
else
|
|
941 |
{
|
|
942 |
pt=entry; |
|
943 |
*ppt=pt; |
|
944 |
}
|
|
945 |
play_tree_set_params_from(entry,pt); |
|
946 |
}
|
|
947 |
||
948 |
void pt_add_gui_file(play_tree_t** ppt, char* path, char* file) |
|
949 |
{
|
|
950 |
char* wholename = malloc(strlen(path)+strlen(file)+2); |
|
951 |
||
952 |
if (wholename) |
|
953 |
{
|
|
954 |
strcpy(wholename, path); |
|
955 |
strcat(wholename, "/"); |
|
956 |
strcat(wholename, file); |
|
957 |
pt_add_file(ppt, wholename); |
|
958 |
free(wholename); // As pt_add_file strdups it anyway! |
|
959 |
}
|
|
960 |
}
|
|
961 |
||
962 |
void pt_iter_goto_head(play_tree_iter_t* iter) |
|
963 |
{
|
|
964 |
iter->tree=iter->root; |
|
965 |
play_tree_iter_step(iter, 0, 0); |
|
966 |
}
|
|
967 |