blob: 12f439be25aa75f028271c19005ad8dde3d24a58 [file] [log] [blame]
Harald Welte32201c12009-03-10 12:15:10 +00001/* (C) 2008-2009 by Harald Welte <laforge@gnumonks.org>
Harald Welte8470bf22008-12-25 23:28:35 +00002 *
Harald Welte52b1f982008-12-23 20:25:15 +00003 * All Rights Reserved
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License along
16 * with this program; if not, write to the Free Software Foundation, Inc.,
17 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 */
20
21
22#include <stdlib.h>
Harald Welte51f38452009-02-24 22:36:40 +000023#include <stdio.h>
Harald Welte52b1f982008-12-23 20:25:15 +000024#include <string.h>
Harald Weltefcd24452009-06-20 18:15:19 +020025#include <errno.h>
Harald Welte42581822009-08-08 16:12:58 +020026#include <ctype.h>
Harald Welte52b1f982008-12-23 20:25:15 +000027
Harald Welte8470bf22008-12-25 23:28:35 +000028#include <openbsc/gsm_data.h>
Harald Weltee441d9c2009-06-21 16:17:15 +020029#include <openbsc/talloc.h>
Holger Hans Peter Freyther2d501ea2009-11-11 11:54:24 +010030#include <openbsc/abis_nm.h>
Harald Welte52b1f982008-12-23 20:25:15 +000031
Andreas Eversberg8226fa72009-06-29 15:19:38 +020032void *tall_bsc_ctx;
33
Harald Welteccda9652009-11-12 22:28:18 +090034const char *get_value_string(const struct value_string *vs, u_int32_t val)
35{
36 int i;
37
38 for (i = 0;; i++) {
39 if (vs[i].value == 0 && vs[i].str == NULL)
40 break;
41 if (vs[i].value == val)
42 return vs[i].str;
43 }
44 return "unknown";
45}
46
Harald Weltecd06bfb2009-02-10 17:33:56 +000047void set_ts_e1link(struct gsm_bts_trx_ts *ts, u_int8_t e1_nr,
48 u_int8_t e1_ts, u_int8_t e1_ts_ss)
49{
50 ts->e1_link.e1_nr = e1_nr;
51 ts->e1_link.e1_ts = e1_ts;
52 ts->e1_link.e1_ts_ss = e1_ts_ss;
53}
54
Harald Weltea72c98e2009-01-04 16:10:38 +000055static const char *pchan_names[] = {
56 [GSM_PCHAN_NONE] = "NONE",
57 [GSM_PCHAN_CCCH] = "CCCH",
58 [GSM_PCHAN_CCCH_SDCCH4] = "CCCH+SDCCH4",
59 [GSM_PCHAN_TCH_F] = "TCH/F",
60 [GSM_PCHAN_TCH_H] = "TCH/H",
61 [GSM_PCHAN_SDCCH8_SACCH8C] = "SDCCH8",
Harald Weltea1499d02009-10-24 10:25:50 +020062 [GSM_PCHAN_PDCH] = "PDCH",
63 [GSM_PCHAN_TCH_F_PDCH] = "TCH/F_PDCH",
Harald Weltea72c98e2009-01-04 16:10:38 +000064 [GSM_PCHAN_UNKNOWN] = "UNKNOWN",
65};
66
67const char *gsm_pchan_name(enum gsm_phys_chan_config c)
68{
69 if (c >= ARRAY_SIZE(pchan_names))
70 return "INVALID";
71
72 return pchan_names[c];
73}
74
Harald Weltea171a1b2009-08-07 00:24:39 +020075enum gsm_phys_chan_config gsm_pchan_parse(const char *name)
76{
77 int i;
78
79 for (i = 0; i < ARRAY_SIZE(pchan_names); i++) {
80 if (!strcasecmp(name, pchan_names[i]))
81 return i;
82 }
83
84 return -1;
85}
86
Harald Weltea72c98e2009-01-04 16:10:38 +000087static const char *lchan_names[] = {
88 [GSM_LCHAN_NONE] = "NONE",
89 [GSM_LCHAN_SDCCH] = "SDCCH",
90 [GSM_LCHAN_TCH_F] = "TCH/F",
91 [GSM_LCHAN_TCH_H] = "TCH/H",
92 [GSM_LCHAN_UNKNOWN] = "UNKNOWN",
93};
94
95const char *gsm_lchan_name(enum gsm_chan_t c)
96{
97 if (c >= ARRAY_SIZE(lchan_names))
98 return "INVALID";
99
100 return lchan_names[c];
101}
102
103static const char *chreq_names[] = {
104 [GSM_CHREQ_REASON_EMERG] = "EMERGENCY",
105 [GSM_CHREQ_REASON_PAG] = "PAGING",
106 [GSM_CHREQ_REASON_CALL] = "CALL",
107 [GSM_CHREQ_REASON_LOCATION_UPD] = "LOCATION_UPDATE",
108 [GSM_CHREQ_REASON_OTHER] = "OTHER",
109};
110
111const char *gsm_chreq_name(enum gsm_chreq_reason_t c)
112{
113 if (c >= ARRAY_SIZE(chreq_names))
114 return "INVALID";
115
116 return chreq_names[c];
117}
118
Harald Weltee441d9c2009-06-21 16:17:15 +0200119struct gsm_bts_trx *gsm_bts_trx_alloc(struct gsm_bts *bts)
Harald Welte52b1f982008-12-23 20:25:15 +0000120{
Holger Hans Peter Freyther5ea73132009-10-29 02:29:45 +0100121 struct gsm_bts_trx *trx = talloc_zero(bts, struct gsm_bts_trx);
Harald Weltee441d9c2009-06-21 16:17:15 +0200122 int k;
Harald Welte52b1f982008-12-23 20:25:15 +0000123
Harald Weltee441d9c2009-06-21 16:17:15 +0200124 if (!trx)
Harald Welte52b1f982008-12-23 20:25:15 +0000125 return NULL;
126
Harald Weltee441d9c2009-06-21 16:17:15 +0200127 trx->bts = bts;
128 trx->nr = bts->num_trx++;
129
130 for (k = 0; k < TRX_NR_TS; k++) {
131 struct gsm_bts_trx_ts *ts = &trx->ts[k];
132 int l;
133
134 ts->trx = trx;
135 ts->nr = k;
136 ts->pchan = GSM_PCHAN_NONE;
137
138 for (l = 0; l < TS_MAX_LCHAN; l++) {
139 struct gsm_lchan *lchan;
140 lchan = &ts->lchan[l];
141
142 lchan->ts = ts;
143 lchan->nr = l;
144 lchan->type = GSM_LCHAN_NONE;
145 }
146 }
147
Harald Welte9fb3b8b2009-08-06 19:05:58 +0200148 llist_add_tail(&trx->list, &bts->trx_list);
Harald Weltee441d9c2009-06-21 16:17:15 +0200149
150 return trx;
151}
152
153struct gsm_bts *gsm_bts_alloc(struct gsm_network *net, enum gsm_bts_type type,
154 u_int8_t tsc, u_int8_t bsic)
155{
Holger Hans Peter Freyther5ea73132009-10-29 02:29:45 +0100156 struct gsm_bts *bts = talloc_zero(net, struct gsm_bts);
Harald Welte55dd4432009-10-24 10:19:14 +0200157 int i;
Harald Weltee441d9c2009-06-21 16:17:15 +0200158
159 if (!bts)
160 return NULL;
161
Harald Weltee441d9c2009-06-21 16:17:15 +0200162 bts->network = net;
163 bts->nr = net->num_bts++;
164 bts->type = type;
165 bts->tsc = tsc;
166 bts->bsic = bsic;
167 bts->num_trx = 0;
168 INIT_LLIST_HEAD(&bts->trx_list);
Harald Welte (local)0e451d02009-08-13 10:14:26 +0200169 bts->ms_max_power = 15; /* dBm */
Harald Welte73225282009-12-12 18:17:25 +0100170 bts->si_common.cell_sel_par.cell_resel_hyst = 2; /* 4 dB */
171 bts->si_common.cell_sel_par.rxlev_acc_min = 0;
Harald Welte6c40def2009-12-14 22:07:14 +0100172 bts->si_common.neigh_list.data = bts->si_common.data.neigh_list;
173 bts->si_common.neigh_list.data_len =
174 sizeof(bts->si_common.data.neigh_list);
175 bts->si_common.cell_alloc.data = bts->si_common.data.cell_alloc;
176 bts->si_common.cell_alloc.data_len =
177 sizeof(bts->si_common.data.cell_alloc);
Harald Weltee441d9c2009-06-21 16:17:15 +0200178
Harald Welte55dd4432009-10-24 10:19:14 +0200179 for (i = 0; i < ARRAY_SIZE(bts->gprs.nsvc); i++) {
180 bts->gprs.nsvc[i].bts = bts;
181 bts->gprs.nsvc[i].id = i;
182 }
183
Harald Weltee441d9c2009-06-21 16:17:15 +0200184 /* create our primary TRX */
185 bts->c0 = gsm_bts_trx_alloc(bts);
186 if (!bts->c0) {
187 talloc_free(bts);
188 return NULL;
189 }
190 bts->c0->ts[0].pchan = GSM_PCHAN_CCCH_SDCCH4;
191
Harald Welte9fb3b8b2009-08-06 19:05:58 +0200192 llist_add_tail(&bts->list, &net->bts_list);
Harald Weltee441d9c2009-06-21 16:17:15 +0200193
194 return bts;
195}
196
197struct gsm_network *gsm_network_init(u_int16_t country_code, u_int16_t network_code,
198 int (*mncc_recv)(struct gsm_network *, int, void *))
199{
200 struct gsm_network *net;
201
Holger Hans Peter Freyther5ea73132009-10-29 02:29:45 +0100202 net = talloc_zero(tall_bsc_ctx, struct gsm_network);
Harald Welte52b1f982008-12-23 20:25:15 +0000203 if (!net)
204 return NULL;
Harald Welte52b1f982008-12-23 20:25:15 +0000205
206 net->country_code = country_code;
207 net->network_code = network_code;
Harald Weltee441d9c2009-06-21 16:17:15 +0200208 net->num_bts = 0;
Harald Welteb84ddfc2009-12-01 17:36:54 +0530209 net->T3101 = GSM_T3101_DEFAULT;
210 net->T3113 = GSM_T3113_DEFAULT;
211 /* FIXME: initialize all other timers! */
Harald Welte52b1f982008-12-23 20:25:15 +0000212
Harald Weltef7c28b02009-12-21 13:30:17 +0100213 /* default set of handover parameters */
214 net->handover.win_rxlev_avg = 10;
215 net->handover.win_rxqual_avg = 1;
216 net->handover.win_rxlev_avg_neigh = 10;
217 net->handover.pwr_interval = 6;
218 net->handover.pwr_hysteresis = 3;
219 net->handover.max_distance = 9999;
220
Harald Welte4bfdfe72009-06-10 23:11:52 +0800221 INIT_LLIST_HEAD(&net->trans_list);
222 INIT_LLIST_HEAD(&net->upqueue);
Harald Weltee441d9c2009-06-21 16:17:15 +0200223 INIT_LLIST_HEAD(&net->bts_list);
Harald Welte4bfdfe72009-06-10 23:11:52 +0800224
225 net->mncc_recv = mncc_recv;
226
Harald Welte8470bf22008-12-25 23:28:35 +0000227 return net;
Harald Welte52b1f982008-12-23 20:25:15 +0000228}
Harald Welte23a68632009-02-19 17:06:42 +0000229
Harald Weltee441d9c2009-06-21 16:17:15 +0200230struct gsm_bts *gsm_bts_num(struct gsm_network *net, int num)
231{
232 struct gsm_bts *bts;
233
234 if (num >= net->num_bts)
235 return NULL;
236
237 llist_for_each_entry(bts, &net->bts_list, list) {
238 if (bts->nr == num)
239 return bts;
240 }
241
242 return NULL;
243}
244
Harald Welte84874c92009-12-14 22:33:02 +0100245/* Get reference to a neighbor cell on a given BCCH ARFCN */
Harald Welte0b121032009-12-15 00:21:31 +0100246struct gsm_bts *gsm_bts_neighbor(const struct gsm_bts *bts,
247 u_int16_t arfcn, u_int8_t bsic)
Harald Welte84874c92009-12-14 22:33:02 +0100248{
249 struct gsm_bts *neigh;
250 /* FIXME: use some better heuristics here to determine which cell
251 * using this ARFCN really is closest to the target cell. For
252 * now we simply assume that each ARFCN will only be used by one
253 * cell */
254
255 llist_for_each_entry(neigh, &bts->network->bts_list, list) {
Harald Welte0b121032009-12-15 00:21:31 +0100256 if (neigh->c0->arfcn == arfcn &&
257 neigh->bsic == bsic)
Harald Welte84874c92009-12-14 22:33:02 +0100258 return neigh;
259 }
260
261 return NULL;
262}
263
Harald Weltee441d9c2009-06-21 16:17:15 +0200264struct gsm_bts_trx *gsm_bts_trx_num(struct gsm_bts *bts, int num)
265{
266 struct gsm_bts_trx *trx;
267
268 if (num >= bts->num_trx)
269 return NULL;
270
271 llist_for_each_entry(trx, &bts->trx_list, list) {
272 if (trx->nr == num)
273 return trx;
274 }
275
276 return NULL;
277}
278
Harald Welte23a68632009-02-19 17:06:42 +0000279static char ts2str[255];
280
281char *gsm_ts_name(struct gsm_bts_trx_ts *ts)
282{
283 snprintf(ts2str, sizeof(ts2str), "(bts=%d,trx=%d,ts=%d)",
Mike Haben2449b372009-10-26 20:36:34 +0100284 ts->trx->bts->nr, ts->trx->nr, ts->nr);
Harald Welte23a68632009-02-19 17:06:42 +0000285
286 return ts2str;
287}
Harald Welte32201c12009-03-10 12:15:10 +0000288
289static const char *bts_types[] = {
290 [GSM_BTS_TYPE_UNKNOWN] = "unknown",
291 [GSM_BTS_TYPE_BS11] = "bs11",
Mike Habene2d82272009-10-02 12:19:34 +0100292 [GSM_BTS_TYPE_NANOBTS] = "nanobts",
Harald Welte32201c12009-03-10 12:15:10 +0000293};
294
Harald Welte1d014a52009-08-08 15:38:29 +0200295enum gsm_bts_type parse_btstype(const char *arg)
Harald Welte32201c12009-03-10 12:15:10 +0000296{
297 int i;
298 for (i = 0; i < ARRAY_SIZE(bts_types); i++) {
299 if (!strcmp(arg, bts_types[i]))
300 return i;
301 }
302 return GSM_BTS_TYPE_BS11; /* Default: BS11 */
303}
304
Holger Hans Peter Freyther2dceae62009-06-12 17:39:38 +0200305const char *btstype2str(enum gsm_bts_type type)
Harald Welte32201c12009-03-10 12:15:10 +0000306{
307 if (type > ARRAY_SIZE(bts_types))
308 return "undefined";
309 return bts_types[type];
310}
Harald Weltebe991492009-05-23 13:56:40 +0000311
312/* Search for a BTS in the given Location Area; optionally start searching
313 * with start_bts (for continuing to search after the first result) */
314struct gsm_bts *gsm_bts_by_lac(struct gsm_network *net, unsigned int lac,
315 struct gsm_bts *start_bts)
316{
317 int i;
318 struct gsm_bts *bts;
319 int skip = 0;
320
321 if (start_bts)
322 skip = 1;
323
324 for (i = 0; i < net->num_bts; i++) {
Harald Weltee441d9c2009-06-21 16:17:15 +0200325 bts = gsm_bts_num(net, i);
Harald Weltebe991492009-05-23 13:56:40 +0000326
327 if (skip) {
328 if (start_bts == bts)
329 skip = 0;
330 continue;
331 }
332
Holger Hans Peter Freythere48b9562009-10-01 04:07:15 +0200333 if (lac == GSM_LAC_RESERVED_ALL_BTS || bts->location_area_code == lac)
Harald Weltebe991492009-05-23 13:56:40 +0000334 return bts;
335 }
336 return NULL;
337}
Harald Weltefcd24452009-06-20 18:15:19 +0200338
339char *gsm_band_name(enum gsm_band band)
340{
341 switch (band) {
342 case GSM_BAND_400:
Harald Welte9fb3b8b2009-08-06 19:05:58 +0200343 return "GSM400";
Harald Weltefcd24452009-06-20 18:15:19 +0200344 case GSM_BAND_850:
Harald Welte9fb3b8b2009-08-06 19:05:58 +0200345 return "GSM850";
Harald Weltefcd24452009-06-20 18:15:19 +0200346 case GSM_BAND_900:
Harald Welte9fb3b8b2009-08-06 19:05:58 +0200347 return "GSM900";
Harald Weltefcd24452009-06-20 18:15:19 +0200348 case GSM_BAND_1800:
Harald Welte9fb3b8b2009-08-06 19:05:58 +0200349 return "DCS1800";
Harald Weltefcd24452009-06-20 18:15:19 +0200350 case GSM_BAND_1900:
Harald Welte9fb3b8b2009-08-06 19:05:58 +0200351 return "PCS1900";
Harald Weltefcd24452009-06-20 18:15:19 +0200352 }
353 return "invalid";
354}
355
Harald Welte42581822009-08-08 16:12:58 +0200356enum gsm_band gsm_band_parse(const char* mhz)
Harald Weltefcd24452009-06-20 18:15:19 +0200357{
Harald Welte42581822009-08-08 16:12:58 +0200358 while (*mhz && !isdigit(*mhz))
359 mhz++;
360
361 if (*mhz == '\0')
362 return -EINVAL;
363
364 switch (atoi(mhz)) {
Harald Weltefcd24452009-06-20 18:15:19 +0200365 case 400:
366 return GSM_BAND_400;
367 case 850:
368 return GSM_BAND_850;
369 case 900:
370 return GSM_BAND_900;
371 case 1800:
372 return GSM_BAND_1800;
373 case 1900:
374 return GSM_BAND_1900;
375 default:
376 return -EINVAL;
377 }
378}
379
Harald Welte (local)69de3972009-08-12 14:42:23 +0200380static const char *gsm_auth_policy_names[] = {
381 [GSM_AUTH_POLICY_CLOSED] = "closed",
382 [GSM_AUTH_POLICY_ACCEPT_ALL] = "accept-all",
383 [GSM_AUTH_POLICY_TOKEN] = "token",
384};
385
386enum gsm_auth_policy gsm_auth_policy_parse(const char *arg)
387{
388 int i;
389 for (i = 0; i < ARRAY_SIZE(gsm_auth_policy_names); i++) {
390 if (!strcmp(arg, gsm_auth_policy_names[i]))
391 return i;
392 }
393 return GSM_AUTH_POLICY_CLOSED;
394}
395
396const char *gsm_auth_policy_name(enum gsm_auth_policy policy)
397{
398 if (policy > ARRAY_SIZE(gsm_auth_policy_names))
399 return "undefined";
400 return gsm_auth_policy_names[policy];
401}
402
Harald Welteeab84a12009-12-13 10:53:12 +0100403static const char *rrlp_mode_names[] = {
404 [RRLP_MODE_NONE] = "none",
405 [RRLP_MODE_MS_BASED] = "ms-based",
406 [RRLP_MODE_MS_PREF] = "ms-preferred",
407 [RRLP_MODE_ASS_PREF] = "ass-preferred",
408};
409
410enum rrlp_mode rrlp_mode_parse(const char *arg)
411{
412 int i;
413 for (i = 0; i < ARRAY_SIZE(rrlp_mode_names); i++) {
414 if (!strcmp(arg, rrlp_mode_names[i]))
415 return i;
416 }
417 return RRLP_MODE_NONE;
418}
419
420const char *rrlp_mode_name(enum rrlp_mode mode)
421{
422 if (mode > ARRAY_SIZE(rrlp_mode_names))
423 return "none";
424 return rrlp_mode_names[mode];
425}
Harald Welted12b0fd2009-12-15 21:36:05 +0100426
427struct gsm_meas_rep *lchan_next_meas_rep(struct gsm_lchan *lchan)
428{
429 struct gsm_meas_rep *meas_rep;
430
431 meas_rep = &lchan->meas_rep[lchan->meas_rep_idx];
432 memset(meas_rep, 0, sizeof(*meas_rep));
433 meas_rep->lchan = lchan;
434 lchan->meas_rep_idx = (lchan->meas_rep_idx + 1)
435 % ARRAY_SIZE(lchan->meas_rep);
436
437 return meas_rep;
438}