aboutsummaryrefslogtreecommitdiffstats
path: root/src/DatabasePrint.cxx
blob: d790eb5bc57706cd98aeee5dc8a0cb614f3a64a9 (plain) (blame)
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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
/*
 * Copyright (C) 2003-2012 The Music Player Daemon Project
 * http://www.musicpd.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.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */

#include "config.h"

extern "C" {
#include "db_print.h"
#include "db_selection.h"
#include "locate.h"
#include "database.h"
#include "client.h"
#include "song.h"
#include "song_print.h"
#include "playlist_vector.h"
#include "tag.h"
}

#include "directory.h"

#include "DatabaseGlue.hxx"
#include "DatabasePlugin.hxx"

#include <functional>
#include <set>

static bool
PrintDirectory(struct client *client, const struct directory *directory)
{
	if (!directory_is_root(directory))
		client_printf(client, "directory: %s\n", directory_get_path(directory));

	return true;
}

static void
print_playlist_in_directory(struct client *client,
			    const struct directory *directory,
			    const char *name_utf8)
{
	if (directory_is_root(directory))
		client_printf(client, "playlist: %s\n", name_utf8);
	else
		client_printf(client, "playlist: %s/%s\n",
			      directory_get_path(directory), name_utf8);
}

static bool
PrintSongBrief(struct client *client, struct song *song)
{
	assert(song != NULL);
	assert(song->parent != NULL);

	song_print_uri(client, song);

	if (song->tag != NULL && song->tag->has_playlist)
		/* this song file has an embedded CUE sheet */
		print_playlist_in_directory(client, song->parent,
					    song->uri);

	return true;
}

static bool
PrintSongFull(struct client *client, struct song *song)
{
	assert(song != NULL);
	assert(song->parent != NULL);

	song_print_info(client, song);

	if (song->tag != NULL && song->tag->has_playlist)
		/* this song file has an embedded CUE sheet */
		print_playlist_in_directory(client, song->parent,
					    song->uri);

	return true;
}

static bool
PrintPlaylistBrief(struct client *client,
		   const struct playlist_metadata *playlist,
		   const struct directory *directory)
{
	print_playlist_in_directory(client, directory, playlist->name);
	return true;
}

static bool
PrintPlaylistFull(struct client *client,
		  const struct playlist_metadata *playlist,
		  const struct directory *directory)
{
	print_playlist_in_directory(client, directory, playlist->name);

#ifndef G_OS_WIN32
	struct tm tm;
#endif
	char timestamp[32];
	time_t t = playlist->mtime;
	strftime(timestamp, sizeof(timestamp),
#ifdef G_OS_WIN32
		 "%Y-%m-%dT%H:%M:%SZ",
		 gmtime(&t)
#else
		 "%FT%TZ",
		 gmtime_r(&t, &tm)
#endif
		 );
	client_printf(client, "Last-Modified: %s\n", timestamp);

	return true;
}

bool
db_selection_print(struct client *client, const struct db_selection *selection,
		   bool full, GError **error_r)
{
	using namespace std::placeholders;
	const auto d = std::bind(PrintDirectory, client, _1);
	const auto s = std::bind(full ? PrintSongFull : PrintSongBrief,
				 client, _1);
	const auto p = std::bind(full ? PrintPlaylistFull : PrintPlaylistBrief,
				 client, _1, _2);

	return GetDatabase()->Visit(selection, d, s, p, error_r);
}

static bool
SearchPrintSong(struct client *client, const struct locate_item_list *criteria,
		struct song *song)
{
	if (locate_song_search(song, criteria))
		song_print_info(client, song);

	return true;
}

bool
searchForSongsIn(struct client *client, const char *uri,
		 const struct locate_item_list *criteria,
		 GError **error_r)
{
	struct db_selection selection;
	db_selection_init(&selection, uri, true);

	struct locate_item_list *new_list
		= locate_item_list_casefold(criteria);

	using namespace std::placeholders;
	const auto f = std::bind(SearchPrintSong, client, new_list, _1);
	bool success = GetDatabase()->Visit(&selection, f, error_r);

	locate_item_list_free(new_list);

	return success;
}

static bool
MatchPrintSong(struct client *client, const struct locate_item_list *criteria,
	       struct song *song)
{
	if (locate_song_match(song, criteria))
		song_print_info(client, song);

	return true;
}

bool
findSongsIn(struct client *client, const char *uri,
	    const struct locate_item_list *criteria,
	    GError **error_r)
{
	struct db_selection selection;
	db_selection_init(&selection, uri, true);

	using namespace std::placeholders;
	const auto f = std::bind(MatchPrintSong, client, criteria, _1);
	return GetDatabase()->Visit(&selection, f, error_r);
}

struct SearchStats {
	int numberOfSongs;
	unsigned long playTime;
};

static void printSearchStats(struct client *client, SearchStats *stats)
{
	client_printf(client, "songs: %i\n", stats->numberOfSongs);
	client_printf(client, "playtime: %li\n", stats->playTime);
}

static bool
stats_visitor_song(SearchStats &stats, const struct locate_item_list *criteria,
		   struct song *song)
{
	if (locate_song_match(song, criteria)) {
		stats.numberOfSongs++;
		stats.playTime += song_get_duration(song);
	}

	return true;
}

bool
searchStatsForSongsIn(struct client *client, const char *name,
		      const struct locate_item_list *criteria,
		      GError **error_r)
{
	struct db_selection selection;
	db_selection_init(&selection, name, true);

	SearchStats stats;
	stats.numberOfSongs = 0;
	stats.playTime = 0;

	using namespace std::placeholders;
	const auto f = std::bind(stats_visitor_song, std::ref(stats), criteria,
				 _1);
	if (!GetDatabase()->Visit(&selection, f, error_r))
		return false;

	printSearchStats(client, &stats);
	return true;
}

bool
printAllIn(struct client *client, const char *uri_utf8, GError **error_r)
{
	struct db_selection selection;
	db_selection_init(&selection, uri_utf8, true);
	return db_selection_print(client, &selection, false, error_r);
}

bool
printInfoForAllIn(struct client *client, const char *uri_utf8,
		  GError **error_r)
{
	struct db_selection selection;
	db_selection_init(&selection, uri_utf8, true);
	return db_selection_print(client, &selection, true, error_r);
}

struct StringLess {
	gcc_pure
	bool operator()(const char *a, const char *b) const {
		return strcmp(a, b) < 0;
	}
};

typedef std::set<const char *, StringLess> StringSet;

static void
visitTag(struct client *client, StringSet &set,
	 struct song *song, enum tag_type tagType)
{
	struct tag *tag = song->tag;
	bool found = false;

	if (tagType == LOCATE_TAG_FILE_TYPE) {
		song_print_uri(client, song);
		return;
	}

	if (!tag)
		return;

	for (unsigned i = 0; i < tag->num_items; i++) {
		if (tag->items[i]->type == tagType) {
			set.insert(tag->items[i]->value);
			found = true;
		}
	}

	if (!found)
		set.insert("");
}

static bool
unique_tags_visitor_song(struct client *client,
			 enum tag_type tag_type,
			 const struct locate_item_list *criteria,
			 StringSet &set, struct song *song)
{
	if (locate_song_match(song, criteria))
		visitTag(client, set, song, tag_type);

	return true;
}

bool
listAllUniqueTags(struct client *client, int type,
		  const struct locate_item_list *criteria,
		  GError **error_r)
{
	struct db_selection selection;
	db_selection_init(&selection, "", true);

	StringSet set;

	using namespace std::placeholders;
	const auto f = std::bind(unique_tags_visitor_song, client,
				 (enum tag_type)type, criteria, std::ref(set),
				 _1);
	if (!GetDatabase()->Visit(&selection, f, error_r))
		return false;

	if (type >= 0 && type <= TAG_NUM_OF_ITEM_TYPES)
		for (auto value : set)
			client_printf(client, "%s: %s\n",
				      tag_item_names[type],
				      value);

	return true;
}