view uptools/libcoding/number_encode.c @ 619:f82551c77e58

libserial-newlnx: ASYNC_LOW_LATENCY patch reverted Reports from Das Signal indicate that loadtools performance on Debian is about the same as on Slackware, and that including or omitting the ASYNC_LOW_LATENCY patch from Serg makes no difference. Because the patch in question does not appear to be necessary, it is being reverted until and unless someone other than Serg reports an actual real-world system on which loadtools operation times are slowed compared to the Mother's Slackware reference and on which Slackware-like performance can be restored by setting the ASYNC_LOW_LATENCY flag.
author Mychaela Falconia <falcon@freecalypso.org>
date Thu, 27 Feb 2020 01:09:48 +0000
parents 7154a231e4b5
children
line wrap: on
line source

/*
 * This library module implements the function that parses SMS destination
 * addresses given by the user and encodes them into the GSM 03.40
 * TP-Destination-Address structure.
 */

#include <sys/types.h>
#include <ctype.h>
#include <stdlib.h>

digit_char_to_gsm(ch)
{
	switch (ch) {
	case '0':
	case '1':
	case '2':
	case '3':
	case '4':
	case '5':
	case '6':
	case '7':
	case '8':
	case '9':
		return (ch - '0');
	case '*':
		return 0xA;
	case '#':
		return 0xB;
	case 'a':
	case 'b':
	case 'c':
		return (ch - 'a' + 0xC);
	case 'A':
	case 'B':
	case 'C':
		return (ch - 'A' + 0xC);
	}
	return (-1);
}

parse_and_encode_dest_addr(input, outbuf)
	char *input;
	u_char *outbuf;
{
	char *cp, *endp;
	int d;
	u_char digits[20];
	unsigned n;

	cp = input;
	if (*cp == '+') {
		outbuf[1] = 0x91;
		cp++;
	} else
		outbuf[1] = 0x81;
	if (digit_char_to_gsm(*cp) < 0)
		return(-1);
	n = 0;
	while ((d = digit_char_to_gsm(*cp)) >= 0) {
		cp++;
		if (n >= 20)
			return(-1);
		digits[n++] = d;
	}
	outbuf[0] = n;
	while (n < 20)
		digits[n++] = 0xF;
	if (*cp == ',') {
		cp++;
		if (!isdigit(*cp))
			return(-1);
		outbuf[1] = strtoul(cp, &endp, 0);
		if (*endp)
			return(-1);
	} else if (*cp)
		return(-1);
	for (n = 0; n < 10; n++)
		outbuf[2+n] = (digits[n*2+1] << 4) | digits[n*2];
	return(0);
}