wornvirtue
/
premiere-libtorrent
forked from premiere/premiere-libtorrent
1
0
Fork 0
Code Pull Requests Activity

removed one iostream dependency

This commit is contained in:
Arvid Norberg 2009-10-28 19:55:20 +00:00
parent d2680e01d2
commit 70df388e6c
1 changed files with 8 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
src/torrent.cpp
View File

@ -1820,28 +1820,25 @@ namespace libtorrent
{ {
// Thist happens when a piece has been downloaded completely // Thist happens when a piece has been downloaded completely
// but not yet verified against the hash // but not yet verified against the hash
std::cerr << "num_have: " << num_have() << std::endl; fprintf(stderr, "num_have: %d\nunfinished:\n", num_have());
std::cerr << "unfinished:" << std::endl;
for (std::vector<piece_picker::downloading_piece>::const_iterator i = for (std::vector<piece_picker::downloading_piece>::const_iterator i =
dl_queue.begin(); i != dl_queue.end(); ++i) dl_queue.begin(); i != dl_queue.end(); ++i)
{ {
std::cerr << " " << i->index << " "; fprintf(stderr, " %d ", i->index);
for (int j = 0; j < blocks_per_piece; ++j) for (int j = 0; j < blocks_per_piece; ++j)
{ {
std::cerr << (i->info[j].state == piece_picker::block_info::state_finished ? "1" : "0"); char const* state = i->info[j].state == piece_picker::block_info::state_finished ? "1" : "0";
fputs(state, stderr);
} }
std::cerr << std::endl; fputs("\n", stderr);
} }
std::cerr << "downloading pieces:" << std::endl; fputs("downloading pieces:\n", stderr);
for (std::map<piece_block, int>::iterator i = downloading_piece.begin(); for (std::map<piece_block, int>::iterator i = downloading_piece.begin();
i != downloading_piece.end(); ++i) i != downloading_piece.end(); ++i)
{ {
std::cerr << " " << i->first.piece_index << ":" << i->first.block_index fprintf(stderr, " %d:%d %d\n", i->first.piece_index, i->first.block_index, i->second);
<< " " << i->second << std::endl;
} }
} }
@ -3601,7 +3598,7 @@ namespace libtorrent
for (int k = 0; k < bits; ++k) for (int k = 0; k < bits; ++k)
v |= (i->info[j*8+k].state == piece_picker::block_info::state_finished) v |= (i->info[j*8+k].state == piece_picker::block_info::state_finished)
? (1 << k) : 0; ? (1 << k) : 0;
bitmask.insert(bitmask.end(), v); bitmask.append(1, v);
TORRENT_ASSERT(bits == 8 || j == num_bitmask_bytes - 1); TORRENT_ASSERT(bits == 8 || j == num_bitmask_bytes - 1);
} }
piece_struct["bitmask"] = bitmask; piece_struct["bitmask"] = bitmask;