Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
G
go-ipfs
概览
概览
详情
活动
周期分析
版本库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
统计图
问题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程表
图表
维基
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
jihao
go-ipfs
Commits
bae8b9f4
提交
bae8b9f4
authored
1月 15, 2015
作者:
Jeromy
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
starting to move important events over to EventBegin/Done
上级
ac26b705
隐藏空白字符变更
内嵌
并排
正在显示
4 个修改的文件
包含
23 行增加
和
8 行删除
+23
-8
bitswap.go
exchange/bitswap/bitswap.go
+2
-2
protocol.go
p2p/crypto/secio/protocol.go
+3
-1
dht.go
routing/dht/dht.go
+8
-0
routing.go
routing/dht/routing.go
+10
-5
没有找到文件。
exchange/bitswap/bitswap.go
浏览文件 @
bae8b9f4
...
...
@@ -120,12 +120,12 @@ func (bs *bitswap) GetBlock(parent context.Context, k u.Key) (*blocks.Block, err
ctx
,
cancelFunc
:=
context
.
WithCancel
(
parent
)
ctx
=
eventlog
.
ContextWithLoggable
(
ctx
,
eventlog
.
Uuid
(
"GetBlockRequest"
))
log
.
Event
(
ctx
,
"GetBlockRequestBegin
"
,
&
k
)
e
:=
log
.
EventBegin
(
ctx
,
"GetBlockRequest
"
,
&
k
)
log
.
Debugf
(
"GetBlockRequestBegin"
)
defer
func
()
{
cancelFunc
()
log
.
Event
(
ctx
,
"GetBlockRequestEnd"
,
&
k
)
e
.
Done
(
)
log
.
Debugf
(
"GetBlockRequestEnd"
)
}()
...
...
p2p/crypto/secio/protocol.go
浏览文件 @
bae8b9f4
...
...
@@ -81,7 +81,9 @@ func (s *secureSession) handshake(ctx context.Context, insecure io.ReadWriter) e
}
log
.
Debugf
(
"handshake: %s <--start--> %s"
,
s
.
localPeer
,
s
.
remotePeer
)
log
.
Event
(
ctx
,
"secureHandshakeStart"
,
s
.
localPeer
)
e
:=
log
.
EventBegin
(
ctx
,
"secureHandshake"
,
s
.
localPeer
)
defer
e
.
Done
()
s
.
local
.
permanentPubKey
=
s
.
localKey
.
GetPublic
()
myPubKeyBytes
,
err
:=
s
.
local
.
permanentPubKey
.
Bytes
()
if
err
!=
nil
{
...
...
routing/dht/dht.go
浏览文件 @
bae8b9f4
...
...
@@ -196,6 +196,8 @@ func (dht *IpfsDHT) getValueOrPeers(ctx context.Context, p peer.ID,
// getValueSingle simply performs the get value RPC with the given parameters
func
(
dht
*
IpfsDHT
)
getValueSingle
(
ctx
context
.
Context
,
p
peer
.
ID
,
key
u
.
Key
)
(
*
pb
.
Message
,
error
)
{
e
:=
log
.
EventBegin
(
ctx
,
"getValueSingle"
,
p
,
&
key
)
defer
e
.
Done
()
pmes
:=
pb
.
NewMessage
(
pb
.
Message_GET_VALUE
,
string
(
key
),
0
)
return
dht
.
sendRequest
(
ctx
,
p
,
pmes
)
...
...
@@ -265,11 +267,17 @@ func (dht *IpfsDHT) FindLocal(id peer.ID) peer.PeerInfo {
// findPeerSingle asks peer 'p' if they know where the peer with id 'id' is
func
(
dht
*
IpfsDHT
)
findPeerSingle
(
ctx
context
.
Context
,
p
peer
.
ID
,
id
peer
.
ID
)
(
*
pb
.
Message
,
error
)
{
e
:=
log
.
EventBegin
(
ctx
,
"findPeerSingle"
,
p
,
id
)
defer
e
.
Done
()
pmes
:=
pb
.
NewMessage
(
pb
.
Message_FIND_NODE
,
string
(
id
),
0
)
return
dht
.
sendRequest
(
ctx
,
p
,
pmes
)
}
func
(
dht
*
IpfsDHT
)
findProvidersSingle
(
ctx
context
.
Context
,
p
peer
.
ID
,
key
u
.
Key
)
(
*
pb
.
Message
,
error
)
{
e
:=
log
.
EventBegin
(
ctx
,
"findProvidersSingle"
,
p
,
&
key
)
defer
e
.
Done
()
pmes
:=
pb
.
NewMessage
(
pb
.
Message_GET_PROVIDERS
,
string
(
key
),
0
)
return
dht
.
sendRequest
(
ctx
,
p
,
pmes
)
}
...
...
routing/dht/routing.go
浏览文件 @
bae8b9f4
...
...
@@ -122,10 +122,12 @@ func (dht *IpfsDHT) GetValue(ctx context.Context, key u.Key) ([]byte, error) {
// Provide makes this node announce that it can provide a value for the given key
func
(
dht
*
IpfsDHT
)
Provide
(
ctx
context
.
Context
,
key
u
.
Key
)
error
{
log
:=
dht
.
log
()
.
Prefix
(
"Provide(%s)"
,
key
)
log
.
Debugf
(
"start"
,
key
)
log
.
Event
(
ctx
,
"provideBegin"
,
&
key
)
defer
log
.
Debugf
(
"end"
,
key
)
defer
log
.
Event
(
ctx
,
"provideEnd"
,
&
key
)
e
:=
log
.
EventBegin
(
ctx
,
"provide"
,
&
key
)
defer
e
.
Done
()
// add self locally
dht
.
providers
.
AddProvider
(
key
,
dht
.
self
)
...
...
@@ -163,6 +165,7 @@ func (dht *IpfsDHT) FindProviders(ctx context.Context, key u.Key) ([]peer.PeerIn
// Kademlia 'node lookup' operation. Returns a channel of the K closest peers
// to the given key
func
(
dht
*
IpfsDHT
)
getClosestPeers
(
ctx
context
.
Context
,
key
u
.
Key
)
(
<-
chan
peer
.
ID
,
error
)
{
e
:=
log
.
EventBegin
(
ctx
,
"getClosestPeers"
,
&
key
)
tablepeers
:=
dht
.
routingTable
.
NearestPeers
(
kb
.
ConvertKey
(
key
),
AlphaValue
)
if
len
(
tablepeers
)
==
0
{
return
nil
,
errors
.
Wrap
(
kb
.
ErrLookupFailure
)
...
...
@@ -204,6 +207,7 @@ func (dht *IpfsDHT) getClosestPeers(ctx context.Context, key u.Key) (<-chan peer
go
func
()
{
defer
close
(
out
)
defer
e
.
Done
()
// run it!
_
,
err
:=
query
.
Run
(
ctx
,
tablepeers
)
if
err
!=
nil
{
...
...
@@ -242,10 +246,9 @@ func (dht *IpfsDHT) FindProvidersAsync(ctx context.Context, key u.Key, count int
func
(
dht
*
IpfsDHT
)
findProvidersAsyncRoutine
(
ctx
context
.
Context
,
key
u
.
Key
,
count
int
,
peerOut
chan
peer
.
PeerInfo
)
{
log
:=
dht
.
log
()
.
Prefix
(
"FindProviders(%s)"
,
key
)
e
:=
log
.
EventBegin
(
ctx
,
"findProvidersAsync"
,
&
key
)
defer
e
.
Done
()
defer
close
(
peerOut
)
defer
log
.
Event
(
ctx
,
"findProviders end"
,
&
key
)
log
.
Debug
(
"begin"
)
defer
log
.
Debug
(
"begin"
)
ps
:=
pset
.
NewLimited
(
count
)
provs
:=
dht
.
providers
.
GetProviders
(
ctx
,
key
)
...
...
@@ -314,6 +317,8 @@ func (dht *IpfsDHT) findProvidersAsyncRoutine(ctx context.Context, key u.Key, co
// FindPeer searches for a peer with given ID.
func
(
dht
*
IpfsDHT
)
FindPeer
(
ctx
context
.
Context
,
id
peer
.
ID
)
(
peer
.
PeerInfo
,
error
)
{
e
:=
log
.
EventBegin
(
ctx
,
"FindPeer"
,
id
)
defer
e
.
Done
()
// Check if were already connected to them
if
pi
:=
dht
.
FindLocal
(
id
);
pi
.
ID
!=
""
{
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论