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
|
/*
* This file is part of Quagga.
*
* Quagga 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.
*
* Quagga 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
*/
/* This programme shows the effects of 'heavy' long-running functions
* on the cooperative threading model, as demonstrated by heavy.c, and how
* they can be mitigated using a background thread.
*
* Run it with a config file containing 'password whatever', telnet to it
* (it defaults to port 4000) and enter the 'clear foo string' command.
* then type whatever and observe that, unlike heavy.c, the vty interface
* remains responsive.
*/
#include <zebra.h>
#include <math.h>
#include "thread.h"
#include "vty.h"
#include "command.h"
#include "memory.h"
#include "log.h"
#include "tests.h"
extern struct thread_master *master;
enum { ITERS_FIRST = 0,
ITERS_ERR = 100,
ITERS_LATER = 400,
ITERS_PRINT = 10,
ITERS_MAX = 1000,
};
struct work_state {
struct vty *vty;
char *str;
int i;
};
static void slow_func(struct vty *vty, const char *str, const int i)
{
double x = 1;
int j;
for (j = 0; j < 300; j++)
x += sin(x) * j;
if ((i % ITERS_LATER) == 0)
printf("%s: %d, temporary error, save this somehow and do it later..\n",
__func__, i);
if ((i % ITERS_ERR) == 0)
printf("%s: hard error\n", __func__);
if ((i % ITERS_PRINT) == 0)
printf("%s did %d, x = %g\n", str, i, x);
}
static void clear_something(struct thread *thread)
{
struct work_state *ws = THREAD_ARG(thread);
/* this could be like iterating through 150k of route_table
* or worse, iterating through a list of peers, to bgp_stop them with
* each having 150k route tables to process...
*/
while (ws->i < ITERS_MAX) {
slow_func(ws->vty, ws->str, ws->i);
ws->i++;
if (thread_should_yield(thread)) {
thread_add_timer_msec(master, clear_something, ws, 0,
NULL);
return;
}
}
/* All done! */
XFREE(MTYPE_TMP, ws->str);
XFREE(MTYPE_TMP, ws);
}
DEFUN (clear_foo,
clear_foo_cmd,
"clear foo LINE...",
"clear command\n"
"arbitrary string\n")
{
char *str;
struct work_state *ws;
if (!argc) {
vty_out(vty, "%% string argument required\n");
return CMD_WARNING;
}
str = argv_concat(argv, argc, 0);
ws = XMALLOC(MTYPE_TMP, sizeof(*ws));
ws->str = XSTRDUP(MTYPE_TMP, str);
ws->vty = vty;
ws->i = ITERS_FIRST;
thread_add_timer_msec(master, clear_something, ws, 0, NULL);
return CMD_SUCCESS;
}
void test_init(void)
{
install_element(VIEW_NODE, &clear_foo_cmd);
}
|
