IDSize = 128 / 8
)
-type PeerId [IDSize]byte
+type PeerID [IDSize]byte
-func (id PeerId) String() string {
+func (id PeerID) String() string {
return base64.RawStdEncoding.EncodeToString(id[:])
}
-func (id PeerId) MarshalJSON() ([]byte, error) {
+func (id PeerID) MarshalJSON() ([]byte, error) {
return []byte(`"` + id.String() + `"`), nil
}
}
type MACCache struct {
- cache map[PeerId]*MACAndTimeSync
+ cache map[PeerID]*MACAndTimeSync
l sync.RWMutex
}
func NewMACCache() *MACCache {
- return &MACCache{cache: make(map[PeerId]*MACAndTimeSync)}
+ return &MACCache{cache: make(map[PeerID]*MACAndTimeSync)}
}
// Remove disappeared keys, add missing ones with initialized MACs.
-func (mc *MACCache) Update(peers *map[PeerId]*PeerConf) {
+func (mc *MACCache) Update(peers *map[PeerID]*PeerConf) {
mc.l.Lock()
- for pid, _ := range mc.cache {
+ for pid := range mc.cache {
if _, exists := (*peers)[pid]; !exists {
log.Println("Cleaning key:", pid)
delete(mc.cache, pid)
// Try to find peer's identity (that equals to MAC)
// by taking first blocksize sized bytes from data at the beginning
// as plaintext and last bytes as cyphertext.
-func (mc *MACCache) Find(data []byte) *PeerId {
+func (mc *MACCache) Find(data []byte) *PeerID {
if len(data) < 8*2 {
return nil
}
mt.mac.Sum(sum[:0])
mt.l.Unlock()
if subtle.ConstantTimeCompare(sum[len(sum)-8:], data[len(data)-8:]) == 1 {
- ppid := PeerId(pid)
+ ppid := PeerID(pid)
mc.l.RUnlock()
return &ppid
}