Use static array instead of unordered_map to keep memory contiguous

src/mesh/CryptoEngine.cpp

@@ -263,15 +263,41 @@ bool CryptoEngine::setCryptoSharedSecret(meshtastic_UserLite_public_key_t pubkey
     uint32_t lookupKey;
     memcpy(&lookupKey, pubkey.bytes, sizeof(lookupKey));
 
-    // See if we cached the secret already
+    uint16_t oldestDelta = 0;
-    auto iter = sharedSecretCache.find(lookupKey);
+    CachedSharedSecret &oldestEntry = sharedSecretCache[0];
-    if (iter != sharedSecretCache.end()) {
+    for (size_t i = 0; i < MAX_CACHED_SHARED_SECRETS; i++) {
-        // Cache hit! Copy it into shared_key.
+        CachedSharedSecret &entry = sharedSecretCache[i];
-        CachedSharedSecret &entry = iter->second;
+        if (entry.lookup_key == lookupKey) {
-        memcpy(shared_key, entry.shared_secret, 32);
+            // Cache hit! Copy it into shared_key.
-        // Update the last used timestamp
+            memcpy(shared_key, entry.shared_secret, 32);
-        entry.last_used = now;
+            // Update the last used timestamp
-        return true;
+            entry.last_used = now;
+            return true;
+        }
+
+        if (oldestEntry.lookup_key == 0) {
+            // We already have a valid slot to insert into. Keep looking for a cache hit.
+            continue;
+        }
+
+        if (entry.lookup_key == 0) {
+            // This entry is empty. We can insert into it later, if needed.
+            oldestEntry = entry;
+            continue;
+        }
+
+        // Track the oldest entry in case the cache is full.
+        uint16_t delta = 0;
+        if (now >= entry.last_used) {
+            delta = now - entry.last_used;
+        } else {
+            // Assume a larger last used timestamp is further in the past
+            delta = uint16_t(0x100) + now - entry.last_used;
+        }
+        if (delta > oldestDelta) {
+            oldestEntry = entry;
+            oldestDelta = delta;
+        }
     }
 
     // Cache miss. Generate the shared secret.
@@ -280,34 +306,10 @@ bool CryptoEngine::setCryptoSharedSecret(meshtastic_UserLite_public_key_t pubkey
     }
     hash(shared_key, 32);
 
-    // If the cache will grow too large, remove the oldest entry first
+    // Insert the calculated shared secret into the cache, overwriting an old entry if needed.
-    if (sharedSecretCache.size() >= MAX_CACHED_SHARED_SECRETS) {
+    oldestEntry.lookup_key = lookupKey;
-        uint16_t oldestDelta = 0;
+    oldestEntry.last_used = now;
-        uint32_t oldestKey = sharedSecretCache.begin()->first;
+    memcpy(oldestEntry.shared_secret, shared_key, 32);
-        for (const auto &p : sharedSecretCache) {
-            const uint32_t key = p.first;
-            const CachedSharedSecret &entry = p.second;
-
-            uint16_t delta = 0;
-            if (now >= entry.last_used) {
-                delta = now - entry.last_used;
-            } else {
-                // Assume a larger last used timestamp is further in the past
-                delta = uint16_t(0x100) + now - entry.last_used;
-            }
-            if (delta > oldestDelta) {
-                oldestKey = key;
-                oldestDelta = delta;
-            }
-        }
-        sharedSecretCache.erase(oldestKey);
-    }
-
-    // Now insert the calculated shared secret
-    CachedSharedSecret entry;
-    entry.last_used = now;
-    memcpy(entry.shared_secret, shared_key, 32);
-    sharedSecretCache.insert({lookupKey, entry});
     return true;
 }
 

src/mesh/CryptoEngine.h

@@ -17,6 +17,7 @@ struct CryptoKey {
 };
 
 struct CachedSharedSecret {
+    uint32_t lookup_key;
     uint8_t shared_secret[32];
     uint8_t last_used;
 };
@@ -114,7 +115,7 @@ class CryptoEngine
     /**
      * Cache mapping peers' public keys -> {shared_secret, last_used}
      */
-    std::unordered_map<uint32_t, CachedSharedSecret> sharedSecretCache;
+    CachedSharedSecret sharedSecretCache[MAX_CACHED_SHARED_SECRETS] = {0};
 
     /**
      * Set cryptographic (hashed) shared_key calculated from the given pubkey

test/test_crypto/test_main.cpp

@@ -7,12 +7,13 @@
 struct TestCryptoEngine {
     static bool getCachedSecret(uint32_t lookupKey, CachedSharedSecret &entry)
     {
-        auto iter = crypto->sharedSecretCache.find(lookupKey);
+        for (size_t i = 0; i < MAX_CACHED_SHARED_SECRETS; i++) {
-        if (iter == crypto->sharedSecretCache.end()) {
+            entry = crypto->sharedSecretCache[i];
-            return false;
+            if (entry.lookup_key == lookupKey) {
+                return true;
+            }
         }
-        entry = iter->second;
+        return false;
-        return true;
     }
 };