/******************************************************************************* Copyright(C) Jonas 'Sortie' Termansen 2013, 2015. This file is part of Sortix. Sortix 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 3 of the License, or (at your option) any later version. Sortix 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 Sortix. If not, see . partition.cpp Block device representing a partition of another block device. *******************************************************************************/ #include #include #include #include #include #include #include #include #include "partition.h" namespace Sortix { Partition::Partition(Ref inner_inode, off_t start, off_t length) { this->dev = (dev_t) this; this->ino = (ino_t) this; this->type = inner_inode->type; this->inode_type = INODE_TYPE_FILE; this->inner_inode = inner_inode; this->start = start; this->length = length; } Partition::~Partition() { } int Partition::sync(ioctx_t* ctx) { return inner_inode->sync(ctx); } int Partition::truncate(ioctx_t* /*ctx*/, off_t new_length) { if ( new_length != length ) return errno = EPERM, -1; return 0; } off_t Partition::lseek(ioctx_t* /*ctx*/, off_t offset, int whence) { if ( whence == SEEK_SET ) return offset; if ( whence == SEEK_END ) // TODO: Avoid underflow and overflow! return length + offset; return errno = EINVAL, -1; } ssize_t Partition::pread(ioctx_t* ctx, uint8_t* buf, size_t count, off_t off) { if ( length <= off ) return 0; off_t available = length - off; if ( (uintmax_t) available < (uintmax_t) count ) count = available; return inner_inode->pread(ctx, buf, count, start + off); } ssize_t Partition::pwrite(ioctx_t* ctx, const uint8_t* buf, size_t count, off_t off) { if ( length <= off ) return 0; off_t available = length - off; if ( (uintmax_t) available < (uintmax_t) count ) count = available; return inner_inode->pwrite(ctx, buf, count, start + off); } int Partition::stat(ioctx_t* ctx, struct stat* st) { if ( inner_inode->stat(ctx, st) < 0 ) return -1; struct stat myst; if ( !ctx->copy_from_src(&myst, st, sizeof(myst)) ) return -1; myst.st_size = length; myst.st_blocks = length / (myst.st_blksize ? myst.st_blksize : 1); if ( !ctx->copy_to_dest(st, &myst, sizeof(myst)) ) return -1; return 0; } }