forked from PacificBiosciences/DALIGNER
-
Notifications
You must be signed in to change notification settings - Fork 0
/
LAindex.c
238 lines (202 loc) · 8.17 KB
/
LAindex.c
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
/************************************************************************************\
* *
* Copyright (c) 2014, Dr. Eugene W. Myers (EWM). All rights reserved. *
* *
* Redistribution and use in source and binary forms, with or without modification, *
* are permitted provided that the following conditions are met: *
* *
* · Redistributions of source code must retain the above copyright notice, this *
* list of conditions and the following disclaimer. *
* *
* · 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. *
* *
* · The name of EWM may not be used to endorse or promote products derived from *
* this software without specific prior written permission. *
* *
* THIS SOFTWARE IS PROVIDED BY EWM ”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 EWM 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. *
* *
* For any issues regarding this software and its use, contact EWM at: *
* *
* Eugene W. Myers Jr. *
* Bautzner Str. 122e *
* 01099 Dresden *
* GERMANY *
* Email: gene.myers@gmail.com *
* *
\************************************************************************************/
/*******************************************************************************************
*
* Create an index with extension .las.idx for a .las file.
* Utility expects the .las file to be sorted.
* Header contains total # of trace points, max # of trace points for
* a given overlap, max # of trace points in all the overlaps for a given aread, and
* max # of overlaps for a given aread. The remainder are the offsets into each pile.
*
* Author: Gene Myers
* Date : Sept 2015
*
*******************************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include "DB.h"
#include "align.h"
static char *Usage = "[-v] <source:las> ...";
#define MEMORY 1000 // How many megabytes for output buffer
int main(int argc, char *argv[])
{ char *iblock;
FILE *input, *output;
int64 novl, bsize, ovlsize, ptrsize;
int tspace, tbytes;
char *pwd, *root;
int64 tmax, ttot;
int64 omax, smax;
int64 odeg, sdeg;
int i;
int VERBOSE;
// Process options
{ int j, k;
int flags[128];
ARG_INIT("LAindex")
j = 1;
for (i = 1; i < argc; i++)
if (argv[i][0] == '-')
{ ARG_FLAGS("v") }
else
argv[j++] = argv[i];
argc = j;
VERBOSE = flags['v'];
if (argc <= 1)
{ fprintf(stderr,"Usage: %s %s\n",Prog_Name,Usage);
exit (1);
}
}
// For each file do
ptrsize = sizeof(void *);
ovlsize = sizeof(Overlap) - ptrsize;
bsize = MEMORY * 1000000ll;
iblock = (char *) Malloc(bsize + ptrsize,"Allocating input block");
if (iblock == NULL)
exit (1);
iblock += ptrsize;
for (i = 1; i < argc; i++)
{ pwd = PathTo(argv[i]);
root = Root(argv[i],".las");
input = Fopen(Catenate(pwd,"/",root,".las"),"r");
if (input == NULL)
exit (1);
if (fread(&novl,sizeof(int64),1,input) != 1)
SYSTEM_ERROR
if (fread(&tspace,sizeof(int),1,input) != 1)
SYSTEM_ERROR
if (tspace <= TRACE_XOVR)
tbytes = sizeof(uint8);
else
tbytes = sizeof(uint16);
output = Fopen(Catenate(pwd,"/.",root,".las.idx"),"w");
if (output == NULL)
exit (1);
free(pwd);
free(root);
if (VERBOSE)
{ printf(" Indexing %s: ",root);
Print_Number(novl,0,stdout);
printf(" records ... ");
fflush(stdout);
}
fwrite(&novl,sizeof(int64),1,output);
fwrite(&novl,sizeof(int64),1,output);
fwrite(&novl,sizeof(int64),1,output);
fwrite(&novl,sizeof(int64),1,output);
{ int j, alst;
Overlap *w;
int64 tsize;
int64 optr;
char *iptr, *itop;
int64 tlen;
optr = sizeof(int64) + sizeof(int32);
iptr = iblock;
itop = iblock + fread(iblock,1,bsize,input);
alst = -1;
odeg = sdeg = 0;
omax = smax = 0;
tmax = ttot = 0;
for (j = 0; j < novl; j++)
{ if (iptr + ovlsize > itop)
{ int64 remains = itop-iptr;
if (remains > 0)
memcpy(iblock,iptr,remains);
iptr = iblock;
itop = iblock + remains;
itop += fread(itop,1,bsize-remains,input);
}
w = (Overlap *) (iptr - ptrsize);
tlen = w->path.tlen;
if (alst < 0)
{ fwrite(&optr,sizeof(int64),1,output);
alst = w->aread;
}
else
while (alst < w->aread)
{ if (sdeg > smax)
smax = sdeg;
if (odeg > omax)
omax = odeg;
fwrite(&optr,sizeof(int64),1,output);
odeg = sdeg = 0;
alst += 1;
}
if (tlen > tmax)
tmax = tlen;
ttot += tlen;
odeg += 1;
sdeg += tlen;
iptr += ovlsize;
tsize = tlen*tbytes;
if (iptr + tsize > itop)
{ int64 remains = itop-iptr;
if (remains > 0)
memcpy(iblock,iptr,remains);
iptr = iblock;
itop = iblock + remains;
itop += fread(itop,1,bsize-remains,input);
}
optr += ovlsize + tsize;
iptr += tsize;
}
fwrite(&optr,sizeof(int64),1,output);
}
if (sdeg > smax)
smax = sdeg;
if (odeg > omax)
omax = odeg;
rewind(output);
fwrite(&omax,sizeof(int64),1,output);
fwrite(&ttot,sizeof(int64),1,output);
fwrite(&smax,sizeof(int64),1,output);
fwrite(&tmax,sizeof(int64),1,output);
if (VERBOSE)
{ Print_Number(ttot,0,stdout);
printf(" trace points\n");
fflush(stdout);
}
fclose(input);
fclose(output);
}
free(iblock-ptrsize);
exit (0);
}