blob: b07193c56ee1502766e35496e5ccd82051f74fdd (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
package org.openslx.bwlp.sat.fileserv;
import java.nio.ByteBuffer;
import java.util.LinkedList;
import java.util.List;
import org.apache.log4j.Logger;
public class ChunkList {
private static final Logger LOGGER = Logger.getLogger(ChunkList.class);
/**
* Chunks that are missing from the file
*/
private final List<FileChunk> missingChunks = new LinkedList<>();
/**
* Chunks that are currently being uploaded or hash-checked
*/
private final List<FileChunk> pendingChunks = new LinkedList<>();
// Do we need to keep valid chunks, or chunks that failed too many times?
public ChunkList(long fileSize, List<ByteBuffer> sha1Sums) {
FileChunk.createChunkList(missingChunks, fileSize, sha1Sums);
}
/**
* Get a missing chunk, marking it pending.
*
* @return chunk marked as missing
*/
public synchronized FileChunk getMissing() {
if (missingChunks.isEmpty())
return null;
FileChunk c = missingChunks.remove(0);
pendingChunks.add(c);
return c;
}
/**
* Mark a chunk currently transferring as successfully transfered.
*
* @param c The chunk in question
*/
public synchronized void markSuccessful(FileChunk c) {
if (!pendingChunks.remove(c)) {
LOGGER.warn("Inconsistent state: markTransferred called for Chunk " + c.toString()
+ ", but chunk is not marked as currently transferring!");
return;
}
}
/**
* Mark a chunk currently transferring or being hash checked as failed
* transfer. This increases its fail count and re-adds it to the list of
* missing chunks.
*
* @param c The chunk in question
* @return Number of times transfer of this chunk failed
*/
public synchronized int markFailed(FileChunk c) {
if (!pendingChunks.remove(c)) {
LOGGER.warn("Inconsistent state: markTransferred called for Chunk " + c.toString()
+ ", but chunk is not marked as currently transferring!");
return -1;
}
// Add as first element so it will be re-transmitted immediately
missingChunks.add(0, c);
return c.incFailed();
}
public synchronized boolean isComplete() {
return missingChunks.isEmpty() && pendingChunks.isEmpty();
}
}
|
