File cache improvement, deleting old temp files

This commit is contained in:
Jindra Petřík
2014-11-23 19:44:05 +01:00
parent af13faa786
commit abb3ec9dc7
11 changed files with 485 additions and 102 deletions

View File

@@ -289,8 +289,8 @@ public class IdentifiersDeobfuscation {
return "\u00A7" + escapeOIdentifier(s) + "\u00A7";
}
private static final Cache<String, String> as3NameCache = Cache.getInstance(false);
private static final Cache<String, String> as2NameCache = Cache.getInstance(false);
private static final Cache<String, String> as3NameCache = Cache.getInstance(false,"as3_ident");
private static final Cache<String, String> as2NameCache = Cache.getInstance(false,"as2_ident");
/**
* Ensures identifier is valid and if not, uses paragraph syntax

View File

@@ -278,9 +278,9 @@ public final class SWF implements SWFContainerItem, Timelined {
public DumpInfoSwfNode dumpInfo;
public DefineBinaryDataTag binaryData;
private static Cache<String, SerializableImage> frameCache = Cache.getInstance(false);
private final Cache<ASMSource, CachedScript> as2Cache = Cache.getInstance(true);
private final Cache<ScriptPack, CachedDecompilation> as3Cache = Cache.getInstance(true);
private static Cache<String, SerializableImage> frameCache = Cache.getInstance(false,"frame");
private final Cache<ASMSource, CachedScript> as2Cache = Cache.getInstance(true,"as2");
private final Cache<ScriptPack, CachedDecompilation> as3Cache = Cache.getInstance(true,"as3");
public void updateCharacters() {
characters.clear();

View File

@@ -207,7 +207,7 @@ public class DefineButton2Tag extends ButtonTag implements Container {
return modified;
}
private static final Cache<DefineButton2Tag, RECT> rectCache = Cache.getInstance(true);
private static final Cache<DefineButton2Tag, RECT> rectCache = Cache.getInstance(true,"rect_button2");
@Override
public RECT getRect(Set<BoundedTag> added) {

View File

@@ -245,7 +245,7 @@ public class DefineButtonTag extends ButtonTag implements ASMSource {
return modified;
}
private static final Cache<DefineButtonTag, RECT> rectCache = Cache.getInstance(true);
private static final Cache<DefineButtonTag, RECT> rectCache = Cache.getInstance(true,"rect_button");
@Override
public RECT getRect(Set<BoundedTag> added) {

View File

@@ -122,7 +122,7 @@ public class DefineSpriteTag extends CharacterTag implements Container, Drawable
return ret;
}
private static final Cache<DefineSpriteTag, RECT> rectCache = Cache.getInstance(true);
private static final Cache<DefineSpriteTag, RECT> rectCache = Cache.getInstance(true,"rect_sprite");
@Override
public RECT getRect(Set<BoundedTag> added) {

View File

@@ -16,20 +16,14 @@
*/
package com.jpexs.helpers;
import com.jpexs.decompiler.flash.helpers.Freed;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
import java.io.Serializable;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.WeakHashMap;
import java.util.logging.Level;
import java.util.logging.Logger;
/**
*
@@ -37,16 +31,31 @@ import java.util.logging.Logger;
* @param <K>
* @param <V>
*/
public class Cache<K, V> {
public class Cache<K, V> implements Freed {
private final Map<K, File> cacheFiles;
private final Map<K, V> cacheMemory;
private Map<K, V> cache;
private static final List<Cache> instances = new ArrayList<>();
public static final int STORAGE_FILES = 1;
public static final int STORAGE_MEMORY = 2;
private boolean weak;
private String name;
public static <K, V> Cache<K, V> getInstance(boolean weak) {
Cache<K, V> instance = new Cache<>(weak);
static {
Runtime.getRuntime().addShutdownHook(new Thread(){
@Override
public void run() {
for (Cache c : instances) {
c.clear();
c.free();
}
}
});
}
public static <K, V> Cache<K, V> getInstance(boolean weak,String name) {
Cache<K, V> instance = new Cache<>(weak,name);
instances.add(instance);
return instance;
}
@@ -56,6 +65,7 @@ public class Cache<K, V> {
public static void clearAll() {
for (Cache c : instances) {
c.clear();
c.initCache();
}
}
@@ -80,103 +90,66 @@ public class Cache<K, V> {
return storageType;
}
private Cache(boolean weak) {
if (weak) {
cacheFiles = new WeakHashMap<>();
cacheMemory = new WeakHashMap<>();
} else {
cacheFiles = new HashMap<>();
cacheMemory = new HashMap<>();
private void initCache() {
int thisStorageType = storageType;
Map<K, V> newCache = null;
if (thisStorageType == STORAGE_FILES) {
try {
newCache = new FileHashMap<>(File.createTempFile("ffdec_cache_"+name+"_", ".tmp"));
} catch (IOException ex) {
thisStorageType = STORAGE_MEMORY;
}
}
if (thisStorageType == STORAGE_MEMORY) {
if (weak) {
newCache = new WeakHashMap<>();
} else {
newCache = new HashMap<>();
}
}
if (this.cache instanceof Freed) {
((Freed) this.cache).free();
}
this.cache = newCache;
}
private Cache(boolean weak,String name) {
this.weak = weak;
this.name = name;
initCache();
}
public synchronized boolean contains(K key) {
if (storageType == STORAGE_FILES) {
return cacheFiles.containsKey(key);
} else if (storageType == STORAGE_MEMORY) {
return cacheMemory.containsKey(key);
}
return false;
return cache.containsKey(key);
}
public synchronized void clear() {
cacheMemory.clear();
for (File f : cacheFiles.values()) {
f.delete();
}
cacheFiles.clear();
cache.clear();
}
public synchronized void remove(K key) {
if (storageType == STORAGE_FILES) {
if (cacheFiles.containsKey(key)) {
File f = cacheFiles.get(key);
f.delete();
cacheFiles.remove(key);
}
} else if (storageType == STORAGE_MEMORY) {
if (cacheMemory.containsKey(key)) {
cacheMemory.remove(key);
}
if (cache.containsKey(key)) {
cache.remove(key);
}
}
public synchronized V get(K key) {
if (storageType == STORAGE_FILES) {
if (!cacheFiles.containsKey(key)) {
return null;
}
File f = cacheFiles.get(key);
try (FileInputStream fis = new FileInputStream(f)) {
ObjectInputStream ois = new ObjectInputStream(fis);
@SuppressWarnings("unchecked")
V item = (V) ois.readObject();
return item;
} catch (IOException | ClassNotFoundException ex) {
Logger.getLogger(Cache.class.getName()).log(Level.SEVERE, null, ex);
}
return null;
} else if (storageType == STORAGE_MEMORY) {
if (cacheMemory.containsKey(key)) {
return cacheMemory.get(key);
}
return null;
}
return null;
return cache.get(key);
}
public synchronized void put(K key, V value) {
if (storageType == STORAGE_FILES) {
File temp = null;
try {
temp = File.createTempFile("ffdec_cache", ".tmp");
} catch (IOException ex) {
Logger.getLogger(Cache.class.getName()).log(Level.SEVERE, null, ex);
cache.put(key, value);
}
return;
}
try {
temp.deleteOnExit();
} catch (IllegalStateException iex) {
return;
}
try (ObjectOutputStream oos = new ObjectOutputStream(new FileOutputStream(temp))) {
if (value instanceof Serializable) {
oos.writeObject(value);
} else {
// Object serialization not supported
return;
}
oos.flush();
@Override
public boolean isFreeing() {
throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates.
}
cacheFiles.put(key, temp);
} catch (IOException ex) {
//ignore
}
} else if (storageType == STORAGE_MEMORY) {
cacheMemory.put(key, value);
@Override
public void free() {
if(cache instanceof Freed){
((Freed)cache).free();
}
}
}

View File

@@ -0,0 +1,313 @@
package com.jpexs.helpers;
import com.jpexs.decompiler.flash.helpers.Freed;
import java.io.ByteArrayInputStream;
import java.io.ByteArrayOutputStream;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
import java.io.RandomAccessFile;
import java.util.AbstractMap;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.TreeSet;
import java.util.logging.Level;
import java.util.logging.Logger;
/**
*
* @author JPEXS
*/
public class FileHashMap<K, V> extends AbstractMap<K, V> implements Freed {
private final Map<K, Integer> lengths = new HashMap<>();
private final Map<K, Long> offsets = new HashMap<>();
private long fileLen = 0;
private final RandomAccessFile file;
private final File fileName;
private final Set<Gap> gaps = new TreeSet<>();
private int maxGapLen = 0;
private boolean deleted = false;
private static class Gap implements Comparable<Gap> {
public long offset;
public int length;
public Gap(long offset, int length) {
this.offset = offset;
this.length = length;
}
@Override
public int compareTo(Gap o) {
return o.length - length;
}
@Override
public int hashCode() {
int hash = 7;
hash = 97 * hash + (int) (this.offset ^ (this.offset >>> 32));
return hash;
}
@Override
public boolean equals(Object obj) {
if (obj == null) {
return false;
}
if (getClass() != obj.getClass()) {
return false;
}
final Gap other = (Gap) obj;
if (this.offset != other.offset) {
return false;
}
return true;
}
}
public static class FileEntry<K, V> implements Map.Entry<K, V> {
private FileHashMap<K, V> parent;
private K key;
public FileEntry(FileHashMap<K, V> parent, K key) {
this.parent = parent;
this.key = key;
}
@Override
public K getKey() {
return key;
}
@Override
public V getValue() {
return parent.get(key);
}
@Override
public V setValue(V value) {
return parent.put(key, value);
}
}
public FileHashMap(File file) throws IOException {
this.file = new RandomAccessFile(file, "rw");
this.file.setLength(0);
this.fileName = file;
file.deleteOnExit();
}
@Override
public boolean containsKey(Object key) {
if(deleted){
throw new NullPointerException();
}
return offsets.containsKey(key);
}
@Override
public Set<K> keySet() {
if(deleted){
throw new NullPointerException();
}
return offsets.keySet();
}
@Override
public V get(Object key) {
if(deleted){
throw new NullPointerException();
}
try {
if (!offsets.containsKey(key)) {
return null;
}
long ofs = offsets.get(key);
int len = lengths.get(key);
file.seek(ofs);
byte data[] = new byte[len];
file.readFully(data);
ObjectInputStream ois = new ObjectInputStream(new ByteArrayInputStream(data));
try {
@SuppressWarnings("unchecked")
V ret = (V) ois.readObject();
return ret;
} catch (ClassNotFoundException ex) {
Logger.getLogger(FileHashMap.class.getName()).log(Level.SEVERE, null, ex);
return null;
}
} catch (IOException ex) {
Logger.getLogger(FileHashMap.class.getName()).log(Level.SEVERE, null, ex);
return null;
}
}
@Override
public synchronized V put(K key, V value) {
if(deleted){
throw new NullPointerException();
}
ObjectOutputStream oos = null;
try {
ByteArrayOutputStream baos = new ByteArrayOutputStream();
oos = new ObjectOutputStream(baos);
oos.writeObject(value);
oos.flush();
byte data[] = baos.toByteArray();
if (offsets.containsKey(key)) {
long origOffset = offsets.get(key);
int origLen = lengths.get(key);
if (data.length <= origLen) {
file.seek(origOffset);
file.write(data);
lengths.put(key, data.length);
if (data.length < origLen) {
Gap g = new Gap(origOffset + data.length, origLen - data.length);
if (g.length > maxGapLen) {
maxGapLen = g.length;
}
gaps.add(g);
}
return value;
}
}
if (data.length <= maxGapLen) {
for (Iterator<Gap> i = gaps.iterator(); i.hasNext();) {
Gap g = i.next();
if (g.length >= data.length) {
file.seek(g.offset);
file.write(data);
offsets.put(key, g.offset);
lengths.put(key, g.length);
if (g.length > data.length) {
g.offset = g.offset + data.length;
g.length = g.length - data.length;
} else {
i.remove();
}
}
}
} else {
file.seek(fileLen);
file.write(data);
offsets.put(key, fileLen);
lengths.put(key, data.length);
fileLen += data.length;
}
} catch (IOException ex) {
Logger.getLogger(FileHashMap.class.getName()).log(Level.SEVERE, null, ex);
} finally {
try {
oos.close();
} catch (IOException ex) {
//ignore
}
}
return value;
}
@Override
public V remove(Object objKey) {
if(deleted){
throw new NullPointerException();
}
@SuppressWarnings("unchecked")
K key=(K)objKey;
if (!containsKey(key)) {
return null;
}
V val = get((K) key);
Gap g = new Gap(offsets.get(key), lengths.get(key));
offsets.remove(key);
lengths.remove(key);
if (g.offset + g.length == fileLen) {
fileLen -= g.length;
} else {
if (g.length > maxGapLen) {
maxGapLen = g.length;
}
gaps.add(g);
}
return val;
}
@Override
public Set<Entry<K, V>> entrySet() {
if(deleted){
throw new NullPointerException();
}
Set<Entry<K,V>> ret=new HashSet<Entry<K, V>>();
for(K key:keySet()){
ret.add(new FileEntry<K,V>(this,key));
}
return ret;
}
@Override
public void clear() {
if(deleted){
throw new NullPointerException();
}
offsets.clear();
lengths.clear();
fileLen = 0;
maxGapLen = 0;
try {
file.setLength(0);
} catch (IOException ex) {
Logger.getLogger(FileHashMap.class.getName()).log(Level.SEVERE, null, ex);
}
}
public void delete() {
if(deleted){
throw new NullPointerException();
}
try {
file.close();
} catch (IOException ex) {
Logger.getLogger(FileHashMap.class.getName()).log(Level.SEVERE, null, ex);
}
fileName.delete();
deleted = true;
}
@Override
public boolean isFreeing() {
return !deleted;
}
@Override
public void free() {
if(!deleted){
delete();
}
}
@Override
public boolean isEmpty() {
return offsets.isEmpty();
}
@Override
public int size() {
return offsets.size();
}
}