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 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383
|
/*
* Copyright (c) 2018 Balazs Scheidler
* Copyright (c) 2018 Balabit
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 as published
* by the Free Software Foundation, or (at your option) any later version.
*
* This program 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; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
* As an additional exemption you are allowed to compile & link against the
* OpenSSL libraries as published by the OpenSSL project. See the file
* COPYING for details.
*
*/
#include <criterion/criterion.h>
#include "http-loadbalancer.h"
#include "apphook.h"
#include "scratch-buffers.h"
#include <unistd.h>
#define NUM_TARGETS 5
#define NUM_CLIENTS 16
static HTTPLoadBalancer *
_construct_load_balancer(void)
{
HTTPLoadBalancer *lb;
lb = http_load_balancer_new();
for (gint i = 0; i < NUM_TARGETS; i++)
{
gchar url[256];
g_snprintf(url, sizeof(url), "http://localhost:%d", 8000 + i);
GError *error = NULL;
cr_assert(http_load_balancer_add_target(lb, url, &error));
}
return lb;
}
static void
_setup_lb_clients(HTTPLoadBalancer *lb, HTTPLoadBalancerClient *lbc, gint num)
{
for (gint i = 0; i < num; i++)
http_lb_client_init(&lbc[i], lb);
}
static void
_teardown_lb_clients(HTTPLoadBalancer *lb, HTTPLoadBalancerClient *lbc, gint num)
{
for (gint i = 0; i < num; i++)
http_lb_client_deinit(&lbc[i]);
}
Test(http_loadbalancer, construct_and_free)
{
HTTPLoadBalancer *lb = _construct_load_balancer();
http_load_balancer_free(lb);
}
Test(http_loadbalancer, target_index_is_set_as_urls_are_added_to_the_array_index)
{
HTTPLoadBalancer *lb = _construct_load_balancer();
for (gint i = 0; i < lb->num_targets; i++)
cr_assert(lb->targets[i].index == i);
http_load_balancer_free(lb);
}
Test(http_loadbalancer, number_of_clients_is_tracked_in_num_clients)
{
HTTPLoadBalancer *lb = _construct_load_balancer();
HTTPLoadBalancerClient lbc[NUM_CLIENTS];
for (gint i = 0; i < G_N_ELEMENTS(lbc); i++)
{
http_lb_client_init(&lbc[i], lb);
cr_assert(lb->num_clients == i + 1);
}
http_load_balancer_free(lb);
}
Test(http_loadbalancer, choose_target_selects_the_first_operational_target)
{
HTTPLoadBalancer *lb = _construct_load_balancer();
HTTPLoadBalancerClient lbc;
http_lb_client_init(&lbc, lb);
LogMessage *msg = log_msg_new_empty();
LogTemplateOptions options;
log_template_options_defaults(&options);
GString *url = g_string_new(NULL);
HTTPLoadBalancerTarget *target = http_load_balancer_choose_target(lb, &lbc);
http_lb_target_format_templated_url(target, msg, &options, url);
cr_assert_str_eq(url->str, "http://localhost:8000");
cr_assert(target->state == HTTP_TARGET_OPERATIONAL);
g_string_free(url, TRUE);
log_template_options_destroy(&options);
log_msg_unref(msg);
http_lb_client_deinit(&lbc);
http_load_balancer_free(lb);
}
Test(http_loadbalancer, choose_target_escapes_templated_url)
{
GError *error = NULL;
HTTPLoadBalancer *lb = http_load_balancer_new();
cr_assert(http_load_balancer_add_target(lb, "http://localhost:8000/${my_field}", &error));
HTTPLoadBalancerClient lbc;
http_lb_client_init(&lbc, lb);
LogMessage *msg = log_msg_new_empty();
log_msg_set_value_by_name(msg, "my_field", "foo bar", -1);
LogTemplateOptions options;
log_template_options_defaults(&options);
GString *url = g_string_new(NULL);
HTTPLoadBalancerTarget *target = http_load_balancer_choose_target(lb, &lbc);
http_lb_target_format_templated_url(target, msg, &options, url);
cr_assert_str_eq(url->str, "http://localhost:8000/foo%20bar");
cr_assert(target->state == HTTP_TARGET_OPERATIONAL);
g_string_free(url, TRUE);
log_template_options_destroy(&options);
log_msg_unref(msg);
http_lb_client_deinit(&lbc);
http_load_balancer_free(lb);
}
Test(http_loadbalancer, choose_target_balances_clients_to_targets)
{
HTTPLoadBalancer *lb = _construct_load_balancer();
HTTPLoadBalancerClient lbc[NUM_CLIENTS];
gint target_counts[NUM_TARGETS] = {0};
_setup_lb_clients(lb, lbc, G_N_ELEMENTS(lbc));
/* count number of workers on each target */
for (gint i = 0; i < G_N_ELEMENTS(lbc); i++)
{
HTTPLoadBalancerTarget *target = http_load_balancer_choose_target(lb, &lbc[i]);
target_counts[target->index]++;
}
for (gint i = 0; i < NUM_TARGETS; i++)
{
gint expected_number_of_workers = NUM_CLIENTS / NUM_TARGETS;
/* we might have one more client, if the number of workers is not
* divisible by the number of targets. The load balancer allocates
* the first couple of targets for the excess.
*/
cr_expect(target_counts[i] - expected_number_of_workers <= 1 &&
target_counts[i] - expected_number_of_workers >= 0,
"The target %d is not balanced, expected_number_of_workers=%d, actual=%d",
i, expected_number_of_workers, target_counts[i]);
}
_teardown_lb_clients(lb, lbc, G_N_ELEMENTS(lbc));
http_load_balancer_free(lb);
}
Test(http_loadbalancer, choose_target_tries_to_stay_affine_to_the_current_target)
{
HTTPLoadBalancer *lb = _construct_load_balancer();
HTTPLoadBalancerClient lbc[NUM_CLIENTS];
_setup_lb_clients(lb, lbc, G_N_ELEMENTS(lbc));
for (gint i = 0; i < G_N_ELEMENTS(lbc); i++)
{
HTTPLoadBalancerTarget *initial_target = http_load_balancer_choose_target(lb, &lbc[i]);
for (gint n = 0; n < 100; n++)
{
HTTPLoadBalancerTarget *target = http_load_balancer_choose_target(lb, &lbc[i]);
cr_assert(initial_target == target);
}
}
_teardown_lb_clients(lb, lbc, G_N_ELEMENTS(lbc));
http_load_balancer_free(lb);
}
static inline gboolean
_should_fail_this_target(HTTPLoadBalancerTarget *target)
{
return (target->index % 2) != 0;
}
Test(http_loadbalancer, failed_target_is_taken_out_of_rotation)
{
HTTPLoadBalancer *lb = _construct_load_balancer();
HTTPLoadBalancerClient lbc[NUM_CLIENTS];
gint target_counts[NUM_TARGETS] = {0};
gint failing_targets = 0;
_setup_lb_clients(lb, lbc, G_N_ELEMENTS(lbc));
for (gint i = 0; i < G_N_ELEMENTS(lbc); i++)
{
HTTPLoadBalancerTarget *target = http_load_balancer_choose_target(lb, &lbc[i]);
cr_assert(target != NULL);
/* fail every second */
if (_should_fail_this_target(target))
{
http_load_balancer_set_target_failed(lb, target);
failing_targets++;
}
else
http_load_balancer_set_target_successful(lb, target);
}
/* check that our lbc's still get operational targets */
for (gint i = 0; i < G_N_ELEMENTS(lbc); i++)
{
HTTPLoadBalancerTarget *target = http_load_balancer_choose_target(lb, &lbc[i]);
cr_assert(_should_fail_this_target(target) == FALSE,
"HTTPLoadBalancer returned a target that was marked as failed, index=%d",
target->index);
cr_assert(target->state == HTTP_TARGET_OPERATIONAL);
target_counts[target->index]++;
}
/* check that we balance the load on the remaining targets properly */
for (gint i = 0; i < NUM_TARGETS; i++)
{
if (_should_fail_this_target(&lb->targets[i]))
{
cr_expect(lb->targets[i].state == HTTP_TARGET_FAILED);
}
else
{
gint expected_number_of_workers = NUM_CLIENTS / (NUM_TARGETS - failing_targets);
cr_expect(target_counts[i] - expected_number_of_workers <= 1 &&
target_counts[i] - expected_number_of_workers >= 0,
"The target %d is not balanced, expected_number_of_workers=%d, actual=%d",
i, expected_number_of_workers, target_counts[i]);
}
}
_teardown_lb_clients(lb, lbc, G_N_ELEMENTS(lbc));
http_load_balancer_free(lb);
}
Test(http_loadbalancer, number_of_failed_targets_is_tracked_even_if_the_same_target_is_failed_multiple_times)
{
HTTPLoadBalancer *lb = _construct_load_balancer();
HTTPLoadBalancerClient lbc;
_setup_lb_clients(lb, &lbc, 1);
/* make all targets to the failed state */
for (gint i = 0; i < NUM_TARGETS; i++)
{
HTTPLoadBalancerTarget *target = &lb->targets[i];
http_load_balancer_set_target_failed(lb, target);
cr_assert(lb->num_failed_targets == i + 1);
http_load_balancer_set_target_failed(lb, target);
cr_assert(lb->num_failed_targets == i + 1);
http_load_balancer_set_target_successful(lb, target);
cr_assert(lb->num_failed_targets == i);
http_load_balancer_set_target_successful(lb, target);
cr_assert(lb->num_failed_targets == i);
http_load_balancer_set_target_failed(lb, target);
cr_assert(lb->num_failed_targets == i + 1);
}
_teardown_lb_clients(lb, &lbc, 1);
http_load_balancer_free(lb);
}
Test(http_loadbalancer, if_all_targets_fail_the_least_recently_failed_one_is_tried)
{
HTTPLoadBalancer *lb = _construct_load_balancer();
HTTPLoadBalancerClient lbc;
_setup_lb_clients(lb, &lbc, 1);
/* make all targets to the failed state */
for (gint i = NUM_TARGETS - 1; i >= 0; i--)
{
HTTPLoadBalancerTarget *target = &lb->targets[i];
http_load_balancer_set_target_failed(lb, target);
sleep(1);
}
/* check that we get the least recently failed target */
HTTPLoadBalancerTarget *target = http_load_balancer_choose_target(lb, &lbc);
cr_assert(target->state != HTTP_TARGET_OPERATIONAL);
cr_assert(target->index == NUM_TARGETS - 1);
http_load_balancer_set_target_failed(lb, target);
target = http_load_balancer_choose_target(lb, &lbc);
cr_assert(target->state != HTTP_TARGET_OPERATIONAL);
cr_assert(target->index == NUM_TARGETS - 2);
http_load_balancer_set_target_failed(lb, target);
target = http_load_balancer_choose_target(lb, &lbc);
cr_assert(target->state != HTTP_TARGET_OPERATIONAL);
cr_assert(target->index == NUM_TARGETS - 3);
_teardown_lb_clients(lb, &lbc, 1);
http_load_balancer_free(lb);
}
Test(http_loadbalancer, failed_servers_are_reattempted_after_recovery_time)
{
HTTPLoadBalancer *lb = _construct_load_balancer();
HTTPLoadBalancerClient lbc[NUM_CLIENTS];
HTTPLoadBalancerTarget *target;
http_load_balancer_set_recovery_timeout(lb, 1);
_setup_lb_clients(lb, lbc, G_N_ELEMENTS(lbc));
http_load_balancer_set_target_failed(lb, &lb->targets[0]);
for (gint i = 0; i < G_N_ELEMENTS(lbc); i++)
{
target = http_load_balancer_choose_target(lb, &lbc[i]);
cr_assert(target->state == HTTP_TARGET_OPERATIONAL,
"As it seems the test lost its race against the load"
"balancer's 1 seconds recovery timeout. You can always bump"
"the timeout a bit higher, but hey this loop is 16 iterations"
"long, that should be doable in 1 second.");
}
sleep(1);
target = http_load_balancer_choose_target(lb, &lbc[0]);
cr_assert(target->state == HTTP_TARGET_FAILED);
_teardown_lb_clients(lb, lbc, G_N_ELEMENTS(lbc));
http_load_balancer_free(lb);
}
Test(http_loadbalancer, drop_targets_resets_the_target_list)
{
HTTPLoadBalancer *lb = _construct_load_balancer();
cr_assert(lb->num_targets != 0);
http_load_balancer_drop_all_targets(lb);
cr_assert(lb->num_targets == 0);
http_load_balancer_free(lb);
}
void
setup(void)
{
app_startup();
}
void
teardown(void)
{
scratch_buffers_explicit_gc();
app_shutdown();
}
TestSuite(http_loadbalancer, .init = setup, .fini = teardown);
|