osd-contiki/core/net/rime/ipolite.c

189 lines
5.5 KiB
C
Raw Normal View History

2007-05-15 09:41:36 +02:00
/**
* \addtogroup rimeipolite
* @{
*/
/*
* 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
* Ipolite Anonymous best effort local area BroadCast (ipolite)
* \author
* Adam Dunkels <adam@sics.se>
*/
2013-12-12 20:50:07 +01:00
#include "net/rime/rime.h"
2007-05-15 09:41:36 +02:00
#include "net/rime/ipolite.h"
#include "lib/random.h"
2007-05-15 09:41:36 +02:00
#include <string.h>
#ifndef MAX
#define MAX(a, b) ((a) > (b)? (a) : (b))
#endif /* MAX */
2007-05-15 09:41:36 +02:00
#ifndef MIN
#define MIN(a, b) ((a) < (b)? (a) : (b))
#endif /* MIN */
#define DEBUG 0
#if DEBUG
#include <stdio.h>
#define PRINTF(...) printf(__VA_ARGS__)
#else
#define PRINTF(...)
#endif
2007-05-15 09:41:36 +02:00
/*---------------------------------------------------------------------------*/
static void
recv(struct broadcast_conn *broadcast, const rimeaddr_t *from)
2007-05-15 09:41:36 +02:00
{
struct ipolite_conn *c = (struct ipolite_conn *)broadcast;
2007-05-15 09:41:36 +02:00
if(c->q != NULL &&
packetbuf_datalen() == queuebuf_datalen(c->q) &&
memcmp(packetbuf_dataptr(), queuebuf_dataptr(c->q),
MIN(c->hdrsize, packetbuf_datalen())) == 0) {
/* We received a copy of our own packet, so we increase the
duplicate counter. If it reaches its maximum, do not send out
our packet. */
c->dups++;
if(c->dups == c->maxdups) {
queuebuf_free(c->q);
c->q = NULL;
ctimer_stop(&c->t);
if(c->cb->dropped) {
c->cb->dropped(c);
}
2007-05-15 09:41:36 +02:00
}
}
if(c->cb->recv) {
c->cb->recv(c, from);
}
}
/*---------------------------------------------------------------------------*/
static void
sent(struct broadcast_conn *bc, int status, int num_tx)
{
2007-05-15 09:41:36 +02:00
}
/*---------------------------------------------------------------------------*/
static void
send(void *ptr)
{
struct ipolite_conn *c = ptr;
PRINTF("%d.%d: ipolite: send queuebuf %p\n",
rimeaddr_node_addr.u8[0],rimeaddr_node_addr.u8[1],
c->q);
2007-05-15 09:41:36 +02:00
if(c->q != NULL) {
queuebuf_to_packetbuf(c->q);
2007-05-15 09:41:36 +02:00
queuebuf_free(c->q);
c->q = NULL;
broadcast_send(&c->c);
2007-05-15 09:41:36 +02:00
if(c->cb->sent) {
2008-01-07 15:53:04 +01:00
c->cb->sent(c);
2007-05-15 09:41:36 +02:00
}
}
}
/*---------------------------------------------------------------------------*/
static const struct broadcast_callbacks broadcast = { recv, sent };
2007-05-15 09:41:36 +02:00
/*---------------------------------------------------------------------------*/
void
ipolite_open(struct ipolite_conn *c, uint16_t channel, uint8_t dups,
2007-05-15 09:41:36 +02:00
const struct ipolite_callbacks *cb)
{
broadcast_open(&c->c, channel, &broadcast);
2007-05-15 09:41:36 +02:00
c->cb = cb;
c->maxdups = dups;
PRINTF("ipolite open channel %d\n", channel);
2007-05-15 09:41:36 +02:00
}
/*---------------------------------------------------------------------------*/
void
ipolite_close(struct ipolite_conn *c)
{
broadcast_close(&c->c);
2007-05-15 09:41:36 +02:00
ctimer_stop(&c->t);
if(c->q != NULL) {
queuebuf_free(c->q);
c->q = NULL;
}
}
/*---------------------------------------------------------------------------*/
int
ipolite_send(struct ipolite_conn *c, clock_time_t interval, uint8_t hdrsize)
2007-05-15 09:41:36 +02:00
{
if(c->q != NULL) {
/* If we are already about to send a packet, we cancel the old one. */
PRINTF("%d.%d: ipolite_send: cancel old send\n",
rimeaddr_node_addr.u8[0],rimeaddr_node_addr.u8[1]);
2007-05-15 09:41:36 +02:00
queuebuf_free(c->q);
}
c->dups = 0;
2007-05-15 09:41:36 +02:00
c->hdrsize = hdrsize;
if(interval == 0) {
PRINTF("%d.%d: ipolite_send: interval 0\n",
rimeaddr_node_addr.u8[0],rimeaddr_node_addr.u8[1]);
if(broadcast_send(&c->c)) {
if(c->cb->sent) {
c->cb->sent(c);
}
return 1;
}
} else {
c->q = queuebuf_new_from_packetbuf();
if(c->q != NULL) {
2008-01-07 15:53:04 +01:00
ctimer_set(&c->t,
interval / 2 + (random_rand() % (interval / 2)),
2008-01-07 15:53:04 +01:00
send, c);
return 1;
2008-01-07 15:53:04 +01:00
}
PRINTF("%d.%d: ipolite_send: could not allocate queue buffer\n",
rimeaddr_node_addr.u8[0],rimeaddr_node_addr.u8[1]);
2007-05-15 09:41:36 +02:00
}
return 0;
}
/*---------------------------------------------------------------------------*/
void
ipolite_cancel(struct ipolite_conn *c)
{
ctimer_stop(&c->t);
if(c->q != NULL) {
queuebuf_free(c->q);
c->q = NULL;
}
}
/*---------------------------------------------------------------------------*/
/** @} */