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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
/*
*
* Copyright 2014, Google Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
#include <string.h>
#include "src/core/statistics/census_interface.h"
#include "src/core/statistics/census_tracing.h"
#include "src/core/statistics/census_tracing.h"
#include <grpc/support/log.h>
#include <grpc/support/port_platform.h>
#include <grpc/support/sync.h>
#include <grpc/support/thd.h>
#include <grpc/support/time.h>
#include "test/core/util/test_config.h"
/* Ensure all possible state transitions are called without causing problem */
static void test_init_shutdown() {
census_tracing_init();
census_tracing_init();
census_tracing_shutdown();
census_tracing_shutdown();
census_tracing_init();
}
static void test_start_op_generates_locally_unique_ids() {
/* Check that ids generated within window size of 1000 are unique.
TODO(hongyu): Replace O(n^2) duplicate detection algorithm with O(nlogn)
algorithm. Enhance the test to larger window size (>10^6) */
#define WINDOW_SIZE 1000
census_op_id ids[WINDOW_SIZE];
int i;
census_init();
for (i = 0; i < WINDOW_SIZE; i++) {
ids[i] = census_tracing_start_op();
census_tracing_end_op(ids[i]);
}
for (i = 0; i < WINDOW_SIZE - 1; i++) {
int j;
for (j = i + 1; j < WINDOW_SIZE; j++) {
GPR_ASSERT(ids[i].upper != ids[j].upper || ids[i].lower != ids[j].lower);
}
}
#undef WINDOW_SIZE
census_shutdown();
}
static void test_get_trace_method_name() {
census_op_id id;
const char write_name[] = "service/method";
census_tracing_init();
id = census_tracing_start_op();
census_add_method_tag(id, write_name);
census_internal_lock_trace_store();
{
const char* read_name =
census_get_trace_method_name(census_get_trace_obj_locked(id));
GPR_ASSERT(strcmp(read_name, write_name) == 0);
}
census_internal_unlock_trace_store();
census_tracing_shutdown();
}
typedef struct thd_arg {
int num_done;
gpr_cv done;
gpr_mu mu;
} thd_arg;
static void mimic_trace_op_sequences(void* arg) {
census_op_id id;
const char* method_name = "service_foo/method_bar";
int i = 0;
const int num_iter = 200;
thd_arg* args = (thd_arg*)arg;
GPR_ASSERT(args != NULL);
gpr_log(GPR_INFO, "Start trace op sequence thread.");
for (i = 0; i < num_iter; i++) {
id = census_tracing_start_op();
census_add_method_tag(id, method_name);
/* pretend doing 1us work. */
gpr_sleep_until(gpr_time_add(gpr_now(), gpr_time_from_micros(1)));
census_tracing_end_op(id);
}
gpr_log(GPR_INFO, "End trace op sequence thread.");
gpr_mu_lock(&args->mu);
args->num_done += 1;
gpr_cv_broadcast(&args->done);
gpr_mu_unlock(&args->mu);
}
static void test_concurrency() {
#define NUM_THREADS 1000
gpr_thd_id tid[NUM_THREADS];
int i = 0;
thd_arg arg;
arg.num_done = 0;
gpr_mu_init(&arg.mu);
gpr_cv_init(&arg.done);
census_tracing_init();
for (i = 0; i < NUM_THREADS; ++i) {
gpr_thd_new(tid + i, mimic_trace_op_sequences, &arg, NULL);
}
while (arg.num_done < NUM_THREADS) {
gpr_log(GPR_INFO, "num done %d", arg.num_done);
gpr_cv_wait(&arg.done, &arg.mu, gpr_inf_future);
}
census_tracing_shutdown();
#undef NUM_THREADS
}
static void test_add_method_tag_to_unknown_op_id() {
census_op_id unknown_id = {0xDEAD, 0xBEEF};
int ret = 0;
census_tracing_init();
ret = census_add_method_tag(unknown_id, "foo");
GPR_ASSERT(ret != 0);
census_tracing_shutdown();
}
int main(int argc, char** argv) {
grpc_test_init(argc, argv);
test_init_shutdown();
test_start_op_generates_locally_unique_ids();
test_get_trace_method_name();
test_concurrency();
test_add_method_tag_to_unknown_op_id();
return 0;
}
|
