~ 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. */
| 85 | * same node. |
| 86 | */ |
| 87 | static int pubkey_order(const struct node_id *k1, |
| 88 | const struct node_id *k2, |
| 89 | void *unused UNUSED) |
| 90 | { |
| 91 | return node_id_cmp(k1, k2); |
| 92 | } |
| 93 | |
| 94 | /* Defined below: trickles out a reply to query_channel_range, if any. */ |
| 95 | static const u8 *maybe_create_range_response(const tal_t *ctx, |
nothing calls this directly
no test coverage detected