contiki/core/net/rime/runicast.c

251 lines
8.4 KiB
C
Raw Normal View History

/*
* Copyright (c) 2006, 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
* Reliable unicast
* \author
* Adam Dunkels <adam@sics.se>
*/
/**
* \addtogroup rimerunicast
* @{
*/
#include "net/rime/runicast.h"
2013-12-12 19:50:07 +00:00
#include "net/rime/rime.h"
#include <string.h>
#ifdef RUNICAST_CONF_REXMIT_TIME
#define REXMIT_TIME RUNICAST_CONF_REXMIT_TIME
#else /* RUNICAST_CONF_REXMIT_TIME */
#define REXMIT_TIME CLOCK_SECOND
#endif /* RUNICAST_CONF_REXMIT_TIME */
static const struct packetbuf_attrlist attributes[] =
{
RUNICAST_ATTRIBUTES
PACKETBUF_ATTR_LAST
};
#define DEBUG 0
2007-03-29 23:18:22 +00:00
#if DEBUG
#include <stdio.h>
#define PRINTF(...) printf(__VA_ARGS__)
#else
#define PRINTF(...)
#endif
/*---------------------------------------------------------------------------*/
static void
sent_by_stunicast(struct stunicast_conn *stunicast, int status, int num_tx)
{
struct runicast_conn *c = (struct runicast_conn *)stunicast;
PRINTF("runicast: sent_by_stunicast c->rxmit %d num_tx %d\n",
c->rxmit, num_tx);
/* Only process data packets, not ACKs. */
if(packetbuf_attr(PACKETBUF_ATTR_PACKET_TYPE) == PACKETBUF_ATTR_PACKET_TYPE_DATA) {
2010-03-19 13:20:40 +00:00
c->rxmit += 1;
if(c->rxmit != 0) {
RIMESTATS_ADD(rexmit);
2010-03-19 13:20:40 +00:00
PRINTF("%d.%d: runicast: sent_by_stunicast packet %u (%u) resent %u\n",
linkaddr_node_addr.u8[0], linkaddr_node_addr.u8[1],
2010-03-19 13:20:40 +00:00
packetbuf_attr(PACKETBUF_ATTR_PACKET_ID),
c->sndnxt, c->rxmit);
}
if(c->rxmit >= c->max_rxmit) {
RIMESTATS_ADD(timedout);
c->is_tx = 0;
stunicast_cancel(&c->c);
if(c->u->timedout) {
c->u->timedout(c, stunicast_receiver(&c->c), c->rxmit);
}
c->rxmit = 0;
PRINTF("%d.%d: runicast: packet %d timed out\n",
linkaddr_node_addr.u8[0],linkaddr_node_addr.u8[1],
c->sndnxt);
c->sndnxt = (c->sndnxt + 1) % (1 << RUNICAST_PACKET_ID_BITS);
} else {
// int shift;
// shift = c->rxmit > 4? 4: c->rxmit;
// stunicast_set_timer(&c->c, (REXMIT_TIME) << shift);
}
}
}
/*---------------------------------------------------------------------------*/
static void
recv_from_stunicast(struct stunicast_conn *stunicast, const linkaddr_t *from)
{
struct runicast_conn *c = (struct runicast_conn *)stunicast;
/* struct runicast_hdr *hdr = packetbuf_dataptr();*/
PRINTF("%d.%d: runicast: recv_from_stunicast from %d.%d type %d seqno %d\n",
linkaddr_node_addr.u8[0],linkaddr_node_addr.u8[1],
from->u8[0], from->u8[1],
packetbuf_attr(PACKETBUF_ATTR_PACKET_TYPE),
packetbuf_attr(PACKETBUF_ATTR_PACKET_ID));
if(packetbuf_attr(PACKETBUF_ATTR_PACKET_TYPE) ==
PACKETBUF_ATTR_PACKET_TYPE_ACK) {
2009-04-06 21:19:34 +00:00
PRINTF("%d.%d: runicast: got ACK from %d.%d, seqno %d (%d)\n",
linkaddr_node_addr.u8[0], linkaddr_node_addr.u8[1],
2009-04-06 21:19:34 +00:00
from->u8[0], from->u8[1],
packetbuf_attr(PACKETBUF_ATTR_PACKET_ID),
c->sndnxt);
if(packetbuf_attr(PACKETBUF_ATTR_PACKET_ID) == c->sndnxt) {
RIMESTATS_ADD(ackrx);
PRINTF("%d.%d: runicast: ACKed %d\n",
linkaddr_node_addr.u8[0], linkaddr_node_addr.u8[1],
packetbuf_attr(PACKETBUF_ATTR_PACKET_ID));
c->sndnxt = (c->sndnxt + 1) % (1 << RUNICAST_PACKET_ID_BITS);
c->is_tx = 0;
stunicast_cancel(&c->c);
if(c->u->sent != NULL) {
c->u->sent(c, stunicast_receiver(&c->c), c->rxmit);
}
} else {
PRINTF("%d.%d: runicast: received bad ACK %d for %d\n",
linkaddr_node_addr.u8[0],linkaddr_node_addr.u8[1],
packetbuf_attr(PACKETBUF_ATTR_PACKET_ID),
c->sndnxt);
RIMESTATS_ADD(badackrx);
}
} else if(packetbuf_attr(PACKETBUF_ATTR_PACKET_TYPE) ==
PACKETBUF_ATTR_PACKET_TYPE_DATA) {
/* int send_ack = 1;*/
uint16_t packet_seqno;
struct queuebuf *q;
RIMESTATS_ADD(reliablerx);
PRINTF("%d.%d: runicast: got packet %d\n",
linkaddr_node_addr.u8[0],linkaddr_node_addr.u8[1],
packetbuf_attr(PACKETBUF_ATTR_PACKET_ID));
packet_seqno = packetbuf_attr(PACKETBUF_ATTR_PACKET_ID);
/* packetbuf_hdrreduce(sizeof(struct runicast_hdr));*/
q = queuebuf_new_from_packetbuf();
if(q != NULL) {
PRINTF("%d.%d: runicast: Sending ACK to %d.%d for %d\n",
linkaddr_node_addr.u8[0],linkaddr_node_addr.u8[1],
from->u8[0], from->u8[1],
packet_seqno);
packetbuf_clear();
/* packetbuf_hdralloc(sizeof(struct runicast_hdr));
hdr = packetbuf_hdrptr();
hdr->type = TYPE_ACK;
hdr->seqno = packet_seqno;*/
packetbuf_set_attr(PACKETBUF_ATTR_PACKET_TYPE, PACKETBUF_ATTR_PACKET_TYPE_ACK);
packetbuf_set_attr(PACKETBUF_ATTR_PACKET_ID, packet_seqno);
stunicast_send(&c->c, from);
RIMESTATS_ADD(acktx);
queuebuf_to_packetbuf(q);
queuebuf_free(q);
2009-04-06 21:19:34 +00:00
} else {
PRINTF("%d.%d: runicast: could not send ACK to %d.%d for %d: no queued buffers\n",
linkaddr_node_addr.u8[0],linkaddr_node_addr.u8[1],
2009-04-06 21:19:34 +00:00
from->u8[0], from->u8[1],
packet_seqno);
}
if(c->u->recv != NULL) {
c->u->recv(c, from, packet_seqno);
}
}
}
/*---------------------------------------------------------------------------*/
static const struct stunicast_callbacks runicast = {recv_from_stunicast,
sent_by_stunicast};
/*---------------------------------------------------------------------------*/
void
runicast_open(struct runicast_conn *c, uint16_t channel,
const struct runicast_callbacks *u)
{
stunicast_open(&c->c, channel, &runicast);
channel_set_attributes(channel, attributes);
c->u = u;
c->is_tx = 0;
c->rxmit = 0;
c->sndnxt = 0;
}
/*---------------------------------------------------------------------------*/
void
runicast_close(struct runicast_conn *c)
{
stunicast_close(&c->c);
}
/*---------------------------------------------------------------------------*/
uint8_t
runicast_is_transmitting(struct runicast_conn *c)
{
return c->is_tx;
}
/*---------------------------------------------------------------------------*/
int
runicast_send(struct runicast_conn *c, const linkaddr_t *receiver,
uint8_t max_retransmissions)
{
2009-12-18 14:49:42 +00:00
int ret;
if(runicast_is_transmitting(c)) {
PRINTF("%d.%d: runicast: already transmitting\n",
linkaddr_node_addr.u8[0],linkaddr_node_addr.u8[1]);
return 0;
}
packetbuf_set_attr(PACKETBUF_ATTR_RELIABLE, 1);
packetbuf_set_attr(PACKETBUF_ATTR_PACKET_TYPE, PACKETBUF_ATTR_PACKET_TYPE_DATA);
packetbuf_set_attr(PACKETBUF_ATTR_PACKET_ID, c->sndnxt);
packetbuf_set_attr(PACKETBUF_ATTR_MAX_MAC_TRANSMISSIONS, 3);
c->max_rxmit = max_retransmissions;
c->rxmit = 0;
c->is_tx = 1;
RIMESTATS_ADD(reliabletx);
PRINTF("%d.%d: runicast: sending packet %d\n",
linkaddr_node_addr.u8[0],linkaddr_node_addr.u8[1],
c->sndnxt);
2009-12-18 14:49:42 +00:00
ret = stunicast_send_stubborn(&c->c, receiver, REXMIT_TIME);
if(!ret) {
c->is_tx = 0;
}
return ret;
}
/*---------------------------------------------------------------------------*/
2007-12-16 14:33:32 +00:00
/** @} */