/** * \addtogroup rimemesh * @{ */ /* * Copyright (c) 2007, Swedish Institute of Computer Science. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the Institute nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * This file is part of the Contiki operating system. * */ /** * \file * A mesh routing protocol * \author * Adam Dunkels */ #include "contiki.h" #include "net/rime/rime.h" #include "net/rime/route.h" #include "net/rime/mesh.h" #include /* For offsetof */ #define PACKET_TIMEOUT (CLOCK_SECOND * 10) #define DEBUG 0 #if DEBUG #include #define PRINTF(...) printf(__VA_ARGS__) #else #define PRINTF(...) #endif /*---------------------------------------------------------------------------*/ static void data_packet_received(struct multihop_conn *multihop, const linkaddr_t *from, const linkaddr_t *prevhop, uint8_t hops) { struct mesh_conn *c = (struct mesh_conn *) ((char *)multihop - offsetof(struct mesh_conn, multihop)); struct route_entry *rt; /* Refresh the route when we hear a packet from a neighbor. */ rt = route_lookup(from); if(rt != NULL) { route_refresh(rt); } if(c->cb->recv) { c->cb->recv(c, from, hops); } } /*---------------------------------------------------------------------------*/ static linkaddr_t * data_packet_forward(struct multihop_conn *multihop, const linkaddr_t *originator, const linkaddr_t *dest, const linkaddr_t *prevhop, uint8_t hops) { struct route_entry *rt; struct mesh_conn *c = (struct mesh_conn *) ((char *)multihop - offsetof(struct mesh_conn, multihop)); rt = route_lookup(dest); if(rt == NULL) { if(c->queued_data != NULL) { queuebuf_free(c->queued_data); } PRINTF("data_packet_forward: queueing data, sending rreq\n"); c->queued_data = queuebuf_new_from_packetbuf(); linkaddr_copy(&c->queued_data_dest, dest); route_discovery_discover(&c->route_discovery_conn, dest, PACKET_TIMEOUT); return NULL; } else { route_refresh(rt); } return &rt->nexthop; } /*---------------------------------------------------------------------------*/ static void found_route(struct route_discovery_conn *rdc, const linkaddr_t *dest) { struct route_entry *rt; struct mesh_conn *c = (struct mesh_conn *) ((char *)rdc - offsetof(struct mesh_conn, route_discovery_conn)); PRINTF("found_route\n"); if(c->queued_data != NULL && linkaddr_cmp(dest, &c->queued_data_dest)) { queuebuf_to_packetbuf(c->queued_data); queuebuf_free(c->queued_data); c->queued_data = NULL; rt = route_lookup(dest); if(rt != NULL) { multihop_resend(&c->multihop, &rt->nexthop); if(c->cb->sent != NULL) { c->cb->sent(c); } } else { if(c->cb->timedout != NULL) { c->cb->timedout(c); } } } } /*---------------------------------------------------------------------------*/ static void route_timed_out(struct route_discovery_conn *rdc) { struct mesh_conn *c = (struct mesh_conn *) ((char *)rdc - offsetof(struct mesh_conn, route_discovery_conn)); if(c->queued_data != NULL) { queuebuf_free(c->queued_data); c->queued_data = NULL; } if(c->cb->timedout) { c->cb->timedout(c); } } /*---------------------------------------------------------------------------*/ static const struct multihop_callbacks data_callbacks = { data_packet_received, data_packet_forward }; static const struct route_discovery_callbacks route_discovery_callbacks = { found_route, route_timed_out }; /*---------------------------------------------------------------------------*/ void mesh_open(struct mesh_conn *c, uint16_t channels, const struct mesh_callbacks *callbacks) { route_init(); multihop_open(&c->multihop, channels, &data_callbacks); route_discovery_open(&c->route_discovery_conn, CLOCK_SECOND * 2, channels + 1, &route_discovery_callbacks); c->cb = callbacks; } /*---------------------------------------------------------------------------*/ void mesh_close(struct mesh_conn *c) { multihop_close(&c->multihop); route_discovery_close(&c->route_discovery_conn); } /*---------------------------------------------------------------------------*/ int mesh_send(struct mesh_conn *c, const linkaddr_t *to) { int could_send; PRINTF("%d.%d: mesh_send to %d.%d\n", linkaddr_node_addr.u8[0], linkaddr_node_addr.u8[1], to->u8[0], to->u8[1]); could_send = multihop_send(&c->multihop, to); if(!could_send) { PRINTF("mesh_send: could not send\n"); return 0; } if(c->cb->sent != NULL) { c->cb->sent(c); } return 1; } /*---------------------------------------------------------------------------*/ int mesh_ready(struct mesh_conn *c) { return (c->queued_data == NULL); } /** @} */