ospfd: Discriminate better when selecting links between vertices in SPF
[jleu-quagga.git] / tests / heavy-thread.c
blobcd3a3b9d0f9b8a3a6a3c58a9ac22be04a5714fa9
1 /*
2 * $Id: heavy-thread.c,v 1.2 2005/04/25 16:42:24 paul Exp $
4 * This file is part of Quagga.
6 * Quagga is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License as published by the
8 * Free Software Foundation; either version 2, or (at your option) any
9 * later version.
11 * Quagga is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with Quagga; see the file COPYING. If not, write to the Free
18 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
19 * 02111-1307, USA.
22 /* This programme shows the effects of 'heavy' long-running functions
23 * on the cooperative threading model, as demonstrated by heavy.c, and how
24 * they can be mitigated using a background thread.
26 * Run it with a config file containing 'password whatever', telnet to it
27 * (it defaults to port 4000) and enter the 'clear foo string' command.
28 * then type whatever and observe that, unlike heavy.c, the vty interface
29 * remains responsive.
31 #include <zebra.h>
32 #include <math.h>
34 #include "thread.h"
35 #include "vty.h"
36 #include "command.h"
37 #include "memory.h"
38 #include "log.h"
40 extern struct thread_master *master;
42 enum
44 ITERS_FIRST = 0,
45 ITERS_ERR = 100,
46 ITERS_LATER = 400,
47 ITERS_PRINT = 10,
48 ITERS_MAX = 1000,
51 struct work_state {
52 struct vty *vty;
53 char *str;
54 int i;
57 static void
58 slow_func (struct vty *vty, const char *str, const int i)
60 double x = 1;
61 int j;
63 for (j = 0; j < 300; j++)
64 x += sin(x)*j;
66 if ((i % ITERS_LATER) == 0)
67 printf ("%s: %d, temporary error, save this somehow and do it later..\n",
68 __func__, i);
70 if ((i % ITERS_ERR) == 0)
71 printf ("%s: hard error\n", __func__);
73 if ((i % ITERS_PRINT) == 0)
74 printf ("%s did %d, x = %g\n", str, i, x);
77 static int
78 clear_something (struct thread *thread)
80 struct work_state *ws = THREAD_ARG(thread);
82 /* this could be like iterating through 150k of route_table
83 * or worse, iterating through a list of peers, to bgp_stop them with
84 * each having 150k route tables to process...
86 while (ws->i < ITERS_MAX)
88 slow_func(ws->vty, ws->str, ws->i);
89 ws->i++;
90 if (thread_should_yield(thread))
92 thread_add_background(master, clear_something, ws, 0);
93 return 0;
97 /* All done! */
98 XFREE (MTYPE_TMP, ws->str);
99 XFREE (MTYPE_TMP, ws);
100 return 0;
103 DEFUN (clear_foo,
104 clear_foo_cmd,
105 "clear foo .LINE",
106 "clear command\n"
107 "arbitrary string\n")
109 char *str;
110 struct work_state *ws;
112 if (!argc)
114 vty_out (vty, "%% string argument required%s", VTY_NEWLINE);
115 return CMD_WARNING;
118 str = argv_concat (argv, argc, 0);
120 if ((ws = XMALLOC(MTYPE_TMP, sizeof(*ws))) == NULL)
122 zlog_err ("%s: unable to allocate work_state", __func__);
123 return CMD_WARNING;
126 if (!(ws->str = XSTRDUP (MTYPE_TMP, str)))
128 zlog_err ("%s: unable to xstrdup", __func__);
129 XFREE (MTYPE_TMP, ws);
130 return CMD_WARNING;
133 ws->vty = vty;
134 ws->i = ITERS_FIRST;
136 thread_add_background(master, clear_something, ws, 0);
138 return CMD_SUCCESS;
141 void
142 test_init()
144 install_element (VIEW_NODE, &clear_foo_cmd);