2012-10-28 02:12:18 +02:00
|
|
|
/***************************************************************************
|
|
|
|
copyright : (C) 2002 - 2008 by Scott Wheeler
|
|
|
|
email : wheeler@kde.org
|
|
|
|
***************************************************************************/
|
|
|
|
|
|
|
|
/***************************************************************************
|
|
|
|
* This library is free software; you can redistribute it and/or modify *
|
|
|
|
* it under the terms of the GNU Lesser General Public License version *
|
|
|
|
* 2.1 as published by the Free Software Foundation. *
|
|
|
|
* *
|
|
|
|
* This library 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 *
|
|
|
|
* Lesser General Public License for more details. *
|
|
|
|
* *
|
|
|
|
* You should have received a copy of the GNU Lesser General Public *
|
|
|
|
* License along with this library; if not, write to the Free Software *
|
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA *
|
|
|
|
* 02110-1301 USA *
|
|
|
|
* *
|
|
|
|
* Alternatively, this file is available under the Mozilla Public *
|
|
|
|
* License Version 1.1. You may obtain a copy of the License at *
|
|
|
|
* http://www.mozilla.org/MPL/ *
|
|
|
|
***************************************************************************/
|
|
|
|
|
|
|
|
#include <tbytevector.h>
|
|
|
|
#include <tdebug.h>
|
|
|
|
#include <tstring.h>
|
|
|
|
|
|
|
|
#include "rifffile.h"
|
2013-12-17 19:38:05 +01:00
|
|
|
#include <algorithm>
|
2012-10-28 02:12:18 +02:00
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
using namespace TagLib;
|
|
|
|
|
|
|
|
struct Chunk
|
|
|
|
{
|
|
|
|
ByteVector name;
|
|
|
|
TagLib::uint offset;
|
|
|
|
TagLib::uint size;
|
|
|
|
char padding;
|
|
|
|
};
|
|
|
|
|
|
|
|
class RIFF::File::FilePrivate
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
FilePrivate() :
|
|
|
|
endianness(BigEndian),
|
|
|
|
size(0)
|
|
|
|
{
|
|
|
|
|
|
|
|
}
|
|
|
|
Endianness endianness;
|
|
|
|
ByteVector type;
|
|
|
|
TagLib::uint size;
|
|
|
|
ByteVector format;
|
|
|
|
|
|
|
|
std::vector<Chunk> chunks;
|
|
|
|
};
|
|
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
// public members
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
RIFF::File::~File()
|
|
|
|
{
|
|
|
|
delete d;
|
|
|
|
}
|
|
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
// protected members
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
RIFF::File::File(FileName file, Endianness endianness) : TagLib::File(file)
|
|
|
|
{
|
|
|
|
d = new FilePrivate;
|
|
|
|
d->endianness = endianness;
|
|
|
|
|
|
|
|
if(isOpen())
|
|
|
|
read();
|
|
|
|
}
|
|
|
|
|
|
|
|
RIFF::File::File(IOStream *stream, Endianness endianness) : TagLib::File(stream)
|
|
|
|
{
|
|
|
|
d = new FilePrivate;
|
|
|
|
d->endianness = endianness;
|
|
|
|
|
|
|
|
if(isOpen())
|
|
|
|
read();
|
|
|
|
}
|
|
|
|
|
|
|
|
TagLib::uint RIFF::File::riffSize() const
|
|
|
|
{
|
|
|
|
return d->size;
|
|
|
|
}
|
|
|
|
|
|
|
|
TagLib::uint RIFF::File::chunkCount() const
|
|
|
|
{
|
|
|
|
return d->chunks.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
TagLib::uint RIFF::File::chunkDataSize(uint i) const
|
|
|
|
{
|
|
|
|
return d->chunks[i].size;
|
|
|
|
}
|
|
|
|
|
|
|
|
TagLib::uint RIFF::File::chunkOffset(uint i) const
|
|
|
|
{
|
|
|
|
return d->chunks[i].offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
TagLib::uint RIFF::File::chunkPadding(uint i) const
|
|
|
|
{
|
|
|
|
return d->chunks[i].padding;
|
|
|
|
}
|
|
|
|
|
|
|
|
ByteVector RIFF::File::chunkName(uint i) const
|
|
|
|
{
|
|
|
|
if(i >= chunkCount())
|
|
|
|
return ByteVector::null;
|
|
|
|
|
|
|
|
return d->chunks[i].name;
|
|
|
|
}
|
|
|
|
|
|
|
|
ByteVector RIFF::File::chunkData(uint i)
|
|
|
|
{
|
|
|
|
if(i >= chunkCount())
|
|
|
|
return ByteVector::null;
|
|
|
|
|
2015-11-24 19:36:24 +01:00
|
|
|
seek(d->chunks[i].offset);
|
2012-10-28 02:12:18 +02:00
|
|
|
return readBlock(d->chunks[i].size);
|
|
|
|
}
|
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
void RIFF::File::setChunkData(uint i, const ByteVector &data)
|
2012-10-28 02:12:18 +02:00
|
|
|
{
|
2013-08-18 04:39:33 +02:00
|
|
|
// First we update the global size
|
|
|
|
|
|
|
|
d->size += ((data.size() + 1) & ~1) - (d->chunks[i].size + d->chunks[i].padding);
|
|
|
|
insert(ByteVector::fromUInt(d->size, d->endianness == BigEndian), 4, 4);
|
2012-10-28 02:12:18 +02:00
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
// Now update the specific chunk
|
2012-10-28 02:12:18 +02:00
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
writeChunk(chunkName(i), data, d->chunks[i].offset - 8, d->chunks[i].size + d->chunks[i].padding + 8);
|
2012-10-28 02:12:18 +02:00
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
d->chunks[i].size = data.size();
|
|
|
|
d->chunks[i].padding = (data.size() & 0x01) ? 1 : 0;
|
2012-10-28 02:12:18 +02:00
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
// Now update the internal offsets
|
2012-10-28 02:12:18 +02:00
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
for(i++; i < d->chunks.size(); i++)
|
|
|
|
d->chunks[i].offset = d->chunks[i-1].offset + 8 + d->chunks[i-1].size + d->chunks[i-1].padding;
|
|
|
|
}
|
2012-10-28 02:12:18 +02:00
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
void RIFF::File::setChunkData(const ByteVector &name, const ByteVector &data)
|
|
|
|
{
|
|
|
|
setChunkData(name, data, false);
|
|
|
|
}
|
2012-10-28 02:12:18 +02:00
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
void RIFF::File::setChunkData(const ByteVector &name, const ByteVector &data, bool alwaysCreate)
|
|
|
|
{
|
|
|
|
if(d->chunks.size() == 0) {
|
|
|
|
debug("RIFF::File::setChunkData - No valid chunks found.");
|
|
|
|
return;
|
|
|
|
}
|
2012-10-28 02:12:18 +02:00
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
if(alwaysCreate && name != "LIST") {
|
|
|
|
debug("RIFF::File::setChunkData - alwaysCreate should be used for only \"LIST\" chunks.");
|
|
|
|
return;
|
|
|
|
}
|
2012-10-28 02:12:18 +02:00
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
if(!alwaysCreate) {
|
|
|
|
for(uint i = 0; i < d->chunks.size(); i++) {
|
|
|
|
if(d->chunks[i].name == name) {
|
|
|
|
setChunkData(i, data);
|
|
|
|
return;
|
|
|
|
}
|
2012-10-28 02:12:18 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Couldn't find an existing chunk, so let's create a new one.
|
|
|
|
|
|
|
|
uint i = d->chunks.size() - 1;
|
|
|
|
ulong offset = d->chunks[i].offset + d->chunks[i].size;
|
|
|
|
|
|
|
|
// First we update the global size
|
|
|
|
|
|
|
|
d->size += (offset & 1) + data.size() + 8;
|
|
|
|
insert(ByteVector::fromUInt(d->size, d->endianness == BigEndian), 4, 4);
|
|
|
|
|
|
|
|
// Now add the chunk to the file
|
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
writeChunk(name, data, offset, std::max<long>(0, length() - offset), (offset & 1) ? 1 : 0);
|
2012-10-28 02:12:18 +02:00
|
|
|
|
|
|
|
// And update our internal structure
|
|
|
|
|
|
|
|
if (offset & 1) {
|
|
|
|
d->chunks[i].padding = 1;
|
|
|
|
offset++;
|
|
|
|
}
|
|
|
|
|
|
|
|
Chunk chunk;
|
|
|
|
chunk.name = name;
|
|
|
|
chunk.size = data.size();
|
|
|
|
chunk.offset = offset + 8;
|
|
|
|
chunk.padding = (data.size() & 0x01) ? 1 : 0;
|
|
|
|
|
|
|
|
d->chunks.push_back(chunk);
|
|
|
|
}
|
|
|
|
|
2013-08-18 04:39:33 +02:00
|
|
|
void RIFF::File::removeChunk(uint i)
|
|
|
|
{
|
|
|
|
if(i >= d->chunks.size())
|
|
|
|
return;
|
2015-11-24 19:36:24 +01:00
|
|
|
|
|
|
|
std::vector<Chunk>::iterator it = d->chunks.begin();
|
|
|
|
std::advance(it, i);
|
|
|
|
|
|
|
|
const uint removeSize = it->size + it->padding + 8;
|
|
|
|
removeBlock(it->offset - 8, removeSize);
|
|
|
|
it = d->chunks.erase(it);
|
|
|
|
|
|
|
|
for(; it != d->chunks.end(); ++it)
|
|
|
|
it->offset -= removeSize;
|
2013-08-18 04:39:33 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void RIFF::File::removeChunk(const ByteVector &name)
|
|
|
|
{
|
2015-11-24 19:36:24 +01:00
|
|
|
for(int i = d->chunks.size() - 1; i >= 0; --i) {
|
2013-08-18 04:39:33 +02:00
|
|
|
if(d->chunks[i].name == name)
|
2015-11-24 19:36:24 +01:00
|
|
|
removeChunk(i);
|
2013-08-18 04:39:33 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-10-28 02:12:18 +02:00
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
// private members
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
static bool isValidChunkID(const ByteVector &name)
|
|
|
|
{
|
|
|
|
if(name.size() != 4) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
for(int i = 0; i < 4; i++) {
|
|
|
|
if(name[i] < 32 || name[i] > 127) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void RIFF::File::read()
|
|
|
|
{
|
|
|
|
bool bigEndian = (d->endianness == BigEndian);
|
|
|
|
|
|
|
|
d->type = readBlock(4);
|
|
|
|
d->size = readBlock(4).toUInt(bigEndian);
|
|
|
|
d->format = readBlock(4);
|
|
|
|
|
|
|
|
// + 8: chunk header at least, fix for additional junk bytes
|
|
|
|
while(tell() + 8 <= length()) {
|
|
|
|
ByteVector chunkName = readBlock(4);
|
|
|
|
uint chunkSize = readBlock(4).toUInt(bigEndian);
|
|
|
|
|
|
|
|
if(!isValidChunkID(chunkName)) {
|
|
|
|
debug("RIFF::File::read() -- Chunk '" + chunkName + "' has invalid ID");
|
|
|
|
setValid(false);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2013-12-17 19:38:05 +01:00
|
|
|
if(static_cast<ulonglong>(tell()) + chunkSize > static_cast<ulonglong>(length())) {
|
2012-10-28 02:12:18 +02:00
|
|
|
debug("RIFF::File::read() -- Chunk '" + chunkName + "' has invalid size (larger than the file size)");
|
|
|
|
setValid(false);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
Chunk chunk;
|
|
|
|
chunk.name = chunkName;
|
|
|
|
chunk.size = chunkSize;
|
|
|
|
chunk.offset = tell();
|
|
|
|
|
|
|
|
seek(chunk.size, Current);
|
|
|
|
|
|
|
|
// check padding
|
|
|
|
chunk.padding = 0;
|
|
|
|
long uPosNotPadded = tell();
|
|
|
|
if((uPosNotPadded & 0x01) != 0) {
|
|
|
|
ByteVector iByte = readBlock(1);
|
|
|
|
if((iByte.size() != 1) || (iByte[0] != 0)) {
|
|
|
|
// not well formed, re-seek
|
|
|
|
seek(uPosNotPadded, Beginning);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
chunk.padding = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
d->chunks.push_back(chunk);
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void RIFF::File::writeChunk(const ByteVector &name, const ByteVector &data,
|
|
|
|
ulong offset, ulong replace, uint leadingPadding)
|
|
|
|
{
|
|
|
|
ByteVector combined;
|
|
|
|
if(leadingPadding) {
|
|
|
|
combined.append(ByteVector(leadingPadding, '\x00'));
|
|
|
|
}
|
|
|
|
combined.append(name);
|
|
|
|
combined.append(ByteVector::fromUInt(data.size(), d->endianness == BigEndian));
|
|
|
|
combined.append(data);
|
|
|
|
if((data.size() & 0x01) != 0) {
|
|
|
|
combined.append('\x00');
|
|
|
|
}
|
|
|
|
insert(combined, offset, replace);
|
|
|
|
}
|