/* $OpenBSD: ccitt_addr.c,v 1.9 2005/02/18 04:00:21 jaredy Exp $ */ /* $NetBSD: ccitt_addr.c,v 1.8 1995/04/23 10:33:41 cgd Exp $ */ /* * Copyright (c) 1990, 1993 * The Regents of the University of California. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)ccitt_addr.c 8.1 (Berkeley) 6/5/93 */ /* * parse CCITT addresses * * Addresses must have the format: [hpr],x121address[,userdata][,protocol] * items enclosed with square brackets are optional * 'h' or 'p' means hi priority (packet size = 128; specific to Datapac * and necessary only for X.25(76) and non-negotiating X.25(80) DTE's) * 'r' means reverse charge (remote DTE pays for call). * The x121address consists of an optional netid and dot, followed * by a dte address. * * Frank Pronk * The University of British Columbia * Laboratory for Computational Vision * Copyright (c) 1984 */ #include #include #include #include #include static char *copychar(char *, char *); int ccitt_addr(char *addr, struct sockaddr_x25 *xp) { char *p, *ap, *limit; int havenet = 0; memset(xp, 0, sizeof(*xp)); xp->x25_family = AF_CCITT; xp->x25_len = sizeof(*xp); p = addr; /* * process optional priority and reverse charging flags */ if (*p == 'p' || *p == 'r' || *p == 'h') { while (*p == 'p' || *p == 'r' || *p == 'h') { if (*p == 'p' || *p == 'h') xp->x25_opts.op_psize = X25_PS128; else if (*p == 'r') xp->x25_opts.op_flags |= X25_REVERSE_CHARGE; p++; } if (*p != ',') return (0); p++; } if (*p == '\0') return (0); /* * [network id:]X.121 address */ ap = xp->x25_addr; limit = ap + sizeof(xp->x25_addr) - 1; while (*p) { if (*p == ',') break; if (*p == '.' || *p == ':') { if (havenet) return (0); havenet++; xp->x25_net = atoi(xp->x25_addr); p++; ap = xp->x25_addr; *ap = '\0'; } if (*p < '0' || *p > '9') return (0); if (ap >= limit) return (0); *ap++ = *p++; } if (*p == '\0') return (1); /* * optional user data, bytes 4 to 16 */ p++; ap = xp->x25_udata + 4; /* first four bytes are protocol id */ limit = ap + sizeof(xp->x25_udata) - 4; xp->x25_udlen = 4; while (*p) { if (*p == ',') break; if (ap >= limit) return (0); p = copychar(p, ap++); xp->x25_udlen++; } if (xp->x25_udlen == 4) xp->x25_udlen = 0; if (*p == '\0') return (1); p++; ap = xp->x25_udata; /* protocol id */ limit = ap + (xp->x25_udlen ? 4 : sizeof(xp->x25_udata)); while (*p) { if (*p == ',') return (0); if (ap >= limit) return (0); p = copychar(p, ap++); } if (xp->x25_udlen == 0) xp->x25_udlen = ap - xp->x25_udata; return (1); } static char * copychar(char *from, char *to) { int n; if (*from != '\\' || from[1] < '0' || from[1] > '7') { *to = *from++; return (from); } n = *++from - '0'; from++; if (*from >= '0' && *from <= '7') { int n1; n = n*8 + *from++ - '0'; if (*from >= '0' && *from <= '7' && (n1 = n*8 + *from-'0') < 256) { n = n1; from++; } } *to = n; return (from); }