~ Arbitrary ordering function of pubkeys. * * Note that we could use memcmp() here: even if they had somehow different * bitwise representations for the same key, we copied them all from struct * node which should make them unique. Even if not (say, a node vanished * and reappeared) we'd just end up sending two node_announcement for the * same node. */
| 76 | * same node. |
| 77 | */ |
| 78 | static int pubkey_order(const struct node_id *k1, |
| 79 | const struct node_id *k2, |
| 80 | void *unused UNUSED) |
| 81 | { |
| 82 | return node_id_cmp(k1, k2); |
| 83 | } |
| 84 | |
| 85 | static void uniquify_node_ids(struct node_id **ids) |
| 86 | { |
nothing calls this directly
no test coverage detected