mirror of
https://github.com/oliverschmidt/contiki.git
synced 2024-09-01 02:29:03 +00:00
architecture for the Rime stack for Contiki. The Chameleon architecture separates the header processing from the Rime protocol logic. Instead of having each protocol create its own part of the packet header, protocols use packet attributes. Before sending a packet, a special Chameleon header processing module creates a packet header from the packet attributes. The same Chameleon module parses incoming packets and creates packet attributes from the header. The details are in our SenSys 2007 paper: Adam Dunkels, Fredrik Osterlind, Zhitao He. An Adaptive Communication Architecture for Wireless Sensor Networks. In Proceedings of the Fifth ACM Conference on Networked Embedded Sensor Systems (SenSys 2007), Sydney, Australia, November 2007. http://www.sics.se/~adam/dunkels07adaptive.pdf This is a rewrite of the code that was developed for the paper.
216 lines
5.9 KiB
C
216 lines
5.9 KiB
C
/**
|
|
* \addtogroup rimequeuebuf
|
|
* @{
|
|
*/
|
|
|
|
/*
|
|
* 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.
|
|
*
|
|
* $Id: queuebuf.c,v 1.12 2008/02/25 02:14:34 adamdunkels Exp $
|
|
*/
|
|
|
|
/**
|
|
* \file
|
|
* Implementation of the Rime queue buffers
|
|
* \author
|
|
* Adam Dunkels <adam@sics.se>
|
|
*/
|
|
|
|
#include "contiki-net.h"
|
|
|
|
#include <string.h> /* for memcpy() */
|
|
|
|
#ifdef QUEUEBUF_CONF_NUM
|
|
#define QUEUEBUF_NUM QUEUEBUF_CONF_NUM
|
|
#else
|
|
#define QUEUEBUF_NUM 4
|
|
#endif
|
|
|
|
#ifdef QUEUEBUF_CONF_REF_NUM
|
|
#define QUEUEBUF_REF_NUM QUEUEBUF_CONF_REF_NUM
|
|
#else
|
|
#define QUEUEBUF_REF_NUM 2
|
|
#endif
|
|
|
|
struct queuebuf {
|
|
uint16_t len;
|
|
uint8_t data[RIMEBUF_SIZE + RIMEBUF_HDR_SIZE];
|
|
struct rimebuf_attr attrs[RIMEBUF_NUM_ATTRS];
|
|
struct rimebuf_addr addrs[RIMEBUF_NUM_ADDRS];
|
|
};
|
|
|
|
struct queuebuf_ref {
|
|
uint16_t len;
|
|
uint8_t *ref;
|
|
uint8_t hdr[RIMEBUF_HDR_SIZE];
|
|
uint8_t hdrlen;
|
|
};
|
|
|
|
MEMB(bufmem, struct queuebuf, QUEUEBUF_NUM);
|
|
MEMB(refbufmem, struct queuebuf_ref, QUEUEBUF_REF_NUM);
|
|
|
|
#define DEBUG 0
|
|
#if DEBUG
|
|
#include <stdio.h>
|
|
#define PRINTF(...) printf(__VA_ARGS__)
|
|
#else
|
|
#define PRINTF(...)
|
|
#endif
|
|
|
|
#define QUEUEBUF_STATS 1
|
|
#if QUEUEBUF_STATS
|
|
uint8_t queuebuf_len, queuebuf_ref_len, queuebuf_max_len;
|
|
#endif /* QUEUEBUF_STATS */
|
|
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
queuebuf_init(void)
|
|
{
|
|
memb_init(&bufmem);
|
|
memb_init(&refbufmem);
|
|
#if QUEUEBUF_STATS
|
|
queuebuf_max_len = QUEUEBUF_NUM;
|
|
#endif /* QUEUEBUF_STATS */
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
struct queuebuf *
|
|
queuebuf_new_from_rimebuf(void)
|
|
{
|
|
struct queuebuf *buf;
|
|
struct queuebuf_ref *rbuf;
|
|
|
|
if(rimebuf_is_reference()) {
|
|
rbuf = memb_alloc(&refbufmem);
|
|
if(rbuf != NULL) {
|
|
#if QUEUEBUF_STATS
|
|
++queuebuf_ref_len;
|
|
#if NETSIM
|
|
/* node_log("%d %d\n",
|
|
queuebuf_len,
|
|
queuebuf_ref_len);*/
|
|
#endif /* NETSIM */
|
|
#endif /* QUEUEBUF_STATS */
|
|
rbuf->len = rimebuf_datalen();
|
|
rbuf->ref = rimebuf_reference_ptr();
|
|
rbuf->hdrlen = rimebuf_copyto_hdr(rbuf->hdr);
|
|
} else {
|
|
PRINTF("queuebuf_new_from_rimebuf: could not allocate a reference queuebuf\n");
|
|
}
|
|
return (struct queuebuf *)rbuf;
|
|
} else {
|
|
buf = memb_alloc(&bufmem);
|
|
if(buf != NULL) {
|
|
#if QUEUEBUF_STATS
|
|
++queuebuf_len;
|
|
if(queuebuf_len == queuebuf_max_len + 1) {
|
|
memb_free(&bufmem, buf);
|
|
queuebuf_len--;
|
|
return NULL;
|
|
}
|
|
#if NETSIM
|
|
/* node_log("%d %d\n",
|
|
queuebuf_len,
|
|
queuebuf_ref_len);*/
|
|
#endif /* NETSIM */
|
|
#endif /* QUEUEBUF_STATS */
|
|
buf->len = rimebuf_copyto(buf->data);
|
|
rimebuf_attr_copyto(buf->attrs, buf->addrs);
|
|
} else {
|
|
PRINTF("queuebuf_new_from_rimebuf: could not allocate a queuebuf\n");
|
|
}
|
|
return buf;
|
|
}
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
queuebuf_free(struct queuebuf *buf)
|
|
{
|
|
if(memb_inmemb(&bufmem, buf)) {
|
|
memb_free(&bufmem, buf);
|
|
#if QUEUEBUF_STATS
|
|
--queuebuf_len;
|
|
#if NETSIM
|
|
/* node_log("%d %d\n",
|
|
queuebuf_len,
|
|
queuebuf_ref_len);*/
|
|
#endif /* NETSIM */
|
|
#endif /* QUEUEBUF_STATS */
|
|
} else if(memb_inmemb(&refbufmem, buf)) {
|
|
memb_free(&refbufmem, buf);
|
|
#if QUEUEBUF_STATS
|
|
--queuebuf_ref_len;
|
|
#if NETSIM
|
|
/* node_log("%d %d\n",
|
|
queuebuf_len,
|
|
queuebuf_ref_len);*/
|
|
#endif /* NETSIM */
|
|
#endif /* QUEUEBUF_STATS */
|
|
}
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
queuebuf_to_rimebuf(struct queuebuf *b)
|
|
{
|
|
struct queuebuf_ref *r;
|
|
|
|
if(memb_inmemb(&bufmem, b)) {
|
|
rimebuf_copyfrom(b->data, b->len);
|
|
rimebuf_attr_copyfrom(b->attrs, b->addrs);
|
|
} else if(memb_inmemb(&refbufmem, b)) {
|
|
r = (struct queuebuf_ref *)b;
|
|
rimebuf_clear();
|
|
rimebuf_copyfrom(r->ref, r->len);
|
|
rimebuf_hdralloc(r->hdrlen);
|
|
memcpy(rimebuf_hdrptr(), r->hdr, r->hdrlen);
|
|
}
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
void *
|
|
queuebuf_dataptr(struct queuebuf *b)
|
|
{
|
|
struct queuebuf_ref *r;
|
|
|
|
if(memb_inmemb(&bufmem, b)) {
|
|
return b->data;
|
|
} else if(memb_inmemb(&refbufmem, b)) {
|
|
r = (struct queuebuf_ref *)b;
|
|
return r->ref;
|
|
}
|
|
return NULL;
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
int
|
|
queuebuf_datalen(struct queuebuf *b)
|
|
{
|
|
return b->len;
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
/** @} */
|