2007-06-16 18:19:51 +00:00
|
|
|
/***************************************************************************
|
|
|
|
* __________ __ ___.
|
|
|
|
* Open \______ \ ____ ____ | | _\_ |__ _______ ___
|
|
|
|
* Source | _// _ \_/ ___\| |/ /| __ \ / _ \ \/ /
|
|
|
|
* Jukebox | | ( <_> ) \___| < | \_\ ( <_> > < <
|
|
|
|
* Firmware |____|_ /\____/ \___ >__|_ \|___ /\____/__/\_ \
|
|
|
|
* \/ \/ \/ \/ \/
|
|
|
|
* $Id$
|
|
|
|
*
|
|
|
|
* Copyright (C) 2005 Dave Chapman
|
|
|
|
*
|
2008-06-28 18:10:04 +00:00
|
|
|
* 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.
|
2007-06-16 18:19:51 +00:00
|
|
|
*
|
|
|
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
|
|
|
* KIND, either express or implied.
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
#include <stdio.h>
|
2010-05-06 21:04:40 +00:00
|
|
|
#include "string-extra.h"
|
2007-06-16 18:19:51 +00:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <ctype.h>
|
|
|
|
#include <inttypes.h>
|
|
|
|
|
2011-10-30 16:05:04 +00:00
|
|
|
#include "platform.h"
|
2008-10-15 06:38:51 +00:00
|
|
|
#include "metadata.h"
|
2007-06-16 18:19:51 +00:00
|
|
|
#include "metadata_common.h"
|
2008-10-15 06:38:51 +00:00
|
|
|
#include "metadata_parsers.h"
|
2007-06-16 18:19:51 +00:00
|
|
|
#include "replaygain.h"
|
|
|
|
|
|
|
|
/* Read a string from the file. Read up to size bytes, or, if eos != -1,
|
|
|
|
* until the eos character is found (eos is not stored in buf, unless it is
|
|
|
|
* nil). Writes up to buf_size chars to buf, always terminating with a nil.
|
|
|
|
* Returns number of chars read or -1 on read error.
|
|
|
|
*/
|
|
|
|
long read_string(int fd, char* buf, long buf_size, int eos, long size)
|
|
|
|
{
|
|
|
|
long read_bytes = 0;
|
|
|
|
char c;
|
|
|
|
|
|
|
|
while (size != 0)
|
|
|
|
{
|
|
|
|
if (read(fd, &c, 1) != 1)
|
|
|
|
{
|
|
|
|
read_bytes = -1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
read_bytes++;
|
|
|
|
size--;
|
|
|
|
|
|
|
|
if ((eos != -1) && (eos == (unsigned char) c))
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (buf_size > 1)
|
|
|
|
{
|
|
|
|
*buf++ = c;
|
|
|
|
buf_size--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
*buf = 0;
|
|
|
|
return read_bytes;
|
|
|
|
}
|
2009-05-16 19:05:50 +00:00
|
|
|
/* Read an unsigned 8-bit integer from a file. */
|
|
|
|
int read_uint8(int fd, uint8_t* buf)
|
|
|
|
{
|
|
|
|
size_t n;
|
|
|
|
|
|
|
|
n = read(fd, (char*) buf, 1);
|
|
|
|
return n;
|
|
|
|
}
|
2007-06-16 18:19:51 +00:00
|
|
|
|
2007-06-16 18:40:07 +00:00
|
|
|
#ifdef ROCKBOX_LITTLE_ENDIAN
|
2009-05-16 19:05:50 +00:00
|
|
|
/* Read an unsigned 16-bit integer from a big-endian file. */
|
|
|
|
int read_uint16be(int fd, uint16_t* buf)
|
|
|
|
{
|
|
|
|
size_t n;
|
|
|
|
|
|
|
|
n = read(fd, (char*) buf, 2);
|
|
|
|
*buf = betoh16(*buf);
|
|
|
|
return n;
|
|
|
|
}
|
2007-07-03 09:25:36 +00:00
|
|
|
/* Read an unsigned 32-bit integer from a big-endian file. */
|
2009-05-15 22:45:03 +00:00
|
|
|
int read_uint32be(int fd, uint32_t* buf)
|
2007-06-16 18:19:51 +00:00
|
|
|
{
|
|
|
|
size_t n;
|
|
|
|
|
|
|
|
n = read(fd, (char*) buf, 4);
|
|
|
|
*buf = betoh32(*buf);
|
|
|
|
return n;
|
|
|
|
}
|
2009-10-06 13:47:12 +00:00
|
|
|
/* Read an unsigned 64-bit integer from a big-endian file. */
|
|
|
|
int read_uint64be(int fd, uint64_t* buf)
|
|
|
|
{
|
|
|
|
size_t n;
|
|
|
|
uint8_t data[8];
|
|
|
|
int i;
|
|
|
|
|
|
|
|
n = read(fd, data, 8);
|
|
|
|
|
|
|
|
for (i=0, *buf=0; i<=7; i++) {
|
|
|
|
*buf <<= 8;
|
|
|
|
*buf |= data[i];
|
|
|
|
}
|
|
|
|
return n;
|
|
|
|
}
|
2007-07-03 09:25:36 +00:00
|
|
|
#else
|
|
|
|
/* Read unsigned integers from a little-endian file. */
|
|
|
|
int read_uint16le(int fd, uint16_t* buf)
|
|
|
|
{
|
|
|
|
size_t n;
|
|
|
|
|
|
|
|
n = read(fd, (char*) buf, 2);
|
|
|
|
*buf = letoh16(*buf);
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
int read_uint32le(int fd, uint32_t* buf)
|
|
|
|
{
|
|
|
|
size_t n;
|
|
|
|
|
|
|
|
n = read(fd, (char*) buf, 4);
|
|
|
|
*buf = letoh32(*buf);
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
int read_uint64le(int fd, uint64_t* buf)
|
|
|
|
{
|
|
|
|
size_t n;
|
|
|
|
uint8_t data[8];
|
|
|
|
int i;
|
|
|
|
|
|
|
|
n = read(fd, data, 8);
|
|
|
|
|
|
|
|
for (i=7, *buf=0; i>=0; i--) {
|
|
|
|
*buf <<= 8;
|
|
|
|
*buf |= data[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
return n;
|
|
|
|
}
|
2007-06-16 18:19:51 +00:00
|
|
|
#endif
|
|
|
|
|
2010-02-28 08:48:07 +00:00
|
|
|
/* Read an unaligned 64-bit little endian unsigned integer from buffer. */
|
|
|
|
uint64_t get_uint64_le(void* buf)
|
|
|
|
{
|
|
|
|
unsigned char* p = (unsigned char*) buf;
|
|
|
|
|
|
|
|
return p[0] | (p[1] << 8) | (p[2] << 16) | (p[3] << 24) | ((uint64_t)p[4] << 32) |
|
|
|
|
((uint64_t)p[5] << 40) | ((uint64_t)p[6] << 48) | ((uint64_t)p[7] << 56);
|
|
|
|
}
|
|
|
|
|
2007-06-16 18:19:51 +00:00
|
|
|
/* Read an unaligned 32-bit little endian long from buffer. */
|
2011-08-27 12:34:21 +00:00
|
|
|
uint32_t get_long_le(void* buf)
|
2007-06-16 18:19:51 +00:00
|
|
|
{
|
|
|
|
unsigned char* p = (unsigned char*) buf;
|
|
|
|
|
|
|
|
return p[0] | (p[1] << 8) | (p[2] << 16) | (p[3] << 24);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Read an unaligned 16-bit little endian short from buffer. */
|
2011-08-27 12:34:21 +00:00
|
|
|
uint16_t get_short_le(void* buf)
|
2007-06-16 18:19:51 +00:00
|
|
|
{
|
|
|
|
unsigned char* p = (unsigned char*) buf;
|
|
|
|
|
|
|
|
return p[0] | (p[1] << 8);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Read an unaligned 32-bit big endian long from buffer. */
|
2011-08-27 12:34:21 +00:00
|
|
|
uint32_t get_long_be(void* buf)
|
2007-06-16 18:19:51 +00:00
|
|
|
{
|
|
|
|
unsigned char* p = (unsigned char*) buf;
|
|
|
|
|
|
|
|
return (p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3];
|
|
|
|
}
|
|
|
|
|
2011-08-07 20:01:04 +00:00
|
|
|
/* Read an unaligned 16-bit little endian short from buffer. */
|
2011-08-27 12:34:21 +00:00
|
|
|
uint16_t get_short_be(void* buf)
|
2011-08-07 20:01:04 +00:00
|
|
|
{
|
|
|
|
unsigned char* p = (unsigned char*) buf;
|
|
|
|
|
|
|
|
return (p[0] << 8) | p[1];
|
|
|
|
}
|
|
|
|
|
2007-06-16 18:19:51 +00:00
|
|
|
/* Read an unaligned 32-bit little endian long from buffer. */
|
2011-08-27 12:34:21 +00:00
|
|
|
int32_t get_slong(void* buf)
|
2007-06-16 18:19:51 +00:00
|
|
|
{
|
|
|
|
unsigned char* p = (unsigned char*) buf;
|
|
|
|
|
|
|
|
return p[0] | (p[1] << 8) | (p[2] << 16) | (p[3] << 24);
|
|
|
|
}
|
|
|
|
|
2011-08-27 12:34:21 +00:00
|
|
|
uint32_t get_itunes_int32(char* value, int count)
|
2007-06-16 18:19:51 +00:00
|
|
|
{
|
|
|
|
static const char hexdigits[] = "0123456789ABCDEF";
|
|
|
|
const char* c;
|
|
|
|
int r = 0;
|
|
|
|
|
|
|
|
while (count-- > 0)
|
|
|
|
{
|
2011-06-17 04:49:54 +00:00
|
|
|
while (isspace(*value))
|
|
|
|
{
|
|
|
|
value++;
|
|
|
|
}
|
2007-06-16 18:19:51 +00:00
|
|
|
|
|
|
|
while (*value && !isspace(*value))
|
|
|
|
{
|
|
|
|
value++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-17 04:49:54 +00:00
|
|
|
while (isspace(*value))
|
|
|
|
{
|
|
|
|
value++;
|
|
|
|
}
|
2007-06-16 18:19:51 +00:00
|
|
|
|
|
|
|
while (*value && ((c = strchr(hexdigits, toupper(*value))) != NULL))
|
|
|
|
{
|
|
|
|
r = (r << 4) | (c - hexdigits);
|
|
|
|
value++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
2011-03-16 21:24:07 +00:00
|
|
|
|
|
|
|
/* Skip an ID3v2 tag if it can be found. We assume the tag is located at the
|
|
|
|
* start of the file, which should be true in all cases where we need to skip it.
|
|
|
|
* Returns true if successfully skipped or not skipped, and false if
|
|
|
|
* something went wrong while skipping.
|
|
|
|
*/
|
|
|
|
bool skip_id3v2(int fd, struct mp3entry *id3)
|
|
|
|
{
|
|
|
|
char buf[4];
|
|
|
|
|
|
|
|
read(fd, buf, 4);
|
|
|
|
if (memcmp(buf, "ID3", 3) == 0)
|
|
|
|
{
|
|
|
|
/* We have found an ID3v2 tag at the start of the file - find its
|
|
|
|
length and then skip it. */
|
|
|
|
if ((id3->first_frame_offset = getid3v2len(fd)) == 0)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if ((lseek(fd, id3->first_frame_offset, SEEK_SET) < 0))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
lseek(fd, 0, SEEK_SET);
|
|
|
|
id3->first_frame_offset = 0;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-16 18:19:51 +00:00
|
|
|
/* Parse the tag (the name-value pair) and fill id3 and buffer accordingly.
|
|
|
|
* String values to keep are written to buf. Returns number of bytes written
|
|
|
|
* to buf (including end nil).
|
|
|
|
*/
|
|
|
|
long parse_tag(const char* name, char* value, struct mp3entry* id3,
|
|
|
|
char* buf, long buf_remaining, enum tagtype type)
|
|
|
|
{
|
|
|
|
long len = 0;
|
2010-05-15 21:57:17 +00:00
|
|
|
char** p;
|
2007-06-16 18:19:51 +00:00
|
|
|
|
|
|
|
if ((((strcasecmp(name, "track") == 0) && (type == TAGTYPE_APE)))
|
|
|
|
|| ((strcasecmp(name, "tracknumber") == 0) && (type == TAGTYPE_VORBIS)))
|
|
|
|
{
|
|
|
|
id3->tracknum = atoi(value);
|
|
|
|
p = &(id3->track_string);
|
|
|
|
}
|
2007-08-03 10:00:42 +00:00
|
|
|
else if (strcasecmp(name, "discnumber") == 0 || strcasecmp(name, "disc") == 0)
|
|
|
|
{
|
|
|
|
id3->discnum = atoi(value);
|
|
|
|
p = &(id3->disc_string);
|
|
|
|
}
|
2007-06-16 18:19:51 +00:00
|
|
|
else if (((strcasecmp(name, "year") == 0) && (type == TAGTYPE_APE))
|
|
|
|
|| ((strcasecmp(name, "date") == 0) && (type == TAGTYPE_VORBIS)))
|
|
|
|
{
|
|
|
|
/* Date's can be in any format in Vorbis. However most of them
|
|
|
|
* are in ISO8601 format so if we try and parse the first part
|
|
|
|
* of the tag as a number, we should get the year. If we get crap,
|
|
|
|
* then act like we never parsed it.
|
|
|
|
*/
|
|
|
|
id3->year = atoi(value);
|
|
|
|
if (id3->year < 1900)
|
|
|
|
{ /* yeah, not likely */
|
|
|
|
id3->year = 0;
|
|
|
|
}
|
|
|
|
p = &(id3->year_string);
|
|
|
|
}
|
|
|
|
else if (strcasecmp(name, "title") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->title);
|
|
|
|
}
|
|
|
|
else if (strcasecmp(name, "artist") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->artist);
|
|
|
|
}
|
|
|
|
else if (strcasecmp(name, "album") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->album);
|
|
|
|
}
|
|
|
|
else if (strcasecmp(name, "genre") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->genre_string);
|
|
|
|
}
|
|
|
|
else if (strcasecmp(name, "composer") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->composer);
|
|
|
|
}
|
|
|
|
else if (strcasecmp(name, "comment") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->comment);
|
|
|
|
}
|
|
|
|
else if (strcasecmp(name, "albumartist") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->albumartist);
|
|
|
|
}
|
|
|
|
else if (strcasecmp(name, "album artist") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->albumartist);
|
|
|
|
}
|
|
|
|
else if (strcasecmp(name, "ensemble") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->albumartist);
|
|
|
|
}
|
2007-08-08 10:19:56 +00:00
|
|
|
else if (strcasecmp(name, "grouping") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->grouping);
|
|
|
|
}
|
|
|
|
else if (strcasecmp(name, "content group") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->grouping);
|
|
|
|
}
|
|
|
|
else if (strcasecmp(name, "contentgroup") == 0)
|
|
|
|
{
|
|
|
|
p = &(id3->grouping);
|
|
|
|
}
|
2008-10-07 18:39:44 +00:00
|
|
|
else if (strcasecmp(name, "musicbrainz_trackid") == 0
|
|
|
|
|| strcasecmp(name, "http://musicbrainz.org") == 0 )
|
|
|
|
{
|
|
|
|
p = &(id3->mb_track_id);
|
|
|
|
}
|
2007-06-16 18:19:51 +00:00
|
|
|
else
|
|
|
|
{
|
2011-02-24 19:10:59 +00:00
|
|
|
parse_replaygain(name, value, id3);
|
2007-06-16 18:19:51 +00:00
|
|
|
p = NULL;
|
|
|
|
}
|
|
|
|
|
2011-02-20 16:12:05 +00:00
|
|
|
/* Do not overwrite already available metadata. Especially when reading
|
|
|
|
* tags with e.g. multiple genres / artists. This way only the first
|
|
|
|
* of multiple entries is used, all following are dropped. */
|
|
|
|
if (p!=NULL && *p==NULL)
|
2007-06-16 18:19:51 +00:00
|
|
|
{
|
|
|
|
len = strlen(value);
|
|
|
|
len = MIN(len, buf_remaining - 1);
|
2011-02-22 07:52:21 +00:00
|
|
|
len = MIN(len, ID3V2_MAX_ITEM_SIZE); /* Limit max. item size. */
|
2007-06-16 18:19:51 +00:00
|
|
|
|
|
|
|
if (len > 0)
|
|
|
|
{
|
|
|
|
len++;
|
2009-07-14 13:57:45 +00:00
|
|
|
strlcpy(buf, value, len);
|
|
|
|
*p = buf;
|
2007-06-16 18:19:51 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
len = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return len;
|
|
|
|
}
|