PendingMessage.h 2.7 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
  1. /* <!-- copyright */
  2. /*
  3. * aria2 - a simple utility for downloading files faster
  4. *
  5. * Copyright (C) 2006 Tatsuhiro Tsujikawa
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  20. */
  21. /* copyright --> */
  22. #ifndef _D_PENDING_MESSAGE_H_
  23. #define _D_PENDING_MESSAGE_H_
  24. #include "common.h"
  25. #include "PeerConnection.h"
  26. #include <vector>
  27. class PendingMessage {
  28. private:
  29. int peerMessageId;
  30. int index;
  31. int begin;
  32. int length;
  33. long long int pieceDataOffset;
  34. int leftPieceDataLength;
  35. bool inProgress;
  36. PeerConnection* peerConnection;
  37. public:
  38. PendingMessage(int peerMessageId, PeerConnection* peerConnection):peerMessageId(peerMessageId), inProgress(false), peerConnection(peerConnection) {}
  39. ~PendingMessage() {}
  40. void setPeerMessageId(int peerMessageId) { this->peerMessageId = peerMessageId; }
  41. int getPeerMessageId() const { return peerMessageId; }
  42. void setPieceDataOffset(long long int offset) { this->pieceDataOffset = offset; }
  43. long long int getPieceDataOffset() const { return pieceDataOffset; }
  44. void setLeftPieceDataLength(int length) { this->leftPieceDataLength = length; }
  45. int getLeftPieceDataLength() const { return leftPieceDataLength; }
  46. void setInProgress(bool inprogress) { this->inProgress = inProgress; }
  47. bool isInProgress() const { return inProgress; }
  48. void setIndex(int index) { this->index = index; }
  49. int getIndex() const { return index; }
  50. void setBegin(int begin) { this->begin = begin; }
  51. int getBegin() const { return begin; }
  52. void setLength(int length) { this->length = length; }
  53. int getLength() const { return length; }
  54. bool processMessage();
  55. static PendingMessage createRequestMessage(int index, int begin, int length, PeerConnection* peerConnection);
  56. static PendingMessage createCancelMessage(int index, int begin, int length, PeerConnection* peerConnection);
  57. static PendingMessage createPieceMessage(int index, int begin, int length, int pieceLength, PeerConnection* peerConnection);
  58. static PendingMessage createHaveMessage(int index, PeerConnection* peerConnectioin);
  59. };
  60. typedef vector<PendingMessage> PendingMessages;
  61. #endif // _D_PENDING_MESSAGE_H_