2008-12-08 05:30:24 +00:00
|
|
|
// Copyright (C) 2003-2008 Dolphin Project.
|
|
|
|
|
|
|
|
// 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, version 2.0.
|
|
|
|
|
|
|
|
// 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 2.0 for more details.
|
|
|
|
|
|
|
|
// A copy of the GPL 2.0 should have been included with the program.
|
|
|
|
// If not, see http://www.gnu.org/licenses/
|
|
|
|
|
|
|
|
// Official SVN repository and contact information can be found at
|
|
|
|
// http://code.google.com/p/dolphin-emu/
|
|
|
|
|
|
|
|
#include "Common.h"
|
|
|
|
#include "FileUtil.h"
|
2009-02-24 15:04:12 +00:00
|
|
|
#include "CDUtils.h"
|
2008-12-08 05:30:24 +00:00
|
|
|
#include "Blob.h"
|
|
|
|
#include "CompressedBlob.h"
|
|
|
|
#include "FileBlob.h"
|
|
|
|
#include "DriveBlob.h"
|
|
|
|
#include "MappedFile.h"
|
|
|
|
|
|
|
|
namespace DiscIO
|
|
|
|
{
|
|
|
|
|
|
|
|
// Provides caching and split-operation-to-block-operations facilities.
|
|
|
|
// Used for compressed blob reading and direct drive reading.
|
|
|
|
|
|
|
|
void SectorReader::SetSectorSize(int blocksize)
|
|
|
|
{
|
|
|
|
for (int i = 0; i < CACHE_SIZE; i++)
|
|
|
|
{
|
|
|
|
cache[i] = new u8[blocksize];
|
|
|
|
cache_tags[i] = (u64)(s64) - 1;
|
|
|
|
}
|
|
|
|
m_blocksize = blocksize;
|
|
|
|
}
|
|
|
|
|
|
|
|
SectorReader::~SectorReader() {
|
|
|
|
for (int i = 0; i < CACHE_SIZE; i++)
|
2009-02-22 16:48:54 +00:00
|
|
|
delete [] cache[i];
|
2008-12-08 05:30:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const u8 *SectorReader::GetBlockData(u64 block_num)
|
|
|
|
{
|
2009-02-22 16:48:54 +00:00
|
|
|
// TODO : Expand usage of the cache to more than one block :P
|
2008-12-08 05:30:24 +00:00
|
|
|
if (cache_tags[0] == block_num)
|
|
|
|
{
|
|
|
|
return cache[0];
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
GetBlock(block_num, cache[0]);
|
|
|
|
cache_tags[0] = block_num;
|
|
|
|
return cache[0];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SectorReader::Read(u64 offset, u64 size, u8* out_ptr)
|
|
|
|
{
|
|
|
|
u64 startingBlock = offset / m_blocksize;
|
|
|
|
u64 remain = size;
|
|
|
|
|
|
|
|
int positionInBlock = (int)(offset % m_blocksize);
|
|
|
|
u64 block = startingBlock;
|
|
|
|
|
|
|
|
while (remain > 0)
|
|
|
|
{
|
2009-02-22 16:48:54 +00:00
|
|
|
// Check if we are ready to do a large block read. > instead of >= so we don't bother if remain is only one block.
|
2009-02-22 16:59:22 +00:00
|
|
|
if (positionInBlock == 0 && remain > m_blocksize)
|
2009-02-22 16:48:54 +00:00
|
|
|
{
|
|
|
|
u64 num_blocks = remain / m_blocksize;
|
|
|
|
ReadMultipleAlignedBlocks(block, num_blocks, out_ptr);
|
|
|
|
block += num_blocks;
|
|
|
|
out_ptr += num_blocks * m_blocksize;
|
|
|
|
remain -= num_blocks * m_blocksize;
|
2009-02-22 16:59:22 +00:00
|
|
|
continue;
|
2009-02-22 16:48:54 +00:00
|
|
|
}
|
2008-12-08 05:30:24 +00:00
|
|
|
|
|
|
|
u32 toCopy = m_blocksize - positionInBlock;
|
|
|
|
if (toCopy >= remain)
|
|
|
|
{
|
2009-02-22 16:48:54 +00:00
|
|
|
const u8* data = GetBlockData(block);
|
|
|
|
if (!data)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Yay, we are done!
|
2008-12-08 05:30:24 +00:00
|
|
|
memcpy(out_ptr, data + positionInBlock, (size_t)remain);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2009-02-22 16:48:54 +00:00
|
|
|
const u8* data = GetBlockData(block);
|
|
|
|
if (!data)
|
|
|
|
return false;
|
|
|
|
|
2008-12-08 05:30:24 +00:00
|
|
|
memcpy(out_ptr, data + positionInBlock, toCopy);
|
|
|
|
out_ptr += toCopy;
|
|
|
|
remain -= toCopy;
|
|
|
|
positionInBlock = 0;
|
|
|
|
block++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-02-22 16:48:54 +00:00
|
|
|
bool SectorReader::ReadMultipleAlignedBlocks(u64 block_num, u64 num_blocks, u8 *out_ptr)
|
|
|
|
{
|
|
|
|
for (int i = 0; i < num_blocks; i++)
|
|
|
|
{
|
|
|
|
const u8 *data = GetBlockData(block_num + i);
|
|
|
|
if (!data)
|
|
|
|
return false;
|
2009-02-22 16:59:22 +00:00
|
|
|
memcpy(out_ptr + i * m_blocksize, data, m_blocksize);
|
2009-02-22 16:48:54 +00:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
2008-12-08 05:30:24 +00:00
|
|
|
|
|
|
|
IBlobReader* CreateBlobReader(const char* filename)
|
|
|
|
{
|
2009-02-24 15:04:12 +00:00
|
|
|
if (cdio_is_cdrom(filename))
|
2009-02-21 23:44:40 +00:00
|
|
|
return DriveReader::Create(filename);
|
2008-12-08 05:30:24 +00:00
|
|
|
|
|
|
|
if (!File::Exists(filename))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (IsCompressedBlob(filename))
|
|
|
|
return CompressedBlobReader::Create(filename);
|
|
|
|
|
2009-02-24 19:57:29 +00:00
|
|
|
// Still here? Assume plain file - since we know it exists due to the File::Exists check above.
|
2008-12-08 05:30:24 +00:00
|
|
|
return PlainFileReader::Create(filename);
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace
|