-
Notifications
You must be signed in to change notification settings - Fork 25
/
Copy pathmsg.c
3945 lines (2657 loc) · 153 KB
/
msg.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 Axel Neumann
* This program is free software; you can redistribute it and/or
* modify it under the terms of version 2 of the GNU General Public
* License as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301, USA
*/
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <unistd.h>
#include <errno.h>
#include "bmx.h"
#include "msg.h"
#include "ip.h"
#include "metrics.h"
#include "schedule.h"
#include "tools.h"
#include "plugin.h"
#define CODE_CATEGORY_NAME "message"
static int32_t pref_udpd_size = DEF_UDPD_SIZE;
static int32_t ogmSqnRange = DEF_OGM_SQN_RANGE;
static int32_t ogm_adv_tx_iters = DEF_OGM_TX_ITERS;
static int32_t ogm_ack_tx_iters = DEF_OGM_ACK_TX_ITERS;
static int32_t desc_req_tx_iters = DEF_DESC_REQ_TX_ITERS;
static int32_t desc_adv_tx_iters = DEF_DESC_ADV_TX_ITERS;
static int32_t desc_adv_tx_unsolicited = DEF_DESC_ADV_UNSOLICITED;
static int32_t dhash_req_tx_iters = DEF_DHASH_REQ_TX_ITERS;
static int32_t dhash_adv_tx_iters = DEF_DHASH_ADV_TX_ITERS;
static int32_t dev_req_tx_iters = DEF_DEV_REQS_TX_ITERS;
static int32_t dev_adv_tx_iters = DEF_DEV_ADVS_TX_ITERS;
static int32_t dev_adv_tx_unsolicited = DEF_DEV_ADV_UNSOLICITED;
static int32_t link_req_tx_iters = DEF_LINK_REQS_TX_ITERS;
static int32_t link_adv_tx_iters = DEF_LINK_ADVS_TX_ITERS;
static int32_t link_adv_tx_unsolicited = DEF_LINK_ADV_UNSOLICITED;
union schedule_hello_info {
uint8_t u8[2];
uint16_t u16;
};
Sha bmx_sha;
AVL_TREE( description_cache_tree, struct description_cache_node, dhash );
//int my_desc0_tlv_len = 0;
IID_T myIID4me = IID_RSVD_UNUSED;
TIME_T myIID4me_timestamp = 0;
static PKT_SQN_T my_packet_sqn = 0;
static IDM_T first_packet = YES;
static struct msg_dev_adv *my_dev_adv_buff = NULL;
static DEVADV_SQN_T my_dev_adv_sqn = 0;
static uint16_t my_dev_adv_msgs_size = 0;
static int32_t msg_dev_req_enabled = NO;
static struct msg_link_adv *my_link_adv_buff = NULL;
static LINKADV_SQN_T my_link_adv_sqn = 0;
//static int32_t my_link_adv_msgs_size = 0;
static int32_t my_link_adv_msgs = 0;
LIST_SIMPEL( ogm_aggreg_list, struct ogm_aggreg_node, list, sqn );
uint32_t ogm_aggreg_pending = 0;
static AGGREG_SQN_T ogm_aggreg_sqn_max;
static struct dhash_node* DHASH_NODE_FAILURE = (struct dhash_node*) & DHASH_NODE_FAILURE;
/***********************************************************
The core frame/message structures and handlers
************************************************************/
char *tlv_op_str(uint8_t op)
{
switch (op) {
case TLV_OP_DEL:
return "TLV_OP_DEL";
case TLV_OP_TEST:
return "TLV_OP_TEST";
case TLV_OP_NEW:
return "TLV_OP_NEW";
case TLV_OP_DEBUG:
return "TLV_OP_DEBUG";
default:
if (op >= TLV_OP_CUSTOM_MIN && op <= TLV_OP_CUSTOM_MAX)
return "TLV_OP_CUSTOM";
if (op >= TLV_OP_PLUGIN_MIN && op <= TLV_OP_PLUGIN_MAX)
return "TLV_OP_PLUGIN";
return "TLV_OP_ILLEGAL";
}
return "TLV_OP_ERROR";
}
struct frame_handl packet_frame_handler[FRAME_TYPE_ARRSZ];
struct frame_handl description_tlv_handl[BMX_DSC_TLV_ARRSZ];
void register_frame_handler(struct frame_handl *array, int pos, struct frame_handl *handl)
{
TRACE_FUNCTION_CALL;
assertion(-500659, (pos < BMX_DSC_TLV_ARRSZ));
assertion(-500660, (!array[pos].min_msg_size)); // the pos MUST NOT be used yet
assertion(-500661, (handl && handl->min_msg_size && handl->name));
assertion(-500806, (XOR(handl->rx_frame_handler, handl->rx_msg_handler) && XOR(handl->tx_frame_handler, handl->tx_msg_handler)));
assertion(-500879, (!(handl->min_msg_size % TLV_DATA_STEPS) && handl->min_msg_size >= TLV_DATA_STEPS));
assertion(-500880, (!(handl->data_header_size % TLV_DATA_STEPS)));
assertion(-500975, (handl->tx_task_interval_min <= CONTENT_MIN_TX_INTERVAL_MAX));
assertion(-501213, IMPLIES(handl->msg_format, handl->min_msg_size ==
fields_dbg_lines(NULL, FIELD_RELEVANCE_LOW, 0, NULL, handl->min_msg_size, handl->msg_format)));
array[pos] = *handl;
memset(handl, 0, sizeof ( struct frame_handl ) );
}
STATIC_FUNC
struct description * remove_cached_description(struct description_hash *dhash)
{
TRACE_FUNCTION_CALL;
struct description_cache_node *dcn;
if (!(dcn = avl_find_item(&description_cache_tree, dhash)))
return NULL;
struct description *desc0 = dcn->description;
avl_remove(&description_cache_tree, &dcn->dhash, -300206);
debugFree(dcn, -300108);
return desc0;
}
STATIC_FUNC
struct description_cache_node *purge_cached_descriptions(IDM_T purge_all)
{
TRACE_FUNCTION_CALL;
struct description_cache_node *dcn;
struct description_cache_node *dcn_min = NULL;
struct description_hash tmp_dhash;
memset( &tmp_dhash, 0, sizeof(struct description_hash));
dbgf_all( DBGT_INFO, "%s", purge_all ? "purge_all" : "only_expired");
while ((dcn = avl_next_item(&description_cache_tree, &tmp_dhash))) {
memcpy(&tmp_dhash, &dcn->dhash, HASH_SHA1_LEN);
if (purge_all || ((TIME_T) (bmx_time - dcn->timestamp)) > DEF_DESC0_CACHE_TO) {
avl_remove(&description_cache_tree, &dcn->dhash, -300208);
debugFree(dcn->description, -300100);
debugFree(dcn, -300101);
} else {
if (!dcn_min || U32_LT(dcn->timestamp, dcn_min->timestamp))
dcn_min = dcn;
}
}
return dcn_min;
}
STATIC_FUNC
void cache_description(struct description *desc, struct description_hash *dhash)
{
TRACE_FUNCTION_CALL;
struct description_cache_node *dcn;
uint16_t desc_len = sizeof (struct description) + ntohs(desc->extensionLen);
if ((dcn = avl_find_item(&description_cache_tree, dhash))) {
dcn->timestamp = bmx_time;
return;
}
dbgf_all( DBGT_INFO, "%8X..", dhash->h.u32[0]);
assertion(-500261, (description_cache_tree.items <= DEF_DESC0_CACHE_SIZE));
if ( description_cache_tree.items == DEF_DESC0_CACHE_SIZE ) {
struct description_cache_node *dcn_min = purge_cached_descriptions( NO );
dbgf_sys(DBGT_WARN, "desc0_cache_tree reached %d items! cleaned up %d items!",
DEF_DESC0_CACHE_SIZE, DEF_DESC0_CACHE_SIZE - description_cache_tree.items);
if (description_cache_tree.items == DEF_DESC0_CACHE_SIZE) {
avl_remove(&description_cache_tree, &dcn_min->dhash, -300209);
debugFree(dcn_min->description, -300102);
debugFree(dcn_min, -300103);
}
}
assertion(-500273, (desc_len == sizeof ( struct description) + ntohs(desc->extensionLen)));
dcn = debugMalloc(sizeof ( struct description_cache_node), -300104);
dcn->description = debugMalloc(desc_len, -300105);
memcpy(dcn->description, desc, desc_len);
memcpy( &dcn->dhash, dhash, HASH_SHA1_LEN );
dcn->timestamp = bmx_time;
avl_insert(&description_cache_tree, dcn, -300145);
}
IDM_T process_description_tlvs(struct packet_buff *pb, struct orig_node *on, struct description *desc, uint8_t op,
uint8_t filter, void *custom, struct ctrl_node *cn)
{
TRACE_FUNCTION_CALL;
assertion(-500370, (op == TLV_OP_DEL || op == TLV_OP_TEST || op == TLV_OP_NEW || op == TLV_OP_DEBUG ||
(op >= TLV_OP_CUSTOM_MIN && op <= TLV_OP_CUSTOM_MAX) || (op >= TLV_OP_PLUGIN_MIN && op <= TLV_OP_PLUGIN_MAX)));
assertion(-500590, IMPLIES(on == self, (op == TLV_OP_DEBUG ||
(op >= TLV_OP_CUSTOM_MIN && op <= TLV_OP_CUSTOM_MAX) || (op >= TLV_OP_PLUGIN_MIN && op <= TLV_OP_PLUGIN_MAX))));
assertion(-500807, (desc));
// assertion(-500829, IMPLIES(op == TLV_OP_DEL, !on->blocked));
assertion(-501354, IMPLIES(op == TLV_OP_DEL, on->added));
int32_t tlv_result;
uint16_t dsc_tlvs_len = ntohs(desc->extensionLen);
struct rx_frame_iterator it = {
.caller = __func__, .on = on, .cn = cn, .op = op, .pb = pb,
.handls = description_tlv_handl, .handl_max = (BMX_DSC_TLV_MAX), .process_filter = filter,
.data = ((uint8_t*) desc), .frame_type = -1,
.frames_in = (((uint8_t*) desc) + sizeof (struct description)), .frames_pos = 0,
.frames_length = dsc_tlvs_len, .custom_data = custom
};
dbgf_track(DBGT_INFO, "op=%s id=%s dsc_sqn=%d size=%d ",
tlv_op_str(op), globalIdAsString(&desc->globalId), ntohs(desc->descSqn), dsc_tlvs_len);
while ((tlv_result = rx_frame_iterate(&it)) > TLV_RX_DATA_DONE);
if ((op >= TLV_OP_CUSTOM_MIN && op <= TLV_OP_CUSTOM_MAX) || (op >= TLV_OP_PLUGIN_MIN && op <= TLV_OP_PLUGIN_MAX))
return TLV_RX_DATA_DONE;
if (tlv_result == TLV_RX_DATA_BLOCKED || tlv_result == TLV_RX_DATA_FAILURE) {
assertion(-500356, IMPLIES(tlv_result == TLV_RX_DATA_BLOCKED, op == TLV_OP_TEST));
assertion(-501355, (op == TLV_OP_TEST));
dbgf_sys(DBGT_WARN, "problematic description_ltv from %s, near type=%s frame_data_length=%d pos=%d %s",
pb ? pb->i.llip_str : DBG_NIL, description_tlv_handl[it.frame_type].name,
it.frame_data_length, it.frames_pos, tlv_result == TLV_RX_DATA_BLOCKED ? "BLOCKED" : "FAILURE");
block_orig_node(YES, on);
return tlv_result;
}
if (filter == FRAME_TYPE_PROCESS_ALL && op == TLV_OP_NEW) {
on->added = YES;
block_orig_node(NO, on);
if (!on->path_metricalgo)
metricalgo_assign(on, NULL);
} else if (filter == FRAME_TYPE_PROCESS_ALL && op == TLV_OP_DEL) {
on->added = NO;
metricalgo_remove(on);
}
return TLV_RX_DATA_DONE;
}
void purge_tx_task_list(struct list_head *tx_task_lists, struct link_node *only_link, struct dev_node *only_dev)
{
TRACE_FUNCTION_CALL;
int i;
assertion(-500845, (tx_task_lists));
for (i = 0; i < FRAME_TYPE_ARRSZ; i++) {
struct list_node *lpos, *tpos, *lprev = (struct list_node*) & tx_task_lists[i];
list_for_each_safe(lpos, tpos, &tx_task_lists[i])
{
struct tx_task_node * tx_task = list_entry(lpos, struct tx_task_node, list);
if ((!only_link || only_link == tx_task->task.link) &&
(!only_dev || only_dev == tx_task->task.dev)) {
if (packet_frame_handler[tx_task->task.type].tx_task_interval_min) {
avl_remove(&tx_task->task.dev->tx_task_interval_tree, &tx_task->task, -300313);
}
list_del_next(&tx_task_lists[i], lprev);
dbgf_all(DBGT_INFO, "removed frame_type=%d ln=%s dev=%s tx_tasks_list.items=%d",
tx_task->task.type,
ipFAsStr(tx_task->task.link ? &tx_task->task.link->link_ip : &ZERO_IP),
tx_task->task.dev->ifname_label.str, tx_task_lists[tx_task->task.type].items);
debugFree(tx_task, -300066);
continue;
}
lprev = lpos;
}
}
}
STATIC_FUNC
IDM_T freed_tx_task_node(struct tx_task_node *tx_task, struct list_head *tx_task_list, struct list_node *lprev)
{
TRACE_FUNCTION_CALL;
assertion(-500372, (tx_task && tx_task->task.dev));
assertion(-500539, lprev);
if (tx_task->tx_iterations <= 0) {
if (packet_frame_handler[tx_task->task.type].tx_task_interval_min) {
avl_remove(&tx_task->task.dev->tx_task_interval_tree, &tx_task->task, -300314);
}
list_del_next(tx_task_list, lprev);
debugFree(tx_task, -300169);
return YES;
}
return NO;
}
STATIC_FUNC
IDM_T tx_task_obsolete(struct tx_task_node *tx_task)
{
TRACE_FUNCTION_CALL;
struct dhash_node *dhn = NULL;
char *reason = NULL;
IDM_T problem;
if (tx_task->task.myIID4x >= IID_MIN_USED &&
(!(dhn = iid_get_node_by_myIID4x(tx_task->task.myIID4x)) || !dhn->on)) {
reason = dhn ? "INVALIDATED" : "UNKNOWN";
tx_task->tx_iterations = 0;
problem = TLV_TX_DATA_DONE;
} else if (packet_frame_handler[tx_task->task.type].tx_task_interval_min &&
((TIME_T) (bmx_time - tx_task->send_ts) < packet_frame_handler[tx_task->task.type].tx_task_interval_min)) {
reason = "RECENTLY SEND";
problem = TLV_TX_DATA_IGNORED;
} else {
// tx_task->send_ts = bmx_time;
self->dhn->referred_by_me_timestamp = bmx_time;
if (dhn)
dhn->referred_by_me_timestamp = bmx_time;
return TLV_TX_DATA_PROCESSED;
}
dbgf_track(DBGT_INFO,
"%s type=%s dev=%s myIId4x=%d neighIID4x=%d local_id=%X dev_idx=0x%X name=%s or send just %d ms ago",
reason,
packet_frame_handler[tx_task->task.type].name, tx_task->task.dev->ifname_device.str,
tx_task->task.myIID4x, tx_task->task.neighIID4x,
tx_task->task.link ? ntohl(tx_task->task.link->key.local_id) : 0,
tx_task->task.link ? tx_task->task.link->key.dev_idx : 0,
(dhn && dhn->on) ? globalIdAsString(&dhn->on->global_id) : "???", (bmx_time - tx_task->send_ts));
return problem;
}
STATIC_FUNC
struct tx_task_node *tx_task_new(struct link_dev_node *dest_lndev, struct tx_task_node *test)
{
assertion(-500909, (dest_lndev));
struct frame_handl *handl = &packet_frame_handler[test->task.type];
struct tx_task_node *ttn = NULL;
struct dhash_node *dhn;
if (test->task.myIID4x > IID_RSVD_MAX && (!(dhn = iid_get_node_by_myIID4x(test->task.myIID4x)) || !dhn->on))
return NULL;
if (handl->tx_task_interval_min) {
if ((ttn = avl_find_item(&test->task.dev->tx_task_interval_tree, &test->task))) {
ASSERTION(-500906, (IMPLIES((!handl->is_advertisement), (ttn->task.link == test->task.link))));
ttn->frame_msgs_length = test->frame_msgs_length;
ttn->tx_iterations = XMAX(ttn->tx_iterations, test->tx_iterations);
// then it is already scheduled
return ttn;
}
}
ttn = debugMalloc(sizeof ( struct tx_task_node), -300026);
memcpy(ttn, test, sizeof ( struct tx_task_node));
ttn->send_ts = ((TIME_T) (bmx_time - handl->tx_task_interval_min));
if (handl->tx_task_interval_min) {
avl_insert(&test->task.dev->tx_task_interval_tree, ttn, -300315);
if (test->task.dev->tx_task_interval_tree.items > DEF_TX_TS_TREE_SIZE) {
dbg_mute(20, DBGL_SYS, DBGT_WARN,
"%s tx_ts_tree reached %d %s neighIID4x=%d u16=%d u32=%d myIID4x=%d",
test->task.dev->ifname_device.str, test->task.dev->tx_task_interval_tree.items,
handl->name, test->task.neighIID4x, test->task.u16, test->task.u32,
test->task.myIID4x);
}
}
if (handl->is_destination_specific_frame) {
// ensure, this is NOT a dummy dest_lndev!!!:
ASSERTION(-500850, (dest_lndev && dest_lndev == avl_find_item(&link_dev_tree, &dest_lndev->key)));
list_add_tail(&(dest_lndev->tx_task_lists[test->task.type]), &ttn->list);
dbgf_track(DBGT_INFO, "added %s to lndev local_id=%X link_ip=%s dev=%s tx_tasks_list.items=%d",
handl->name, ntohl(dest_lndev->key.link->key.local_id),
ipFAsStr(&dest_lndev->key.link->link_ip),
dest_lndev->key.dev->ifname_label.str, dest_lndev->tx_task_lists[test->task.type].items);
} else {
list_add_tail(&(test->task.dev->tx_task_lists[test->task.type]), &ttn->list);
}
return ttn;
}
void schedule_tx_task(struct link_dev_node *dest_lndev, uint16_t frame_type, int16_t frame_msgs_len,
uint16_t u16, uint32_t u32, IID_T myIID4x, IID_T neighIID4x)
{
TRACE_FUNCTION_CALL;
struct frame_handl *handl = &packet_frame_handler[frame_type];
if (!dest_lndev)
return;
if (dest_lndev->key.dev->linklayer == TYP_DEV_LL_LO)
return;
assertion(-501047, (!cleaning_up)); // this function MUST NOT be called during cleanup
assertion(-500756, (dest_lndev && dest_lndev->key.dev));
ASSERTION(-500713, (initializing || iid_get_node_by_myIID4x(myIID4me)));
ASSERTION(-500714, IMPLIES(myIID4x, iid_get_node_by_myIID4x(myIID4x)));
assertion(-501090, (frame_msgs_len >= SCHEDULE_MIN_MSG_SIZE));
assertion(-501091, (dest_lndev->key.dev->active));
assertion(-501092, (dest_lndev->key.dev->linklayer != TYP_DEV_LL_LO));
// ensure, this is NOT a dummy dest_lndev if:!!!
ASSERTION(-500976, (IMPLIES(handl->is_destination_specific_frame,
(dest_lndev == avl_find_item(&link_dev_tree, &dest_lndev->key)))));
if (handl->tx_iterations && !(*handl->tx_iterations))
return;
dbgf((( /* debug interesting frame types: */ frame_type == FRAME_TYPE_PROBLEM_ADV ||
frame_type == FRAME_TYPE_HASH_REQ || frame_type == FRAME_TYPE_HASH_ADV ||
frame_type == FRAME_TYPE_DESC_REQ ||frame_type == FRAME_TYPE_DESC_ADV ||
frame_type == FRAME_TYPE_LINK_REQ_ADV || frame_type == FRAME_TYPE_LINK_ADV ||
frame_type == FRAME_TYPE_DEV_REQ || frame_type == FRAME_TYPE_DEV_ADV)
? DBGL_CHANGES : DBGL_ALL), DBGT_INFO,
"%s to NB=%s local_id=0x%X via dev=%s frame_msgs_len=%d u16=%d u32=%d myIID4x=%d neighIID4x=%d ",
handl->name,
dest_lndev->key.link ? ipFAsStr(&dest_lndev->key.link->link_ip) : DBG_NIL,
dest_lndev->key.link ? dest_lndev->key.link->local->local_id : 0,
dest_lndev->key.dev->ifname_label.str, frame_msgs_len, u16, u32, myIID4x, neighIID4x);
if (handl->tx_tp_min && *(handl->tx_tp_min) > dest_lndev->timeaware_tx_probe) {
dbgf_track(DBGT_INFO, "NOT sending %s (via %s sqn %d myIID4x %d neighIID4x %d) tp=%ju < %ju",
handl->name, dest_lndev->key.dev->ifname_label.str, u16, myIID4x, neighIID4x,
dest_lndev->timeaware_tx_probe, *(handl->tx_tp_min));
return;
}
if (handl->tx_rp_min && *(handl->tx_rp_min) > dest_lndev->timeaware_rx_probe) {
dbgf_track(DBGT_INFO, "NOT sending %s (via %s sqn %d myIID4x %d neighIID4x %d) rp=%ju < %ju",
handl->name, dest_lndev->key.dev->ifname_label.str, u16, myIID4x, neighIID4x,
dest_lndev->timeaware_rx_probe, *(handl->tx_rp_min));
return;
}
struct tx_task_node test_task;
memset(&test_task, 0, sizeof (test_task));
test_task.task.u16 = u16;
test_task.task.u32 = u32;
test_task.task.dev = dest_lndev->key.dev;
test_task.task.myIID4x = myIID4x;
test_task.task.neighIID4x = neighIID4x;
test_task.task.type = frame_type;
test_task.tx_iterations = handl->tx_iterations ? *handl->tx_iterations : 1;
test_task.considered_ts = bmx_time - 1;
// advertisements are send to all and are not bound to a specific destinations,
// therfore tx_task_obsolete should not filter due to the destination_dev_id
if (!handl->is_advertisement && dest_lndev->key.link) {
//ASSERTION(-500915, (dest_lndev == avl_find_item(&link_dev_tree, &dest_lndev->key)));
test_task.task.link = dest_lndev->key.link;
}
test_task.frame_msgs_length = frame_msgs_len == SCHEDULE_MIN_MSG_SIZE ? handl->min_msg_size : frame_msgs_len;
assertion(-500371, IMPLIES(handl->fixed_msg_size, !(test_task.frame_msgs_length % handl->min_msg_size)));
/*
if (frame_msgs_len) {
test_task.frame_msgs_length = frame_msgs_len;
} else {
assertion(-500769, (handl->fixed_msg_size && handl->min_msg_size));
test_task.frame_msgs_length = handl->min_msg_size;
}
*/
tx_task_new(dest_lndev, &test_task);
}
OGM_SQN_T set_ogmSqn_toBeSend_and_aggregated(struct orig_node *on, UMETRIC_T um, OGM_SQN_T to_be_send, OGM_SQN_T aggregated)
{
TRACE_FUNCTION_CALL;
to_be_send &= OGM_SQN_MASK;
aggregated &= OGM_SQN_MASK;
if (UXX_GT(OGM_SQN_MASK, to_be_send, aggregated)) {
if (UXX_LE(OGM_SQN_MASK, on->ogmSqn_next, on->ogmSqn_send))
ogm_aggreg_pending++;
} else {
assertion(-500830, (UXX_LE(OGM_SQN_MASK, to_be_send, aggregated)));
if (UXX_GT(OGM_SQN_MASK, on->ogmSqn_next, on->ogmSqn_send))
ogm_aggreg_pending--;
}
on->ogmMetric_next = um;
on->ogmSqn_next = to_be_send;
on->ogmSqn_send = aggregated;
return on->ogmSqn_next;
}
STATIC_FUNC
IID_T create_ogm(struct orig_node *on, IID_T prev_ogm_iid, struct msg_ogm_adv *ogm)
{
TRACE_FUNCTION_CALL;
assertion(-501064, (on->ogmMetric_next <= UMETRIC_MAX));
assertion(-501066, (on->ogmMetric_next > UMETRIC_INVALID));
assertion_dbg(-501063, ((((OGM_SQN_MASK) & (on->ogmSqn_next - on->ogmSqn_rangeMin)) < on->ogmSqn_rangeSize)),
"orig=%s next=%d min=%d size=%d", on==self ? "self" : globalIdAsString(&on->global_id),
on->ogmSqn_next, on->ogmSqn_rangeMin, on->ogmSqn_rangeSize);
FMETRIC_U16_T fm = umetric_to_fmetric(on->ogmMetric_next);
if (UXX_GT(OGM_SQN_MASK, on->ogmSqn_next, on->ogmSqn_send + OGM_SQN_STEP)) {
dbgf_track(DBGT_WARN, "id=%s delayed %d < %d", globalIdAsString(&on->global_id), on->ogmSqn_send, on->ogmSqn_next);
} else {
dbgf_all(DBGT_INFO, "id=%s in-time %d < %d", globalIdAsString(&on->global_id), on->ogmSqn_send, on->ogmSqn_next);
}
set_ogmSqn_toBeSend_and_aggregated(on, on->ogmMetric_next, on->ogmSqn_next, on->ogmSqn_next);
on->dhn->referred_by_me_timestamp = bmx_time;
assertion(-500890, ((on->dhn->myIID4orig - prev_ogm_iid) <= OGM_IIDOFFST_MASK));
OGM_MIX_T mix =
((on->dhn->myIID4orig - prev_ogm_iid) << OGM_IIDOFFST_BIT_POS) +
((fm.val.f.exp_fm16) << OGM_EXPONENT_BIT_POS) +
((fm.val.f.mantissa_fm16) << OGM_MANTISSA_BIT_POS);
ogm->mix = htons(mix);
ogm->u.ogm_sqn = htons(on->ogmSqn_next);
return on->dhn->myIID4orig;
}
STATIC_FUNC
void create_ogm_aggregation(void)
{
TRACE_FUNCTION_CALL;
uint32_t target_ogms = XMIN(OGMS_PER_AGGREG_MAX,
((ogm_aggreg_pending < ((OGMS_PER_AGGREG_PREF / 3)*4)) ? ogm_aggreg_pending : OGMS_PER_AGGREG_PREF));
struct msg_ogm_adv* msgs =
debugMalloc((target_ogms + OGM_JUMPS_PER_AGGREGATION) * sizeof (struct msg_ogm_adv), -300177);
IID_T curr_iid;
IID_T ogm_iid = 0;
IID_T ogm_iid_jumps = 0;
uint16_t ogm_msg = 0;
dbgf_all(DBGT_INFO, "pending %d target %d", ogm_aggreg_pending, target_ogms);
for (curr_iid = IID_MIN_USED; curr_iid < my_iid_repos.max_free; curr_iid++) {
IID_NODE_T *dhn = my_iid_repos.arr.node[curr_iid];
struct orig_node *on = dhn ? dhn->on : NULL;
if (on && UXX_GT(OGM_SQN_MASK, on->ogmSqn_next, on->ogmSqn_send)) {
if (on != self && (!on->curr_rt_local || on->curr_rt_local->mr.umetric < on->path_metricalgo->umetric_min)) {
dbgf_sys(DBGT_WARN,
"id=%s with %s curr_rn and PENDING ogm_sqn=%d but path_metric=%jd < USABLE=%jd",
globalIdAsString(&on->global_id), on->curr_rt_local ? " " : "NO", on->ogmSqn_next,
on->curr_rt_local ? on->curr_rt_local->mr.umetric : 0,
on->path_metricalgo->umetric_min);
assertion(-500816, (0));
continue;
}
if (((IID_T) (dhn->myIID4orig - ogm_iid) >= OGM_IID_RSVD_JUMP)) {
if (ogm_iid_jumps == OGM_JUMPS_PER_AGGREGATION)
break;
dbgf_mute(8, (ogm_iid_jumps > 1) ? DBGL_SYS : DBGL_ALL, DBGT_INFO,
"IID jump %d from %d to %d", ogm_iid_jumps, ogm_iid, dhn->myIID4orig);
ogm_iid = dhn->myIID4orig;
msgs[ogm_msg + ogm_iid_jumps].mix = htons((OGM_IID_RSVD_JUMP) << OGM_IIDOFFST_BIT_POS);
msgs[ogm_msg + ogm_iid_jumps].u.transmitterIIDabsolute = htons(ogm_iid);
ogm_iid_jumps++;
}
ogm_iid = create_ogm(on, ogm_iid, &msgs[ogm_msg + ogm_iid_jumps]);
if ((++ogm_msg) == target_ogms)
break;
}
}
assertion(-500817, (IMPLIES(curr_iid == my_iid_repos.max_free, !ogm_aggreg_pending)));
if (ogm_aggreg_pending) {
dbgf_sys(DBGT_WARN, "%d ogms left for immediate next aggregation", ogm_aggreg_pending);
}
if (!ogm_msg) {
debugFree( msgs, -300219);
return;
}
struct ogm_aggreg_node *oan = debugMallocReset(sizeof (struct ogm_aggreg_node), -300179);
oan->aggregated_msgs = ogm_msg + ogm_iid_jumps;
oan->ogm_advs = msgs;
oan->tx_attempt = 0;
oan->sqn = (++ogm_aggreg_sqn_max);
uint16_t destinations = 0;
struct avl_node *neigh_an = NULL;
struct neigh_node *neigh;
struct local_node *local;
while ((neigh = avl_iterate_item(&neigh_tree, &neigh_an)) && (local = neigh->local)) {
if (local->link_adv_msg_for_him != LINKADV_MSG_IGNORED && local->rp_ogm_request_rcvd) {
destinations++;
/*
assertion(-501316, (local->link_adv_msg_for_him < OGM_DESTINATION_ARRAY_BIT_SIZE));
oan->ogm_dest_bytes = MAX(oan->ogm_dest_bytes, ((local->link_adv_msg_for_him / 8) + 1));
bit_set(oan->ogm_dest_field, OGM_DESTINATION_ARRAY_BIT_SIZE, local->link_adv_msg_for_him, 1);
*/
bit_set(neigh->ogm_aggregations_not_acked, AGGREG_SQN_CACHE_RANGE, ogm_aggreg_sqn_max, 1);
} else {
bit_set(neigh->ogm_aggregations_not_acked, AGGREG_SQN_CACHE_RANGE, ogm_aggreg_sqn_max, 0);
}
}
list_add_tail(&ogm_aggreg_list, &oan->list);
dbgf_all( DBGT_INFO, "aggregation_sqn=%d ogms=%d jumps=%d destinations=%d",
oan->sqn, ogm_msg, ogm_iid_jumps, destinations);
return;
}
static struct link_dev_node **lndev_arr = NULL;
STATIC_FUNC
void lndevs_prepare(void)
{
TRACE_FUNCTION_CALL;
static uint16_t lndev_arr_items = 0;
struct avl_node *an;
struct dev_node *dev;
if (lndev_arr_items != dev_ip_tree.items + 1) {
if (lndev_arr)
debugFree(lndev_arr, -300180);
lndev_arr_items = dev_ip_tree.items + 1;
lndev_arr = debugMalloc((lndev_arr_items * sizeof (struct link_dev_node*)), -300182);
}
for (an = NULL; (dev = avl_iterate_item(&dev_ip_tree, &an));)
dev->tmp_flag_for_to_be_send_adv = NO;
}
STATIC_FUNC
struct link_dev_node **lndevs_get_unacked_ogm_neighbors(struct ogm_aggreg_node *oan)
{
TRACE_FUNCTION_CALL;
struct avl_node *neigh_an = NULL;
struct neigh_node *neigh;
struct local_node *local;
uint16_t d = 0;
dbgf_all(DBGT_INFO, "aggreg_sqn %d ", oan->sqn);
lndevs_prepare();
memset(oan->ogm_dest_field, 0, sizeof (oan->ogm_dest_field));
oan->ogm_dest_bytes = 0;
while ((neigh = avl_iterate_item(&neigh_tree, &neigh_an)) && (local = neigh->local)) {
assertion(-500971, (IMPLIES(local, local->best_tp_lndev)));
if (local->link_adv_msg_for_him == LINKADV_MSG_IGNORED || !local->rp_ogm_request_rcvd)
bit_set(neigh->ogm_aggregations_not_acked, AGGREG_SQN_CACHE_RANGE, oan->sqn, 0);
IDM_T not_acked = bit_get(neigh->ogm_aggregations_not_acked, AGGREG_SQN_CACHE_RANGE, oan->sqn);
if (not_acked ||
oan->tx_attempt == 0/*first ogm-adv frame shall be send to all neighbors*/) {
struct link_dev_node *best_lndev = local->best_tp_lndev;
assertion(-500446, (best_lndev->key.dev));
assertion(-500447, (best_lndev->key.dev->active));
assertion(-500444, (d <= dev_ip_tree.items));
dbgf_all(DBGT_INFO, " redundant=%d via dev=%s to local_id=%X dev_idx=0x%X",
best_lndev->key.dev->tmp_flag_for_to_be_send_adv, best_lndev->key.dev->ifname_label.str,
ntohl(best_lndev->key.link->key.local_id), best_lndev->key.link->key.dev_idx);
if (best_lndev->key.dev->tmp_flag_for_to_be_send_adv == NO) {
lndev_arr[d++] = best_lndev;
best_lndev->key.dev->tmp_flag_for_to_be_send_adv = YES;
}
if (not_acked) {
assertion(-501138, (local->link_adv_msg_for_him < OGM_DEST_ARRAY_BIT_SIZE));
oan->ogm_dest_bytes = XMAX(oan->ogm_dest_bytes, ((local->link_adv_msg_for_him / 8) + 1));
bit_set(oan->ogm_dest_field, OGM_DEST_ARRAY_BIT_SIZE, local->link_adv_msg_for_him, 1);
}
if (oan->tx_attempt >= ((ogm_adv_tx_iters * 3) / 4)) {
dbg_track(DBGT_WARN, "schedule ogm_aggregation_sqn=%3d msgs=%2d dest_bytes=%d tx_attempt=%2d/%d via dev=%s to NB=%s",
oan->sqn, oan->aggregated_msgs, oan->ogm_dest_bytes, (oan->tx_attempt + 1),
ogm_adv_tx_iters, best_lndev->key.dev->ifname_label.str,
ipFAsStr(&best_lndev->key.link->link_ip));
}
}
}
lndev_arr[d] = NULL;
return lndev_arr;
}
STATIC_FUNC
struct link_dev_node **lndevs_get_best_tp(struct local_node *except_local)
{
TRACE_FUNCTION_CALL;
struct avl_node *an;
struct local_node *local;
uint16_t d = 0;
lndevs_prepare();
dbgf_all(DBGT_INFO, "NOT local_id=%d ", except_local ? except_local->local_id : 0);
for (an = NULL; (local = avl_iterate_item(&local_tree, &an));) {
if (except_local != local) {
struct link_dev_node *best_lndev = local->best_tp_lndev;
assertion(-500445, (best_lndev));
assertion(-500446, (best_lndev->key.dev));
assertion(-500447, (best_lndev->key.dev->active));
dbgf_all(DBGT_INFO, " via dev=%s to local_id=%X dev_idx=0x%X (redundant %d)",
best_lndev->key.dev->ifname_label.str, ntohl(best_lndev->key.link->key.local_id),
best_lndev->key.link->key.dev_idx, best_lndev->key.dev->tmp_flag_for_to_be_send_adv);
if (best_lndev->key.dev->tmp_flag_for_to_be_send_adv == NO) {
lndev_arr[d++] = best_lndev;
best_lndev->key.dev->tmp_flag_for_to_be_send_adv = YES;
}
assertion(-500444, (d <= dev_ip_tree.items));
}
}
lndev_arr[d] = NULL;
return lndev_arr;
}
STATIC_FUNC
void schedule_or_purge_ogm_aggregations(IDM_T purge_all)
{
TRACE_FUNCTION_CALL;
static TIME_T timestamp = 0;
dbgf_all(DBGT_INFO, "max %d active aggregations %d pending ogms %d expiery in %d ms",
ogm_aggreg_sqn_max, ogm_aggreg_list.items, ogm_aggreg_pending,
(my_tx_interval - ((TIME_T) (bmx_time - timestamp))));
if (!purge_all && timestamp != bmx_time) {
timestamp = bmx_time;
while (ogm_aggreg_pending) {
struct ogm_aggreg_node *oan = list_get_first(&ogm_aggreg_list);
if (oan && ((AGGREG_SQN_MASK)& ((ogm_aggreg_sqn_max + 1) - oan->sqn)) >= AGGREG_SQN_CACHE_RANGE) {
dbgf_sys(DBGT_WARN,
"ogm_aggreg_list full min %d max %d items %d unaggregated %d",
oan->sqn, ogm_aggreg_sqn_max, ogm_aggreg_list.items, ogm_aggreg_pending);
debugFree(oan->ogm_advs, -300185);
debugFree(oan, -300186);
list_del_next(&ogm_aggreg_list, ((struct list_node*) & ogm_aggreg_list));
}
create_ogm_aggregation();
#ifdef EXTREME_PARANOIA
if (!ogm_aggreg_pending) {
IID_T curr_iid;
for (curr_iid = IID_MIN_USED; curr_iid < my_iid_repos.max_free; curr_iid++) {
IID_NODE_T *dhn = my_iid_repos.arr.node[curr_iid];
struct orig_node *on = dhn ? dhn->on : NULL;
if (on && on->curr_rt_local &&
UXX_GT(OGM_SQN_MASK, on->ogmSqn_next, on->ogmSqn_send) &&
on->curr_rt_local->mr.umetric >= on->path_metricalgo->umetric_min) {
dbgf_sys(DBGT_ERR,
"%s with %s curr_rn and PENDING ogm_sqn=%d but path_metric=%jd < USABLE=%jd",
globalIdAsString(&on->global_id),
on->curr_rt_local ? " " : "NO", on->ogmSqn_next,
on->curr_rt_local ? on->curr_rt_local->mr.umetric : 0, on->path_metricalgo->umetric_min);
ASSERTION( -500473, (0));
}
}
}
#endif
}
}
struct list_node *lpos, *tpos, *lprev = (struct list_node*) & ogm_aggreg_list;
list_for_each_safe(lpos, tpos, &ogm_aggreg_list)
{
struct ogm_aggreg_node *oan = list_entry(lpos, struct ogm_aggreg_node, list);
if (purge_all || oan->tx_attempt >= ogm_adv_tx_iters) {
list_del_next(&ogm_aggreg_list, lprev);
debugFree(oan->ogm_advs, -300183);
debugFree(oan, -300184);
continue;
} else if (oan->tx_attempt < ogm_adv_tx_iters) {
struct link_dev_node **lndev_arr = lndevs_get_unacked_ogm_neighbors(oan);
int d;
oan->tx_attempt = (lndev_arr[0]) ? (oan->tx_attempt + 1) : ogm_adv_tx_iters;
for (d = 0; (lndev_arr[d]); d++) {
schedule_tx_task((lndev_arr[d]), FRAME_TYPE_OGM_ADV,
((oan->aggregated_msgs * sizeof (struct msg_ogm_adv)) + oan->ogm_dest_bytes),
oan->sqn, 0, 0, 0);
}
assertion(-501319, (IMPLIES(d, (oan->aggregated_msgs))));
}
lprev = lpos;
}
}