The FreeRADIUS server $Id: 15bac2a4c627c01d1aa2047687b3418955ac7f00 $
Loading...
Searching...
No Matches
network.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: 45092bbfcb0f486a09d3fd621818913cb99e6deb $
19 *
20 * @brief Receiver of socket data, which sends messages to the workers.
21 * @file io/network.c
22 *
23 * @copyright 2016 Alan DeKok (aland@freeradius.org)
24 */
25RCSID("$Id: 45092bbfcb0f486a09d3fd621818913cb99e6deb $")
26
27#define LOG_PREFIX nr->name
28
29#define LOG_DST nr->log
30
31#include <freeradius-devel/util/event.h>
32#include <freeradius-devel/util/misc.h>
33#include <freeradius-devel/util/rand.h>
34#include <freeradius-devel/util/rb.h>
35#include <freeradius-devel/util/syserror.h>
36#include <freeradius-devel/util/atexit.h>
37#include <freeradius-devel/util/talloc.h>
38
39#include <freeradius-devel/io/channel.h>
40#include <freeradius-devel/io/control.h>
41#include <freeradius-devel/io/listen.h>
42#include <freeradius-devel/io/network.h>
43#include <freeradius-devel/io/queue.h>
44#include <freeradius-devel/io/ring_buffer.h>
45#include <freeradius-devel/io/worker.h>
46
47#define MAX_WORKERS 64
48
49static _Thread_local fr_ring_buffer_t *fr_network_rb;
50
57
58/** Associate a worker thread with a network thread
59 *
60 */
61typedef struct {
62 fr_heap_index_t heap_id; //!< workers are in a heap
63 fr_time_delta_t cpu_time; //!< how much CPU time this worker has spent
64 fr_time_delta_t predicted; //!< predicted processing time for one packet
65
66 bool blocked; //!< is this worker blocked?
67
68 fr_channel_t *channel; //!< channel to the worker
69 fr_worker_t *worker; //!< worker pointer
72
73typedef struct {
74 fr_rb_node_t listen_node; //!< rbtree node for looking up by listener.
75 fr_rb_node_t num_node; //!< rbtree node for looking up by number.
76
77 fr_network_t *nr; //!< O(N) issues in talloc
78 int number; //!< unique ID
79 fr_heap_index_t heap_id; //!< for the sockets_by_num heap
80
81 fr_event_filter_t filter; //!< what type of filter it is
82
83 bool dead; //!< is it dead?
84 bool blocked; //!< is it blocked?
85
86 unsigned int outstanding; //!< number of outstanding packets sent to the worker
87 fr_listen_t *listen; //!< I/O ctx and functions.
88
89 fr_message_set_t *ms; //!< message buffers for this socket.
90 fr_channel_data_t *cd; //!< cached in case of allocation & read error
91 size_t leftover; //!< leftover data from a previous read
92 size_t written; //!< however much we did in a partial write
93
94 fr_channel_data_t *pending; //!< the currently pending partial packet
95 fr_heap_t *waiting; //!< packets waiting to be written
98
99/*
100 * We have an array of workers, so we can index the workers in
101 * O(1) time. remove the heap of "workers ordered by CPU time"
102 * when we send a packet to a worker, just update the predicted
103 * CPU time in place. when we receive a reply from a worker,
104 * just update the predicted CPU time in place.
105 *
106 * when we need to choose a worker, pick 2 at random, and then
107 * choose the one with the lowe cpu time. For background, see
108 * "Power of Two-Choices" and
109 * https://www.eecs.harvard.edu/~michaelm/postscripts/mythesis.pdf
110 * https://www.eecs.harvard.edu/~michaelm/postscripts/tpds2001.pdf
111 */
113 char const *name; //!< Network ID for logging.
114
115 pthread_t thread_id; //!< for self
116
117 bool suspended; //!< whether or not we're suspended.
118
119 fr_log_t const *log; //!< log destination
120 fr_log_lvl_t lvl; //!< debug log level
121
122 fr_atomic_queue_t *aq_control; //!< atomic queue for control messages sent to me
123
124 fr_control_t *control; //!< the control plane
125
126 fr_ring_buffer_t *rb; //!< ring buffer for my control-plane messages
127
128 fr_event_list_t *el; //!< our event list
129
130 fr_heap_t *replies; //!< replies from the worker, ordered by priority / origin time
131
133
134 fr_rb_tree_t *sockets; //!< list of sockets we're managing, ordered by the listener
135 fr_rb_tree_t *sockets_by_num; //!< ordered by number;
136
137 int num_workers; //!< number of active workers
138 int num_blocked; //!< number of blocked workers
139 int num_pending_workers; //!< number of workers we're waiting to start.
140 int max_workers; //!< maximum number of allowed workers
141 int num_sockets; //!< actually a counter...
142
143 int signal_pipe[2]; //!< Pipe for signalling the worker in an orderly way.
144 ///< This is more deterministic than using async signals.
145
146 bool exiting; //!< are we exiting?
147
148 fr_network_config_t config; //!< configuration
150};
151
152static void fr_network_post_event(fr_event_list_t *el, fr_time_t now, void *uctx);
153static int fr_network_pre_event(fr_time_t now, fr_time_delta_t wake, void *uctx);
155static void fr_network_read(UNUSED fr_event_list_t *el, int sockfd, UNUSED int flags, void *ctx);
156
157static int8_t reply_cmp(void const *one, void const *two)
158{
159 fr_channel_data_t const *a = one, *b = two;
160 int ret;
161
162 ret = CMP(a->priority, b->priority);
163 if (ret != 0) return ret;
164
165 return fr_time_cmp(a->m.when, b->m.when);
166}
167
168static int8_t waiting_cmp(void const *one, void const *two)
169{
170 fr_channel_data_t const *a = one, *b = two;
171 int ret;
172
173 ret = CMP(a->priority, b->priority);
174 if (ret != 0) return ret;
175
176 return fr_time_cmp(a->reply.request_time, b->reply.request_time);
177}
178
179static int8_t socket_listen_cmp(void const *one, void const *two)
180{
181 fr_network_socket_t const *a = one, *b = two;
182
183 return CMP(a->listen, b->listen);
184}
185
186static int8_t socket_num_cmp(void const *one, void const *two)
187{
188 fr_network_socket_t const *a = one, *b = two;
189
190 return CMP(a->number, b->number);
191}
192
193/*
194 * Explicitly cleanup the memory allocated to the ring buffer,
195 * just in case valgrind complains about it.
196 */
197static int _fr_network_rb_free(void *arg)
198{
199 return talloc_free(arg);
200}
201
202/** Initialise thread local storage
203 *
204 * @return fr_ring_buffer_t for messages
205 */
207{
209
210 rb = fr_network_rb;
211 if (rb) return rb;
212
214 if (!rb) {
215 fr_perror("Failed allocating memory for network ring buffer");
216 return NULL;
217 }
218
220
221 return rb;
222}
223
224static inline bool is_network_thread(fr_network_t const *nr)
225{
226 return (pthread_equal(pthread_self(), nr->thread_id) != 0);
227}
228
230
231/** Add a fr_listen_t to a network
232 *
233 * @param nr the network
234 * @param li the listener
235 */
237{
239
240 /*
241 * Associate the protocol dictionary with the listener, so that the decode functions can check /
242 * use it.
243 *
244 * A virtual server may start off with a "dictionary" block, and therefore define a local
245 * dictionary. So the "root" dictionary of a virtual server may not be a protocol dict.
246 */
247 fr_assert(li->server_cs != NULL);
249
250 fr_assert(li->dict != NULL);
251
252 /*
253 * Skip a bunch of work if we're already in the network thread.
254 */
255 if (is_network_thread(nr) && !li->needs_full_setup) {
256 return fr_network_listen_add_self(nr, li);
257 }
258
259 rb = fr_network_rb_init();
260 if (!rb) return -1;
261
262 return fr_control_message_send(nr->control, rb, FR_CONTROL_ID_LISTEN, &li, sizeof(li));
263}
264
265
266/** Delete a socket from a network. MUST be called only by the listener itself!.
267 *
268 * @param nr the network
269 * @param li the listener
270 */
272{
274
276
277 s = fr_rb_find(nr->sockets, &(fr_network_socket_t){ .listen = li });
278 if (!s) return -1;
279
281
282 return 0;
283}
284
285/** Add a "watch directory" call to a network
286 *
287 * @param nr the network
288 * @param li the listener
289 */
291{
293
294 rb = fr_network_rb_init();
295 if (!rb) return -1;
296
297 return fr_control_message_send(nr->control, rb, FR_CONTROL_ID_DIRECTORY, &li, sizeof(li));
298}
299
300/** Add a worker to a network in a different thread
301 *
302 * @param nr the network
303 * @param worker the worker
304 */
306{
308
309 rb = fr_network_rb_init();
310 if (!rb) return -1;
311
312 (void) talloc_get_type_abort(nr, fr_network_t);
313 (void) talloc_get_type_abort(worker, fr_worker_t);
314
315 return fr_control_message_send(nr->control, rb, FR_CONTROL_ID_WORKER, &worker, sizeof(worker));
316}
317
318static void fr_network_worker_started_callback(void *ctx, void const *data, size_t data_size, fr_time_t now);
319
320/** Add a worker to a network in the same thread
321 *
322 * @param nr the network
323 * @param worker the worker
324 */
326{
327 fr_network_worker_started_callback(nr, &worker, sizeof(worker), fr_time_wrap(0));
328}
329
330
331/** Signal the network to read from a listener
332 *
333 * @param nr the network
334 * @param li the listener to read from
335 */
337{
339
340 (void) talloc_get_type_abort(nr, fr_network_t);
342
343 s = fr_rb_find(nr->sockets, &(fr_network_socket_t){ .listen = li });
344 if (!s) return;
345
346 /*
347 * Go read the socket.
348 */
349 fr_network_read(nr->el, s->listen->fd, 0, s);
350}
351
352
353/** Inject a packet for a listener to write
354 *
355 * @param nr the network
356 * @param li the listener where the packet is being injected
357 * @param packet the packet to be written
358 * @param packet_len the length of the packet
359 * @param packet_ctx The packet context to write
360 * @param request_time when the packet was received.
361 */
362void fr_network_listen_write(fr_network_t *nr, fr_listen_t *li, uint8_t const *packet, size_t packet_len,
363 void *packet_ctx, fr_time_t request_time)
364{
365 fr_message_t *lm;
367
368 cd = (fr_channel_data_t) {
369 .m = (fr_message_t) {
371 .data_size = packet_len,
372 .when = request_time,
373 },
374
375 .channel = {
376 .heap_id = FR_HEAP_INDEX_INVALID,
377 },
378
379 .listen = li,
380 .priority = PRIORITY_NOW,
381 .reply.request_time = request_time,
382 };
383
384 memcpy(&cd.m.data, &packet, sizeof(packet)); /* const issues */
385 memcpy(&cd.packet_ctx, &packet_ctx, sizeof(packet_ctx)); /* const issues */
386
387 /*
388 * Localize the message and insert it into the heap of pending messages.
389 */
390 lm = fr_message_localize(nr, &cd.m, sizeof(cd));
391 if (!lm) return;
392
393 if (fr_heap_insert(&nr->replies, lm) < 0) {
394 fr_message_done(lm);
395 }
396}
397
398
399/** Inject a packet for a listener to read
400 *
401 * @param nr the network
402 * @param li the listener where the packet is being injected
403 * @param packet the packet to be injected
404 * @param packet_len the length of the packet
405 * @param recv_time when the packet was received.
406 * @return
407 * - <0 on error
408 * - 0 on success
409 */
410int fr_network_listen_inject(fr_network_t *nr, fr_listen_t *li, uint8_t const *packet, size_t packet_len, fr_time_t recv_time)
411{
413 fr_network_inject_t my_inject;
414
415 /*
416 * Can't inject to injection-less destinations.
417 */
418 if (!li->app_io->inject) {
419 fr_strerror_const("Listener cannot accept injected packet");
420 return -1;
421 }
422
423 /*
424 * Avoid a bounce through the event loop if we're being called from the network thread.
425 */
426 if (is_network_thread(nr)) {
428
429 s = fr_rb_find(nr->sockets, &(fr_network_socket_t){ .listen = li });
430 if (!s) {
431 fr_strerror_const("Listener was not found for injected packet");
432 return -1;
433 }
434
435 /*
436 * Inject the packet. The master.c mod_read() routine will then take care of avoiding
437 * IO, and instead return the packet to the network side.
438 */
439 if (li->app_io->inject(li, packet, packet_len, recv_time) == 0) {
440 (void) fr_network_read(nr->el, li->fd, 0, s);
441 }
442
443 return 0;
444 }
445
446 rb = fr_network_rb_init();
447 if (!rb) return -1;
448
449 my_inject.listen = li;
450 my_inject.packet = talloc_memdup(NULL, packet, packet_len);
451 my_inject.packet_len = packet_len;
452 my_inject.recv_time = recv_time;
453
454 return fr_control_message_send(nr->control, rb, FR_CONTROL_ID_INJECT, &my_inject, sizeof(my_inject));
455}
456
458{
459 static fr_event_update_t pause_read[] = {
461 { 0 }
462 };
465
466 if (nr->suspended) return;
467
468 for (s = fr_rb_iter_init_inorder(&iter, nr->sockets);
469 s != NULL;
470 s = fr_rb_iter_next_inorder(&iter)) {
472 }
473 nr->suspended = true;
474}
475
477{
478 static fr_event_update_t resume_read[] = {
480 { 0 }
481 };
484
485 if (!nr->suspended) return;
486
487 for (s = fr_rb_iter_init_inorder(&iter, nr->sockets);
488 s != NULL;
489 s = fr_rb_iter_next_inorder(&iter)) {
491 }
492 nr->suspended = false;
493}
494
495#define IALPHA (8)
496#define RTT(_old, _new) fr_time_delta_wrap((fr_time_delta_unwrap(_new) + (fr_time_delta_unwrap(_old) * (IALPHA - 1))) / IALPHA)
497
498/** Callback which handles a message being received on the network side.
499 *
500 * @param[in] ctx the network
501 * @param[in] ch the channel that the message is on.
502 * @param[in] cd the message (if any) to start with
503 */
505{
506 fr_network_t *nr = ctx;
507 fr_network_worker_t *worker;
508
509 cd->channel.ch = ch;
510
511 /*
512 * Update stats for the worker.
513 */
515 worker->stats.out++;
516 worker->cpu_time = cd->reply.cpu_time;
517 if (!fr_time_delta_ispos(worker->predicted)) {
518 worker->predicted = cd->reply.processing_time;
519 } else {
520 worker->predicted = RTT(worker->predicted, cd->reply.processing_time);
521 }
522
523 /*
524 * Unblock the worker.
525 */
526 if (worker->blocked) {
527 worker->blocked = false;
528 nr->num_blocked--;
530 }
531
532 /*
533 * Ensure that heap insert works.
534 */
535 cd->channel.heap_id = FR_HEAP_INDEX_INVALID;
536 if (fr_heap_insert(&nr->replies, cd) < 0) {
537 fr_message_done(&cd->m);
538 fr_assert(0 == 1);
539 }
540}
541
542/** Handle a network control message callback for a channel
543 *
544 * This is called from the event loop when we get a notification
545 * from the event signalling pipe.
546 *
547 * @param[in] ctx the network
548 * @param[in] data the message
549 * @param[in] data_size size of the data
550 * @param[in] now the current time
551 */
552static void fr_network_channel_callback(void *ctx, void const *data, size_t data_size, fr_time_t now)
553{
555 fr_channel_t *ch;
556 fr_network_t *nr = ctx;
557
558 ce = fr_channel_service_message(now, &ch, data, data_size);
559 DEBUG3("Channel %s",
560 fr_table_str_by_value(channel_signals, ce, "<INVALID>"));
561 switch (ce) {
562 case FR_CHANNEL_ERROR:
563 return;
564
565 case FR_CHANNEL_EMPTY:
566 return;
567
568 case FR_CHANNEL_NOOP:
569 break;
570
572 fr_assert(ch != NULL);
573 while (fr_channel_recv_reply(ch));
574 break;
575
577 fr_assert(0 == 1);
578 break;
579
580 case FR_CHANNEL_OPEN:
581 fr_assert(0 == 1);
582 break;
583
584 case FR_CHANNEL_CLOSE:
585 {
586 fr_network_worker_t *w = talloc_get_type_abort(fr_channel_requestor_uctx_get(ch),
588 int i;
589
590 /*
591 * Remove this worker from the array
592 */
593 for (i = 0; i < nr->num_workers; i++) {
594 DEBUG3("Worker acked our close request");
595 if (nr->workers[i] == w) {
596 nr->workers[i] = NULL;
597
598 if (i == (nr->num_workers - 1)) break;
599
600 /*
601 * Close the hole...
602 */
603 memcpy(&nr->workers[i], &nr->workers[i + 1], ((nr->num_workers - i) - 1));
604 break;
605 }
606 }
607 nr->num_workers--;
608 }
609 break;
610 }
611}
612
613#define OUTSTANDING(_x) ((_x)->stats.in - (_x)->stats.out)
614
615/** Send a message on the "best" channel.
616 *
617 * @param nr the network
618 * @param cd the message we've received
619 */
621{
622 fr_network_worker_t *worker;
623
624 (void) talloc_get_type_abort(nr, fr_network_t);
625
626retry:
627 if (nr->num_workers == 1) {
628 worker = nr->workers[0];
629 if (worker->blocked) {
630 RATE_LIMIT_GLOBAL(ERROR, "Failed sending packet to worker - "
631 "In single-threaded mode and worker is blocked");
632 drop:
633 worker->stats.dropped++;
634 return -1;
635 }
636
637 } else if (nr->num_blocked == 0) {
638 int64_t cmp;
639 uint32_t one, two;
640
641 one = fr_rand() % nr->num_workers;
642 do {
643 two = fr_rand() % nr->num_workers;
644 } while (two == one);
645
646 /*
647 * Choose a worker based on minimizing the amount
648 * of future work it's being asked to do.
649 *
650 * If both workers have the same number of
651 * outstanding requests, then choose the worker
652 * which has used the least total CPU time.
653 */
654 cmp = (OUTSTANDING(nr->workers[one]) - OUTSTANDING(nr->workers[two]));
655 if (cmp < 0) {
656 worker = nr->workers[one];
657
658 } else if (cmp > 0) {
659 worker = nr->workers[two];
660
661 } else if (fr_time_delta_lt(nr->workers[one]->cpu_time, nr->workers[two]->cpu_time)) {
662 worker = nr->workers[one];
663
664 } else {
665 worker = nr->workers[two];
666 }
667 } else {
668 int i;
669 uint64_t min_outstanding = UINT64_MAX;
670 fr_network_worker_t *found = NULL;
671
672 /*
673 * Some workers are blocked. Pick the worker
674 * with the least amount of future work to do.
675 */
676 for (i = 0; i < nr->num_workers; i++) {
677 uint64_t outstanding;
678
679 worker = nr->workers[i];
680 if (worker->blocked) continue;
681
682 outstanding = OUTSTANDING(worker);
683 if ((outstanding < min_outstanding) || !found) {
684 found = worker;
685 min_outstanding = outstanding;
686
687 } else if (outstanding == min_outstanding) {
688 /*
689 * Queue lengths are the same.
690 * Choose this worker if it's
691 * less busy than the previous one we found.
692 */
693 if (fr_time_delta_lt(worker->cpu_time, found->cpu_time)) {
694 found = worker;
695 }
696 }
697 }
698
699 if (!found) {
700 RATE_LIMIT_GLOBAL(PERROR, "Failed sending packet to worker - Couldn't find active worker, "
701 "%u/%u workers are blocked", nr->num_blocked, nr->num_workers);
702 return -1;
703 }
704
705 worker = found;
706 }
707
708 (void) talloc_get_type_abort(worker, fr_network_worker_t);
709
710 /*
711 * Too many outstanding packets for this worker. Drop
712 * the request.
713 *
714 * If the worker we've picked has too many outstanding
715 * packets, then we have either only one worker, in which
716 * cae we should drop the packet. Or, we were unable to
717 * find a worker with smaller than max_outstanding
718 * packets. In which case all of the workers are likely
719 * at max_outstanding.
720 *
721 * In both cases, we should just drop the new packet.
722 */
723 fr_assert(worker->stats.in >= worker->stats.out);
724 if (nr->config.max_outstanding &&
725 (OUTSTANDING(worker) >= nr->config.max_outstanding)) {
726 RATE_LIMIT_GLOBAL(PERROR, "max_outstanding reached - dropping packet");
727 goto drop;
728 }
729
730 /*
731 * Send the message to the channel. If we fail, drop the
732 * packet. The only reason for failure is that the
733 * worker isn't servicing it's input queue. When that
734 * happens, we have no idea what to do, and the whole
735 * thing falls over.
736 */
737 if (fr_channel_send_request(worker->channel, cd) < 0) {
738 worker->stats.dropped++;
739 worker->blocked = true;
740 nr->num_blocked++;
741
742 RATE_LIMIT_GLOBAL(PERROR, "Failed sending packet to worker - %u/%u workers are blocked",
743 nr->num_blocked, nr->num_workers);
744
745 if (nr->num_blocked == nr->num_workers) {
747 return -1;
748 }
749 goto retry;
750 }
751
752 worker->stats.in++;
753
754 /*
755 * We're projecting that the worker will use more CPU
756 * time to process this request. The CPU time will be
757 * updated with a more accurate number when we receive a
758 * reply from this channel.
759 */
760 worker->cpu_time = fr_time_delta_add(worker->cpu_time, worker->predicted);
761
762 return 0;
763}
764
765
766/** Send a packet to the worker.
767 *
768 * MUST only be called from the network thread.
769 *
770 * @param nr the network
771 * @param parent the parent listener
772 * @param li the listener that the packet was "read" from. Can be "parent"
773 * @param buffer the packet to send
774 * @param buflen size of the packet to send
775 * @param recv_time of the packet
776 * @param packet_ctx for the packet
777 * @return
778 * - <0 on error
779 * - 0 on success
780 */
782 const uint8_t *buffer, size_t buflen, fr_time_t recv_time, void *packet_ctx)
783{
786
787 (void) talloc_get_type_abort(nr, fr_network_t);
789
790 s = fr_rb_find(nr->sockets, &(fr_network_socket_t){ .listen = li });
791 if (!s) return -1;
792
793 cd = (fr_channel_data_t *) fr_message_alloc(s->ms, NULL, buflen);
794 if (!cd) return -1;
795
796 cd->listen = parent;
798 cd->packet_ctx = packet_ctx;
799 cd->request.recv_time = recv_time;
800 memcpy(cd->m.data, buffer, buflen);
801 cd->m.when = fr_time();
802
803 if (fr_network_send_request(nr, cd) < 0) {
805 fr_message_done(&cd->m);
806 nr->stats.dropped++;
807 s->stats.dropped++;
808 return -1;
809 }
810
811 s->outstanding++;
812 return 0;
813}
814
815/** Get the number of outstanding packets
816 *
817 * @param nr the network
818 * @param li the listener that the packet was "read" from
819 * @return
820 * - <0 on error
821 * - the number of outstanding packets
822*/
825
826 (void) talloc_get_type_abort(nr, fr_network_t);
828
829 s = fr_rb_find(nr->sockets, &(fr_network_socket_t){ .listen = li });
830 if (!s) return -1;
831
832 return s->outstanding;
833}
834
835/*
836 * Mark it as dead, but DON'T free it until all of the replies
837 * have come in.
838 */
840{
841 int i;
842
843 if (s->dead) return;
844
845 s->dead = true;
846
847 fr_event_fd_delete(nr->el, s->listen->fd, s->filter);
848
849
850 for (i = 0; i < nr->max_workers; i++) {
851 if (!nr->workers[i]) continue;
852
853 (void) fr_worker_listen_cancel(nr->workers[i]->worker, s->listen);
854 }
855
856 /*
857 * If there are no outstanding packets, then we can free
858 * it now.
859 */
860 if (!s->outstanding) {
861 talloc_free(s);
862 return;
863 }
864
865 /*
866 * There are still outstanding packets. Leave it in the
867 * socket tree, so that replies from the worker can find
868 * it. When we've received all of the replies, then
869 * fr_network_post_event() will clean up this socket.
870 */
871}
872
873/** Read a packet from the network.
874 *
875 * @param[in] el the event list.
876 * @param[in] sockfd the socket which is ready to read.
877 * @param[in] flags from kevent.
878 * @param[in] ctx the network socket context.
879 */
880static void fr_network_read(UNUSED fr_event_list_t *el, int sockfd, UNUSED int flags, void *ctx)
881{
882 int num_messages = 0;
883 fr_network_socket_t *s = ctx;
884 fr_network_t *nr = s->nr;
885 ssize_t data_size;
886 fr_channel_data_t *cd, *next;
887
888 if (!fr_cond_assert_msg(s->listen->fd == sockfd, "Expected listen->fd (%u) to be equal event fd (%u)",
889 s->listen->fd, sockfd)) return;
890
891 DEBUG3("Reading data from FD %u", sockfd);
892
893 if (!s->cd) {
895 if (!cd) {
896 ERROR("Failed allocating message size %zd! - Closing socket",
899 return;
900 }
901 } else {
902 cd = s->cd;
903 }
904
905 fr_assert(cd->m.data != NULL);
906
907next_message:
908 /*
909 * Poll this socket, but not too often. We have to go
910 * service other sockets, too.
911 */
912 if (num_messages > 16) {
913 s->cd = cd;
914 return;
915 }
916
918
919 /*
920 * Read data from the network.
921 *
922 * Return of 0 means "no data", which is fine for UDP.
923 * For TCP, if an underlying read() on the TCP socket
924 * returns 0, (which signals that the FD is no longer
925 * usable) this function should return -1, so that the
926 * network side knows that it needs to close the
927 * connection.
928 */
929 data_size = s->listen->app_io->read(s->listen, &cd->packet_ctx, &cd->request.recv_time,
930 cd->m.data, cd->m.rb_size, &s->leftover);
931 if (data_size == 0) {
932 /*
933 * Cache the message for later. This is
934 * important for stream sockets, which can do
935 * partial reads into the current buffer. We
936 * need to be able to give the same buffer back
937 * to the stream socket for subsequent reads.
938 *
939 * Since we have a message set for each
940 * fr_io_socket_t, no "head of line"
941 * blocking issues can happen for stream sockets.
942 */
943 s->cd = cd;
944 return;
945 }
946
947 /*
948 * Error: close the connection, and remove the fr_listen_t
949 */
950 if (data_size < 0) {
951// fr_log(nr->log, L_DBG_ERR, "error from transport read on socket %d", sockfd);
953 return;
954 }
955 s->cd = NULL;
956
957 DEBUG3("Read %zd byte(s) from FD %u", data_size, sockfd);
958 if (s->listen->read_hexdump) HEXDUMP2(cd->m.data, data_size, "%s read ", s->listen->name);
959 nr->stats.in++;
960 s->stats.in++;
961
962 /*
963 * Initialize the rest of the fields of the channel data.
964 *
965 * We always use "now" as the time of the message, as the
966 * packet MAY be a duplicate packet magically resurrected
967 * from the past. i.e. If the read routines are doing
968 * dedup, then they notice that the packet is a
969 * duplicate. In that case, they send over a copy of the
970 * packet, BUT with the original timestamp. This
971 * information tells the worker that the packet is a
972 * duplicate.
973 */
974 cd->m.when = fr_time();
975 cd->listen = s->listen;
976
977 /*
978 * Nothing in the buffer yet. Allocate room for one
979 * packet.
980 */
981 if ((cd->m.data_size == 0) && (!s->leftover)) {
982
983 (void) fr_message_alloc(s->ms, &cd->m, data_size);
984 next = NULL;
985
986 } else {
987 /*
988 * There are leftover bytes in the buffer, feed
989 * them to the next round of reading.
990 */
991 next = (fr_channel_data_t *) fr_message_alloc_reserve(s->ms, &cd->m, data_size, s->leftover,
993 if (!next) {
994 PERROR("Failed reserving partial packet.");
995 // @todo - probably close the socket...
996 fr_assert(0 == 1);
997 }
998 }
999
1000 /*
1001 * Set the priority. Which incidentally also checks if
1002 * we're allowed to read this particular kind of packet.
1003 *
1004 * That check is because the app_io handlers just read
1005 * packets, and don't really have access to the parent
1006 * "list of allowed packet types". So we have to do the
1007 * work here in a callback.
1008 *
1009 * That should probably be fixed...
1010 */
1011 if (s->listen->app->priority) {
1012 int priority;
1013
1014 priority = s->listen->app->priority(s->listen->app_instance, cd->m.data, data_size);
1015 if (priority <= 0) goto discard;
1016
1017 cd->priority = priority;
1018 }
1019
1020 if (fr_network_send_request(nr, cd) < 0) {
1021 discard:
1022 talloc_free(cd->packet_ctx); /* not sure what else to do here */
1023 fr_message_done(&cd->m);
1024 nr->stats.dropped++;
1025 s->stats.dropped++;
1026
1027 } else {
1028 /*
1029 * One more packet sent to a worker.
1030 */
1031 s->outstanding++;
1032 }
1033
1034 /*
1035 * If there is a next message, go read it from the buffer.
1036 *
1037 * @todo - note that this calls read(), even if the
1038 * app_io has paused the reader. We likely want to be
1039 * able to check that, too. We might just remove this
1040 * "goto"...
1041 */
1042 if (next) {
1043 cd = next;
1044 num_messages++;
1045 goto next_message;
1046 }
1047}
1048
1049int fr_network_sendto_worker(fr_network_t *nr, fr_listen_t *li, void *packet_ctx, uint8_t const *data, size_t data_len, fr_time_t recv_time)
1050{
1053
1054 s = fr_rb_find(nr->sockets, &(fr_network_socket_t){ .listen = li });
1055 if (!s) return -1;
1056
1057 cd = (fr_channel_data_t *) fr_message_alloc(s->ms, NULL, data_len);
1058 if (!cd) return -1;
1059
1060 s->stats.in++;
1061
1063
1064 cd->m.when = recv_time;
1065 cd->listen = li;
1066 cd->packet_ctx = packet_ctx;
1067
1068 memcpy(cd->m.data, data, data_len);
1069
1070 if (fr_network_send_request(nr, cd) < 0) {
1071 talloc_free(packet_ctx);
1072 fr_message_done(&cd->m);
1073 nr->stats.dropped++;
1074 s->stats.dropped++;
1075
1076 } else {
1077 /*
1078 * One more packet sent to a worker.
1079 */
1080 s->outstanding++;
1081 }
1082
1083 return 0;
1084}
1085
1086
1087/** Get a notification that a vnode changed
1088 *
1089 * @param[in] el the event list.
1090 * @param[in] sockfd the socket which is ready to read.
1091 * @param[in] fflags from kevent.
1092 * @param[in] ctx the network socket context.
1093 */
1094static void fr_network_vnode_extend(UNUSED fr_event_list_t *el, int sockfd, int fflags, void *ctx)
1095{
1096 fr_network_socket_t *s = ctx;
1097 fr_network_t *nr = s->nr;
1098
1100
1101 DEBUG3("network vnode");
1102
1103 /*
1104 * Tell the IO handler that something has happened to the
1105 * file.
1106 */
1107 s->listen->app_io->vnode(s->listen, fflags);
1108}
1109
1110
1111/** Handle errors for a socket.
1112 *
1113 * @param[in] el the event list
1114 * @param[in] sockfd the socket which has a fatal error.
1115 * @param[in] flags returned by kevent.
1116 * @param[in] fd_errno returned by kevent.
1117 * @param[in] ctx the network socket context.
1118 */
1120 int fd_errno, void *ctx)
1121{
1122 fr_network_socket_t *s = ctx;
1123 fr_network_t *nr = s->nr;
1124
1125 if (s->listen->app_io->error) {
1126 s->listen->app_io->error(s->listen);
1127
1128 } else if (flags & EV_EOF) {
1129 DEBUG2("Socket %s closed by peer", s->listen->name);
1130
1131 } else {
1132 ERROR("Socket %s errored - %s", s->listen->name, fr_syserror(fd_errno));
1133 }
1134
1136}
1137
1138
1141 { 0 }
1142};
1143
1146 { 0 }
1147};
1148
1149
1150/** Write packets to the network.
1151 *
1152 * @param el the event list
1153 * @param sockfd the socket which is ready to write
1154 * @param flags returned by kevent.
1155 * @param ctx the network socket context.
1156 */
1157static void fr_network_write(UNUSED fr_event_list_t *el, UNUSED int sockfd, UNUSED int flags, void *ctx)
1158{
1159 fr_network_socket_t *s = ctx;
1160 fr_listen_t *li = s->listen;
1161 fr_network_t *nr = s->nr;
1163
1164 (void) talloc_get_type_abort(nr, fr_network_t);
1165
1166 /*
1167 * Start with the currently pending message, and then
1168 * work through the priority heap.
1169 */
1170 if (s->pending) {
1171 cd = s->pending;
1172 s->pending = NULL;
1173
1174 } else {
1175 cd = fr_heap_pop(&s->waiting);
1176 }
1177
1178 while (cd != NULL) {
1179 int rcode;
1180
1181 fr_assert(li == cd->listen);
1182 if (li->write_hexdump) HEXDUMP2(cd->m.data, cd->m.data_size, "%s writing ", li->name);
1183 rcode = li->app_io->write(li, cd->packet_ctx,
1184 cd->reply.request_time,
1185 cd->m.data, cd->m.data_size, s->written);
1186
1187 /*
1188 * Write of 0 bytes means an OS bug, and we just discard this packet.
1189 */
1190 if (rcode == 0) {
1191 RATE_LIMIT_GLOBAL(ERROR, "Discarding packet due to write returning zero for socket %s",
1192 s->listen->name);
1193 goto discard;
1194 }
1195
1196 /*
1197 * Or we have a write error.
1198 */
1199 if (rcode < 0) {
1200 /*
1201 * Stop processing the heap, and set the
1202 * pending message to the current one.
1203 */
1204 if (errno == EWOULDBLOCK) {
1205 save_pending:
1206 fr_assert(!s->pending);
1207
1208 if (cd->m.status != FR_MESSAGE_LOCALIZED) {
1209 fr_message_t *lm;
1210
1211 lm = fr_message_localize(s, &cd->m, sizeof(*cd));
1212 if (!lm) {
1213 ERROR("Failed saving pending packet");
1214 goto dead;
1215 }
1216
1217 cd = (fr_channel_data_t *) lm;
1218 }
1219
1220 if (!s->blocked) {
1222 PERROR("Failed adding write callback to event loop");
1223 goto dead;
1224 }
1225
1226 s->blocked = true;
1227 }
1228
1229 s->pending = cd;
1230 return;
1231 }
1232
1233 PERROR("Failed writing to socket %s", s->listen->name);
1234
1235 /*
1236 * As a special hack, check for something
1237 * that will never be returned from a
1238 * real write() routine. Which then
1239 * signals to us that we have to close
1240 * the socket, but NOT complain about it.
1241 */
1242 if ((errno == ECONNREFUSED) || (errno == ECONNRESET)) goto dead;
1243
1244 if (li->app_io->error) li->app_io->error(li);
1245
1246 dead:
1247 fr_message_done(&cd->m);
1249 return;
1250 }
1251
1252 /*
1253 * If we've done a partial write, localize the message and continue.
1254 */
1255 if ((size_t) rcode < cd->m.data_size) {
1256 s->written = rcode;
1257 goto save_pending;
1258 }
1259
1260 discard:
1261 s->written = 0;
1262
1263 /*
1264 * Reset for the next message.
1265 */
1266 fr_message_done(&cd->m);
1267 nr->stats.out++;
1268 s->stats.out++;
1269
1270 /*
1271 * Grab the net entry.
1272 */
1273 cd = fr_heap_pop(&s->waiting);
1274 }
1275
1276 /*
1277 * We've successfully written all of the packets. Remove
1278 * the write callback.
1279 */
1281 PERROR("Failed removing write callback from event loop");
1283 }
1284
1285 s->blocked = false;
1286}
1287
1289{
1290 fr_network_t *nr = s->nr;
1292
1293 fr_assert(s->outstanding == 0);
1294
1295 fr_rb_delete(nr->sockets, s);
1297
1298 fr_event_fd_delete(nr->el, s->listen->fd, s->filter);
1299
1300 if (s->listen->app_io->close) {
1301 s->listen->app_io->close(s->listen);
1302 } else {
1303 close(s->listen->fd);
1304 }
1305
1306 if (s->pending) {
1308 s->pending = NULL;
1309 }
1310
1311 /*
1312 * Clean up any queued entries.
1313 */
1314 while ((cd = fr_heap_pop(&s->waiting)) != NULL) {
1315 fr_message_done(&cd->m);
1316 }
1317
1318 talloc_free(s->waiting);
1319 talloc_free(s->listen);
1320
1321 return 0;
1322}
1323
1324
1325/** Handle a network control message callback for a new listener
1326 *
1327 * @param[in] ctx the network
1328 * @param[in] data the message
1329 * @param[in] data_size size of the data
1330 * @param[in] now the current time
1331 */
1332static void fr_network_listen_callback(void *ctx, void const *data, size_t data_size, UNUSED fr_time_t now)
1333{
1334 fr_network_t *nr = talloc_get_type_abort(ctx, fr_network_t);
1335 fr_listen_t *li;
1336
1337 fr_assert(data_size == sizeof(li));
1338
1339 if (data_size != sizeof(li)) return;
1340
1341 li = talloc_get_type_abort(*((void * const *)data), fr_listen_t);
1342
1343 (void) fr_network_listen_add_self(nr, li);
1344}
1345
1347{
1349 fr_app_io_t const *app_io;
1350 size_t size;
1351 int num_messages;
1352
1353 fr_assert(li->app_io != NULL);
1354
1355 /*
1356 * Non-socket listeners just get told about the event
1357 * list, and nothing else.
1358 */
1359 if (li->non_socket_listener) {
1360 fr_assert(li->app_io->event_list_set != NULL);
1361 fr_assert(!li->app_io->read);
1362 fr_assert(!li->app_io->write);
1363
1364 li->app_io->event_list_set(li, nr->el, nr);
1365
1366 /*
1367 * We use fr_log() here to avoid the "Network - " prefix.
1368 */
1369 fr_log(nr->log, L_DBG, __FILE__, __LINE__, "Listener %s bound to virtual server %s",
1370 li->name, cf_section_name2(li->server_cs));
1371
1372 return 0;
1373 }
1374
1375 s = talloc_zero(nr, fr_network_socket_t);
1376 fr_assert(s != NULL);
1377 talloc_steal(s, li);
1378
1379 s->nr = nr;
1380 s->listen = li;
1381 s->number = nr->num_sockets++;
1382
1383 MEM(s->waiting = fr_heap_alloc(s, waiting_cmp, fr_channel_data_t, channel.heap_id, 0));
1384
1385 talloc_set_destructor(s, _network_socket_free);
1386
1387 /*
1388 * Put reasonable limits on the ring buffer size. Then
1389 * round it up to the nearest power of 2, which is
1390 * required by the ring buffer code.
1391 */
1392 num_messages = s->listen->num_messages;
1393 if (num_messages < 8) num_messages = 8;
1394
1395 size = s->listen->default_message_size * num_messages;
1396 if (size < (1 << 17)) size = (1 << 17);
1397 if (size > (100 * 1024 * 1024)) size = (100 * 1024 * 1024);
1398
1399 /*
1400 * Allocate the ring buffer for messages and packets.
1401 */
1402 s->ms = fr_message_set_create(s, num_messages,
1403 sizeof(fr_channel_data_t),
1404 size);
1405 if (!s->ms) {
1406 PERROR("Failed creating message buffers for network IO");
1407 talloc_free(s);
1408 return -1;
1409 }
1410
1411 app_io = s->listen->app_io;
1413
1414 if (fr_event_fd_insert(nr, NULL, nr->el, s->listen->fd,
1418 s) < 0) {
1419 PERROR("Failed adding new socket to network event loop");
1420 talloc_free(s);
1421 return -1;
1422 }
1423
1424 /*
1425 * Start of with write updates being paused. We don't
1426 * care about being able to write if there's nothing to
1427 * write.
1428 */
1430
1431 /*
1432 * Add the listener before calling the app_io, so that
1433 * the app_io can find the listener which we're adding
1434 * here.
1435 */
1436 (void) fr_rb_insert(nr->sockets, s);
1437 (void) fr_rb_insert(nr->sockets_by_num, s);
1438
1439 if (app_io->event_list_set) app_io->event_list_set(s->listen, nr->el, nr);
1440
1441 /*
1442 * We use fr_log() here to avoid the "Network - " prefix.
1443 */
1444 fr_log(nr->log, L_DBG, __FILE__, __LINE__, "Listening on %s bound to virtual server %s",
1446
1447 DEBUG3("Using new socket %s with FD %d", s->listen->name, s->listen->fd);
1448
1449 return 0;
1450}
1451
1452/** Handle a network control message callback for a new "watch directory"
1453 *
1454 * @param[in] ctx the network
1455 * @param[in] data the message
1456 * @param[in] data_size size of the data
1457 * @param[in] now the current time
1458 */
1459static void fr_network_directory_callback(void *ctx, void const *data, size_t data_size, UNUSED fr_time_t now)
1460{
1461 int num_messages;
1462 fr_network_t *nr = talloc_get_type_abort(ctx, fr_network_t);
1463 fr_listen_t *li = talloc_get_type_abort(*((void * const *)data), fr_listen_t);
1465 fr_app_io_t const *app_io;
1467
1468 if (fr_cond_assert(data_size == sizeof(li))) return;
1469
1470 memcpy(&li, data, sizeof(li));
1471
1472 s = talloc_zero(nr, fr_network_socket_t);
1473 fr_assert(s != NULL);
1474 talloc_steal(s, li);
1475
1476 s->nr = nr;
1477 s->listen = li;
1478 s->number = nr->num_sockets++;
1479
1480 MEM(s->waiting = fr_heap_alloc(s, waiting_cmp, fr_channel_data_t, channel.heap_id, 0));
1481
1482 talloc_set_destructor(s, _network_socket_free);
1483
1484 /*
1485 * Allocate the ring buffer for messages and packets.
1486 */
1487 num_messages = s->listen->num_messages;
1488 if (num_messages < 8) num_messages = 8;
1489
1490 s->ms = fr_message_set_create(s, num_messages,
1491 sizeof(fr_channel_data_t),
1493 if (!s->ms) {
1494 PERROR("Failed creating message buffers for directory IO");
1495 talloc_free(s);
1496 return;
1497 }
1498
1499 app_io = s->listen->app_io;
1500
1501 if (app_io->event_list_set) app_io->event_list_set(s->listen, nr->el, nr);
1502
1504
1505 if (fr_event_filter_insert(nr, NULL, nr->el, s->listen->fd, s->filter,
1506 &funcs,
1507 app_io->error ? fr_network_error : NULL,
1508 s) < 0) {
1509 PERROR("Failed adding directory monitor event loop");
1510 talloc_free(s);
1511 return;
1512 }
1513
1514 (void) fr_rb_insert(nr->sockets, s);
1515 (void) fr_rb_insert(nr->sockets_by_num, s);
1516
1517 DEBUG3("Using new socket with FD %d", s->listen->fd);
1518}
1519
1520/** Handle a network control message callback for a new worker
1521 *
1522 * @param[in] ctx the network
1523 * @param[in] data the message
1524 * @param[in] data_size size of the data
1525 * @param[in] now the current time
1526 */
1527static void fr_network_worker_started_callback(void *ctx, void const *data, size_t data_size, UNUSED fr_time_t now)
1528{
1529 int i;
1530 fr_network_t *nr = ctx;
1531 fr_worker_t *worker;
1533
1534 fr_assert(data_size == sizeof(worker));
1535
1536 memcpy(&worker, data, data_size);
1537 (void) talloc_get_type_abort(worker, fr_worker_t);
1538
1539 MEM(w = talloc_zero(nr, fr_network_worker_t));
1540
1541 w->worker = worker;
1542 w->channel = fr_worker_channel_create(worker, w, nr->control);
1544 fr_fatal_assert_msg(w->channel, "Failed creating new channel");
1545
1548
1549 /*
1550 * FIXME: This creates a race in the network loop
1551 * exit condition, because it can theoretically
1552 * be signalled to exit before the workers have
1553 * ACKd channel creation.
1554 */
1555 nr->num_workers++;
1556
1557 /*
1558 * Insert the worker into the array of workers.
1559 */
1560 for (i = 0; i < nr->max_workers; i++) {
1561 if (nr->workers[i]) continue;
1562
1563 nr->workers[i] = w;
1564 return;
1565 }
1566
1567 /*
1568 * Run out of room to put workers!
1569 */
1570 fr_assert(0 == 1);
1571}
1572
1573/** Handle a network control message callback for a packet sent to a socket
1574 *
1575 * @param[in] ctx the network
1576 * @param[in] data the message
1577 * @param[in] data_size size of the data
1578 * @param[in] now the current time
1579 */
1580static void fr_network_inject_callback(void *ctx, void const *data, size_t data_size, UNUSED fr_time_t now)
1581{
1582 fr_network_t *nr = ctx;
1583 fr_network_inject_t my_inject;
1585
1586 fr_assert(data_size == sizeof(my_inject));
1587
1588 memcpy(&my_inject, data, data_size);
1589 s = fr_rb_find(nr->sockets, &(fr_network_socket_t){ .listen = my_inject.listen });
1590 if (!s) {
1591 talloc_free(my_inject.packet); /* MUST be it's own TALLOC_CTX */
1592 return;
1593 }
1594
1595 /*
1596 * Inject the packet, and then read it back from the
1597 * network.
1598 */
1599 if (s->listen->app_io->inject(s->listen, my_inject.packet, my_inject.packet_len, my_inject.recv_time) == 0) {
1600 fr_network_read(nr->el, s->listen->fd, 0, s);
1601 }
1602
1603 talloc_free(my_inject.packet);
1604}
1605
1606/** Run the event loop 'pre' callback
1607 *
1608 * This function MUST DO NO WORK. All it does is check if there's
1609 * work, and tell the event code to return to the main loop if
1610 * there's work to do.
1611 *
1612 * @param[in] now the current time.
1613 * @param[in] wake the time when the event loop will wake up.
1614 * @param[in] uctx the network
1615 */
1617{
1618 fr_network_t *nr = talloc_get_type_abort(uctx, fr_network_t);
1619
1620 if (fr_heap_num_elements(nr->replies) > 0) return 1;
1621
1622 return 0;
1623}
1624
1625/** Handle replies after all FD and timer events have been serviced
1626 *
1627 * @param el the event loop
1628 * @param now the current time (mostly)
1629 * @param uctx the fr_network_t
1630 */
1632{
1634 fr_network_t *nr = talloc_get_type_abort(uctx, fr_network_t);
1635
1636 /*
1637 * Pull the replies off of our global heap, and try to
1638 * push them to the individual sockets.
1639 */
1640 while ((cd = fr_heap_pop(&nr->replies)) != NULL) {
1641 fr_listen_t *li;
1643
1644 li = cd->listen;
1645
1646 /*
1647 * @todo - cache this somewhere so we don't need
1648 * to do an rbtree lookup for every packet.
1649 */
1650 s = fr_rb_find(nr->sockets, &(fr_network_socket_t){ .listen = li });
1651
1652 /*
1653 * This shouldn't happen, but be safe...
1654 */
1655 if (!s) {
1656 fr_message_done(&cd->m);
1657 continue;
1658 }
1659
1660 if (cd->m.status != FR_MESSAGE_LOCALIZED) {
1661 fr_assert(s->outstanding > 0);
1662 s->outstanding--;
1663 }
1664
1665 /*
1666 * Just mark the message done, and skip it.
1667 */
1668 if (s->dead) {
1669 fr_message_done(&cd->m);
1670
1671 /*
1672 * No more packets, it's safe to delete
1673 * the socket.
1674 */
1675 if (!s->outstanding) talloc_free(s);
1676
1677 continue;
1678 }
1679
1680 /*
1681 * No data to write to the socket, so we skip the message.
1682 */
1683 if (!cd->m.data_size) {
1684 fr_message_done(&cd->m);
1685 continue;
1686 }
1687
1688 /*
1689 * No pending message, let's try writing it.
1690 *
1691 * If there is a pending message, then we're
1692 * waiting for IO write to become ready.
1693 */
1694 if (!s->pending) {
1695 fr_assert(!s->blocked);
1696 (void) fr_heap_insert(&s->waiting, cd);
1697 fr_network_write(nr->el, s->listen->fd, 0, s);
1698 }
1699 }
1700}
1701
1702/** Stop a network thread in an orderly way
1703 *
1704 * @param[in] nr the network to stop
1705 */
1707{
1709
1710 (void) talloc_get_type_abort(nr, fr_network_t);
1711
1712 /*
1713 * Close the network sockets
1714 */
1715 {
1716 fr_network_socket_t **sockets;
1717 size_t len;
1718 size_t i;
1719
1720 if (fr_rb_flatten_inorder(nr, (void ***)&sockets, nr->sockets) < 0) return -1;
1721 len = talloc_array_length(sockets);
1722
1723 for (i = 0; i < len; i++) {
1724 /*
1725 * Force to zero so we don't trigger asserts
1726 * if packets are being processed and the
1727 * server exits.
1728 */
1729 sockets[i]->outstanding = 0;
1730 talloc_free(sockets[i]);
1731 }
1732
1733 talloc_free(sockets);
1734 }
1735
1736
1737 /*
1738 * Clean up all outstanding replies.
1739 *
1740 * We can't do this after signalling the
1741 * workers to close, because they free
1742 * their message sets, and we end up
1743 * getting random use-after-free errors
1744 * as there's a race between the network
1745 * popping replies, and the workers
1746 * freeing their message sets.
1747 *
1748 * This isn't perfect, and we might still
1749 * lose some replies, but it's good enough
1750 * for now.
1751 *
1752 * @todo - call transport "done" for the reply, so that
1753 * it knows the replies are done, too.
1754 */
1755 while ((cd = fr_heap_pop(&nr->replies)) != NULL) {
1756 fr_message_done(&cd->m);
1757 }
1758
1759 /*
1760 * Signal the workers that we're closing
1761 *
1762 * nr->num_workers is decremented every
1763 * time a worker closes a socket.
1764 *
1765 * When nr->num_workers == 0, the event
1766 * loop (fr_network()) will exit.
1767 */
1768 {
1769 int i;
1770
1771 for (i = 0; i < nr->num_workers; i++) {
1772 fr_network_worker_t *worker = nr->workers[i];
1773
1775 }
1776 }
1777
1780 nr->exiting = true;
1782
1783 return 0;
1784}
1785
1786/** Read handler for signal pipe
1787 *
1788 */
1789static void _signal_pipe_read(UNUSED fr_event_list_t *el, int fd, UNUSED int flags, void *uctx)
1790{
1791 fr_network_t *nr = talloc_get_type_abort(uctx, fr_network_t);
1792 uint8_t buff;
1793
1794 if (read(fd, &buff, sizeof(buff)) < 0) {
1795 ERROR("Failed reading signal - %s", fr_syserror(errno));
1796 return;
1797 }
1798
1799 fr_assert(buff == 1);
1800
1801 /*
1802 * fr_network_stop() will signal the workers
1803 * to exit (by closing their channels).
1804 *
1805 * When we get the ack, we decrement our
1806 * nr->num_workers counter.
1807 *
1808 * When the counter reaches 0, the event loop
1809 * exits.
1810 */
1811 DEBUG2("Signalled to exit");
1812
1813 if (unlikely(fr_network_destroy(nr) < 0)) {
1814 PERROR("Failed stopping network");
1815 }
1816}
1817
1818/** The main network worker function.
1819 *
1820 * @param[in] nr the network data structure to run.
1821 */
1823{
1824 /*
1825 * Run until we're told to exit AND the number of
1826 * workers has dropped to zero.
1827 *
1828 * This is important as if we exit too early we
1829 * free the channels out from underneath the
1830 * workers and they read uninitialised memory.
1831 *
1832 * Whenever a worker ACKs our close notification
1833 * nr->num_workers is decremented, so when
1834 * nr->num_workers == 0, all workers have ACKd
1835 * our close and are no longer using the channel.
1836 */
1837 while (likely(!(nr->exiting && (nr->num_workers == 0)))) {
1838 bool wait_for_event;
1839 int num_events;
1840
1841 /*
1842 * There are runnable requests. We still service
1843 * the event loop, but we don't wait for events.
1844 */
1845 wait_for_event = (fr_heap_num_elements(nr->replies) == 0);
1846
1847 /*
1848 * Check the event list. If there's an error
1849 * (e.g. exit), we stop looping and clean up.
1850 */
1851 DEBUG4("Gathering events - %s", wait_for_event ? "will wait" : "Will not wait");
1852 num_events = fr_event_corral(nr->el, fr_time(), wait_for_event);
1853 DEBUG4("%u event(s) pending%s",
1854 num_events == -1 ? 0 : num_events, num_events == -1 ? " - event loop exiting" : "");
1855 if (num_events < 0) break;
1856
1857 /*
1858 * Service outstanding events.
1859 */
1860 if (num_events > 0) {
1861 DEBUG4("Servicing event(s)");
1862 fr_event_service(nr->el);
1863 }
1864 }
1865 return;
1866}
1867
1868/** Signal a network thread to exit
1869 *
1870 * @note Request to exit will be processed asynchronously.
1871 *
1872 * @param[in] nr the network data structure to manage
1873 * @return
1874 * - 0 on success.
1875 * - -1 on failure.
1876 */
1878{
1879 if (write(nr->signal_pipe[1], &(uint8_t){ 0x01 }, 1) < 0) {
1880 fr_strerror_printf("Failed signalling network thread to exit - %s", fr_syserror(errno));
1881 return -1;
1882 }
1883
1884 return 0;
1885}
1886
1887/** Free any resources associated with a network thread
1888 *
1889 */
1891{
1892 if (nr->signal_pipe[0] >= 0) close(nr->signal_pipe[0]);
1893 if (nr->signal_pipe[1] >= 0) close(nr->signal_pipe[1]);
1894
1895 return 0;
1896}
1897
1898/** Create a network
1899 *
1900 * @param[in] ctx The talloc ctx
1901 * @param[in] el The event list
1902 * @param[in] name Networker identifier.
1903 * @param[in] logger The destination for all logging messages
1904 * @param[in] lvl Log level
1905 * @param[in] config configuration structure.
1906 * @return
1907 * - NULL on error
1908 * - fr_network_t on success
1909 */
1910fr_network_t *fr_network_create(TALLOC_CTX *ctx, fr_event_list_t *el, char const *name,
1911 fr_log_t const *logger, fr_log_lvl_t lvl,
1913{
1914 fr_network_t *nr;
1915
1916 nr = talloc_zero(ctx, fr_network_t);
1917 if (!nr) {
1918 fr_strerror_const("Failed allocating memory");
1919 return NULL;
1920 }
1921 talloc_set_destructor(nr, _fr_network_free);
1922
1923 nr->name = talloc_strdup(nr, name);
1924
1925 nr->thread_id = pthread_self();
1926 nr->el = el;
1927 nr->log = logger;
1928 nr->lvl = lvl;
1929
1931 nr->num_workers = 0;
1932 nr->signal_pipe[0] = -1;
1933 nr->signal_pipe[1] = -1;
1934 if (config) nr->config = *config;
1935
1936 nr->aq_control = fr_atomic_queue_alloc(nr, 1024);
1937 if (!nr->aq_control) {
1938 talloc_free(nr);
1939 return NULL;
1940 }
1941
1942 nr->control = fr_control_create(nr, el, nr->aq_control);
1943 if (!nr->control) {
1944 fr_strerror_const_push("Failed creating control queue");
1945 fail:
1946 talloc_free(nr);
1947 return NULL;
1948 }
1949
1950 /*
1951 * @todo - rely on thread-local variables. And then the
1952 * various users of this can check if (rb == nr->rb), and
1953 * if so, skip the whole control plane / kevent /
1954 * whatever roundabout thing.
1955 */
1957 if (!nr->rb) {
1958 fr_strerror_const_push("Failed creating ring buffer");
1959 fail2:
1960 talloc_free(nr->control);
1961 goto fail;
1962 }
1963
1965 fr_strerror_const_push("Failed adding channel callback");
1966 goto fail2;
1967 }
1968
1970 fr_strerror_const_push("Failed adding socket callback");
1971 goto fail2;
1972 }
1973
1975 fr_strerror_const_push("Failed adding socket callback");
1976 goto fail2;
1977 }
1978
1980 fr_strerror_const_push("Failed adding worker callback");
1981 goto fail2;
1982 }
1983
1985 fr_strerror_const_push("Failed adding packet injection callback");
1986 goto fail2;
1987 }
1988
1989 /*
1990 * Create the various heaps.
1991 */
1993 if (!nr->sockets) {
1994 fr_strerror_const_push("Failed creating listen tree for sockets");
1995 goto fail2;
1996 }
1997
1999 if (!nr->sockets_by_num) {
2000 fr_strerror_const_push("Failed creating number tree for sockets");
2001 goto fail2;
2002 }
2003
2004 nr->replies = fr_heap_alloc(nr, reply_cmp, fr_channel_data_t, channel.heap_id, 0);
2005 if (!nr->replies) {
2006 fr_strerror_const_push("Failed creating heap for replies");
2007 goto fail2;
2008 }
2009
2010 if (fr_event_pre_insert(nr->el, fr_network_pre_event, nr) < 0) {
2011 fr_strerror_const("Failed adding pre-check to event list");
2012 goto fail2;
2013 }
2014
2015 if (fr_event_post_insert(nr->el, fr_network_post_event, nr) < 0) {
2016 fr_strerror_const("Failed inserting post-processing event");
2017 goto fail2;
2018 }
2019
2020 if (pipe(nr->signal_pipe) < 0) {
2021 fr_strerror_printf("Failed initialising signal pipe - %s", fr_syserror(errno));
2022 goto fail2;
2023 }
2024 if (fr_nonblock(nr->signal_pipe[0]) < 0) goto fail2;
2025 if (fr_nonblock(nr->signal_pipe[1]) < 0) goto fail2;
2026
2027 if (fr_event_fd_insert(nr, NULL, nr->el, nr->signal_pipe[0], _signal_pipe_read, NULL, NULL, nr) < 0) {
2028 fr_strerror_const("Failed inserting event for signal pipe");
2029 goto fail2;
2030 }
2031
2032 return nr;
2033}
2034
2035int fr_network_stats(fr_network_t const *nr, int num, uint64_t *stats)
2036{
2037 if (num < 0) return -1;
2038 if (num == 0) return 0;
2039
2040 stats[0] = nr->stats.in;
2041 if (num >= 2) stats[1] = nr->stats.out;
2042 if (num >= 3) stats[2] = nr->stats.dup;
2043 if (num >= 4) stats[3] = nr->stats.dropped;
2044 if (num >= 5) stats[4] = nr->num_workers;
2045
2046 if (num <= 5) return num;
2047
2048 return 5;
2049}
2050
2051void fr_network_stats_log(fr_network_t const *nr, fr_log_t const *log)
2052{
2053 int i;
2054
2055 /*
2056 * Dump all of the channel statistics.
2057 */
2058 for (i = 0; i < nr->max_workers; i++) {
2059 if (!nr->workers[i]) continue;
2060
2061 fr_channel_stats_log(nr->workers[i]->channel, log, __FILE__, __LINE__);
2062 }
2063}
2064
2065static int cmd_stats_self(FILE *fp, UNUSED FILE *fp_err, void *ctx, UNUSED fr_cmd_info_t const *info)
2066{
2067 fr_network_t const *nr = ctx;
2068
2069 fprintf(fp, "count.in\t%" PRIu64 "\n", nr->stats.in);
2070 fprintf(fp, "count.out\t%" PRIu64 "\n", nr->stats.out);
2071 fprintf(fp, "count.dup\t%" PRIu64 "\n", nr->stats.dup);
2072 fprintf(fp, "count.dropped\t%" PRIu64 "\n", nr->stats.dropped);
2073 fprintf(fp, "count.sockets\t%u\n", fr_rb_num_elements(nr->sockets));
2074
2075 return 0;
2076}
2077
2078static int cmd_socket_list(FILE *fp, UNUSED FILE *fp_err, void *ctx, UNUSED fr_cmd_info_t const *info)
2079{
2080 fr_network_t const *nr = ctx;
2083
2084 // @todo - note that this isn't thread-safe!
2085
2086 for (s = fr_rb_iter_init_inorder(&iter, nr->sockets);
2087 s != NULL;
2088 s = fr_rb_iter_next_inorder(&iter)) {
2089 if (!s->listen->app_io->get_name) {
2090 fprintf(fp, "%s\n", s->listen->app_io->common.name);
2091 } else {
2092 fprintf(fp, "%d\t%s\n", s->number, s->listen->app_io->get_name(s->listen));
2093 }
2094 }
2095 return 0;
2096}
2097
2098static int cmd_stats_socket(FILE *fp, FILE *fp_err, void *ctx, fr_cmd_info_t const *info)
2099{
2100 fr_network_t const *nr = ctx;
2102
2103 s = fr_rb_find(nr->sockets_by_num, &(fr_network_socket_t){ .number = info->box[0]->vb_uint32 });
2104 if (!s) {
2105 fprintf(fp_err, "No such socket number '%s'.\n", info->argv[0]);
2106 return -1;
2107 }
2108
2109 fprintf(fp, "count.in\t%" PRIu64 "\n", s->stats.in);
2110 fprintf(fp, "count.out\t%" PRIu64 "\n", s->stats.out);
2111 fprintf(fp, "count.dup\t%" PRIu64 "\n", s->stats.dup);
2112 fprintf(fp, "count.dropped\t%" PRIu64 "\n", s->stats.dropped);
2113
2114 return 0;
2115}
2116
2117
2119 {
2120 .parent = "stats",
2121 .name = "network",
2122 .help = "Statistics for network threads.",
2123 .read_only = true
2124 },
2125
2126 {
2127 .parent = "stats network",
2128 .add_name = true,
2129 .name = "self",
2130 .func = cmd_stats_self,
2131 .help = "Show statistics for a specific network thread.",
2132 .read_only = true
2133 },
2134
2135 {
2136 .parent = "stats network",
2137 .add_name = true,
2138 .name = "socket",
2139 .syntax = "INTEGER",
2140 .func = cmd_stats_socket,
2141 .help = "Show statistics for a specific socket",
2142 .read_only = true
2143 },
2144
2145 {
2146 .parent = "show",
2147 .name = "network",
2148 .help = "Show information about network threads.",
2149 .read_only = true
2150 },
2151
2152 {
2153 .parent = "show network",
2154 .add_name = true,
2155 .name = "socket",
2156 .syntax = "list",
2157 .func = cmd_socket_list,
2158 .help = "List the sockets associated with this network thread.",
2159 .read_only = true
2160 },
2161
2163};
static int const char char buffer[256]
Definition acutest.h:578
fr_io_close_t close
Close the transport.
Definition app_io.h:60
fr_io_data_read_t read
Read from a socket to a data buffer.
Definition app_io.h:47
module_t common
Common fields to all loadable modules.
Definition app_io.h:34
fr_io_signal_t error
There was an error on the socket.
Definition app_io.h:59
fr_app_event_list_set_t event_list_set
Called by the network thread to pass an event list for use by the app_io_t.
Definition app_io.h:36
fr_io_data_inject_t inject
Inject a packet into a socket.
Definition app_io.h:50
fr_io_data_vnode_t vnode
Handle notifications that the VNODE has changed.
Definition app_io.h:52
fr_io_data_write_t write
Write from a data buffer to a socket.
Definition app_io.h:48
fr_io_name_t get_name
get the socket name
Definition app_io.h:70
Public structure describing an I/O path for a protocol.
Definition app_io.h:33
fr_app_priority_get_t priority
Assign a priority to the packet.
Definition application.h:90
#define fr_atexit_thread_local(_name, _free, _uctx)
Definition atexit.h:221
fr_atomic_queue_t * fr_atomic_queue_alloc(TALLOC_CTX *ctx, size_t size)
Create fixed-size atomic queue.
Structure to hold the atomic queue.
#define RCSID(id)
Definition build.h:485
#define CMP(_a, _b)
Same as CMP_PREFER_SMALLER use when you don't really care about ordering, you just want an ordering.
Definition build.h:112
#define unlikely(_x)
Definition build.h:383
#define UNUSED
Definition build.h:317
char const * cf_section_name2(CONF_SECTION const *cs)
Return the second identifier of a CONF_SECTION.
Definition cf_util.c:1184
void * fr_channel_requestor_uctx_get(fr_channel_t *ch)
Get network-specific data from a channel.
Definition channel.c:922
fr_table_num_sorted_t const channel_signals[]
Definition channel.c:153
bool fr_channel_recv_reply(fr_channel_t *ch)
Receive a reply message from the channel.
Definition channel.c:408
int fr_channel_signal_responder_close(fr_channel_t *ch)
Signal a responder that the channel is closing.
Definition channel.c:824
int fr_channel_send_request(fr_channel_t *ch, fr_channel_data_t *cd)
Send a request message into the channel.
Definition channel.c:306
int fr_channel_set_recv_reply(fr_channel_t *ch, void *uctx, fr_channel_recv_callback_t recv_reply)
Definition channel.c:930
fr_channel_event_t fr_channel_service_message(fr_time_t when, fr_channel_t **p_channel, void const *data, size_t data_size)
Service a control-plane message.
Definition channel.c:685
void fr_channel_requestor_uctx_add(fr_channel_t *ch, void *uctx)
Add network-specific data to a channel.
Definition channel.c:910
void fr_channel_stats_log(fr_channel_t const *ch, fr_log_t const *log, char const *file, int line)
Definition channel.c:963
A full channel, which consists of two ends.
Definition channel.c:144
fr_message_t m
the message header
Definition channel.h:105
fr_channel_event_t
Definition channel.h:67
@ FR_CHANNEL_NOOP
Definition channel.h:74
@ FR_CHANNEL_EMPTY
Definition channel.h:75
@ FR_CHANNEL_CLOSE
Definition channel.h:72
@ FR_CHANNEL_ERROR
Definition channel.h:68
@ FR_CHANNEL_DATA_READY_REQUESTOR
Definition channel.h:70
@ FR_CHANNEL_OPEN
Definition channel.h:71
@ FR_CHANNEL_DATA_READY_RESPONDER
Definition channel.h:69
void * packet_ctx
Packet specific context for holding client information, and other proto_* specific information that n...
Definition channel.h:142
fr_listen_t * listen
for tracking packet transport, etc.
Definition channel.h:146
#define PRIORITY_NORMAL
Definition channel.h:151
#define PRIORITY_NOW
Definition channel.h:149
uint32_t priority
Priority of this packet.
Definition channel.h:140
Channel information which is added to a message.
Definition channel.h:104
char const * parent
e.g. "show module"
Definition command.h:52
#define CMD_TABLE_END
Definition command.h:62
char const ** argv
text version of commands
Definition command.h:42
#define FR_CONTROL_ID_INJECT
Definition control.h:60
#define FR_CONTROL_ID_DIRECTORY
Definition control.h:59
#define FR_CONTROL_ID_CHANNEL
Definition control.h:56
#define FR_CONTROL_ID_LISTEN
Definition control.h:57
#define FR_CONTROL_ID_WORKER
Definition control.h:58
#define FR_CONTROL_MAX_SIZE
Definition control.h:51
#define FR_CONTROL_MAX_MESSAGES
Definition control.h:50
#define fr_cond_assert(_x)
Calls panic_action ifndef NDEBUG, else logs error and evaluates to value of _x.
Definition debug.h:131
#define fr_cond_assert_msg(_x, _fmt,...)
Calls panic_action ifndef NDEBUG, else logs error and evaluates to value of _x.
Definition debug.h:148
#define fr_fatal_assert_msg(_x, _fmt,...)
Calls panic_action ifndef NDEBUG, else logs error and causes the server to exit immediately with code...
Definition debug.h:176
#define MEM(x)
Definition debug.h:36
#define ERROR(fmt,...)
Definition dhcpclient.c:41
static int sockfd
Definition dhcpclient.c:56
fr_dict_t const * fr_dict_proto_dict(fr_dict_t const *dict)
Definition dict_util.c:5113
#define fr_event_fd_insert(...)
Definition event.h:248
fr_event_filter_t
The type of filter to install for an FD.
Definition event.h:83
@ FR_EVENT_FILTER_VNODE
Filter for vnode subfilters.
Definition event.h:85
@ FR_EVENT_FILTER_IO
Combined filter for read/write functions/.
Definition event.h:84
#define fr_event_filter_update(...)
Definition event.h:240
#define fr_event_filter_insert(...)
Definition event.h:235
#define FR_EVENT_RESUME(_s, _f)
Re-add the filter for a func from kevent.
Definition event.h:132
#define FR_EVENT_SUSPEND(_s, _f)
Temporarily remove the filter for a func from kevent.
Definition event.h:116
fr_event_fd_cb_t extend
Additional files were added to a directory.
Definition event.h:199
Callbacks for the FR_EVENT_FILTER_IO filter.
Definition event.h:189
Structure describing a modification to a filter's state.
Definition event.h:97
Callbacks for the FR_EVENT_FILTER_VNODE filter.
Definition event.h:196
int fr_heap_insert(fr_heap_t **hp, void *data)
Insert a new element into the heap.
Definition heap.c:146
void * fr_heap_pop(fr_heap_t **hp)
Remove a node from the heap.
Definition heap.c:322
unsigned int fr_heap_index_t
Definition heap.h:80
#define fr_heap_alloc(_ctx, _cmp, _type, _field, _init)
Creates a heap that can be used with non-talloced elements.
Definition heap.h:100
static unsigned int fr_heap_num_elements(fr_heap_t *h)
Return the number of elements in the heap.
Definition heap.h:179
#define FR_HEAP_INDEX_INVALID
Definition heap.h:83
The main heap structure.
Definition heap.h:66
uint64_t out
Definition base.h:43
uint64_t dup
Definition base.h:44
uint64_t dropped
Definition base.h:45
uint64_t in
Definition base.h:42
int fr_control_callback_add(fr_control_t *c, uint32_t id, void *ctx, fr_control_callback_t callback)
Register a callback for an ID.
Definition control.c:417
int fr_control_message_send(fr_control_t *c, fr_ring_buffer_t *rb, uint32_t id, void *data, size_t data_size)
Send a control-plane message.
Definition control.c:332
fr_control_t * fr_control_create(TALLOC_CTX *ctx, fr_event_list_t *el, fr_atomic_queue_t *aq)
Create a control-plane signaling path.
Definition control.c:143
The control structure.
Definition control.c:79
bool read_hexdump
Do we debug hexdump packets as they're read.
Definition listen.h:52
size_t num_messages
for the message ring buffer
Definition listen.h:56
bool non_socket_listener
special internal listener that does not use sockets.
Definition listen.h:46
char const * name
printable name for this socket - set by open
Definition listen.h:29
void const * app_instance
Definition listen.h:39
size_t default_message_size
copied from app_io, but may be changed
Definition listen.h:55
bool write_hexdump
Do we debug hexdump packets as they're written.
Definition listen.h:53
fr_app_t const * app
Definition listen.h:38
CONF_SECTION * server_cs
CONF_SECTION of the server.
Definition listen.h:41
bool no_write_callback
sometimes we don't need to do writes
Definition listen.h:45
int fd
file descriptor for this socket - set by open
Definition listen.h:28
fr_dict_t const * dict
dictionary for this listener
Definition listen.h:30
bool needs_full_setup
Set to true to avoid the short cut when adding the listener.
Definition listen.h:47
fr_app_io_t const * app_io
I/O path functions.
Definition listen.h:32
fr_ring_buffer_t * rb
ring buffer for my control-plane messages
Definition network.c:126
fr_cmd_table_t cmd_network_table[]
Definition network.c:2118
size_t fr_network_listen_outstanding(fr_network_t *nr, fr_listen_t *li)
Get the number of outstanding packets.
Definition network.c:823
size_t written
however much we did in a partial write
Definition network.c:92
int fr_network_listen_send_packet(fr_network_t *nr, fr_listen_t *parent, fr_listen_t *li, const uint8_t *buffer, size_t buflen, fr_time_t recv_time, void *packet_ctx)
Send a packet to the worker.
Definition network.c:781
fr_atomic_queue_t * aq_control
atomic queue for control messages sent to me
Definition network.c:122
static int cmd_stats_socket(FILE *fp, FILE *fp_err, void *ctx, fr_cmd_info_t const *info)
Definition network.c:2098
int fr_network_listen_add(fr_network_t *nr, fr_listen_t *li)
Add a fr_listen_t to a network.
Definition network.c:236
bool suspended
whether or not we're suspended.
Definition network.c:117
int fr_network_worker_add(fr_network_t *nr, fr_worker_t *worker)
Add a worker to a network in a different thread.
Definition network.c:305
int fr_network_destroy(fr_network_t *nr)
Stop a network thread in an orderly way.
Definition network.c:1706
fr_network_t * nr
O(N) issues in talloc.
Definition network.c:77
fr_io_stats_t stats
Definition network.c:70
fr_listen_t * listen
Definition network.c:52
static void fr_network_listen_callback(void *ctx, void const *data, size_t data_size, UNUSED fr_time_t now)
Handle a network control message callback for a new listener.
Definition network.c:1332
uint8_t * packet
Definition network.c:53
static int cmd_stats_self(FILE *fp, UNUSED FILE *fp_err, void *ctx, UNUSED fr_cmd_info_t const *info)
Definition network.c:2065
fr_log_t const * log
log destination
Definition network.c:119
int fr_network_directory_add(fr_network_t *nr, fr_listen_t *li)
Add a "watch directory" call to a network.
Definition network.c:290
static int _fr_network_free(fr_network_t *nr)
Free any resources associated with a network thread.
Definition network.c:1890
static void fr_network_inject_callback(void *ctx, void const *data, size_t data_size, UNUSED fr_time_t now)
Handle a network control message callback for a packet sent to a socket.
Definition network.c:1580
fr_heap_index_t heap_id
for the sockets_by_num heap
Definition network.c:79
#define RTT(_old, _new)
Definition network.c:496
void fr_network(fr_network_t *nr)
The main network worker function.
Definition network.c:1822
fr_message_set_t * ms
message buffers for this socket.
Definition network.c:89
int fr_network_listen_delete(fr_network_t *nr, fr_listen_t *li)
Delete a socket from a network.
Definition network.c:271
int num_blocked
number of blocked workers
Definition network.c:138
static void fr_network_worker_started_callback(void *ctx, void const *data, size_t data_size, fr_time_t now)
char const * name
Network ID for logging.
Definition network.c:113
void fr_network_worker_add_self(fr_network_t *nr, fr_worker_t *worker)
Add a worker to a network in the same thread.
Definition network.c:325
unsigned int outstanding
number of outstanding packets sent to the worker
Definition network.c:86
static _Thread_local fr_ring_buffer_t * fr_network_rb
Definition network.c:49
int number
unique ID
Definition network.c:78
static fr_event_update_t const resume_write[]
Definition network.c:1144
fr_time_delta_t predicted
predicted processing time for one packet
Definition network.c:64
static int fr_network_pre_event(fr_time_t now, fr_time_delta_t wake, void *uctx)
fr_worker_t * worker
worker pointer
Definition network.c:69
int fr_network_sendto_worker(fr_network_t *nr, fr_listen_t *li, void *packet_ctx, uint8_t const *data, size_t data_len, fr_time_t recv_time)
Definition network.c:1049
int fr_network_exit(fr_network_t *nr)
Signal a network thread to exit.
Definition network.c:1877
#define MAX_WORKERS
Definition network.c:47
int fr_network_listen_inject(fr_network_t *nr, fr_listen_t *li, uint8_t const *packet, size_t packet_len, fr_time_t recv_time)
Inject a packet for a listener to read.
Definition network.c:410
fr_listen_t * listen
I/O ctx and functions.
Definition network.c:87
int num_sockets
actually a counter...
Definition network.c:141
fr_rb_node_t listen_node
rbtree node for looking up by listener.
Definition network.c:74
static void fr_network_vnode_extend(UNUSED fr_event_list_t *el, int sockfd, int fflags, void *ctx)
Get a notification that a vnode changed.
Definition network.c:1094
static void _signal_pipe_read(UNUSED fr_event_list_t *el, int fd, UNUSED int flags, void *uctx)
Read handler for signal pipe.
Definition network.c:1789
#define OUTSTANDING(_x)
Definition network.c:613
static int8_t reply_cmp(void const *one, void const *two)
Definition network.c:157
int num_workers
number of active workers
Definition network.c:137
static int8_t socket_num_cmp(void const *one, void const *two)
Definition network.c:186
int num_pending_workers
number of workers we're waiting to start.
Definition network.c:139
fr_rb_tree_t * sockets
list of sockets we're managing, ordered by the listener
Definition network.c:134
pthread_t thread_id
for self
Definition network.c:115
fr_log_lvl_t lvl
debug log level
Definition network.c:120
int signal_pipe[2]
Pipe for signalling the worker in an orderly way.
Definition network.c:143
fr_channel_data_t * pending
the currently pending partial packet
Definition network.c:94
static int8_t socket_listen_cmp(void const *one, void const *two)
Definition network.c:179
static void fr_network_write(UNUSED fr_event_list_t *el, UNUSED int sockfd, UNUSED int flags, void *ctx)
Write packets to the network.
Definition network.c:1157
fr_event_list_t * el
our event list
Definition network.c:128
fr_heap_t * replies
replies from the worker, ordered by priority / origin time
Definition network.c:130
static int fr_network_send_request(fr_network_t *nr, fr_channel_data_t *cd)
Send a message on the "best" channel.
Definition network.c:620
void fr_network_stats_log(fr_network_t const *nr, fr_log_t const *log)
Definition network.c:2051
fr_heap_t * waiting
packets waiting to be written
Definition network.c:95
int fr_network_stats(fr_network_t const *nr, int num, uint64_t *stats)
Definition network.c:2035
fr_heap_index_t heap_id
workers are in a heap
Definition network.c:62
bool blocked
is this worker blocked?
Definition network.c:66
static void fr_network_read(UNUSED fr_event_list_t *el, int sockfd, UNUSED int flags, void *ctx)
Read a packet from the network.
Definition network.c:880
static bool is_network_thread(fr_network_t const *nr)
Definition network.c:224
fr_rb_node_t num_node
rbtree node for looking up by number.
Definition network.c:75
static void fr_network_error(UNUSED fr_event_list_t *el, UNUSED int sockfd, int flags, int fd_errno, void *ctx)
Handle errors for a socket.
Definition network.c:1119
fr_io_stats_t stats
Definition network.c:96
static fr_ring_buffer_t * fr_network_rb_init(void)
Initialise thread local storage.
Definition network.c:206
fr_channel_data_t * cd
cached in case of allocation & read error
Definition network.c:90
static int fr_network_listen_add_self(fr_network_t *nr, fr_listen_t *listen)
Definition network.c:1346
static void fr_network_suspend(fr_network_t *nr)
Definition network.c:457
bool dead
is it dead?
Definition network.c:83
size_t leftover
leftover data from a previous read
Definition network.c:91
static void fr_network_post_event(fr_event_list_t *el, fr_time_t now, void *uctx)
fr_network_worker_t * workers[MAX_WORKERS]
each worker
Definition network.c:149
fr_time_t recv_time
Definition network.c:55
static void fr_network_unsuspend(fr_network_t *nr)
Definition network.c:476
fr_rb_tree_t * sockets_by_num
ordered by number;
Definition network.c:135
fr_network_config_t config
configuration
Definition network.c:148
void fr_network_listen_read(fr_network_t *nr, fr_listen_t *li)
Signal the network to read from a listener.
Definition network.c:336
static int8_t waiting_cmp(void const *one, void const *two)
Definition network.c:168
fr_io_stats_t stats
Definition network.c:132
static int _fr_network_rb_free(void *arg)
Definition network.c:197
static void fr_network_recv_reply(void *ctx, fr_channel_t *ch, fr_channel_data_t *cd)
Callback which handles a message being received on the network side.
Definition network.c:504
int max_workers
maximum number of allowed workers
Definition network.c:140
void fr_network_listen_write(fr_network_t *nr, fr_listen_t *li, uint8_t const *packet, size_t packet_len, void *packet_ctx, fr_time_t request_time)
Inject a packet for a listener to write.
Definition network.c:362
bool exiting
are we exiting?
Definition network.c:146
fr_event_filter_t filter
what type of filter it is
Definition network.c:81
static void fr_network_socket_dead(fr_network_t *nr, fr_network_socket_t *s)
Definition network.c:839
static void fr_network_directory_callback(void *ctx, void const *data, size_t data_size, UNUSED fr_time_t now)
Handle a network control message callback for a new "watch directory".
Definition network.c:1459
fr_channel_t * channel
channel to the worker
Definition network.c:68
static fr_event_update_t const pause_write[]
Definition network.c:1139
fr_network_t * fr_network_create(TALLOC_CTX *ctx, fr_event_list_t *el, char const *name, fr_log_t const *logger, fr_log_lvl_t lvl, fr_network_config_t const *config)
Create a network.
Definition network.c:1910
static int _network_socket_free(fr_network_socket_t *s)
Definition network.c:1288
static void fr_network_channel_callback(void *ctx, void const *data, size_t data_size, fr_time_t now)
Handle a network control message callback for a channel.
Definition network.c:552
static int cmd_socket_list(FILE *fp, UNUSED FILE *fp_err, void *ctx, UNUSED fr_cmd_info_t const *info)
Definition network.c:2078
fr_time_delta_t cpu_time
how much CPU time this worker has spent
Definition network.c:63
fr_control_t * control
the control plane
Definition network.c:124
bool blocked
is it blocked?
Definition network.c:84
Associate a worker thread with a network thread.
Definition network.c:61
uint32_t max_outstanding
Definition network.h:46
#define PERROR(_fmt,...)
Definition log.h:228
#define DEBUG3(_fmt,...)
Definition log.h:266
#define DEBUG4(_fmt,...)
Definition log.h:267
#define HEXDUMP2(_data, _len, _fmt,...)
Definition log.h:722
#define RATE_LIMIT_GLOBAL(_log, _fmt,...)
Rate limit messages using a global limiting entry.
Definition log.h:641
void fr_event_service(fr_event_list_t *el)
Service any outstanding timer or file descriptor events.
Definition event.c:2193
int fr_event_pre_delete(fr_event_list_t *el, fr_event_status_cb_t callback, void *uctx)
Delete a pre-event callback from the event list.
Definition event.c:1975
int fr_event_corral(fr_event_list_t *el, fr_time_t now, bool wait)
Gather outstanding timer and file descriptor events.
Definition event.c:2058
talloc_free(reap)
int fr_event_post_delete(fr_event_list_t *el, fr_event_post_cb_t callback, void *uctx)
Delete a post-event callback from the event list.
Definition event.c:2029
int fr_event_pre_insert(fr_event_list_t *el, fr_event_status_cb_t callback, void *uctx)
Add a pre-event callback to the event list.
Definition event.c:1953
int fr_event_fd_delete(fr_event_list_t *el, int fd, fr_event_filter_t filter)
Remove a file descriptor from the event loop.
Definition event.c:1203
int fr_event_post_insert(fr_event_list_t *el, fr_event_post_cb_t callback, void *uctx)
Add a post-event callback to the event list.
Definition event.c:2007
Stores all information relating to an event list.
Definition event.c:377
void fr_log(fr_log_t const *log, fr_log_type_t type, char const *file, int line, char const *fmt,...)
Send a server log message to its destination.
Definition log.c:577
fr_log_lvl_t
Definition log.h:67
@ L_DBG
Only displayed when debugging is enabled.
Definition log.h:59
static fr_event_update_t pause_read[]
Definition master.c:170
static fr_event_update_t resume_read[]
Definition master.c:175
unsigned int uint32_t
long int ssize_t
unsigned char uint8_t
int fr_message_done(fr_message_t *m)
Mark a message as done.
Definition message.c:190
fr_message_t * fr_message_alloc(fr_message_set_t *ms, fr_message_t *m, size_t actual_packet_size)
Allocate packet data for a message.
Definition message.c:988
fr_message_t * fr_message_localize(TALLOC_CTX *ctx, fr_message_t *m, size_t message_size)
Localize a message by copying it to local storage.
Definition message.c:242
fr_message_t * fr_message_reserve(fr_message_set_t *ms, size_t reserve_size)
Reserve a message.
Definition message.c:934
fr_message_t * fr_message_alloc_reserve(fr_message_set_t *ms, fr_message_t *m, size_t actual_packet_size, size_t leftover, size_t reserve_size)
Allocate packet data for a message, and reserve a new message.
Definition message.c:1077
fr_message_set_t * fr_message_set_create(TALLOC_CTX *ctx, int num_messages, size_t message_size, size_t ring_buffer_size)
Create a message set.
Definition message.c:127
A Message set, composed of message headers and ring buffer data.
Definition message.c:95
size_t rb_size
cache-aligned size in the ring buffer
Definition message.h:51
fr_time_t when
when this message was sent
Definition message.h:47
uint8_t * data
pointer to the data in the ring buffer
Definition message.h:49
size_t data_size
size of the data in the ring buffer
Definition message.h:50
@ FR_MESSAGE_USED
Definition message.h:39
@ FR_MESSAGE_LOCALIZED
Definition message.h:40
fr_message_status_t status
free, used, done, etc.
Definition message.h:45
int fr_nonblock(UNUSED int fd)
Definition misc.c:294
static const conf_parser_t config[]
Definition base.c:186
#define fr_assert(_expr)
Definition rad_assert.h:38
#define DEBUG2(fmt,...)
Definition radclient.h:43
static fr_app_io_t app_io
uint32_t fr_rand(void)
Return a 32-bit random number.
Definition rand.c:105
uint32_t fr_rb_num_elements(fr_rb_tree_t *tree)
Return how many nodes there are in a tree.
Definition rb.c:781
void * fr_rb_iter_init_inorder(fr_rb_iter_inorder_t *iter, fr_rb_tree_t *tree)
Initialise an in-order iterator.
Definition rb.c:824
void * fr_rb_iter_next_inorder(fr_rb_iter_inorder_t *iter)
Return the next node.
Definition rb.c:850
void * fr_rb_find(fr_rb_tree_t const *tree, void const *data)
Find an element in the tree, returning the data, not the node.
Definition rb.c:577
bool fr_rb_insert(fr_rb_tree_t *tree, void const *data)
Insert data into a tree.
Definition rb.c:626
bool fr_rb_delete(fr_rb_tree_t *tree, void const *data)
Remove node and free data (if a free function was specified)
Definition rb.c:741
#define fr_rb_inline_talloc_alloc(_ctx, _type, _field, _data_cmp, _data_free)
Allocs a red black that verifies elements are of a specific talloc type.
Definition rb.h:246
int fr_rb_flatten_inorder(TALLOC_CTX *ctx, void **out[], fr_rb_tree_t *tree)
Iterator structure for in-order traversal of an rbtree.
Definition rb.h:321
The main red black tree structure.
Definition rb.h:73
fr_ring_buffer_t * fr_ring_buffer_create(TALLOC_CTX *ctx, size_t size)
Create a ring buffer.
Definition ring_buffer.c:64
static char const * name
static char buff[sizeof("18446744073709551615")+3]
Definition size_tests.c:41
#define fr_time()
Allow us to arbitrarily manipulate time.
Definition state_test.c:8
Definition log.h:96
char const * fr_syserror(int num)
Guaranteed to be thread-safe version of strerror.
Definition syserror.c:243
#define fr_table_str_by_value(_table, _number, _def)
Convert an integer to a string.
Definition table.h:772
#define talloc_get_type_abort_const
Definition talloc.h:244
static fr_time_delta_t fr_time_delta_from_msec(int64_t msec)
Definition time.h:575
static fr_time_delta_t fr_time_delta_add(fr_time_delta_t a, fr_time_delta_t b)
Definition time.h:255
#define fr_time_delta_lt(_a, _b)
Definition time.h:285
#define fr_time_wrap(_time)
Definition time.h:145
#define fr_time_delta_ispos(_a)
Definition time.h:290
static int8_t fr_time_cmp(fr_time_t a, fr_time_t b)
Compare two fr_time_t values.
Definition time.h:916
A time delta, a difference in time measured in nanoseconds.
Definition time.h:80
"server local" time.
Definition time.h:69
close(uq->fd)
static fr_event_list_t * el
static fr_slen_t parent
Definition pair.h:841
void fr_perror(char const *fmt,...)
Print the current error to stderr with a prefix.
Definition strerror.c:732
#define fr_strerror_printf(_fmt,...)
Log to thread local error buffer.
Definition strerror.h:64
#define fr_strerror_const_push(_msg)
Definition strerror.h:227
#define fr_strerror_const(_msg)
Definition strerror.h:223
static fr_slen_t data
Definition value.h:1319
fr_dict_t const * virtual_server_dict_by_cs(CONF_SECTION const *server_cs)
Return the namespace for the virtual server specified by a config section.
fr_channel_t * fr_worker_channel_create(fr_worker_t *worker, TALLOC_CTX *ctx, fr_control_t *master)
Create a channel to the worker.
Definition worker.c:1645
int fr_worker_listen_cancel(fr_worker_t *worker, fr_listen_t const *li)
Definition worker.c:1672
A worker which takes packets from a master, and processes them.
Definition worker.c:99