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>
39 #include "xbee_neighbor.h"
40 #include "xbee_atcmd.h"
41 #include "xbee_stats.h"
43 #include "xbee_proto.h"
46 #include "parse_neighbor.h"
49 parse_neighbor(parse_pgm_token_hdr_t *tk, const char *buf, void *res)
51 struct token_neighbor_data tkd;
53 struct xbee_neigh *neigh;
54 uint8_t token_len = 0;
57 memcpy_P(&tkd, &((struct token_neighbor *)tk)->neighbor_data,
61 while (!isendoftoken(buf[token_len]) &&
62 token_len < (sizeof(bufcopy)-1)) {
63 bufcopy[token_len] = buf[token_len];
66 bufcopy[token_len] = 0;
67 neigh = xbee_neigh_lookup(dev, bufcopy);
68 if (neigh == NULL) /* not found */
71 /* store the address of xbee_neigh in structure */
73 *(struct xbee_neigh **)res = neigh;
79 complete_get_nb_neighbor(parse_pgm_token_hdr_t *tk)
81 struct token_neighbor_data tkd;
83 struct xbee_neigh *neigh;
86 memcpy_P(&tkd, &((struct token_neighbor *)tk)->neighbor_data,
90 LIST_FOREACH(neigh, &dev->neigh_list, next) {
97 complete_get_elt_neighbor(parse_pgm_token_hdr_t *tk, int8_t idx,
98 char *dstbuf, uint8_t size)
100 struct token_neighbor_data tkd;
101 struct xbee_dev *dev;
102 struct xbee_neigh *neigh;
105 memcpy_P(&tkd, &((struct token_neighbor *)tk)->neighbor_data,
109 LIST_FOREACH(neigh, &dev->neigh_list, next) {
117 len = snprintf(dstbuf, size, "%s", neigh->name);
118 if (len < 0 || len >= size)
126 help_neighbor(parse_pgm_token_hdr_t *tk, char *dstbuf,
129 snprintf(dstbuf, size, "Neighbor");
133 struct token_ops token_neighbor_ops = {
134 .parse = parse_neighbor,
135 .complete_get_nb = complete_get_nb_neighbor,
136 .complete_get_elt = complete_get_elt_neighbor,
137 .get_help = help_neighbor,