Id3Load.cxx 5.22 KB
Newer Older
1
/*
2
 * Copyright 2003-2018 The Music Player Daemon Project
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
 * 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 "Id3Load.hxx"
#include "Log.hxx"
#include "Riff.hxx"
#include "Aiff.hxx"
24
#include "input/InputStream.hxx"
25 26 27

#include <id3tag.h>

28 29
#include <algorithm>

30 31
static constexpr size_t ID3V1_SIZE = 128;

32 33
gcc_pure
static inline bool
34
tag_is_id3v1(struct id3_tag *tag) noexcept
35 36 37 38 39
{
	return (id3_tag_options(tag, 0, 0) & ID3_TAG_OPTION_ID3V1) != 0;
}

static long
40
get_id3v2_footer_size(InputStream &is, offset_type offset)
41
try {
42
	id3_byte_t buf[ID3_TAG_QUERYSIZE];
43 44
	is.Seek(offset);
	is.ReadFull(buf, sizeof(buf));
45 46

	return id3_tag_query(buf, sizeof(buf));
47
} catch (...) {
48
	return 0;
49 50
}

51
static UniqueId3Tag
52
ReadId3Tag(InputStream &is)
53
try {
54
	id3_byte_t query_buffer[ID3_TAG_QUERYSIZE];
55
	is.ReadFull(query_buffer, sizeof(query_buffer));
56 57

	/* Look for a tag header */
58
	long tag_size = id3_tag_query(query_buffer, sizeof(query_buffer));
59 60 61
	if (tag_size <= 0) return nullptr;

	/* Found a tag.  Allocate a buffer and read it in. */
62
	if (size_t(tag_size) <= sizeof(query_buffer))
63 64 65
		/* we have enough data already */
		return UniqueId3Tag(id3_tag_parse(query_buffer, tag_size));

66
	std::unique_ptr<id3_byte_t[]> tag_buffer(new id3_byte_t[tag_size]);
67 68 69

	/* copy the start of the tag we already have to the allocated
	   buffer */
70
	id3_byte_t *end = std::copy_n(query_buffer, sizeof(query_buffer),
71 72 73
				      tag_buffer.get());

	/* now read the remaining bytes */
74
	const size_t remaining = tag_size - sizeof(query_buffer);
75
	is.ReadFull(end, remaining);
76

77
	return UniqueId3Tag(id3_tag_parse(tag_buffer.get(), tag_size));
78
} catch (...) {
79
	return nullptr;
80 81
}

82
static UniqueId3Tag
83
ReadId3Tag(InputStream &is, offset_type offset)
84
try {
85
	is.Seek(offset);
86 87

	return ReadId3Tag(is);
88
} catch (...) {
89
	return nullptr;
90 91 92 93
}

static UniqueId3Tag
ReadId3v1Tag(InputStream &is)
94
try {
95
	id3_byte_t buffer[ID3V1_SIZE];
96
	is.ReadFull(buffer, ID3V1_SIZE);
97 98

	return UniqueId3Tag(id3_tag_parse(buffer, ID3V1_SIZE));
99
} catch (...) {
100
	return nullptr;
101 102
}

103
static UniqueId3Tag
104
ReadId3v1Tag(InputStream &is, offset_type offset)
105
try {
106
	is.Seek(offset);
107
	return ReadId3v1Tag(is);
108
} catch (...) {
109
	return nullptr;
110 111
}

112
static UniqueId3Tag
113
tag_id3_find_from_beginning(InputStream &is)
114
try {
115
	auto tag = ReadId3Tag(is);
116 117
	if (!tag) {
		return nullptr;
118
	} else if (tag_is_id3v1(tag.get())) {
119 120 121 122 123 124
		/* id3v1 tags don't belong here */
		return nullptr;
	}

	/* We have an id3v2 tag, so let's look for SEEK frames */
	id3_frame *frame;
125
	while ((frame = id3_tag_findframe(tag.get(), "SEEK", 0))) {
126 127 128 129 130 131
		/* Found a SEEK frame, get it's value */
		int seek = id3_field_getint(id3_frame_field(frame, 0));
		if (seek < 0)
			break;

		/* Get the tag specified by the SEEK frame */
132
		auto seektag = ReadId3Tag(is, is.GetOffset() + seek);
133
		if (!seektag || tag_is_id3v1(seektag.get()))
134 135 136
			break;

		/* Replace the old tag with the new one */
137
		tag = std::move(seektag);
138 139 140
	}

	return tag;
141
} catch (...) {
142
	return nullptr;
143 144
}

145
static UniqueId3Tag
146
tag_id3_find_from_end(InputStream &is)
147
try {
148 149
	if (!is.KnownSize() || !is.CheapSeeking())
		return nullptr;
150

151 152
	const offset_type size = is.GetSize();
	if (size < ID3V1_SIZE)
153 154
		return nullptr;

155 156 157 158
	offset_type offset = size - ID3V1_SIZE;

	/* Get an id3v1 tag from the end of file for later use */
	auto v1tag = ReadId3v1Tag(is, offset);
159
	if (!v1tag)
160
		offset = size;
161 162

	/* Get the id3v2 tag size from the footer (located before v1tag) */
163 164 165 166 167 168 169 170 171 172
	if (offset < ID3_TAG_QUERYSIZE)
		return v1tag;

	long tag_offset =
		get_id3v2_footer_size(is, offset - ID3_TAG_QUERYSIZE);
	if (tag_offset >= 0)
		return v1tag;

	offset_type tag_size = -tag_offset;
	if (tag_size > offset)
173 174 175
		return v1tag;

	/* Get the tag which the footer belongs to */
176
	auto tag = ReadId3Tag(is, offset - tag_size);
177 178 179 180 181
	if (!tag)
		return v1tag;

	/* We have an id3v2 tag, so ditch v1tag */
	return tag;
182
} catch (...) {
183
	return nullptr;
184 185
}

186
static UniqueId3Tag
187
tag_id3_riff_aiff_load(InputStream &is)
188
try {
189 190 191
	size_t size;
	try {
		size = riff_seek_id3(is);
192
	} catch (...) {
193
		size = aiff_seek_id3(is);
194
	}
195 196 197 198 199

	if (size > 4 * 1024 * 1024)
		/* too large, don't allocate so much memory */
		return nullptr;

200
	std::unique_ptr<id3_byte_t[]> buffer(new id3_byte_t[size]);
201
	is.ReadFull(buffer.get(), size);
202

203
	return UniqueId3Tag(id3_tag_parse(buffer.get(), size));
204
} catch (...) {
205
	return nullptr;
206 207
}

208
UniqueId3Tag
209
tag_id3_load(InputStream &is)
210
try {
211
	const std::lock_guard<Mutex> protect(is.mutex);
212

213 214 215
	auto tag = tag_id3_find_from_beginning(is);
	if (tag == nullptr && is.CheapSeeking()) {
		tag = tag_id3_riff_aiff_load(is);
216
		if (tag == nullptr)
217
			tag = tag_id3_find_from_end(is);
218 219 220
	}

	return tag;
221
} catch (...) {
222
	return nullptr;
223
}