Functions — github.com/arvidn/libtorrent

CodeHub MCPcopy Create free account

hub / github.com/arvidn/libtorrent / functions

Functions6,210 in github.com/arvidn/libtorrent

⨍ Functions 6,210◇ Types & classes 1,253

↓ 13 callersMethodallocate_job

src/disk_job_pool.cpp:53

↓ 13 callersFunctionapply_flag

src/read_resume_data.cpp:52

↓ 13 callersMethodasync_write

src/mmap_disk_io.cpp:838

↓ 13 callersFunctionclose_to

test/test_bandwidth_limiter.cpp:181

↓ 13 callersMethoddata

include/libtorrent/sha1_hash.hpp:134

↓ 13 callersFunctiondebug

test/socks.py:14

↓ 13 callersFunctiondo_handshake

test/test_fast_extension.cpp:286

↓ 13 callersFunctionerror

test/socks.py:19

↓ 13 callersMethodfile_priority

src/torrent.cpp:5803

↓ 13 callersMethodfinal

src/ed25519/hasher512.cpp:103

↓ 13 callersFunctionfind_first_of

include/libtorrent/string_view.hpp:51

↓ 13 callersFunctionfirst_piece_node

test/test_file_storage.cpp:1062

↓ 13 callersMethodflags

src/torrent.cpp:910

↓ 13 callersFunctionfor_each

include/libtorrent/info_hash.hpp:131

↓ 13 callersMethodget_downloaders

src/piece_picker.cpp:3788

↓ 13 callersMethodhandle

test/socks.py:100

↓ 13 callersFunctionhas_internet_route

src/enum_net.cpp:1005

↓ 13 callersMethodhas_soft_error

src/bdecode.cpp:312

↓ 13 callersMethodhash_for_piece

src/torrent_info.cpp:1072

↓ 13 callersFunctionhave_piece

returns true if we have downloaded the given piece but not necessarily flushed it to disk

include/libtorrent/torrent.hpp:864

↓ 13 callersFunctionis_i2p_url

src/string_util.cpp:429

↓ 13 callersFunctionlexically_relative

src/path.cpp:693

↓ 13 callersFunctionmake_pkt

test/test_packet_buffer.cpp:45

↓ 13 callersFunctionmatch_addr_mask

return (a1 & mask) == (a2 & mask)

src/enum_net.cpp:604

↓ 13 callersFunctionmerkle_fill_partial_tree

src/merkle.cpp:152

↓ 13 callersFunctionmerkle_layer_start

src/merkle.cpp:41

↓ 13 callersMethodmessage

src/upnp.cpp:1240

↓ 13 callersMethodname

bindings/python/src/error_code.cpp:129

↓ 13 callersMethodnum_threads

src/mmap_disk_io.cpp:1678

↓ 13 callersMethodopen

test/broadcast_socket.cpp:62

↓ 13 callersFunctionpeer_priority

1. if the IP addresses are identical, hash the ports in 16 bit network-order binary representation, ordered lowest first. 2. if the IPs are in the sam

src/torrent_peer.cpp:77

↓ 13 callersFunctionprint_error

src/error_code.cpp:362

↓ 13 callersMethodprioritize_pieces

src/torrent.cpp:5577

↓ 13 callersFunctionread_session_params

src/session_params.cpp:215

↓ 13 callersMethodrend

include/libtorrent/span.hpp:136

↓ 13 callersFunctionrsplit_path

src/path.cpp:927

↓ 13 callersFunctionrun_test

simulation/test_http_connection.cpp:302

↓ 13 callersFunctionrun_test

simulation/test_auto_manage.cpp:56

↓ 13 callersFunctionrun_test

simulation/test_web_seed.cpp:152

↓ 13 callersFunctionset_cursor_pos

examples/print.cpp:354

↓ 13 callersFunctionset_int_value

bindings/c/library.cpp:74

↓ 13 callersMethodset_seed

src/torrent.cpp:11453

↓ 13 callersMethodsetup

bindings/python/test.py:122

↓ 13 callersFunctionsetup_peer

test/test_fast_extension.cpp:453

↓ 13 callersFunctionsplit_url

splits a url into the base url and the path

src/parse_url.cpp:175

↓ 13 callersMethodthrottle

0 means infinite

src/bandwidth_limit.cpp:50

↓ 13 callersFunctiontracker_test

simulation/test_tracker.cpp:719

↓ 13 callersMethodwrap

src/udp_socket.cpp:353

↓ 12 callersMethodadd_extension

src/torrent.cpp:1561

↓ 12 callersMethodadd_piece

TODO: 3 there's some duplication between this function and peer_connection::incoming_piece(). is there a way to merge something?

src/torrent.cpp:1393

↓ 12 callersMethodadd_url_seed

src/torrent_info.cpp:1830

↓ 12 callersFunctionapply_pad_files

include/libtorrent/aux_/apply_pad_files.hpp:45

↓ 12 callersMethodasync_resolve

src/resolver.cpp:130

↓ 12 callersFunctionbits

* Return need bits from the input stream. This always leaves less than * eight bits in the buffer. bits() works properly for need == 0. * * Forma

src/puff.cpp:130

↓ 12 callersFunctionbuild_chain

test/test_tailqueue.cpp:75

↓ 12 callersFunctionbuild_tree

test/test_utils.cpp:90

↓ 12 callersFunctioncalc_bytes

we assume the last block is never a pad block. Should be a fairly safe assumption, and you just get a few kiB off if it is

src/torrent.cpp:4039

↓ 12 callersMethodcheck

src/peer_connection.cpp:2767

↓ 12 callersFunctioncheck2

test/test_store_buffer.cpp:88

↓ 12 callersFunctioncheck_invariant

include/libtorrent/aux_/receive_buffer.hpp:115

↓ 12 callersFunctioncleanup

test/test_transfer.cpp:306

↓ 12 callersMethodclose

simulation/fake_peer.hpp:79

↓ 12 callersFunctionconnect_peer

test/test_peer_list.cpp:236

↓ 12 callersFunctionconstruct

* Given the list of code lengths length[0..n-1] representing a canonical * Huffman code for n symbols, construct the tables required to decode those

src/puff.cpp:344

↓ 12 callersMethoddest

src/torrent_peer.cpp:278

↓ 12 callersMethodfind_node

src/kademlia/routing_table.cpp:496

↓ 12 callersMethodgenerate_buf

src/create_torrent.cpp:643

↓ 12 callersMethodget_hashes

src/torrent.cpp:6964

↓ 12 callersMethodget_piece_priorities

src/torrent_handle.cpp:547

↓ 12 callersFunctionip

test/test_enum_net.cpp:176

↓ 12 callersFunctionis_i2p

src/socket_type.cpp:95

↓ 12 callersFunctionis_root_path

src/path.cpp:498

↓ 12 callersFunctionis_utp

src/socket_type.cpp:85

↓ 12 callersFunctionitem_target_id

calculate the target hash for an immutable item.

src/kademlia/item.cpp:85

↓ 12 callersFunctionload_torrent_buffer

src/load_torrent.cpp:116

↓ 12 callersFunctionmerkle_root

compute the merkle tree root, given the leaves and the has to use for padding

src/merkle.cpp:230

↓ 12 callersFunctionmerkle_validate_and_insert_proofs

src/merkle.cpp:316

↓ 12 callersFunctionnetwork_to_host

include/libtorrent/aux_/byteswap.hpp:62

↓ 12 callersFunctionnone_set

test/test_merkle_tree.cpp:96

↓ 12 callersFunctionprint_bitfield

test/test_bitfield.cpp:45

↓ 12 callersFunctionprint_pick

test/test_piece_picker.cpp:264

↓ 12 callersFunctionread

test/test_storage.cpp:283

↓ 12 callersFunctionrun_test

test/test_http_connection.cpp:114

↓ 12 callersFunctionsave_path

simulation/utils.cpp:111

↓ 12 callersMethodself

src/udp_socket.cpp:104

↓ 12 callersFunctionset_proxy

simulation/utils.cpp:179

↓ 12 callersMethodspace_in_last_buffer

returns the number of bytes available at the end of the last chained buffer.

src/chained_buffer.cpp:76

↓ 12 callersMethodstart

src/lsd.cpp:112

↓ 12 callersFunctiontest_idna

simulation/test_web_seed.cpp:793

↓ 12 callersFunctiontest_peer

simulation/test_peer_connection.cpp:54

↓ 12 callersFunctiontest_roundtrip

test/test_read_resume.cpp:264

↓ 12 callersFunctiontest_select_only

test/test_magnet.cpp:600

↓ 12 callersFunctiontest_settings

test/test_dht_storage.cpp:64

↓ 12 callersFunctiontest_transfer

test/test_transfer.cpp:86

↓ 12 callersFunctiontest_vector

test/test_ed25519.cpp:48

↓ 12 callersFunctionto_lower

src/string_util.cpp:87

↓ 12 callersFunctionunescape_string

src/escape_string.cpp:68

↓ 12 callersFunctionvalidate_piece_count

test/test_piece_picker.cpp:2680

↓ 12 callersFunctionverify_availability

test/test_piece_picker.cpp:253

↓ 12 callersMethodwe_dont_have

src/piece_picker.cpp:1640

← previous next →501–600 of 6,210, ranked by callers