|
|
|
|
/***************************************************************************
|
|
|
|
|
kisofile.cpp - description
|
|
|
|
|
-------------------
|
|
|
|
|
begin : Wed Oct 30 2002
|
|
|
|
|
copyright : (C) 2002 by Szombathelyi Gy<EFBFBD>gy
|
|
|
|
|
email : gyurco@users.sourceforge.net
|
|
|
|
|
***************************************************************************/
|
|
|
|
|
|
|
|
|
|
/***************************************************************************
|
|
|
|
|
* *
|
|
|
|
|
* 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. *
|
|
|
|
|
* *
|
|
|
|
|
***************************************************************************/
|
|
|
|
|
|
|
|
|
|
#include "kisofile.h"
|
|
|
|
|
#include <kdebug.h>
|
|
|
|
|
|
|
|
|
|
KIsoFile::KIsoFile( KArchive* archive, const TQString& name, int access,
|
|
|
|
|
int date, int adate,int cdate, const TQString& user, const TQString& group,
|
|
|
|
|
const TQString& symlink,int pos, int size) :
|
|
|
|
|
KArchiveFile(archive, name, access, date, user, group, symlink, pos, size) {
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
m_adate=adate;
|
|
|
|
|
m_cdate=cdate;
|
|
|
|
|
m_algo[0]=0;m_algo[1]=0;m_parms[0]=0;m_parms[1]=0;m_realsize=0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
KIsoFile::~KIsoFile(){
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void KIsoFile::setZF(char algo[2],char parms[2],int realsize) {
|
|
|
|
|
m_algo[0]=algo[0];m_algo[1]=algo[1];
|
|
|
|
|
m_parms[0]=parms[0];m_parms[1]=parms[1];
|
|
|
|
|
m_realsize=realsize;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
TQByteArray KIsoFile::data(long long pos, int count) const {
|
|
|
|
|
TQByteArray r;
|
|
|
|
|
int rlen;
|
|
|
|
|
|
|
|
|
|
if ( archive()->device()->tqat(position()+pos) &&
|
|
|
|
|
r.tqresize( ((pos+count) < size()) ? count : size()-pos) ) {
|
|
|
|
|
rlen=archive()->device()->readBlock( r.data(), r.size() );
|
|
|
|
|
if (rlen ==- 1) r.resize(0);
|
|
|
|
|
else if (rlen != (int)r.size()) r.resize(rlen);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return r;
|
|
|
|
|
}
|