summaryrefslogtreecommitdiffstats
path: root/transport/mesh/storeforward.go
blob: 1fcb93df23714c75f578949b341720c9109a2d60 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
// Package mesh - Store-and-forward messaging for offline scenarios
package mesh

import (
	"encoding/json"
	"fmt"
	"os"
	"path/filepath"
	"sync"
	"time"
)

// MessageQueue implements store-and-forward messaging
// Critical for military scenarios where connectivity is intermittent
type MessageQueue struct {
	pending      map[string][]*QueuedMessage // recipient -> messages
	delivered    map[string]bool             // message ID -> delivered
	queueDir     string                      // Persistent storage directory
	maxAge       time.Duration               // Auto-delete after this time
	maxSize      int                         // Max messages in queue
	encrypted    bool                        // Encrypt queue on disk
	mu           sync.RWMutex
	onDelivered  func(string)                // Callback when message delivered
}

// QueuedMessage represents a message waiting for delivery
type QueuedMessage struct {
	ID          string    `json:"id"`           // Unique message ID
	From        string    `json:"from"`         // Sender public key
	To          string    `json:"to"`           // Recipient public key
	Content     []byte    `json:"content"`      // Encrypted message content
	Timestamp   time.Time `json:"timestamp"`    // When queued
	Attempts    int       `json:"attempts"`     // Delivery attempts
	MaxAttempts int       `json:"max_attempts"` // Give up after this many
	Priority    int       `json:"priority"`     // Higher = more important
	Hops        int       `json:"hops"`         // How many hops so far
	MaxHops     int       `json:"max_hops"`     // Don't forward beyond this
}

// QueueConfig holds message queue configuration
type QueueConfig struct {
	QueueDir    string        // Where to store pending messages
	MaxAge      time.Duration // Auto-delete messages older than this
	MaxSize     int           // Max messages per recipient
	MaxAttempts int           // Max delivery attempts
	MaxHops     int           // Max forwarding hops
	Encrypted   bool          // Encrypt queue on disk
}

// NewMessageQueue creates a new message queue
func NewMessageQueue(config *QueueConfig) (*MessageQueue, error) {
	if config == nil {
		config = &QueueConfig{
			QueueDir:    filepath.Join(os.TempDir(), "veilith-queue"),
			MaxAge:      24 * time.Hour,
			MaxSize:     1000,
			MaxAttempts: 10,
			MaxHops:     5,
			Encrypted:   true,
		}
	}

	// Create queue directory
	if err := os.MkdirAll(config.QueueDir, 0700); err != nil {
		return nil, fmt.Errorf("failed to create queue dir: %w", err)
	}

	mq := &MessageQueue{
		pending:   make(map[string][]*QueuedMessage),
		delivered: make(map[string]bool),
		queueDir:  config.QueueDir,
		maxAge:    config.MaxAge,
		maxSize:   config.MaxSize,
		encrypted: config.Encrypted,
	}

	// Load existing queue from disk
	if err := mq.loadFromDisk(); err != nil {
		return nil, fmt.Errorf("failed to load queue: %w", err)
	}

	// Start background cleanup
	go mq.cleanupLoop()

	return mq, nil
}

// Enqueue adds a message to the queue
func (mq *MessageQueue) Enqueue(msg *QueuedMessage) error {
	mq.mu.Lock()
	defer mq.mu.Unlock()

	// Check if already delivered
	if mq.delivered[msg.ID] {
		return fmt.Errorf("message already delivered")
	}

	// Check queue size limit
	if len(mq.pending[msg.To]) >= mq.maxSize {
		return fmt.Errorf("queue full for recipient %s", msg.To)
	}

	// Add to pending queue
	mq.pending[msg.To] = append(mq.pending[msg.To], msg)

	// Persist to disk
	if err := mq.saveToDisk(); err != nil {
		return fmt.Errorf("failed to save queue: %w", err)
	}

	return nil
}

// Dequeue retrieves messages for a specific recipient
func (mq *MessageQueue) Dequeue(recipient string) []*QueuedMessage {
	mq.mu.Lock()
	defer mq.mu.Unlock()

	messages := mq.pending[recipient]
	delete(mq.pending, recipient)

	// Mark as delivered
	for _, msg := range messages {
		mq.delivered[msg.ID] = true
		if mq.onDelivered != nil {
			go mq.onDelivered(msg.ID)
		}
	}

	// Persist to disk
	mq.saveToDisk()

	return messages
}

// GetPendingCount returns number of pending messages for a recipient
func (mq *MessageQueue) GetPendingCount(recipient string) int {
	mq.mu.RLock()
	defer mq.mu.RUnlock()
	return len(mq.pending[recipient])
}

// GetTotalPendingCount returns total number of pending messages
func (mq *MessageQueue) GetTotalPendingCount() int {
	mq.mu.RLock()
	defer mq.mu.RUnlock()

	total := 0
	for _, messages := range mq.pending {
		total += len(messages)
	}
	return total
}

// GetPendingRecipients returns list of recipients with pending messages
func (mq *MessageQueue) GetPendingRecipients() []string {
	mq.mu.RLock()
	defer mq.mu.RUnlock()

	recipients := make([]string, 0, len(mq.pending))
	for recipient := range mq.pending {
		recipients = append(recipients, recipient)
	}
	return recipients
}

// IncrementAttempts increments delivery attempt counter
func (mq *MessageQueue) IncrementAttempts(msgID string) {
	mq.mu.Lock()
	defer mq.mu.Unlock()

	for _, messages := range mq.pending {
		for _, msg := range messages {
			if msg.ID == msgID {
				msg.Attempts++
				mq.saveToDisk()
				return
			}
		}
	}
}

// ShouldForward checks if message should be forwarded (multi-hop routing)
func (mq *MessageQueue) ShouldForward(msg *QueuedMessage) bool {
	return msg.Hops < msg.MaxHops && msg.Attempts < msg.MaxAttempts
}

// saveToDisk persists the queue to disk
func (mq *MessageQueue) saveToDisk() error {
	queuePath := filepath.Join(mq.queueDir, "queue.json")

	// Serialize queue
	data, err := json.MarshalIndent(mq.pending, "", "  ")
	if err != nil {
		return fmt.Errorf("failed to marshal queue: %w", err)
	}

	// TODO: Encrypt if mq.encrypted is true
	// For now, just save plaintext

	// Write to temp file first (atomic write)
	tempPath := queuePath + ".tmp"
	if err := os.WriteFile(tempPath, data, 0600); err != nil {
		return fmt.Errorf("failed to write queue: %w", err)
	}

	// Atomic rename
	if err := os.Rename(tempPath, queuePath); err != nil {
		return fmt.Errorf("failed to rename queue: %w", err)
	}

	return nil
}

// loadFromDisk loads the queue from disk
func (mq *MessageQueue) loadFromDisk() error {
	queuePath := filepath.Join(mq.queueDir, "queue.json")

	// Check if file exists
	if _, err := os.Stat(queuePath); os.IsNotExist(err) {
		// No existing queue - that's fine
		return nil
	}

	// Read file
	data, err := os.ReadFile(queuePath)
	if err != nil {
		return fmt.Errorf("failed to read queue: %w", err)
	}

	// TODO: Decrypt if mq.encrypted is true

	// Parse JSON
	if err := json.Unmarshal(data, &mq.pending); err != nil {
		return fmt.Errorf("failed to unmarshal queue: %w", err)
	}

	return nil
}

// cleanupLoop periodically removes old messages
func (mq *MessageQueue) cleanupLoop() {
	ticker := time.NewTicker(10 * time.Minute)
	defer ticker.Stop()

	for range ticker.C {
		mq.cleanup()
	}
}

// cleanup removes expired messages
func (mq *MessageQueue) cleanup() {
	mq.mu.Lock()
	defer mq.mu.Unlock()

	now := time.Now()
	removed := 0

	for recipient, messages := range mq.pending {
		// Filter out expired messages
		validMessages := make([]*QueuedMessage, 0)
		for _, msg := range messages {
			// Remove if too old or too many attempts
			if now.Sub(msg.Timestamp) > mq.maxAge || msg.Attempts >= msg.MaxAttempts {
				removed++
				continue
			}
			validMessages = append(validMessages, msg)
		}

		if len(validMessages) > 0 {
			mq.pending[recipient] = validMessages
		} else {
			delete(mq.pending, recipient)
		}
	}

	// Clean delivered map (keep only recent entries)
	for msgID := range mq.delivered {
		// TODO: Add timestamp to delivered map to clean old entries
		_ = msgID
	}

	if removed > 0 {
		mq.saveToDisk()
	}
}

// Clear removes all messages from queue
func (mq *MessageQueue) Clear() error {
	mq.mu.Lock()
	defer mq.mu.Unlock()

	mq.pending = make(map[string][]*QueuedMessage)
	mq.delivered = make(map[string]bool)

	return mq.saveToDisk()
}

// SetOnDelivered sets callback for when message is delivered
func (mq *MessageQueue) SetOnDelivered(callback func(string)) {
	mq.mu.Lock()
	defer mq.mu.Unlock()
	mq.onDelivered = callback
}

// String returns a string representation
func (mq *MessageQueue) String() string {
	mq.mu.RLock()
	defer mq.mu.RUnlock()

	totalPending := 0
	for _, messages := range mq.pending {
		totalPending += len(messages)
	}

	return fmt.Sprintf("MessageQueue(pending=%d, delivered=%d, recipients=%d)",
		totalPending, len(mq.delivered), len(mq.pending))
}