/*-
* Copyright (c) 2008 Iain Hibbert
* 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.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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 is simple routing. I'm not sure if its allowed by
* the PAN or BNEP specifications, but it seems logical
* to send unicast packets to connected destinations where
* possible.
*/
if (!ETHER_IS_MULTICAST(pkt->dst)) {
LIST_FOREACH(chan, &channel_list, next) {
if (chan == pkt->chan
|| chan->state != CHANNEL_OPEN)
continue;
if (memcmp(pkt->dst, chan->raddr, ETHER_ADDR_LEN) == 0) {
if (chan->qlen > CHANNEL_MAXQLEN)
log_notice("Queue overflow");
else
channel_put(chan, pkt);
if (!chan->oactive)
channel_start(chan->fd, EV_WRITE, chan);
}
/*
* Simple watchdog timer, only ticks when it is required and
* closes the channel down if it times out.
*/
void
channel_timeout(channel_t *chan, int to)
{
static struct event ev;