* The delay is so we can detect retransmissions.
*/
original->linked = talloc_steal(original, packet);
- fr_pair_list_move(&original->link_vps, &decoded, T_OP_ADD_EQ); /* Move the vps over */
+ fr_pair_list_move_op(&original->link_vps, &decoded, T_OP_ADD_EQ); /* Move the vps over */
rs_tv_add_ms(&header->ts, conf->stats.timeout, &original->when);
if (fr_event_timer_at(NULL, event->list, &original->event,
fr_time_from_timeval(&original->when), _rs_event, original) < 0) {
fr_pair_list_free(&original->packet_vps);
fr_radius_packet_free(&original->packet);
original->packet = talloc_steal(original, packet);
- fr_pair_list_move(&original->packet_vps, &decoded, T_OP_ADD_EQ);
+ fr_pair_list_move_op(&original->packet_vps, &decoded, T_OP_ADD_EQ);
/* Request may need to be reinserted as the 5 tuple of the response may of changed */
if (rs_packet_cmp(original, &search) != 0) {
fr_pair_list_free(&original->expect_vps);
fr_radius_packet_free(&original->expect);
original->expect = talloc_steal(original, search.expect);
- fr_pair_list_move(&original->expect_vps, &search.expect_vps, T_OP_ADD_EQ);
+ fr_pair_list_move_op(&original->expect_vps, &search.expect_vps, T_OP_ADD_EQ);
/* Disarm the timer for the cleanup event for the original request */
fr_event_timer_delete(&original->event);
original->capture_p = original->capture;
original->packet = talloc_steal(original, packet);
- fr_pair_list_move(&original->packet_vps, &decoded, T_OP_ADD_EQ);
+ fr_pair_list_move_op(&original->packet_vps, &decoded, T_OP_ADD_EQ);
original->expect = talloc_steal(original, search.expect);
- fr_pair_list_move(&original->expect_vps, &search.expect_vps, T_OP_ADD_EQ);
+ fr_pair_list_move_op(&original->expect_vps, &search.expect_vps, T_OP_ADD_EQ);
if (!fr_pair_list_empty(&search.link_vps)) {
bool ret;
vp = fr_pair_list_next(&search.link_vps, vp)) {
fr_pair_steal(original, vp);
}
- fr_pair_list_move(&original->link_vps, &search.link_vps, T_OP_ADD_EQ);
+ fr_pair_list_move_op(&original->link_vps, &search.link_vps, T_OP_ADD_EQ);
/* We should never have conflicts */
ret = fr_rb_insert(link_tree, original);
FALL_THROUGH;
case T_OP_ADD_EQ:
- fr_pair_list_move(list, &src_list, T_OP_ADD_EQ);
+ fr_pair_list_move_op(list, &src_list, T_OP_ADD_EQ);
fr_pair_list_free(&src_list);
}
goto update;
case T_OP_PREPEND:
- fr_pair_list_move(list, &src_list, map->op);
+ fr_pair_list_move_op(list, &src_list, map->op);
fr_pair_list_free(&src_list);
goto update;
#include <ctype.h>
/*
- * The fr_pair_list_move() function in src/lib/valuepair.c does all sorts of
+ * The fr_pair_list_move_op() function in src/lib/valuepair.c does all sorts of
* extra magic that we don't want here.
*
* FIXME: integrate this with the code calling it, so that we
*
* It also means that the operators apply ONLY to the
* attributes in the original list. With the previous
- * implementation of fr_pair_list_move(), adding two attributes
+ * implementation of fr_pair_list_move_op(), adding two attributes
* via "+=" and then "=" would mean that the second one
* wasn't added, because of the existence of the first
* one in the "to" list. This implementation doesn't
*
* @see radius_pairmove
*/
-void fr_pair_list_move(fr_pair_list_t *to, fr_pair_list_t *from, fr_token_t op)
+void fr_pair_list_move_op(fr_pair_list_t *to, fr_pair_list_t *from, fr_token_t op)
{
fr_pair_t *i, *found;
fr_pair_list_t head_new, head_prepend;
*
* @see radius_pairmove
*/
-void fr_pair_list_move(fr_pair_list_t *to, fr_pair_list_t *from, fr_token_t op)
+void fr_pair_list_move_op(fr_pair_list_t *to, fr_pair_list_t *from, fr_token_t op)
{
fr_pair_t *i, *found;
fr_pair_list_t head_new, head_prepend;
int fr_pair_list_afrom_file(TALLOC_CTX *ctx, fr_dict_t const *dict,
fr_pair_list_t *out, FILE *fp, bool *pfiledone);
-void fr_pair_list_move(fr_pair_list_t *to, fr_pair_list_t *from, fr_token_t op);
+void fr_pair_list_move_op(fr_pair_list_t *to, fr_pair_list_t *from, fr_token_t op);
#ifdef __cplusplus
}
fclose(fp);
}
-static void test_fr_pair_list_move(void)
+static void test_fr_pair_list_move_op(void)
{
fr_pair_t *vp;
fr_pair_list_t old_list, new_list;
TEST_CHECK(fr_pair_list_afrom_file(autofree, test_dict, &old_list, fp, &pfiledone) == 0);
TEST_CHECK(pfiledone == true);
- TEST_CASE("Move pair from 'old_list' to 'new_list' using fr_pair_list_move()");
- fr_pair_list_move(&new_list, &old_list, T_OP_ADD_EQ);
+ TEST_CASE("Move pair from 'old_list' to 'new_list' using fr_pair_list_move_op()");
+ fr_pair_list_move_op(&new_list, &old_list, T_OP_ADD_EQ);
TEST_CASE("Looking for Test-Uint32-0");
TEST_CHECK((vp = fr_pair_find_by_da_idx(&new_list, fr_dict_attr_test_uint32, 0)) != NULL);
{ "fr_pair_mark_xlat", test_fr_pair_mark_xlat },
{ "fr_pair_list_afrom_str", test_fr_pair_list_afrom_str },
{ "fr_pair_list_afrom_file", test_fr_pair_list_afrom_file },
- { "fr_pair_list_move", test_fr_pair_list_move },
+ { "fr_pair_list_move_op", test_fr_pair_list_move_op },
{ NULL }
};
ctx = tmpl_list_ctx(request, inst->output_list);
fr_pair_list_afrom_box(ctx, &vps, request->dict, box);
- if (!fr_pair_list_empty(&vps)) fr_pair_list_move(output_pairs, &vps, T_OP_ADD_EQ);
+ if (!fr_pair_list_empty(&vps)) fr_pair_list_move_op(output_pairs, &vps, T_OP_ADD_EQ);
fr_dlist_talloc_free(&m->box); /* has been consumed */
}
/*
* Move the control items over, too.
*/
- fr_pair_list_move(&request->control_pairs, &list, T_OP_ADD_EQ);
+ fr_pair_list_move_op(&request->control_pairs, &list, T_OP_ADD_EQ);
fr_pair_list_free(&list);
/* ctx may be reply */