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
|
/* BGP Engine pThread -- header
* Copyright (C) 2009 Chris Hall (GMCH), Highwayman
*
* 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 GNU Zebra; see the file COPYING. If not, write to the
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*/
#ifndef _QUAGGA_BGP_ENGINE_H
#define _QUAGGA_BGP_ENGINE_H
#include "bgpd/bgpd.h"
#include "lib/mqueue.h"
#include "lib/qpnexus.h"
#include "lib/log.h"
#ifndef Inline
#define Inline static inline
#endif
/*==============================================================================
*
*/
static unsigned bgp_engine_queue_thresh_up = 0 ;
static unsigned bgp_engine_queue_thresh_down = 0 ;
static unsigned peering_engine_queue_thresh_up = 0 ;
static unsigned peering_engine_queue_thresh_down = 0 ;
Inline void
bgp_queue_logging(const char* name, unsigned count, unsigned* up,
unsigned* down)
{
if (count > *up)
{
if (*up != 0)
{
zlog_debug("%s queue up to %u entries", name, count) ;
*up *= 2 ;
*down = *up / 4 ;
}
else
*up = 32 ;
} ;
if (count < *down)
{
zlog_debug("%s queue down to %u entries", name, count) ;
if (*up == 32)
*down = 0 ;
else
{
*up /= 2 ;
*down = *up / 2 ;
} ;
} ; ;
} ;
/* Send given message to the BGP Engine -- ordinary
*/
Inline void
bgp_to_bgp_engine(mqueue_block mqb)
{
mqueue_enqueue(bgp_nexus->queue, mqb, 0) ;
bgp_queue_logging("BGP Engine", bgp_nexus->queue->count,
&bgp_engine_queue_thresh_up, &bgp_engine_queue_thresh_down) ;
} ;
/* Send given message to the BGP Engine -- priority
*/
Inline void
bgp_to_bgp_engine_priority(mqueue_block mqb)
{
mqueue_enqueue(bgp_nexus->queue, mqb, 1) ;
bgp_queue_logging("BGP Engine", bgp_nexus->queue->count,
&bgp_engine_queue_thresh_up, &bgp_engine_queue_thresh_down) ;
} ;
/*==============================================================================
*
*/
/* Send given message to the Peering Engine -- ordinary
*/
Inline void
bgp_to_peering_engine(mqueue_block mqb)
{
mqueue_enqueue(routing_nexus->queue, mqb, 0) ;
bgp_queue_logging("Peering Engine", routing_nexus->queue->count,
&peering_engine_queue_thresh_up, &peering_engine_queue_thresh_down) ;
} ;
/* Send given message to the Peering Engine -- priority
*/
Inline void
bgp_to_peering_engine_priority(mqueue_block mqb)
{
mqueue_enqueue(routing_nexus->queue, mqb, 1) ;
bgp_queue_logging("Peering Engine", routing_nexus->queue->count,
&peering_engine_queue_thresh_up, &peering_engine_queue_thresh_down) ;
} ;
#endif /* QUAGGA_BGP_ENGINE_H */
|
