2 * Copyright (c) 2011, Olivier MATZ <zer0@droids-corp.org>
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are met:
7 * * Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * * Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 * * Neither the name of the University of California, Berkeley nor the
13 * names of its contributors may be used to endorse or promote products
14 * derived from this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
17 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
18 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19 * DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
20 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 #include <aversive/queue.h>
30 #include <aversive/pgmspace.h>
37 #include "xbee_neighbor.h"
38 #include "xbee_atcmd.h"
39 #include "xbee_stats.h"
41 #include "xbee_proto.h"
44 void xbee_neigh_init(struct xbee_dev *dev)
46 LIST_INIT(&dev->neigh_list);
49 struct xbee_neigh *xbee_neigh_lookup(struct xbee_dev *dev, const char *name)
51 struct xbee_neigh *neigh;
53 LIST_FOREACH(neigh, &dev->neigh_list, next) {
54 if (!strcmp(name, neigh->name))
61 struct xbee_neigh *xbee_neigh_rlookup(struct xbee_dev *dev, uint64_t addr)
63 struct xbee_neigh *neigh;
65 LIST_FOREACH(neigh, &dev->neigh_list, next) {
66 if (addr == neigh->addr)
73 struct xbee_neigh *xbee_neigh_add(struct xbee_dev *dev, const char *name,
76 struct xbee_neigh *neigh;
78 if (xbee_neigh_rlookup(dev, addr) != NULL)
81 if (xbee_neigh_lookup(dev, name) != NULL)
84 neigh = malloc(sizeof(*neigh));
89 snprintf_P(neigh->name, sizeof(neigh->name), PSTR("%s"), name);
90 LIST_INSERT_HEAD(&dev->neigh_list, neigh, next);
95 void xbee_neigh_del(struct xbee_dev *dev, struct xbee_neigh *neigh)
97 dev = dev; /* silent compiler */
98 LIST_REMOVE(neigh, next);