-
Notifications
You must be signed in to change notification settings - Fork 328
Expand file tree
/
Copy pathtree_data_sorted.c
More file actions
1742 lines (1531 loc) · 52.6 KB
/
tree_data_sorted.c
File metadata and controls
1742 lines (1531 loc) · 52.6 KB
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
/**
* @file tree_data_sorted.c
* @author Adam Piecek <piecek@cesnet.cz>
* @brief Red-black tree implementation from FRRouting project (https://github.com/FRRouting/frr).
*
* The effort of this implementation was to take the working Red-black tree implementation
* and adapt its interface to libyang.
*
* Copyright (c) 2015 - 2023 CESNET, z.s.p.o.
*
* This source code is licensed under BSD 3-Clause License (the "License").
* You may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://opensource.org/licenses/BSD-3-Clause
*/
// SPDX-License-Identifier: ISC AND BSD-2-Clause
/* $OpenBSD: subr_tree.c,v 1.9 2017/06/08 03:30:52 dlg Exp $ */
/*
* Copyright 2002 Niels Provos <provos@citi.umich.edu>
* Copyright (c) 2016 David Gwynne <dlg@openbsd.org>
*/
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include "dict.h"
#include "log.h"
#include "ly_common.h"
#include "metadata.h"
#include "plugins_internal.h"
#include "plugins_types.h"
#include "tree.h"
#include "tree_data.h"
#include "tree_data_internal.h"
#include "tree_data_sorted.h"
/*
metadata (root_meta)
^ |________
| |
| v --
| _____rbt__ |
| | | | |
| v | v |
| _rbn_ | _rbn_____ | BST
| | | | | | (Red-black tree)
| ___| | | v |
| | _____| | _rbn_ |
| | | | | --
| v v v v
... lyd1<-->lyd2<-->lyd3<-->lyd4 ...
(leader)
| |
|_____________________________|
(leaf-)list
The (leaf-)list consists of data nodes (lyd). The first instance of the (leaf-)list is named leader,
which contains metadata named 'lyds_tree'. This metadata has a reference to the root of the Red-black tree.
This tree consists of nodes named 'rbn'. Each of these nodes contains a reference to a left or right child,
as well as a reference to a data node.
*/
/*
* A red-black tree is a binary search tree (BST) with the node color as an
* extra attribute. It fulfills a set of conditions:
* - every search path from the root to a leaf consists of the same number of black nodes,
* - each red node (except for the root) has a black parent,
* - each leaf node is black.
*
* Every operation on a red-black tree is bounded as O(lg n).
* The maximum height of a red-black tree is 2lg (n+1).
*/
#define RB_BLACK 0 /**< black node in a red-black tree */
#define RB_RED 1 /**< red node in a red-black tree */
/**
* @brief Red-black node
*/
struct rb_node {
struct rb_node *parent; /**< parent node (NULL if this is a root node) */
struct rb_node *left; /**< left node with a lower value */
struct rb_node *right; /**< left node with a greater value */
struct lyd_node *dnode; /**< assigned libyang data node */
uint8_t color; /**< color for red-black node */
};
/**
* @defgroup rbngetters Macros for accessing members.
*
* Useful if there is a need to reduce the memory space for red-black nodes in the future. The color bit can be hidden
* in some (parent/left/right) pointer and their true values can be obtained by masking. This saves 8 bytes, but there
* is no guarantee that the code will be cross-platform.
*
* @{
*/
#define RBN_LEFT(NODE) ((NODE)->left)
#define RBN_RIGHT(NODE) ((NODE)->right)
#define RBN_PARENT(NODE) ((NODE)->parent)
#define RBN_DNODE(NODE) ((NODE)->dnode)
#define RBN_COLOR(NODE) ((NODE)->color)
/** @} rbngetters */
/**
* @brief Rewrite members from @p SRC to @p DST.
*
* @param[in] DST Destination node.
* @param[in] SRC Source node.
*/
#define RBN_COPY(DST, SRC) \
RBN_PARENT(DST) = RBN_PARENT(SRC); \
RBN_LEFT(DST) = RBN_LEFT(SRC); \
RBN_RIGHT(DST) = RBN_RIGHT(SRC); \
RBN_COLOR(DST) = RBN_COLOR(SRC);
/**
* @brief Reset the red-black node and set new dnode.
*
* @param[in] RBN Node to reset.
* @param[in] DNODE New dnode value for @p rbn.
*/
#define RBN_RESET(RBN, DNODE) \
*(RBN) = (const struct rb_node){0}; \
RBN_DNODE(RBN) = DNODE;
/**
* @brief Get red-black root from metadata.
*
* @param[in] META Pointer to the struct lyd_meta.
* @param[out] RBT Root of the Red-black tree.
*/
#define RBT_GET(META, RBT) \
{ \
struct lyd_value_lyds_tree *_lt; \
LYD_VALUE_GET(&META->value, _lt); \
RBT = _lt ? _lt->rbt : NULL; \
}
/**
* @brief Set a new red-black root to the metadata.
*
* @param[in] META Pointer to the struct lyd_meta.
* @param[in] RBT Root of the Red-black tree.
*/
#define RBT_SET(META, RBT) \
{ \
struct lyd_value_lyds_tree *_lt; \
LYD_VALUE_GET(&META->value, _lt); \
_lt->rbt = RBT; \
}
/**
* @brief Get Red-black tree from data node.
*
* @param[in] leader First instance of the (leaf-)list in sequence.
* @param[out] meta Metadata from which the Red-black tree was obtained. The parameter is optional.
* @return Root of the Red-black tree or NULL.
*/
static struct rb_node *
lyds_get_rb_tree(const struct lyd_node *leader, struct lyd_meta **meta)
{
struct rb_node *rbt;
struct lyd_meta *iter;
if (meta) {
*meta = NULL;
}
LY_LIST_FOR(leader->meta, iter) {
if (!strcmp(iter->name, "lyds_tree")) {
if (meta) {
*meta = iter;
}
RBT_GET(iter, rbt);
return rbt;
}
}
return NULL;
}
/**
* @brief Call plugins_types sort callback or sort values by plugin order.
*
* @param[in] ctx libyang context.
* @param[in] val1 First value to compare.
* @param[in] val2 Second value to compare.
* @return Negative number if val1 < val2,
* @return Zero if val1 == val2,
* @return Positive number if val1 > val2.
*/
static int
rb_sort_clb(const struct ly_ctx *ctx, const struct lyd_value *val1, const struct lyd_value *val2)
{
assert(val1->realtype == val2->realtype);
return LYSC_GET_TYPE_PLG(val1->realtype->plugin_ref)->sort(ctx, val1, val2);
}
/**
* @brief Compare red-black nodes by rb_node.dnode from the same Red-black tree.
*
* @param[in] n1 First leaf-list data node.
* @param[in] n2 Second leaf-list data node.
* @return Negative number if val1 < val2,
* @return Zero if val1 == val2,
* @return Positive number if val1 > val2.
*/
static int
rb_compare_leaflists(const struct lyd_node *n1, const struct lyd_node *n2)
{
struct lyd_value *val1, *val2;
/* compare leaf-list values */
assert(n2->schema->nodetype == LYS_LEAFLIST);
assert(n1->schema->nodetype == LYS_LEAFLIST);
val1 = &((struct lyd_node_term *)n1)->value;
val2 = &((struct lyd_node_term *)n2)->value;
return rb_sort_clb(LYD_CTX(n1), val1, val2);
}
/**
* @brief Compare red-black nodes by rb_node.dnode from the same Red-black tree.
*
* @param[in] n1 First list data node.
* @param[in] n2 Second list data node.
* @return Negative number if val1 < val2,
* @return Zero if val1 == val2,
* @return Positive number if val1 > val2.
*/
static int
rb_compare_lists(const struct lyd_node *n1, const struct lyd_node *n2)
{
const struct lyd_node *k1, *k2;
struct lyd_value *val1, *val2;
int cmp;
/* compare first list key */
assert(n1->schema->nodetype & LYS_LIST);
assert(n2->schema->nodetype & LYS_LIST);
/* lyd_child() is not called due to optimization */
k1 = ((const struct lyd_node_inner *)n1)->child;
k2 = ((const struct lyd_node_inner *)n2)->child;
val1 = &((struct lyd_node_term *)k1)->value;
val2 = &((struct lyd_node_term *)k2)->value;
cmp = rb_sort_clb(LYD_CTX(n1), val1, val2);
if (cmp != 0) {
return cmp;
}
/* continue with the next keys */
k1 = k1->next;
k2 = k2->next;
while (k1 && k1->schema && (k1->schema->flags & LYS_KEY)) {
assert(k1->schema == k2->schema);
val1 = &((struct lyd_node_term *)k1)->value;
val2 = &((struct lyd_node_term *)k2)->value;
cmp = rb_sort_clb(LYD_CTX(n1), val1, val2);
if (cmp != 0) {
return cmp;
}
k1 = k1->next;
k2 = k2->next;
}
return cmp;
}
/**
* @brief Release unlinked red-black node.
*
* @param[in,out] rbn Node to free, is set to NULL.
*/
static void
rb_free_node(struct rb_node **rbn)
{
free(*rbn);
*rbn = NULL;
}
/**
* @brief Traversing all red-black nodes.
*
* Traversal order is not the same as traversing data nodes.
* The rb_next() is available for browsing in a sorted manner.
*
* @param[in] current_state Current state of iterator.
* @param[out] next_state The updated state of the iterator.
* @return Next node or the first node.
*/
static struct rb_node *
rb_iter_traversal(struct rb_node *current_state, struct rb_node **next_state)
{
struct rb_node *iter, *parent, *next;
for (iter = current_state; iter; iter = next) {
if (RBN_LEFT(iter)) {
next = RBN_LEFT(iter);
continue;
} else if (RBN_RIGHT(iter)) {
next = RBN_RIGHT(iter);
continue;
}
*next_state = parent = RBN_PARENT(iter);
if (parent && (RBN_LEFT(parent) == iter)) {
RBN_LEFT(parent) = NULL;
} else if (parent && (RBN_RIGHT(parent) == iter)) {
RBN_RIGHT(parent) = NULL;
}
return iter;
}
return NULL;
}
/**
* @brief Iterator initialization for traversing red-black tree.
*
* @param[in] rbt Root of the Red-black tree.
* @param[out] iter_state Iterator state which must be maintained during browsing.
* @return First node.
*/
static struct rb_node *
rb_iter_begin(struct rb_node *rbt, struct rb_node **iter_state)
{
return rb_iter_traversal(rbt, iter_state);
}
/**
* @brief Get the following node when traversing red-black tree.
*
* @param[in,out] iter_state Iterator state which must be maintained during browsing.
* @return Next node.
*/
static struct rb_node *
rb_iter_next(struct rb_node **iter_state)
{
return rb_iter_traversal(*iter_state, iter_state);
}
void
lyds_free_tree(struct rb_node *rbt)
{
struct rb_node *rbn, *iter_state;
/* There is no rebalancing. */
for (rbn = rb_iter_begin(rbt, &iter_state); rbn; rbn = rb_iter_next(&iter_state)) {
rb_free_node(&rbn);
}
}
static void
rb_set(struct rb_node *rbn, struct rb_node *parent)
{
RBN_PARENT(rbn) = parent;
RBN_LEFT(rbn) = RBN_RIGHT(rbn) = NULL;
RBN_COLOR(rbn) = RB_RED;
}
static void
rb_set_blackred(struct rb_node *black, struct rb_node *red)
{
RBN_COLOR(black) = RB_BLACK;
RBN_COLOR(red) = RB_RED;
}
static void
rb_rotate_left(struct rb_node **rbt, struct rb_node *rbn)
{
struct rb_node *parent;
struct rb_node *tmp;
tmp = RBN_RIGHT(rbn);
RBN_RIGHT(rbn) = RBN_LEFT(tmp);
if (RBN_RIGHT(rbn) != NULL) {
RBN_PARENT(RBN_LEFT(tmp)) = rbn;
}
parent = RBN_PARENT(rbn);
RBN_PARENT(tmp) = parent;
if (parent != NULL) {
if (rbn == RBN_LEFT(parent)) {
RBN_LEFT(parent) = tmp;
} else {
RBN_RIGHT(parent) = tmp;
}
} else {
*rbt = tmp;
}
RBN_LEFT(tmp) = rbn;
RBN_PARENT(rbn) = tmp;
}
static void
rb_rotate_right(struct rb_node **rbt, struct rb_node *rbn)
{
struct rb_node *parent;
struct rb_node *tmp;
tmp = RBN_LEFT(rbn);
RBN_LEFT(rbn) = RBN_RIGHT(tmp);
if (RBN_LEFT(rbn) != NULL) {
RBN_PARENT(RBN_RIGHT(tmp)) = rbn;
}
parent = RBN_PARENT(rbn);
RBN_PARENT(tmp) = parent;
if (parent != NULL) {
if (rbn == RBN_LEFT(parent)) {
RBN_LEFT(parent) = tmp;
} else {
RBN_RIGHT(parent) = tmp;
}
} else {
*rbt = tmp;
}
RBN_RIGHT(tmp) = rbn;
RBN_PARENT(rbn) = tmp;
}
static void
rb_insert_color(struct rb_node **rbt, struct rb_node *rbn)
{
struct rb_node *parent, *gparent, *tmp;
while ((parent = RBN_PARENT(rbn)) != NULL &&
RBN_COLOR(parent) == RB_RED) {
gparent = RBN_PARENT(parent);
if (parent == RBN_LEFT(gparent)) {
tmp = RBN_RIGHT(gparent);
if ((tmp != NULL) && (RBN_COLOR(tmp) == RB_RED)) {
RBN_COLOR(tmp) = RB_BLACK;
rb_set_blackred(parent, gparent);
rbn = gparent;
continue;
}
if (RBN_RIGHT(parent) == rbn) {
rb_rotate_left(rbt, parent);
tmp = parent;
parent = rbn;
rbn = tmp;
}
rb_set_blackred(parent, gparent);
rb_rotate_right(rbt, gparent);
} else {
tmp = RBN_LEFT(gparent);
if ((tmp != NULL) && (RBN_COLOR(tmp) == RB_RED)) {
RBN_COLOR(tmp) = RB_BLACK;
rb_set_blackred(parent, gparent);
rbn = gparent;
continue;
}
if (RBN_LEFT(parent) == rbn) {
rb_rotate_right(rbt, parent);
tmp = parent;
parent = rbn;
rbn = tmp;
}
rb_set_blackred(parent, gparent);
rb_rotate_left(rbt, gparent);
}
}
RBN_COLOR(*rbt) = RB_BLACK;
}
static void
rb_remove_color(struct rb_node **rbt, struct rb_node *parent, struct rb_node *rbn)
{
struct rb_node *tmp;
while ((rbn == NULL || RBN_COLOR(rbn) == RB_BLACK) &&
rbn != *rbt && parent) {
if (RBN_LEFT(parent) == rbn) {
tmp = RBN_RIGHT(parent);
if (RBN_COLOR(tmp) == RB_RED) {
rb_set_blackred(tmp, parent);
rb_rotate_left(rbt, parent);
tmp = RBN_RIGHT(parent);
}
if (((RBN_LEFT(tmp) == NULL) ||
(RBN_COLOR(RBN_LEFT(tmp)) == RB_BLACK)) &&
((RBN_RIGHT(tmp) == NULL) ||
(RBN_COLOR(RBN_RIGHT(tmp)) == RB_BLACK))) {
RBN_COLOR(tmp) = RB_RED;
rbn = parent;
parent = RBN_PARENT(rbn);
} else {
if ((RBN_RIGHT(tmp) == NULL) ||
(RBN_COLOR(RBN_RIGHT(tmp)) == RB_BLACK)) {
struct rb_node *oleft;
oleft = RBN_LEFT(tmp);
if (oleft != NULL) {
RBN_COLOR(oleft) = RB_BLACK;
}
RBN_COLOR(tmp) = RB_RED;
rb_rotate_right(rbt, tmp);
tmp = RBN_RIGHT(parent);
}
RBN_COLOR(tmp) = RBN_COLOR(parent);
RBN_COLOR(parent) = RB_BLACK;
if (RBN_RIGHT(tmp)) {
RBN_COLOR(RBN_RIGHT(tmp)) = RB_BLACK;
}
rb_rotate_left(rbt, parent);
rbn = *rbt;
break;
}
} else {
tmp = RBN_LEFT(parent);
if (RBN_COLOR(tmp) == RB_RED) {
rb_set_blackred(tmp, parent);
rb_rotate_right(rbt, parent);
tmp = RBN_LEFT(parent);
}
if (((RBN_LEFT(tmp) == NULL) ||
(RBN_COLOR(RBN_LEFT(tmp)) == RB_BLACK)) &&
((RBN_RIGHT(tmp) == NULL) ||
(RBN_COLOR(RBN_RIGHT(tmp)) == RB_BLACK))) {
RBN_COLOR(tmp) = RB_RED;
rbn = parent;
parent = RBN_PARENT(rbn);
} else {
if ((RBN_LEFT(tmp) == NULL) ||
(RBN_COLOR(RBN_LEFT(tmp)) == RB_BLACK)) {
struct rb_node *oright;
oright = RBN_RIGHT(tmp);
if (oright != NULL) {
RBN_COLOR(oright) = RB_BLACK;
}
RBN_COLOR(tmp) = RB_RED;
rb_rotate_left(rbt, tmp);
tmp = RBN_LEFT(parent);
}
RBN_COLOR(tmp) = RBN_COLOR(parent);
RBN_COLOR(parent) = RB_BLACK;
if (RBN_LEFT(tmp) != NULL) {
RBN_COLOR(RBN_LEFT(tmp)) = RB_BLACK;
}
rb_rotate_right(rbt, parent);
rbn = *rbt;
break;
}
}
}
if (rbn != NULL) {
RBN_COLOR(rbn) = RB_BLACK;
}
}
/**
* @brief Remove node from the Red-black tree.
*
* @param[in,out] rbt Root of the Red-black tree. After the @p rbn is removed, the root may change.
* @param[in] rbn Node to remove.
* @return Removed node from the Red-black tree.
*/
static struct rb_node *
rb_remove(struct rb_node **rbt, struct rb_node *rbn)
{
struct rb_node *child, *parent, *old = rbn;
uint8_t color;
if (RBN_LEFT(rbn) == NULL) {
child = RBN_RIGHT(rbn);
} else if (RBN_RIGHT(rbn) == NULL) {
child = RBN_LEFT(rbn);
} else {
struct rb_node *tmp;
rbn = RBN_RIGHT(rbn);
while ((tmp = RBN_LEFT(rbn)) != NULL) {
rbn = tmp;
}
child = RBN_RIGHT(rbn);
parent = RBN_PARENT(rbn);
color = RBN_COLOR(rbn);
if (child != NULL) {
RBN_PARENT(child) = parent;
}
if (parent != NULL) {
if (RBN_LEFT(parent) == rbn) {
RBN_LEFT(parent) = child;
} else {
RBN_RIGHT(parent) = child;
}
} else {
*rbt = child;
}
if (RBN_PARENT(rbn) == old) {
parent = rbn;
}
RBN_COPY(rbn, old);
tmp = RBN_PARENT(old);
if (tmp != NULL) {
if (RBN_LEFT(tmp) == old) {
RBN_LEFT(tmp) = rbn;
} else {
RBN_RIGHT(tmp) = rbn;
}
} else {
*rbt = rbn;
}
RBN_PARENT(RBN_LEFT(old)) = rbn;
if (RBN_RIGHT(old)) {
RBN_PARENT(RBN_RIGHT(old)) = rbn;
}
goto color;
}
parent = RBN_PARENT(rbn);
color = RBN_COLOR(rbn);
if (child != NULL) {
RBN_PARENT(child) = parent;
}
if (parent != NULL) {
if (RBN_LEFT(parent) == rbn) {
RBN_LEFT(parent) = child;
} else {
RBN_RIGHT(parent) = child;
}
} else {
*rbt = child;
}
color:
if (color == RB_BLACK) {
rb_remove_color(rbt, parent, child);
}
return old;
}
/**
* @brief Insert new node to the Red-black tree.
*
* @param[in,out] rbt Root of the Red-black tree. After the @p rbn is inserted, the root may change.
* @param[in] rbn Node to insert.
* @param[out] max_p Set to 1 if the inserted node will also be maximum.
*/
static void
rb_insert_node(struct rb_node **rbt, struct rb_node *rbn, ly_bool *max_p)
{
ly_bool max;
struct rb_node *tmp;
struct rb_node *parent = NULL;
int comp = 0;
int (*rb_compare)(const struct lyd_node *n1, const struct lyd_node *n2);
if (RBN_DNODE(*rbt)->schema->nodetype == LYS_LEAFLIST) {
rb_compare = rb_compare_leaflists;
} else {
rb_compare = rb_compare_lists;
}
max = 1;
tmp = *rbt;
while (tmp != NULL) {
parent = tmp;
comp = rb_compare(RBN_DNODE(tmp), RBN_DNODE(rbn));
if (comp > 0) {
tmp = RBN_LEFT(tmp);
max = 0;
} else {
tmp = RBN_RIGHT(tmp);
}
}
rb_set(rbn, parent);
if (parent != NULL) {
if (comp > 0) {
RBN_LEFT(parent) = rbn;
} else {
RBN_RIGHT(parent) = rbn;
}
} else {
*rbt = rbn;
}
rb_insert_color(rbt, rbn);
if (max_p) {
*max_p = max;
}
}
/**
* @brief Return the first lesser node (previous).
*
* @param[in] rbn Node from which the previous node is wanted.
* @return Return the first lesser node.
* @return NULL if @p rbn has the least value.
*/
static struct rb_node *
rb_prev(struct rb_node *rbn)
{
if (RBN_LEFT(rbn)) {
rbn = RBN_LEFT(rbn);
while (RBN_RIGHT(rbn)) {
rbn = RBN_RIGHT(rbn);
}
} else {
if (RBN_PARENT(rbn) && (rbn == RBN_RIGHT(RBN_PARENT(rbn)))) {
rbn = RBN_PARENT(rbn);
} else {
while (RBN_PARENT(rbn) &&
(rbn == RBN_LEFT(RBN_PARENT(rbn)))) {
rbn = RBN_PARENT(rbn);
}
rbn = RBN_PARENT(rbn);
}
}
return rbn;
}
/**
* @brief Return the first greater node (next).
*
* @param[in] rbn Node from which the next node is wanted.
* @return Return the first greater node.
* @return NULL if @p rbn has the greatest value.
*/
static struct rb_node *
rb_next(struct rb_node *rbn)
{
if (RBN_RIGHT(rbn) != NULL) {
rbn = RBN_RIGHT(rbn);
while (RBN_LEFT(rbn) != NULL) {
rbn = RBN_LEFT(rbn);
}
} else {
if (RBN_PARENT(rbn) && (rbn == RBN_LEFT(RBN_PARENT(rbn)))) {
rbn = RBN_PARENT(rbn);
} else {
while (RBN_PARENT(rbn) &&
(rbn == RBN_RIGHT(RBN_PARENT(rbn)))) {
rbn = RBN_PARENT(rbn);
}
rbn = RBN_PARENT(rbn);
}
}
return rbn;
}
/**
* @brief Find @p target value in the Red-black tree.
*
* @param[in] rbt Root of the Red-black tree.
* @param[in] target Node containing the value to find.
* @return red-black node which contains the same value as @p target or NULL.
*/
static struct rb_node *
rb_find(struct rb_node *rbt, struct lyd_node *target)
{
struct rb_node *iter, *pivot;
int comp;
int (*rb_compare)(const struct lyd_node *n1, const struct lyd_node *n2);
if (RBN_DNODE(rbt) == target) {
return rbt;
}
if (RBN_DNODE(rbt)->schema->nodetype == LYS_LEAFLIST) {
rb_compare = rb_compare_leaflists;
} else {
rb_compare = rb_compare_lists;
}
iter = rbt;
do {
comp = rb_compare(RBN_DNODE(iter), target);
if (comp > 0) {
iter = RBN_LEFT(iter);
} else if (comp < 0) {
iter = RBN_RIGHT(iter);
} else if (RBN_DNODE(iter) == target) {
return iter;
} else {
/* sequential search in nodes having the same value */
pivot = iter;
/* search in predecessors */
for (iter = rb_prev(pivot); iter; iter = rb_prev(iter)) {
if (rb_compare(RBN_DNODE(iter), target) != 0) {
break;
} else if (RBN_DNODE(iter) == target) {
return iter;
}
}
/* search in successors */
for (iter = rb_next(pivot); iter; iter = rb_next(iter)) {
if (rb_compare(RBN_DNODE(iter), target) != 0) {
break;
} else if (RBN_DNODE(iter) == target) {
return iter;
}
}
/* node not found */
break;
}
} while (iter != NULL);
return NULL;
}
LY_ERR
lyds_create_node(struct lyd_node *node, struct rb_node **rbn)
{
*rbn = calloc(1, sizeof **rbn);
LY_CHECK_ERR_RET(!(*rbn), LOGERR(LYD_CTX(node), LY_EMEM, "Allocation of red-black node failed."), LY_EMEM);
RBN_DNODE(*rbn) = node;
return LY_SUCCESS;
}
void
lyds_pool_add(struct lyd_node *leader, struct lyds_pool *pool)
{
struct rb_node *rbt;
struct lyd_meta *root_meta, *tmp;
assert(pool && leader);
rbt = lyds_get_rb_tree(leader, &root_meta);
if (root_meta) {
lyd_unlink_meta_single(root_meta);
if (pool->meta) {
tmp = pool->meta;
pool->meta = root_meta;
root_meta->next = tmp;
} else {
pool->meta = root_meta;
}
}
if (!rbt) {
return;
}
if (pool->rbn) {
RBN_RESET(pool->rbn, NULL);
}
if (pool->iter_state) {
/* insert rbn back */
assert(pool->rbn);
if (RBN_LEFT(pool->iter_state)) {
assert(!RBN_RIGHT(pool->iter_state));
RBN_RIGHT(pool->iter_state) = pool->rbn;
} else {
assert(!RBN_LEFT(pool->iter_state));
RBN_LEFT(pool->iter_state) = pool->rbn;
}
RBN_PARENT(pool->rbn) = pool->iter_state;
}
if (pool->rbn) {
/* link rbt with rbn */
RBN_LEFT(pool->rbn) = rbt;
RBN_PARENT(rbt) = pool->rbn;
pool->rbn = rb_iter_begin(rbt, &pool->iter_state);
} else {
/* set new red black tree */
pool->rbn = rb_iter_begin(rbt, &pool->iter_state);
}
}
/**
* @brief Get metadata from the pool.
*
* @param[in,out] pool Pool containing metadata.
* @return Free metadata to reuse or NULL.
*/
static struct lyd_meta *
lyds_pool_get_meta(struct lyds_pool *pool)
{
struct lyd_meta *meta, *next;
if (!pool->meta) {
return NULL;
}
next = pool->meta->next;
meta = pool->meta;
meta->next = NULL;
pool->meta = next;
return meta;
}
void
lyds_pool_clean(struct lyds_pool *pool)
{
struct lyd_meta *meta, *next;
struct rb_node *iter;
for (iter = pool->rbn; iter; iter = rb_iter_next(&pool->iter_state)) {
rb_free_node(&iter);
}
pool->rbn = NULL;
for (meta = pool->meta; meta; meta = next) {
next = meta->next;
RBT_SET(meta, NULL);
lyd_free_meta_single(meta);
}
pool->meta = NULL;
}
/**
* @brief Remove red-black node from the Red-black tree using the data node.
*
* @param[in] root_meta Metadata from leader containing a reference to the Red-black tree.
* @param[in,out] rbt Root of the Red-black tree.
* @param[in] node Data node used to find the corresponding red-black node.
* @param[out] removed Removed node from Red-black tree. It can be deallocated or reset for further use.
*/
static void
rb_remove_node(struct lyd_meta *root_meta, struct rb_node **rbt, struct lyd_node *node, struct rb_node **removed)
{
struct rb_node *rbn;
assert(root_meta && rbt && node);
if (!*rbt) {
return;
}
/* find @p node in the Red-black tree. */
rbn = rb_find(*rbt, node);
if (!rbn) {
/* node was not inserted to the lyds tree due to optimization */
return;
}
assert(RBN_DNODE(rbn) == node);
/* remove node */
rbn = rb_remove(rbt, rbn);
*removed = rbn;
if (rbn == *rbt) {
/* rbn was the last node, assurance that root will be set to NULL */
*rbt = NULL;
}
/* the root of the Red-black tree may changed due to removal, so update the pointer to the root */
RBT_SET(root_meta, *rbt);
}
ly_bool
lyds_is_supported(const struct lyd_node *node)
{
if (!node->schema || !(node->schema->flags & LYS_ORDBY_SYSTEM)) {
return 0;
} else if (node->schema->nodetype == LYS_LEAFLIST) {
return 1;
} else if ((node->schema->nodetype == LYS_LIST) && !(node->schema->flags & LYS_KEYLESS)) {
return 1;
} else {
return 0;
}
}
/**
* @brief Unlink @p meta and insert it into @p dst data node.
*