Contiki-Inga 3.x
linkaddr.c
Go to the documentation of this file.
1 /**
2  * \addtogroup linkaddr
3  * @{
4  */
5 
6 /*
7  * Copyright (c) 2007, Swedish Institute of Computer Science.
8  * All rights reserved.
9  *
10  * Redistribution and use in source and binary forms, with or without
11  * modification, are permitted provided that the following conditions
12  * are met:
13  * 1. Redistributions of source code must retain the above copyright
14  * notice, this list of conditions and the following disclaimer.
15  * 2. Redistributions in binary form must reproduce the above copyright
16  * notice, this list of conditions and the following disclaimer in the
17  * documentation and/or other materials provided with the distribution.
18  * 3. Neither the name of the Institute nor the names of its contributors
19  * may be used to endorse or promote products derived from this software
20  * without specific prior written permission.
21  *
22  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25  * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32  * SUCH DAMAGE.
33  *
34  * This file is part of the Contiki operating system.
35  *
36  */
37 
38 /**
39  * \file
40  * Functions for manipulating Rime addresses
41  * \author
42  * Adam Dunkels <adam@sics.se>
43  */
44 
45 #include "net/linkaddr.h"
46 #include <string.h>
47 
48 linkaddr_t linkaddr_node_addr;
49 #if LINKADDR_SIZE == 2
50 const linkaddr_t linkaddr_null = { { 0, 0 } };
51 #else /*LINKADDR_SIZE == 2*/
52 #if LINKADDR_SIZE == 8
53 const linkaddr_t linkaddr_null = { { 0, 0, 0, 0, 0, 0, 0, 0 } };
54 #endif /*LINKADDR_SIZE == 8*/
55 #endif /*LINKADDR_SIZE == 2*/
56 
57 
58 /*---------------------------------------------------------------------------*/
59 void
60 linkaddr_copy(linkaddr_t *dest, const linkaddr_t *src)
61 {
62  memcpy(dest, src, LINKADDR_SIZE);
63 }
64 /*---------------------------------------------------------------------------*/
65 int
66 linkaddr_cmp(const linkaddr_t *addr1, const linkaddr_t *addr2)
67 {
68  return (memcmp(addr1, addr2, LINKADDR_SIZE) == 0);
69 }
70 /*---------------------------------------------------------------------------*/
71 void
72 linkaddr_set_node_addr(linkaddr_t *t)
73 {
75 }
76 /*---------------------------------------------------------------------------*/
77 /** @} */