254 lines
15 KiB
HTML
254 lines
15 KiB
HTML
|
<!doctype html>
|
||
|
|
<html lang="en">
|
||
|
|
<head>
|
||
|
|
<meta charset="utf-8">
|
||
|
|
<meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1" />
|
||
|
<meta name="generator" content="pdoc 0.7.4" />
|
||
|
|
<title>src.communicatorutils.lookupblocks API documentation</title>
|
||
|
|
<meta name="description" content="Onionr - Private P2P Communication …" />
|
||
|
|
<link href='https://cdnjs.cloudflare.com/ajax/libs/normalize/8.0.0/normalize.min.css' rel='stylesheet'>
|
||
|
|
<link href='https://cdnjs.cloudflare.com/ajax/libs/10up-sanitize.css/8.0.0/sanitize.min.css' rel='stylesheet'>
|
||
|
|
<link href="https://cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/github.min.css" rel="stylesheet">
|
||
|
|
<style>.flex{display:flex !important}body{line-height:1.5em}#content{padding:20px}#sidebar{padding:30px;overflow:hidden}.http-server-breadcrumbs{font-size:130%;margin:0 0 15px 0}#footer{font-size:.75em;padding:5px 30px;border-top:1px solid #ddd;text-align:right}#footer p{margin:0 0 0 1em;display:inline-block}#footer p:last-child{margin-right:30px}h1,h2,h3,h4,h5{font-weight:300}h1{font-size:2.5em;line-height:1.1em}h2{font-size:1.75em;margin:1em 0 .50em 0}h3{font-size:1.4em;margin:25px 0 10px 0}h4{margin:0;font-size:105%}a{color:#058;text-decoration:none;transition:color .3s ease-in-out}a:hover{color:#e82}.title code{font-weight:bold}h2[id^="header-"]{margin-top:2em}.ident{color:#900}pre code{background:#f8f8f8;font-size:.8em;line-height:1.4em}code{background:#f2f2f1;padding:1px 4px;overflow-wrap:break-word}h1 code{background:transparent}pre{background:#f8f8f8;border:0;border-top:1px solid #ccc;border-bottom:1px solid #ccc;margin:1em 0;padding:1ex}#http-server-module-list{display:flex;flex-flow:column}#http-server-module-list div{display:flex}#http-server-module-list dt{min-width:10%}#http-server-module-list p{margin-top:0}.toc ul,#index{list-style-type:none;margin:0;padding:0}#index code{background:transparent}#index h3{border-bottom:1px solid #ddd}#index ul{padding:0}#index h4{font-weight:bold}#index h4 + ul{margin-bottom:.6em}@media (min-width:200ex){#index .two-column{column-count:2}}@media (min-width:300ex){#index .two-column{column-count:3}}dl{margin-bottom:2em}dl dl:last-child{margin-bottom:4em}dd{margin:0 0 1em 3em}#header-classes + dl > dd{margin-bottom:3em}dd dd{margin-left:2em}dd p{margin:10px 0}.name{background:#eee;font-weight:bold;font-size:.85em;padding:5px 10px;display:inline-block;min-width:40%}.name:hover{background:#e0e0e0}.name > span:first-child{white-space:nowrap}.name.class > span:nth-child(2){margin-left:.4em}.inherited{color:#999;border-left:5px solid #eee;padding-left:1em}.inheritance em{font-style:normal;font-weight:bold}.desc h2{font-weight:400;font-size:1.25em}.desc h3{font-size:1em}.desc dt code{background:inherit}.source summary,.git-link-div{color:#666;text-align:right;font-weight:400;font-size:.8em;text-transform:uppercase}.source summary > *{white-space:nowrap;cursor:pointer}.git-link{color:inherit;margin-left:1em}.source pre{max-height:500px;overflow:auto;margin:0}.source pre code{font-size:12px;overflow:visible}.hlist{list-style:none}.hlist li{display:inline}.hlist li:after{content:',\2002'}.hlist li:last-child:after{content:none}.hlist .hlist{display:inline;padding-left:1em}img{max-width:100%}.admonition{padding:.1em .5em;margin-bottom:1em}.admonition-title{font-weight:bold}.admonition.note,.admonition.info,.admonition.important{background:#aef}.admonition.todo,.admonition.versionadded,.admonition.tip,.admonition.hint{background:#dfd}.admonition.warning,.admonition.versionchanged,.admonition.deprecated{background:#fd4}.admonition.error,.admonition.danger,.admonition.caution{background:lightpink}</style>
|
||
|
|
<style media="screen and (min-width: 700px)">@media screen and (min-width:700px){#sidebar{width:30%}#content{width:70%;max-width:100ch;padding:3em 4em;border-left:1px solid #ddd}pre code{font-size:1em}.item .name{font-size:1em}main{display:flex;flex-direction:row-reverse;justify-content:flex-end}.toc ul ul,#index ul{padding-left:1.5em}.toc > ul > li{margin-top:.5em}}</style>
|
||
|
|
<style media="print">@media print{#sidebar h1{page-break-before:always}.source{display:none}}@media print{*{background:transparent !important;color:#000 !important;box-shadow:none !important;text-shadow:none !important}a[href]:after{content:" (" attr(href) ")";font-size:90%}a[href][title]:after{content:none}abbr[title]:after{content:" (" attr(title) ")"}.ir a:after,a[href^="javascript:"]:after,a[href^="#"]:after{content:""}pre,blockquote{border:1px solid #999;page-break-inside:avoid}thead{display:table-header-group}tr,img{page-break-inside:avoid}img{max-width:100% !important}@page{margin:0.5cm}p,h2,h3{orphans:3;widows:3}h1,h2,h3,h4,h5,h6{page-break-after:avoid}}</style>
|
||
|
|
</head>
|
||
|
|
<body>
|
||
|
|
<main>
|
||
|
|
<article id="content">
|
||
|
|
<header>
|
||
|
|
<h1 class="title">Module <code>src.communicatorutils.lookupblocks</code></h1>
|
||
|
|
</header>
|
||
|
|
<section id="section-intro">
|
||
|
|
<p>Onionr - Private P2P Communication</p>
|
||
|
|
<p>Lookup new blocks with the communicator using a random connected peer</p>
|
||
|
|
<details class="source">
|
||
|
|
<summary>
|
||
|
|
<span>Expand source code</span>
|
||
|
|
</summary>
|
||
|
|
<pre><code class="python">'''
|
||
|
|
Onionr - Private P2P Communication
|
||
|
|
|
||
|
|
Lookup new blocks with the communicator using a random connected peer
|
||
|
|
'''
|
||
|
|
'''
|
||
|
|
This program is free software: you can redistribute it and/or modify
|
||
|
|
it under the terms of the GNU General Public License as published by
|
||
|
|
the Free Software Foundation, either version 3 of the License, or
|
||
|
|
(at your option) any later version.
|
||
|
|
|
||
|
|
This program is distributed in the hope that it will be useful,
|
||
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
GNU General Public License for more details.
|
||
|
|
|
||
|
|
You should have received a copy of the GNU General Public License
|
||
|
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||
|
|
'''
|
||
|
|
from gevent import time
|
||
|
|
|
||
|
|
import logger, onionrproofs
|
||
|
|
from onionrutils import stringvalidators, epoch
|
||
|
|
from communicator import peeraction, onlinepeers
|
||
|
|
from coredb import blockmetadb
|
||
|
|
from utils import reconstructhash
|
||
|
|
from onionrblocks import onionrblacklist
|
||
|
|
import onionrexceptions
|
||
|
|
blacklist = onionrblacklist.OnionrBlackList()
|
||
|
|
def lookup_blocks_from_communicator(comm_inst):
|
||
|
|
logger.info('Looking up new blocks')
|
||
|
|
tryAmount = 2
|
||
|
|
newBlocks = ''
|
||
|
|
existingBlocks = blockmetadb.get_block_list() # List of existing saved blocks
|
||
|
|
triedPeers = [] # list of peers we've tried this time around
|
||
|
|
maxBacklog = 1560 # Max amount of *new* block hashes to have already in queue, to avoid memory exhaustion
|
||
|
|
lastLookupTime = 0 # Last time we looked up a particular peer's list
|
||
|
|
new_block_count = 0
|
||
|
|
for i in range(tryAmount):
|
||
|
|
listLookupCommand = 'getblocklist' # This is defined here to reset it each time
|
||
|
|
if len(comm_inst.blockQueue) >= maxBacklog:
|
||
|
|
break
|
||
|
|
if not comm_inst.isOnline:
|
||
|
|
break
|
||
|
|
# check if disk allocation is used
|
||
|
|
if comm_inst.storage_counter.is_full():
|
||
|
|
logger.debug('Not looking up new blocks due to maximum amount of allowed disk space used')
|
||
|
|
break
|
||
|
|
try:
|
||
|
|
# select random online peer
|
||
|
|
peer = onlinepeers.pick_online_peer(comm_inst)
|
||
|
|
except onionrexceptions.OnlinePeerNeeded:
|
||
|
|
time.sleep(1)
|
||
|
|
continue
|
||
|
|
# if we've already tried all the online peers this time around, stop
|
||
|
|
if peer in triedPeers:
|
||
|
|
if len(comm_inst.onlinePeers) == len(triedPeers):
|
||
|
|
break
|
||
|
|
else:
|
||
|
|
continue
|
||
|
|
triedPeers.append(peer)
|
||
|
|
|
||
|
|
# Get the last time we looked up a peer's stamp to only fetch blocks since then.
|
||
|
|
# Saved in memory only for privacy reasons
|
||
|
|
try:
|
||
|
|
lastLookupTime = comm_inst.dbTimestamps[peer]
|
||
|
|
except KeyError:
|
||
|
|
lastLookupTime = 0
|
||
|
|
else:
|
||
|
|
listLookupCommand += '?date=%s' % (lastLookupTime,)
|
||
|
|
try:
|
||
|
|
newBlocks = peeraction.peer_action(comm_inst, peer, listLookupCommand) # get list of new block hashes
|
||
|
|
except Exception as error:
|
||
|
|
logger.warn('Could not get new blocks from %s.' % peer, error = error)
|
||
|
|
newBlocks = False
|
||
|
|
else:
|
||
|
|
comm_inst.dbTimestamps[peer] = epoch.get_rounded_epoch(roundS=60)
|
||
|
|
if newBlocks != False:
|
||
|
|
# if request was a success
|
||
|
|
for i in newBlocks.split('\n'):
|
||
|
|
if stringvalidators.validate_hash(i):
|
||
|
|
i = reconstructhash.reconstruct_hash(i)
|
||
|
|
# if newline seperated string is valid hash
|
||
|
|
if not i in existingBlocks:
|
||
|
|
# if block does not exist on disk and is not already in block queue
|
||
|
|
if i not in comm_inst.blockQueue:
|
||
|
|
if onionrproofs.hashMeetsDifficulty(i) and not blacklist.inBlacklist(i):
|
||
|
|
if len(comm_inst.blockQueue) <= 1000000:
|
||
|
|
comm_inst.blockQueue[i] = [peer] # add blocks to download queue
|
||
|
|
new_block_count += 1
|
||
|
|
else:
|
||
|
|
if peer not in comm_inst.blockQueue[i]:
|
||
|
|
if len(comm_inst.blockQueue[i]) < 10:
|
||
|
|
comm_inst.blockQueue[i].append(peer)
|
||
|
|
if new_block_count > 0:
|
||
|
|
block_string = ""
|
||
|
|
if new_block_count > 1:
|
||
|
|
block_string = "s"
|
||
|
|
logger.info('Discovered %s new block%s' % (new_block_count, block_string), terminal=True)
|
||
|
|
comm_inst.download_blocks_timer.count = int(comm_inst.download_blocks_timer.frequency * 0.99)
|
||
|
|
comm_inst.decrementThreadCount('lookup_blocks_from_communicator')
|
||
|
|
return</code></pre>
|
||
|
|
</details>
|
||
|
|
</section>
|
||
|
|
<section>
|
||
|
|
</section>
|
||
|
|
<section>
|
||
|
|
</section>
|
||
|
|
<section>
|
||
|
|
<h2 class="section-title" id="header-functions">Functions</h2>
|
||
|
|
<dl>
|
||
|
|
<dt id="src.communicatorutils.lookupblocks.lookup_blocks_from_communicator"><code class="name flex">
|
||
|
|
<span>def <span class="ident">lookup_blocks_from_communicator</span></span>(<span>comm_inst)</span>
|
||
|
|
</code></dt>
|
||
|
|
<dd>
|
||
|
|
<section class="desc"></section>
|
||
|
|
<details class="source">
|
||
|
|
<summary>
|
||
|
|
<span>Expand source code</span>
|
||
|
|
</summary>
|
||
|
|
<pre><code class="python">def lookup_blocks_from_communicator(comm_inst):
|
||
|
|
logger.info('Looking up new blocks')
|
||
|
|
tryAmount = 2
|
||
|
|
newBlocks = ''
|
||
|
|
existingBlocks = blockmetadb.get_block_list() # List of existing saved blocks
|
||
|
|
triedPeers = [] # list of peers we've tried this time around
|
||
|
|
maxBacklog = 1560 # Max amount of *new* block hashes to have already in queue, to avoid memory exhaustion
|
||
|
|
lastLookupTime = 0 # Last time we looked up a particular peer's list
|
||
|
|
new_block_count = 0
|
||
|
|
for i in range(tryAmount):
|
||
|
|
listLookupCommand = 'getblocklist' # This is defined here to reset it each time
|
||
|
|
if len(comm_inst.blockQueue) >= maxBacklog:
|
||
|
|
break
|
||
|
|
if not comm_inst.isOnline:
|
||
|
|
break
|
||
|
|
# check if disk allocation is used
|
||
|
|
if comm_inst.storage_counter.is_full():
|
||
|
|
logger.debug('Not looking up new blocks due to maximum amount of allowed disk space used')
|
||
|
|
break
|
||
|
|
try:
|
||
|
|
# select random online peer
|
||
|
|
peer = onlinepeers.pick_online_peer(comm_inst)
|
||
|
|
except onionrexceptions.OnlinePeerNeeded:
|
||
|
|
time.sleep(1)
|
||
|
|
continue
|
||
|
|
# if we've already tried all the online peers this time around, stop
|
||
|
|
if peer in triedPeers:
|
||
|
|
if len(comm_inst.onlinePeers) == len(triedPeers):
|
||
|
|
break
|
||
|
|
else:
|
||
|
|
continue
|
||
|
|
triedPeers.append(peer)
|
||
|
|
|
||
|
|
# Get the last time we looked up a peer's stamp to only fetch blocks since then.
|
||
|
|
# Saved in memory only for privacy reasons
|
||
|
|
try:
|
||
|
|
lastLookupTime = comm_inst.dbTimestamps[peer]
|
||
|
|
except KeyError:
|
||
|
|
lastLookupTime = 0
|
||
|
|
else:
|
||
|
|
listLookupCommand += '?date=%s' % (lastLookupTime,)
|
||
|
|
try:
|
||
|
|
newBlocks = peeraction.peer_action(comm_inst, peer, listLookupCommand) # get list of new block hashes
|
||
|
|
except Exception as error:
|
||
|
|
logger.warn('Could not get new blocks from %s.' % peer, error = error)
|
||
|
|
newBlocks = False
|
||
|
|
else:
|
||
|
|
comm_inst.dbTimestamps[peer] = epoch.get_rounded_epoch(roundS=60)
|
||
|
|
if newBlocks != False:
|
||
|
|
# if request was a success
|
||
|
|
for i in newBlocks.split('\n'):
|
||
|
|
if stringvalidators.validate_hash(i):
|
||
|
|
i = reconstructhash.reconstruct_hash(i)
|
||
|
|
# if newline seperated string is valid hash
|
||
|
|
if not i in existingBlocks:
|
||
|
|
# if block does not exist on disk and is not already in block queue
|
||
|
|
if i not in comm_inst.blockQueue:
|
||
|
|
if onionrproofs.hashMeetsDifficulty(i) and not blacklist.inBlacklist(i):
|
||
|
|
if len(comm_inst.blockQueue) <= 1000000:
|
||
|
|
comm_inst.blockQueue[i] = [peer] # add blocks to download queue
|
||
|
|
new_block_count += 1
|
||
|
|
else:
|
||
|
|
if peer not in comm_inst.blockQueue[i]:
|
||
|
|
if len(comm_inst.blockQueue[i]) < 10:
|
||
|
|
comm_inst.blockQueue[i].append(peer)
|
||
|
|
if new_block_count > 0:
|
||
|
|
block_string = ""
|
||
|
|
if new_block_count > 1:
|
||
|
|
block_string = "s"
|
||
|
|
logger.info('Discovered %s new block%s' % (new_block_count, block_string), terminal=True)
|
||
|
|
comm_inst.download_blocks_timer.count = int(comm_inst.download_blocks_timer.frequency * 0.99)
|
||
|
|
comm_inst.decrementThreadCount('lookup_blocks_from_communicator')
|
||
|
|
return</code></pre>
|
||
|
|
</details>
|
||
|
|
</dd>
|
||
|
|
</dl>
|
||
|
|
</section>
|
||
|
|
<section>
|
||
|
|
</section>
|
||
|
|
</article>
|
||
|
|
<nav id="sidebar">
|
||
|
|
<h1>Index</h1>
|
||
|
|
<div class="toc">
|
||
|
|
<ul></ul>
|
||
|
|
</div>
|
||
|
|
<ul id="index">
|
||
|
|
<li><h3>Super-module</h3>
|
||
|
|
<ul>
|
||
|
|
<li><code><a title="src.communicatorutils" href="index.html">src.communicatorutils</a></code></li>
|
||
|
|
</ul>
|
||
|
|
</li>
|
||
|
|
<li><h3><a href="#header-functions">Functions</a></h3>
|
||
|
|
<ul class="">
|
||
|
|
<li><code><a title="src.communicatorutils.lookupblocks.lookup_blocks_from_communicator" href="#src.communicatorutils.lookupblocks.lookup_blocks_from_communicator">lookup_blocks_from_communicator</a></code></li>
|
||
|
|
</ul>
|
||
|
|
</li>
|
||
|
|
</ul>
|
||
|
|
</nav>
|
||
|
|
</main>
|
||
|
|
<footer id="footer">
|
||
|
|
<p>Generated by <a href="https://pdoc3.github.io/pdoc"><cite>pdoc</cite> 0.7.4</a>.</p>
|
||
|
|
</footer>
|
||
|
|
<script src="https://cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/highlight.min.js"></script>
|
||
|
|
<script>hljs.initHighlightingOnLoad()</script>
|
||
|
|
</body>
|
||
|
|
</html>
|