2 Unix SMB/CIFS implementation.
6 Copyright (C) Andrew Tridgell 2005
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
24 #include "lib/events/events.h"
25 #include "libcli/resolve/resolve.h"
27 struct result_struct {
32 static void increment_handler(struct nbt_name_request *req)
34 struct result_struct *v = talloc_get_type(req->async.private, struct result_struct);
35 if (req->state != NBT_REQUEST_DONE) {
44 benchmark simple name queries
46 static BOOL bench_namequery(TALLOC_CTX *mem_ctx, struct nbt_name *name, const char *address)
48 struct nbt_name_socket *nbtsock = nbt_name_socket_init(mem_ctx, NULL);
50 struct result_struct *result;
51 struct nbt_name_query io;
52 struct timeval tv = timeval_current();
54 int timelimit = lp_parm_int(-1, "torture", "timelimit", 10);
57 io.in.dest_addr = address;
58 io.in.broadcast = False;
59 io.in.wins_lookup = False;
62 result = talloc_zero(mem_ctx, struct result_struct);
64 printf("Running for %d seconds\n", timelimit);
65 while (timeval_elapsed(&tv) < timelimit) {
66 while (num_sent - (result->num_pass+result->num_fail) < 10) {
67 struct nbt_name_request *req;
68 req = nbt_name_query_send(nbtsock, &io);
70 printf("Failed to setup request!\n");
74 req->async.fn = increment_handler;
75 req->async.private = result;
77 if (num_sent % 1000 == 0) {
78 printf("%.1f queries per second (%d failures) \r",
79 result->num_pass / timeval_elapsed(&tv),
84 event_loop_once(nbtsock->event_ctx);
87 while (num_sent != (result->num_pass + result->num_fail)) {
88 event_loop_once(nbtsock->event_ctx);
91 printf("%.1f queries per second (%d failures) \n",
92 result->num_pass / timeval_elapsed(&tv),
102 benchmark how fast a server can respond to name queries
104 BOOL torture_bench_nbt(void)
107 struct nbt_name name;
108 TALLOC_CTX *mem_ctx = talloc_new(NULL);
112 make_nbt_name_server(&name, lp_parm_string(-1, "torture", "host"));
114 /* do an initial name resolution to find its IP */
115 status = resolve_name(&name, mem_ctx, &address, event_context_find(mem_ctx));
116 if (!NT_STATUS_IS_OK(status)) {
117 printf("Failed to resolve %s - %s\n",
118 name.name, nt_errstr(status));
119 talloc_free(mem_ctx);
123 ret &= bench_namequery(mem_ctx, &name, address);
125 talloc_free(mem_ctx);