~ Most simple search functions start with find_; in this case, search * for an existing attempt to connect the given peer id. */
| 97 | /*~ Most simple search functions start with find_; in this case, search |
| 98 | * for an existing attempt to connect the given peer id. */ |
| 99 | static struct connecting *find_connecting(struct daemon *daemon, |
| 100 | const struct node_id *id) |
| 101 | { |
| 102 | return connecting_htable_get(daemon->connecting, id); |
| 103 | } |
| 104 | |
| 105 | /*~ When we free a peer, we remove it from the daemon's hashtable. */ |
| 106 | static void destroy_peer(struct peer *peer) |
no outgoing calls
no test coverage detected