2 * rcracki_mt is a multithreaded implementation and fork of the original
5 * Copyright 2010 Martin Westergaard Jørgensen <martinwj2005@gmail.com>
6 * Copyright 2010 Daniël Niggebrugge <niggebrugge@fox-it.com>
7 * Copyright 2010 James Nobis <frt@quelrod.net>
9 * This file is part of racrcki_mt.
11 * rcracki_mt is free software: you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License as published by
13 * the Free Software Foundation, either version 2 of the License, or
14 * (at your option) any later version.
16 * rcracki_mt is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 * GNU General Public License for more details.
21 * You should have received a copy of the GNU General Public License
22 * along with rcracki_mt. If not, see <http://www.gnu.org/licenses/>.
25 #include "RTI2Reader.h"
29 RTI2Header *RTI2Reader::m_pHeader = NULL;
30 RTI2Reader::RTI2Reader(string Filename)
32 //m_pIndexPos = NULL, m_pChainPos = NULL;;
34 m_pFile = fopen(Filename.c_str(), "rb");
37 printf("Unable to open file %s", Filename.c_str());
40 FILE *pFileIndex = fopen(Filename.append(".index").c_str(), "rb");
41 if(pFileIndex == NULL)
43 printf("Unable to open file %s", Filename.append(".index").c_str());
48 unsigned int len = GetFileLen(pFileIndex);
49 fseek(pFileIndex, 0, SEEK_SET);
51 m_pIndex = new unsigned char[len];
52 if(fread(m_pIndex, 1, len, pFileIndex) != len)
54 printf("Error while reading index file");
58 m_pHeader = new RTI2Header();
59 memcpy(m_pHeader, m_pIndex, sizeof(RTI2Header));
60 m_pHeader->m_cppos = (unsigned int*)(m_pIndex + 8);
61 m_pHeader->prefixstart = *(uint64*)(m_pIndex + 8 + (m_pHeader->rti_cplength * 4));
62 m_chainsizebytes = ceil((float)(m_pHeader->rti_startptlength + m_pHeader->rti_endptlength + m_pHeader->rti_cplength) / 8); // Get the size of each chain in bytes
63 m_indexrowsizebytes = ceil((float)m_pHeader->rti_index_numchainslength / 8);
65 fseek(m_pFile, 0, SEEK_END);
67 fseek(m_pFile, 0, SEEK_SET);
68 if(len % m_chainsizebytes > 0)
70 printf("Invalid filesize %u\n", len);
77 RTI2Reader::~RTI2Reader(void)
79 if(m_pIndex != NULL) delete m_pIndex;
80 if(m_pFile != NULL) fclose(m_pFile);
84 unsigned int RTI2Reader::GetChainsLeft()
86 int len = GetFileLen(m_pFile);
87 return len / m_chainsizebytes - m_chainPosition;
90 int RTI2Reader::ReadChains(unsigned int &numChains, RainbowChainO *pData)
92 if(strncmp(m_pHeader->header, "RTI2", 4) != 0)
97 unsigned char *pNumChains = m_pIndex + (m_pHeader->rti_cplength * 4) + 16; // Pointer into the index containing info about how many numbers are in the first chain prefix
99 unsigned int indexRow = 0; // Current offset into the index
100 unsigned int curRowPosition = 0;
102 while(true) // Fast forward to current position
104 // ALERT: Possible problem here if m_indexrowsizebytes > 1 as pNumChains is a unsigned char.
105 unsigned int NumChainsInRow = (unsigned int)*(pNumChains + indexRow * m_indexrowsizebytes);
106 if(m_indexrowsizebytes > 1)
108 //XXX Have to find a solution to this problem
109 printf( "FATAL: m_indexrowsizebytes > 1: %d\n", m_indexrowsizebytes );
112 if(i + NumChainsInRow > m_chainPosition)
114 curRowPosition = m_chainPosition - i;
115 break; // The current position is somewhere within this prefix
121 uint64 chainrow = 0; // Buffer to store a single read chain
122 unsigned int chainsProcessed = 0; // Number of chains processed
124 // ALERT: same problem with unsigned char here.
125 unsigned int NumChainsInRow = *(pNumChains + indexRow);
126 while(chainsProcessed < numChains && fread(&chainrow, 1, m_chainsizebytes, m_pFile) == m_chainsizebytes)
128 if(curRowPosition >= NumChainsInRow)
129 { // Skip to next index row position
132 NumChainsInRow = *(pNumChains + indexRow);
134 while(NumChainsInRow == 0) // We skip forward until we hit a index with > 0 chains
137 NumChainsInRow = *(pNumChains + indexRow);
140 // Load the starting point from the data
141 pData[chainsProcessed].nIndexS = chainrow << 64 - m_pHeader->rti_startptlength;
142 pData[chainsProcessed].nIndexS = pData[chainsProcessed].nIndexS >> 64 - m_pHeader->rti_startptlength;
144 // Load the ending point prefix
145 pData[chainsProcessed].nIndexE = m_pHeader->prefixstart + indexRow << m_pHeader->rti_endptlength;
146 // Append the ending point suffix
147 pData[chainsProcessed].nIndexE |= (chainrow & (0xFFFFFFFFFFFFFFFFllu >> m_pHeader->rti_cplength)) >> m_pHeader->rti_startptlength;
148 //pData[chainsProcessed].nCheckPoint = (chainrow >> m_pHeader->rti_startptlength + m_pHeader->rti_endptlength);
152 numChains = chainsProcessed;
153 m_chainPosition += numChains;