Return nullptr directly where std::shared_ptr is expected

The constructor of std::shared_ptr which takes nullptr is not explicit
so we can return nullptr directly.
pull/103/head
Tatsuhiro Tsujikawa 2013-07-04 21:44:09 +09:00
parent 107de58997
commit 0cdeaa8177
21 changed files with 47 additions and 47 deletions

View File

@ -351,7 +351,7 @@ std::shared_ptr<ServerStat> AdaptiveURISelector::getServerStats
std::string protocol = uri::getFieldString(us, USR_SCHEME, uri.c_str()); std::string protocol = uri::getFieldString(us, USR_SCHEME, uri.c_str());
return serverStatMan_->find(host, protocol); return serverStatMan_->find(host, protocol);
} else { } else {
return std::shared_ptr<ServerStat>(); return nullptr;
} }
} }

View File

@ -134,7 +134,7 @@ std::shared_ptr<MessageDigestImpl> MessageDigestImpl::create
if (hashType == "md5") { if (hashType == "md5") {
return std::shared_ptr<MessageDigestImpl>(new MessageDigestMD5()); return std::shared_ptr<MessageDigestImpl>(new MessageDigestMD5());
} }
return std::shared_ptr<MessageDigestImpl>(); return nullptr;
} }
bool MessageDigestImpl::supports(const std::string& hashType) bool MessageDigestImpl::supports(const std::string& hashType)

View File

@ -235,7 +235,7 @@ std::shared_ptr<DHTNode> DHTBucket::getNode(const unsigned char* nodeID, const s
std::find_if(nodes_.begin(), nodes_.end(), derefEqual(node)); std::find_if(nodes_.begin(), nodes_.end(), derefEqual(node));
if(itr == nodes_.end() || if(itr == nodes_.end() ||
(*itr)->getIPAddress() != ipaddr || (*itr)->getPort() != port) { (*itr)->getIPAddress() != ipaddr || (*itr)->getPort() != port) {
return std::shared_ptr<DHTNode>(); return nullptr;
} else { } else {
return *itr; return *itr;
} }
@ -278,7 +278,7 @@ std::shared_ptr<DHTNode> DHTBucket::getLRUQuestionableNode() const
std::deque<std::shared_ptr<DHTNode> >::const_iterator i = std::deque<std::shared_ptr<DHTNode> >::const_iterator i =
std::find_if(nodes_.begin(), nodes_.end(), FindQuestionableNode()); std::find_if(nodes_.begin(), nodes_.end(), FindQuestionableNode());
if(i == nodes_.end()) { if(i == nodes_.end()) {
return std::shared_ptr<DHTNode>(); return nullptr;
} else { } else {
return *i; return *i;
} }

View File

@ -103,7 +103,7 @@ std::shared_ptr<DHTTask>
DHTTaskFactoryImpl::createPeerAnnounceTask(const unsigned char* infoHash) DHTTaskFactoryImpl::createPeerAnnounceTask(const unsigned char* infoHash)
{ {
// TODO // TODO
return std::shared_ptr<DHTTask>(); return nullptr;
} }
std::shared_ptr<DHTTask> std::shared_ptr<DHTTask>

View File

@ -205,7 +205,7 @@ std::shared_ptr<UDPTrackerRequest> DefaultBtAnnounce::createUDPTrackerRequest
(const std::string& remoteAddr, uint16_t remotePort, uint16_t localPort) (const std::string& remoteAddr, uint16_t remotePort, uint16_t localPort)
{ {
if(!adjustAnnounceList()) { if(!adjustAnnounceList()) {
return std::shared_ptr<UDPTrackerRequest>(); return nullptr;
} }
NetStat& stat = downloadContext_->getNetStat(); NetStat& stat = downloadContext_->getNetStat();
int64_t left = int64_t left =

View File

@ -123,7 +123,7 @@ std::shared_ptr<BtMessage> DefaultBtInteractive::receiveHandshake(bool quickRepl
std::shared_ptr<BtHandshakeMessage> message = std::shared_ptr<BtHandshakeMessage> message =
btMessageReceiver_->receiveHandshake(quickReply); btMessageReceiver_->receiveHandshake(quickReply);
if(!message) { if(!message) {
return std::shared_ptr<BtMessage>(); return nullptr;
} }
if(memcmp(message->getPeerId(), bittorrent::getStaticPeerId(), if(memcmp(message->getPeerId(), bittorrent::getStaticPeerId(),
PEER_ID_LENGTH) == 0) { PEER_ID_LENGTH) == 0) {

View File

@ -119,7 +119,7 @@ std::shared_ptr<BtMessage> DefaultBtMessageReceiver::receiveMessage() {
size_t dataLength = 0; size_t dataLength = 0;
// Give 0 to PeerConnection::receiveMessage() to prevent memcpy. // Give 0 to PeerConnection::receiveMessage() to prevent memcpy.
if(!peerConnection_->receiveMessage(0, dataLength)) { if(!peerConnection_->receiveMessage(0, dataLength)) {
return std::shared_ptr<BtMessage>(); return nullptr;
} }
std::shared_ptr<BtMessage> msg = std::shared_ptr<BtMessage> msg =
messageFactory_->createBtMessage(peerConnection_->getMsgPayloadBuffer(), messageFactory_->createBtMessage(peerConnection_->getMsgPayloadBuffer(),

View File

@ -225,7 +225,7 @@ void DefaultPeerStorage::deleteUnusedPeer(size_t delSize) {
std::shared_ptr<Peer> DefaultPeerStorage::checkoutPeer(cuid_t cuid) std::shared_ptr<Peer> DefaultPeerStorage::checkoutPeer(cuid_t cuid)
{ {
if(!isPeerAvailable()) { if(!isPeerAvailable()) {
return std::shared_ptr<Peer>(); return nullptr;
} }
std::shared_ptr<Peer> peer = unusedPeers_.front(); std::shared_ptr<Peer> peer = unusedPeers_.front();
unusedPeers_.pop_front(); unusedPeers_.pop_front();

View File

@ -328,7 +328,7 @@ DefaultPieceStorage::getMissingPiece
std::vector<std::shared_ptr<Piece> > pieces; std::vector<std::shared_ptr<Piece> > pieces;
getMissingPiece(pieces, 1, peer, cuid); getMissingPiece(pieces, 1, peer, cuid);
if(pieces.empty()) { if(pieces.empty()) {
return std::shared_ptr<Piece>(); return nullptr;
} else { } else {
return pieces.front(); return pieces.front();
} }
@ -342,7 +342,7 @@ std::shared_ptr<Piece> DefaultPieceStorage::getMissingPiece
std::vector<std::shared_ptr<Piece> > pieces; std::vector<std::shared_ptr<Piece> > pieces;
getMissingPiece(pieces, 1, peer, excludedIndexes, cuid); getMissingPiece(pieces, 1, peer, excludedIndexes, cuid);
if(pieces.empty()) { if(pieces.empty()) {
return std::shared_ptr<Piece>(); return nullptr;
} else { } else {
return pieces.front(); return pieces.front();
} }
@ -355,7 +355,7 @@ std::shared_ptr<Piece> DefaultPieceStorage::getMissingFastPiece
std::vector<std::shared_ptr<Piece> > pieces; std::vector<std::shared_ptr<Piece> > pieces;
getMissingFastPiece(pieces, 1, peer, cuid); getMissingFastPiece(pieces, 1, peer, cuid);
if(pieces.empty()) { if(pieces.empty()) {
return std::shared_ptr<Piece>(); return nullptr;
} else { } else {
return pieces.front(); return pieces.front();
} }
@ -369,7 +369,7 @@ std::shared_ptr<Piece> DefaultPieceStorage::getMissingFastPiece
std::vector<std::shared_ptr<Piece> > pieces; std::vector<std::shared_ptr<Piece> > pieces;
getMissingFastPiece(pieces, 1, peer, excludedIndexes, cuid); getMissingFastPiece(pieces, 1, peer, excludedIndexes, cuid);
if(pieces.empty()) { if(pieces.empty()) {
return std::shared_ptr<Piece>(); return nullptr;
} else { } else {
return pieces.front(); return pieces.front();
} }
@ -394,7 +394,7 @@ std::shared_ptr<Piece> DefaultPieceStorage::getMissingPiece
(index, minSplitSize, ignoreBitfield, length)) { (index, minSplitSize, ignoreBitfield, length)) {
return checkOutPiece(index, cuid); return checkOutPiece(index, cuid);
} else { } else {
return std::shared_ptr<Piece>(); return nullptr;
} }
} }
@ -403,7 +403,7 @@ std::shared_ptr<Piece> DefaultPieceStorage::getMissingPiece
cuid_t cuid) cuid_t cuid)
{ {
if(hasPiece(index) || isPieceUsed(index)) { if(hasPiece(index) || isPieceUsed(index)) {
return std::shared_ptr<Piece>(); return nullptr;
} else { } else {
return checkOutPiece(index, cuid); return checkOutPiece(index, cuid);
} }

View File

@ -96,7 +96,7 @@ DownloadContext::findFileEntryByOffset(int64_t offset) const
{ {
if(fileEntries_.empty() || if(fileEntries_.empty() ||
(offset > 0 && fileEntries_.back()->getLastOffset() <= offset)) { (offset > 0 && fileEntries_.back()->getLastOffset() <= offset)) {
return std::shared_ptr<FileEntry>(); return nullptr;
} }
std::shared_ptr<FileEntry> obj(new FileEntry()); std::shared_ptr<FileEntry> obj(new FileEntry());
@ -222,7 +222,7 @@ DownloadContext::getFirstRequestedFileEntry() const
return *i; return *i;
} }
} }
return std::shared_ptr<FileEntry>(); return nullptr;
} }
size_t DownloadContext::countRequestedFileEntry() const size_t DownloadContext::countRequestedFileEntry() const

View File

@ -221,12 +221,12 @@ FileEntry::findFasterRequest(const std::shared_ptr<Request>& base)
const int startupIdleTime = 10; const int startupIdleTime = 10;
if(requestPool_.empty() || if(requestPool_.empty() ||
lastFasterReplace_.difference(global::wallclock()) < startupIdleTime) { lastFasterReplace_.difference(global::wallclock()) < startupIdleTime) {
return std::shared_ptr<Request>(); return nullptr;
} }
const std::shared_ptr<PeerStat>& fastest = const std::shared_ptr<PeerStat>& fastest =
(*requestPool_.begin())->getPeerStat(); (*requestPool_.begin())->getPeerStat();
if(!fastest) { if(!fastest) {
return std::shared_ptr<Request>(); return nullptr;
} }
const std::shared_ptr<PeerStat>& basestat = base->getPeerStat(); const std::shared_ptr<PeerStat>& basestat = base->getPeerStat();
// TODO hard coded value. See PREF_STARTUP_IDLE_TIME // TODO hard coded value. See PREF_STARTUP_IDLE_TIME
@ -241,7 +241,7 @@ FileEntry::findFasterRequest(const std::shared_ptr<Request>& base)
lastFasterReplace_ = global::wallclock(); lastFasterReplace_ = global::wallclock();
return fastestRequest; return fastestRequest;
} }
return std::shared_ptr<Request>(); return nullptr;
} }
std::shared_ptr<Request> std::shared_ptr<Request>
@ -253,7 +253,7 @@ FileEntry::findFasterRequest
const int startupIdleTime = 10; const int startupIdleTime = 10;
const int SPEED_THRESHOLD = 20*1024; const int SPEED_THRESHOLD = 20*1024;
if(lastFasterReplace_.difference(global::wallclock()) < startupIdleTime) { if(lastFasterReplace_.difference(global::wallclock()) < startupIdleTime) {
return std::shared_ptr<Request>(); return nullptr;
} }
std::vector<std::string> inFlightHosts; std::vector<std::string> inFlightHosts;
enumerateInFlightHosts(inFlightRequests_.begin(), inFlightRequests_.end(), enumerateInFlightHosts(inFlightRequests_.begin(), inFlightRequests_.end(),
@ -307,7 +307,7 @@ FileEntry::findFasterRequest
return fastestRequest; return fastestRequest;
} }
A2_LOG_DEBUG("No faster server found."); A2_LOG_DEBUG("No faster server found.");
return std::shared_ptr<Request>(); return nullptr;
} }
void FileEntry::storePool(const std::shared_ptr<Request>& request) void FileEntry::storePool(const std::shared_ptr<Request>& request)

View File

@ -287,7 +287,7 @@ std::shared_ptr<FileEntry> getFirstRequestedFileEntry
return *first; return *first;
} }
} }
return std::shared_ptr<FileEntry>(); return nullptr;
} }
// Counts the number of files selected in the given iterator range // Counts the number of files selected in the given iterator range

View File

@ -129,7 +129,7 @@ createMethod(const std::string& methodName)
} else if(methodName == SystemMulticallRpcMethod::getMethodName()) { } else if(methodName == SystemMulticallRpcMethod::getMethodName()) {
return std::shared_ptr<RpcMethod>(new SystemMulticallRpcMethod()); return std::shared_ptr<RpcMethod>(new SystemMulticallRpcMethod());
} else { } else {
return std::shared_ptr<RpcMethod>(); return nullptr;
} }
} }
} // namespace } // namespace

View File

@ -132,7 +132,7 @@ std::shared_ptr<Segment> SegmentMan::checkoutSegment
(cuid_t cuid, const std::shared_ptr<Piece>& piece) (cuid_t cuid, const std::shared_ptr<Piece>& piece)
{ {
if(!piece) { if(!piece) {
return std::shared_ptr<Segment>(); return nullptr;
} }
A2_LOG_DEBUG(fmt("Attach segment#%lu to CUID#%" PRId64 ".", A2_LOG_DEBUG(fmt("Attach segment#%lu to CUID#%" PRId64 ".",
static_cast<unsigned long>(piece->getIndex()), static_cast<unsigned long>(piece->getIndex()),
@ -241,7 +241,7 @@ void SegmentMan::getSegment
std::shared_ptr<Segment> SegmentMan::getSegmentWithIndex std::shared_ptr<Segment> SegmentMan::getSegmentWithIndex
(cuid_t cuid, size_t index) { (cuid_t cuid, size_t index) {
if(index > 0 && downloadContext_->getNumPieces() <= index) { if(index > 0 && downloadContext_->getNumPieces() <= index) {
return std::shared_ptr<Segment>(); return nullptr;
} }
return checkoutSegment(cuid, pieceStorage_->getMissingPiece(index, cuid)); return checkoutSegment(cuid, pieceStorage_->getMissingPiece(index, cuid));
} }
@ -250,14 +250,14 @@ std::shared_ptr<Segment> SegmentMan::getCleanSegmentIfOwnerIsIdle
(cuid_t cuid, size_t index) (cuid_t cuid, size_t index)
{ {
if(index > 0 && downloadContext_->getNumPieces() <= index) { if(index > 0 && downloadContext_->getNumPieces() <= index) {
return std::shared_ptr<Segment>(); return nullptr;
} }
for(SegmentEntries::const_iterator itr = usedSegmentEntries_.begin(), for(SegmentEntries::const_iterator itr = usedSegmentEntries_.begin(),
eoi = usedSegmentEntries_.end(); itr != eoi; ++itr) { eoi = usedSegmentEntries_.end(); itr != eoi; ++itr) {
const std::shared_ptr<SegmentEntry>& segmentEntry = *itr; const std::shared_ptr<SegmentEntry>& segmentEntry = *itr;
if(segmentEntry->segment->getIndex() == index) { if(segmentEntry->segment->getIndex() == index) {
if(segmentEntry->segment->getWrittenLength() > 0) { if(segmentEntry->segment->getWrittenLength() > 0) {
return std::shared_ptr<Segment>(); return nullptr;
} }
if(segmentEntry->cuid == cuid) { if(segmentEntry->cuid == cuid) {
return segmentEntry->segment; return segmentEntry->segment;
@ -268,11 +268,11 @@ std::shared_ptr<Segment> SegmentMan::getCleanSegmentIfOwnerIsIdle
cancelSegment(owner); cancelSegment(owner);
return getSegmentWithIndex(cuid, index); return getSegmentWithIndex(cuid, index);
} else { } else {
return std::shared_ptr<Segment>(); return nullptr;
} }
} }
} }
return std::shared_ptr<Segment>(); return nullptr;
} }
void SegmentMan::cancelSegmentInternal void SegmentMan::cancelSegmentInternal
@ -399,7 +399,7 @@ std::shared_ptr<PeerStat> SegmentMan::getPeerStat(cuid_t cuid) const
return *i; return *i;
} }
} }
return std::shared_ptr<PeerStat>(); return nullptr;
} }
namespace { namespace {

View File

@ -62,7 +62,7 @@ std::shared_ptr<ServerStat> ServerStatMan::find(const std::string& hostname,
std::shared_ptr<ServerStat> ss(new ServerStat(hostname, protocol)); std::shared_ptr<ServerStat> ss(new ServerStat(hostname, protocol));
ServerStatSet::iterator i = serverStats_.find(ss); ServerStatSet::iterator i = serverStats_.find(ss);
if(i == serverStats_.end()) { if(i == serverStats_.end()) {
return std::shared_ptr<ServerStat>(); return nullptr;
} else { } else {
return *i; return *i;
} }

View File

@ -142,13 +142,13 @@ std::shared_ptr<Piece> UnknownLengthPieceStorage::getMissingPiece
cuid_t cuid) cuid_t cuid)
{ {
if(downloadFinished_) { if(downloadFinished_) {
return std::shared_ptr<Piece>(); return nullptr;
} }
if(!piece_) { if(!piece_) {
piece_.reset(new Piece()); piece_.reset(new Piece());
return piece_; return piece_;
} else { } else {
return std::shared_ptr<Piece>(); return nullptr;
} }
} }
@ -159,7 +159,7 @@ std::shared_ptr<Piece> UnknownLengthPieceStorage::getMissingPiece
if(index == 0) { if(index == 0) {
return getMissingPiece(0, 0, 0, cuid); return getMissingPiece(0, 0, 0, cuid);
} else { } else {
return std::shared_ptr<Piece>(); return nullptr;
} }
} }
@ -172,7 +172,7 @@ std::shared_ptr<Piece> UnknownLengthPieceStorage::getPiece(size_t index)
return piece_; return piece_;
} }
} else { } else {
return std::shared_ptr<Piece>(); return nullptr;
} }
} }

View File

@ -532,12 +532,12 @@ createMetadataInfoFromFirstFileEntry
const std::shared_ptr<DownloadContext>& dctx) const std::shared_ptr<DownloadContext>& dctx)
{ {
if(dctx->getFileEntries().empty()) { if(dctx->getFileEntries().empty()) {
return std::shared_ptr<MetadataInfo>(); return nullptr;
} else { } else {
std::vector<std::string> uris; std::vector<std::string> uris;
dctx->getFileEntries()[0]->getUris(uris); dctx->getFileEntries()[0]->getUris(uris);
if(uris.empty()) { if(uris.empty()) {
return std::shared_ptr<MetadataInfo>(); return nullptr;
} }
return std::make_shared<MetadataInfo>(gid, uris[0]); return std::make_shared<MetadataInfo>(gid, uris[0]);
} }

View File

@ -29,7 +29,7 @@ public:
virtual std::shared_ptr<UDPTrackerRequest> virtual std::shared_ptr<UDPTrackerRequest>
createUDPTrackerRequest(const std::string& remoteAddr, uint16_t remotePort, createUDPTrackerRequest(const std::string& remoteAddr, uint16_t remotePort,
uint16_t localPort) { uint16_t localPort) {
return std::shared_ptr<UDPTrackerRequest>(); return nullptr;
} }
void setAnnounceUrl(const std::string& url) { void setAnnounceUrl(const std::string& url) {

View File

@ -13,18 +13,18 @@ public:
createPingTask(const std::shared_ptr<DHTNode>& remoteNode, createPingTask(const std::shared_ptr<DHTNode>& remoteNode,
int numRetry = 0) int numRetry = 0)
{ {
return std::shared_ptr<DHTTask>(); return nullptr;
} }
virtual std::shared_ptr<DHTTask> virtual std::shared_ptr<DHTTask>
createNodeLookupTask(const unsigned char* targetID) createNodeLookupTask(const unsigned char* targetID)
{ {
return std::shared_ptr<DHTTask>(); return nullptr;
} }
virtual std::shared_ptr<DHTTask> createBucketRefreshTask() virtual std::shared_ptr<DHTTask> createBucketRefreshTask()
{ {
return std::shared_ptr<DHTTask>(); return nullptr;
} }
virtual std::shared_ptr<DHTTask> virtual std::shared_ptr<DHTTask>
@ -32,20 +32,20 @@ public:
uint16_t tcpPort, uint16_t tcpPort,
const std::shared_ptr<PeerStorage>& peerStorage) const std::shared_ptr<PeerStorage>& peerStorage)
{ {
return std::shared_ptr<DHTTask>(); return nullptr;
} }
virtual std::shared_ptr<DHTTask> virtual std::shared_ptr<DHTTask>
createPeerAnnounceTask(const unsigned char* infoHash) createPeerAnnounceTask(const unsigned char* infoHash)
{ {
return std::shared_ptr<DHTTask>(); return nullptr;
} }
virtual std::shared_ptr<DHTTask> virtual std::shared_ptr<DHTTask>
createReplaceNodeTask(const std::shared_ptr<DHTBucket>& bucket, createReplaceNodeTask(const std::shared_ptr<DHTBucket>& bucket,
const std::shared_ptr<DHTNode>& newNode) const std::shared_ptr<DHTNode>& newNode)
{ {
return std::shared_ptr<DHTTask>(); return nullptr;
} }
}; };

View File

@ -77,7 +77,7 @@ public:
virtual std::shared_ptr<Peer> checkoutPeer(cuid_t cuid) virtual std::shared_ptr<Peer> checkoutPeer(cuid_t cuid)
{ {
return std::shared_ptr<Peer>(); return nullptr;
} }
virtual void returnPeer(const std::shared_ptr<Peer>& peer) virtual void returnPeer(const std::shared_ptr<Peer>& peer)

View File

@ -34,7 +34,7 @@ public:
cuid_t cuid) cuid_t cuid)
{ {
if(missingIndexes.empty()) { if(missingIndexes.empty()) {
return std::shared_ptr<Piece>(); return nullptr;
} else { } else {
size_t index = missingIndexes.front(); size_t index = missingIndexes.front();
missingIndexes.pop_front(); missingIndexes.pop_front();