Searched refs:piece (Results 26 - 38 of 38) sorted by relevance
12
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/crypto/rc4/asm/ |
H A D | rc4-parisc.pl | 196 or $ix,$acc,$acc ; last piece, no need to dep 216 or $ix,$acc,$acc ; last piece, no need to dep
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/transmission-2.73/libtransmission/ |
H A D | torrent.c | 576 pieceHasFile( tr_piece_index_t piece, argument 579 return ( file->firstPiece <= piece ) && ( piece <= file->lastPiece ); 584 tr_piece_index_t piece, 590 /* find the first file that has data in this piece */ 593 while( i > 0 && pieceHasFile( piece, &tor->info.files[i - 1] ) ) 597 if( pieceHasFile( piece, &tor->info.files[i] ) ) 601 /* the piece's priority is the max of the priorities 602 * of all the files in that piece */ 607 if( !pieceHasFile( piece, fil 583 calculatePiecePriority( const tr_torrent * tor, tr_piece_index_t piece, int fileHint ) argument 2330 tr_torrentGetBlockLocation( const tr_torrent * tor, tr_block_index_t block, tr_piece_index_t * piece, uint32_t * offset, uint32_t * length ) argument 2424 tr_torGetPieceBlockRange( const tr_torrent * tor, const tr_piece_index_t piece, tr_block_index_t * first, tr_block_index_t * last ) argument [all...] |
H A D | webseed.c | 183 const tr_piece_index_t piece = data->piece_index; local 188 tr_cacheWriteBlock( cache, tor, piece, offset_end - len, bytes_this_pass, buf );
|
H A D | peer-mgr.c | 59 /* how frequently to age out old piece request lists */ 208 /* An array of pieceCount items stating how many peers have each piece. 1096 struct weighted_piece * piece = pieces + i; local 1097 piece->index = pool[i]; 1098 piece->requestCount = 0; 1099 piece->salt = tr_cryptoWeakRandInt( 4096 ); 1136 pieceListRemovePiece( Torrent * t, tr_piece_index_t piece ) 1140 if(( p = pieceListLookup( t, piece ))) 1226 * Increase the replication count of this piece and sort it if the 1227 * piece lis 1448 const struct weighted_piece piece = t->pieces[i]; local 2567 const int piece = i * interval; local [all...] |
H A D | handshake.c | 822 /* This next piece is HASH('req2', SKEY) xor HASH('req3', S) ... 997 canRead( struct tr_peerIo * io, void * arg, size_t * piece ) 1006 /* no piece data in handshake */ 1007 *piece = 0;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/docs/latex/wx/ |
H A D | tclipbrd.tex | 22 clipboard. wxDataObject is a "smart" piece of data because it knows which
|
H A D | dataobj.tex | 16 'smart' piece of data unlike 'dumb' data containers such as memory
|
H A D | dc.tex | 6 In this way, the same piece of code may write to a number of different devices,
|
H A D | tdb.tex | 330 Authorization string (password). A fourth piece of information, a default
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/aui/ |
H A D | framemanager.cpp | 1539 wxString piece = val_name.AfterFirst(wxT('(')); local 1540 piece = piece.BeforeLast(wxT(')')); 1541 piece.BeforeFirst(wxT(',')).ToLong(&dir); 1542 piece = piece.AfterFirst(wxT(',')); 1543 piece.BeforeFirst(wxT(',')).ToLong(&layer); 1544 piece.AfterFirst(wxT(',')).ToLong(&row);
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/libvorbis-1.2.3/doc/ |
H A D | 05-comment.tex | 111 The track number of this piece if part of a specific larger collection or album
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/human68k/ |
H A D | deflate.s | 194 sliding: ds.w 1 ; bool: the file is read a piece at a time
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/perl/DB_File/ |
H A D | DB_File.pm | 1658 hash/array interface in the same piece of code. Although only a few of 1759 A DBM Filter is a piece of code that is be used when you I<always>
|
Completed in 140 milliseconds
12