Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
opendht
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Iterations
Code
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Locked files
Deploy
Model registry
Analyze
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
savoirfairelinux
opendht
Commits
790bfcd4
Commit
790bfcd4
authored
Jul 14, 2015
by
Adrien Béraud
Browse files
Options
Downloads
Patches
Plain Diff
tools: add dhtscanner
The dhtscanner scans the network to get a full network map
parent
ac13795d
No related branches found
No related tags found
No related merge requests found
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
tools/Makefile.am
+4
-1
4 additions, 1 deletion
tools/Makefile.am
tools/dhtscanner.cpp
+139
-0
139 additions, 0 deletions
tools/dhtscanner.cpp
with
143 additions
and
1 deletion
tools/Makefile.am
+
4
−
1
View file @
790bfcd4
...
@@ -2,7 +2,7 @@ if USE_CYTHON
...
@@ -2,7 +2,7 @@ if USE_CYTHON
SUBDIRS
=
python
SUBDIRS
=
python
endif
endif
libexec_PROGRAMS
=
dhtnode dhtchat
libexec_PROGRAMS
=
dhtnode dhtchat
dhtscanner
AM_CPPFLAGS
=
-I
../include
AM_CPPFLAGS
=
-I
../include
...
@@ -11,3 +11,6 @@ dhtnode_LDFLAGS = -lopendht -L../src/.libs @GNUTLS_LIBS@
...
@@ -11,3 +11,6 @@ dhtnode_LDFLAGS = -lopendht -L../src/.libs @GNUTLS_LIBS@
dhtchat_SOURCES
=
dhtchat.cpp
dhtchat_SOURCES
=
dhtchat.cpp
dhtchat_LDFLAGS
=
-lopendht
-L
../src/.libs @GNUTLS_LIBS@
dhtchat_LDFLAGS
=
-lopendht
-L
../src/.libs @GNUTLS_LIBS@
dhtscanner_SOURCES
=
dhtscanner.cpp
dhtscanner_LDFLAGS
=
-lopendht
-L
../src/.libs @GNUTLS_LIBS@
This diff is collapsed.
Click to expand it.
tools/dhtscanner.cpp
0 → 100644
+
139
−
0
View file @
790bfcd4
/*
* Copyright (C) 2014 Savoir-Faire Linux Inc.
*
* Author: Adrien Béraud <adrien.beraud@savoirfairelinux.com>
*
* 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Additional permission under GNU GPL version 3 section 7:
*
* If you modify this program, or any covered work, by linking or
* combining it with the OpenSSL project's OpenSSL library (or a
* modified version of that library), containing parts covered by the
* terms of the OpenSSL or SSLeay licenses, Savoir-Faire Linux Inc.
* grants you additional permission to convey the resulting work.
* Corresponding Source for a non-source form of such a combination
* shall include the source code for the parts of OpenSSL used as well
* as that of the covered work.
*/
#include
<opendht.h>
extern
"C"
{
#include
<gnutls/gnutls.h>
}
#include
<iostream>
#include
<string>
#include
<chrono>
#include
<set>
#include
<condition_variable>
#include
<mutex>
using
namespace
dht
;
struct
snode_compare
{
bool
operator
()
(
const
std
::
shared_ptr
<
Node
>&
lhs
,
const
std
::
shared_ptr
<
Node
>&
rhs
)
const
{
return
lhs
->
id
<
rhs
->
id
;
}
};
using
NodeSet
=
std
::
set
<
std
::
shared_ptr
<
Node
>
,
snode_compare
>
;
std
::
condition_variable
cv
;
void
step
(
DhtRunner
&
dht
,
std
::
atomic_uint
&
done
,
std
::
shared_ptr
<
NodeSet
>
all_nodes
,
dht
::
InfoHash
cur_h
,
unsigned
cur_depth
)
{
std
::
cout
<<
"step at "
<<
cur_h
<<
", depth "
<<
cur_depth
<<
std
::
endl
;
done
++
;
dht
.
get
(
cur_h
,
[
all_nodes
](
const
std
::
vector
<
std
::
shared_ptr
<
Value
>>&
/*values*/
)
{
return
true
;
},
[
&
,
all_nodes
,
cur_h
,
cur_depth
](
bool
,
const
std
::
vector
<
std
::
shared_ptr
<
Node
>>&
nodes
)
{
all_nodes
->
insert
(
nodes
.
begin
(),
nodes
.
end
());
NodeSet
sbuck
{
nodes
.
begin
(),
nodes
.
end
()};
if
(
not
sbuck
.
empty
())
{
unsigned
bdepth
=
sbuck
.
size
()
==
1
?
0u
:
InfoHash
::
commonBits
((
*
sbuck
.
begin
())
->
id
,
(
*
std
::
prev
(
sbuck
.
end
()))
->
id
);
unsigned
target_depth
=
std
::
min
(
159u
,
bdepth
+
3u
);
std
::
cout
<<
cur_h
<<
" : "
<<
nodes
.
size
()
<<
" nodes; target is "
<<
target_depth
<<
" bits deep (cur "
<<
cur_depth
<<
")"
<<
std
::
endl
;
for
(
unsigned
b
=
cur_depth
;
b
<
target_depth
;
b
++
)
{
auto
new_h
=
cur_h
;
new_h
.
setBit
(
b
,
1
);
step
(
dht
,
done
,
all_nodes
,
new_h
,
b
+
1
);
}
}
done
--
;
std
::
cout
<<
done
.
load
()
<<
" operations left, "
<<
all_nodes
->
size
()
<<
" nodes found."
<<
std
::
endl
;
cv
.
notify_one
();
});
}
int
main
(
int
argc
,
char
**
argv
)
{
int
i
=
1
;
in_port_t
port
=
0
;
if
(
argc
>=
2
)
{
int
p
=
atoi
(
argv
[
i
]);
if
(
p
>
0
&&
p
<
0x10000
)
{
port
=
p
;
i
++
;
}
}
if
(
!
port
)
port
=
4222
;
int
rc
=
gnutls_global_init
();
if
(
rc
!=
GNUTLS_E_SUCCESS
)
throw
std
::
runtime_error
(
std
::
string
(
"Error initializing GnuTLS: "
)
+
gnutls_strerror
(
rc
));
auto
ca_tmp
=
dht
::
crypto
::
generateIdentity
(
"DHT Node CA"
);
auto
crt_tmp
=
dht
::
crypto
::
generateIdentity
(
"Scanner node"
,
ca_tmp
);
DhtRunner
dht
;
dht
.
run
(
port
,
crt_tmp
,
true
,
[](
dht
::
Dht
::
Status
/* ipv4 */
,
dht
::
Dht
::
Status
/* ipv6 */
)
{});
while
(
i
+
1
<
argc
)
{
dht
.
bootstrap
(
argv
[
i
],
argv
[
i
+
1
]);
i
+=
2
;
}
std
::
cout
<<
"OpenDht node "
<<
dht
.
getNodeId
()
<<
" running on port "
<<
port
<<
std
::
endl
;
std
::
cout
<<
"Scanning network..."
<<
std
::
endl
;
auto
all_nodes
=
std
::
make_shared
<
NodeSet
>
();
dht
::
InfoHash
cur_h
{};
cur_h
.
setBit
(
8
*
HASH_LEN
-
1
,
1
);
std
::
this_thread
::
sleep_for
(
std
::
chrono
::
seconds
(
2
));
std
::
atomic_uint
done
{
false
};
step
(
dht
,
done
,
all_nodes
,
cur_h
,
0
);
{
std
::
mutex
m
;
std
::
unique_lock
<
std
::
mutex
>
lk
(
m
);
cv
.
wait
(
lk
,
[
&
](){
return
done
.
load
()
==
0
;
});
}
std
::
cout
<<
std
::
endl
<<
"Scan ended: "
<<
all_nodes
->
size
()
<<
" nodes found."
<<
std
::
endl
;
for
(
const
auto
&
n
:
*
all_nodes
)
std
::
cout
<<
"Node "
<<
*
n
<<
std
::
endl
;
dht
.
join
();
gnutls_global_deinit
();
return
0
;
}
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment