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
|
/*
* (c) 2004 by Kalle Wallin <kaw@linux.se>
* (c) 2008 Max Kellermann <max@duempel.org>
*
* 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, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "filelist.h"
#include "libmpdclient.h"
#include <string.h>
#include <assert.h>
struct filelist *
filelist_new(const char *path)
{
struct filelist *filelist = g_malloc(sizeof(*filelist));
filelist->path = g_strdup(path);
filelist->length = 0;
filelist->updated = FALSE;
filelist->list = NULL;
return filelist;
}
void
filelist_free(struct filelist *filelist)
{
GList *list = g_list_first(filelist->list);
if (list == NULL)
return;
while (list != NULL) {
filelist_entry_t *entry = list->data;
if (entry->entity)
mpd_freeInfoEntity(entry->entity);
g_free(entry);
list = list->next;
}
g_list_free(filelist->list);
g_free(filelist->path);
g_free(filelist);
}
struct filelist_entry *
filelist_append(struct filelist *filelist, struct mpd_InfoEntity *entity)
{
struct filelist_entry *entry = g_malloc(sizeof(*entry));
entry->flags = 0;
entry->entity = entity;
filelist->list = g_list_append(filelist->list, entry);
filelist->length++;
return entry;
}
struct filelist_entry *
filelist_prepend(struct filelist *filelist, struct mpd_InfoEntity *entity)
{
struct filelist_entry *entry = g_malloc(sizeof(*entry));
entry->flags = 0;
entry->entity = entity;
filelist->list = g_list_insert(filelist->list, entry, 0);
filelist->length++;
return entry;
}
void
filelist_move(struct filelist *filelist, struct filelist *from)
{
filelist->list = g_list_concat(filelist->list, from->list);
filelist->length += from->length;
from->list = NULL;
from->length = 0;
}
void
filelist_sort(struct filelist *filelist, GCompareFunc compare_func)
{
filelist->list = g_list_sort(filelist->list, compare_func);
}
struct filelist_entry *
filelist_find_song(struct filelist *fl, const struct mpd_song *song)
{
GList *list = g_list_first(fl->list);
assert(song != NULL);
while (list != NULL) {
filelist_entry_t *entry = list->data;
mpd_InfoEntity *entity = entry->entity;
if (entity && entity->type == MPD_INFO_ENTITY_TYPE_SONG) {
struct mpd_song *song2 = entity->info.song;
if (strcmp(song->file, song2->file) == 0)
return entry;
}
list = list->next;
}
return NULL;
}
|
