forked from contiki-ng/contiki-ng
-
Notifications
You must be signed in to change notification settings - Fork 0
/
rpl-dag.c
2335 lines (2164 loc) · 83.2 KB
/
rpl-dag.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (c) 2010, Swedish Institute of Computer Science.
* Copyright (c) 2021, Ghent University.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* This file is part of the Contiki operating system.
*
*/
/**
* \file
* Logic for Directed Acyclic Graphs in RPL.
*
* \author Joakim Eriksson <joakime@sics.se>, Nicolas Tsiftes <nvt@sics.se>, Robbe Elsas <robbe.elsas@ugent.be>
* Contributors: George Oikonomou <oikonomou@users.sourceforge.net> (multicast)
*/
/**
* \addtogroup uip
* @{
*/
#include "contiki.h"
#include "net/link-stats.h"
#include "net/routing/rpl-classic/rpl.h"
#include "net/routing/rpl-classic/rpl-private.h"
#include "net/routing/rpl-classic/rpl-dag-root.h"
#include "net/ipv6/uip.h"
#include "net/ipv6/uip-nd6.h"
#include "net/ipv6/uip-ds6-nbr.h"
#include "net/nbr-table.h"
#include "net/ipv6/multicast/uip-mcast6.h"
#include "lib/list.h"
#include "lib/memb.h"
#include "sys/ctimer.h"
#include "sys/log.h"
#include "dev/radio.h"
#include <limits.h>
#include <string.h>
#define LOG_MODULE "RPL"
#define LOG_LEVEL LOG_LEVEL_RPL
/* A configurable function called after every RPL parent switch */
#ifdef RPL_CALLBACK_PARENT_SWITCH
void RPL_CALLBACK_PARENT_SWITCH(rpl_parent_t *old, rpl_parent_t *new);
#endif /* RPL_CALLBACK_PARENT_SWITCH */
/*---------------------------------------------------------------------------*/
extern rpl_of_t rpl_of0, rpl_mrhof, rpl_poof, rpl_driplof;
static rpl_of_t *const objective_functions[] = RPL_SUPPORTED_OFS;
/*---------------------------------------------------------------------------*/
/* RPL definitions. */
#ifndef RPL_CONF_GROUNDED
#define RPL_GROUNDED 0
#else
#define RPL_GROUNDED RPL_CONF_GROUNDED
#endif /* !RPL_CONF_GROUNDED */
/*---------------------------------------------------------------------------*/
/* Per-parent RPL information */
NBR_TABLE_GLOBAL(rpl_parent_t, rpl_parents);
/*---------------------------------------------------------------------------*/
/* Allocate instance table. */
rpl_instance_t instance_table[RPL_MAX_INSTANCES];
rpl_instance_t *default_instance;
/*---------------------------------------------------------------------------*/
/* Pointer to the instance we are currently poisoning if any, NULL otherwise */
rpl_instance_t *poisoning_instance;
/*---------------------------------------------------------------------------*/
uint16_t
rpl_get_num_eligible_parents(rpl_dag_t *dag)
{
uint16_t count = 0;
rpl_parent_t *p = nbr_table_head(rpl_parents);
while(p != NULL) {
if(!(p->flags & RPL_PARENT_FLAG_NOT_ELIGIBLE) && p->dag == dag) {
count++;
}
p = nbr_table_next(rpl_parents, p);
}
return count;
}
/*---------------------------------------------------------------------------*/
void
rpl_print_neighbor_list(void)
{
if(default_instance != NULL && default_instance->current_dag != NULL &&
default_instance->of != NULL) {
int curr_dio_interval = default_instance->dio_intcurrent;
int curr_rank = default_instance->current_dag->rank;
rpl_parent_t *p = nbr_table_head(rpl_parents);
clock_time_t clock_now = clock_time();
LOG_DBG("RPL: MOP %u OCP %u rank %u dioint %u, nbr count %u\n",
default_instance->mop, default_instance->of->ocp, curr_rank, curr_dio_interval, uip_ds6_nbr_num());
while(p != NULL) {
const struct link_stats *stats = rpl_get_parent_link_stats(p);
uip_ipaddr_t *parent_addr = rpl_parent_get_ipaddr(p);
LOG_DBG("RPL: nbr ");
LOG_DBG_6ADDR(parent_addr);
LOG_DBG_(" %5u, %5u => %5u -- %c%c%c",
p->rank,
rpl_get_parent_link_metric(p),
rpl_rank_via_parent(p),
rpl_parent_is_fresh(p) ? 'f' : (rpl_parent_is_stale(p) ? 's' : 'u'),
!(p->flags & RPL_PARENT_FLAG_NOT_ELIGIBLE) && p->dag == default_instance->current_dag ? 'e' : ' ',
p == default_instance->current_dag->preferred_parent ? 'p' : ' '
);
if(stats != NULL) {
struct interface_list_entry *ile;
ile = list_head(stats->interface_list);
while(ile != NULL) {
LOG_DBG_(" (ID: %u, fcnt: %2u, ltx: %u)", ile->if_id, ile->freshness, (unsigned)((clock_now - ile->last_tx_time) / CLOCK_SECOND));
ile = list_item_next(ile);
}
}
LOG_DBG_("\n");
p = nbr_table_next(rpl_parents, p);
}
LOG_DBG("RPL: end of list\n");
}
}
/*---------------------------------------------------------------------------*/
uip_ds6_nbr_t *
rpl_get_nbr(rpl_parent_t *parent)
{
const linkaddr_t *lladdr = rpl_get_parent_lladdr(parent);
if(lladdr != NULL) {
return uip_ds6_nbr_ll_lookup((const uip_lladdr_t *)lladdr);
} else {
return NULL;
}
}
/*---------------------------------------------------------------------------*/
static void
nbr_callback(void *ptr)
{
rpl_remove_parent(ptr);
}
/*---------------------------------------------------------------------------*/
void
rpl_dag_init(void)
{
nbr_table_register(rpl_parents, (nbr_table_callback *)nbr_callback);
}
/*---------------------------------------------------------------------------*/
rpl_parent_t *
rpl_get_parent(const uip_lladdr_t *addr)
{
rpl_parent_t *p = nbr_table_get_from_lladdr(rpl_parents, (const linkaddr_t *)addr);
return p;
}
/*---------------------------------------------------------------------------*/
rpl_rank_t
rpl_get_parent_rank(uip_lladdr_t *addr)
{
rpl_parent_t *p = nbr_table_get_from_lladdr(rpl_parents, (linkaddr_t *)addr);
if(p != NULL) {
return p->rank;
} else {
return RPL_INFINITE_RANK;
}
}
/*---------------------------------------------------------------------------*/
uint16_t
rpl_get_parent_link_metric(rpl_parent_t *p)
{
if(p != NULL && p->dag != NULL) {
rpl_instance_t *instance = p->dag->instance;
if(instance != NULL && instance->of != NULL && instance->of->parent_link_metric != NULL) {
return instance->of->parent_link_metric(p);
}
}
return 0xffff;
}
/*---------------------------------------------------------------------------*/
rpl_rank_t
rpl_rank_via_parent(rpl_parent_t *p)
{
if(p != NULL && p->dag != NULL) {
rpl_instance_t *instance = p->dag->instance;
if(instance != NULL && instance->of != NULL && instance->of->rank_via_parent != NULL) {
return instance->of->rank_via_parent(p);
}
}
return RPL_INFINITE_RANK;
}
/*---------------------------------------------------------------------------*/
/* Retrieve the rank to be advertised in DIO messages for the given DAG. The
value of blame is set to the linkaddr of the parent responsible for the
returned rank (if blame != NULL). */
rpl_rank_t
rpl_rank_via_dag(rpl_dag_t *dag, linkaddr_t *blame)
{
if(dag != NULL) {
rpl_instance_t *instance = dag->instance;
if(instance != NULL && instance->of != NULL) {
if(instance->of->rank_via_dag != NULL) {
return instance->of->rank_via_dag(dag, blame);
} else if(instance->of->rank_via_parent != NULL && dag->preferred_parent != NULL) {
if(blame != NULL) {
*blame = *rpl_get_parent_lladdr(dag->preferred_parent);
}
return instance->of->rank_via_parent(dag->preferred_parent);
}
}
}
return RPL_INFINITE_RANK;
}
/*---------------------------------------------------------------------------*/
const linkaddr_t *
rpl_get_parent_lladdr(rpl_parent_t *p)
{
return nbr_table_get_lladdr(rpl_parents, p);
}
/*---------------------------------------------------------------------------*/
uip_ipaddr_t *
rpl_parent_get_ipaddr(rpl_parent_t *p)
{
const linkaddr_t *lladdr = rpl_get_parent_lladdr(p);
if(lladdr == NULL) {
return NULL;
}
return uip_ds6_nbr_ipaddr_from_lladdr((uip_lladdr_t *)lladdr);
}
/*---------------------------------------------------------------------------*/
const struct link_stats *
rpl_get_parent_link_stats(rpl_parent_t *p)
{
const linkaddr_t *lladdr = rpl_get_parent_lladdr(p);
return link_stats_from_lladdr(lladdr);
}
/*---------------------------------------------------------------------------*/
/* True if all of p's interfaces have fresh statistics, false otherwise. */
int
rpl_parent_is_fresh(rpl_parent_t *p)
{
const struct link_stats *stats = rpl_get_parent_link_stats(p);
if(stats == NULL) {
return 0;
}
struct interface_list_entry *ile;
ile = list_head(stats->interface_list);
while(ile != NULL) {
if(!link_stats_interface_is_fresh(ile)) {
return 0;
}
ile = list_item_next(ile);
}
return 1;
}
/*---------------------------------------------------------------------------*/
/* True if none of p's interfaces has fresh statistics, false otherwise. */
int
rpl_parent_is_stale(rpl_parent_t *p)
{
const struct link_stats *stats = rpl_get_parent_link_stats(p);
if(stats == NULL) {
return 1;
}
struct interface_list_entry *ile;
ile = list_head(stats->interface_list);
while(ile != NULL) {
if(link_stats_interface_is_fresh(ile)) {
return 0;
}
ile = list_item_next(ile);
}
return 1;
}
/*---------------------------------------------------------------------------*/
int
rpl_parent_is_reachable(rpl_parent_t *p)
{
if(p == NULL || p->dag == NULL || p->dag->instance == NULL || p->dag->instance->of == NULL) {
return 0;
} else {
#if UIP_ND6_SEND_NS
/* Exclude links to a neighbor that is not reachable at a NUD level */
if(rpl_get_nbr(p) == NULL) {
return 0;
}
#endif /* UIP_ND6_SEND_NS */
/* If we don't have fresh link information, assume the parent is reachable. */
return rpl_parent_is_stale(p) || p->dag->instance->of->parent_has_usable_link(p);
}
}
/*---------------------------------------------------------------------------*/
/* Reset all defer flags of all parents */
void
rpl_reset_defer_flags(void)
{
rpl_parent_t *p;
p = nbr_table_head(rpl_parents);
while(p != NULL) {
const linkaddr_t *lladdr = rpl_get_parent_lladdr(p);
if(lladdr != NULL) {
LOG_DBG("Resetting all defer flags for parent ");
LOG_DBG_LLADDR(lladdr);
LOG_DBG_("\n");
link_stats_reset_defer_flags(lladdr);
}
p = nbr_table_next(rpl_parents, p);
}
}
/*---------------------------------------------------------------------------*/
/* Execute the normalized metric update logic for all parents in the rpl_parents
global neighbor table. Note that the defer flags are only checked if a parent
is the preferred parent of the current dag of the default instance. For all other
parents, metric normalization is performed regardless of its defer flags. One
can also pass a flag that indicates whether or not the defer flags of each parent
should be reset or not. */
/* TODO make this work with multiple instances */
void
rpl_exec_norm_metric_logic(rpl_reset_defer_t reset_defer)
{
rpl_parent_t *p;
p = nbr_table_head(rpl_parents);
if(p != NULL) {
LOG_DBG("Executing normalized metric logic");
LOG_DBG_("%s\n", (reset_defer ? " + defer flag reset" : ""));
}
while(p != NULL) {
const linkaddr_t *lladdr = rpl_get_parent_lladdr(p);
if(lladdr != NULL && p->dag != NULL) {
LOG_DBG("nbr ");
LOG_DBG_6ADDR(rpl_parent_get_ipaddr(p));
LOG_DBG_(" (%5u, %5u -- %c%c",
p->rank,
rpl_get_parent_link_metric(p),
rpl_parent_is_fresh(p) ? 'f' : (rpl_parent_is_stale(p) ? 's' : 'u'),
p->flags & RPL_PARENT_FLAG_NOT_ELIGIBLE ? ' ' : 'e');
if(p == p->dag->preferred_parent) {
LOG_DBG_("p) DAG ");
LOG_DBG_6ADDR(&p->dag->dag_id);
LOG_DBG_("\n");
if(!link_stats_is_defer_required(lladdr)) {
link_stats_update_norm_metric(lladdr);
} else {
LOG_DBG("Deferring normalized metric update\n");
}
} else {
LOG_DBG_(" ) DAG ");
LOG_DBG_6ADDR(&p->dag->dag_id);
LOG_DBG_("\n");
link_stats_update_norm_metric(lladdr);
}
if(reset_defer) {
link_stats_reset_defer_flags(lladdr);
}
}
p = nbr_table_next(rpl_parents, p);
}
}
/*---------------------------------------------------------------------------*/
static void
rpl_set_preferred_parent(rpl_dag_t *dag, rpl_parent_t *p)
{
if(dag != NULL && dag->preferred_parent != p && (p == NULL || !(p->flags & RPL_PARENT_FLAG_NOT_ELIGIBLE))) {
#if TWOFACED_WITH_COOJA == 1
LOG_PRINT("rpl_set_preferred_parent ");
if(p != NULL) {
LOG_PRINT_6ADDR(rpl_parent_get_ipaddr(p));
} else {
LOG_PRINT_("NULL");
}
LOG_PRINT_(" used to be ");
if(dag->preferred_parent != NULL) {
LOG_PRINT_6ADDR(rpl_parent_get_ipaddr(dag->preferred_parent));
} else {
LOG_PRINT_("NULL");
}
LOG_PRINT_("\n");
#else
LOG_INFO("rpl_set_preferred_parent ");
if(p != NULL) {
LOG_INFO_6ADDR(rpl_parent_get_ipaddr(p));
} else {
LOG_INFO_("NULL");
}
LOG_INFO_(" used to be ");
if(dag->preferred_parent != NULL) {
LOG_INFO_6ADDR(rpl_parent_get_ipaddr(dag->preferred_parent));
} else {
LOG_INFO_("NULL");
}
LOG_INFO_("\n");
#endif
#ifdef RPL_CALLBACK_PARENT_SWITCH
RPL_CALLBACK_PARENT_SWITCH(dag->preferred_parent, p);
#endif /* RPL_CALLBACK_PARENT_SWITCH */
/* Always keep the preferred parent locked, so it remains in the
* neighbor table. */
nbr_table_unlock(rpl_parents, dag->preferred_parent);
nbr_table_lock(rpl_parents, p);
dag->preferred_parent = p;
} else if(p != NULL && (p->flags & RPL_PARENT_FLAG_NOT_ELIGIBLE)) {
LOG_INFO("rpl_set_preferred_parent ");
LOG_INFO_6ADDR(rpl_parent_get_ipaddr(p));
LOG_INFO_(" not eligible\n");
}
}
/*---------------------------------------------------------------------------*/
/* Greater-than function for the lollipop counter. */
/*---------------------------------------------------------------------------*/
static int
lollipop_greater_than(int a, int b)
{
/* Check if we are comparing an initial value with an old value */
if(a > RPL_LOLLIPOP_CIRCULAR_REGION && b <= RPL_LOLLIPOP_CIRCULAR_REGION) {
return (RPL_LOLLIPOP_MAX_VALUE + 1 + b - a) > RPL_LOLLIPOP_SEQUENCE_WINDOWS;
}
/* Otherwise check if a > b and comparable => ok, or
if they have wrapped and are still comparable */
return (a > b && (a - b) < RPL_LOLLIPOP_SEQUENCE_WINDOWS) ||
(a < b && (b - a) > (RPL_LOLLIPOP_CIRCULAR_REGION + 1 -
RPL_LOLLIPOP_SEQUENCE_WINDOWS));
}
/*---------------------------------------------------------------------------*/
/* Remove DAG parents with a rank that is at least the same as minimum_rank. */
static void
remove_parents(rpl_dag_t *dag, rpl_rank_t minimum_rank)
{
rpl_parent_t *p;
LOG_INFO("Removing parents (minimum rank %u)\n", minimum_rank);
p = nbr_table_head(rpl_parents);
while(p != NULL) {
if(dag == p->dag && p->rank >= minimum_rank) {
rpl_remove_parent(p);
}
p = nbr_table_next(rpl_parents, p);
}
}
/*---------------------------------------------------------------------------*/
static void
nullify_parents(rpl_dag_t *dag, rpl_rank_t minimum_rank)
{
rpl_parent_t *p;
LOG_INFO("Nullifying parents (minimum rank %u)\n", minimum_rank);
p = nbr_table_head(rpl_parents);
while(p != NULL) {
if(dag == p->dag && p->rank >= minimum_rank) {
rpl_nullify_parent(p);
}
p = nbr_table_next(rpl_parents, p);
}
}
/*---------------------------------------------------------------------------*/
static int
should_refresh_routes(rpl_instance_t *instance, rpl_dio_t *dio, rpl_parent_t *p)
{
/* if MOP is set to no downward routes no DAO should be sent */
if(instance->mop == RPL_MOP_NO_DOWNWARD_ROUTES) {
return 0;
}
/* check if the new DTSN is more recent */
return p == instance->current_dag->preferred_parent &&
(lollipop_greater_than(dio->dtsn, p->dtsn));
}
/*---------------------------------------------------------------------------*/
int
rpl_acceptable_rank(rpl_dag_t *dag, rpl_rank_t rank)
{
/* See RFC6550 Section 6.7.6. */
/* See RFC6550 Section 8.2.2.4. */
return rank != RPL_INFINITE_RANK &&
((dag->instance->max_rankinc == 0) ||
DAG_RANK(rank, dag->instance) <= DAG_RANK(dag->min_rank + dag->instance->max_rankinc, dag->instance));
}
/*---------------------------------------------------------------------------*/
int
rpl_parent_is_acceptable(rpl_parent_t *p)
{
if(p == NULL || p->dag == NULL || p->dag->instance == NULL || p->dag->instance->of == NULL) {
return 0;
}
return p->dag->instance->of->parent_is_acceptable(p);
}
/*---------------------------------------------------------------------------*/
static rpl_dag_t *
get_dag(uint8_t instance_id, uip_ipaddr_t *dag_id)
{
rpl_instance_t *instance;
rpl_dag_t *dag;
int i;
instance = rpl_get_instance(instance_id);
if(instance == NULL) {
return NULL;
}
for(i = 0; i < RPL_MAX_DAG_PER_INSTANCE; ++i) {
dag = &instance->dag_table[i];
if(dag->used && uip_ipaddr_cmp(&dag->dag_id, dag_id)) {
return dag;
}
}
return NULL;
}
/*---------------------------------------------------------------------------*/
rpl_dag_t *
rpl_set_root(uint8_t instance_id, uip_ipaddr_t *dag_id)
{
rpl_dag_t *dag;
rpl_instance_t *instance;
uint8_t version;
int i;
version = RPL_LOLLIPOP_INIT;
instance = rpl_get_instance(instance_id);
if(instance != NULL) {
for(i = 0; i < RPL_MAX_DAG_PER_INSTANCE; ++i) {
dag = &instance->dag_table[i];
if(dag->used) {
if(uip_ipaddr_cmp(&dag->dag_id, dag_id)) {
version = dag->version;
RPL_LOLLIPOP_INCREMENT(version);
} else {
if(dag == dag->instance->current_dag) {
LOG_INFO("Dropping a joined DAG when setting this node as root\n");
rpl_set_default_route(instance, NULL);
dag->instance->current_dag = NULL;
} else {
LOG_INFO("Dropping a DAG when setting this node as root\n");
}
rpl_free_dag(dag);
}
}
}
}
dag = rpl_alloc_dag(instance_id, dag_id);
if(dag == NULL) {
LOG_ERR("Failed to allocate a DAG\n");
return NULL;
}
instance = dag->instance;
dag->version = version;
dag->joined = 1;
dag->grounded = RPL_GROUNDED;
dag->preference = RPL_PREFERENCE;
instance->mop = RPL_MOP_DEFAULT;
instance->of = rpl_find_of(RPL_OF_OCP);
if(instance->of == NULL) {
LOG_WARN("OF with OCP %u not supported\n", RPL_OF_OCP);
return NULL;
}
rpl_set_preferred_parent(dag, NULL);
memcpy(&dag->dag_id, dag_id, sizeof(dag->dag_id));
instance->dio_intdoubl = RPL_DIO_INTERVAL_DOUBLINGS;
instance->dio_intmin = RPL_DIO_INTERVAL_MIN;
/* The current interval must differ from the minimum interval in order to
trigger a DIO timer reset. */
instance->dio_intcurrent = RPL_DIO_INTERVAL_MIN +
RPL_DIO_INTERVAL_DOUBLINGS;
instance->dio_redundancy = RPL_DIO_REDUNDANCY;
instance->max_rankinc = RPL_MAX_RANKINC;
instance->min_hoprankinc = RPL_MIN_HOPRANKINC;
instance->default_lifetime = RPL_DEFAULT_LIFETIME;
instance->lifetime_unit = RPL_DEFAULT_LIFETIME_UNIT;
dag->rank = ROOT_RANK(instance);
if(instance->current_dag != dag && instance->current_dag != NULL) {
/* Remove routes installed by DAOs. */
if(RPL_IS_STORING(instance)) {
rpl_remove_routes(instance->current_dag);
}
instance->current_dag->joined = 0;
}
instance->current_dag = dag;
instance->dtsn_out = RPL_LOLLIPOP_INIT;
instance->of->update_metric_container(instance);
default_instance = instance;
#if TWOFACED_WITH_COOJA == 1
LOG_PRINT("Node set to be a DAG root with DAG ID ");
LOG_PRINT_6ADDR(&dag->dag_id);
LOG_PRINT_("\n");
#else
LOG_INFO("Node set to be a DAG root with DAG ID ");
LOG_INFO_6ADDR(&dag->dag_id);
LOG_INFO_("\n");
#endif
LOG_ANNOTATE("#A root=%u\n", dag->dag_id.u8[sizeof(dag->dag_id) - 1]);
rpl_reset_dio_timer(instance);
/* Sets some timer that, upon expiring, checks whether or not it would be a good
idea to perform a global repair by incrementing the DODAG version (and does so
it this is deemed necessary). */
rpl_reset_dag_version_increment_timer(instance);
return dag;
}
/*---------------------------------------------------------------------------*/
int
rpl_repair_root(uint8_t instance_id)
{
rpl_instance_t *instance;
instance = rpl_get_instance(instance_id);
if(instance == NULL ||
instance->current_dag->rank != ROOT_RANK(instance)) {
LOG_WARN("rpl_repair_root triggered but not root\n");
return 0;
}
RPL_STAT(rpl_stats.root_repairs++);
RPL_LOLLIPOP_INCREMENT(instance->current_dag->version);
RPL_LOLLIPOP_INCREMENT(instance->dtsn_out);
LOG_INFO("rpl_repair_root initiating global repair with version %d\n", instance->current_dag->version);
rpl_reset_dio_timer(instance);
return 1;
}
/*---------------------------------------------------------------------------*/
static void
set_ip_from_prefix(uip_ipaddr_t *ipaddr, rpl_prefix_t *prefix)
{
memset(ipaddr, 0, sizeof(uip_ipaddr_t));
memcpy(ipaddr, &prefix->prefix, (prefix->length + 7) / 8);
uip_ds6_set_addr_iid(ipaddr, &uip_lladdr);
}
/*---------------------------------------------------------------------------*/
static void
check_prefix(rpl_prefix_t *last_prefix, rpl_prefix_t *new_prefix)
{
uip_ipaddr_t ipaddr;
uip_ds6_addr_t *rep;
if(last_prefix != NULL && new_prefix != NULL &&
last_prefix->length == new_prefix->length &&
uip_ipaddr_prefixcmp(&last_prefix->prefix, &new_prefix->prefix, new_prefix->length) &&
last_prefix->flags == new_prefix->flags) {
/* Nothing has changed. */
return;
}
if(last_prefix != NULL) {
set_ip_from_prefix(&ipaddr, last_prefix);
rep = uip_ds6_addr_lookup(&ipaddr);
if(rep != NULL) {
LOG_DBG("removing global IP address ");
LOG_DBG_6ADDR(&ipaddr);
LOG_DBG_("\n");
uip_ds6_addr_rm(rep);
}
}
if(new_prefix != NULL) {
set_ip_from_prefix(&ipaddr, new_prefix);
if(uip_ds6_addr_lookup(&ipaddr) == NULL) {
LOG_DBG("adding global IP address ");
LOG_DBG_6ADDR(&ipaddr);
LOG_DBG_("\n");
uip_ds6_addr_add(&ipaddr, 0, ADDR_AUTOCONF);
}
}
}
/*---------------------------------------------------------------------------*/
int
rpl_set_prefix(rpl_dag_t *dag, uip_ipaddr_t *prefix, unsigned len)
{
rpl_prefix_t last_prefix;
uint8_t last_len = dag->prefix_info.length;
if(len > 128) {
return 0;
}
if(dag->prefix_info.length != 0) {
memcpy(&last_prefix, &dag->prefix_info, sizeof(rpl_prefix_t));
}
memset(&dag->prefix_info.prefix, 0, sizeof(dag->prefix_info.prefix));
memcpy(&dag->prefix_info.prefix, prefix, (len + 7) / 8);
dag->prefix_info.length = len;
dag->prefix_info.flags = UIP_ND6_RA_FLAG_AUTONOMOUS;
LOG_INFO("Prefix set - will announce this in DIOs\n");
if(dag->rank != ROOT_RANK(dag->instance)) {
/* Autoconfigure an address if this node does not already have an address
with this prefix. Otherwise, update the prefix */
if(last_len == 0) {
LOG_INFO("rpl_set_prefix - prefix NULL\n");
check_prefix(NULL, &dag->prefix_info);
} else {
LOG_INFO("rpl_set_prefix - prefix NON-NULL\n");
check_prefix(&last_prefix, &dag->prefix_info);
}
}
return 1;
}
/*---------------------------------------------------------------------------*/
int
rpl_set_default_route(rpl_instance_t *instance, uip_ipaddr_t *from)
{
if(instance->def_route != NULL) {
LOG_DBG("Removing default route through ");
LOG_DBG_6ADDR(&instance->def_route->ipaddr);
LOG_DBG_("\n");
uip_ds6_defrt_rm(instance->def_route);
instance->def_route = NULL;
}
if(from != NULL) {
LOG_DBG("Adding default route through ");
LOG_DBG_6ADDR(from);
LOG_DBG_("\n");
instance->def_route = uip_ds6_defrt_add(from,
RPL_DEFAULT_ROUTE_INFINITE_LIFETIME ? 0 : RPL_LIFETIME(instance, instance->default_lifetime));
if(instance->def_route == NULL) {
return 0;
}
}
return 1;
}
/*---------------------------------------------------------------------------*/
rpl_instance_t *
rpl_alloc_instance(uint8_t instance_id)
{
rpl_instance_t *instance, *end;
for(instance = &instance_table[0], end = instance + RPL_MAX_INSTANCES;
instance < end; ++instance) {
if(instance->used == 0) {
memset(instance, 0, sizeof(*instance));
instance->instance_id = instance_id;
instance->def_route = NULL;
instance->used = 1;
#if RPL_WITH_PROBING
rpl_schedule_probing(instance);
#endif /* RPL_WITH_PROBING */
return instance;
}
}
return NULL;
}
/*---------------------------------------------------------------------------*/
rpl_dag_t *
rpl_alloc_dag(uint8_t instance_id, uip_ipaddr_t *dag_id)
{
rpl_dag_t *dag, *end;
rpl_instance_t *instance;
instance = rpl_get_instance(instance_id);
if(instance == NULL) {
instance = rpl_alloc_instance(instance_id);
if(instance == NULL) {
RPL_STAT(rpl_stats.mem_overflows++);
return NULL;
}
}
for(dag = &instance->dag_table[0], end = dag + RPL_MAX_DAG_PER_INSTANCE; dag < end; ++dag) {
if(!dag->used) {
memset(dag, 0, sizeof(*dag));
dag->used = 1;
dag->rank = RPL_INFINITE_RANK;
dag->min_rank = RPL_INFINITE_RANK;
dag->instance = instance;
return dag;
}
}
RPL_STAT(rpl_stats.mem_overflows++);
return NULL;
}
/*---------------------------------------------------------------------------*/
void
rpl_set_default_instance(rpl_instance_t *instance)
{
default_instance = instance;
}
/*---------------------------------------------------------------------------*/
rpl_instance_t *
rpl_get_default_instance(void)
{
return default_instance;
}
/*---------------------------------------------------------------------------*/
void
rpl_free_instance(rpl_instance_t *instance)
{
rpl_dag_t *dag;
rpl_dag_t *end;
LOG_INFO("Leaving the instance %u\n", instance->instance_id);
/* Remove any DAG inside this instance */
for(dag = &instance->dag_table[0], end = dag + RPL_MAX_DAG_PER_INSTANCE; dag < end; ++dag) {
if(dag->used) {
rpl_free_dag(dag);
}
}
rpl_set_default_route(instance, NULL);
#if RPL_WITH_PROBING
ctimer_stop(&instance->probing_timer);
#endif /* RPL_WITH_PROBING */
ctimer_stop(&instance->dio_timer);
ctimer_stop(&instance->dao_timer);
ctimer_stop(&instance->dao_lifetime_timer);
if(default_instance == instance) {
default_instance = NULL;
}
instance->used = 0;
}
/*---------------------------------------------------------------------------*/
void
rpl_free_dag(rpl_dag_t *dag)
{
if(dag->joined) {
LOG_INFO("Leaving the DAG ");
LOG_INFO_6ADDR(&dag->dag_id);
LOG_INFO_("\n");
dag->joined = 0;
/* Remove routes installed by DAOs. */
if(RPL_IS_STORING(dag->instance)) {
rpl_remove_routes(dag);
}
/* Stop the DAO retransmit timer */
#if RPL_WITH_DAO_ACK
ctimer_stop(&dag->instance->dao_retransmit_timer);
#endif /* RPL_WITH_DAO_ACK */
/* Remove autoconfigured address */
if((dag->prefix_info.flags & UIP_ND6_RA_FLAG_AUTONOMOUS)) {
check_prefix(&dag->prefix_info, NULL);
}
remove_parents(dag, 0);
}
dag->used = 0;
}
/*---------------------------------------------------------------------------*/
rpl_parent_t *
rpl_add_parent(rpl_dag_t *dag, rpl_dio_t *dio, uip_ipaddr_t *addr)
{
rpl_parent_t *p = NULL;
/* Is the parent known by ds6? Drop this request if not.
* Typically, the parent is added upon receiving a DIO. */
const uip_lladdr_t *lladdr = uip_ds6_nbr_lladdr_from_ipaddr(addr);
LOG_DBG("rpl_add_parent lladdr %p ", lladdr);
LOG_DBG_6ADDR(addr);
LOG_DBG_("\n");
if(lladdr != NULL) {
/* Add parent in rpl_parents - again this is due to DIO */
p = nbr_table_add_lladdr(rpl_parents, (linkaddr_t *)lladdr,
NBR_TABLE_REASON_RPL_DIO, dio);
if(p == NULL) {
LOG_DBG("rpl_add_parent p NULL\n");
} else {
p->dag = dag;
p->rank = dio->rank;
p->dtsn = dio->dtsn;
#if RPL_WITH_MC
memcpy(&p->mc, &dio->mc, sizeof(p->mc));
#endif /* RPL_WITH_MC */
link_stats_reset_defer_flags((const linkaddr_t *)lladdr);
link_stats_update_norm_metric((const linkaddr_t *)lladdr);
}
}
return p;
}
/*---------------------------------------------------------------------------*/
static rpl_parent_t *
find_parent_any_dag_any_instance(uip_ipaddr_t *addr)
{
uip_ds6_nbr_t *ds6_nbr = uip_ds6_nbr_lookup(addr);
const uip_lladdr_t *lladdr = uip_ds6_nbr_get_ll(ds6_nbr);
return nbr_table_get_from_lladdr(rpl_parents, (linkaddr_t *)lladdr);
}
/*---------------------------------------------------------------------------*/
rpl_parent_t *
rpl_find_parent(rpl_dag_t *dag, uip_ipaddr_t *addr)
{
rpl_parent_t *p = find_parent_any_dag_any_instance(addr);
if(p != NULL && p->dag == dag) {
return p;
} else {
return NULL;
}
}
/*---------------------------------------------------------------------------*/
static rpl_dag_t *
find_parent_dag(rpl_instance_t *instance, uip_ipaddr_t *addr)
{
rpl_parent_t *p = find_parent_any_dag_any_instance(addr);
if(p != NULL) {
return p->dag;
} else {
return NULL;
}
}
/*---------------------------------------------------------------------------*/
rpl_parent_t *
rpl_find_parent_any_dag(rpl_instance_t *instance, uip_ipaddr_t *addr)
{
rpl_parent_t *p = find_parent_any_dag_any_instance(addr);
if(p && p->dag && p->dag->instance == instance) {
return p;
} else {
return NULL;
}
}
/*---------------------------------------------------------------------------*/
rpl_dag_t *
rpl_select_dag(rpl_instance_t *instance, rpl_parent_t *p)
{
rpl_parent_t *last_parent, *modified_parent;
rpl_dag_t *dag, *end, *best_dag;
rpl_rank_t old_rank;
linkaddr_t blame;
modified_parent = p;
old_rank = instance->current_dag->rank;
last_parent = instance->current_dag->preferred_parent;
parent_and_dag_selection:
if(instance->current_dag->rank != ROOT_RANK(instance)) {
/* Select a new preferred parent. This causes the rank to be recomputed
for all parents before comparing said computed ranks and choosing the
best candidate as the new preferred parent, that is, for the dag of
which the supplied parent is part. Note that modified_parent->dag
does not always equal instance->current_dag. */
rpl_select_parent(modified_parent->dag);
}
/* Iterate through the dag_table of the supplied instance (first RPL_MAX_DAG_PER_INSTANCE
dags in dag_table only) and if a dag is used, has a preferred parent, and the rank we
advertise in said dag is not RPL_INFINITE_RANK, then we either set best_dag to said
dag (if best_dag is NULL), or we compare the dag to the current best_dag and overwrite
best_dag if it is better (as determined by the OF). Note that many OFs largely base
the output of best_dag() on the ranks of the supplied dags. Also note that rpl_select_dag
is only called when a supplied parent is updated in such a way that it may cause our
rank in modified_parent->dag to change. Since there is no other reason for our rank in
any dag to change, the rank in all other dags should be up to date already by virtue of
previous calls to rpl_select_dag(). */
best_dag = NULL;
for(dag = &instance->dag_table[0], end = dag + RPL_MAX_DAG_PER_INSTANCE; dag < end; ++dag) {
if(dag->used && dag->preferred_parent != NULL && rpl_rank_via_dag(dag, NULL) != RPL_INFINITE_RANK) {
if(best_dag == NULL) {
best_dag = dag;
} else {
best_dag = instance->of->best_dag(best_dag, dag);
}
}
}
if(best_dag == NULL) {
/* We may not have found a suitable dag if we have not yet added any dag in the supplied
instance, or if we did so but none of the added dags has a preferred parent, or if