2007-03-31 18:31:27 +00:00
|
|
|
/**
|
|
|
|
* \addtogroup rimemh
|
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
|
2007-03-22 17:33:15 +00:00
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*
|
2007-03-31 18:31:27 +00:00
|
|
|
* $Id: mh.c,v 1.3 2007/03/31 18:31:28 adamdunkels Exp $
|
2007-03-22 17:33:15 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* \file
|
2007-03-31 18:31:27 +00:00
|
|
|
* Multihop forwarding
|
2007-03-22 17:33:15 +00:00
|
|
|
* \author
|
|
|
|
* Adam Dunkels <adam@sics.se>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "contiki.h"
|
|
|
|
#include "net/rime.h"
|
|
|
|
#include "net/rime/mh.h"
|
|
|
|
#include "net/rime/route.h"
|
|
|
|
|
|
|
|
struct data_hdr {
|
|
|
|
rimeaddr_t dest;
|
|
|
|
rimeaddr_t originator;
|
|
|
|
u8_t hops;
|
|
|
|
u8_t pad;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define DEBUG 0
|
|
|
|
#if DEBUG
|
|
|
|
#include <stdio.h>
|
|
|
|
#define PRINTF(...) printf(__VA_ARGS__)
|
|
|
|
#else
|
|
|
|
#define PRINTF(...)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*---------------------------------------------------------------------------*/
|
|
|
|
static void
|
|
|
|
send_data(struct mh_conn *c, rimeaddr_t *to, struct route_entry *next)
|
|
|
|
{
|
|
|
|
struct data_hdr *hdr;
|
|
|
|
|
2007-03-23 10:46:35 +00:00
|
|
|
if(rimebuf_hdralloc(sizeof(struct data_hdr))) {
|
2007-03-22 17:33:15 +00:00
|
|
|
hdr = rimebuf_hdrptr();
|
|
|
|
rimeaddr_copy(&hdr->dest, to);
|
|
|
|
rimeaddr_copy(&hdr->originator, &rimeaddr_node_addr);
|
|
|
|
uc_send(&c->c, &next->nexthop);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/*---------------------------------------------------------------------------*/
|
|
|
|
void
|
|
|
|
data_packet_received(struct uc_conn *uc, rimeaddr_t *from)
|
|
|
|
{
|
|
|
|
struct mh_conn *c = (struct mh_conn *)uc;
|
|
|
|
struct data_hdr *msg = rimebuf_dataptr();
|
|
|
|
struct route_entry *rt;
|
|
|
|
int should_forward;
|
|
|
|
|
|
|
|
PRINTF("data_packet_received from %d towards %d len %d\n", from->u16[0],
|
|
|
|
msg->dest.u16[0],
|
|
|
|
rimebuf_datalen());
|
|
|
|
|
|
|
|
if(rimeaddr_cmp(&msg->dest, &rimeaddr_node_addr)) {
|
|
|
|
PRINTF("for us!\n");
|
|
|
|
rimebuf_hdrreduce(sizeof(struct data_hdr));
|
|
|
|
if(c->cb->recv) {
|
|
|
|
c->cb->recv(c, &msg->originator);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if(c->cb->forwarding) {
|
|
|
|
should_forward = c->cb->forwarding(c);
|
|
|
|
} else {
|
|
|
|
should_forward = 1;
|
|
|
|
}
|
|
|
|
if(should_forward) {
|
|
|
|
rt = route_lookup(&msg->dest);
|
|
|
|
if(rt != NULL) {
|
|
|
|
PRINTF("forwarding to %d\n", rt->nexthop.u16[0]);
|
|
|
|
/* msg->hops++;*/
|
|
|
|
uc_send(&c->c, &rt->nexthop);
|
|
|
|
} else {
|
|
|
|
PRINTF("%d.%d: no route to %d.%d\n",
|
|
|
|
rimeaddr_node_addr.u8[0],
|
|
|
|
rimeaddr_node_addr.u8[1],
|
|
|
|
msg->dest.u8[0],
|
|
|
|
msg->dest.u8[1]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/*---------------------------------------------------------------------------*/
|
|
|
|
static const struct uc_callbacks data_callbacks = { data_packet_received };
|
|
|
|
/*---------------------------------------------------------------------------*/
|
|
|
|
void
|
|
|
|
mh_open(struct mh_conn *c, u16_t channel,
|
|
|
|
const struct mh_callbacks *callbacks)
|
|
|
|
{
|
|
|
|
uc_open(&c->c, channel, &data_callbacks);
|
|
|
|
c->cb = callbacks;
|
|
|
|
}
|
|
|
|
/*---------------------------------------------------------------------------*/
|
|
|
|
void
|
|
|
|
mh_close(struct mh_conn *c)
|
|
|
|
{
|
|
|
|
uc_close(&c->c);
|
|
|
|
}
|
|
|
|
/*---------------------------------------------------------------------------*/
|
|
|
|
int
|
|
|
|
mh_send(struct mh_conn *c, rimeaddr_t *to)
|
|
|
|
{
|
|
|
|
struct route_entry *rt;
|
|
|
|
|
|
|
|
rt = route_lookup(to);
|
|
|
|
if(rt == NULL) {
|
|
|
|
PRINTF("mh_send: no route\n");
|
|
|
|
return 0;
|
|
|
|
} else {
|
|
|
|
PRINTF("mh_send: sending data\n");
|
|
|
|
send_data(c, to, rt);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/*---------------------------------------------------------------------------*/
|
2007-03-31 18:31:27 +00:00
|
|
|
/** @} */
|