1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368
|
/*
* libss7: An implementation of Signalling System 7
*
* Written by Matthew Fredrickson <creslin@digium.com>
*
* scheduling routines taken from libpri by Mark Spencer <markster@digium.com>
*
* Copyright (C) 2006-2008, Digium, Inc
* All Rights Reserved.
*/
/*
* See http://www.asterisk.org for more information about
* the Asterisk project. Please do not directly contact
* any of the maintainers of this project for assistance;
* the project provides a web site, mailing lists and IRC
* channels for your use.
*
* This program is free software, distributed under the terms of
* the GNU General Public License Version 2 as published by the
* Free Software Foundation. See the LICENSE file included with
* this program for more details.
*
* In addition, when this program is distributed with Asterisk in
* any form that would qualify as a 'combined work' or as a
* 'derivative work' (but not mere aggregation), you can redistribute
* and/or modify the combination under the terms of the license
* provided with that copy of Asterisk, instead of the license
* terms granted here.
*/
#include <stdlib.h>
#include <unistd.h>
#include <stdio.h>
#include <stdarg.h>
#include <sys/ioctl.h>
#include <sys/poll.h>
#include "libss7.h"
#include "ss7_internal.h"
#include "mtp2.h"
#include "isup.h"
#include "mtp3.h"
static void (*__ss7_message)(struct ss7 *ss7, char *message);
static void (*__ss7_error)(struct ss7 *ss7, char *message);
void ss7_set_message(void (*func)(struct ss7 *ss7, char *message))
{
__ss7_message = func;
}
void ss7_set_error(void (*func)(struct ss7 *ss7, char *message))
{
__ss7_error = func;
}
void ss7_message(struct ss7 *ss7, char *fmt, ...)
{
char tmp[1024];
va_list ap;
va_start(ap, fmt);
vsnprintf(tmp, sizeof(tmp), fmt, ap);
va_end(ap);
if (__ss7_message)
__ss7_message(ss7, tmp);
else
fputs(tmp, stdout);
}
void ss7_error(struct ss7 *ss7, char *fmt, ...)
{
char tmp[1024];
va_list ap;
va_start(ap, fmt);
vsnprintf(tmp, sizeof(tmp), fmt, ap);
va_end(ap);
if (__ss7_error)
__ss7_error(ss7, tmp);
else
fputs(tmp, stdout);
}
void ss7_set_debug(struct ss7 *ss7, unsigned int flags)
{
ss7->debug = flags;
}
void ss7_dump_buf(struct ss7 *ss7, int tabs, unsigned char *buf, int len)
{
int i, j = 0;
char tmp[1024];
for (i = 0; i < tabs; i++)
snprintf(&tmp[i], sizeof(tmp)-i, "\t");
snprintf(&tmp[i], sizeof(tmp)-i, "[ ");
j = i + 2; /* some TAB + "[ " */
for (i = 0; i < len; i++) {
snprintf(&tmp[3*i]+j, sizeof(tmp)-3*i-j, "%02x ", buf[i]); /* &tmp[3*i]+j - for speed optimization, don't change format! */
}
ss7_message(ss7, "%s]\n", tmp);
}
void ss7_dump_msg(struct ss7 *ss7, unsigned char *buf, int len)
{
int i;
char tmp[1024];
for (i = 0; i < len; i++) {
snprintf(&tmp[3*i], sizeof(tmp)-3*i, "%02x ", buf[i]); /* &tmp[3*i] - for speed optimization, don't change format! */
}
ss7_message(ss7, "Len = %d [ %s]\n", len, tmp);
}
void ss7_msg_free(struct ss7_msg *m)
{
free(m);
}
struct ss7_msg * ss7_msg_new(void)
{
return calloc(1, sizeof(struct ss7_msg));
}
unsigned char * ss7_msg_userpart(struct ss7_msg *msg)
{
return msg->buf + MTP2_SIZE + SIO_SIZE;
}
void ss7_msg_userpart_len(struct ss7_msg *msg, int len)
{
msg->size = MTP2_SIZE + SIO_SIZE + len;
return;
}
ss7_event * ss7_next_empty_event(struct ss7 *ss7)
{
ss7_event *e;
if (ss7->ev_len == MAX_EVENTS) {
ss7_error(ss7, "Event queue full!\n");
return NULL;
}
e = &ss7->ev_q[(ss7->ev_h + ss7->ev_len) % MAX_EVENTS];
ss7->ev_len += 1;
return e;
}
ss7_event * ss7_check_event(struct ss7 *ss7)
{
ss7_event *e;
if (!ss7->ev_len)
return NULL;
else
e = &ss7->ev_q[ss7->ev_h];
ss7->ev_h += 1;
ss7->ev_h %= MAX_EVENTS;
ss7->ev_len -= 1;
return mtp3_process_event(ss7, e);
}
int ss7_start(struct ss7 *ss7)
{
mtp3_start(ss7);
return 0;
}
void ss7_link_alarm(struct ss7 *ss7, int fd)
{
mtp3_alarm(ss7, fd);
}
void ss7_link_noalarm(struct ss7 *ss7, int fd)
{
mtp3_noalarm(ss7, fd);
}
int ss7_add_link(struct ss7 *ss7, int transport, int fd)
{
struct mtp2 *m;
if (ss7->numlinks >= SS7_MAX_LINKS)
return -1;
if (transport == SS7_TRANSPORT_TCP) {
}
if ((transport == SS7_TRANSPORT_DAHDIDCHAN) || (transport == SS7_TRANSPORT_DAHDIMTP2)) {
int zapmtp2 = 0;
if (transport == SS7_TRANSPORT_DAHDIMTP2)
zapmtp2 = 1;
m = mtp2_new(fd, ss7->switchtype);
if (!m)
return -1;
m->slc = ss7->numlinks;
ss7->numlinks += 1;
m->master = ss7;
if (zapmtp2)
m->flags |= MTP2_FLAG_ZAPMTP2;
ss7->links[ss7->numlinks - 1] = m;
}
return 0;
}
int ss7_pollflags(struct ss7 *ss7, int fd)
{
int i;
int winner = -1;
int flags = POLLPRI | POLLIN;
for (i = 0; i < ss7->numlinks; i++) {
if (ss7->links[i]->fd == fd) {
winner = i;
break;
}
}
if (winner < 0)
return -1;
if (ss7->links[winner]->flags & MTP2_FLAG_ZAPMTP2) {
if (ss7->links[winner]->flags & MTP2_FLAG_WRITE)
flags |= POLLOUT;
} else
flags |= POLLOUT;
return flags;
}
/* TODO: Add entry to routing table instead */
int ss7_set_adjpc(struct ss7 *ss7, int fd, unsigned int pc)
{
int i;
int winner = -1;
for (i = 0; i < ss7->numlinks; i++) {
if (ss7->links[i]->fd == fd)
winner = i;
}
if (winner > -1)
ss7->links[winner]->dpc = pc;
else
return -1;
return 0;
}
int ss7_set_pc(struct ss7 *ss7, unsigned int pc)
{
ss7->pc = pc;
return 0;
}
int ss7_set_network_ind(struct ss7 *ss7, int ni)
{
ss7->ni = ni;
return 0;
}
char * ss7_event2str(int event)
{
switch (event) {
case SS7_EVENT_UP:
return "SS7_EVENT_UP";
case SS7_EVENT_DOWN:
return "SS7_EVENT_DOWN";
case ISUP_EVENT_IAM:
return "ISUP_EVENT_IAM";
case ISUP_EVENT_ACM:
return "ISUP_EVENT_ACM";
case ISUP_EVENT_ANM:
return "ISUP_EVENT_ANM";
case ISUP_EVENT_REL:
return "ISUP_EVENT_REL";
case ISUP_EVENT_RLC:
return "ISUP_EVENT_RLC";
case ISUP_EVENT_GRS:
return "ISUP_EVENT_GRS";
case ISUP_EVENT_GRA:
return "ISUP_EVENT_GRA";
case ISUP_EVENT_CON:
return "ISUP_EVENT_CON";
default:
return "Unknown Event";
}
}
struct ss7 *ss7_new(int switchtype)
{
struct ss7 *s;
s = calloc(1, sizeof(struct ss7));
if (!s)
return NULL;
/* Initialize the event queue */
s->ev_h = 0;
s->ev_len = 0;
s->state = SS7_STATE_DOWN;
if ((switchtype == SS7_ITU) || (switchtype == SS7_ANSI))
s->switchtype = switchtype;
else {
free(s);
return NULL;
}
return s;
}
int ss7_write(struct ss7 *ss7, int fd)
{
int res, i, winner = -1;
for (i = 0; i < ss7->numlinks; i++) {
if (ss7->links[i]->fd == fd) {
winner = i;
break;
}
}
if (winner < 0)
return -1;
res = mtp2_transmit(ss7->links[winner]);
return res;
}
int ss7_read(struct ss7 *ss7, int fd)
{
unsigned char buf[1024];
int res;
int winner = -1;
int i;
for (i = 0; i < ss7->numlinks; i++) {
if (ss7->links[i]->fd == fd) {
winner = i;
break;
}
}
if (winner < 0)
return -1;
res = read(ss7->links[winner]->fd, buf, sizeof(buf));
if (res <= 0) {
return res;
}
res = mtp2_receive(ss7->links[winner], buf, res);
return res;
}
|