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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/* <!-- copyright */
/*
* aria2 - The high speed download utility
*
* Copyright (C) 2006 Tatsuhiro Tsujikawa
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* In addition, as a special exception, the copyright holders give
* permission to link the code of portions of this program with the
* OpenSSL library under certain conditions as described in each
* individual source file, and distribute linked combinations
* including the two.
* You must obey the GNU General Public License in all respects
* for all of the code used other than OpenSSL. If you modify
* file(s) with this exception, you may extend this exception to your
* version of the file(s), but you are not obligated to do so. If you
* do not wish to do so, delete this exception statement from your
* version. If you delete this exception statement from all source
* files in the program, then also delete it here.
*/
/* copyright --> */
#ifndef _D_REQUEST_SLOT_H_
#define _D_REQUEST_SLOT_H_
#include "common.h"
#include <deque>
#include "TimeA2.h"
#include "Piece.h"
namespace aria2 {
class RequestSlot {
private:
Time dispatchedTime;
size_t index;
uint32_t begin;
size_t length;
size_t blockIndex;
// This is the piece whose index is index of this RequestSlot has.
// To detect duplicate RequestSlot, we have to find the piece using
// PieceStorage::getPiece() repeatedly. It turns out that this process
// takes time(about 1.7% of processing time). To reduce it, we put piece here
// at the construction of RequestSlot as a cache.
SharedHandle<Piece> _piece;
void copy(const RequestSlot& requestSlot);
public:
RequestSlot(size_t index, uint32_t begin, size_t length, size_t blockIndex,
const SharedHandle<Piece>& piece = SharedHandle<Piece>());
RequestSlot(const RequestSlot& requestSlot);
RequestSlot();
~RequestSlot() {}
RequestSlot& operator=(const RequestSlot& requestSlot);
bool operator==(const RequestSlot& requestSlot) const;
bool operator!=(const RequestSlot& requestSlot) const;
bool operator<(const RequestSlot& requestSlot) const;
void setDispatchedTime();
void setDispatchedTime(time_t secFromEpoch);
bool isTimeout(const struct timeval& now, time_t timeoutSec) const;
unsigned int getLatencyInMillis() const;
size_t getIndex() const { return index; }
void setIndex(size_t index) { this->index = index; }
uint32_t getBegin() const { return begin; }
void setBegin(uint32_t begin) { this->begin = begin; }
size_t getLength() const { return length; }
void setLength(size_t length) { this->length = length; }
size_t getBlockIndex() const { return blockIndex; }
void setBlockIndex(size_t blockIndex) { this->blockIndex = blockIndex; }
const SharedHandle<Piece>& getPiece() const
{
return _piece;
}
static RequestSlot nullSlot;
static bool isNull(const RequestSlot& requestSlot);
};
typedef std::deque<RequestSlot> RequestSlots;
} // namespace aria2
#endif // _D_REQUEST_SLOT_H_
|
