1 |
779 |
jeremybenn |
/***
|
2 |
|
|
* ASM: a very small and fast Java bytecode manipulation framework
|
3 |
|
|
* Copyright (c) 2000-2005 INRIA, France Telecom
|
4 |
|
|
* All rights reserved.
|
5 |
|
|
*
|
6 |
|
|
* Redistribution and use in source and binary forms, with or without
|
7 |
|
|
* modification, are permitted provided that the following conditions
|
8 |
|
|
* are met:
|
9 |
|
|
* 1. Redistributions of source code must retain the above copyright
|
10 |
|
|
* notice, this list of conditions and the following disclaimer.
|
11 |
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
12 |
|
|
* notice, this list of conditions and the following disclaimer in the
|
13 |
|
|
* documentation and/or other materials provided with the distribution.
|
14 |
|
|
* 3. Neither the name of the copyright holders nor the names of its
|
15 |
|
|
* contributors may be used to endorse or promote products derived from
|
16 |
|
|
* this software without specific prior written permission.
|
17 |
|
|
*
|
18 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
19 |
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
20 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
21 |
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
22 |
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
23 |
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
24 |
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
25 |
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
26 |
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
27 |
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
|
28 |
|
|
* THE POSSIBILITY OF SUCH DAMAGE.
|
29 |
|
|
*/
|
30 |
|
|
package org.objectweb.asm.optimizer;
|
31 |
|
|
|
32 |
|
|
import java.io.File;
|
33 |
|
|
import java.io.FileOutputStream;
|
34 |
|
|
import java.io.IOException;
|
35 |
|
|
import java.io.InputStream;
|
36 |
|
|
import java.util.Enumeration;
|
37 |
|
|
import java.util.zip.ZipEntry;
|
38 |
|
|
import java.util.zip.ZipFile;
|
39 |
|
|
import java.util.zip.ZipOutputStream;
|
40 |
|
|
|
41 |
|
|
/**
|
42 |
|
|
* A Jar file optimizer.
|
43 |
|
|
*
|
44 |
|
|
* @author Eric Bruneton
|
45 |
|
|
*/
|
46 |
|
|
public class JarOptimizer {
|
47 |
|
|
|
48 |
|
|
public static void main(final String[] args) throws IOException {
|
49 |
|
|
File f = new File(args[0]);
|
50 |
|
|
optimize(f);
|
51 |
|
|
}
|
52 |
|
|
|
53 |
|
|
static void optimize(final File f) throws IOException {
|
54 |
|
|
if (f.isDirectory()) {
|
55 |
|
|
File[] files = f.listFiles();
|
56 |
|
|
for (int i = 0; i < files.length; ++i) {
|
57 |
|
|
optimize(files[i]);
|
58 |
|
|
}
|
59 |
|
|
} else if (f.getName().endsWith(".jar")) {
|
60 |
|
|
File g = new File(f.getParentFile(), f.getName() + ".new");
|
61 |
|
|
ZipFile zf = new ZipFile(f);
|
62 |
|
|
ZipOutputStream out = new ZipOutputStream(new FileOutputStream(g));
|
63 |
|
|
Enumeration e = zf.entries();
|
64 |
|
|
byte[] buf = new byte[10000];
|
65 |
|
|
while (e.hasMoreElements()) {
|
66 |
|
|
ZipEntry ze = (ZipEntry) e.nextElement();
|
67 |
|
|
if (ze.isDirectory()) {
|
68 |
|
|
continue;
|
69 |
|
|
}
|
70 |
|
|
out.putNextEntry(ze);
|
71 |
|
|
InputStream is = zf.getInputStream(ze);
|
72 |
|
|
int n;
|
73 |
|
|
do {
|
74 |
|
|
n = is.read(buf, 0, buf.length);
|
75 |
|
|
if (n != -1) {
|
76 |
|
|
out.write(buf, 0, n);
|
77 |
|
|
}
|
78 |
|
|
} while (n != -1);
|
79 |
|
|
out.closeEntry();
|
80 |
|
|
}
|
81 |
|
|
out.close();
|
82 |
|
|
zf.close();
|
83 |
|
|
f.delete();
|
84 |
|
|
g.renameTo(f);
|
85 |
|
|
}
|
86 |
|
|
}
|
87 |
|
|
}
|