2 * Asterisk -- A telephony toolkit for Linux.
4 * UDPTL support for T.38
6 * Copyright (C) 2005, Steve Underwood, partly based on RTP code which is
7 * Copyright (C) 1999-2006, Digium, Inc.
9 * Steve Underwood <steveu@coppice.org>
11 * This program is free software, distributed under the terms of
12 * the GNU General Public License
14 * A license has been granted to Digium (via disclaimer) for the use of
20 ASTERISK_FILE_VERSION(__FILE__, "$Revision$")
29 #include <netinet/in.h>
31 #include <sys/socket.h>
32 #include <arpa/inet.h>
35 #include "asterisk/udptl.h"
36 #include "asterisk/frame.h"
37 #include "asterisk/logger.h"
38 #include "asterisk/options.h"
39 #include "asterisk/channel.h"
40 #include "asterisk/acl.h"
41 #include "asterisk/channel.h"
42 #include "asterisk/config.h"
43 #include "asterisk/lock.h"
44 #include "asterisk/utils.h"
45 #include "asterisk/cli.h"
46 #include "asterisk/unaligned.h"
47 #include "asterisk/utils.h"
49 #define UDPTL_MTU 1200
58 static int udptlstart = 0;
59 static int udptlend = 0;
60 static int udptldebug = 0; /* Are we debugging? */
61 static struct sockaddr_in udptldebugaddr; /* Debug packets to/from this host */
63 static int nochecksums = 0;
65 static int udptlfectype = 0;
66 static int udptlfecentries = 0;
67 static int udptlfecspan = 0;
68 static int udptlmaxdatagram = 0;
70 #define LOCAL_FAX_MAX_DATAGRAM 400
71 #define MAX_FEC_ENTRIES 5
72 #define MAX_FEC_SPAN 5
74 #define UDPTL_BUF_MASK 15
78 uint8_t buf[LOCAL_FAX_MAX_DATAGRAM];
79 } udptl_fec_tx_buffer_t;
83 uint8_t buf[LOCAL_FAX_MAX_DATAGRAM];
84 int fec_len[MAX_FEC_ENTRIES];
85 uint8_t fec[MAX_FEC_ENTRIES][LOCAL_FAX_MAX_DATAGRAM];
88 } udptl_fec_rx_buffer_t;
93 struct ast_frame f[16];
94 unsigned char rawdata[8192 + AST_FRIENDLY_OFFSET];
95 unsigned int lasteventseqn;
98 struct sockaddr_in us;
99 struct sockaddr_in them;
102 struct sched_context *sched;
103 struct io_context *io;
105 ast_udptl_callback callback;
106 int udptl_offered_from_local;
108 /*! This option indicates the error correction scheme used in transmitted UDPTL
110 int error_correction_scheme;
112 /*! This option indicates the number of error correction entries transmitted in
114 int error_correction_entries;
116 /*! This option indicates the span of the error correction entries in transmitted
117 UDPTL packets (FEC only). */
118 int error_correction_span;
120 /*! This option indicates the maximum size of a UDPTL packet that can be accepted by
121 the remote device. */
122 int far_max_datagram_size;
124 /*! This option indicates the maximum size of a UDPTL packet that we are prepared to
126 int local_max_datagram_size;
130 struct sockaddr_in far;
134 int rx_expected_seq_no;
136 udptl_fec_tx_buffer_t tx[UDPTL_BUF_MASK + 1];
137 udptl_fec_rx_buffer_t rx[UDPTL_BUF_MASK + 1];
140 static struct ast_udptl_protocol *protos = NULL;
142 static int udptl_rx_packet(struct ast_udptl *s, uint8_t *buf, int len);
143 static int udptl_build_packet(struct ast_udptl *s, uint8_t *buf, uint8_t *ifp, int ifp_len);
145 static inline int udptl_debug_test_addr(struct sockaddr_in *addr)
149 if (udptldebugaddr.sin_addr.s_addr) {
150 if (((ntohs(udptldebugaddr.sin_port) != 0)
151 && (udptldebugaddr.sin_port != addr->sin_port))
152 || (udptldebugaddr.sin_addr.s_addr != addr->sin_addr.s_addr))
158 static int decode_length(uint8_t *buf, int limit, int *len, int *pvalue)
160 if ((buf[*len] & 0x80) == 0) {
167 if ((buf[*len] & 0x40) == 0) {
168 if (*len >= limit - 1)
170 *pvalue = (buf[*len] & 0x3F) << 8;
172 *pvalue |= buf[*len];
178 *pvalue = (buf[*len] & 0x3F) << 14;
180 /* Indicate we have a fragment */
183 /*- End of function --------------------------------------------------------*/
185 static int decode_open_type(uint8_t *buf, int limit, int *len, const uint8_t **p_object, int *p_num_octets)
191 const uint8_t **pbuf;
193 for (octet_idx = 0, *p_num_octets = 0; ; octet_idx += octet_cnt) {
194 if ((stat = decode_length(buf, limit, len, &octet_cnt)) < 0)
197 *p_num_octets += octet_cnt;
199 pbuf = &p_object[octet_idx];
201 /* Make sure the buffer contains at least the number of bits requested */
202 if ((*len + octet_cnt) > limit)
213 /*- End of function --------------------------------------------------------*/
215 static int encode_length(uint8_t *buf, int *len, int value)
225 if (value < 0x4000) {
227 /* Set the first bit of the first octet */
228 buf[*len] = ((0x8000 | value) >> 8) & 0xFF;
230 buf[*len] = value & 0xFF;
235 multiplier = (value < 0x10000) ? (value >> 14) : 4;
236 /* Set the first 2 bits of the octet */
237 buf[*len] = 0xC0 | multiplier;
239 return multiplier << 14;
241 /*- End of function --------------------------------------------------------*/
243 static int encode_open_type(uint8_t *buf, int *len, const uint8_t *data, int num_octets)
249 /* If open type is of zero length, add a single zero byte (10.1) */
250 if (num_octets == 0) {
255 /* Encode the open type */
256 for (octet_idx = 0; ; num_octets -= enclen, octet_idx += enclen) {
257 if ((enclen = encode_length(buf, len, num_octets)) < 0)
260 memcpy(&buf[*len], &data[octet_idx], enclen);
263 if (enclen >= num_octets)
269 /*- End of function --------------------------------------------------------*/
271 static int udptl_rx_packet(struct ast_udptl *s, uint8_t *buf, int len)
291 const uint8_t *bufs[16];
299 memset(&s->f[0], 0, sizeof(s->f[0]));
301 /* Decode seq_number */
304 seq_no = (buf[0] << 8) | buf[1];
307 /* Break out the primary packet */
308 if ((stat = decode_open_type(buf, len, &ptr, &ifp, &ifp_len)) != 0)
310 /* Decode error_recovery */
313 if ((buf[ptr++] & 0x80) == 0) {
314 /* Secondary packet mode for error recovery */
315 if (seq_no > s->rx_seq_no) {
316 /* We received a later packet than we expected, so we need to check if we can fill in the gap from the
317 secondary packets. */
320 if ((stat2 = decode_length(buf, len, &ptr, &count)) < 0)
322 for (i = 0; i < count; i++) {
323 if ((stat = decode_open_type(buf, len, &ptr, &bufs[total_count + i], &lengths[total_count + i])) != 0)
326 total_count += count;
329 /* Step through in reverse order, so we go oldest to newest */
330 for (i = total_count; i > 0; i--) {
331 if (seq_no - i >= s->rx_seq_no) {
332 /* This one wasn't seen before */
333 /* Decode the secondary IFP packet */
334 //fprintf(stderr, "Secondary %d, len %d\n", seq_no - i, lengths[i - 1]);
335 s->f[ifp_no].frametype = AST_FRAME_MODEM;
336 s->f[ifp_no].subclass = AST_MODEM_T38;
338 s->f[ifp_no].mallocd = 0;
339 //s->f[ifp_no].???seq_no = seq_no - i;
340 s->f[ifp_no].datalen = lengths[i - 1];
341 s->f[ifp_no].data = (uint8_t *) bufs[i - 1];
342 s->f[ifp_no].offset = 0;
343 s->f[ifp_no].src = "UDPTL";
345 AST_LIST_NEXT(&s->f[ifp_no - 1], frame_list) = &s->f[ifp_no];
346 AST_LIST_NEXT(&s->f[ifp_no], frame_list) = NULL;
351 /* If packets are received out of sequence, we may have already processed this packet from the error
352 recovery information in a packet already received. */
353 if (seq_no >= s->rx_seq_no) {
354 /* Decode the primary IFP packet */
355 s->f[ifp_no].frametype = AST_FRAME_MODEM;
356 s->f[ifp_no].subclass = AST_MODEM_T38;
358 s->f[ifp_no].mallocd = 0;
359 //s->f[ifp_no].???seq_no = seq_no;
360 s->f[ifp_no].datalen = ifp_len;
361 s->f[ifp_no].data = (uint8_t *) ifp;
362 s->f[ifp_no].offset = 0;
363 s->f[ifp_no].src = "UDPTL";
365 AST_LIST_NEXT(&s->f[ifp_no - 1], frame_list) = &s->f[ifp_no];
366 AST_LIST_NEXT(&s->f[ifp_no], frame_list) = NULL;
371 /* FEC mode for error recovery */
372 /* Our buffers cannot tolerate overlength IFP packets in FEC mode */
373 if (ifp_len > LOCAL_FAX_MAX_DATAGRAM)
375 /* Update any missed slots in the buffer */
376 for ( ; seq_no > s->rx_seq_no; s->rx_seq_no++) {
377 x = s->rx_seq_no & UDPTL_BUF_MASK;
378 s->rx[x].buf_len = -1;
379 s->rx[x].fec_len[0] = 0;
380 s->rx[x].fec_span = 0;
381 s->rx[x].fec_entries = 0;
384 x = seq_no & UDPTL_BUF_MASK;
386 memset(repaired, 0, sizeof(repaired));
388 /* Save the new IFP packet */
389 memcpy(s->rx[x].buf, ifp, ifp_len);
390 s->rx[x].buf_len = ifp_len;
393 /* Decode the FEC packets */
394 /* The span is defined as an unconstrained integer, but will never be more
395 than a small value. */
401 s->rx[x].fec_span = span;
403 /* The number of entries is defined as a length, but will only ever be a small
404 value. Treat it as such. */
407 entries = buf[ptr++];
408 s->rx[x].fec_entries = entries;
410 /* Decode the elements */
411 for (i = 0; i < entries; i++) {
412 if ((stat = decode_open_type(buf, len, &ptr, &data, &s->rx[x].fec_len[i])) != 0)
414 if (s->rx[x].fec_len[i] > LOCAL_FAX_MAX_DATAGRAM)
417 /* Save the new FEC data */
418 memcpy(s->rx[x].fec[i], data, s->rx[x].fec_len[i]);
420 fprintf(stderr, "FEC: ");
421 for (j = 0; j < s->rx[x].fec_len[i]; j++)
422 fprintf(stderr, "%02X ", data[j]);
423 fprintf(stderr, "\n");
427 /* See if we can reconstruct anything which is missing */
428 /* TODO: this does not comprehensively hunt back and repair everything that is possible */
429 for (l = x; l != ((x - (16 - span*entries)) & UDPTL_BUF_MASK); l = (l - 1) & UDPTL_BUF_MASK) {
430 if (s->rx[l].fec_len[0] <= 0)
432 for (m = 0; m < s->rx[l].fec_entries; m++) {
433 limit = (l + m) & UDPTL_BUF_MASK;
434 for (which = -1, k = (limit - s->rx[l].fec_span * s->rx[l].fec_entries) & UDPTL_BUF_MASK; k != limit; k = (k + s->rx[l].fec_entries) & UDPTL_BUF_MASK) {
435 if (s->rx[k].buf_len <= 0)
436 which = (which == -1) ? k : -2;
440 for (j = 0; j < s->rx[l].fec_len[m]; j++) {
441 s->rx[which].buf[j] = s->rx[l].fec[m][j];
442 for (k = (limit - s->rx[l].fec_span * s->rx[l].fec_entries) & UDPTL_BUF_MASK; k != limit; k = (k + s->rx[l].fec_entries) & UDPTL_BUF_MASK)
443 s->rx[which].buf[j] ^= (s->rx[k].buf_len > j) ? s->rx[k].buf[j] : 0;
445 s->rx[which].buf_len = s->rx[l].fec_len[m];
446 repaired[which] = TRUE;
450 /* Now play any new packets forwards in time */
451 for (l = (x + 1) & UDPTL_BUF_MASK, j = seq_no - UDPTL_BUF_MASK; l != x; l = (l + 1) & UDPTL_BUF_MASK, j++) {
453 //fprintf(stderr, "Fixed packet %d, len %d\n", j, l);
454 s->f[ifp_no].frametype = AST_FRAME_MODEM;
455 s->f[ifp_no].subclass = AST_MODEM_T38;
457 s->f[ifp_no].mallocd = 0;
458 //s->f[ifp_no].???seq_no = j;
459 s->f[ifp_no].datalen = s->rx[l].buf_len;
460 s->f[ifp_no].data = s->rx[l].buf;
461 s->f[ifp_no].offset = 0;
462 s->f[ifp_no].src = "UDPTL";
464 AST_LIST_NEXT(&s->f[ifp_no - 1], frame_list) = &s->f[ifp_no];
465 AST_LIST_NEXT(&s->f[ifp_no], frame_list) = NULL;
469 /* Decode the primary IFP packet */
470 s->f[ifp_no].frametype = AST_FRAME_MODEM;
471 s->f[ifp_no].subclass = AST_MODEM_T38;
473 s->f[ifp_no].mallocd = 0;
474 //s->f[ifp_no].???seq_no = j;
475 s->f[ifp_no].datalen = ifp_len;
476 s->f[ifp_no].data = (uint8_t *) ifp;
477 s->f[ifp_no].offset = 0;
478 s->f[ifp_no].src = "UDPTL";
480 AST_LIST_NEXT(&s->f[ifp_no - 1], frame_list) = &s->f[ifp_no];
481 AST_LIST_NEXT(&s->f[ifp_no], frame_list) = NULL;
484 s->rx_seq_no = seq_no + 1;
487 /*- End of function --------------------------------------------------------*/
489 static int udptl_build_packet(struct ast_udptl *s, uint8_t *buf, uint8_t *ifp, int ifp_len)
491 uint8_t fec[LOCAL_FAX_MAX_DATAGRAM];
503 seq = s->tx_seq_no & 0xFFFF;
505 /* Map the sequence number to an entry in the circular buffer */
506 entry = seq & UDPTL_BUF_MASK;
508 /* We save the message in a circular buffer, for generating FEC or
509 redundancy sets later on. */
510 s->tx[entry].buf_len = ifp_len;
511 memcpy(s->tx[entry].buf, ifp, ifp_len);
513 /* Build the UDPTLPacket */
516 /* Encode the sequence number */
517 buf[len++] = (seq >> 8) & 0xFF;
518 buf[len++] = seq & 0xFF;
520 /* Encode the primary IFP packet */
521 if (encode_open_type(buf, &len, ifp, ifp_len) < 0)
524 /* Encode the appropriate type of error recovery information */
525 switch (s->error_correction_scheme)
527 case UDPTL_ERROR_CORRECTION_NONE:
528 /* Encode the error recovery type */
530 /* The number of entries will always be zero, so it is pointless allowing
531 for the fragmented case here. */
532 if (encode_length(buf, &len, 0) < 0)
535 case UDPTL_ERROR_CORRECTION_REDUNDANCY:
536 /* Encode the error recovery type */
538 if (s->tx_seq_no > s->error_correction_entries)
539 entries = s->error_correction_entries;
541 entries = s->tx_seq_no;
542 /* The number of entries will always be small, so it is pointless allowing
543 for the fragmented case here. */
544 if (encode_length(buf, &len, entries) < 0)
546 /* Encode the elements */
547 for (i = 0; i < entries; i++) {
548 j = (entry - i - 1) & UDPTL_BUF_MASK;
549 if (encode_open_type(buf, &len, s->tx[j].buf, s->tx[j].buf_len) < 0)
553 case UDPTL_ERROR_CORRECTION_FEC:
554 span = s->error_correction_span;
555 entries = s->error_correction_entries;
556 if (seq < s->error_correction_span*s->error_correction_entries) {
557 /* In the initial stages, wind up the FEC smoothly */
558 entries = seq/s->error_correction_span;
559 if (seq < s->error_correction_span)
562 /* Encode the error recovery type */
564 /* Span is defined as an inconstrained integer, which it dumb. It will only
565 ever be a small value. Treat it as such. */
568 /* The number of entries is defined as a length, but will only ever be a small
569 value. Treat it as such. */
570 buf[len++] = entries;
571 for (m = 0; m < entries; m++) {
572 /* Make an XOR'ed entry the maximum length */
573 limit = (entry + m) & UDPTL_BUF_MASK;
575 for (i = (limit - span*entries) & UDPTL_BUF_MASK; i != limit; i = (i + entries) & UDPTL_BUF_MASK) {
576 if (high_tide < s->tx[i].buf_len) {
577 for (j = 0; j < high_tide; j++)
578 fec[j] ^= s->tx[i].buf[j];
579 for ( ; j < s->tx[i].buf_len; j++)
580 fec[j] = s->tx[i].buf[j];
581 high_tide = s->tx[i].buf_len;
583 for (j = 0; j < s->tx[i].buf_len; j++)
584 fec[j] ^= s->tx[i].buf[j];
587 if (encode_open_type(buf, &len, fec, high_tide) < 0)
594 fprintf(stderr, "\n");
600 int ast_udptl_fd(struct ast_udptl *udptl)
605 void ast_udptl_set_data(struct ast_udptl *udptl, void *data)
610 void ast_udptl_set_callback(struct ast_udptl *udptl, ast_udptl_callback callback)
612 udptl->callback = callback;
615 void ast_udptl_setnat(struct ast_udptl *udptl, int nat)
620 static int udptlread(int *id, int fd, short events, void *cbdata)
622 struct ast_udptl *udptl = cbdata;
625 if ((f = ast_udptl_read(udptl))) {
627 udptl->callback(udptl, f, udptl->data);
632 struct ast_frame *ast_udptl_read(struct ast_udptl *udptl)
635 struct sockaddr_in sin;
638 uint16_t *udptlheader;
642 /* Cache where the header will go */
643 res = recvfrom(udptl->fd,
644 udptl->rawdata + AST_FRIENDLY_OFFSET,
645 sizeof(udptl->rawdata) - AST_FRIENDLY_OFFSET,
647 (struct sockaddr *) &sin,
649 udptlheader = (uint16_t *)(udptl->rawdata + AST_FRIENDLY_OFFSET);
652 ast_log(LOG_WARNING, "UDPTL read error: %s\n", strerror(errno));
655 return &ast_null_frame;
658 /* Ignore if the other side hasn't been given an address yet. */
659 if (!udptl->them.sin_addr.s_addr || !udptl->them.sin_port)
660 return &ast_null_frame;
663 /* Send to whoever sent to us */
664 if ((udptl->them.sin_addr.s_addr != sin.sin_addr.s_addr) ||
665 (udptl->them.sin_port != sin.sin_port)) {
666 memcpy(&udptl->them, &sin, sizeof(udptl->them));
668 ast_log(LOG_DEBUG, "UDPTL NAT: Using address %s:%d\n", ast_inet_ntoa(udptl->them.sin_addr), ntohs(udptl->them.sin_port));
672 if (udptl_debug_test_addr(&sin)) {
674 ast_verbose("Got UDPTL packet from %s:%d (type %d, seq %d, len %d)\n",
675 ast_inet_ntoa(sin.sin_addr), ntohs(sin.sin_port), 0, seqno, res);
678 printf("Got UDPTL packet from %s:%d (seq %d, len = %d)\n", ast_inet_ntoa(sin.sin_addr), ntohs(sin.sin_port), seqno, res);
680 udptl_rx_packet(udptl, udptl->rawdata + AST_FRIENDLY_OFFSET, res);
685 void ast_udptl_offered_from_local(struct ast_udptl* udptl, int local)
688 udptl->udptl_offered_from_local = local;
690 ast_log(LOG_WARNING, "udptl structure is null\n");
693 int ast_udptl_get_error_correction_scheme(struct ast_udptl* udptl)
696 return udptl->error_correction_scheme;
698 ast_log(LOG_WARNING, "udptl structure is null\n");
703 void ast_udptl_set_error_correction_scheme(struct ast_udptl* udptl, int ec)
707 case UDPTL_ERROR_CORRECTION_FEC:
708 udptl->error_correction_scheme = UDPTL_ERROR_CORRECTION_FEC;
710 case UDPTL_ERROR_CORRECTION_REDUNDANCY:
711 udptl->error_correction_scheme = UDPTL_ERROR_CORRECTION_REDUNDANCY;
713 case UDPTL_ERROR_CORRECTION_NONE:
714 udptl->error_correction_scheme = UDPTL_ERROR_CORRECTION_NONE;
717 ast_log(LOG_WARNING, "error correction parameter invalid\n");
720 ast_log(LOG_WARNING, "udptl structure is null\n");
723 int ast_udptl_get_local_max_datagram(struct ast_udptl* udptl)
726 return udptl->local_max_datagram_size;
728 ast_log(LOG_WARNING, "udptl structure is null\n");
733 int ast_udptl_get_far_max_datagram(struct ast_udptl* udptl)
736 return udptl->far_max_datagram_size;
738 ast_log(LOG_WARNING, "udptl structure is null\n");
743 void ast_udptl_set_local_max_datagram(struct ast_udptl* udptl, int max_datagram)
746 udptl->local_max_datagram_size = max_datagram;
748 ast_log(LOG_WARNING, "udptl structure is null\n");
751 void ast_udptl_set_far_max_datagram(struct ast_udptl* udptl, int max_datagram)
754 udptl->far_max_datagram_size = max_datagram;
756 ast_log(LOG_WARNING, "udptl structure is null\n");
759 struct ast_udptl *ast_udptl_new_with_bindaddr(struct sched_context *sched, struct io_context *io, int callbackmode, struct in_addr addr)
761 struct ast_udptl *udptl;
767 if (!(udptl = ast_calloc(1, sizeof(*udptl))))
770 if (udptlfectype == 2)
771 udptl->error_correction_scheme = UDPTL_ERROR_CORRECTION_FEC;
772 else if (udptlfectype == 1)
773 udptl->error_correction_scheme = UDPTL_ERROR_CORRECTION_REDUNDANCY;
775 udptl->error_correction_scheme = UDPTL_ERROR_CORRECTION_NONE;
776 udptl->error_correction_span = udptlfecspan;
777 udptl->error_correction_entries = udptlfecentries;
779 udptl->far_max_datagram_size = udptlmaxdatagram;
780 udptl->local_max_datagram_size = udptlmaxdatagram;
782 memset(&udptl->rx, 0, sizeof(udptl->rx));
783 memset(&udptl->tx, 0, sizeof(udptl->tx));
784 for (i = 0; i <= UDPTL_BUF_MASK; i++) {
785 udptl->rx[i].buf_len = -1;
786 udptl->tx[i].buf_len = -1;
789 udptl->seqno = ast_random() & 0xffff;
790 udptl->them.sin_family = AF_INET;
791 udptl->us.sin_family = AF_INET;
793 if ((udptl->fd = socket(AF_INET, SOCK_DGRAM, 0)) < 0) {
795 ast_log(LOG_WARNING, "Unable to allocate socket: %s\n", strerror(errno));
798 flags = fcntl(udptl->fd, F_GETFL);
799 fcntl(udptl->fd, F_SETFL, flags | O_NONBLOCK);
802 setsockopt(udptl->fd, SOL_SOCKET, SO_NO_CHECK, &nochecksums, sizeof(nochecksums));
804 /* Find us a place */
805 x = (ast_random() % (udptlend - udptlstart)) + udptlstart;
808 udptl->us.sin_port = htons(x);
809 udptl->us.sin_addr = addr;
810 if (bind(udptl->fd, (struct sockaddr *) &udptl->us, sizeof(udptl->us)) == 0)
812 if (errno != EADDRINUSE) {
813 ast_log(LOG_WARNING, "Unexpected bind error: %s\n", strerror(errno));
820 if (x == startplace) {
821 ast_log(LOG_WARNING, "No UDPTL ports remaining\n");
827 if (io && sched && callbackmode) {
828 /* Operate this one in a callback mode */
829 udptl->sched = sched;
831 udptl->ioid = ast_io_add(udptl->io, udptl->fd, udptlread, AST_IO_IN, udptl);
836 struct ast_udptl *ast_udptl_new(struct sched_context *sched, struct io_context *io, int callbackmode)
839 memset(&ia, 0, sizeof(ia));
840 return ast_udptl_new_with_bindaddr(sched, io, callbackmode, ia);
843 int ast_udptl_settos(struct ast_udptl *udptl, int tos)
847 if ((res = setsockopt(udptl->fd, IPPROTO_IP, IP_TOS, &tos, sizeof(tos))))
848 ast_log(LOG_WARNING, "UDPTL unable to set TOS to %d\n", tos);
852 void ast_udptl_set_peer(struct ast_udptl *udptl, struct sockaddr_in *them)
854 udptl->them.sin_port = them->sin_port;
855 udptl->them.sin_addr = them->sin_addr;
858 void ast_udptl_get_peer(struct ast_udptl *udptl, struct sockaddr_in *them)
860 them->sin_family = AF_INET;
861 them->sin_port = udptl->them.sin_port;
862 them->sin_addr = udptl->them.sin_addr;
865 void ast_udptl_get_us(struct ast_udptl *udptl, struct sockaddr_in *us)
867 memcpy(us, &udptl->us, sizeof(udptl->us));
870 void ast_udptl_stop(struct ast_udptl *udptl)
872 memset(&udptl->them.sin_addr, 0, sizeof(udptl->them.sin_addr));
873 memset(&udptl->them.sin_port, 0, sizeof(udptl->them.sin_port));
876 void ast_udptl_destroy(struct ast_udptl *udptl)
879 ast_io_remove(udptl->io, udptl->ioid);
885 int ast_udptl_write(struct ast_udptl *s, struct ast_frame *f)
889 uint8_t buf[LOCAL_FAX_MAX_DATAGRAM];
891 /* If we have no peer, return immediately */
892 if (s->them.sin_addr.s_addr == INADDR_ANY)
895 /* If there is no data length, return immediately */
899 if (f->frametype != AST_FRAME_MODEM) {
900 ast_log(LOG_WARNING, "UDPTL can only send T.38 data\n");
904 /* Cook up the UDPTL packet, with the relevant EC info. */
905 len = udptl_build_packet(s, buf, f->data, f->datalen);
907 if (len > 0 && s->them.sin_port && s->them.sin_addr.s_addr) {
908 if ((res = sendto(s->fd, buf, len, 0, (struct sockaddr *) &s->them, sizeof(s->them))) < 0)
909 ast_log(LOG_NOTICE, "UDPTL Transmission error to %s:%d: %s\n", ast_inet_ntoa(s->them.sin_addr), ntohs(s->them.sin_port), strerror(errno));
911 printf("Sent %d bytes of UDPTL data to %s:%d\n", res, ast_inet_ntoa(udptl->them.sin_addr), ntohs(udptl->them.sin_port));
913 if (udptl_debug_test_addr(&s->them))
914 ast_verbose("Sent UDPTL packet to %s:%d (type %d, seq %d, len %d)\n",
915 ast_inet_ntoa(s->them.sin_addr),
916 ntohs(s->them.sin_port), 0, s->seqno, len);
922 void ast_udptl_proto_unregister(struct ast_udptl_protocol *proto)
924 struct ast_udptl_protocol *cur;
925 struct ast_udptl_protocol *prev;
932 prev->next = proto->next;
934 protos = proto->next;
942 int ast_udptl_proto_register(struct ast_udptl_protocol *proto)
944 struct ast_udptl_protocol *cur;
948 if (cur->type == proto->type) {
949 ast_log(LOG_WARNING, "Tried to register same protocol '%s' twice\n", cur->type);
954 proto->next = protos;
959 static struct ast_udptl_protocol *get_proto(struct ast_channel *chan)
961 struct ast_udptl_protocol *cur;
965 if (cur->type == chan->tech->type)
972 int ast_udptl_bridge(struct ast_channel *c0, struct ast_channel *c1, int flags, struct ast_frame **fo, struct ast_channel **rc)
975 struct ast_channel *who;
976 struct ast_channel *cs[3];
977 struct ast_udptl *p0;
978 struct ast_udptl *p1;
979 struct ast_udptl_protocol *pr0;
980 struct ast_udptl_protocol *pr1;
981 struct sockaddr_in ac0;
982 struct sockaddr_in ac1;
983 struct sockaddr_in t0;
984 struct sockaddr_in t1;
989 ast_channel_lock(c0);
990 while (ast_channel_trylock(c1)) {
991 ast_channel_unlock(c0);
993 ast_channel_lock(c0);
998 ast_log(LOG_WARNING, "Can't find native functions for channel '%s'\n", c0->name);
999 ast_channel_unlock(c0);
1000 ast_channel_unlock(c1);
1004 ast_log(LOG_WARNING, "Can't find native functions for channel '%s'\n", c1->name);
1005 ast_channel_unlock(c0);
1006 ast_channel_unlock(c1);
1009 pvt0 = c0->tech_pvt;
1010 pvt1 = c1->tech_pvt;
1011 p0 = pr0->get_udptl_info(c0);
1012 p1 = pr1->get_udptl_info(c1);
1014 /* Somebody doesn't want to play... */
1015 ast_channel_unlock(c0);
1016 ast_channel_unlock(c1);
1019 if (pr0->set_udptl_peer(c0, p1)) {
1020 ast_log(LOG_WARNING, "Channel '%s' failed to talk to '%s'\n", c0->name, c1->name);
1022 /* Store UDPTL peer */
1023 ast_udptl_get_peer(p1, &ac1);
1025 if (pr1->set_udptl_peer(c1, p0))
1026 ast_log(LOG_WARNING, "Channel '%s' failed to talk back to '%s'\n", c1->name, c0->name);
1028 /* Store UDPTL peer */
1029 ast_udptl_get_peer(p0, &ac0);
1031 ast_channel_unlock(c0);
1032 ast_channel_unlock(c1);
1037 if ((c0->tech_pvt != pvt0) ||
1038 (c1->tech_pvt != pvt1) ||
1039 (c0->masq || c0->masqr || c1->masq || c1->masqr)) {
1041 ast_log(LOG_DEBUG, "Oooh, something is weird, backing out\n");
1042 /* Tell it to try again later */
1046 ast_udptl_get_peer(p1, &t1);
1047 ast_udptl_get_peer(p0, &t0);
1048 if (inaddrcmp(&t1, &ac1)) {
1050 ast_log(LOG_DEBUG, "Oooh, '%s' changed end address to %s:%d\n",
1051 c1->name, ast_inet_ntoa(t1.sin_addr), ntohs(t1.sin_port));
1052 ast_log(LOG_DEBUG, "Oooh, '%s' was %s:%d\n",
1053 c1->name, ast_inet_ntoa(ac1.sin_addr), ntohs(ac1.sin_port));
1055 memcpy(&ac1, &t1, sizeof(ac1));
1057 if (inaddrcmp(&t0, &ac0)) {
1059 ast_log(LOG_DEBUG, "Oooh, '%s' changed end address to %s:%d\n",
1060 c0->name, ast_inet_ntoa(t0.sin_addr), ntohs(t0.sin_port));
1061 ast_log(LOG_DEBUG, "Oooh, '%s' was %s:%d\n",
1062 c0->name, ast_inet_ntoa(ac0.sin_addr), ntohs(ac0.sin_port));
1064 memcpy(&ac0, &t0, sizeof(ac0));
1066 who = ast_waitfor_n(cs, 2, &to);
1069 ast_log(LOG_DEBUG, "Ooh, empty read...\n");
1070 /* check for hangup / whentohangup */
1071 if (ast_check_hangup(c0) || ast_check_hangup(c1))
1080 ast_log(LOG_DEBUG, "Oooh, got a %s\n", f ? "digit" : "hangup");
1081 /* That's all we needed */
1084 if (f->frametype == AST_FRAME_MODEM) {
1085 /* Forward T.38 frames if they happen upon us */
1088 } else if (who == c1) {
1094 /* Swap priority. Not that it's a big deal at this point */
1102 static int udptl_do_debug_ip(int fd, int argc, char *argv[])
1105 struct ast_hostent ahp;
1112 return RESULT_SHOWUSAGE;
1114 p = strstr(arg, ":");
1120 hp = ast_gethostbyname(arg, &ahp);
1122 return RESULT_SHOWUSAGE;
1123 udptldebugaddr.sin_family = AF_INET;
1124 memcpy(&udptldebugaddr.sin_addr, hp->h_addr, sizeof(udptldebugaddr.sin_addr));
1125 udptldebugaddr.sin_port = htons(port);
1127 ast_cli(fd, "UDPTL Debugging Enabled for IP: %s\n", ast_inet_ntoa(udptldebugaddr.sin_addr));
1129 ast_cli(fd, "UDPTL Debugging Enabled for IP: %s:%d\n", ast_inet_ntoa(udptldebugaddr.sin_addr), port);
1131 return RESULT_SUCCESS;
1134 static int udptl_do_debug(int fd, int argc, char *argv[])
1138 return RESULT_SHOWUSAGE;
1139 return udptl_do_debug_ip(fd, argc, argv);
1142 memset(&udptldebugaddr,0,sizeof(udptldebugaddr));
1143 ast_cli(fd, "UDPTL Debugging Enabled\n");
1144 return RESULT_SUCCESS;
1147 static int udptl_nodebug(int fd, int argc, char *argv[])
1150 return RESULT_SHOWUSAGE;
1152 ast_cli(fd,"UDPTL Debugging Disabled\n");
1153 return RESULT_SUCCESS;
1156 static char debug_usage[] =
1157 "Usage: udptl debug [ip host[:port]]\n"
1158 " Enable dumping of all UDPTL packets to and from host.\n";
1160 static char nodebug_usage[] =
1161 "Usage: udptl nodebug\n"
1162 " Disable all UDPTL debugging\n";
1164 static struct ast_cli_entry cli_udptl[] = {
1165 { { "udptl", "debug", NULL },
1166 udptl_do_debug, "Enable UDPTL debugging",
1169 { { "udptl", "debug", "ip", NULL },
1170 udptl_do_debug, "Enable UDPTL debugging on IP",
1173 { { "udptl", "nodebug", NULL },
1174 udptl_nodebug, "Disable UDPTL debugging",
1175 nodebug_usage, NULL, NULL },
1178 void ast_udptl_reload(void)
1180 struct ast_config *cfg;
1186 udptlfecentries = 0;
1188 udptlmaxdatagram = 0;
1190 if ((cfg = ast_config_load("udptl.conf"))) {
1191 if ((s = ast_variable_retrieve(cfg, "general", "udptlstart"))) {
1192 udptlstart = atoi(s);
1193 if (udptlstart < 1024)
1195 if (udptlstart > 65535)
1198 if ((s = ast_variable_retrieve(cfg, "general", "udptlend"))) {
1200 if (udptlend < 1024)
1202 if (udptlend > 65535)
1205 if ((s = ast_variable_retrieve(cfg, "general", "udptlchecksums"))) {
1213 ast_log(LOG_WARNING, "Disabling UDPTL checksums is not supported on this operating system!\n");
1216 if ((s = ast_variable_retrieve(cfg, "general", "T38FaxUdpEC"))) {
1217 if (strcmp(s, "t38UDPFEC") == 0)
1219 else if (strcmp(s, "t38UDPRedundancy") == 0)
1222 if ((s = ast_variable_retrieve(cfg, "general", "T38FaxMaxDatagram"))) {
1223 udptlmaxdatagram = atoi(s);
1224 if (udptlmaxdatagram < 0)
1225 udptlmaxdatagram = 0;
1226 if (udptlmaxdatagram > LOCAL_FAX_MAX_DATAGRAM)
1227 udptlmaxdatagram = LOCAL_FAX_MAX_DATAGRAM;
1229 if ((s = ast_variable_retrieve(cfg, "general", "UDPTLFECentries"))) {
1230 udptlfecentries = atoi(s);
1231 if (udptlfecentries < 0)
1232 udptlfecentries = 0;
1233 if (udptlfecentries > MAX_FEC_ENTRIES)
1234 udptlfecentries = MAX_FEC_ENTRIES;
1236 if ((s = ast_variable_retrieve(cfg, "general", "UDPTLFECspan"))) {
1237 udptlfecspan = atoi(s);
1238 if (udptlfecspan < 0)
1240 if (udptlfecspan > MAX_FEC_SPAN)
1241 udptlfecspan = MAX_FEC_SPAN;
1243 ast_config_destroy(cfg);
1245 if (udptlstart >= udptlend) {
1246 ast_log(LOG_WARNING, "Unreasonable values for UDPTL start/end\n");
1250 if (option_verbose > 1)
1251 ast_verbose(VERBOSE_PREFIX_2 "UDPTL allocating from port range %d -> %d\n", udptlstart, udptlend);
1254 void ast_udptl_init(void)
1256 ast_cli_register_multiple(cli_udptl, sizeof(cli_udptl) / sizeof(struct ast_cli_entry));