-
Notifications
You must be signed in to change notification settings - Fork 18
/
Copy pathdexqv.c
167 lines (128 loc) · 4.17 KB
/
dexqv.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
/*******************************************************************************************
*
* Compressor for .quiv files, customized Huffman codes for each stream based on the
* histogram of values occuring in the given file. The two low complexity streams
* (deletionQV and substitutionQV) use a Huffman coding of the run length of the prevelant
* character.
*
* Author: Gene Myers
* Date: Jan 18, 2014
*
********************************************************************************************/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <unistd.h>
#include <stdint.h>
#include "DB.h"
static char *Usage = "[-vkl] <path:quiva> ...";
int main(int argc, char* argv[])
{ int VERBOSE;
int KEEP;
int LOSSY;
{ int i, j, k;
int flags[128];
ARG_INIT("dexqv")
j = 1;
for (i = 1; i < argc; i++)
if (argv[i][0] == '-')
{ ARG_FLAGS("vkl") }
else
argv[j++] = argv[i];
argc = j;
VERBOSE = flags['v'];
KEEP = flags['k'];
LOSSY = flags['l'];
if (argc == 1)
{ fprintf(stderr,"Usage: %s %s\n",Prog_Name,Usage);
fprintf(stderr,"\n");
fprintf(stderr," -k: do *not* remove the .quiva file on completion.\n");
fprintf(stderr," -l: use lossy compression (not recommended).\n");
exit (1);
}
}
// For each .quiva file to be compressed:
{ int i;
for (i = 1; i < argc; i++)
{ char *pwd, *root;
uint16 half;
FILE *input, *output;
QVcoding *coding;
pwd = PathTo(argv[i]);
root = Root(argv[i],".quiva");
input = Fopen(Catenate(pwd,"/",root,".quiva"),"r");
if (input == NULL)
exit (1);
output = Fopen(Catenate(pwd,"/",root,".dexqv"),"w");
if (output == NULL)
exit (1);
if (VERBOSE)
{ fprintf(stderr,"Processing '%s' ...\n",root);
fflush(stderr);
}
// Scan the file collecting statistics for Huffman schemes
Set_QV_Line(0);
QVcoding_Scan(input,INT32_MAX,NULL);
// Create and output the encoding schemes
coding = Create_QVcoding(LOSSY);
{ char *slash, *read; // Get header line prefix from first line
rewind (input);
Read_Lines(input,1);
read = QVentry();
slash = index(read+1,'/');
coding->prefix = (char *) malloc((slash-read)+1);
if (coding->prefix == NULL)
{ fprintf(stderr,"%s: Out of memory (Allocating header prefix)\n",Prog_Name);
exit (1);
}
*slash = '\0';
strcpy(coding->prefix,read);
*slash = '/';
}
half = 0x55aa;
fwrite(&half,sizeof(uint16),1,output);
Write_QVcoding(output,coding);
// For each entry do
{ int lwell;
rewind (input);
Set_QV_Line(0);
lwell = 0;
while (Read_Lines(input,1) > 0)
{ int well, beg, end, qv;
char *slash;
uint8 byte;
// Interpret the header, encode and write out the fields
slash = index(QVentry(),'/');
sscanf(slash+1,"%d/%d_%d RQ=0.%d\n",&well,&beg,&end,&qv);
while (well - lwell >= 255)
{ byte = 0xff;
fwrite(&byte,1,1,output);
lwell += 255;
}
byte = (uint8) (well-lwell);
fwrite(&byte,1,1,output);
lwell = well;
fwrite(&beg,sizeof(int),1,output);
fwrite(&end,sizeof(int),1,output);
fwrite(&qv,sizeof(int),1,output);
Compress_Next_QVentry(input,output,coding,LOSSY);
}
}
// Clean up for the next file
Free_QVcoding(coding);
fclose(input);
fclose(output);
if (!KEEP)
unlink(Catenate(pwd,"/",root,".quiva"));
free(root);
free(pwd);
if (VERBOSE)
{ fprintf(stderr,"Done\n");
fflush(stderr);
}
}
}
free(QVentry());
exit (0);
}