mirror of
https://github.com/tailscale/tailscale.git
synced 2024-11-25 11:05:45 +00:00
c7d68724ad
@raggi and I have been experimenting with using unique.Handle for public keys in various places. This is an experiment to see what it looks like just going all the way, so a NodePublic is always just a single word (a single pointer) behind the scenes, so 8 bytes (in practice, on 64-bit) instead of 32 bytes. Downsides are some extra unique.Make lookups (probably cheap enough) and it makes data structures that were previously skipped by GC as having no pointers no longer skipped. But on the upside, it saves memory and makes certain operations much faster. Updates tailscale/corp#24485 Change-Id: Ic5c807b86b465769b046fba5d640c4fe73bf2a2f Signed-off-by: Brad Fitzpatrick <bradfitz@tailscale.com> |
||
|---|---|---|
| .. | ||
| appctype | ||
| bools | ||
| dnstype | ||
| empty | ||
| flagtype | ||
| ipproto | ||
| key | ||
| lazy | ||
| logger | ||
| logid | ||
| netlogtype | ||
| netmap | ||
| nettype | ||
| opt | ||
| persist | ||
| prefs | ||
| preftype | ||
| ptr | ||
| result | ||
| structs | ||
| tkatype | ||
| views | ||