Contiki 3.x
channel.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2007, Swedish Institute of Computer Science.
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  * 1. Redistributions of source code must retain the above copyright
9  * notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  * notice, this list of conditions and the following disclaimer in the
12  * documentation and/or other materials provided with the distribution.
13  * 3. Neither the name of the Institute nor the names of its contributors
14  * may be used to endorse or promote products derived from this software
15  * without specific prior written permission.
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27  * SUCH DAMAGE.
28  *
29  * This file is part of the Contiki operating system.
30  *
31  */
32 
33 /**
34  * \file
35  * Rime's channel abstraction
36  * \author
37  * Adam Dunkels <adam@sics.se>
38  */
39 
40 #include "net/rime/chameleon.h"
41 #include "net/rime/rime.h"
42 #include "lib/list.h"
43 
44 LIST(channel_list);
45 
46 /*---------------------------------------------------------------------------*/
47 void
48 channel_init(void)
49 {
50  list_init(channel_list);
51 }
52 /*---------------------------------------------------------------------------*/
53 void
54 channel_set_attributes(uint16_t channelno,
55  const struct packetbuf_attrlist attrlist[])
56 {
57  struct channel *c;
58  c = channel_lookup(channelno);
59  if(c != NULL) {
60  c->attrlist = attrlist;
61  c->hdrsize = chameleon_hdrsize(attrlist);
62  }
63 }
64 /*---------------------------------------------------------------------------*/
65 void
66 channel_open(struct channel *c, uint16_t channelno)
67 {
68  c->channelno = channelno;
69  list_add(channel_list, c);
70 }
71 /*---------------------------------------------------------------------------*/
72 void
73 channel_close(struct channel *c)
74 {
75  list_remove(channel_list, c);
76 }
77 /*---------------------------------------------------------------------------*/
78 struct channel *
79 channel_lookup(uint16_t channelno)
80 {
81  struct channel *c;
82  for(c = list_head(channel_list); c != NULL; c = list_item_next(c)) {
83  if(c->channelno == channelno) {
84  return c;
85  }
86  }
87  return NULL;
88 }
89 /*---------------------------------------------------------------------------*/
Linked list manipulation routines.
Header file for Chameleon, Rime&#39;s header processing module
void * list_item_next(void *item)
Get the next item following this item.
Definition: list.c:325
#define NULL
The null pointer.
void list_remove(list_t list, void *item)
Remove a specific element from a list.
Definition: list.c:240
Header file for the Rime stack
void list_init(list_t list)
Initialize a list.
Definition: list.c:66
void * list_head(list_t list)
Get a pointer to the first element of a list.
Definition: list.c:83
void list_add(list_t list, void *item)
Add an item at the end of a list.
Definition: list.c:143
#define LIST(name)
Declare a linked list.
Definition: list.h:86