src/share/classes/com/sun/tools/javac/file/ZipFileIndex.java

Wed, 25 Mar 2009 10:29:28 +0000

author
mcimadamore
date
Wed, 25 Mar 2009 10:29:28 +0000
changeset 254
1ee128971f5d
parent 184
905e151a185a
child 333
7c2d6da61646
permissions
-rw-r--r--

6400189: raw types and inference
Summary: Fixed resolution problem with raw overriding (CCC)
Reviewed-by: jjg

jjg@36 1 /*
jjg@36 2 * Copyright 2007-2008 Sun Microsystems, Inc. All Rights Reserved.
jjg@36 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
jjg@36 4 *
jjg@36 5 * This code is free software; you can redistribute it and/or modify it
jjg@36 6 * under the terms of the GNU General Public License version 2 only, as
jjg@36 7 * published by the Free Software Foundation. Sun designates this
jjg@36 8 * particular file as subject to the "Classpath" exception as provided
jjg@36 9 * by Sun in the LICENSE file that accompanied this code.
jjg@36 10 *
jjg@36 11 * This code is distributed in the hope that it will be useful, but WITHOUT
jjg@36 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
jjg@36 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
jjg@36 14 * version 2 for more details (a copy is included in the LICENSE file that
jjg@36 15 * accompanied this code).
jjg@36 16 *
jjg@36 17 * You should have received a copy of the GNU General Public License version
jjg@36 18 * 2 along with this work; if not, write to the Free Software Foundation,
jjg@36 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
jjg@36 20 *
jjg@36 21 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
jjg@36 22 * CA 95054 USA or visit www.sun.com if you need additional information or
jjg@36 23 * have any questions.
jjg@36 24 */
jjg@36 25
jjg@50 26 package com.sun.tools.javac.file;
duke@1 27
jjg@103 28
jjg@50 29 import java.io.File;
jjg@50 30 import java.io.FileNotFoundException;
jjg@50 31 import java.io.IOException;
jjg@50 32 import java.io.RandomAccessFile;
jjg@103 33 import java.lang.ref.SoftReference;
jjg@50 34 import java.util.ArrayList;
jjg@50 35 import java.util.Arrays;
jjg@71 36 import java.util.Calendar;
jjg@50 37 import java.util.Collections;
jjg@50 38 import java.util.HashMap;
jjg@50 39 import java.util.HashSet;
jjg@50 40 import java.util.Iterator;
duke@1 41 import java.util.List;
jjg@50 42 import java.util.Map;
jjg@50 43 import java.util.Set;
duke@1 44 import java.util.concurrent.locks.ReentrantLock;
jjg@50 45 import java.util.zip.DataFormatException;
jjg@50 46 import java.util.zip.Inflater;
jjg@50 47 import java.util.zip.ZipException;
duke@1 48
jjg@103 49 import com.sun.tools.javac.file.RelativePath.RelativeDirectory;
jjg@103 50 import com.sun.tools.javac.file.RelativePath.RelativeFile;
jjg@103 51
duke@1 52 /** This class implements building of index of a zip archive and access to it's context.
duke@1 53 * It also uses prebuild index if available. It supports invocations where it will
duke@1 54 * serialize an optimized zip index file to disk.
duke@1 55 *
duke@1 56 * In oreder to use secondary index file make sure the option "usezipindex" is in the Options object,
duke@1 57 * when JavacFileManager is invoked. (You can pass "-XDusezipindex" on the command line.
duke@1 58 *
duke@1 59 * Location where to look for/generate optimized zip index files can be provided using
duke@1 60 * "-XDcachezipindexdir=<directory>". If this flag is not provided, the dfault location is
duke@1 61 * the value of the "java.io.tmpdir" system property.
duke@1 62 *
duke@1 63 * If key "-XDwritezipindexfiles" is specified, there will be new optimized index file
duke@1 64 * created for each archive, used by the compiler for compilation, at location,
duke@1 65 * specified by "cachezipindexdir" option.
duke@1 66 *
duke@1 67 * If nonBatchMode option is specified (-XDnonBatchMode) the compiler will use timestamp
duke@1 68 * checking to reindex the zip files if it is needed. In batch mode the timestamps are not checked
duke@1 69 * and the compiler uses the cached indexes.
duke@1 70 */
duke@1 71 public class ZipFileIndex {
duke@1 72 private static final String MIN_CHAR = String.valueOf(Character.MIN_VALUE);
duke@1 73 private static final String MAX_CHAR = String.valueOf(Character.MAX_VALUE);
duke@1 74
duke@1 75 public final static long NOT_MODIFIED = Long.MIN_VALUE;
duke@1 76
duke@1 77 private static Map<File, ZipFileIndex> zipFileIndexCache = new HashMap<File, ZipFileIndex>();
duke@1 78 private static ReentrantLock lock = new ReentrantLock();
duke@1 79
duke@1 80 private static boolean NON_BATCH_MODE = System.getProperty("nonBatchMode") != null;// TODO: Use -XD compiler switch for this.
duke@1 81
jjg@103 82 private Map<RelativeDirectory, DirectoryEntry> directories = Collections.<RelativeDirectory, DirectoryEntry>emptyMap();
jjg@103 83 private Set<RelativeDirectory> allDirs = Collections.<RelativeDirectory>emptySet();
duke@1 84
duke@1 85 // ZipFileIndex data entries
duke@1 86 private File zipFile;
duke@1 87 private long zipFileLastModified = NOT_MODIFIED;
duke@1 88 private RandomAccessFile zipRandomFile;
jjg@57 89 private Entry[] entries;
duke@1 90
duke@1 91 private boolean readFromIndex = false;
duke@1 92 private File zipIndexFile = null;
duke@1 93 private boolean triedToReadIndex = false;
jjg@103 94 final RelativeDirectory symbolFilePrefix;
duke@1 95 private int symbolFilePrefixLength = 0;
duke@1 96 private boolean hasPopulatedData = false;
duke@1 97 private long lastReferenceTimeStamp = NOT_MODIFIED;
duke@1 98
duke@1 99 private boolean usePreindexedCache = false;
duke@1 100 private String preindexedCacheLocation = null;
duke@1 101
duke@1 102 private boolean writeIndex = false;
duke@1 103
jjg@103 104 private Map <String, SoftReference<RelativeDirectory>> relativeDirectoryCache =
jjg@103 105 new HashMap<String, SoftReference<RelativeDirectory>>();
jjg@103 106
duke@1 107 /**
duke@1 108 * Returns a list of all ZipFileIndex entries
duke@1 109 *
duke@1 110 * @return A list of ZipFileIndex entries, or an empty list
duke@1 111 */
duke@1 112 public static List<ZipFileIndex> getZipFileIndexes() {
duke@1 113 return getZipFileIndexes(false);
duke@1 114 }
duke@1 115
duke@1 116 /**
duke@1 117 * Returns a list of all ZipFileIndex entries
duke@1 118 *
duke@1 119 * @param openedOnly If true it returns a list of only opened ZipFileIndex entries, otherwise
duke@1 120 * all ZipFileEntry(s) are included into the list.
duke@1 121 * @return A list of ZipFileIndex entries, or an empty list
duke@1 122 */
duke@1 123 public static List<ZipFileIndex> getZipFileIndexes(boolean openedOnly) {
duke@1 124 List<ZipFileIndex> zipFileIndexes = new ArrayList<ZipFileIndex>();
duke@1 125 lock.lock();
duke@1 126 try {
duke@1 127 zipFileIndexes.addAll(zipFileIndexCache.values());
duke@1 128
duke@1 129 if (openedOnly) {
duke@1 130 for(ZipFileIndex elem : zipFileIndexes) {
duke@1 131 if (!elem.isOpen()) {
duke@1 132 zipFileIndexes.remove(elem);
duke@1 133 }
duke@1 134 }
duke@1 135 }
duke@1 136 }
duke@1 137 finally {
duke@1 138 lock.unlock();
duke@1 139 }
duke@1 140 return zipFileIndexes;
duke@1 141 }
duke@1 142
duke@1 143 public boolean isOpen() {
duke@1 144 lock.lock();
duke@1 145 try {
duke@1 146 return zipRandomFile != null;
duke@1 147 }
duke@1 148 finally {
duke@1 149 lock.unlock();
duke@1 150 }
duke@1 151 }
duke@1 152
jjg@103 153 public static ZipFileIndex getZipFileIndex(File zipFile,
jjg@103 154 RelativeDirectory symbolFilePrefix,
jjg@103 155 boolean useCache, String cacheLocation,
jjg@103 156 boolean writeIndex) throws IOException {
duke@1 157 ZipFileIndex zi = null;
duke@1 158 lock.lock();
duke@1 159 try {
duke@1 160 zi = getExistingZipIndex(zipFile);
duke@1 161
duke@1 162 if (zi == null || (zi != null && zipFile.lastModified() != zi.zipFileLastModified)) {
jjg@57 163 zi = new ZipFileIndex(zipFile, symbolFilePrefix, writeIndex,
duke@1 164 useCache, cacheLocation);
duke@1 165 zipFileIndexCache.put(zipFile, zi);
duke@1 166 }
duke@1 167 }
duke@1 168 finally {
duke@1 169 lock.unlock();
duke@1 170 }
duke@1 171 return zi;
duke@1 172 }
duke@1 173
duke@1 174 public static ZipFileIndex getExistingZipIndex(File zipFile) {
duke@1 175 lock.lock();
duke@1 176 try {
duke@1 177 return zipFileIndexCache.get(zipFile);
duke@1 178 }
duke@1 179 finally {
duke@1 180 lock.unlock();
duke@1 181 }
duke@1 182 }
duke@1 183
duke@1 184 public static void clearCache() {
duke@1 185 lock.lock();
duke@1 186 try {
duke@1 187 zipFileIndexCache.clear();
duke@1 188 }
duke@1 189 finally {
duke@1 190 lock.unlock();
duke@1 191 }
duke@1 192 }
duke@1 193
duke@1 194 public static void clearCache(long timeNotUsed) {
duke@1 195 lock.lock();
duke@1 196 try {
duke@1 197 Iterator<File> cachedFileIterator = zipFileIndexCache.keySet().iterator();
duke@1 198 while (cachedFileIterator.hasNext()) {
duke@1 199 File cachedFile = cachedFileIterator.next();
duke@1 200 ZipFileIndex cachedZipIndex = zipFileIndexCache.get(cachedFile);
duke@1 201 if (cachedZipIndex != null) {
duke@1 202 long timeToTest = cachedZipIndex.lastReferenceTimeStamp + timeNotUsed;
duke@1 203 if (timeToTest < cachedZipIndex.lastReferenceTimeStamp || // Overflow...
duke@1 204 System.currentTimeMillis() > timeToTest) {
duke@1 205 zipFileIndexCache.remove(cachedFile);
duke@1 206 }
duke@1 207 }
duke@1 208 }
duke@1 209 }
duke@1 210 finally {
duke@1 211 lock.unlock();
duke@1 212 }
duke@1 213 }
duke@1 214
duke@1 215 public static void removeFromCache(File file) {
duke@1 216 lock.lock();
duke@1 217 try {
duke@1 218 zipFileIndexCache.remove(file);
duke@1 219 }
duke@1 220 finally {
duke@1 221 lock.unlock();
duke@1 222 }
duke@1 223 }
duke@1 224
duke@1 225 /** Sets already opened list of ZipFileIndexes from an outside client
duke@1 226 * of the compiler. This functionality should be used in a non-batch clients of the compiler.
duke@1 227 */
duke@1 228 public static void setOpenedIndexes(List<ZipFileIndex>indexes) throws IllegalStateException {
duke@1 229 lock.lock();
duke@1 230 try {
duke@1 231 if (zipFileIndexCache.isEmpty()) {
duke@1 232 throw new IllegalStateException("Setting opened indexes should be called only when the ZipFileCache is empty. Call JavacFileManager.flush() before calling this method.");
duke@1 233 }
duke@1 234
duke@1 235 for (ZipFileIndex zfi : indexes) {
duke@1 236 zipFileIndexCache.put(zfi.zipFile, zfi);
duke@1 237 }
duke@1 238 }
duke@1 239 finally {
duke@1 240 lock.unlock();
duke@1 241 }
duke@1 242 }
duke@1 243
jjg@103 244 private ZipFileIndex(File zipFile, RelativeDirectory symbolFilePrefix, boolean writeIndex,
duke@1 245 boolean useCache, String cacheLocation) throws IOException {
duke@1 246 this.zipFile = zipFile;
jjg@57 247 this.symbolFilePrefix = symbolFilePrefix;
jjg@57 248 this.symbolFilePrefixLength = (symbolFilePrefix == null ? 0 :
jjg@103 249 symbolFilePrefix.getPath().getBytes("UTF-8").length);
duke@1 250 this.writeIndex = writeIndex;
duke@1 251 this.usePreindexedCache = useCache;
duke@1 252 this.preindexedCacheLocation = cacheLocation;
duke@1 253
duke@1 254 if (zipFile != null) {
duke@1 255 this.zipFileLastModified = zipFile.lastModified();
duke@1 256 }
duke@1 257
duke@1 258 // Validate integrity of the zip file
duke@1 259 checkIndex();
duke@1 260 }
duke@1 261
duke@1 262 public String toString() {
jjg@103 263 return "ZipFileIndex[" + zipFile + "]";
duke@1 264 }
duke@1 265
duke@1 266 // Just in case...
duke@1 267 protected void finalize() {
duke@1 268 closeFile();
duke@1 269 }
duke@1 270
duke@1 271 private boolean isUpToDate() {
duke@1 272 if (zipFile != null &&
duke@1 273 ((!NON_BATCH_MODE) || zipFileLastModified == zipFile.lastModified()) &&
duke@1 274 hasPopulatedData) {
duke@1 275 return true;
duke@1 276 }
duke@1 277
duke@1 278 return false;
duke@1 279 }
duke@1 280
duke@1 281 /**
duke@1 282 * Here we need to make sure that the ZipFileIndex is valid. Check the timestamp of the file and
duke@1 283 * if its the same as the one at the time the index was build we don't need to reopen anything.
duke@1 284 */
duke@1 285 private void checkIndex() throws IOException {
duke@1 286 boolean isUpToDate = true;
duke@1 287 if (!isUpToDate()) {
duke@1 288 closeFile();
duke@1 289 isUpToDate = false;
duke@1 290 }
duke@1 291
duke@1 292 if (zipRandomFile != null || isUpToDate) {
duke@1 293 lastReferenceTimeStamp = System.currentTimeMillis();
duke@1 294 return;
duke@1 295 }
duke@1 296
duke@1 297 hasPopulatedData = true;
duke@1 298
duke@1 299 if (readIndex()) {
duke@1 300 lastReferenceTimeStamp = System.currentTimeMillis();
duke@1 301 return;
duke@1 302 }
duke@1 303
jjg@103 304 directories = Collections.<RelativeDirectory, DirectoryEntry>emptyMap();
jjg@103 305 allDirs = Collections.<RelativeDirectory>emptySet();
duke@1 306
duke@1 307 try {
duke@1 308 openFile();
duke@1 309 long totalLength = zipRandomFile.length();
duke@1 310 ZipDirectory directory = new ZipDirectory(zipRandomFile, 0L, totalLength, this);
duke@1 311 directory.buildIndex();
duke@1 312 } finally {
duke@1 313 if (zipRandomFile != null) {
duke@1 314 closeFile();
duke@1 315 }
duke@1 316 }
duke@1 317
duke@1 318 lastReferenceTimeStamp = System.currentTimeMillis();
duke@1 319 }
duke@1 320
duke@1 321 private void openFile() throws FileNotFoundException {
duke@1 322 if (zipRandomFile == null && zipFile != null) {
duke@1 323 zipRandomFile = new RandomAccessFile(zipFile, "r");
duke@1 324 }
duke@1 325 }
duke@1 326
duke@1 327 private void cleanupState() {
duke@1 328 // Make sure there is a valid but empty index if the file doesn't exist
jjg@57 329 entries = Entry.EMPTY_ARRAY;
jjg@103 330 directories = Collections.<RelativeDirectory, DirectoryEntry>emptyMap();
duke@1 331 zipFileLastModified = NOT_MODIFIED;
jjg@103 332 allDirs = Collections.<RelativeDirectory>emptySet();
duke@1 333 }
duke@1 334
duke@1 335 public void close() {
duke@1 336 lock.lock();
duke@1 337 try {
duke@1 338 writeIndex();
duke@1 339 closeFile();
duke@1 340 }
duke@1 341 finally {
duke@1 342 lock.unlock();
duke@1 343 }
duke@1 344 }
duke@1 345
duke@1 346 private void closeFile() {
duke@1 347 if (zipRandomFile != null) {
duke@1 348 try {
duke@1 349 zipRandomFile.close();
duke@1 350 } catch (IOException ex) {
duke@1 351 }
duke@1 352 zipRandomFile = null;
duke@1 353 }
duke@1 354 }
duke@1 355
duke@1 356 /**
duke@1 357 * Returns the ZipFileIndexEntry for an absolute path, if there is one.
duke@1 358 */
jjg@103 359 Entry getZipIndexEntry(RelativePath path) {
duke@1 360 lock.lock();
duke@1 361 try {
duke@1 362 checkIndex();
jjg@103 363 DirectoryEntry de = directories.get(path.dirname());
jjg@103 364 String lookFor = path.basename();
duke@1 365 return de == null ? null : de.getEntry(lookFor);
duke@1 366 }
duke@1 367 catch (IOException e) {
duke@1 368 return null;
duke@1 369 }
duke@1 370 finally {
duke@1 371 lock.unlock();
duke@1 372 }
duke@1 373 }
duke@1 374
duke@1 375 /**
duke@1 376 * Returns a javac List of filenames within an absolute path in the ZipFileIndex.
duke@1 377 */
jjg@103 378 public com.sun.tools.javac.util.List<String> getFiles(RelativeDirectory path) {
duke@1 379 lock.lock();
duke@1 380 try {
duke@1 381 checkIndex();
duke@1 382
duke@1 383 DirectoryEntry de = directories.get(path);
duke@1 384 com.sun.tools.javac.util.List<String> ret = de == null ? null : de.getFiles();
duke@1 385
duke@1 386 if (ret == null) {
duke@1 387 return com.sun.tools.javac.util.List.<String>nil();
duke@1 388 }
duke@1 389 return ret;
duke@1 390 }
duke@1 391 catch (IOException e) {
duke@1 392 return com.sun.tools.javac.util.List.<String>nil();
duke@1 393 }
duke@1 394 finally {
duke@1 395 lock.unlock();
duke@1 396 }
duke@1 397 }
duke@1 398
jjg@103 399 public List<String> getDirectories(RelativeDirectory path) {
duke@1 400 lock.lock();
duke@1 401 try {
duke@1 402 checkIndex();
duke@1 403
duke@1 404 DirectoryEntry de = directories.get(path);
duke@1 405 com.sun.tools.javac.util.List<String> ret = de == null ? null : de.getDirectories();
duke@1 406
duke@1 407 if (ret == null) {
duke@1 408 return com.sun.tools.javac.util.List.<String>nil();
duke@1 409 }
duke@1 410
duke@1 411 return ret;
duke@1 412 }
duke@1 413 catch (IOException e) {
duke@1 414 return com.sun.tools.javac.util.List.<String>nil();
duke@1 415 }
duke@1 416 finally {
duke@1 417 lock.unlock();
duke@1 418 }
duke@1 419 }
duke@1 420
jjg@103 421 public Set<RelativeDirectory> getAllDirectories() {
duke@1 422 lock.lock();
duke@1 423 try {
duke@1 424 checkIndex();
duke@1 425 if (allDirs == Collections.EMPTY_SET) {
jjg@103 426 allDirs = new HashSet<RelativeDirectory>(directories.keySet());
duke@1 427 }
duke@1 428
duke@1 429 return allDirs;
duke@1 430 }
duke@1 431 catch (IOException e) {
jjg@103 432 return Collections.<RelativeDirectory>emptySet();
duke@1 433 }
duke@1 434 finally {
duke@1 435 lock.unlock();
duke@1 436 }
duke@1 437 }
duke@1 438
duke@1 439 /**
duke@1 440 * Tests if a specific path exists in the zip. This method will return true
duke@1 441 * for file entries and directories.
duke@1 442 *
duke@1 443 * @param path A path within the zip.
duke@1 444 * @return True if the path is a file or dir, false otherwise.
duke@1 445 */
jjg@103 446 public boolean contains(RelativePath path) {
duke@1 447 lock.lock();
duke@1 448 try {
duke@1 449 checkIndex();
duke@1 450 return getZipIndexEntry(path) != null;
duke@1 451 }
duke@1 452 catch (IOException e) {
duke@1 453 return false;
duke@1 454 }
duke@1 455 finally {
duke@1 456 lock.unlock();
duke@1 457 }
duke@1 458 }
duke@1 459
jjg@103 460 public boolean isDirectory(RelativePath path) throws IOException {
duke@1 461 lock.lock();
duke@1 462 try {
duke@1 463 // The top level in a zip file is always a directory.
jjg@103 464 if (path.getPath().length() == 0) {
duke@1 465 lastReferenceTimeStamp = System.currentTimeMillis();
duke@1 466 return true;
duke@1 467 }
duke@1 468
duke@1 469 checkIndex();
duke@1 470 return directories.get(path) != null;
duke@1 471 }
duke@1 472 finally {
duke@1 473 lock.unlock();
duke@1 474 }
duke@1 475 }
duke@1 476
jjg@103 477 public long getLastModified(RelativeFile path) throws IOException {
duke@1 478 lock.lock();
duke@1 479 try {
jjg@57 480 Entry entry = getZipIndexEntry(path);
duke@1 481 if (entry == null)
duke@1 482 throw new FileNotFoundException();
duke@1 483 return entry.getLastModified();
duke@1 484 }
duke@1 485 finally {
duke@1 486 lock.unlock();
duke@1 487 }
duke@1 488 }
duke@1 489
jjg@103 490 public int length(RelativeFile path) throws IOException {
duke@1 491 lock.lock();
duke@1 492 try {
jjg@57 493 Entry entry = getZipIndexEntry(path);
duke@1 494 if (entry == null)
duke@1 495 throw new FileNotFoundException();
duke@1 496
duke@1 497 if (entry.isDir) {
duke@1 498 return 0;
duke@1 499 }
duke@1 500
duke@1 501 byte[] header = getHeader(entry);
duke@1 502 // entry is not compressed?
duke@1 503 if (get2ByteLittleEndian(header, 8) == 0) {
duke@1 504 return entry.compressedSize;
duke@1 505 } else {
duke@1 506 return entry.size;
duke@1 507 }
duke@1 508 }
duke@1 509 finally {
duke@1 510 lock.unlock();
duke@1 511 }
duke@1 512 }
duke@1 513
jjg@103 514 public byte[] read(RelativeFile path) throws IOException {
duke@1 515 lock.lock();
duke@1 516 try {
jjg@57 517 Entry entry = getZipIndexEntry(path);
duke@1 518 if (entry == null)
jjg@103 519 throw new FileNotFoundException("Path not found in ZIP: " + path.path);
duke@1 520 return read(entry);
duke@1 521 }
duke@1 522 finally {
duke@1 523 lock.unlock();
duke@1 524 }
duke@1 525 }
duke@1 526
jjg@57 527 byte[] read(Entry entry) throws IOException {
duke@1 528 lock.lock();
duke@1 529 try {
duke@1 530 openFile();
duke@1 531 byte[] result = readBytes(entry);
duke@1 532 closeFile();
duke@1 533 return result;
duke@1 534 }
duke@1 535 finally {
duke@1 536 lock.unlock();
duke@1 537 }
duke@1 538 }
duke@1 539
jjg@103 540 public int read(RelativeFile path, byte[] buffer) throws IOException {
duke@1 541 lock.lock();
duke@1 542 try {
jjg@57 543 Entry entry = getZipIndexEntry(path);
duke@1 544 if (entry == null)
duke@1 545 throw new FileNotFoundException();
duke@1 546 return read(entry, buffer);
duke@1 547 }
duke@1 548 finally {
duke@1 549 lock.unlock();
duke@1 550 }
duke@1 551 }
duke@1 552
jjg@57 553 int read(Entry entry, byte[] buffer)
duke@1 554 throws IOException {
duke@1 555 lock.lock();
duke@1 556 try {
duke@1 557 int result = readBytes(entry, buffer);
duke@1 558 return result;
duke@1 559 }
duke@1 560 finally {
duke@1 561 lock.unlock();
duke@1 562 }
duke@1 563 }
duke@1 564
jjg@57 565 private byte[] readBytes(Entry entry) throws IOException {
duke@1 566 byte[] header = getHeader(entry);
duke@1 567 int csize = entry.compressedSize;
duke@1 568 byte[] cbuf = new byte[csize];
duke@1 569 zipRandomFile.skipBytes(get2ByteLittleEndian(header, 26) + get2ByteLittleEndian(header, 28));
duke@1 570 zipRandomFile.readFully(cbuf, 0, csize);
duke@1 571
duke@1 572 // is this compressed - offset 8 in the ZipEntry header
duke@1 573 if (get2ByteLittleEndian(header, 8) == 0)
duke@1 574 return cbuf;
duke@1 575
duke@1 576 int size = entry.size;
duke@1 577 byte[] buf = new byte[size];
duke@1 578 if (inflate(cbuf, buf) != size)
duke@1 579 throw new ZipException("corrupted zip file");
duke@1 580
duke@1 581 return buf;
duke@1 582 }
duke@1 583
duke@1 584 /**
duke@1 585 *
duke@1 586 */
jjg@57 587 private int readBytes(Entry entry, byte[] buffer) throws IOException {
duke@1 588 byte[] header = getHeader(entry);
duke@1 589
duke@1 590 // entry is not compressed?
duke@1 591 if (get2ByteLittleEndian(header, 8) == 0) {
duke@1 592 zipRandomFile.skipBytes(get2ByteLittleEndian(header, 26) + get2ByteLittleEndian(header, 28));
duke@1 593 int offset = 0;
duke@1 594 int size = buffer.length;
duke@1 595 while (offset < size) {
duke@1 596 int count = zipRandomFile.read(buffer, offset, size - offset);
duke@1 597 if (count == -1)
duke@1 598 break;
duke@1 599 offset += count;
duke@1 600 }
duke@1 601 return entry.size;
duke@1 602 }
duke@1 603
duke@1 604 int csize = entry.compressedSize;
duke@1 605 byte[] cbuf = new byte[csize];
duke@1 606 zipRandomFile.skipBytes(get2ByteLittleEndian(header, 26) + get2ByteLittleEndian(header, 28));
duke@1 607 zipRandomFile.readFully(cbuf, 0, csize);
duke@1 608
duke@1 609 int count = inflate(cbuf, buffer);
duke@1 610 if (count == -1)
duke@1 611 throw new ZipException("corrupted zip file");
duke@1 612
duke@1 613 return entry.size;
duke@1 614 }
duke@1 615
duke@1 616 //----------------------------------------------------------------------------
duke@1 617 // Zip utilities
duke@1 618 //----------------------------------------------------------------------------
duke@1 619
jjg@57 620 private byte[] getHeader(Entry entry) throws IOException {
duke@1 621 zipRandomFile.seek(entry.offset);
duke@1 622 byte[] header = new byte[30];
duke@1 623 zipRandomFile.readFully(header);
duke@1 624 if (get4ByteLittleEndian(header, 0) != 0x04034b50)
duke@1 625 throw new ZipException("corrupted zip file");
duke@1 626 if ((get2ByteLittleEndian(header, 6) & 1) != 0)
duke@1 627 throw new ZipException("encrypted zip file"); // offset 6 in the header of the ZipFileEntry
duke@1 628 return header;
duke@1 629 }
duke@1 630
duke@1 631 /*
duke@1 632 * Inflate using the java.util.zip.Inflater class
duke@1 633 */
duke@1 634 private static Inflater inflater;
duke@1 635 private int inflate(byte[] src, byte[] dest) {
duke@1 636
duke@1 637 // construct the inflater object or reuse an existing one
duke@1 638 if (inflater == null)
duke@1 639 inflater = new Inflater(true);
duke@1 640
duke@1 641 synchronized (inflater) {
duke@1 642 inflater.reset();
duke@1 643 inflater.setInput(src);
duke@1 644 try {
duke@1 645 return inflater.inflate(dest);
duke@1 646 } catch (DataFormatException ex) {
duke@1 647 return -1;
duke@1 648 }
duke@1 649 }
duke@1 650 }
duke@1 651
duke@1 652 /**
duke@1 653 * return the two bytes buf[pos], buf[pos+1] as an unsigned integer in little
duke@1 654 * endian format.
duke@1 655 */
duke@1 656 private static int get2ByteLittleEndian(byte[] buf, int pos) {
duke@1 657 return (buf[pos] & 0xFF) + ((buf[pos+1] & 0xFF) << 8);
duke@1 658 }
duke@1 659
duke@1 660 /**
duke@1 661 * return the 4 bytes buf[i..i+3] as an integer in little endian format.
duke@1 662 */
duke@1 663 private static int get4ByteLittleEndian(byte[] buf, int pos) {
duke@1 664 return (buf[pos] & 0xFF) + ((buf[pos + 1] & 0xFF) << 8) +
duke@1 665 ((buf[pos + 2] & 0xFF) << 16) + ((buf[pos + 3] & 0xFF) << 24);
duke@1 666 }
duke@1 667
duke@1 668 /* ----------------------------------------------------------------------------
duke@1 669 * ZipDirectory
duke@1 670 * ----------------------------------------------------------------------------*/
duke@1 671
duke@1 672 private class ZipDirectory {
jjg@103 673 private RelativeDirectory lastDir;
duke@1 674 private int lastStart;
duke@1 675 private int lastLen;
duke@1 676
duke@1 677 byte[] zipDir;
duke@1 678 RandomAccessFile zipRandomFile = null;
duke@1 679 ZipFileIndex zipFileIndex = null;
duke@1 680
duke@1 681 public ZipDirectory(RandomAccessFile zipRandomFile, long start, long end, ZipFileIndex index) throws IOException {
duke@1 682 this.zipRandomFile = zipRandomFile;
duke@1 683 this.zipFileIndex = index;
duke@1 684
duke@1 685 findCENRecord(start, end);
duke@1 686 }
duke@1 687
duke@1 688 /*
duke@1 689 * Reads zip file central directory.
duke@1 690 * For more details see readCEN in zip_util.c from the JDK sources.
duke@1 691 * This is a Java port of that function.
duke@1 692 */
duke@1 693 private void findCENRecord(long start, long end) throws IOException {
duke@1 694 long totalLength = end - start;
duke@1 695 int endbuflen = 1024;
duke@1 696 byte[] endbuf = new byte[endbuflen];
duke@1 697 long endbufend = end - start;
duke@1 698
duke@1 699 // There is a variable-length field after the dir offset record. We need to do consequential search.
duke@1 700 while (endbufend >= 22) {
duke@1 701 if (endbufend < endbuflen)
duke@1 702 endbuflen = (int)endbufend;
duke@1 703 long endbufpos = endbufend - endbuflen;
duke@1 704 zipRandomFile.seek(start + endbufpos);
duke@1 705 zipRandomFile.readFully(endbuf, 0, endbuflen);
duke@1 706 int i = endbuflen - 22;
duke@1 707 while (i >= 0 &&
duke@1 708 !(endbuf[i] == 0x50 &&
duke@1 709 endbuf[i + 1] == 0x4b &&
duke@1 710 endbuf[i + 2] == 0x05 &&
duke@1 711 endbuf[i + 3] == 0x06 &&
duke@1 712 endbufpos + i + 22 +
duke@1 713 get2ByteLittleEndian(endbuf, i + 20) == totalLength)) {
duke@1 714 i--;
duke@1 715 }
duke@1 716
duke@1 717 if (i >= 0) {
duke@1 718 zipDir = new byte[get4ByteLittleEndian(endbuf, i + 12) + 2];
duke@1 719 zipDir[0] = endbuf[i + 10];
duke@1 720 zipDir[1] = endbuf[i + 11];
duke@1 721 zipRandomFile.seek(start + get4ByteLittleEndian(endbuf, i + 16));
duke@1 722 zipRandomFile.readFully(zipDir, 2, zipDir.length - 2);
duke@1 723 return;
duke@1 724 } else {
duke@1 725 endbufend = endbufpos + 21;
duke@1 726 }
duke@1 727 }
duke@1 728 throw new ZipException("cannot read zip file");
duke@1 729 }
jjg@103 730
duke@1 731 private void buildIndex() throws IOException {
duke@1 732 int entryCount = get2ByteLittleEndian(zipDir, 0);
duke@1 733
duke@1 734 // Add each of the files
duke@1 735 if (entryCount > 0) {
jjg@103 736 directories = new HashMap<RelativeDirectory, DirectoryEntry>();
jjg@57 737 ArrayList<Entry> entryList = new ArrayList<Entry>();
duke@1 738 int pos = 2;
duke@1 739 for (int i = 0; i < entryCount; i++) {
duke@1 740 pos = readEntry(pos, entryList, directories);
duke@1 741 }
duke@1 742
duke@1 743 // Add the accumulated dirs into the same list
jjg@103 744 for (RelativeDirectory d: directories.keySet()) {
jjg@103 745 // use shared RelativeDirectory objects for parent dirs
jjg@103 746 RelativeDirectory parent = getRelativeDirectory(d.dirname().getPath());
jjg@103 747 String file = d.basename();
jjg@103 748 Entry zipFileIndexEntry = new Entry(parent, file);
duke@1 749 zipFileIndexEntry.isDir = true;
duke@1 750 entryList.add(zipFileIndexEntry);
duke@1 751 }
duke@1 752
jjg@57 753 entries = entryList.toArray(new Entry[entryList.size()]);
duke@1 754 Arrays.sort(entries);
duke@1 755 } else {
duke@1 756 cleanupState();
duke@1 757 }
duke@1 758 }
duke@1 759
jjg@57 760 private int readEntry(int pos, List<Entry> entryList,
jjg@103 761 Map<RelativeDirectory, DirectoryEntry> directories) throws IOException {
duke@1 762 if (get4ByteLittleEndian(zipDir, pos) != 0x02014b50) {
duke@1 763 throw new ZipException("cannot read zip file entry");
duke@1 764 }
duke@1 765
duke@1 766 int dirStart = pos + 46;
duke@1 767 int fileStart = dirStart;
duke@1 768 int fileEnd = fileStart + get2ByteLittleEndian(zipDir, pos + 28);
duke@1 769
duke@1 770 if (zipFileIndex.symbolFilePrefixLength != 0 &&
duke@1 771 ((fileEnd - fileStart) >= symbolFilePrefixLength)) {
duke@1 772 dirStart += zipFileIndex.symbolFilePrefixLength;
duke@1 773 fileStart += zipFileIndex.symbolFilePrefixLength;
duke@1 774 }
jjg@103 775 // Force any '\' to '/'. Keep the position of the last separator.
duke@1 776 for (int index = fileStart; index < fileEnd; index++) {
duke@1 777 byte nextByte = zipDir[index];
jjg@103 778 if (nextByte == (byte)'\\') {
jjg@103 779 zipDir[index] = (byte)'/';
jjg@103 780 fileStart = index + 1;
jjg@103 781 } else if (nextByte == (byte)'/') {
duke@1 782 fileStart = index + 1;
duke@1 783 }
duke@1 784 }
duke@1 785
jjg@103 786 RelativeDirectory directory = null;
duke@1 787 if (fileStart == dirStart)
jjg@103 788 directory = getRelativeDirectory("");
duke@1 789 else if (lastDir != null && lastLen == fileStart - dirStart - 1) {
duke@1 790 int index = lastLen - 1;
duke@1 791 while (zipDir[lastStart + index] == zipDir[dirStart + index]) {
duke@1 792 if (index == 0) {
duke@1 793 directory = lastDir;
duke@1 794 break;
duke@1 795 }
duke@1 796 index--;
duke@1 797 }
duke@1 798 }
duke@1 799
duke@1 800 // Sub directories
duke@1 801 if (directory == null) {
duke@1 802 lastStart = dirStart;
duke@1 803 lastLen = fileStart - dirStart - 1;
duke@1 804
jjg@103 805 directory = getRelativeDirectory(new String(zipDir, dirStart, lastLen, "UTF-8"));
duke@1 806 lastDir = directory;
duke@1 807
duke@1 808 // Enter also all the parent directories
jjg@103 809 RelativeDirectory tempDirectory = directory;
duke@1 810
duke@1 811 while (directories.get(tempDirectory) == null) {
duke@1 812 directories.put(tempDirectory, new DirectoryEntry(tempDirectory, zipFileIndex));
jjg@103 813 if (tempDirectory.path.indexOf("/") == tempDirectory.path.length() - 1)
duke@1 814 break;
jjg@103 815 else {
jjg@103 816 // use shared RelativeDirectory objects for parent dirs
jjg@103 817 tempDirectory = getRelativeDirectory(tempDirectory.dirname().getPath());
jjg@103 818 }
duke@1 819 }
duke@1 820 }
duke@1 821 else {
duke@1 822 if (directories.get(directory) == null) {
duke@1 823 directories.put(directory, new DirectoryEntry(directory, zipFileIndex));
duke@1 824 }
duke@1 825 }
duke@1 826
duke@1 827 // For each dir create also a file
duke@1 828 if (fileStart != fileEnd) {
jjg@57 829 Entry entry = new Entry(directory,
duke@1 830 new String(zipDir, fileStart, fileEnd - fileStart, "UTF-8"));
duke@1 831
duke@1 832 entry.setNativeTime(get4ByteLittleEndian(zipDir, pos + 12));
duke@1 833 entry.compressedSize = get4ByteLittleEndian(zipDir, pos + 20);
duke@1 834 entry.size = get4ByteLittleEndian(zipDir, pos + 24);
duke@1 835 entry.offset = get4ByteLittleEndian(zipDir, pos + 42);
duke@1 836 entryList.add(entry);
duke@1 837 }
duke@1 838
duke@1 839 return pos + 46 +
duke@1 840 get2ByteLittleEndian(zipDir, pos + 28) +
duke@1 841 get2ByteLittleEndian(zipDir, pos + 30) +
duke@1 842 get2ByteLittleEndian(zipDir, pos + 32);
duke@1 843 }
duke@1 844 }
duke@1 845
duke@1 846 /**
duke@1 847 * Returns the last modified timestamp of a zip file.
duke@1 848 * @return long
duke@1 849 */
duke@1 850 public long getZipFileLastModified() throws IOException {
duke@1 851 lock.lock();
duke@1 852 try {
duke@1 853 checkIndex();
duke@1 854 return zipFileLastModified;
duke@1 855 }
duke@1 856 finally {
duke@1 857 lock.unlock();
duke@1 858 }
duke@1 859 }
duke@1 860
duke@1 861 /** ------------------------------------------------------------------------
duke@1 862 * DirectoryEntry class
duke@1 863 * -------------------------------------------------------------------------*/
jjg@57 864
duke@1 865 static class DirectoryEntry {
duke@1 866 private boolean filesInited;
duke@1 867 private boolean directoriesInited;
duke@1 868 private boolean zipFileEntriesInited;
duke@1 869 private boolean entriesInited;
duke@1 870
duke@1 871 private long writtenOffsetOffset = 0;
duke@1 872
jjg@103 873 private RelativeDirectory dirName;
duke@1 874
duke@1 875 private com.sun.tools.javac.util.List<String> zipFileEntriesFiles = com.sun.tools.javac.util.List.<String>nil();
duke@1 876 private com.sun.tools.javac.util.List<String> zipFileEntriesDirectories = com.sun.tools.javac.util.List.<String>nil();
jjg@57 877 private com.sun.tools.javac.util.List<Entry> zipFileEntries = com.sun.tools.javac.util.List.<Entry>nil();
duke@1 878
jjg@57 879 private List<Entry> entries = new ArrayList<Entry>();
duke@1 880
duke@1 881 private ZipFileIndex zipFileIndex;
duke@1 882
duke@1 883 private int numEntries;
duke@1 884
jjg@103 885 DirectoryEntry(RelativeDirectory dirName, ZipFileIndex index) {
jjg@103 886 filesInited = false;
duke@1 887 directoriesInited = false;
duke@1 888 entriesInited = false;
duke@1 889
jjg@103 890 this.dirName = dirName;
duke@1 891 this.zipFileIndex = index;
duke@1 892 }
duke@1 893
duke@1 894 private com.sun.tools.javac.util.List<String> getFiles() {
jjg@103 895 if (!filesInited) {
jjg@103 896 initEntries();
jjg@103 897 for (Entry e : entries) {
jjg@103 898 if (!e.isDir) {
jjg@103 899 zipFileEntriesFiles = zipFileEntriesFiles.append(e.name);
jjg@103 900 }
jjg@103 901 }
jjg@103 902 filesInited = true;
duke@1 903 }
duke@1 904 return zipFileEntriesFiles;
duke@1 905 }
duke@1 906
duke@1 907 private com.sun.tools.javac.util.List<String> getDirectories() {
jjg@103 908 if (!directoriesInited) {
jjg@103 909 initEntries();
jjg@103 910 for (Entry e : entries) {
jjg@103 911 if (e.isDir) {
jjg@103 912 zipFileEntriesDirectories = zipFileEntriesDirectories.append(e.name);
jjg@103 913 }
jjg@103 914 }
jjg@103 915 directoriesInited = true;
duke@1 916 }
duke@1 917 return zipFileEntriesDirectories;
duke@1 918 }
duke@1 919
jjg@57 920 private com.sun.tools.javac.util.List<Entry> getEntries() {
jjg@103 921 if (!zipFileEntriesInited) {
jjg@103 922 initEntries();
jjg@103 923 zipFileEntries = com.sun.tools.javac.util.List.nil();
jjg@103 924 for (Entry zfie : entries) {
jjg@103 925 zipFileEntries = zipFileEntries.append(zfie);
jjg@103 926 }
jjg@103 927 zipFileEntriesInited = true;
duke@1 928 }
duke@1 929 return zipFileEntries;
duke@1 930 }
duke@1 931
jjg@57 932 private Entry getEntry(String rootName) {
duke@1 933 initEntries();
jjg@57 934 int index = Collections.binarySearch(entries, new Entry(dirName, rootName));
duke@1 935 if (index < 0) {
duke@1 936 return null;
duke@1 937 }
duke@1 938
duke@1 939 return entries.get(index);
duke@1 940 }
duke@1 941
duke@1 942 private void initEntries() {
duke@1 943 if (entriesInited) {
duke@1 944 return;
duke@1 945 }
duke@1 946
duke@1 947 if (!zipFileIndex.readFromIndex) {
duke@1 948 int from = -Arrays.binarySearch(zipFileIndex.entries,
jjg@57 949 new Entry(dirName, ZipFileIndex.MIN_CHAR)) - 1;
duke@1 950 int to = -Arrays.binarySearch(zipFileIndex.entries,
jjg@57 951 new Entry(dirName, MAX_CHAR)) - 1;
duke@1 952
duke@1 953 for (int i = from; i < to; i++) {
duke@1 954 entries.add(zipFileIndex.entries[i]);
duke@1 955 }
duke@1 956 } else {
duke@1 957 File indexFile = zipFileIndex.getIndexFile();
duke@1 958 if (indexFile != null) {
duke@1 959 RandomAccessFile raf = null;
duke@1 960 try {
duke@1 961 raf = new RandomAccessFile(indexFile, "r");
duke@1 962 raf.seek(writtenOffsetOffset);
duke@1 963
duke@1 964 for (int nFiles = 0; nFiles < numEntries; nFiles++) {
duke@1 965 // Read the name bytes
duke@1 966 int zfieNameBytesLen = raf.readInt();
duke@1 967 byte [] zfieNameBytes = new byte[zfieNameBytesLen];
duke@1 968 raf.read(zfieNameBytes);
duke@1 969 String eName = new String(zfieNameBytes, "UTF-8");
duke@1 970
duke@1 971 // Read isDir
duke@1 972 boolean eIsDir = raf.readByte() == (byte)0 ? false : true;
duke@1 973
duke@1 974 // Read offset of bytes in the real Jar/Zip file
duke@1 975 int eOffset = raf.readInt();
duke@1 976
duke@1 977 // Read size of the file in the real Jar/Zip file
duke@1 978 int eSize = raf.readInt();
duke@1 979
duke@1 980 // Read compressed size of the file in the real Jar/Zip file
duke@1 981 int eCsize = raf.readInt();
duke@1 982
duke@1 983 // Read java time stamp of the file in the real Jar/Zip file
duke@1 984 long eJavaTimestamp = raf.readLong();
duke@1 985
jjg@57 986 Entry rfie = new Entry(dirName, eName);
duke@1 987 rfie.isDir = eIsDir;
duke@1 988 rfie.offset = eOffset;
duke@1 989 rfie.size = eSize;
duke@1 990 rfie.compressedSize = eCsize;
duke@1 991 rfie.javatime = eJavaTimestamp;
duke@1 992 entries.add(rfie);
duke@1 993 }
duke@1 994 } catch (Throwable t) {
duke@1 995 // Do nothing
duke@1 996 } finally {
duke@1 997 try {
duke@1 998 if (raf == null) {
duke@1 999 raf.close();
duke@1 1000 }
duke@1 1001 } catch (Throwable t) {
duke@1 1002 // Do nothing
duke@1 1003 }
duke@1 1004 }
duke@1 1005 }
duke@1 1006 }
duke@1 1007
duke@1 1008 entriesInited = true;
duke@1 1009 }
duke@1 1010
jjg@57 1011 List<Entry> getEntriesAsCollection() {
duke@1 1012 initEntries();
duke@1 1013
duke@1 1014 return entries;
duke@1 1015 }
duke@1 1016 }
duke@1 1017
duke@1 1018 private boolean readIndex() {
duke@1 1019 if (triedToReadIndex || !usePreindexedCache) {
duke@1 1020 return false;
duke@1 1021 }
duke@1 1022
duke@1 1023 boolean ret = false;
duke@1 1024 lock.lock();
duke@1 1025 try {
duke@1 1026 triedToReadIndex = true;
duke@1 1027 RandomAccessFile raf = null;
duke@1 1028 try {
duke@1 1029 File indexFileName = getIndexFile();
duke@1 1030 raf = new RandomAccessFile(indexFileName, "r");
duke@1 1031
duke@1 1032 long fileStamp = raf.readLong();
duke@1 1033 if (zipFile.lastModified() != fileStamp) {
duke@1 1034 ret = false;
duke@1 1035 } else {
jjg@103 1036 directories = new HashMap<RelativeDirectory, DirectoryEntry>();
duke@1 1037 int numDirs = raf.readInt();
duke@1 1038 for (int nDirs = 0; nDirs < numDirs; nDirs++) {
duke@1 1039 int dirNameBytesLen = raf.readInt();
duke@1 1040 byte [] dirNameBytes = new byte[dirNameBytesLen];
duke@1 1041 raf.read(dirNameBytes);
duke@1 1042
jjg@103 1043 RelativeDirectory dirNameStr = getRelativeDirectory(new String(dirNameBytes, "UTF-8"));
duke@1 1044 DirectoryEntry de = new DirectoryEntry(dirNameStr, this);
duke@1 1045 de.numEntries = raf.readInt();
duke@1 1046 de.writtenOffsetOffset = raf.readLong();
duke@1 1047 directories.put(dirNameStr, de);
duke@1 1048 }
duke@1 1049 ret = true;
duke@1 1050 zipFileLastModified = fileStamp;
duke@1 1051 }
duke@1 1052 } catch (Throwable t) {
duke@1 1053 // Do nothing
duke@1 1054 } finally {
duke@1 1055 if (raf != null) {
duke@1 1056 try {
duke@1 1057 raf.close();
duke@1 1058 } catch (Throwable tt) {
duke@1 1059 // Do nothing
duke@1 1060 }
duke@1 1061 }
duke@1 1062 }
duke@1 1063 if (ret == true) {
duke@1 1064 readFromIndex = true;
duke@1 1065 }
duke@1 1066 }
duke@1 1067 finally {
duke@1 1068 lock.unlock();
duke@1 1069 }
duke@1 1070
duke@1 1071 return ret;
duke@1 1072 }
duke@1 1073
duke@1 1074 private boolean writeIndex() {
duke@1 1075 boolean ret = false;
duke@1 1076 if (readFromIndex || !usePreindexedCache) {
duke@1 1077 return true;
duke@1 1078 }
duke@1 1079
duke@1 1080 if (!writeIndex) {
duke@1 1081 return true;
duke@1 1082 }
duke@1 1083
duke@1 1084 File indexFile = getIndexFile();
duke@1 1085 if (indexFile == null) {
duke@1 1086 return false;
duke@1 1087 }
duke@1 1088
duke@1 1089 RandomAccessFile raf = null;
duke@1 1090 long writtenSoFar = 0;
duke@1 1091 try {
duke@1 1092 raf = new RandomAccessFile(indexFile, "rw");
duke@1 1093
duke@1 1094 raf.writeLong(zipFileLastModified);
duke@1 1095 writtenSoFar += 8;
duke@1 1096
duke@1 1097 List<DirectoryEntry> directoriesToWrite = new ArrayList<DirectoryEntry>();
jjg@103 1098 Map<RelativeDirectory, Long> offsets = new HashMap<RelativeDirectory, Long>();
duke@1 1099 raf.writeInt(directories.keySet().size());
duke@1 1100 writtenSoFar += 4;
duke@1 1101
jjg@103 1102 for (RelativeDirectory dirName: directories.keySet()) {
duke@1 1103 DirectoryEntry dirEntry = directories.get(dirName);
duke@1 1104
duke@1 1105 directoriesToWrite.add(dirEntry);
duke@1 1106
duke@1 1107 // Write the dir name bytes
jjg@103 1108 byte [] dirNameBytes = dirName.getPath().getBytes("UTF-8");
duke@1 1109 int dirNameBytesLen = dirNameBytes.length;
duke@1 1110 raf.writeInt(dirNameBytesLen);
duke@1 1111 writtenSoFar += 4;
duke@1 1112
duke@1 1113 raf.write(dirNameBytes);
duke@1 1114 writtenSoFar += dirNameBytesLen;
duke@1 1115
duke@1 1116 // Write the number of files in the dir
mcimadamore@184 1117 List<Entry> dirEntries = dirEntry.getEntriesAsCollection();
duke@1 1118 raf.writeInt(dirEntries.size());
duke@1 1119 writtenSoFar += 4;
duke@1 1120
duke@1 1121 offsets.put(dirName, new Long(writtenSoFar));
duke@1 1122
duke@1 1123 // Write the offset of the file's data in the dir
duke@1 1124 dirEntry.writtenOffsetOffset = 0L;
duke@1 1125 raf.writeLong(0L);
duke@1 1126 writtenSoFar += 8;
duke@1 1127 }
duke@1 1128
duke@1 1129 for (DirectoryEntry de : directoriesToWrite) {
duke@1 1130 // Fix up the offset in the directory table
duke@1 1131 long currFP = raf.getFilePointer();
duke@1 1132
duke@1 1133 long offsetOffset = offsets.get(de.dirName).longValue();
duke@1 1134 raf.seek(offsetOffset);
duke@1 1135 raf.writeLong(writtenSoFar);
duke@1 1136
duke@1 1137 raf.seek(currFP);
duke@1 1138
duke@1 1139 // Now write each of the files in the DirectoryEntry
jjg@57 1140 List<Entry> entries = de.getEntriesAsCollection();
jjg@57 1141 for (Entry zfie : entries) {
duke@1 1142 // Write the name bytes
duke@1 1143 byte [] zfieNameBytes = zfie.name.getBytes("UTF-8");
duke@1 1144 int zfieNameBytesLen = zfieNameBytes.length;
duke@1 1145 raf.writeInt(zfieNameBytesLen);
duke@1 1146 writtenSoFar += 4;
duke@1 1147 raf.write(zfieNameBytes);
duke@1 1148 writtenSoFar += zfieNameBytesLen;
duke@1 1149
duke@1 1150 // Write isDir
duke@1 1151 raf.writeByte(zfie.isDir ? (byte)1 : (byte)0);
duke@1 1152 writtenSoFar += 1;
duke@1 1153
duke@1 1154 // Write offset of bytes in the real Jar/Zip file
duke@1 1155 raf.writeInt(zfie.offset);
duke@1 1156 writtenSoFar += 4;
duke@1 1157
duke@1 1158 // Write size of the file in the real Jar/Zip file
duke@1 1159 raf.writeInt(zfie.size);
duke@1 1160 writtenSoFar += 4;
duke@1 1161
duke@1 1162 // Write compressed size of the file in the real Jar/Zip file
duke@1 1163 raf.writeInt(zfie.compressedSize);
duke@1 1164 writtenSoFar += 4;
duke@1 1165
duke@1 1166 // Write java time stamp of the file in the real Jar/Zip file
duke@1 1167 raf.writeLong(zfie.getLastModified());
duke@1 1168 writtenSoFar += 8;
duke@1 1169 }
duke@1 1170 }
duke@1 1171 } catch (Throwable t) {
duke@1 1172 // Do nothing
duke@1 1173 } finally {
duke@1 1174 try {
duke@1 1175 if (raf != null) {
duke@1 1176 raf.close();
duke@1 1177 }
duke@1 1178 } catch(IOException ioe) {
duke@1 1179 // Do nothing
duke@1 1180 }
duke@1 1181 }
duke@1 1182
duke@1 1183 return ret;
duke@1 1184 }
duke@1 1185
duke@1 1186 public boolean writeZipIndex() {
duke@1 1187 lock.lock();
duke@1 1188 try {
duke@1 1189 return writeIndex();
duke@1 1190 }
duke@1 1191 finally {
duke@1 1192 lock.unlock();
duke@1 1193 }
duke@1 1194 }
duke@1 1195
duke@1 1196 private File getIndexFile() {
duke@1 1197 if (zipIndexFile == null) {
duke@1 1198 if (zipFile == null) {
duke@1 1199 return null;
duke@1 1200 }
duke@1 1201
duke@1 1202 zipIndexFile = new File((preindexedCacheLocation == null ? "" : preindexedCacheLocation) +
duke@1 1203 zipFile.getName() + ".index");
duke@1 1204 }
duke@1 1205
duke@1 1206 return zipIndexFile;
duke@1 1207 }
duke@1 1208
duke@1 1209 public File getZipFile() {
duke@1 1210 return zipFile;
duke@1 1211 }
jjg@57 1212
jjg@103 1213 private RelativeDirectory getRelativeDirectory(String path) {
jjg@103 1214 RelativeDirectory rd;
jjg@103 1215 SoftReference<RelativeDirectory> ref = relativeDirectoryCache.get(path);
jjg@103 1216 if (ref != null) {
jjg@103 1217 rd = ref.get();
jjg@103 1218 if (rd != null)
jjg@103 1219 return rd;
jjg@103 1220 }
jjg@103 1221 rd = new RelativeDirectory(path);
jjg@103 1222 relativeDirectoryCache.put(path, new SoftReference<RelativeDirectory>(rd));
jjg@103 1223 return rd;
jjg@103 1224 }
jjg@57 1225
jjg@57 1226 static class Entry implements Comparable<Entry> {
jjg@57 1227 public static final Entry[] EMPTY_ARRAY = {};
jjg@57 1228
jjg@57 1229 // Directory related
jjg@103 1230 RelativeDirectory dir;
jjg@57 1231 boolean isDir;
jjg@57 1232
jjg@57 1233 // File related
jjg@57 1234 String name;
jjg@57 1235
jjg@57 1236 int offset;
jjg@57 1237 int size;
jjg@57 1238 int compressedSize;
jjg@57 1239 long javatime;
jjg@57 1240
jjg@57 1241 private int nativetime;
jjg@57 1242
jjg@103 1243 public Entry(RelativePath path) {
jjg@103 1244 this(path.dirname(), path.basename());
jjg@57 1245 }
jjg@57 1246
jjg@103 1247 public Entry(RelativeDirectory directory, String name) {
jjg@103 1248 this.dir = directory;
jjg@57 1249 this.name = name;
jjg@57 1250 }
jjg@57 1251
jjg@57 1252 public String getName() {
jjg@103 1253 return new RelativeFile(dir, name).getPath();
jjg@57 1254 }
jjg@57 1255
jjg@57 1256 public String getFileName() {
jjg@57 1257 return name;
jjg@57 1258 }
jjg@57 1259
jjg@57 1260 public long getLastModified() {
jjg@57 1261 if (javatime == 0) {
jjg@57 1262 javatime = dosToJavaTime(nativetime);
jjg@57 1263 }
jjg@57 1264 return javatime;
jjg@57 1265 }
jjg@57 1266
jjg@71 1267 // based on dosToJavaTime in java.util.Zip, but avoiding the
jjg@71 1268 // use of deprecated Date constructor
jjg@71 1269 private static long dosToJavaTime(int dtime) {
jjg@71 1270 Calendar c = Calendar.getInstance();
jjg@71 1271 c.set(Calendar.YEAR, ((dtime >> 25) & 0x7f) + 1980);
jjg@71 1272 c.set(Calendar.MONTH, ((dtime >> 21) & 0x0f) - 1);
jjg@71 1273 c.set(Calendar.DATE, ((dtime >> 16) & 0x1f));
jjg@71 1274 c.set(Calendar.HOUR_OF_DAY, ((dtime >> 11) & 0x1f));
jjg@71 1275 c.set(Calendar.MINUTE, ((dtime >> 5) & 0x3f));
jjg@71 1276 c.set(Calendar.SECOND, ((dtime << 1) & 0x3e));
jjg@71 1277 c.set(Calendar.MILLISECOND, 0);
jjg@71 1278 return c.getTimeInMillis();
jjg@57 1279 }
jjg@57 1280
jjg@57 1281 void setNativeTime(int natTime) {
jjg@57 1282 nativetime = natTime;
jjg@57 1283 }
jjg@57 1284
jjg@57 1285 public boolean isDirectory() {
jjg@57 1286 return isDir;
jjg@57 1287 }
jjg@57 1288
jjg@57 1289 public int compareTo(Entry other) {
jjg@103 1290 RelativeDirectory otherD = other.dir;
jjg@57 1291 if (dir != otherD) {
jjg@57 1292 int c = dir.compareTo(otherD);
jjg@57 1293 if (c != 0)
jjg@57 1294 return c;
jjg@57 1295 }
jjg@57 1296 return name.compareTo(other.name);
jjg@57 1297 }
jjg@57 1298
jjg@103 1299 @Override
jjg@103 1300 public boolean equals(Object o) {
jjg@103 1301 if (!(o instanceof Entry))
jjg@103 1302 return false;
jjg@103 1303 Entry other = (Entry) o;
jjg@103 1304 return dir.equals(other.dir) && name.equals(other.name);
jjg@103 1305 }
jjg@103 1306
jjg@103 1307 @Override
jjg@103 1308 public int hashCode() {
jjg@103 1309 int hash = 7;
jjg@103 1310 hash = 97 * hash + (this.dir != null ? this.dir.hashCode() : 0);
jjg@103 1311 hash = 97 * hash + (this.name != null ? this.name.hashCode() : 0);
jjg@103 1312 return hash;
jjg@103 1313 }
jjg@103 1314
jjg@57 1315
jjg@57 1316 public String toString() {
jjg@57 1317 return isDir ? ("Dir:" + dir + " : " + name) :
jjg@57 1318 (dir + ":" + name);
jjg@57 1319 }
jjg@57 1320 }
jjg@57 1321
duke@1 1322 }

mercurial