-
Notifications
You must be signed in to change notification settings - Fork 285
Expand file tree
/
Copy pathkmerindexdb.cpp
More file actions
337 lines (300 loc) · 17.1 KB
/
kmerindexdb.cpp
File metadata and controls
337 lines (300 loc) · 17.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
#include "LinsearchIndexReader.h"
#include "FileUtil.h"
#include "PrefilteringIndexReader.h"
#include "Debug.h"
#include "Timer.h"
#include "NucleotideMatrix.h"
#include "SubstitutionMatrix.h"
#include "ReducedMatrix.h"
#include "KmerIndex.h"
#include "kmersearch.h"
#ifndef SIZE_T_MAX
#define SIZE_T_MAX ((size_t) -1)
#endif
extern const char* version;
extern const char* index_version_compatible;
int kmerindexdb(int argc, const char **argv, const Command &command) {
MMseqsMPI::init(argc, argv);
Parameters &par = Parameters::getInstance();
setLinearFilterDefault(&par);
par.parseParameters(argc, argv, command, true, 0, MMseqsParameter::COMMAND_CLUSTLINEAR);
DBReader<unsigned int> seqDbr(par.db1.c_str(), par.db1Index.c_str(), par.threads, DBReader<unsigned int>::USE_INDEX|DBReader<unsigned int>::USE_DATA);
seqDbr.open(DBReader<unsigned int>::NOSORT);
int querySeqType = seqDbr.getDbtype();
setKmerLengthAndAlphabet(par, seqDbr.getAminoAcidDBSize(), querySeqType);
par.printParameters(command.cmd, argc, argv, *command.params);
Debug(Debug::INFO) << "Database size: " << seqDbr.getSize() << " type: " << seqDbr.getDbTypeName() << "\n";
std::string indexDB = LinsearchIndexReader::indexName(par.db2);
if (par.checkCompatible > 0 && FileUtil::fileExists(indexDB.c_str())) {
Debug(Debug::INFO) << "Check index " << indexDB << "\n";
DBReader<unsigned int> index(indexDB.c_str(), (indexDB + ".index").c_str(), par.threads, DBReader<unsigned int>::USE_INDEX|DBReader<unsigned int>::USE_DATA);
index.open(DBReader<unsigned int>::NOSORT);
if (Parameters::isEqualDbtype(seqDbr.getDbtype(), Parameters::DBTYPE_NUCLEOTIDES) && par.PARAM_ALPH_SIZE.wasSet) {
Debug(Debug::WARNING) << "Alphabet size is not taken into account for compatibility check in nucleotide search.\n";
}
std::string check;
const bool compatible = LinsearchIndexReader::checkIfIndexFile(&index) && (check = LinsearchIndexReader::findIncompatibleParameter(index, par, seqDbr.getDbtype())) == "";
index.close();
seqDbr.close();
if (compatible) {
Debug(Debug::INFO) << "Index is already up to date and compatible. Force recreation with --check-compatibility 0 parameter.\n";
return EXIT_SUCCESS;
} else {
if (par.checkCompatible == 2) {
Debug(Debug::ERROR) << "Index is incompatible. Incompatible parameter: " << check << "\n";
return EXIT_FAILURE;
} else {
Debug(Debug::WARNING) << "Index is incompatible and will be recreated. Incompatible parameter: " << check << "\n";
}
}
}
BaseMatrix *subMat;
if (Parameters::isEqualDbtype(querySeqType, Parameters::DBTYPE_NUCLEOTIDES)) {
subMat = new NucleotideMatrix(par.seedScoringMatrixFile.values.nucleotide().c_str(), 1.0, 0.0);
}else {
if (par.alphabetSize.values.aminoacid() == 21) {
subMat = new SubstitutionMatrix(par.seedScoringMatrixFile.values.aminoacid().c_str(), 2.0, 0.0);
} else {
SubstitutionMatrix sMat(par.seedScoringMatrixFile.values.aminoacid().c_str(), 2.0, 0.0);
subMat = new ReducedMatrix(sMat.probMatrix, sMat.subMatrixPseudoCounts, sMat.aa2num, sMat.num2aa, sMat.alphabetSize, par.alphabetSize.values.aminoacid(), 2.0);
}
}
//seqDbr.readMmapedDataInMemory();
// memoryLimit in bytes
size_t memoryLimit=Util::computeMemory(par.splitMemoryLimit);
Debug(Debug::INFO) << "\n";
float kmersPerSequenceScale = (Parameters::isEqualDbtype(querySeqType, Parameters::DBTYPE_NUCLEOTIDES)) ?
par.kmersPerSequenceScale.values.nucleotide() : par.kmersPerSequenceScale.values.aminoacid();
size_t totalKmers = computeKmerCount(seqDbr, par.kmerSize, par.kmersPerSequence, kmersPerSequenceScale);
totalKmers *= par.pickNbest;
size_t totalSizeNeeded = computeMemoryNeededLinearfilter<short>(totalKmers);
// compute splits
size_t splits = static_cast<size_t>(std::ceil(static_cast<float>(totalSizeNeeded) / memoryLimit));
size_t totalKmersPerSplit = std::max(static_cast<size_t>(1024+1),
static_cast<size_t>(std::min(totalSizeNeeded, memoryLimit)/sizeof(KmerPosition<short>))+1);
std::vector<std::pair<size_t, size_t>> hashRanges = setupKmerSplits<short>(par, subMat, seqDbr, totalKmersPerSplit, splits);
Debug(Debug::INFO) << "Process file into " << hashRanges.size() << " parts\n";
std::vector<std::string> splitFiles;
KmerPosition<short> *hashSeqPair = NULL;
size_t writePos = 0;
size_t mpiRank = 0;
size_t adjustedKmerSize = par.kmerSize;
#ifdef HAVE_MPI
splits = std::max(static_cast<size_t>(MMseqsMPI::numProc), splits);
size_t fromSplit = 0;
size_t splitCount = 1;
mpiRank = MMseqsMPI::rank;
// if split size is great than nodes than we have to
// distribute all splits equally over all nodes
unsigned int * splitCntPerProc = new unsigned int[MMseqsMPI::numProc];
memset(splitCntPerProc, 0, sizeof(unsigned int) * MMseqsMPI::numProc);
for(size_t i = 0; i < splits; i++){
splitCntPerProc[i % MMseqsMPI::numProc] += 1;
}
for(int i = 0; i < MMseqsMPI::rank; i++){
fromSplit += splitCntPerProc[i];
}
splitCount = splitCntPerProc[MMseqsMPI::rank];
delete[] splitCntPerProc;
for(size_t split = fromSplit; split < fromSplit+splitCount; split++) {
std::string splitFileName = par.db2 + "_split_" +SSTR(split);
size_t splitKmerCount = (splits > 1) ? static_cast<size_t >(static_cast<double>(totalKmers/splits) * 1.2) : totalKmers;
int range=MathUtil::ceilIntDivision(USHRT_MAX+1, static_cast<int>(splits));
size_t rangeFrom = split*range;
size_t rangeTo = (splits == 1) ? SIZE_T_MAX : splits*range+range;
KmerSearch::ExtractKmerAndSortResult kmerRet = KmerSearch::extractKmerAndSort(splitKmerCount, rangeFrom, rangeTo, seqDbr, par, subMat);
hashSeqPair = kmerRet.kmers;
// assign rep. sequence to same kmer members
// The longest sequence is the first since we sorted by kmer, seq.Len and id
if(Parameters::isEqualDbtype(seqDbr.getDbtype(), Parameters::DBTYPE_NUCLEOTIDES)){
writePos = LinsearchIndexReader::pickCenterKmer<Parameters::DBTYPE_NUCLEOTIDES>(hashSeqPair, splitKmerCount);
}else{
writePos = LinsearchIndexReader::pickCenterKmer<Parameters::DBTYPE_AMINO_ACIDS>(hashSeqPair, splitKmerCount);
}
LinsearchIndexReader::writeKmerIndexToDisk(splitFileName, hashSeqPair, writePos);
}
MPI_Barrier(MPI_COMM_WORLD);
if(mpiRank == 0){
for(size_t split = 0; split < splits; split++) {
std::string splitFileName = par.db2 + "_split_" +SSTR(split);
splitFiles.push_back(splitFileName);
}
}
#else
for(size_t split = 0; split < hashRanges.size(); split++) {
Debug(Debug::INFO) << "Generate k-mers list " << split <<"\n";
std::string splitFileName = par.db2 + "_split_" +SSTR(split);
KmerSearch::ExtractKmerAndSortResult kmerRet = KmerSearch::extractKmerAndSort(totalKmersPerSplit, hashRanges[split].first, hashRanges[split].second, seqDbr, par, subMat);
hashSeqPair = kmerRet.kmers;
adjustedKmerSize = std::max(adjustedKmerSize, kmerRet.adjustedKmer);
// assign rep. sequence to same kmer members
// The longest sequence is the first since we sorted by kmer, seq.Len and id
if(Parameters::isEqualDbtype(seqDbr.getDbtype(), Parameters::DBTYPE_NUCLEOTIDES)){
writePos = LinsearchIndexReader::pickCenterKmer<Parameters::DBTYPE_NUCLEOTIDES>(hashSeqPair, totalKmersPerSplit);
}else{
writePos = LinsearchIndexReader::pickCenterKmer<Parameters::DBTYPE_AMINO_ACIDS>(hashSeqPair, totalKmersPerSplit);
}
if(splits > 1){
LinsearchIndexReader::writeKmerIndexToDisk(splitFileName, hashSeqPair, writePos);
delete [] hashSeqPair;
hashSeqPair = NULL;
}
splitFiles.push_back(splitFileName);
}
#endif
if(mpiRank == 0){
// write result
DBWriter dbw(indexDB.c_str(), (indexDB+".index").c_str(), 1, par.compressed, Parameters::DBTYPE_INDEX_DB );
dbw.open();
Debug(Debug::INFO) << "Write VERSION (" << PrefilteringIndexReader::VERSION << ")\n";
dbw.writeData((char *) index_version_compatible, strlen(index_version_compatible) * sizeof(char), PrefilteringIndexReader::VERSION, 0);
dbw.alignToPageSize();
Debug(Debug::INFO) << "Write META (" << PrefilteringIndexReader::META << ")\n";
const int mask = par.maskMode > 0;
int spacedKmer = 0;
if (Parameters::isEqualDbtype(querySeqType, Parameters::DBTYPE_NUCLEOTIDES)) {
spacedKmer = par.spacedKmer.values.nucleotide();
} else {
spacedKmer = par.spacedKmer.values.aminoacid();
}
const bool sameDB = (par.db1 == par.db2);
const int headers1 = 1;
const int headers2 = (sameDB) ? 1 : 0;
const int seqType = seqDbr.getDbtype();
const int srcSeqType = FileUtil::parseDbType(par.db2.c_str());
// Reuse the compBiasCorr field to store the adjustedKmerSize, It is not needed in the linsearch
int metadata[] = {static_cast<int>(par.maxSeqLen), static_cast<int>(par.kmerSize), static_cast<int>(adjustedKmerSize), subMat->alphabetSize, mask, spacedKmer, 0, seqType, srcSeqType, headers1, headers2};
char *metadataptr = (char *) &metadata;
dbw.writeData(metadataptr, sizeof(metadata), PrefilteringIndexReader::META, 0);
dbw.alignToPageSize();
Timer timer;
if(splits > 1) {
seqDbr.unmapData();
if(Parameters::isEqualDbtype(seqDbr.getDbtype(), Parameters::DBTYPE_NUCLEOTIDES)) {
LinsearchIndexReader::mergeAndWriteIndex<Parameters::DBTYPE_NUCLEOTIDES>(dbw, splitFiles, subMat->alphabetSize, adjustedKmerSize);
}else{
LinsearchIndexReader::mergeAndWriteIndex<Parameters::DBTYPE_AMINO_ACIDS>(dbw, splitFiles, subMat->alphabetSize, adjustedKmerSize);
}
} else {
if(Parameters::isEqualDbtype(seqDbr.getDbtype(), Parameters::DBTYPE_NUCLEOTIDES)) {
LinsearchIndexReader::writeIndex<Parameters::DBTYPE_NUCLEOTIDES>(dbw, hashSeqPair, writePos, subMat->alphabetSize, adjustedKmerSize);
}else{
LinsearchIndexReader::writeIndex<Parameters::DBTYPE_AMINO_ACIDS>(dbw, hashSeqPair, writePos, subMat->alphabetSize, adjustedKmerSize);
}
}
if(hashSeqPair){
delete [] hashSeqPair;
hashSeqPair = NULL;
}
// SEQCOUNT
Debug(Debug::INFO) << "Write SEQCOUNT (" << PrefilteringIndexReader::SEQCOUNT << ")\n";
size_t tablesize = {seqDbr.getSize()};
char *tablesizePtr = (char *) &tablesize;
dbw.writeData(tablesizePtr, 1 * sizeof(size_t), PrefilteringIndexReader::SEQCOUNT, 0);
dbw.alignToPageSize();
Debug(Debug::INFO) << "Write SCOREMATRIXNAME (" << PrefilteringIndexReader::SCOREMATRIXNAME << ")\n";
char* subData = BaseMatrix::serialize(subMat->matrixName, subMat->matrixData);
dbw.writeData(subData, BaseMatrix::memorySize(subMat->matrixName, subMat->matrixData), PrefilteringIndexReader::SCOREMATRIXNAME, 0);
dbw.alignToPageSize();
free(subData);
if (par.spacedKmerPattern.empty() != false) {
Debug(Debug::INFO) << "Write SPACEDPATTERN (" << PrefilteringIndexReader::SPACEDPATTERN << ")\n";
dbw.writeData(par.spacedKmerPattern.c_str(), par.spacedKmerPattern.length(), PrefilteringIndexReader::SPACEDPATTERN, 0);
dbw.alignToPageSize();
}
seqDbr.close();
DBReader<unsigned int> dbr1(par.db1.c_str(), par.db1Index.c_str(), par.threads, DBReader<unsigned int>::USE_INDEX|DBReader<unsigned int>::USE_DATA);
dbr1.open(DBReader<unsigned int>::NOSORT);
Debug(Debug::INFO) << "Write DBR1INDEX (" << PrefilteringIndexReader::DBR1INDEX << ")\n";
char* data = DBReader<unsigned int>::serialize(dbr1);
size_t offsetIndex = dbw.getOffset(0);
dbw.writeData(data, DBReader<unsigned int>::indexMemorySize(dbr1), PrefilteringIndexReader::DBR1INDEX, 0);
dbw.alignToPageSize();
Debug(Debug::INFO) << "Write DBR1DATA (" << PrefilteringIndexReader::DBR1DATA << ")\n";
size_t offsetData = dbw.getOffset(0);
dbw.writeStart(0);
for(size_t fileIdx = 0; fileIdx < dbr1.getDataFileCnt(); fileIdx++) {
dbw.writeAdd(dbr1.getDataForFile(fileIdx), dbr1.getDataSizeForFile(fileIdx), 0);
}
dbw.writeEnd( PrefilteringIndexReader::DBR1DATA, 0);
dbw.alignToPageSize();
free(data);
if (sameDB == true) {
dbw.writeIndexEntry(PrefilteringIndexReader::DBR2INDEX, offsetIndex, DBReader<unsigned int>::indexMemorySize(dbr1)+1, 0);
dbw.writeIndexEntry(PrefilteringIndexReader::DBR2DATA, offsetData, dbr1.getTotalDataSize()+1, 0);
dbr1.close();
}else{
dbr1.close();
DBReader<unsigned int> dbr2(par.db2.c_str(), par.db2Index.c_str(), par.threads, DBReader<unsigned int>::USE_INDEX|DBReader<unsigned int>::USE_DATA);
dbr2.open(DBReader<unsigned int>::NOSORT);
Debug(Debug::INFO) << "Write DBR2INDEX (" << PrefilteringIndexReader::DBR2INDEX << ")\n";
data = DBReader<unsigned int>::serialize(dbr2);
dbw.writeData(data, DBReader<unsigned int>::indexMemorySize(dbr2), PrefilteringIndexReader::DBR2INDEX, 0);
dbw.alignToPageSize();
Debug(Debug::INFO) << "Write DBR2DATA (" << PrefilteringIndexReader::DBR2DATA << ")\n";
dbw.writeStart(0);
for(size_t fileIdx = 0; fileIdx < dbr2.getDataFileCnt(); fileIdx++) {
dbw.writeAdd(dbr2.getDataForFile(fileIdx), dbr2.getDataSizeForFile(fileIdx), 0);
}
dbw.writeEnd(PrefilteringIndexReader::DBR2DATA, 0);
dbw.alignToPageSize();
free(data);
dbr2.close();
}
{
Debug(Debug::INFO) << "Write HDR1INDEX (" << PrefilteringIndexReader::HDR1INDEX << ")\n";
DBReader<unsigned int> hdbr1(par.hdr1.c_str(), par.hdr1Index.c_str(), par.threads, DBReader<unsigned int>::USE_INDEX|DBReader<unsigned int>::USE_DATA);
hdbr1.open(DBReader<unsigned int>::NOSORT);
data = DBReader<unsigned int>::serialize(hdbr1);
size_t offsetIndex = dbw.getOffset(0);
dbw.writeData(data, DBReader<unsigned int>::indexMemorySize(hdbr1), PrefilteringIndexReader::HDR1INDEX, 0);
dbw.alignToPageSize();
Debug(Debug::INFO) << "Write HDR1DATA (" << PrefilteringIndexReader::HDR1DATA << ")\n";
size_t offsetData = dbw.getOffset(0);
dbw.writeStart(0);
for(size_t fileIdx = 0; fileIdx < hdbr1.getDataFileCnt(); fileIdx++) {
dbw.writeAdd(hdbr1.getDataForFile(fileIdx), hdbr1.getDataSizeForFile(fileIdx), 0);
}
dbw.writeEnd(PrefilteringIndexReader::HDR1DATA, 0);
dbw.alignToPageSize();
free(data);
if (sameDB == true) {
dbw.writeIndexEntry(PrefilteringIndexReader::HDR2INDEX, offsetIndex, DBReader<unsigned int>::indexMemorySize(hdbr1)+1, 0);
dbw.writeIndexEntry(PrefilteringIndexReader::HDR2DATA, offsetData, hdbr1.getTotalDataSize()+1, 0);
hdbr1.close();
}else{
hdbr1.close();
DBReader<unsigned int> hdbr2(par.hdr2.c_str(), par.hdr2Index.c_str(), par.threads, DBReader<unsigned int>::USE_INDEX|DBReader<unsigned int>::USE_DATA);
hdbr2.open(DBReader<unsigned int>::NOSORT);
Debug(Debug::INFO) << "Write HDR2INDEX (" <<PrefilteringIndexReader::HDR2INDEX << ")\n";
data = DBReader<unsigned int>::serialize(hdbr2);
dbw.writeData(data, DBReader<unsigned int>::indexMemorySize(hdbr2), PrefilteringIndexReader::HDR2INDEX, 0);
dbw.alignToPageSize();
Debug(Debug::INFO) << "Write HDR2DATA (" << PrefilteringIndexReader::HDR2DATA << ")\n";
dbw.writeStart(0);
for(size_t fileIdx = 0; fileIdx < hdbr2.getDataFileCnt(); fileIdx++) {
dbw.writeAdd(hdbr2.getDataForFile(fileIdx), hdbr2.getDataSizeForFile(fileIdx), 0);
}
dbw.writeEnd(PrefilteringIndexReader::HDR2DATA, 0);
dbw.alignToPageSize();
hdbr2.close();
free(data);
}
}
Debug(Debug::INFO) << "Write GENERATOR (" << PrefilteringIndexReader::GENERATOR << ")\n";
dbw.writeData(version, strlen(version), PrefilteringIndexReader::GENERATOR, 0);
dbw.alignToPageSize();
Debug(Debug::INFO) << "Time for fill: " << timer.lap() << "\n";
// add missing entries to the result (needed for clustering)
dbw.close();
}
// free memory
delete subMat;
if(mpiRank != 0){
if(hashSeqPair){
delete [] hashSeqPair;
}
seqDbr.close();
}
return EXIT_SUCCESS;
}