delete(mc.cache, pid)
}
}
- logger.WithFields(fields).WithField("size", mc.Length()).Debug("Cleaned, add/update new key")
+ logger.WithFields(
+ fields,
+ ).WithField(
+ "size",
+ mc.Length(),
+ ).Debug("Cleaned, add/update new key")
for pid, pc := range *peers {
if _, exists := mc.cache[pid]; exists {
logger.WithFields(fields).WithFields(
for i := 0; i < 8; i++ {
data[i] ^= buf[i]
}
- logger.WithFields(fields).WithField("after", hex.EncodeToString(data)).Debug("Done")
+ logger.WithFields(
+ fields,
+ ).WithField(
+ "after",
+ hex.EncodeToString(data),
+ ).Debug("Done")
}
// Find tries to find peer's identity (that equals to MAC)
// as plaintext and last bytes as cyphertext.
func (mc *MACCache) Find(data []byte) (*PeerID, error) {
const minimumSize = 8 * 2
- lenData := len(data)
fields := logrus.Fields{
"func": logFuncPrefix + "MACCache.Find",
- "data": lenData,
+ "data": len(data),
"size": mc.Length(),
}
logger.WithFields(fields).Debug("Starting")
- if lenData < minimumSize {
- return nil, errors.Errorf("MAC is too small %d, minimum %d", lenData, minimumSize)
+ if len(data) < minimumSize {
+ return nil, errors.Errorf("MAC is too small %d, minimum %d", len(data), minimumSize)
}
buf := make([]byte, 8)
sum := make([]byte, 32)
mt.l.Unlock()
return nil, errors.Wrap(err, "mt.mac.Write")
}
- logger.WithFields(fields).WithField("buf", hex.EncodeToString(buf[:0])).Debug("mt.mac.Sum")
+ logger.WithFields(
+ fields,
+ ).WithField(
+ "buf",
+ hex.EncodeToString(buf[:0]),
+ ).Debug("mt.mac.Sum")
mt.mac.Sum(sum[:0])
mt.l.Unlock()
- if subtle.ConstantTimeCompare(sum[len(sum)-8:], data[lenData-8:]) == 1 {
+ if subtle.ConstantTimeCompare(sum[len(sum)-8:], data[len(data)-8:]) == 1 {
logger.WithFields(fields).WithFields(loopFields).Debug("Matching peer")
ppid := PeerID(pid)
return &ppid, nil
logger.WithFields(fields).WithFields(loopFields).Debug("Not matching peer")
}
- logger.WithFields(fields).Debug("Couldn't find matching peer ID")
+ logger.WithFields(fields).Debug("Can't find matching peer ID")
return nil, nil
}