mirror of
https://git.proxmox.com/git/mirror_frr
synced 2025-11-04 04:50:35 +00:00
e92508a741
The prefix_master->str data structure was a sorted list of the prefix names. Not that big of a deal other than insertion and deletion is insanely expensive when you have a large number of unique prefix-lists. In my test config file that I discovered this, I have 587 unique prefix lists spread out acros ~26k lines of prefix-lists. When reading this config file into FRR the read time goes from 690 seconds to 650 seconds. Signed-off-by: Donald Sharp <sharpd@nvidia.com>
87 lines
2.0 KiB
C
87 lines
2.0 KiB
C
/*
|
|
* Prefix list internal definitions.
|
|
* Copyright (C) 1999 Kunihiro Ishiguro
|
|
*
|
|
* This file is part of GNU Zebra.
|
|
*
|
|
* GNU Zebra 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, or (at your
|
|
* option) any later version.
|
|
*
|
|
* GNU Zebra 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
|
|
*/
|
|
|
|
#ifndef _QUAGGA_PLIST_INT_H
|
|
#define _QUAGGA_PLIST_INT_H
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
struct pltrie_table;
|
|
|
|
PREDECL_RBTREE_UNIQ(plist);
|
|
|
|
struct prefix_list {
|
|
char *name;
|
|
char *desc;
|
|
|
|
struct prefix_master *master;
|
|
|
|
int count;
|
|
int rangecount;
|
|
|
|
struct plist_item plist_item;
|
|
|
|
struct prefix_list_entry *head;
|
|
struct prefix_list_entry *tail;
|
|
|
|
struct pltrie_table *trie;
|
|
};
|
|
|
|
/* Each prefix-list's entry. */
|
|
struct prefix_list_entry {
|
|
int64_t seq;
|
|
|
|
int le;
|
|
int ge;
|
|
|
|
enum prefix_list_type type;
|
|
|
|
bool any;
|
|
struct prefix prefix;
|
|
|
|
unsigned long refcnt;
|
|
unsigned long hitcnt;
|
|
|
|
struct prefix_list *pl;
|
|
|
|
struct prefix_list_entry *next;
|
|
struct prefix_list_entry *prev;
|
|
|
|
/* up the chain for best match search */
|
|
struct prefix_list_entry *next_best;
|
|
|
|
/* Flag to track trie/list installation status. */
|
|
bool installed;
|
|
};
|
|
|
|
extern void prefix_list_entry_free(struct prefix_list_entry *pentry);
|
|
extern void prefix_list_entry_delete2(struct prefix_list_entry *ple);
|
|
extern void prefix_list_entry_update_start(struct prefix_list_entry *ple);
|
|
extern void prefix_list_entry_update_finish(struct prefix_list_entry *ple);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif /* _QUAGGA_PLIST_INT_H */
|