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
|
/* The MIT License
Copyright (c) 2013 Adrian Tan <atks@umich.edu>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#include "bcf_ordered_reader.h"
/**
* Initialize files and intervals.
*
* @input_vcf_file_name name of the input VCF file
* @intervals list of intervals, if empty, all records are selected.
*
* todo: add option for comparing if only beg1 overlaps with the interval
* this allows a mechanism such that cut up files do not contain
* a variant that straddles across a boundary in 2 separate files
* resulting in duplicates when you concatenate the files again.
*
* might be a good idea to implement this only in a specifc program that
* cuts up such files but it is also common to perform the cutting up by
* selection via index.
*
* option1 : chr1:2000-3000 is a pure overlap
* chr1:2000+3000 considers only start positions?
*
*/
BCFOrderedReader::BCFOrderedReader(std::string file_name, std::vector<GenomeInterval>& intervals)
{
this->file_name = (file_name=="+")? "-" : file_name;
file = NULL;
hdr = NULL;
idx = NULL;
tbx = NULL;
itr = NULL;
last_rid = -1;
last_pos1 = 0;
this->intervals = intervals;
interval_index = 0;
index_loaded = false;
file = hts_open(this->file_name.c_str(), "r");
if (!file)
{
fprintf(stderr, "[%s:%d %s] Cannot open %s\n", __FILE__, __LINE__, __FUNCTION__, file_name.c_str());
exit(1);
}
ftype = file->format;
if (ftype.format!=vcf && ftype.format!=bcf)
{
fprintf(stderr, "[%s:%d %s] Not a VCF/BCF file: %s\n", __FILE__, __LINE__, __FUNCTION__, file_name.c_str());
exit(1);
}
s = {0, 0, 0};
hdr = bcf_alt_hdr_read(file);
if (!hdr)
{
fprintf(stderr, "[%s:%d %s] Unable to read in header: %s\n", __FILE__, __LINE__, __FUNCTION__, file_name.c_str());
exit(1);
}
intervals_present = intervals.size()!=0;
if (ftype.format==bcf)
{
if ((idx = bcf_index_load(file_name.c_str())))
{
index_loaded = true;
}
else
{
if (intervals_present)
{
fprintf(stderr, "[E:%s] index cannot be loaded for %s for random access, ignoring specified intervals and reading from start.\n", __FUNCTION__, file_name.c_str());
}
}
}
else if (ftype.format==vcf)
{
if (ftype.compression==bgzf)
{
if ((tbx = tbx_index_load(file_name.c_str())))
{
index_loaded = true;
}
else
{
if (intervals_present)
{
fprintf(stderr, "[E:%s] index cannot be loaded for %s for random access, ignoring specified intervals and reading from start.\n", __FUNCTION__, file_name.c_str());
}
}
}
else
{
if (intervals_present)
{
fprintf(stderr, "[E:%s] no random access support for VCF file: %s\n", __FUNCTION__, file_name.c_str());
}
}
}
random_access_enabled = intervals_present && index_loaded;
};
/**
* Destructor.
*/
BCFOrderedReader::~BCFOrderedReader()
{
close();
}
/**
* Jump to interval. Returns false if not successful.
*
* @interval - string representation of interval.
*/
bool BCFOrderedReader::jump_to_interval(GenomeInterval& interval)
{
if (index_loaded)
{
intervals_present = true;
random_access_enabled = true;
intervals.clear();
intervals.push_back(interval);
interval_index = 0;
if (ftype.format==bcf)
{
intervals[interval_index++].to_string(&s);
hts_itr_destroy(itr);
itr = NULL;
itr = bcf_itr_querys(idx, hdr, s.s);
if (itr)
{
return true;
}
}
else if (ftype.format==vcf && ftype.compression==bgzf)
{
intervals[interval_index++].to_string(&s);
hts_itr_destroy(itr);
itr = NULL;
itr = tbx_itr_querys(tbx, s.s);
if (itr)
{
return true;
}
}
}
return false;
};
/**
* Gets sequence name of a record.
*/
const char* BCFOrderedReader::get_seqname(bcf1_t *v)
{
return bcf_get_chrom(hdr, v);
};
/**
* Checks if index is loaded.
*/
bool BCFOrderedReader::is_index_loaded()
{
return index_loaded;
}
/**
* Gets bcf header.
*/
bcf_hdr_t* BCFOrderedReader::get_hdr()
{
return hdr;
};
/**
* Initialize next interval.
* Returns false only if all intervals are accessed.
*/
bool BCFOrderedReader::initialize_next_interval()
{
while (interval_index!=intervals.size())
{
if (ftype.format==bcf)
{
intervals[interval_index++].to_string(&s);
hts_itr_destroy(itr);
itr = NULL;
itr = bcf_itr_querys(idx, hdr, s.s);
if (itr)
{
return true;
}
}
else if (ftype.format==vcf && ftype.compression==bgzf)
{
intervals[interval_index++].to_string(&s);
hts_itr_destroy(itr);
itr = NULL;
itr = tbx_itr_querys(tbx, s.s);
if (itr)
{
return true;
}
}
}
return false;
};
/**
* Reads next record, hides the random access of different regions from the user.
*/
bool BCFOrderedReader::read(bcf1_t *v)
{
if (random_access_enabled)
{
if (ftype.format==bcf)
{
while(true)
{
if (itr && bcf_itr_next(file, itr, v)>=0)
{
return true;
}
else if (!initialize_next_interval())
{
return false;
}
}
}
else
{
while(true)
{
if (itr && tbx_itr_next(file, tbx, itr, &s)>=0)
{
vcf_parse1(&s, hdr, v);
return true;
}
else if (!initialize_next_interval())
{
return false;
}
}
}
}
else
{
if (bcf_read(file, hdr, v)==0)
{
//checks for orderedness
//warns about unorderedness
// if (v->rid < last_rid ||
// (v->rid == last_rid && (v->pos+1)<last_pos1))
// {
// fprintf(stderr, "[W:%s] %s is unordered.\n", __FUNCTION__, file_name.c_str());
// }
// else
// {
// last_rid = bcf_get_rid(v);
// last_pos1 = bcf_get_pos1(v);
// }
return true;
}
else
{
return false;
}
}
return false;
};
/**
* Closes the file.
*/
void BCFOrderedReader::close()
{
if (file && bcf_close(file))
{
fprintf(stderr, "[%s:%d %s] Cannot close %s\n", __FILE__, __LINE__, __FUNCTION__, file_name.c_str());
exit(1);
}
file = NULL;
if (idx) hts_idx_destroy(idx);
idx = NULL;
if (tbx) tbx_destroy(tbx);
tbx = NULL;
if (hdr) bcf_hdr_destroy(hdr);
hdr = NULL;
if (itr) hts_itr_destroy(itr);
itr = NULL;
}
|