/* -*-c-*-
- *
- * $Id$
*
* Communication with the peer
*
* (c) 2001 Straylight/Edgeware
*/
-/*----- Licensing notice --------------------------------------------------*
+/*----- Licensing notice --------------------------------------------------*
*
* This file is part of Trivial IP Encryption (TrIPE).
*
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
- *
+ *
* TrIPE is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
- *
+ *
* You should have received a copy of the GNU General Public License
* along with TrIPE; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
/*----- Static variables --------------------------------------------------*/
-static peer *peers = 0;
+static sym_table byname;
+static addrmap byaddr;
static sel_file sock;
/*----- Tunnel table ------------------------------------------------------*/
uint32 id;
const octet *magic;
ping *pg;
-
+
IF_TRACING(T_PEER, {
trace(T_PEER, "peer: received %s reply from %s",
p_pingtype(msg), p->spec.name);
p_pingdone(pg, PING_OK);
}
+/* --- @p_encrypt@ --- *
+ *
+ * Arguments: @peer *p@ = peer to encrypt message to
+ * @int ty@ message type to send
+ * @buf *bin, *bout@ = input and output buffers
+ *
+ * Returns: ---
+ *
+ * Use: Convenience function for packet encryption. Forces
+ * renegotiation when necessary. Check for the output buffer
+ * being broken to find out whether the encryption was
+ * successful.
+ */
+
+static int p_encrypt(peer *p, int ty, buf *bin, buf *bout)
+{
+ int err = ksl_encrypt(&p->ks, ty, bin, bout);
+
+ if (err == KSERR_REGEN) {
+ kx_start(&p->kx, 1);
+ err = 0;
+ }
+ if (!BOK(bout))
+ err = -1;
+ return (err);
+}
+
+/* --- @p_decrypt@ --- *
+ *
+ * Arguments: @peer *p@ = peer to decrypt message from
+ * @int ty@ = message type to expect
+ * @buf *bin, *bout@ = input and output buffers
+ *
+ * Returns: Zero on success; nonzero on error.
+ *
+ * Use: Convenience function for packet decryption. Reports errors
+ * and updates statistics appropriately.
+ */
+
+static int p_decrypt(peer *p, int ty, buf *bin, buf *bout)
+{
+ if (ksl_decrypt(&p->ks, ty, bin, bout)) {
+ p->st.n_reject++;
+ a_warn("PEER", "?PEER", p, "decrypt-failed", A_END);
+ return (-1);
+ }
+ if (!BOK(bout))
+ return (-1);
+ return (0);
+}
+
/* --- @p_read@ --- *
*
* Arguments: @int fd@ = file descriptor to read from
/* --- Find the appropriate peer --- */
- assert(a.sa.sa_family == AF_INET);
- for (p = peers; p; p = p->next) {
- if (p->spec.sa.sin.sin_addr.s_addr == a.sin.sin_addr.s_addr &&
- p->spec.sa.sin.sin_port == a.sin.sin_port)
- goto found;
+ if ((p = p_findbyaddr(&a)) == 0) {
+ a_warn("PEER", "-", "unexpected-source", "?ADDR", &a, A_END);
+ return;
}
- a_warn("PEER", "-", "unexpected-source", "?ADDR", &a, A_END);
- return;
-found:
IF_TRACING(T_PEER, {
trace(T_PEER, "peer: packet received from `%s'", p->spec.name);
trace_block(T_PACKET, "peer: packet contents", buf_i, n);
return;
}
buf_init(&bb, buf_o, sizeof(buf_o));
- if (ksl_decrypt(&p->ks, MSG_PACKET, &b, &bb)) {
- p->st.n_reject++;
- a_warn("PEER", "?PEER", p, "decrypt-failed", A_END);
+ if (p_decrypt(p, MSG_PACKET, &b, &bb))
return;
- }
if (BOK(&bb)) {
p->st.n_ipin++;
p->st.sz_ipin += BSZ(&b);
case MISC_PING:
buf_put(p_txstart(p, MSG_MISC | MISC_PONG), BCUR(&b), BLEFT(&b));
p_txend(p);
- break;
+ break;
case MISC_PONG:
p_ponged(p, MISC_PONG, &b);
break;
case MISC_EPING:
buf_init(&bb, buf_t, sizeof(buf_t));
- if (ksl_decrypt(&p->ks, ch, &b, &bb)) {
- p->st.n_reject++;
- a_warn("PEER", "?PEER", "decrypt-failed", A_END);
+ if (p_decrypt(p, ch, &b, &bb))
return;
- }
if (BOK(&bb)) {
buf_flip(&bb);
- if (ksl_encrypt(&p->ks, MSG_MISC | MISC_EPONG, &bb,
- p_txstart(p, MSG_MISC | MISC_EPONG)))
- kx_start(&p->kx, 0);
+ p_encrypt(p, MSG_MISC | MISC_EPONG, &bb,
+ p_txstart(p, MSG_MISC | MISC_EPONG));
p_txend(p);
}
break;
case MISC_EPONG:
buf_init(&bb, buf_t, sizeof(buf_t));
- if (ksl_decrypt(&p->ks, ch, &b, &bb)) {
- p->st.n_reject++;
- a_warn("PEER", "?PEER", p, "decrypt-failed", A_END);
+ if (p_decrypt(p, ch, &b, &bb))
return;
- }
if (BOK(&bb)) {
buf_flip(&bb);
p_ponged(p, MISC_EPONG, &bb);
buf_init(&bb, buf_t, sizeof(buf_t));
p_pingwrite(pg, &bb);
buf_flip(&bb);
- if (ksl_encrypt(&p->ks, MSG_MISC | MISC_EPING, &bb, b))
- kx_start(&p->kx, 0);
+ p_encrypt(p, MSG_MISC | MISC_EPING, &bb, b);
if (!BOK(b))
return (-1);
p_txend(p);
buf *bb = p_txstart(p, MSG_PACKET);
TIMER;
- if (ksl_encrypt(&p->ks, MSG_PACKET, b, bb))
- kx_start(&p->kx, 0);
+ p_encrypt(p, MSG_PACKET, b, bb);
if (BOK(bb) && BLEN(bb)) {
p->st.n_ipout++;
p->st.sz_ipout += BLEN(bb);
void p_keyreload(void)
{
- peer *p;
-
- if (km_reload()) {
- for (p = peers; p; p = p->next)
- kx_newkeys(&p->kx);
- }
+ if (km_reload())
+ FOREACH_PEER(p, { kx_newkeys(&p->kx); });
}
/* --- @p_interval@ --- *
void p_interval(void)
{
- peer *p;
-
p_keyreload();
- for (p = peers; p; p = p->next)
- ksl_prune(&p->ks);
+ FOREACH_PEER(p, { ksl_prune(&p->ks); });
}
/* --- @p_stats@ --- *
*/
void p_setifname(peer *p, const char *name)
- { if (p->ifname) xfree(p->ifname); p->ifname = xstrdup(name); }
+{
+ xfree(p->ifname);
+ p->ifname = xstrdup(name);
+ if (p->spec.tops->setifname)
+ p->spec.tops->setifname(p->t, name);
+}
/* --- @p_addr@ --- *
*
sel_initfile(&sel, &sock, fd, SEL_READ, p_read, 0);
sel_addfile(&sock);
T( trace(T_PEER, "peer: created socket"); )
+
+ sym_create(&byname);
+ am_create(&byaddr);
}
/* --- @p_port@ --- *
peer *p_create(peerspec *spec)
{
peer *p = CREATE(peer);
+ const tunnel_ops *tops = spec->tops;
+ int fd;
+ unsigned f;
+
+ p->byname = sym_find(&byname, spec->name, -1, sizeof(peer_byname), &f);
+ if (f) goto tidy_0;
+ p->byaddr = am_find(&byaddr, &spec->sa, sizeof(peer_byaddr), &f);
+ if (f) goto tidy_1;
+ p->byname->p = p->byaddr->p = p;
T( trace(T_PEER, "peer: creating new peer `%s'", spec->name); )
p->spec = *spec;
- p->spec.name = xstrdup(spec->name);
+ p->spec.name = (/*unconst*/ char *)SYM_NAME(p->byname);
+ if (spec->tag)
+ p->spec.tag = xstrdup(spec->tag);
p->ks = 0;
- p->prev = 0;
p->pings = 0;
p->ifname = 0;
memset(&p->st, 0, sizeof(stats));
p->st.t_start = time(0);
- if ((p->t = spec->tops->create(p)) == 0)
- goto tidy_0;
+ if (!(tops->flags & TUNF_PRIVOPEN))
+ fd = -1;
+ else if ((fd = ps_tunfd(tops, &p->ifname)) < 0)
+ goto tidy_2;
+ if ((p->t = tops->create(p, fd, &p->ifname)) == 0)
+ goto tidy_3;
+ T( trace(T_TUNNEL, "peer: attached interface %s to peer `%s'",
+ p->ifname, p_name(p)); )
p_setkatimer(p);
- if (kx_init(&p->kx, p, &p->ks))
- goto tidy_1;
- p_setifname(p, spec->tops->ifname(p->t));
- p->next = peers;
- if (peers)
- peers->prev = p;
- peers = p;
+ if (kx_init(&p->kx, p, &p->ks, p->spec.kxf))
+ goto tidy_4;
a_notify("ADD",
- "?PEER", p,
- "%s", p->ifname,
- "?ADDR", &p->spec.sa,
- A_END);
- a_notify("KXSTART", "?PEER", p, A_END);
+ "?PEER", p,
+ "%s", p->ifname,
+ "?ADDR", &p->spec.sa,
+ A_END);
+ if (!(p->spec.kxf & KXF_CORK)) {
+ a_notify("KXSTART", "?PEER", p, A_END);
/* Couldn't tell anyone before */
+ }
return (p);
-tidy_1:
+tidy_4:
if (spec->t_ka)
sel_rmtimer(&p->tka);
+ xfree(p->ifname);
p->t->ops->destroy(p->t);
+tidy_3:
+ if (fd >= 0) close(fd);
+tidy_2:
+ am_remove(&byaddr, p->byaddr);
+ if (p->spec.tag) xfree(p->spec.tag);
+tidy_1:
+ sym_remove(&byname, p->byname);
tidy_0:
- xfree(p->spec.name);
DESTROY(p);
return (0);
}
const char *p_name(peer *p) { return (p->spec.name); }
+/* --- @p_tag@ --- *
+ *
+ * Arguments: @peer *p@ = pointer to a peer block
+ *
+ * Returns: A pointer to the peer's public key tag.
+ */
+
+const char *p_tag(peer *p)
+ { return (p->spec.tag ? p->spec.tag : p->spec.name); }
+
/* --- @p_spec@ --- *
*
* Arguments: @peer *p@ = pointer to a peer block
const peerspec *p_spec(peer *p) { return (&p->spec); }
+/* --- @p_findbyaddr@ --- *
+ *
+ * Arguments: @const addr *a@ = address to look up
+ *
+ * Returns: Pointer to the peer block, or null if not found.
+ *
+ * Use: Finds a peer by address.
+ */
+
+peer *p_findbyaddr(const addr *a)
+{
+ peer_byaddr *pa;
+
+ if ((pa = am_find(&byaddr, a, 0, 0)) != 0)
+ return (pa->p);
+ return (0);
+}
+
/* --- @p_find@ --- *
*
* Arguments: @const char *name@ = name to look up
peer *p_find(const char *name)
{
- peer *p;
- for (p = peers; p; p = p->next) {
- if (strcmp(name, p->spec.name) == 0)
- return (p);
- }
- return (0);
+ peer_byname *pn;
+
+ if ((pn = sym_find(&byname, name, -1, 0, 0)) != 0)
+ return (pn->p);
+ return (0);
}
/* --- @p_destroy@ --- *
kx_free(&p->kx);
if (p->ifname)
xfree(p->ifname);
+ if (p->spec.tag)
+ xfree(p->spec.tag);
p->t->ops->destroy(p->t);
if (p->spec.t_ka)
sel_rmtimer(&p->tka);
- xfree(p->spec.name);
for (pg = p->pings; pg; pg = ppg) {
ppg = pg->next;
p_pingdone(pg, PING_PEERDIED);
}
- if (p->next)
- p->next->prev = p->prev;
- if (p->prev)
- p->prev->next = p->next;
- else
- peers = p->next;
+ sym_remove(&byname, p->byname);
+ am_remove(&byaddr, p->byaddr);
DESTROY(p);
}
-/* --- @p_first@, @p_next@ --- *
+/* --- @p_mkiter@ --- *
*
- * Arguments: @peer *p@ = a peer block
+ * Arguments: @peer_iter *i@ = pointer to an iterator
*
- * Returns: @peer_first@ returns the first peer in some ordering;
- * @peer_next@ returns the peer following a given one in the
- * same ordering. Null is returned for the end of the list.
+ * Returns: ---
+ *
+ * Use: Initializes the iterator.
*/
-peer *p_first(void) { return (peers); }
-peer *p_next(peer *p) { return (p->next); }
+void p_mkiter(peer_iter *i) { sym_mkiter(&i->i, &byname); }
+
+/* --- @p_next@ --- *
+ *
+ * Arguments: @peer_iter *i@ = pointer to an iterator
+ *
+ * Returns: Next peer, or null if at the end.
+ *
+ * Use: Returns the next peer.
+ */
+
+peer *p_next(peer_iter *i)
+{
+ peer_byname *pn;
+
+ if ((pn = sym_next(&i->i)) == 0)
+ return (0);
+ return (pn->p);
+}
/*----- That's all, folks -------------------------------------------------*/
~mdw / tripe / blobdiff