Lines Matching refs:part
2 // This file is part of the aMule Project.
64 // mark involved part(s) as incomplete
66 for (uint16 part = gapstart / PARTSIZE; part <= partlast; part++) {
67 m_partsComplete[part] = incomplete;
111 void CGapList::AddGap(uint16 part)
113 if (part >= m_iPartCount) {
117 uint64 gapstart = part * PARTSIZE;
118 uint64 gapend = gapstart + GetPartSize(part) - 1;
120 m_partsComplete[part] = incomplete;
131 // mark involved part(s) to be reexamined for completeness
133 for (uint16 part = partstart / PARTSIZE; part <= partlast; part++) {
134 m_partsComplete[part] = unknown;
140 // first gap which ends >= our part start
149 // our part fills this gap completly
152 // lower part of this gap is in the part - shrink gap:
155 // end of our part was in the gap: we're done
158 // gap starts behind our part end: we're done
164 // our part is completely enclosed by the gap
165 // cut it in two, leaving our part out:
177 // upper part of this gap is in the part - shrink gap:
187 // else: gap is before our part start (should not happen)
192 void CGapList::FillGap(uint16 part)
194 if (part >= m_iPartCount) {
198 uint64 gapstart = part * PARTSIZE;
199 uint64 gapend = gapstart + GetPartSize(part) - 1;
201 m_partsComplete[part] = complete;
218 uint32 CGapList::GetGapSize(uint16 part) const
220 uint64 uRangeStart = part * PARTSIZE;
221 uint64 uRangeEnd = uRangeStart + GetPartSize(part) - 1;
279 bool CGapList::IsComplete(uint16 part)
282 // For files of size n * PARTSIZE one part too much is transmitted in the availability bitfield.
283 // Allow completion detection of this dummy part, and always report it as complete
285 if (part == m_iPartCount && m_sizeLastPart == PARTSIZE) {
289 if (part >= m_iPartCount) {
293 ePartComplete status = (ePartComplete) m_partsComplete[part];
295 uint64 partstart = part * PARTSIZE;
296 uint64 partend = partstart + GetPartSize(part) - 1;
298 m_partsComplete[part] = status;