Contiki-NG
rpl-ext-header.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2009, 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  * \addtogroup rpl-lite
34  * @{
35  *
36  * \file
37  * Management of extension headers for ContikiRPL.
38  *
39  * \author Vincent Brillault <vincent.brillault@imag.fr>,
40  * Joakim Eriksson <joakime@sics.se>,
41  * Niclas Finne <nfi@sics.se>,
42  * Nicolas Tsiftes <nvt@sics.se>,
43  * Simon Duquennoy <simon.duquennoy@inria.fr>
44  */
45 
46 #include "net/routing/routing.h"
47 #include "net/routing/rpl-lite/rpl.h"
48 #include "net/ipv6/uip-sr.h"
49 #include "net/packetbuf.h"
50 
51 /* Log configuration */
52 #include "sys/log.h"
53 #define LOG_MODULE "RPL"
54 #define LOG_LEVEL LOG_LEVEL_RPL
55 
56 /*---------------------------------------------------------------------------*/
57 int
59 {
60  struct uip_routing_hdr *rh_header;
61  uip_sr_node_t *dest_node;
62  uip_sr_node_t *root_node;
63 
64  /* Look for routing ext header */
65  rh_header = (struct uip_routing_hdr *)uipbuf_search_header(uip_buf, uip_len, UIP_PROTO_ROUTING);
66 
67  if(!rpl_is_addr_in_our_dag(&UIP_IP_BUF->destipaddr)) {
68  return 0;
69  }
70 
71  root_node = uip_sr_get_node(NULL, &curr_instance.dag.dag_id);
72  dest_node = uip_sr_get_node(NULL, &UIP_IP_BUF->destipaddr);
73 
74  if((rh_header != NULL && rh_header->routing_type == RPL_RH_TYPE_SRH) ||
75  (dest_node != NULL && root_node != NULL &&
76  dest_node->parent == root_node)) {
77  /* Routing header found or the packet destined for a direct child of the root.
78  * The next hop should be already copied as the IPv6 destination
79  * address, via rpl_ext_header_srh_update. We turn this address into a link-local to enable
80  * forwarding to next hop */
81  uip_ipaddr_copy(ipaddr, &UIP_IP_BUF->destipaddr);
82  uip_create_linklocal_prefix(ipaddr);
83  return 1;
84  }
85 
86  LOG_DBG("no SRH found\n");
87  return 0;
88 }
89 /*---------------------------------------------------------------------------*/
90 int
92 {
93  struct uip_routing_hdr *rh_header;
94  struct uip_rpl_srh_hdr *srh_header;
95  uint8_t cmpri, cmpre;
96  uint8_t ext_len;
97  uint8_t padding;
98  uint8_t path_len;
99  uint8_t segments_left;
100  uip_ipaddr_t current_dest_addr;
101 
102  /* Look for routing ext header */
103  rh_header = (struct uip_routing_hdr *)uipbuf_search_header(uip_buf, uip_len, UIP_PROTO_ROUTING);
104 
105  if(rh_header == NULL || rh_header->routing_type != RPL_RH_TYPE_SRH) {
106  LOG_INFO("SRH not found\n");
107  return 0;
108  }
109 
110  /* Parse SRH */
111  srh_header = (struct uip_rpl_srh_hdr *)(((uint8_t *)rh_header) + RPL_RH_LEN);
112  segments_left = rh_header->seg_left;
113  ext_len = rh_header->len * 8 + 8;
114  cmpri = srh_header->cmpr >> 4;
115  cmpre = srh_header->cmpr & 0x0f;
116  padding = srh_header->pad >> 4;
117  path_len = ((ext_len - padding - RPL_RH_LEN - RPL_SRH_LEN - (16 - cmpre)) / (16 - cmpri)) + 1;
118  (void)path_len;
119 
120  LOG_INFO("read SRH, path len %u, segments left %u, Cmpri %u, Cmpre %u, ext len %u (padding %u)\n",
121  path_len, segments_left, cmpri, cmpre, ext_len, padding);
122 
123  /* Update SRH in-place */
124  if(segments_left == 0) {
125  /* We are the final destination, do nothing */
126  } else {
127  uint8_t i = path_len - segments_left; /* The index of the next address to be visited */
128  uint8_t *addr_ptr = ((uint8_t *)rh_header) + RPL_RH_LEN + RPL_SRH_LEN + (i * (16 - cmpri));
129  uint8_t cmpr = segments_left == 1 ? cmpre : cmpri;
130 
131  /* As per RFC6554: swap the IPv6 destination address with address[i] */
132 
133  /* First, copy the current IPv6 destination address */
134  uip_ipaddr_copy(&current_dest_addr, &UIP_IP_BUF->destipaddr);
135  /* Second, update the IPv6 destination address with addresses[i] */
136  memcpy(((uint8_t *)&UIP_IP_BUF->destipaddr) + cmpr, addr_ptr, 16 - cmpr);
137  /* Third, write current_dest_addr to addresses[i] */
138  memcpy(addr_ptr, ((uint8_t *)&current_dest_addr) + cmpr, 16 - cmpr);
139 
140  /* Update segments left field */
141  rh_header->seg_left--;
142 
143  LOG_INFO("SRH next hop ");
144  LOG_INFO_6ADDR(&UIP_IP_BUF->destipaddr);
145  LOG_INFO_("\n");
146  }
147 
148  return 1;
149 }
150 /*---------------------------------------------------------------------------*/
151 /* Utility function for SRH. Counts the number of bytes in common between
152  * two addresses at p1 and p2. */
153 static int
154 count_matching_bytes(const void *p1, const void *p2, size_t n)
155 {
156  int i = 0;
157  for(i = 0; i < n; i++) {
158  if(((uint8_t *)p1)[i] != ((uint8_t *)p2)[i]) {
159  return i;
160  }
161  }
162  return n;
163 }
164 /*---------------------------------------------------------------------------*/
165 /* Used by rpl_ext_header_update to insert a RPL SRH extension header. This
166  * is used at the root, to initiate downward routing. Returns 1 on success,
167  * 0 on failure.
168 */
169 static int
170 insert_srh_header(void)
171 {
172  /* Implementation of RFC6554 */
173  uint8_t path_len;
174  uint8_t ext_len;
175  uint8_t cmpri, cmpre; /* ComprI and ComprE fields of the RPL Source Routing Header */
176  uint8_t *hop_ptr;
177  uint8_t padding;
178  uip_sr_node_t *dest_node;
179  uip_sr_node_t *root_node;
180  uip_sr_node_t *node;
181  uip_ipaddr_t node_addr;
182 
183  /* Always insest SRH as first extension header */
184  struct uip_routing_hdr *rh_hdr = (struct uip_routing_hdr *)UIP_IP_PAYLOAD(0);
185  struct uip_rpl_srh_hdr *srh_hdr = (struct uip_rpl_srh_hdr *)(UIP_IP_PAYLOAD(0) + RPL_RH_LEN);
186 
187  LOG_INFO("SRH creating source routing header with destination ");
188  LOG_INFO_6ADDR(&UIP_IP_BUF->destipaddr);
189  LOG_INFO_(" \n");
190 
191  /* Construct source route. We do not do this recursively to keep the runtime stack usage constant. */
192 
193  /* Get link of the destination and root */
194 
195  if(!rpl_is_addr_in_our_dag(&UIP_IP_BUF->destipaddr)) {
196  /* The destination is not in our DAG, skip SRH insertion */
197  LOG_INFO("SRH destination not in our DAG, skip SRH insertion\n");
198  return 1;
199  }
200 
201  dest_node = uip_sr_get_node(NULL, &UIP_IP_BUF->destipaddr);
202  if(dest_node == NULL) {
203  /* The destination is not found, skip SRH insertion */
204  LOG_INFO("SRH node not found, skip SRH insertion\n");
205  return 1;
206  }
207 
208  root_node = uip_sr_get_node(NULL, &curr_instance.dag.dag_id);
209  if(root_node == NULL) {
210  LOG_ERR("SRH root node not found\n");
211  return 0;
212  }
213 
214  if(!uip_sr_is_addr_reachable(NULL, &UIP_IP_BUF->destipaddr)) {
215  LOG_ERR("SRH no path found to destination\n");
216  return 0;
217  }
218 
219  /* Compute path length and compression factors (we use cmpri == cmpre) */
220  path_len = 0;
221  node = dest_node->parent;
222  /* For simplicity, we use cmpri = cmpre */
223  cmpri = 15;
224  cmpre = 15;
225 
226  /* Note that in case of a direct child (node == root_node), we insert
227  SRH anyway, as RFC 6553 mandates that routed datagrams must include
228  SRH or the RPL option (or both) */
229 
230  while(node != NULL && node != root_node) {
231 
232  NETSTACK_ROUTING.get_sr_node_ipaddr(&node_addr, node);
233 
234  /* How many bytes in common between all nodes in the path? */
235  cmpri = MIN(cmpri, count_matching_bytes(&node_addr, &UIP_IP_BUF->destipaddr, 16));
236  cmpre = cmpri;
237 
238  LOG_INFO("SRH Hop ");
239  LOG_INFO_6ADDR(&node_addr);
240  LOG_INFO_("\n");
241  node = node->parent;
242  path_len++;
243  }
244 
245  /* Extension header length: fixed headers + (n-1) * (16-ComprI) + (16-ComprE)*/
246  ext_len = RPL_RH_LEN + RPL_SRH_LEN
247  + (path_len - 1) * (16 - cmpre)
248  + (16 - cmpri);
249 
250  padding = ext_len % 8 == 0 ? 0 : (8 - (ext_len % 8));
251  ext_len += padding;
252 
253  LOG_INFO("SRH path len: %u, ComprI %u, ComprE %u, ext len %u (padding %u)\n",
254  path_len, cmpri, cmpre, ext_len, padding);
255 
256  /* Check if there is enough space to store the extension header */
257  if(uip_len + ext_len > UIP_LINK_MTU) {
258  LOG_ERR("packet too long: impossible to add source routing header (%u bytes)\n", ext_len);
259  return 0;
260  }
261 
262  /* Move existing ext headers and payload ext_len further */
263  memmove(uip_buf + UIP_IPH_LEN + uip_ext_len + ext_len,
264  uip_buf + UIP_IPH_LEN + uip_ext_len, uip_len - UIP_IPH_LEN);
265  memset(uip_buf + UIP_IPH_LEN + uip_ext_len, 0, ext_len);
266 
267  /* Insert source routing header (as first ext header) */
268  rh_hdr->next = UIP_IP_BUF->proto;
269  UIP_IP_BUF->proto = UIP_PROTO_ROUTING;
270 
271  /* Initialize IPv6 Routing Header */
272  rh_hdr->len = (ext_len - 8) / 8;
273  rh_hdr->routing_type = RPL_RH_TYPE_SRH;
274  rh_hdr->seg_left = path_len;
275 
276  /* Initialize RPL Source Routing Header */
277  srh_hdr->cmpr = (cmpri << 4) + cmpre;
278  srh_hdr->pad = padding << 4;
279 
280  /* Initialize addresses field (the actual source route).
281  * From last to first. */
282  node = dest_node;
283  hop_ptr = ((uint8_t *)rh_hdr) + ext_len - padding; /* Pointer where to write the next hop compressed address */
284 
285  while(node != NULL && node->parent != root_node) {
286  NETSTACK_ROUTING.get_sr_node_ipaddr(&node_addr, node);
287 
288  hop_ptr -= (16 - cmpri);
289  memcpy(hop_ptr, ((uint8_t*)&node_addr) + cmpri, 16 - cmpri);
290 
291  node = node->parent;
292  }
293 
294  /* The next hop (i.e. node whose parent is the root) is placed as the current IPv6 destination */
295  NETSTACK_ROUTING.get_sr_node_ipaddr(&node_addr, node);
296  uip_ipaddr_copy(&UIP_IP_BUF->destipaddr, &node_addr);
297 
298  /* Update the IPv6 length field */
299  uipbuf_add_ext_hdr(ext_len);
300  uipbuf_set_len_field(UIP_IP_BUF, uip_len - UIP_IPH_LEN);
301 
302  return 1;
303 }
304 /*---------------------------------------------------------------------------*/
305 int
306 rpl_ext_header_hbh_update(uint8_t *ext_buf, int opt_offset)
307 {
308  int down;
309  int rank_error_signaled;
310  int loop_detected;
311  uint16_t sender_rank;
312  uint8_t sender_closer;
313  rpl_nbr_t *sender;
314  struct uip_hbho_hdr *hbh_hdr = (struct uip_hbho_hdr *)ext_buf;
315  struct uip_ext_hdr_opt_rpl *rpl_opt = (struct uip_ext_hdr_opt_rpl *)(ext_buf + opt_offset);
316 
317  if(hbh_hdr->len != ((RPL_HOP_BY_HOP_LEN - 8) / 8)
318  || rpl_opt->opt_type != UIP_EXT_HDR_OPT_RPL
319  || rpl_opt->opt_len != RPL_HDR_OPT_LEN) {
320  LOG_ERR("hop-by-hop extension header has wrong size or type (%u %u %u)\n",
321  hbh_hdr->len, rpl_opt->opt_type, rpl_opt->opt_len);
322  return 0; /* Drop */
323  }
324 
325  if(!curr_instance.used || curr_instance.instance_id != rpl_opt->instance) {
326  LOG_ERR("unknown instance: %u\n", rpl_opt->instance);
327  return 0; /* Drop */
328  }
329 
330  if(rpl_opt->flags & RPL_HDR_OPT_FWD_ERR) {
331  LOG_ERR("forward error!\n");
332  return 0; /* Drop */
333  }
334 
335  down = (rpl_opt->flags & RPL_HDR_OPT_DOWN) ? 1 : 0;
336  sender_rank = UIP_HTONS(rpl_opt->senderrank);
337  sender = nbr_table_get_from_lladdr(rpl_neighbors, packetbuf_addr(PACKETBUF_ADDR_SENDER));
338  rank_error_signaled = (rpl_opt->flags & RPL_HDR_OPT_RANK_ERR) ? 1 : 0;
339  sender_closer = sender_rank < curr_instance.dag.rank;
340  loop_detected = (down && !sender_closer) || (!down && sender_closer);
341 
342  LOG_INFO("ext hdr: packet from ");
343  LOG_INFO_6ADDR(&UIP_IP_BUF->srcipaddr);
344  LOG_INFO_(" to ");
345  LOG_INFO_6ADDR(&UIP_IP_BUF->destipaddr);
346  LOG_INFO_(" going %s, sender closer %d (%d < %d), rank error %u, loop detected %u\n",
347  down == 1 ? "down" : "up", sender_closer, sender_rank,
348  curr_instance.dag.rank, rank_error_signaled, loop_detected);
349 
350  if(loop_detected) {
351  /* Set forward error flag */
352  rpl_opt->flags |= RPL_HDR_OPT_RANK_ERR;
353  }
354 
355  return rpl_process_hbh(sender, sender_rank, loop_detected, rank_error_signaled);
356 }
357 /*---------------------------------------------------------------------------*/
358 /* In-place update of the RPL HBH extension header, when already present
359  * in the uIP packet. Used by insert_hbh_header and rpl_ext_header_update.
360  * Returns 1 on success, 0 on failure. */
361 static int
362 update_hbh_header(void)
363 {
364  struct uip_hbho_hdr *hbh_hdr = (struct uip_hbho_hdr *)UIP_IP_PAYLOAD(0);
365  struct uip_ext_hdr_opt_rpl *rpl_opt = (struct uip_ext_hdr_opt_rpl *)(UIP_IP_PAYLOAD(2));
366 
367  if(UIP_IP_BUF->proto == UIP_PROTO_HBHO && rpl_opt->opt_type == UIP_EXT_HDR_OPT_RPL) {
368  if(hbh_hdr->len != ((RPL_HOP_BY_HOP_LEN - 8) / 8)
369  || rpl_opt->opt_len != RPL_HDR_OPT_LEN) {
370 
371  LOG_ERR("hop-by-hop extension header has wrong size (%u)\n", rpl_opt->opt_len);
372  return 0; /* Drop */
373  }
374 
375  if(!curr_instance.used || curr_instance.instance_id != rpl_opt->instance) {
376  LOG_ERR("unable to add/update hop-by-hop extension header: incorrect instance\n");
377  return 0; /* Drop */
378  }
379 
380  /* Update sender rank and instance, will update flags next */
381  rpl_opt->senderrank = UIP_HTONS(curr_instance.dag.rank);
382  rpl_opt->instance = curr_instance.instance_id;
383  }
384 
385  return 1;
386 }
387 /*---------------------------------------------------------------------------*/
388 /* Used by rpl_ext_header_update on packets without an HBH extension header,
389  * for packets initated by non-root nodes.
390  * Inserts and initalizes (via update_hbh_header) a RPL HBH ext header.
391  * Returns 1 on success, 0 on failure. */
392 static int
393 insert_hbh_header(void)
394 {
395  struct uip_hbho_hdr *hbh_hdr = (struct uip_hbho_hdr *)UIP_IP_PAYLOAD(0);
396  struct uip_ext_hdr_opt_rpl *rpl_opt = (struct uip_ext_hdr_opt_rpl *)(UIP_IP_PAYLOAD(2));
397 
398  /* Insert hop-by-hop header */
399  LOG_INFO("creating hop-by-hop option\n");
400  if(uip_len + RPL_HOP_BY_HOP_LEN > UIP_LINK_MTU) {
401  LOG_ERR("packet too long: impossible to add hop-by-hop option\n");
402  return 0;
403  }
404 
405  /* Move existing ext headers and payload RPL_HOP_BY_HOP_LEN further */
406  memmove(UIP_IP_PAYLOAD(RPL_HOP_BY_HOP_LEN), UIP_IP_PAYLOAD(0), uip_len - UIP_IPH_LEN);
407  memset(UIP_IP_PAYLOAD(0), 0, RPL_HOP_BY_HOP_LEN);
408 
409  /* Insert HBH header (as first ext header) */
410  hbh_hdr->next = UIP_IP_BUF->proto;
411  UIP_IP_BUF->proto = UIP_PROTO_HBHO;
412 
413  /* Initialize HBH option */
414  hbh_hdr->len = (RPL_HOP_BY_HOP_LEN - 8) / 8;
415  rpl_opt->opt_type = UIP_EXT_HDR_OPT_RPL;
416  rpl_opt->opt_len = RPL_HDR_OPT_LEN;
417  rpl_opt->flags = 0;
418  rpl_opt->senderrank = UIP_HTONS(curr_instance.dag.rank);
419  rpl_opt->instance = curr_instance.instance_id;
420 
421  uipbuf_add_ext_hdr(RPL_HOP_BY_HOP_LEN);
422  uipbuf_set_len_field(UIP_IP_BUF, uip_len - UIP_IPH_LEN);
423 
424  /* Update header before returning */
425  return update_hbh_header();
426 }
427 /*---------------------------------------------------------------------------*/
428 int
430 {
431  if(!curr_instance.used
432  || uip_is_addr_linklocal(&UIP_IP_BUF->destipaddr)
433  || uip_is_addr_mcast(&UIP_IP_BUF->destipaddr)) {
434  return 1;
435  }
436 
437  if(rpl_dag_root_is_root()) {
438  /* At the root, remove headers if any, and insert SRH or HBH
439  * (SRH is inserted only if the destination is down the DODAG) */
441  /* Insert SRH (if needed) */
442  return insert_srh_header();
443  } else {
444  if(uip_ds6_is_my_addr(&UIP_IP_BUF->srcipaddr)
445  && UIP_IP_BUF->ttl == uip_ds6_if.cur_hop_limit) {
446  /* Insert HBH option at source. Checking the address is not sufficient because
447  * in non-storing mode, a packet may go up and then down the same path again */
448  return insert_hbh_header();
449  } else {
450  /* Update HBH option at forwarders */
451  return update_hbh_header();
452  }
453  }
454 }
455 /*---------------------------------------------------------------------------*/
456 bool
458 {
459  uint8_t *prev_proto_ptr;
460  uint8_t protocol;
461  uint16_t ext_len;
462  uint8_t *next_header;
463  struct uip_ext_hdr *ext_ptr;
464  struct uip_ext_hdr_opt *opt_ptr;
465 
466  next_header = uipbuf_get_next_header(uip_buf, uip_len, &protocol, true);
467  if(next_header == NULL) {
468  return true;
469  }
470  ext_ptr = (struct uip_ext_hdr *)next_header;
471  prev_proto_ptr = &UIP_IP_BUF->proto;
472 
473  while(uip_is_proto_ext_hdr(protocol)) {
474  opt_ptr = (struct uip_ext_hdr_opt *)(next_header + 2);
475  if(protocol == UIP_PROTO_ROUTING ||
476  (protocol == UIP_PROTO_HBHO && opt_ptr->type == UIP_EXT_HDR_OPT_RPL)) {
477  /* Remove ext header */
478  *prev_proto_ptr = ext_ptr->next;
479  ext_len = ext_ptr->len * 8 + 8;
480  if(uipbuf_add_ext_hdr(-ext_len) == false) {
481  return false;
482  }
483 
484  /* Update length field and move rest of packet to the "left" */
485  uipbuf_set_len_field(UIP_IP_BUF, uip_len - UIP_IPH_LEN);
486  if(uip_len <= next_header - uip_buf) {
487  /* No more data to move. */
488  return false;
489  }
490  memmove(next_header, next_header + ext_len,
491  uip_len - (next_header - uip_buf));
492 
493  /* Update loop variables */
494  protocol = *prev_proto_ptr;
495  } else {
496  /* move to the ext hdr */
497  next_header = uipbuf_get_next_header(next_header,
498  uip_len - (next_header - uip_buf),
499  &protocol, false);
500  if(next_header == NULL) {
501  /* Processing finished. */
502  break;
503  }
504  ext_ptr = (struct uip_ext_hdr *)next_header;
505  prev_proto_ptr = &ext_ptr->next;
506  }
507  }
508 
509  return true;
510 }
511 /** @}*/
static uip_ipaddr_t ipaddr
Pointer to prefix information option in uip_buf.
Definition: uip-nd6.c:116
#define UIP_IP_BUF
Direct access to IPv6 header.
Definition: uip.h:71
uint16_t uip_len
The length of the packet in the uip_buf buffer.
Definition: uip6.c:159
#define UIP_PROTO_HBHO
extension headers types
Definition: uip.h:1764
int rpl_is_addr_in_our_dag(const uip_ipaddr_t *addr)
Tells whether a given global IPv6 address is in our current DAG.
Definition: rpl-dag.c:158
int rpl_ext_header_srh_get_next_hop(uip_ipaddr_t *ipaddr)
Look for next hop from SRH of current uIP packet.
int rpl_ext_header_update(void)
Adds/updates all RPL extension headers to current uIP packet.
#define UIP_LINK_MTU
The maximum transmission unit at the IP Layer.
Definition: uipopt.h:228
int rpl_dag_root_is_root(void)
Tells whether we are DAG root or not.
Definition: rpl-dag-root.c:152
int rpl_ext_header_hbh_update(uint8_t *ext_buf, int opt_offset)
Process and update the RPL hop-by-hop extension headers of the current uIP packet.
Source routing support.
uint16_t uip_ext_len
The length of the extension headers.
Definition: uip6.c:122
Routing driver header file
#define uip_buf
Macro to access uip_aligned_buf as an array of bytes.
Definition: uip.h:510
All information related to a RPL neighbor.
Definition: rpl-types.h:136
#define uip_ipaddr_copy(dest, src)
Copy an IP address from one place to another.
Definition: uip.h:1015
uip_sr_node_t * uip_sr_get_node(void *graph, const uip_ipaddr_t *addr)
Looks up for a source routing node from its IPv6 global address.
Definition: uip-sr.c:81
#define uip_is_addr_mcast(a)
is address a multicast address, see RFC 4291 a is of type uip_ipaddr_t*
Definition: uip.h:1961
bool rpl_ext_header_remove(void)
Removes all RPL extension headers.
#define UIP_HTONS(n)
Convert 16-bit quantity from host byte order to network byte order.
Definition: uip.h:1223
uip_ds6_netif_t uip_ds6_if
The single interface.
Definition: uip-ds6.c:75
int rpl_process_hbh(rpl_nbr_t *sender, uint16_t sender_rank, int loop_detected, int rank_error_signaled)
Processes Hop-by-Hop (HBH) Extension Header of a packet currently being forwrded. ...
Definition: rpl-dag.c:674
int(* get_sr_node_ipaddr)(uip_ipaddr_t *addr, const uip_sr_node_t *node)
Returns the global IPv6 address of a source routing node.
Definition: routing.h:97
Header file for the Packet buffer (packetbuf) management
#define uip_is_addr_linklocal(a)
is addr (a) a link local unicast address, see RFC 4291 i.e.
Definition: uip.h:1877
Header file for the logging system
int uip_sr_is_addr_reachable(void *graph, const uip_ipaddr_t *addr)
Telle whether an address is reachable, i.e.
Definition: uip-sr.c:94
A node in a source routing graph, stored at the root and representing all child-parent relationship...
Definition: uip-sr.h:92
int rpl_ext_header_srh_update(void)
Process and update SRH in-place, i.e.