diff --git a/LICENSE b/LICENSE index cf1ab25..261eeb9 100644 --- a/LICENSE +++ b/LICENSE @@ -1,24 +1,201 @@ -This is free and unencumbered software released into the public domain. - -Anyone is free to copy, modify, publish, use, compile, sell, or -distribute this software, either in source code form or as a compiled -binary, for any purpose, commercial or non-commercial, and by any -means. - -In jurisdictions that recognize copyright laws, the author or authors -of this software dedicate any and all copyright interest in the -software to the public domain. We make this dedication for the benefit -of the public at large and to the detriment of our heirs and -successors. We intend this dedication to be an overt act of -relinquishment in perpetuity of all present and future rights to this -software under copyright law. - -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 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. - -For more information, please refer to + Apache License + Version 2.0, January 2004 + http://www.apache.org/licenses/ + + TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION + + 1. Definitions. + + "License" shall mean the terms and conditions for use, reproduction, + and distribution as defined by Sections 1 through 9 of this document. + + "Licensor" shall mean the copyright owner or entity authorized by + the copyright owner that is granting the License. + + "Legal Entity" shall mean the union of the acting entity and all + other entities that control, are controlled by, or are under common + control with that entity. For the purposes of this definition, + "control" means (i) the power, direct or indirect, to cause the + direction or management of such entity, whether by contract or + otherwise, or (ii) ownership of fifty percent (50%) or more of the + outstanding shares, or (iii) beneficial ownership of such entity. + + "You" (or "Your") shall mean an individual or Legal Entity + exercising permissions granted by this License. + + "Source" form shall mean the preferred form for making modifications, + including but not limited to software source code, documentation + source, and configuration files. + + "Object" form shall mean any form resulting from mechanical + transformation or translation of a Source form, including but + not limited to compiled object code, generated documentation, + and conversions to other media types. + + "Work" shall mean the work of authorship, whether in Source or + Object form, made available under the License, as indicated by a + copyright notice that is included in or attached to the work + (an example is provided in the Appendix below). + + "Derivative Works" shall mean any work, whether in Source or Object + form, that is based on (or derived from) the Work and for which the + editorial revisions, annotations, elaborations, or other modifications + represent, as a whole, an original work of authorship. For the purposes + of this License, Derivative Works shall not include works that remain + separable from, or merely link (or bind by name) to the interfaces of, + the Work and Derivative Works thereof. + + "Contribution" shall mean any work of authorship, including + the original version of the Work and any modifications or additions + to that Work or Derivative Works thereof, that is intentionally + submitted to Licensor for inclusion in the Work by the copyright owner + or by an individual or Legal Entity authorized to submit on behalf of + the copyright owner. For the purposes of this definition, "submitted" + means any form of electronic, verbal, or written communication sent + to the Licensor or its representatives, including but not limited to + communication on electronic mailing lists, source code control systems, + and issue tracking systems that are managed by, or on behalf of, the + Licensor for the purpose of discussing and improving the Work, but + excluding communication that is conspicuously marked or otherwise + designated in writing by the copyright owner as "Not a Contribution." + + "Contributor" shall mean Licensor and any individual or Legal Entity + on behalf of whom a Contribution has been received by Licensor and + subsequently incorporated within the Work. + + 2. Grant of Copyright License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + copyright license to reproduce, prepare Derivative Works of, + publicly display, publicly perform, sublicense, and distribute the + Work and such Derivative Works in Source or Object form. + + 3. Grant of Patent License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + (except as stated in this section) patent license to make, have made, + use, offer to sell, sell, import, and otherwise transfer the Work, + where such license applies only to those patent claims licensable + by such Contributor that are necessarily infringed by their + Contribution(s) alone or by combination of their Contribution(s) + with the Work to which such Contribution(s) was submitted. If You + institute patent litigation against any entity (including a + cross-claim or counterclaim in a lawsuit) alleging that the Work + or a Contribution incorporated within the Work constitutes direct + or contributory patent infringement, then any patent licenses + granted to You under this License for that Work shall terminate + as of the date such litigation is filed. + + 4. Redistribution. You may reproduce and distribute copies of the + Work or Derivative Works thereof in any medium, with or without + modifications, and in Source or Object form, provided that You + meet the following conditions: + + (a) You must give any other recipients of the Work or + Derivative Works a copy of this License; and + + (b) You must cause any modified files to carry prominent notices + stating that You changed the files; and + + (c) You must retain, in the Source form of any Derivative Works + that You distribute, all copyright, patent, trademark, and + attribution notices from the Source form of the Work, + excluding those notices that do not pertain to any part of + the Derivative Works; and + + (d) If the Work includes a "NOTICE" text file as part of its + distribution, then any Derivative Works that You distribute must + include a readable copy of the attribution notices contained + within such NOTICE file, excluding those notices that do not + pertain to any part of the Derivative Works, in at least one + of the following places: within a NOTICE text file distributed + as part of the Derivative Works; within the Source form or + documentation, if provided along with the Derivative Works; or, + within a display generated by the Derivative Works, if and + wherever such third-party notices normally appear. The contents + of the NOTICE file are for informational purposes only and + do not modify the License. You may add Your own attribution + notices within Derivative Works that You distribute, alongside + or as an addendum to the NOTICE text from the Work, provided + that such additional attribution notices cannot be construed + as modifying the License. + + You may add Your own copyright statement to Your modifications and + may provide additional or different license terms and conditions + for use, reproduction, or distribution of Your modifications, or + for any such Derivative Works as a whole, provided Your use, + reproduction, and distribution of the Work otherwise complies with + the conditions stated in this License. + + 5. Submission of Contributions. Unless You explicitly state otherwise, + any Contribution intentionally submitted for inclusion in the Work + by You to the Licensor shall be under the terms and conditions of + this License, without any additional terms or conditions. + Notwithstanding the above, nothing herein shall supersede or modify + the terms of any separate license agreement you may have executed + with Licensor regarding such Contributions. + + 6. Trademarks. This License does not grant permission to use the trade + names, trademarks, service marks, or product names of the Licensor, + except as required for reasonable and customary use in describing the + origin of the Work and reproducing the content of the NOTICE file. + + 7. Disclaimer of Warranty. Unless required by applicable law or + agreed to in writing, Licensor provides the Work (and each + Contributor provides its Contributions) on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or + implied, including, without limitation, any warranties or conditions + of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A + PARTICULAR PURPOSE. You are solely responsible for determining the + appropriateness of using or redistributing the Work and assume any + risks associated with Your exercise of permissions under this License. + + 8. Limitation of Liability. In no event and under no legal theory, + whether in tort (including negligence), contract, or otherwise, + unless required by applicable law (such as deliberate and grossly + negligent acts) or agreed to in writing, shall any Contributor be + liable to You for damages, including any direct, indirect, special, + incidental, or consequential damages of any character arising as a + result of this License or out of the use or inability to use the + Work (including but not limited to damages for loss of goodwill, + work stoppage, computer failure or malfunction, or any and all + other commercial damages or losses), even if such Contributor + has been advised of the possibility of such damages. + + 9. Accepting Warranty or Additional Liability. While redistributing + the Work or Derivative Works thereof, You may choose to offer, + and charge a fee for, acceptance of support, warranty, indemnity, + or other liability obligations and/or rights consistent with this + License. However, in accepting such obligations, You may act only + on Your own behalf and on Your sole responsibility, not on behalf + of any other Contributor, and only if You agree to indemnify, + defend, and hold each Contributor harmless for any liability + incurred by, or claims asserted against, such Contributor by reason + of your accepting any such warranty or additional liability. + + END OF TERMS AND CONDITIONS + + APPENDIX: How to apply the Apache License to your work. + + To apply the Apache License to your work, attach the following + boilerplate notice, with the fields enclosed by brackets "[]" + replaced with your own identifying information. (Don't include + the brackets!) The text should be enclosed in the appropriate + comment syntax for the file format. We also recommend that a + file or class name and description of purpose be included on the + same "printed page" as the copyright notice for easier + identification within third-party archives. + + Copyright [yyyy] [name of copyright owner] + + Licensed under the Apache License, Version 2.0 (the "License"); + you may not use this file except in compliance with the License. + You may obtain a copy of the License at + + http://www.apache.org/licenses/LICENSE-2.0 + + Unless required by applicable law or agreed to in writing, software + distributed under the License is distributed on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + See the License for the specific language governing permissions and + limitations under the License. diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..41773b1 --- /dev/null +++ b/Makefile @@ -0,0 +1,19 @@ +PROJECT=bcm +PROG=$(PROJECT) +TARGET=$(PROG) +SRCS= src +CXX=g++ +CXXFLAGS=-Wall --std=c++11 +LDFLAGS=-lsais -s +RM=rm -f + +all: $(TARGET) + +$(SRCS)/$(PROG).o: $(SRCS)/$(PROG).cpp + $(CXX) $(CXXFLAGS) -c -o $@ $^ + +$(PROG): $(SRCS)/$(PROG).o + $(CXX) $(CXXFLAGS) $^ -o $@ $(LDFLAGS) + +clean: + $(RM) $(SRCS)/*.o $(PROG) diff --git a/README.md b/README.md new file mode 100644 index 0000000..b77f9d5 --- /dev/null +++ b/README.md @@ -0,0 +1,33 @@ +![GitHub release (latest by date)](https://img.shields.io/github/v/release/FS-make-simple/bcm) +![GitHub Release Date](https://img.shields.io/github/release-date/FS-make-simple/bcm) +![GitHub repo size](https://img.shields.io/github/repo-size/FS-make-simple/bcm) +![GitHub all releases](https://img.shields.io/github/downloads/FS-make-simple/bcm/total) +![GitHub](https://img.shields.io/github/license/FS-make-simple/bcm) + +# BCM + +### Description +BCM is a high-performance file compressor that utilizes advanced context modeling techniques to achieve a very high compression ratio. All in all, it's like a big brother of the BZIP2. + +### Quick Benchmark +[ENWIK8][1] | Compressed Size | +------------|-------------------| +Original | 100,000,000 bytes | +GZIP -9 | 36,445,248 bytes | +BZIP2 -9 | 29,008,758 bytes | +7-Zip Ultra | 24,864,804 bytes | +BCM -b100 | 20,789,667 bytes | + +[1]:http://mattmahoney.net/dc/text.html + +### Depends + +Libsais: +* https://github.com/IlyaGrebnov/libsais +* https://github.com/FS-make-simple/libsais + +### Author +Ilya Muravyov + +### Thanks +Special thanks to Ilya Grebnov, Yuta Mori, Matt Mahoney, Eugene Shelwien, Alexander Rhatushnyak, Przemyslaw Skibinski, Malcolm Taylor and LovePimple. diff --git a/src/bcm.cpp b/src/bcm.cpp new file mode 100644 index 0000000..a2373de --- /dev/null +++ b/src/bcm.cpp @@ -0,0 +1,655 @@ +/* + +BCM - A BWT-based file compressor + +Copyright (C) 2008-2021 Ilya Muravyov + +Licensed under the Apache License, Version 2.0 (the "License"); +you may not use this file except in compliance with the License. +You may obtain a copy of the License at + + http://www.apache.org/licenses/LICENSE-2.0 + +Unless required by applicable law or agreed to in writing, software +distributed under the License is distributed on an "AS IS" BASIS, +WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +See the License for the specific language governing permissions and +limitations under the License. + +*/ + +#ifdef _MSC_VER +# define _CRT_SECURE_CPP_OVERLOAD_STANDARD_NAMES 1 +# define _CRT_SECURE_NO_WARNINGS +# define _CRT_DISABLE_PERFCRIT_LOCKS + +# define fseeko64 _fseeki64 +# define ftello64 _ftelli64 +# define stat64 _stati64 +#endif + +#include +#include +#include +#include + +#ifndef NO_UTIME +# include +# include + +# ifdef _MSC_VER +# include +# else +# include +# endif +#endif + +#include "libsais.h" + +typedef unsigned char U8; +typedef unsigned short U16; +typedef unsigned int U32; +typedef unsigned long long U64; +typedef signed long long S64; + +// Globals + +#define BCM_ID 0x214D4342 // "BCM!" + +FILE* in; +FILE* out; + +struct Encoder +{ + U32 low; + U32 high; + U32 code; + + Encoder() + { + low=0; + high=0xFFFFFFFF; + code=0; + } + + void Flush() + { + for (int i=0; i<4; ++i) + { + putc(low>>24, out); + low<<=8; + } + } + + void Init() + { + for (int i=0; i<4; ++i) + code=(code<<8)|getc(in); + } + + template + void EncodeBit(int bit, U32 p) + { + const U32 mid=low+((U64(high-low)*p)>>P_LOG); + + if (bit) + high=mid; + else + low=mid+1; + + // Renormalize + while ((low^high)<(1<<24)) + { + putc(low>>24, out); + low<<=8; + high=(high<<8)|255; + } + } + + template + int DecodeBit(U32 p) + { + const U32 mid=low+((U64(high-low)*p)>>P_LOG); + + const int bit=(code<=mid); + if (bit) + high=mid; + else + low=mid+1; + + // Renormalize + while ((low^high)<(1<<24)) + { + low<<=8; + high=(high<<8)|255; + code=(code<<8)|getc(in); + } + + return bit; + } +}; + +template +struct Counter +{ + U16 p; + + Counter() + { + p=1<<15; // 0.5 + } + + void Update1() + { + p+=(p^0xFFFF)>>RATE; + } + + void Update0() + { + p-=p>>RATE; + } +}; + +struct CM: Encoder +{ + Counter<2> counter0[256]; + Counter<4> counter1[256][256]; + Counter<6> counter2[2][256][17]; + int run; + int c1; + int c2; + + CM() + { + run=0; + c1=0; + c2=0; + + for (int i=0; i<2; ++i) + { + for (int j=0; j<256; ++j) + { + for (int k=0; k<=16; ++k) + counter2[i][j][k].p=(k<<12)-(k==16); + } + } + } + + void Put32(U32 x) + { + for (U32 i=1<<31; i>0; i>>=1) + EncodeBit<1>(x&i, 1); // p=0.5 + } + + U32 Get32() + { + U32 x=0; + for (int i=0; i<32; ++i) + x+=x+DecodeBit<1>(1); // p=0.5 + + return x; + } + + void Put(int c) + { + const int f=(run>2); + + int ctx=1; + for (int i=128; i>0; i>>=1) + { + const int p0=counter0[ctx].p; + const int p1=counter1[c1][ctx].p; + const int p2=counter1[c2][ctx].p; + const int p=(((p0+p1)*7)+p2+p2)>>4; + + // SSE with linear interpolation + const int j=p>>12; + const int x1=counter2[f][ctx][j].p; + const int x2=counter2[f][ctx][j+1].p; + const int ssep=x1+(((x2-x1)*(p&4095))>>12); + + if (c&i) + { + EncodeBit<18>(1, p+ssep+ssep+ssep); + + counter0[ctx].Update1(); + counter1[c1][ctx].Update1(); + counter2[f][ctx][j].Update1(); + counter2[f][ctx][j+1].Update1(); + + ctx+=ctx+1; + } + else + { + EncodeBit<18>(0, p+ssep+ssep+ssep); + + counter0[ctx].Update0(); + counter1[c1][ctx].Update0(); + counter2[f][ctx][j].Update0(); + counter2[f][ctx][j+1].Update0(); + + ctx+=ctx; + } + } + + c2=c1; + c1=ctx-256; + + if (c1==c2) + ++run; + else + run=0; + } + + int Get() + { + const int f=(run>2); + + int ctx=1; + while (ctx<256) + { + const int p0=counter0[ctx].p; + const int p1=counter1[c1][ctx].p; + const int p2=counter1[c2][ctx].p; + const int p=(((p0+p1)*7)+p2+p2)>>4; + + // SSE with linear interpolation + const int j=p>>12; + const int x1=counter2[f][ctx][j].p; + const int x2=counter2[f][ctx][j+1].p; + const int ssep=x1+(((x2-x1)*(p&4095))>>12); + + if (DecodeBit<18>(p+ssep+ssep+ssep)) + { + counter0[ctx].Update1(); + counter1[c1][ctx].Update1(); + counter2[f][ctx][j].Update1(); + counter2[f][ctx][j+1].Update1(); + + ctx+=ctx+1; + } + else + { + counter0[ctx].Update0(); + counter1[c1][ctx].Update0(); + counter2[f][ctx][j].Update0(); + counter2[f][ctx][j+1].Update0(); + + ctx+=ctx; + } + } + + c2=c1; + c1=ctx-256; + + if (c1==c2) + ++run; + else + run=0; + + return c1; + } +} cm; + +struct CRC +{ + U32 tab[8][256]; + U32 crc; + + CRC() + { + for (int i=0; i<256; ++i) + { + U32 x=i; + for (int j=0; j<8; ++j) + x=(x>>1)^(0xEDB88320&-int(x&1)); + tab[0][i]=x; + } + for (int i=0; i<256; ++i) + { + tab[1][i]=(tab[0][i]>>8)^tab[0][tab[0][i]&255]; + tab[2][i]=(tab[1][i]>>8)^tab[0][tab[1][i]&255]; + tab[3][i]=(tab[2][i]>>8)^tab[0][tab[2][i]&255]; + tab[4][i]=(tab[3][i]>>8)^tab[0][tab[3][i]&255]; + tab[5][i]=(tab[4][i]>>8)^tab[0][tab[4][i]&255]; + tab[6][i]=(tab[5][i]>>8)^tab[0][tab[5][i]&255]; + tab[7][i]=(tab[6][i]>>8)^tab[0][tab[6][i]&255]; + } + crc=0xFFFFFFFF; + } + + U32 operator()() const + { + return crc^0xFFFFFFFF; + } + + void Update(U8* s, int n) + { + U32 x=crc; + while (n>=8) + { + x^=*reinterpret_cast(s); + const U32 t=*reinterpret_cast(s+4); + x=tab[0][t>>24] + ^tab[1][(t>>16)&255] + ^tab[2][(t>>8)&255] + ^tab[3][t&255] + ^tab[4][x>>24] + ^tab[5][(x>>16)&255] + ^tab[6][(x>>8)&255] + ^tab[7][x&255]; + s+=8; + n-=8; + } + while (n--) + x=(x>>8)^tab[0][(x^*s++)&255]; + crc=x; + } +} crc; + +template +inline T* MemAlloc(size_t n) +{ + T* p=reinterpret_cast(malloc(n*sizeof(T))); + if (!p) + { + perror("Malloc() failed"); + exit(1); + } + return p; +} + +void Compress(int bsize) +{ + if (fseeko64(in, 0, SEEK_END)) + { + perror("Fseek() failed"); + exit(1); + } + const S64 flen=ftello64(in); + if (flen<0) + { + perror("Ftell() failed"); + exit(1); + } + rewind(in); + + if (bsize>flen) + bsize=int(flen); + + U8* buf=MemAlloc(bsize); + int* ptr=MemAlloc(bsize); + + int n; + while ((n=fread(buf, 1, bsize, in))>0) + { + crc.Update(buf, n); + + const int idx=libsais_bwt(buf, buf, ptr, n, 0); + if (idx<1) + { + perror("Libsais_bwt() failed"); + exit(1); + } + + cm.Put32(n); // Block size + cm.Put32(idx); // BWT index + + for (int i=0; i %lld\r", ftello64(in), ftello64(out)); + } + + cm.Put32(0); // EOF + cm.Put32(crc()); // CRC32 + + cm.Flush(); + + free(buf); + free(ptr); +} + +void Decompress() +{ + int cnt[257]; + + int bsize=0; + U8* buf=NULL; + int* ptr=NULL; + + cm.Init(); + + int n; + while ((n=cm.Get32())>0) + { + if (!bsize) + { + bsize=n; + buf=MemAlloc(bsize); + ptr=MemAlloc(bsize); + } + + const int idx=cm.Get32(); + if (n>bsize || idx<1 || idx>n) + { + fprintf(stderr, "Corrupt input!\n"); + exit(1); + } + + // Inverse BW-transform + + memset(cnt, 0, sizeof(cnt)); + for (int i=0; i>=1; + } + buf[i]=c; + p=ptr[p]; + } + + crc.Update(buf, n); + + if (fwrite(buf, 1, n, out)!=n) + { + perror("Fwrite() failed"); + exit(1); + } + + fprintf(stderr, "%lld -> %lld\r", ftello64(in), ftello64(out)); + } + + if (cm.Get32()!=crc()) + { + fprintf(stderr, "CRC error!\n"); + exit(1); + } + + free(buf); + free(ptr); +} + +int main(int argc, char** argv) +{ + const clock_t start=clock(); + + int bsize=1<<24; // 16 MB + int decompress=0; + int overwrite=0; + + while (argc>1 && *argv[1]=='-') + { + for (int i=1; argv[1][i]!='\0'; ++i) + { + switch (argv[1][i]) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + break; // Skip + case 'b': + bsize=atoi(&argv[1][i+1])<<20; + if (bsize<1) + { + fprintf(stderr, "Block size is out of range\n"); + exit(1); + } + break; + case 'd': + decompress=1; + break; + case 'f': + overwrite=1; + break; + default: + fprintf(stderr, "Unknown option '-%c'\n", argv[1][i]); + exit(1); + } + } + --argc; + ++argv; + } + + if (argc<2) + { + fprintf(stderr, + "BCM - A BWT-based file compressor, v1.65\n" + "Copyright (C) 2008-2021 Ilya Muravyov\n" + "\n" + "Usage: bcm [options] infile [outfile]\n" + "\n" + "Options:\n" + " -b# Set block size to # MB (default: 16)\n" + " -d Decompress\n" + " -f Force overwrite of output file\n"); + exit(1); + } + + in=fopen(argv[1], "rb"); + if (!in) + { + perror(argv[1]); + exit(1); + } + + char ofname[FILENAME_MAX]; + if (argc<3) + { + strcpy(ofname, argv[1]); + if (decompress) + { + const int p=strlen(ofname)-4; + if (p>0 && !strcmp(&ofname[p], ".bcm")) + ofname[p]='\0'; + else + strcat(ofname, ".out"); + } + else + strcat(ofname, ".bcm"); + } + else + strcpy(ofname, argv[2]); + + if (!overwrite) + { + FILE* f=fopen(ofname, "rb"); + if (f) + { + fclose(f); + + fprintf(stderr, "File '%s' already exists. Overwrite (y/n)? ", ofname); + fflush(stderr); + + if (getchar()!='y') + { + fprintf(stderr, "Not overwritten\n"); + exit(1); + } + } + } + + if (decompress) + { + int id; + fread(&id, 1, sizeof(id), in); + if (id!=BCM_ID) + { + fprintf(stderr, "%s: Not in BCM format\n", argv[1]); + exit(1); + } + + out=fopen(ofname, "wb"); + if (!out) + { + perror(ofname); + exit(1); + } + + fprintf(stderr, "Decompressing '%s':\n", argv[1]); + + Decompress(); + } + else + { + out=fopen(ofname, "wb"); + if (!out) + { + perror(ofname); + exit(1); + } + + const int id=BCM_ID; + fwrite(&id, 1, sizeof(id), out); + + fprintf(stderr, "Compressing '%s':\n", argv[1]); + + Compress(bsize); + } + + fprintf(stderr, "%lld -> %lld in %.1f sec\n", + ftello64(in), ftello64(out), double(clock()-start)/CLOCKS_PER_SEC); + + fclose(in); + fclose(out); + +#ifndef NO_UTIME + struct stat64 sb; + if (stat64(argv[1], &sb)) + { + perror("Stat() failed"); + exit(1); + } + struct utimbuf ub; + ub.actime=sb.st_atime; + ub.modtime=sb.st_mtime; + if (utime(ofname, &ub)) + { + perror("Utime() failed"); + exit(1); + } +#endif + + return 0; +}