The FreeRADIUS server $Id: f3670dba8951ca10eb4948feb3dc3db9423a334f $
Loading...
Searching...
No Matches
load_balance.c
Go to the documentation of this file.
1/*
2 * This program is free software; you can redistribute it and/or modify
3 * it under the terms of the GNU General Public License as published by
4 * the Free Software Foundation; either version 2 of the License, or
5 * (at your option) any later version.
6 *
7 * This program is distributed in the hope that it will be useful,
8 * but WITHOUT ANY WARRANTY; without even the implied warranty of
9 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10 * GNU General Public License for more details.
11 *
12 * You should have received a copy of the GNU General Public License
13 * along with this program; if not, write to the Free Software
14 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
15 */
16
17/**
18 * $Id: 692ad27780ee3599e0ac4f835b8146c2d1d63314 $
19 *
20 * @file unlang/load_balance.c
21 * @brief Implementation of the unlang "load-balance" keyword.
22 *
23 * @copyright 2006-2019 The FreeRADIUS server project
24 */
25#include <freeradius-devel/server/rcode.h>
26#include <freeradius-devel/util/hash.h>
27#include <freeradius-devel/util/rand.h>
28
29#include "unlang_priv.h"
30#include "load_balance_priv.h"
31
32#define unlang_redundant_load_balance unlang_load_balance
33
36{
37 unlang_frame_state_redundant_t *redundant = talloc_get_type_abort(frame->state, unlang_frame_state_redundant_t);
39
40 /*
41 * If the current child wasn't set, we just start there. Otherwise we loop around to the next
42 * child.
43 */
44 if (!redundant->child) {
45 redundant->child = redundant->start;
46 goto push;
47 }
48
49 /*
50 * We are in a resumed frame. Check if running the child resulted in a failure rcode which
51 * requires us to keep going. If not, return to the caller.
52 */
53 switch (redundant->result.rcode) {
54 case RLM_MODULE_FAIL:
57 break;
58
59 default:
60 if (p_result) {
61 p_result->priority = MOD_PRIORITY_MIN;
62 p_result->rcode = redundant->result.rcode;
63 }
64
66 }
67
68 /*
69 * We finished the previous child, and it failed. Go to the next one. If we fall off of the
70 * end, loop around to the next one.
71 */
72 redundant->child = unlang_list_next(&g->children, redundant->child);
73 if (!redundant->child) redundant->child = unlang_list_head(&g->children);
74
75 /*
76 * We looped back to the start. Return whatever results we had from the last child.
77 */
78 if (redundant->child == redundant->start) {
79 if (p_result) *p_result = redundant->result;
81 }
82
83push:
84 /*
85 * The child begins has no result set. Resetting the results ensures that the failed code from
86 * one child doesn't affect the next child that we run.
87 */
88 redundant->result = UNLANG_RESULT_NOT_SET;
89 repeatable_set(frame);
90
91 /*
92 * Push the child. and run it.
93 */
94 if (unlang_interpret_push(&redundant->result, request, redundant->child,
97 }
98
100}
101
103{
104 unlang_frame_state_redundant_t *redundant = talloc_get_type_abort(frame->state,
107
108 /*
109 * Start at the first child, and then continue from there.
110 */
111 redundant->start = unlang_list_head(&g->children);
112
114 return unlang_load_balance_next(p_result, request, frame);
115}
116
118{
121 unlang_load_balance_t *gext = NULL;
122
123#ifdef STATIC_ANALYZER
124 if (!g || unlang_list_empty(&g->children)) return UNLANG_ACTION_FAIL;
125#else
126 fr_assert(g != NULL);
127 fr_assert(!unlang_list_empty(&g->children));
128#endif
129
131 fr_assert(gext != NULL);
132
133 redundant = talloc_get_type_abort(frame->state, unlang_frame_state_redundant_t);
134
135 if (gext->vpt) {
136 uint32_t hash, start;
137 ssize_t slen;
138 char buffer[1024];
139
140 /*
141 * Hash the attribute value to select the statement which will be used.
142 */
143 if (tmpl_is_attr(gext->vpt)) {
144 fr_pair_t *vp;
145
146 slen = tmpl_find_vp(&vp, request, gext->vpt);
147 if (slen < 0) {
148 REDEBUG("Failed finding attribute %s - choosing random statement", gext->vpt->name);
149 goto randomly_choose;
150 }
151
152 fr_assert(fr_type_is_leaf(vp->vp_type));
153
154 start = fr_value_box_hash(&vp->data) % unlang_list_num_elements(&g->children);
155
156 } else {
157 uint8_t *octets = NULL;
158
159 /*
160 * Get the raw data, and then hash the data.
161 */
162 slen = tmpl_expand(&octets, buffer, sizeof(buffer), request, gext->vpt);
163 if (slen <= 0) {
164 REDEBUG("Failed expanding %s - choosing random statement", gext->vpt->name);
165 goto randomly_choose;
166 }
167
168 hash = fr_hash(octets, slen);
169
170 start = hash % unlang_list_num_elements(&g->children);
171 }
172
173 RDEBUG3("load-balance starting at child %d", (int) start);
174
175 redundant->start = gext->children[start];
176
177 } else {
178 uint32_t one, two;
179 unlang_thread_t const *t1, *t2;
180
181 randomly_choose:
182 /*
183 * Leverage the "power of two". See src/lib/io/network.c for more information.
184 */
185 one = fr_rand() % unlang_list_num_elements(&g->children);
186 do {
187 two = fr_rand() % unlang_list_num_elements(&g->children);
188 } while (two == one);
189
190 t1 = unlang_thread_stats(gext->children[one]);
191 t2 = unlang_thread_stats(gext->children[two]);
192
193 if (t1->active <= t2->active) {
194 redundant->start = gext->children[one];
195 } else {
196 redundant->start = gext->children[two];
197 }
198 }
199
200 fr_assert(redundant->start != NULL);
201
202 /*
203 * Plain "load-balance". Just do one child, and return the result directly back to the caller.
204 */
206 if (unlang_interpret_push(p_result, request, redundant->start,
209 }
211 }
212
214 return unlang_load_balance_next(p_result, request, frame);
215}
216
217
220{
221 char const *name2;
222 int i;
223 fr_token_t quote;
224 unlang_t *c;
227
228 tmpl_rules_t t_rules;
229
230 if (!cf_item_next(cs, NULL)) return UNLANG_IGNORE;
231
232 /*
233 * We allow unknown attributes here.
234 */
235 t_rules = *(unlang_ctx->rules);
236 t_rules.attr.allow_unknown = true;
237 RULES_VERIFY(&t_rules);
238
239 if (!unlang_compile_limit_subsection(cs, cf_section_name1(cs))) return NULL;
240
242 if (!c) return NULL;
243
245
246 /*
247 * Inside of the "modules" section, it's a virtual module. The key is the third argument, and
248 * the "name2" is the module name, which we ignore here.
249 */
250 name2 = cf_section_name2(cs);
251 quote = cf_section_name2_quote(cs);
252
253 if (name2) {
254 if (strcmp(cf_section_name1(cf_item_to_section(cf_parent(cs))), "modules") == 0) {
255 char const *key;
256
257 /*
258 * Key is optional.
259 */
260 key = cf_section_argv(cs, 0);
261 if (key) {
262 name2 = key;
263 quote = cf_section_argv_quote(cs, 0);
264 } else {
265 name2 = NULL; /* no key */
266 }
267 }
268 }
269
271
272 /*
273 * Allow for keyed load-balance / redundant-load-balance sections.
274 */
275 if (name2) {
276 ssize_t slen;
277
278 /*
279 * Create the template. All attributes and xlats are
280 * defined by now.
281 */
282 slen = tmpl_afrom_substr(gext, &gext->vpt,
283 &FR_SBUFF_IN_STR(name2),
284 quote,
285 NULL,
286 &t_rules);
287 if (!gext->vpt) {
288 cf_canonicalize_error(cs, slen, "Failed parsing argument", name2);
289 talloc_free(g);
290 return NULL;
291 }
292
293 fr_assert(gext->vpt != NULL);
294
295 /*
296 * Fixup the templates
297 */
298 if (!pass2_fixup_tmpl(g, &gext->vpt, cf_section_to_item(cs), unlang_ctx->rules->attr.dict_def)) {
299 talloc_free(g);
300 return NULL;
301 }
302
303 switch (gext->vpt->type) {
304 default:
305 cf_log_err(cs, "Invalid type in '%s': data will not result in a load-balance key", name2);
306 talloc_free(g);
307 return NULL;
308
309 /*
310 * Allow only these ones.
311 */
312 case TMPL_TYPE_ATTR:
313 if (!fr_type_is_leaf(tmpl_attr_tail_da(gext->vpt)->type)) {
314 cf_log_err(cs, "Invalid attribute reference in '%s': load-balancing can only be done on 'leaf' data types", name2);
315 talloc_free(g);
316 return NULL;
317 }
318 break;
319
320 case TMPL_TYPE_XLAT:
321 case TMPL_TYPE_EXEC:
322 break;
323 }
324 }
325
326 /*
327 * Cache the children, so we can do O(1) lookups.
328 */
329 MEM(gext->children = talloc_array(gext, unlang_t *, unlang_list_num_elements(&g->children)));
330
331 i = 0;
332 unlang_list_foreach(&g->children, child) {
333 gext->children[i++] = child;
334 }
335
336 return c;
337}
338
343
348
349
351{
353
354 if (!cf_item_next(cs, NULL)) return UNLANG_IGNORE;
355
357 return NULL;
358 }
359
360 /*
361 * "redundant foo" is allowed only inside of a "modules" section, where the name is the instance
362 * name.
363 *
364 * @todo - static versus dynamic modules?
365 */
366
367 if (cf_section_name2(cs) &&
368 (strcmp(cf_section_name1(cf_item_to_section(cf_parent(cs))), "modules") != 0)) {
369 cf_log_err(cs, "Cannot specify a key for 'redundant'");
370 return NULL;
371 }
372
374}
375
376
378{
380 .name = "load-balance",
383
385 .interpret = unlang_load_balance,
386
387 .unlang_size = sizeof(unlang_load_balance_t),
388 .unlang_name = "unlang_load_balance_t",
389
390 .frame_state_size = sizeof(unlang_frame_state_redundant_t),
391 .frame_state_type = "unlang_frame_state_redundant_t",
392 });
393
395 .name = "redundant-load-balance",
398
401
402 .unlang_size = sizeof(unlang_load_balance_t),
403 .unlang_name = "unlang_load_balance_t",
404
405 .frame_state_size = sizeof(unlang_frame_state_redundant_t),
406 .frame_state_type = "unlang_frame_state_redundant_t",
407 });
408
410 .name = "redundant",
411 .type = UNLANG_TYPE_REDUNDANT,
413
414 .compile = unlang_compile_redundant,
415 .interpret = unlang_redundant,
416
417 .unlang_size = sizeof(unlang_group_t),
418 .unlang_name = "unlang_group_t",
419
420 .frame_state_size = sizeof(unlang_frame_state_redundant_t),
421 .frame_state_type = "unlang_frame_state_redundant_t",
422 });
423
424}
#define RETURN_UNLANG_ACTION_FATAL
Definition action.h:44
unlang_action_t
Returned by unlang_op_t calls, determine the next action of the interpreter.
Definition action.h:35
@ UNLANG_ACTION_PUSHED_CHILD
unlang_t pushed a new child onto the stack, execute it instead of continuing.
Definition action.h:39
@ UNLANG_ACTION_FAIL
Encountered an unexpected error.
Definition action.h:36
@ UNLANG_ACTION_CALCULATE_RESULT
Calculate a new section rlm_rcode_t value.
Definition action.h:37
static int const char char buffer[256]
Definition acutest.h:576
Common header for all CONF_* types.
Definition cf_priv.h:54
A section grouping multiple CONF_PAIR.
Definition cf_priv.h:106
fr_token_t cf_section_argv_quote(CONF_SECTION const *cs, int argc)
Return the quoting for one of the variadic arguments.
Definition cf_util.c:1422
char const * cf_section_name2(CONF_SECTION const *cs)
Return the second identifier of a CONF_SECTION.
Definition cf_util.c:1359
CONF_ITEM * cf_section_to_item(CONF_SECTION const *cs)
Cast a CONF_SECTION to a CONF_ITEM.
Definition cf_util.c:746
char const * cf_section_name1(CONF_SECTION const *cs)
Return the first identifier of a CONF_SECTION.
Definition cf_util.c:1345
CONF_SECTION * cf_item_to_section(CONF_ITEM const *ci)
Cast a CONF_ITEM to a CONF_SECTION.
Definition cf_util.c:692
char const * cf_section_argv(CONF_SECTION const *cs, int argc)
Return variadic argument at the specified index.
Definition cf_util.c:1387
fr_token_t cf_section_name2_quote(CONF_SECTION const *cs)
Return the quoting of the name2 identifier.
Definition cf_util.c:1404
#define cf_log_err(_cf, _fmt,...)
Definition cf_util.h:345
#define cf_parent(_cf)
Definition cf_util.h:118
#define cf_canonicalize_error(_ci, _slen, _msg, _str)
Definition cf_util.h:423
#define cf_item_next(_parent, _curr)
Definition cf_util.h:94
unlang_t * unlang_compile_section(unlang_t *parent, unlang_compile_ctx_t *unlang_ctx, CONF_SECTION *cs, unlang_type_t type)
Definition compile.c:1518
bool pass2_fixup_tmpl(UNUSED TALLOC_CTX *ctx, tmpl_t **vpt_p, CONF_ITEM const *ci, fr_dict_t const *dict)
Definition compile.c:87
bool unlang_compile_limit_subsection(CONF_SECTION *cs, char const *name)
Definition compile.c:1596
#define MEM(x)
Definition debug.h:36
uint32_t fr_hash(void const *data, size_t size)
Definition hash.c:847
talloc_free(hp)
unlang_thread_t const * unlang_thread_stats(unlang_t const *instruction)
Definition interpret.c:60
int unlang_interpret_push(unlang_result_t *p_result, request_t *request, unlang_t const *instruction, unlang_frame_conf_t const *conf, bool do_next_sibling)
Push a new frame onto the stack.
Definition interpret.c:621
unlang_mod_action_t priority
The priority or action for that rcode.
Definition interpret.h:142
#define UNLANG_RESULT_NOT_SET
Definition interpret.h:145
#define FRAME_CONF(_default_rcode, _top_frame)
Definition interpret.h:158
#define UNLANG_SUB_FRAME
Definition interpret.h:37
rlm_rcode_t rcode
The current rcode, from executing the instruction or merging the result from a frame.
Definition interpret.h:140
#define RDEBUG3(fmt,...)
Definition log.h:355
static TALLOC_CTX * unlang_ctx
Definition base.c:71
void unlang_register(unlang_op_t *op)
Register an operation with the interpreter.
Definition base.c:56
static unlang_t * unlang_compile_redundant(unlang_t *parent, unlang_compile_ctx_t *unlang_ctx, CONF_ITEM const *ci)
static unlang_action_t unlang_load_balance_next(unlang_result_t *p_result, request_t *request, unlang_stack_frame_t *frame)
static unlang_t * compile_load_balance_subsection(unlang_t *parent, unlang_compile_ctx_t *unlang_ctx, CONF_SECTION *cs, unlang_type_t type)
void unlang_load_balance_init(void)
static unlang_action_t unlang_redundant(unlang_result_t *p_result, request_t *request, unlang_stack_frame_t *frame)
static unlang_t * unlang_compile_redundant_load_balance(unlang_t *parent, unlang_compile_ctx_t *unlang_ctx, CONF_ITEM const *ci)
static unlang_t * unlang_compile_load_balance(unlang_t *parent, unlang_compile_ctx_t *unlang_ctx, CONF_ITEM const *ci)
static unlang_action_t unlang_load_balance(unlang_result_t *p_result, request_t *request, unlang_stack_frame_t *frame)
#define unlang_redundant_load_balance
tmpl_t * vpt
template to expand for keyed balancing
static unlang_load_balance_t * unlang_group_to_load_balance(unlang_group_t *g)
Cast a group structure to the load_balance keyword extension.
unlang_result_t result
for intermediate child results
unlang_t * child
the current child we're processing
unlang_t * start
the starting child
unlang_t ** children
array of child instructions.
State of a redundant operation.
unsigned int uint32_t
long int ssize_t
unsigned char uint8_t
#define MOD_PRIORITY_MIN
Definition mod_action.h:64
#define fr_assert(_expr)
Definition rad_assert.h:37
#define REDEBUG(fmt,...)
uint32_t fr_rand(void)
Return a 32-bit random number.
Definition rand.c:104
@ RLM_MODULE_FAIL
Module failed, don't reply.
Definition rcode.h:48
@ RLM_MODULE_TIMEOUT
Module (or section) timed out.
Definition rcode.h:56
@ RLM_MODULE_NOT_SET
Error resolving rcode (should not be returned by modules).
Definition rcode.h:45
static unsigned int hash(char const *username, unsigned int tablesize)
Definition rlm_passwd.c:132
#define FR_SBUFF_IN_STR(_start)
int tmpl_find_vp(fr_pair_t **out, request_t *request, tmpl_t const *vpt))
Returns the first VP matching a tmpl_t.
Definition tmpl_eval.c:776
#define tmpl_is_attr(vpt)
Definition tmpl.h:208
@ TMPL_TYPE_ATTR
Reference to one or more attributes.
Definition tmpl.h:142
@ TMPL_TYPE_XLAT
Pre-parsed xlat expansion.
Definition tmpl.h:146
@ TMPL_TYPE_EXEC
Callout to an external script or program.
Definition tmpl.h:150
ssize_t tmpl_afrom_substr(TALLOC_CTX *ctx, tmpl_t **out, fr_sbuff_t *in, fr_token_t quote, fr_sbuff_parse_rules_t const *p_rules, tmpl_rules_t const *t_rules))
Convert an arbitrary string into a tmpl_t.
#define tmpl_expand(_out, _buff, _buff_len, _request, _vpt)
Expand a tmpl to a C type, using existing storage to hold variably sized types.
Definition tmpl.h:1054
tmpl_attr_rules_t attr
Rules/data for parsing attribute references.
Definition tmpl.h:339
static fr_dict_attr_t const * tmpl_attr_tail_da(tmpl_t const *vpt)
Return the last attribute reference da.
Definition tmpl.h:801
Optional arguments passed to vp_tmpl functions.
Definition tmpl.h:336
fr_aka_sim_id_type_t type
fr_pair_t * vp
unsigned int allow_unknown
Allow unknown attributes i.e.
Definition tmpl.h:303
Stores an attribute, a value and various bits of other data.
Definition pair.h:68
enum fr_token fr_token_t
Private interpreter structures and functions.
#define RULES_VERIFY(_rules)
void * state
Stack frame specialisations.
#define UNLANG_NEXT_STOP
Definition unlang_priv.h:98
#define unlang_list_foreach(_list_head, _iter)
#define UNLANG_IGNORE
static unlang_group_t * unlang_generic_to_group(unlang_t const *p)
unlang_list_t children
unlang_type_t
Types of unlang_t nodes.
Definition unlang_priv.h:47
@ UNLANG_TYPE_LOAD_BALANCE
Load balance section.
Definition unlang_priv.h:53
@ UNLANG_TYPE_REDUNDANT
exactly like group, but with different default return codes
Definition unlang_priv.h:52
@ UNLANG_TYPE_REDUNDANT_LOAD_BALANCE
Redundant load balance section.
Definition unlang_priv.h:54
unlang_t const * instruction
The unlang node we're evaluating.
@ UNLANG_OP_FLAG_DEBUG_BRACES
Print debug braces.
@ UNLANG_OP_FLAG_RCODE_SET
Set request->rcode to the result of this operation.
static void repeatable_set(unlang_stack_frame_t *frame)
unlang_process_t process
function to call for interpreting this stack frame
unlang_type_t type
The specialisation of this node.
Generic representation of a grouping.
An unlang operation.
A node in a graph of unlang_op_t (s) that we execute.
Our interpreter stack, as distinct from the C stack.
static fr_slen_t parent
Definition pair.h:858
#define fr_type_is_leaf(_x)
Definition types.h:393
uint32_t fr_value_box_hash(fr_value_box_t const *vb)
Hash the contents of a value box.
Definition value.c:7088