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
|
/*
* Copyright (c) 2005, 2007, 2010, 2013 Genome Research Ltd.
* Author(s): James Bonfield
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* 3. Neither the names Genome Research Ltd and Wellcome Trust Sanger
* Institute nor the names of its contributors may be used to endorse
* or promote products derived from this software without specific
* prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY GENOME RESEARCH LTD AND CONTRIBUTORS "AS
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GENOME RESEARCH
* LTD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* Author(s): Simon Dear, James Bonfield
*
* Copyright (c) 1991-1992, 1996-1998 MEDICAL RESEARCH COUNCIL
* All rights reserved
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1 Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2 Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3 Neither the name of the MEDICAL RESEARCH COUNCIL, THE LABORATORY OF
* MOLECULAR BIOLOGY nor the names of its contributors may be used
* to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
/*
* Copyright (c) Medical Research Council 1994. All rights reserved.
*
* Permission to use, copy, modify and distribute this software and its
* documentation for any purpose is hereby granted without fee, provided that
* this copyright and notice appears in all copies.
*
* This file was written by James Bonfield, Simon Dear, Rodger Staden,
* as part of the Staden Package at the MRC Laboratory of Molecular
* Biology, Hills Road, Cambridge, CB2 2QH, United Kingdom.
*
* MRC disclaims all warranties with regard to this software.
*/
/*
Title: seqIOPlain
File: seqIOPlain.c
Purpose: IO of plain sequences
Last update: Tuesday Jan 15 1991
Change log:
28.11.90 SD put undesirables under STLOUIS compilation flag
15.01.91 SD new include file (opp.h)
17.09.91 LFW changed STLOUIS compilation flag to SAVE_EDITS
and AUTO_CLIP
08.09.94 JKB Plain files now also uses the ';<' and ';>' lines.
09.09.94 JKB Update to use Read instead of Seq library.
01.06.07 JKB Supports single-read fasta files; about time too!
*/
#define LINE_LENGTH 60
/*
* This module should be regarded as part of `read' since it is
* privy to the internal structure of `Read'.
*
* This library also requires use of the mach-io code for the endian
* independent machine IO.
*
* Any references to the writing or reading of edited sequences,
* or to the bottom strand were added by lfw
*/
/* ---- Imports ---- */
#ifdef HAVE_CONFIG_H
#include "io_lib_config.h"
#endif
#include <stdio.h> /* IMPORT: fopen, fclose, fseek, ftell, fgetc */
#include <ctype.h> /* IMPORT: isprint */
#include <string.h>
#include "io_lib/misc.h"
#include "io_lib/plain.h"
#include "io_lib/Read.h"
#include "io_lib/xalloc.h"
#include "io_lib/traceType.h"
#include "io_lib/stdio_hack.h"
/* ---- Constants ---- */
#define BasesPerLine 50 /* For output formatting */
/* ---- Exports ---- */
/*
* Read the plain format sequence from FILE *fp into a Read structure.
* All printing characters (as defined by ANSII C `isprint')
* are accepted, but `N's are translated to `-'s.
*
* Returns:
* Read * - Success, the Read structure read.
* NULLRead - Failure.
*/
Read *fread_pln(FILE *fp) {
Read *read = NULLRead;
off_t fileLen;
int ch;
char *leftc, *rightc, *leftcp, *rightcp;
int first = 1;
/*
* Find the length of the file.
* Use this as an overestimate of the length of the sequence.
*/
fseek(fp, (off_t) 0, 2);
if ((fileLen = ftell(fp)) > INT_MAX /*Was MAXINT2*/)
goto bail_out;
fseek(fp, (off_t) 0, 0);
/* Allocate the sequence */
if (NULLRead == (read = read_allocate(0, fileLen)))
goto bail_out;
if (NULL == (leftc = (char *)xmalloc(fileLen)))
goto bail_out;
if (NULL == (rightc = (char *)xmalloc(fileLen)))
goto bail_out;
leftcp = leftc;
rightcp = rightc;
/* Read in the bases */
read->NBases = 0;
read->format = TT_PLN;
while ((ch = fgetc(fp)) != EOF) {
if (ch == '>') {
/* Fasta format file - skip the header and load the first
* fasta sequence only. We don't even attempt to worry about
* multi-sequence file formats for now.
*/
if (!first)
break;
while(ch != '\n' && ch != EOF)
ch = fgetc(fp);
} else if (ch==';') {
/*
* ;< is left cutoff,
* ;> is right cutoff.
* Any other ';'s we can treat as a comments.
*/
ch = fgetc(fp);
if (first == 1 && ch != '<' && ch != '>') {
int d;
char type[5], name[17], line[1024];
line[0] = ch;
fgets(&line[1], 1022, fp);
if (5 == sscanf(line, "%6d%6d%6d%4c%s",
&d, &d, &d, type, name)) {
char * p;
if ((p = strchr(type, ' ')))
*p = 0;
read->format = trace_type_str2int(type);
read->trace_name = (char *)xmalloc(strlen(name)+1);
if (read->trace_name)
strcpy(read->trace_name, name);
}
}
else if (ch == '<') {
ch = fgetc(fp);
while (ch != '\n') {
*leftcp++ = ch;
ch = fgetc(fp);
}
} else if (ch == '>') {
ch = fgetc(fp);
while (ch != '\n') {
*rightcp++ = ch;
ch = fgetc(fp);
}
} else {
while(ch != '\n' && ch != EOF)
ch = fgetc(fp);
}
} else if (isprint(ch) && !isspace(ch)) {
read->base[read->NBases++] = ((ch)=='N') ? '-' : (ch);
}
first = 0;
}
*leftcp = *rightcp = 0;
read->leftCutoff = strlen(leftc);
read->rightCutoff = read->leftCutoff + read->NBases + 1;
memmove(&read->base[read->leftCutoff], read->base, read->NBases);
memmove(read->base, leftc, read->leftCutoff);
memmove(&read->base[read->leftCutoff + read->NBases],
rightc, strlen(rightc));
read->NBases += read->leftCutoff + strlen(rightc);
read->base[read->NBases] = 0;
xfree(leftc);
xfree(rightc);
/* SUCCESS */
return(read);
/* FAILURE */
bail_out:
if (read)
read_deallocate(read);
return NULLRead;
}
/*
* Read the plain format sequence with name `fn' into a Read structure.
* All printing characters (as defined by ANSII C `isprint')
* are accepted, but `N's are translated to `-'s.
*
* Returns:
* Read * - Success, the Read structure read.
* NULLRead - Failure.
*/
Read *read_pln(char *fn) {
FILE *fp;
Read *read;
/* Open file */
if ((fp = fopen(fn, "r")) == NULL)
return NULLRead;
read = fread_pln(fp);
fclose(fp);
if (read && read->trace_name == NULL &&
(read->trace_name = (char *)xmalloc(strlen(fn)+1)))
strcpy(read->trace_name, fn);
return read;
}
/*
* Write to a Plain file
*/
int fwrite_pln(FILE *fp, Read *read) {
int i, err = 0;
for (i = 0; i < read->NBases; i += LINE_LENGTH)
if (-1 == fprintf(fp, "%.*s\n",
read->NBases - i > LINE_LENGTH
? LINE_LENGTH : read->NBases - i,
&read->base[i]))
err = 1;
return err ? -1 : 0;
}
int write_pln(char *fn, Read *read) {
FILE *fp;
if ((fp = fopen(fn,"w")) == NULL)
return -1;
if (fwrite_pln(fp, read)) {
fclose(fp);
return -1;
}
fclose(fp);
return 0;
}
|