--> 默认最多50个线程 同一文件下载失败延迟超过30秒就结束下载

--> 下载5分钟超时时间,假设5分钟内未下载完就结束下载

--> 依赖 commons-httpclient 与 commons-io 包

package com.leunpha;

import org.apache.commons.httpclient.HttpClient;
import org.apache.commons.httpclient.methods.GetMethod;
import org.apache.commons.httpclient.params.HttpClientParams;
import org.apache.commons.io.IOUtils;
import org.apache.commons.logging.Log;
import org.apache.commons.logging.LogFactory; import java.io.*;
import java.lang.reflect.Method;
import java.nio.MappedByteBuffer;
import java.nio.channels.FileChannel;
import java.security.AccessController;
import java.security.PrivilegedAction;
import java.util.Observable;
import java.util.Timer;
import java.util.TimerTask;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.concurrent.atomic.AtomicLong;
import java.util.zip.ZipFile; /**
* User: zhoujingjie
* Date: 14-4-18
* Time: 下午12:52
*/
public class Downloader extends Observable {
protected String url, savePath; //下载地址与保存路径
protected FileChannel channel; //保存文件的通道
protected long size, perSize; //文件大小与每一个小文件的大小
protected volatile long downloaded; // 已下载的
protected int connectCount; //连接数
protected Connection[] connections; //连接对象
protected boolean isSupportRange; //是否支持断点下载
protected long timeout; //超时
protected boolean exists; //是否存在
private RandomAccessFile randomAccessFile;
protected volatile boolean stop; //停止
private static volatile boolean exception; //是否异常
private AtomicLong prevDownloaded = new AtomicLong(0); //上一次的下载结果
private static Log log = LogFactory.getLog(Downloader.class);
private AtomicInteger loseNum = new AtomicInteger(0);
private int maxThread; public Downloader(String url, String savePath) throws IOException {
//超时一小时
this(url, savePath, 1000 * 60*5,50);
} public Downloader(String url, String savePath, long timeout,int maxThread) throws FileNotFoundException {
this.timeout = timeout;
this.url = url;
this.maxThread = maxThread;
File file = new File(savePath);
if (!file.exists()) file.mkdirs();
this.savePath= file.getAbsolutePath() + "/" + url.substring(url.lastIndexOf("/"));
exists = new File(this.savePath).exists();
if(!exists){
randomAccessFile= new RandomAccessFile(this.savePath+".temp", "rw");
channel =randomAccessFile.getChannel();
}
} public GetMethod method(long start, long end) throws IOException {
GetMethod method = new GetMethod(Downloader.this.url);
method.setRequestHeader("User-Agent", "Mozilla/5.0 (Windows NT 6.2; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/30.0.1599.101 Safari/537.36");
if (end > 0) {
method.setRequestHeader("Range", "bytes=" + start + "-" + (end - 1));
} else {
method.setRequestHeader("Range", "bytes=" + start + "-");
}
HttpClientParams clientParams = new HttpClientParams();
//5秒超时
clientParams.setConnectionManagerTimeout(5000);
HttpClient client = new HttpClient(clientParams);
client.executeMethod(method);
int statusCode = method.getStatusCode();
if (statusCode >= 200 && statusCode < 300) {
isSupportRange = (statusCode == 206) ? true : false;
}
return method;
} public void init() throws IOException {
size = method(0, -1).getResponseContentLength();
if (isSupportRange) {
if (size < 4 * 1024 * 1024) { //假设小于4M
connectCount = 1;
} else if (size < 10 * 1024 * 1024) { //假设文件小于10M 则两个连接
connectCount = 2;
} else if (size < 30 * 1024 * 1024) { //假设文件小于80M 则使用6个连接
connectCount = 3;
} else if (size < 60 * 1024 * 1024) { //假设小于60M 则使用10个连接
connectCount = 4;
} else {
//否则为10个连接
connectCount = 5;
}
} else {
connectCount = 1;
}
log.debug(String.format("%s size:%s connectCount:%s", this.url, this.size, this.connectCount));
perSize = size / connectCount;
connections = new Connection[connectCount];
long offset = 0;
for (int i = 0; i < connectCount - 1; i++) {
connections[i] = new Connection(offset, offset + perSize);
offset += perSize;
}
connections[connectCount - 1] = new Connection(offset, size);
} /**
* 强制释放内存映射
*
* @param mappedByteBuffer
*/
static void unmapFileChannel(final MappedByteBuffer mappedByteBuffer) {
try {
if (mappedByteBuffer == null) {
return;
}
mappedByteBuffer.force();
AccessController.doPrivileged(new PrivilegedAction<Object>() {
@Override
public Object run() {
try {
Method getCleanerMethod = mappedByteBuffer.getClass().getMethod("cleaner", new Class[0]);
getCleanerMethod.setAccessible(true);
sun.misc.Cleaner cleaner = (sun.misc.Cleaner) getCleanerMethod.invoke(mappedByteBuffer, new Object[0]);
cleaner.clean();
} catch (Exception e) {
//LOG.error("unmapFileChannel." + e.getMessage());
}
return null;
}
});
} catch (Exception e) {
log.debug("异常->exception=true");
exception = true;
log.error(e);
}
} private void timer() {
Timer timer = new Timer();
//延迟3秒,3秒执行一次
timer.schedule(new TimerTask() {
@Override
public void run() {
log.debug(String.format("已下载-->%s -> %s",(((double) downloaded) / size * 100) + "%", url));
//假设上一次的下载大小与当前的一样就退出
if(prevDownloaded.get() ==downloaded && downloaded<size){
if(loseNum.getAndIncrement()>=10){
log.debug(String.format("上次下载%s与当前下载%s一致,exception->true url:%s ",prevDownloaded.get(),downloaded,url));
exception = true;
}
}
//假设下载完毕或者异常就退出
if(downloaded>=size || exception){
stop = true;
cancel();
}
//设置上次下载的大小等于如今的大小
prevDownloaded.set(downloaded);
}
},3000,3000);
} public void start() throws IOException {
if (exists) {
log.info("文件已存在." + this.url);
Thread.currentThread().interrupt();
return;
}
while (Thread.activeCount()>maxThread){
try {
Thread.sleep(1000);
} catch (InterruptedException e) {}
}
init();
timer();
CountDownLatch countDownLatch = new CountDownLatch(connections.length);
log.debug("開始下载:" + url);
for (int i = 0; i < connections.length; i++) {
new DownloadPart(countDownLatch, i).start();
}
end(countDownLatch);
} private boolean rename(File tempFile){
File file = new File(this.savePath);
boolean isRename=tempFile.renameTo(file);
if(!isRename){
try {
IOUtils.copy(new FileInputStream(tempFile),new FileOutputStream(file));
} catch (IOException e) {
log.error(e);
}
}
return true;
} public void end(CountDownLatch countDownLatch){
try {
//超过指定时间就直接结束
countDownLatch.await(timeout, TimeUnit.MILLISECONDS);
} catch (InterruptedException e) {
exception = true;
log.error(e);
log.info("下载失败:"+this.url);
} finally {
try {
channel.force(true);
channel.close();
randomAccessFile.close();
} catch (IOException e) {
log.error(e);
}
File temp = new File(this.savePath+".temp");
log.debug(String.format("%s %s", exception, this.url));
//假设有异常则删除已下载的暂时文件
if(exception){
if(!temp.delete()){
if(temp!=null)temp.delete();
}
}else{
try {
Thread.sleep(100);
} catch (InterruptedException e) {}
rename(temp);
setChanged();
notifyObservers(this.url);
log.info("下载成功:"+this.url);
}
}
} private class Connection {
long start, end; public Connection(long start, long end) {
this.start = start;
this.end = end;
} public InputStream getInputStream() throws IOException {
return method(start, end).getResponseBodyAsStream();
}
} private class DownloadPart implements Runnable {
CountDownLatch countDownLatch;
int i; public DownloadPart(CountDownLatch countDownLatch, int i) {
this.countDownLatch = countDownLatch;
this.i = i;
}
public void start() {
new Thread(this).start();
}
@Override
public void run() {
MappedByteBuffer buffer = null;
InputStream is = null;
try {
is = connections[i].getInputStream();
buffer = channel.map(FileChannel.MapMode.READ_WRITE, connections[i].start, connections[i].end - connections[i].start);
byte[] bytes = new byte[4 * 1024];
int len;
while ((len = is.read(bytes)) != -1 && !exception && !stop) {
buffer.put(bytes, 0, len);
downloaded+= len;
}
log.debug(String.format("file block had downloaded.%s %s",i,url));
} catch (IOException e) {
log.error(e);
} finally {
unmapFileChannel(buffer);
if(buffer != null)buffer.clear();
if (is != null) try {
is.close();
} catch (IOException e) {
}
countDownLatch.countDown();
}
}
} }

Java Nio 多线程网络下载的更多相关文章

  1. java socket 多线程网络传输多个文件

    http://blog.csdn.net/njchenyi/article/details/9072845 java socket 多线程网络传输多个文件 2013-06-10 21:26 3596人 ...

  2. Java之多线程断点下载的实现

    RandomAccessFile类: 此类的实例支持对随机訪问文件的读取和写入.随机訪问文件的行为相似存储在文件系统中的一个大型 byte 数组. 存在指向该隐含数组.光标或索引,称为文件指针.输入操 ...

  3. Java NIO之网络编程

    最近在研究Java NIO和netty,曾经一度感觉很吃力,根本原因还是对操作系统.TCP/IP.socket编程的理解不到位. 不禁感叹,还是当初逃的课太多. 假如上天给我一次机会,能够再回到意气风 ...

  4. Java实现多线程断点下载(下载过程中可以暂停)

    线程可以理解为下载的通道,一个线程就是一个文件的下载通道,多线程也就是同时开启好几个下载通道.当服务器提供下载服务时,使用下载者是共享带宽的,在优先级相同的情况下,总服务器会对总下载线程进行平均分配. ...

  5. Java NIO网络编程demo

    使用Java NIO进行网络编程,看下服务端的例子 import java.io.IOException; import java.net.InetAddress; import java.net.I ...

  6. Java NIO 操作总结

    问题: 1.Java NIO 出现大量CLOSE_WAIT或TIME_WAIT的端口无法释放 CLOSE_WAIT: 参考:http://my.oschina.net/geecoodeer/blog/ ...

  7. Java实现多线程下载,支持断点续传

    完整代码:https://github.com/iyuanyb/Downloader 多线程下载及断点续传的实现是使用 HTTP/1.1 引入的 Range 请求参数,可以访问Web资源的指定区间的内 ...

  8. Android实现网络多线程断点续传下载(转)

    本示例介绍在Android平台下通过HTTP协议实现断点续传下载. 我们编写的是Andorid的HTTP协议多线程断点下载应用程序.直接使用单线程下载HTTP文件对我们来说是一件非常简单的事.那么,多 ...

  9. Android实现网络多线程断点续传下载

    本示例介绍在Android平台下通过HTTP协议实现断点续传下载. 我们编写的是Andorid的HTTP协议多线程断点下载应用程序.直接使用单线程下载HTTP文件对我们来说是一件非常简单的事.那么,多 ...

随机推荐

  1. 【C#学习笔记】指针使用

    using System; namespace ConsoleApplication2 { class Program { static void Main(string[] args) { ; un ...

  2. hdu 2544最短路——最短路的初次总结 UESTC 6th Programming Contest Online

    这是一道标准的模板题,所以拿来作为这一段时间学习最短路的总结题目. 题意很简单: 有多组输入数据,每组的第一行为两个整数n, m.表示共有n个节点,m条边. 接下来有m行,每行三个整数a, b, c. ...

  3. JAX-WS

    JAX-WS(Java API for XML Web Services)规范是一组XML web services的JAVA API,JAX-WS允许开发者可以选择RPC-oriented或者mes ...

  4. DBHelper (支持事务与数据库变更) z

    using System; using System.Data; using System.Data.Common; using Project.BaseFramework; using System ...

  5. T-SQL 常用语句学习

    一.基础 1.说明:创建数据库 CREATE DATABASE database-name 2.说明:删除数据库 drop database dbname 3.说明:备份sql server ---  ...

  6. 将VLC库封装为duilib的万能视频播放控件

    转载请说明出处,谢谢~~ 昨天封装好了基于webkit的浏览器控件,修复了duilib的浏览器功能的不足,而我的仿酷狗播放器项目中不光需要浏览器,同时也需要视频播放功能,也就是完成MV的功能.所以我打 ...

  7. PHP中的替代语法

    今天看了一下wordpress的代码,里面有些少见的php替代语法, <?php else : ?> <div class="entry-content"> ...

  8. C#插入排序详解

    这几天一直在研究算法,也算有点心得,现在跟大家分享一下,我是用C#做的 排序算法是想要成为大虾程序员必须要掌握的技术,它其实也是一种思想,你对算法熟悉,对以后编程有很大帮助 算法思路 ⒈ 从第一个元素 ...

  9. bzoj 3698 XWW的难题(有源汇的上下界最大流)

    [题意] 对每个格子确定上下取整,使得满足1.A[n][n]=0 2.每行列前n-1个之和为第n个 3.格子之和尽量大. [思路] 设格子(i,j)上下取整分别为up(i,j)down(i,j),构图 ...

  10. 在Delphi7中JSON遍历节点不支持使用IN处理方法

    相关资料:http://www.cnblogs.com/del/archive/2009/10/23/1588690.html Delphi2007源代码: procedure TForm1.Butt ...