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
|
/*
* Nexthop Group Private Functions.
* Copyright (C) 2019 Cumulus Networks, Inc.
* Stephen Worley
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2 of the License, or (at your option)
* any later version.
*
* 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; see the file COPYING; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/**
* These functions should only be used internally for nhg_hash_entry
* manipulation and in certain special cases.
*
* Please use `zebra/zebra_nhg.h` for any general nhg_hash_entry api needs.
*/
#ifndef __ZEBRA_NHG_PRIVATE_H__
#define __ZEBRA_NHG_PRIVATE_H__
#include "zebra/zebra_nhg.h"
#ifdef __cplusplus
extern "C" {
#endif
/* Abstraction for connected trees */
struct nhg_connected {
struct nhg_connected_tree_item tree_item;
struct nhg_hash_entry *nhe;
};
static int nhg_connected_cmp(const struct nhg_connected *con1,
const struct nhg_connected *con2)
{
return (con1->nhe->id - con2->nhe->id);
}
DECLARE_RBTREE_UNIQ(nhg_connected_tree, struct nhg_connected, tree_item,
nhg_connected_cmp);
/* nhg connected tree direct access functions */
extern void nhg_connected_tree_init(struct nhg_connected_tree_head *head);
extern void nhg_connected_tree_free(struct nhg_connected_tree_head *head);
extern bool
nhg_connected_tree_is_empty(const struct nhg_connected_tree_head *head);
extern struct nhg_connected *
nhg_connected_tree_root(struct nhg_connected_tree_head *head);
/* I realize _add/_del returns are backwords.
*
* Currently the list APIs are not standardized for what happens in
* the _del() function when the item isn't present.
*
* We are choosing to return NULL if not found in the _del case for now.
*/
/* Delete NHE from the tree. On success, return the NHE, otherwise NULL. */
extern struct nhg_hash_entry *
nhg_connected_tree_del_nhe(struct nhg_connected_tree_head *head,
struct nhg_hash_entry *nhe);
/* ADD NHE to the tree. On success, return NULL, otherwise return the NHE. */
extern struct nhg_hash_entry *
nhg_connected_tree_add_nhe(struct nhg_connected_tree_head *head,
struct nhg_hash_entry *nhe);
#ifdef __cplusplus
}
#endif
#endif /* __ZEBRA_NHG_PRIVATE_H__ */
|
