148 lines
4.7 KiB
C
148 lines
4.7 KiB
C
/**
|
|
* \addtogroup rimemh
|
|
* @{
|
|
*/
|
|
|
|
/*
|
|
* 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.
|
|
*
|
|
* $Id: multihop.c,v 1.5 2009/04/28 14:01:46 adamdunkels Exp $
|
|
*/
|
|
|
|
/**
|
|
* \file
|
|
* Multihop forwarding
|
|
* \author
|
|
* Adam Dunkels <adam@sics.se>
|
|
*/
|
|
|
|
#include "contiki.h"
|
|
#include "net/rime.h"
|
|
#include "net/rime/multihop.h"
|
|
#include "net/rime/route.h"
|
|
|
|
#include <string.h>
|
|
|
|
static const struct packetbuf_attrlist attributes[] =
|
|
{
|
|
MULTIHOP_ATTRIBUTES
|
|
PACKETBUF_ATTR_LAST
|
|
};
|
|
|
|
#define DEBUG 0
|
|
#if DEBUG
|
|
#include <stdio.h>
|
|
#define PRINTF(...) printf(__VA_ARGS__)
|
|
#else
|
|
#define PRINTF(...)
|
|
#endif
|
|
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
data_packet_received(struct unicast_conn *uc, rimeaddr_t *from)
|
|
{
|
|
struct multihop_conn *c = (struct multihop_conn *)uc;
|
|
rimeaddr_t *nexthop;
|
|
|
|
PRINTF("data_packet_received from %d.%d towards %d.%d len %d\n",
|
|
from->u8[0], from->u8[1],
|
|
packetbuf_addr(PACKETBUF_ADDR_ERECEIVER)->u8[0],
|
|
packetbuf_addr(PACKETBUF_ADDR_ERECEIVER)->u8[1],
|
|
packetbuf_datalen());
|
|
|
|
if(rimeaddr_cmp(packetbuf_addr(PACKETBUF_ADDR_ERECEIVER),
|
|
&rimeaddr_node_addr)) {
|
|
PRINTF("for us!\n");
|
|
if(c->cb->recv) {
|
|
c->cb->recv(c, packetbuf_addr(PACKETBUF_ADDR_ESENDER), from,
|
|
packetbuf_attr(PACKETBUF_ATTR_HOPS));
|
|
}
|
|
} else {
|
|
nexthop = NULL;
|
|
if(c->cb->forward) {
|
|
nexthop = c->cb->forward(c,
|
|
packetbuf_addr(PACKETBUF_ADDR_ESENDER),
|
|
packetbuf_addr(PACKETBUF_ADDR_ERECEIVER),
|
|
from, packetbuf_attr(PACKETBUF_ATTR_HOPS));
|
|
|
|
packetbuf_set_attr(PACKETBUF_ATTR_HOPS,
|
|
packetbuf_attr(PACKETBUF_ATTR_HOPS) + 1);
|
|
}
|
|
if(nexthop) {
|
|
PRINTF("forwarding to %d.%d\n", nexthop->u8[0], nexthop->u8[1]);
|
|
unicast_send(&c->c, nexthop);
|
|
}
|
|
}
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
static const struct unicast_callbacks data_callbacks = { data_packet_received };
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
multihop_open(struct multihop_conn *c, uint16_t channel,
|
|
const struct multihop_callbacks *callbacks)
|
|
{
|
|
unicast_open(&c->c, channel, &data_callbacks);
|
|
channel_set_attributes(channel, attributes);
|
|
c->cb = callbacks;
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
multihop_close(struct multihop_conn *c)
|
|
{
|
|
unicast_close(&c->c);
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
int
|
|
multihop_send(struct multihop_conn *c, const rimeaddr_t *to)
|
|
{
|
|
rimeaddr_t *nexthop;
|
|
|
|
if(c->cb->forward == NULL) {
|
|
return 0;
|
|
}
|
|
packetbuf_compact();
|
|
nexthop = c->cb->forward(c, &rimeaddr_node_addr, to, NULL, 0);
|
|
|
|
if(nexthop == NULL) {
|
|
PRINTF("multihop_send: no route\n");
|
|
return 0;
|
|
} else {
|
|
PRINTF("multihop_send: sending data towards %d.%d\n",
|
|
nexthop->u8[0], nexthop->u8[1]);
|
|
packetbuf_set_addr(PACKETBUF_ADDR_ERECEIVER, to);
|
|
packetbuf_set_addr(PACKETBUF_ADDR_ESENDER, &rimeaddr_node_addr);
|
|
packetbuf_set_attr(PACKETBUF_ATTR_HOPS, 1);
|
|
unicast_send(&c->c, nexthop);
|
|
return 1;
|
|
}
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
/** @} */
|