Files

99 lines
1.8 KiB
Go
Raw Permalink Normal View History

2019-01-02 01:55:51 +01:00
/* SPDX-License-Identifier: MIT
2018-05-03 15:04:00 +02:00
*
2025-05-04 17:48:53 +02:00
* Copyright (C) 2017-2025 WireGuard LLC. All Rights Reserved.
2018-05-03 15:04:00 +02:00
*/
2019-03-03 04:04:41 +01:00
package device
2017-06-24 15:34:17 +02:00
import (
"crypto/rand"
2020-06-22 12:58:01 -07:00
"encoding/binary"
2017-06-24 15:34:17 +02:00
"sync"
)
2017-06-26 22:07:29 +02:00
type IndexTableEntry struct {
peer *Peer
handshake *Handshake
2018-05-13 18:23:40 +02:00
keypair *Keypair
2017-06-26 22:07:29 +02:00
}
2017-06-24 15:34:17 +02:00
type IndexTable struct {
sync.RWMutex
2017-06-26 22:07:29 +02:00
table map[uint32]IndexTableEntry
2017-06-24 15:34:17 +02:00
}
func randUint32() (uint32, error) {
2018-05-13 18:23:40 +02:00
var integer [4]byte
_, err := rand.Read(integer[:])
2020-06-22 12:58:01 -07:00
// Arbitrary endianness; both are intrinsified by the Go compiler.
return binary.LittleEndian.Uint32(integer[:]), err
2017-06-24 15:34:17 +02:00
}
func (table *IndexTable) Init() {
table.Lock()
defer table.Unlock()
2017-06-26 22:07:29 +02:00
table.table = make(map[uint32]IndexTableEntry)
}
2017-06-30 14:41:08 +02:00
func (table *IndexTable) Delete(index uint32) {
table.Lock()
defer table.Unlock()
2018-05-13 18:23:40 +02:00
delete(table.table, index)
}
func (table *IndexTable) SwapIndexForKeypair(index uint32, keypair *Keypair) {
table.Lock()
defer table.Unlock()
2018-05-13 18:23:40 +02:00
entry, ok := table.table[index]
if !ok {
2017-06-26 22:07:29 +02:00
return
}
2018-05-13 18:23:40 +02:00
table.table[index] = IndexTableEntry{
peer: entry.peer,
keypair: keypair,
handshake: nil,
}
2017-06-26 22:07:29 +02:00
}
2018-05-13 18:23:40 +02:00
func (table *IndexTable) NewIndexForHandshake(peer *Peer, handshake *Handshake) (uint32, error) {
2017-06-24 15:34:17 +02:00
for {
// generate random index
2017-06-26 22:07:29 +02:00
index, err := randUint32()
2017-06-24 15:34:17 +02:00
if err != nil {
2017-06-26 22:07:29 +02:00
return index, err
2017-06-24 15:34:17 +02:00
}
// check if index used
table.RLock()
2017-06-26 22:07:29 +02:00
_, ok := table.table[index]
table.RUnlock()
2017-06-24 15:34:17 +02:00
if ok {
continue
}
2017-06-26 22:07:29 +02:00
2018-05-13 18:23:40 +02:00
// check again while locked
2017-06-26 22:07:29 +02:00
table.Lock()
2017-06-26 22:07:29 +02:00
_, found := table.table[index]
if found {
table.Unlock()
2017-06-24 15:34:17 +02:00
continue
}
2017-06-26 22:07:29 +02:00
table.table[index] = IndexTableEntry{
peer: peer,
2018-05-13 18:23:40 +02:00
handshake: handshake,
keypair: nil,
2017-06-26 22:07:29 +02:00
}
table.Unlock()
2017-06-26 22:07:29 +02:00
return index, nil
2017-06-24 15:34:17 +02:00
}
}
2017-06-26 22:07:29 +02:00
func (table *IndexTable) Lookup(id uint32) IndexTableEntry {
table.RLock()
defer table.RUnlock()
2017-06-26 22:07:29 +02:00
return table.table[id]
2017-06-24 15:34:17 +02:00
}