org.zbus.mq.disk.DiskQueuePool Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of zbus Show documentation
Show all versions of zbus Show documentation
lightweight message queue, service bus
/**
* The MIT License (MIT)
* Copyright (c) 2009-2015 HONG LEIMING
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* 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 OR COPYRIGHT HOLDERS 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.
*/
package org.zbus.mq.disk;
import java.io.Closeable;
import java.io.File;
import java.io.FilenameFilter;
import java.io.IOException;
import java.util.Map;
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.Executors;
import java.util.concurrent.LinkedBlockingQueue;
import java.util.concurrent.ScheduledExecutorService;
import java.util.concurrent.TimeUnit;
import org.zbus.kit.log.Logger;
import org.zbus.kit.log.LoggerFactory;
/**
* Many thanks to @huamingweiwen in OSChina who presented us a light weight solution
* of disk-based queue design and implementation, DiskQueuePool is mainly refined from
* his brilliant work.
*
* http://my.oschina.net/xnkl/blog/477690
*/
public class DiskQueuePool implements Closeable{
static final Logger log = LoggerFactory.getLogger(DiskQueuePool.class);
private final BlockingQueue deletingQueue = new LinkedBlockingQueue();
private String fileBackupPath;
private Map queueMap = new ConcurrentHashMap();
private ScheduledExecutorService syncService;
public DiskQueuePool(String fileBackupPath) {
this(fileBackupPath, true);
}
public DiskQueuePool(String fileBackupPath, boolean scanDirOnStart) {
this.fileBackupPath = fileBackupPath;
File fileBackupDir = new File(fileBackupPath);
if (!fileBackupDir.exists() && !fileBackupDir.mkdirs()) {
throw new IllegalArgumentException("can not create directory: " + fileBackupPath);
}
if(scanDirOnStart){
scanDir(fileBackupDir);
}
this.syncService = Executors.newSingleThreadScheduledExecutor();
this.syncService.scheduleAtFixedRate(new Runnable() {
@Override
public void run() {
for (DiskQueue q : queueMap.values()) {
q.sync();
}
deleteBlockFile();
}
}, 1000, 10000, TimeUnit.MILLISECONDS);
}
public Map getQueryMap(){
return queueMap;
}
private void deleteBlockFile() {
String blockFilePath = null;
while( (blockFilePath = deletingQueue.poll()) != null){
blockFilePath = blockFilePath.trim();
if(blockFilePath.equals("")) continue;
log.info("Delete File[%s]", blockFilePath);
File delFile = new File(blockFilePath);
try {
if (!delFile.delete()) {
log.warn("block file:%s delete failed", blockFilePath);
}
} catch (SecurityException e) {
log.error("security manager exists, delete denied");
}
}
}
public void toClear(String filePath) {
deletingQueue.add(filePath);
}
private void scanDir(File fileBackupDir) {
if (!fileBackupDir.isDirectory()) {
throw new IllegalArgumentException("it is not a directory");
}
File[] indexFiles = fileBackupDir.listFiles(new FilenameFilter() {
@Override
public boolean accept(File dir, String name) {
return DiskQueueIndex.isIndexFile(name);
}
});
if (indexFiles != null && indexFiles.length> 0) {
for (File indexFile : indexFiles) {
String queueName = DiskQueueIndex.parseQueueName(indexFile.getName());
synchronized(queueMap){
if(queueMap.containsKey(queueName)) continue;
queueMap.put(queueName, new DiskQueue(queueName, this));
}
}
}
}
public void close() throws IOException {
this.syncService.shutdown();
for (DiskQueue q : queueMap.values()) {
q.close();
}
while (!deletingQueue.isEmpty()) {
deleteBlockFile();
}
}
public synchronized DiskQueue getDiskQueue(String queueName) {
if (queueName==null || queueName.trim().equals("")) {
throw new IllegalArgumentException("empty queue name");
}
if (queueMap.containsKey(queueName)) {
return queueMap.get(queueName);
}
DiskQueue q = new DiskQueue(queueName, this);
queueMap.put(queueName, q);
return q;
}
public synchronized void releaseDiskQueue(DiskQueue queue) {
queueMap.remove(queue.getQueueName());
queue.close();
}
public synchronized void deleteDiskQueue(DiskQueue queue) {
queueMap.remove(queue.getQueueName());
queue.destroyFromDisk();
}
public String getFileBackupPath(){
return this.fileBackupPath;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy