Gitiles
Code Review Sign In
gerrit.osmocom.org / gr-gsm / df417739b03546c327871d6ea17b61aca06cec70 / . / lib / decoding / osmocom / gsm / gsm48_ie.c
blob: 3881b184fa09ae0d4fd8bfe5f4ecf4e8ecf22880 [file] [log] [blame]
Piotr Krysik9e2e8352018-02-27 12:16:25 +0100[diff] [blame]1/*! \file gsm48_ie.c
2 * GSM Mobile Radio Interface Layer 3 messages.
3 * 3GPP TS 04.08 version 7.21.0 Release 1998 / ETSI TS 100 940 V7.21.0. */
4/*
5 * (C) 2008 by Harald Welte <laforge@gnumonks.org>
6 * (C) 2009-2010 by Andreas Eversberg
7 *
8 * All Rights Reserved
9 *
10 * SPDX-License-Identifier: GPL-2.0+
11 *
12 * This program is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU General Public License as published by
14 * the Free Software Foundation; either version 2 of the License, or
15 * (at your option) any later version.
16 *
17 * This program is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU General Public License for more details.
21 *
22 * You should have received a copy of the GNU General Public License along
23 * with this program; if not, write to the Free Software Foundation, Inc.,
24 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
25 *
26 */
27
28
29#include <stdint.h>
30#include <string.h>
31#include <errno.h>
32
33#include <osmocom/core/utils.h>
34/*#include <osmocom/core/msgb.h>*/
35/* #include <osmocom/gsm/tlv.h> */
36/* #include <osmocom/gsm/mncc.h> */
37#include <osmocom/gsm/protocol/gsm_04_08.h>
38#include <osmocom/gsm/gsm48_ie.h>
39
40/*! \addtogroup gsm0408
41 * @{
42 */
43
44//static const char bcd_num_digits[] = {
45// '0', '1', '2', '3', '4', '5', '6', '7',
46// '8', '9', '*', '#', 'a', 'b', 'c', '\0'
47//};
48
49///*! decode a 'called/calling/connect party BCD number' as in 10.5.4.7
50// * \param[out] Caller-provided output buffer
51// * \param[in] bcd_lv Length-Value portion of to-be-decoded IE
52// * \param[in] h_len Length of an optional heder between L and V portion
53// * \returns - in case of success; negative on error */
54//int gsm48_decode_bcd_number(char *output, int output_len,
55// const uint8_t *bcd_lv, int h_len)
56//{
57// uint8_t in_len = bcd_lv[0];
58// int i;
59
60// for (i = 1 + h_len; i <= in_len; i++) {
61// /* lower nibble */
62// output_len--;
63// if (output_len <= 1)
64// break;
65// *output++ = bcd_num_digits[bcd_lv[i] & 0xf];
66
67// /* higher nibble */
68// output_len--;
69// if (output_len <= 1)
70// break;
71// *output++ = bcd_num_digits[bcd_lv[i] >> 4];
72// }
73// if (output_len >= 1)
74// *output++ = '\0';
75
76// return 0;
77//}
78
79///*! convert a single ASCII character to call-control BCD */
80//static int asc_to_bcd(const char asc)
81//{
82// int i;
83
84// for (i = 0; i < ARRAY_SIZE(bcd_num_digits); i++) {
85// if (bcd_num_digits[i] == asc)
86// return i;
87// }
88// return -EINVAL;
89//}
90
91///*! convert a ASCII phone number to 'called/calling/connect party BCD number'
92// * \param[out] bcd_lv Caller-provided output buffer
93// * \param[in] max_len Maximum Length of \a bcd_lv
94// * \param[in] h_len Length of an optional heder between L and V portion
95// * \param[in] input phone number as 0-terminated ASCII
96// * \returns number of bytes used in \a bcd_lv */
97//int gsm48_encode_bcd_number(uint8_t *bcd_lv, uint8_t max_len,
98// int h_len, const char *input)
99//{
100// int in_len = strlen(input);
101// int i;
102// uint8_t *bcd_cur = bcd_lv + 1 + h_len;
103
104// /* two digits per byte, plus type byte */
105// bcd_lv[0] = in_len/2 + h_len;
106// if (in_len % 2)
107// bcd_lv[0]++;
108
109// if (bcd_lv[0] > max_len)
110// return -EIO;
111
112// for (i = 0; i < in_len; i++) {
113// int rc = asc_to_bcd(input[i]);
114// if (rc < 0)
115// return rc;
116// if (i % 2 == 0)
117// *bcd_cur = rc;
118// else
119// *bcd_cur++ |= (rc << 4);
120// }
121// /* append padding nibble in case of odd length */
122// if (i % 2)
123// *bcd_cur++ |= 0xf0;
124
125// /* return how many bytes we used */
126// return (bcd_cur - bcd_lv);
127//}
128
129///*! Decode TS 04.08 Bearer Capability IE (10.5.4.5)
130// * \param[out] Caller-provided memory for decoded output
131// * \[aram[in] LV portion of TS 04.08 Bearer Capability
132// * \returns 0 on success; negative on error */
133//int gsm48_decode_bearer_cap(struct gsm_mncc_bearer_cap *bcap,
134// const uint8_t *lv)
135//{
136// uint8_t in_len = lv[0];
137// int i, s;
138
139// if (in_len < 1)
140// return -EINVAL;
141
142// bcap->speech_ver[0] = -1; /* end of list, of maximum 7 values */
143
144// /* octet 3 */
145// bcap->transfer = lv[1] & 0x07;
146// bcap->mode = (lv[1] & 0x08) >> 3;
147// bcap->coding = (lv[1] & 0x10) >> 4;
148// bcap->radio = (lv[1] & 0x60) >> 5;
149
150// switch (bcap->transfer) {
151// case GSM_MNCC_BCAP_SPEECH:
152// i = 1;
153// s = 0;
154// while(!(lv[i] & 0x80)) {
155// i++; /* octet 3a etc */
156// if (in_len < i)
157// return 0;
158// bcap->speech_ver[s++] = lv[i] & 0x0f;
159// bcap->speech_ver[s] = -1; /* end of list */
160// if (i == 2) /* octet 3a */
161// bcap->speech_ctm = (lv[i] & 0x20) >> 5;
162// if (s == 7) /* maximum speech versions + end of list */
163// return 0;
164// }
165// break;
166// case GSM_MNCC_BCAP_UNR_DIG:
167// case GSM_MNCC_BCAP_FAX_G3:
168// i = 1;
169// while(!(lv[i] & 0x80)) {
170// i++; /* octet 3a etc */
171// if (in_len < i)
172// return 0;
173// /* ignore them */
174// }
175// /* octet 4: skip */
176// i++;
177// /* octet 5 */
178// i++;
179// if (in_len < i)
180// return 0;
181// bcap->data.rate_adaption = (lv[i] >> 3) & 3;
182// bcap->data.sig_access = lv[i] & 7;
183// while(!(lv[i] & 0x80)) {
184// i++; /* octet 5a etc */
185// if (in_len < i)
186// return 0;
187// /* ignore them */
188// }
189// /* octet 6 */
190// i++;
191// if (in_len < i)
192// return 0;
193// bcap->data.async = lv[i] & 1;
194// if (!(lv[i] & 0x80)) {
195// i++;
196// if (in_len < i)
197// return 0;
198// /* octet 6a */
199// bcap->data.nr_stop_bits = ((lv[i] >> 7) & 1) + 1;
200// if (lv[i] & 0x10)
201// bcap->data.nr_data_bits = 8;
202// else
203// bcap->data.nr_data_bits = 7;
204// bcap->data.user_rate = lv[i] & 0xf;
205
206// if (!(lv[i] & 0x80)) {
207// i++;
208// if (in_len < i)
209// return 0;
210// /* octet 6b */
211// bcap->data.parity = lv[i] & 7;
212// bcap->data.interm_rate = (lv[i] >> 5) & 3;
213
214// /* octet 6c */
215// if (!(lv[i] & 0x80)) {
216// i++;
217// if (in_len < i)
218// return 0;
219// bcap->data.transp = (lv[i] >> 5) & 3;
220// bcap->data.modem_type = lv[i] & 0x1F;
221// }
222// }
223
224// }
225// break;
226// default:
227// i = 1;
228// while (!(lv[i] & 0x80)) {
229// i++; /* octet 3a etc */
230// if (in_len < i)
231// return 0;
232// /* ignore them */
233// }
234// /* FIXME: implement OCTET 4+ parsing */
235// break;
236// }
237
238// return 0;
239//}
240
241///*! Encode TS 04.08 Bearer Capability IE (10.5.4.5)
242// * \param[out] msg Message Buffer to which IE is to be appended
243// * \param[in] lv_only Write only LV portion (1) or TLV (0)
244// * \param[in] bcap Decoded Bearer Capability to be encoded
245// * \returns 0 on success; negative on error */
246//int gsm48_encode_bearer_cap(struct msgb *msg, int lv_only,
247// const struct gsm_mncc_bearer_cap *bcap)
248//{
249// uint8_t lv[32 + 1];
250// int i = 1, s;
251
252// lv[1] = bcap->transfer;
253// lv[1] |= bcap->mode << 3;
254// lv[1] |= bcap->coding << 4;
255// lv[1] |= bcap->radio << 5;
256
257// switch (bcap->transfer) {
258// case GSM_MNCC_BCAP_SPEECH:
259// for (s = 0; bcap->speech_ver[s] >= 0; s++) {
260// i++; /* octet 3a etc */
261// lv[i] = bcap->speech_ver[s];
262// if (i == 2) /* octet 3a */
263// lv[i] |= bcap->speech_ctm << 5;
264// }
265// lv[i] |= 0x80; /* last IE of octet 3 etc */
266// break;
267// case GSM48_BCAP_ITCAP_UNR_DIG_INF:
268// case GSM48_BCAP_ITCAP_FAX_G3:
269// lv[i++] |= 0x80; /* last IE of octet 3 etc */
270// /* octet 4 */
271// lv[i++] = 0xb8;
272// /* octet 5 */
273// lv[i++] = 0x80 | ((bcap->data.rate_adaption & 3) << 3)
274// | (bcap->data.sig_access & 7);
275// /* octet 6 */
276// lv[i++] = 0x20 | (bcap->data.async & 1);
277// /* octet 6a */
278// lv[i++] = (bcap->data.user_rate & 0xf) |
279// (bcap->data.nr_data_bits == 8 ? 0x10 : 0x00) |
280// (bcap->data.nr_stop_bits == 2 ? 0x40 : 0x00);
281// /* octet 6b */
282// lv[i++] = (bcap->data.parity & 7) |
283// ((bcap->data.interm_rate & 3) << 5);
284// /* octet 6c */
285// lv[i] = 0x80 | (bcap->data.modem_type & 0x1f);
286// break;
287// default:
288// return -EINVAL;
289// }
290
291// lv[0] = i;
292// if (lv_only)
293// msgb_lv_put(msg, lv[0], lv+1);
294// else
295// msgb_tlv_put(msg, GSM48_IE_BEARER_CAP, lv[0], lv+1);
296
297// return 0;
298//}
299
300///*! Decode TS 04.08 Call Control Capabilities IE (10.5.4.5a)
301// * \param[out] Caller-provided memory for decoded CC capabilities
302// * \param[in] lv Length-Value of IE
303// * \retursns 0 on success; negative on error */
304//int gsm48_decode_cccap(struct gsm_mncc_cccap *ccap, const uint8_t *lv)
305//{
306// uint8_t in_len = lv[0];
307
308// if (in_len < 1)
309// return -EINVAL;
310
311// /* octet 3 */
312// ccap->dtmf = lv[1] & 0x01;
313// ccap->pcp = (lv[1] & 0x02) >> 1;
314
315// return 0;
316//}
317
318///*! Encodoe TS 04.08 Call Control Capabilities (10.5.4.5a)
319// * \param[out] msg Message Buffer to which to append IE (as TLV)
320// * \param[in] ccap Decoded CC Capabilities to be encoded
321// * \returns 0 on success; negative on error */
322//int gsm48_encode_cccap(struct msgb *msg,
323// const struct gsm_mncc_cccap *ccap)
324//{
325// uint8_t lv[2];
326
327// lv[0] = 1;
328// lv[1] = 0;
329// if (ccap->dtmf)
330// lv [1] |= 0x01;
331// if (ccap->pcp)
332// lv [1] |= 0x02;
333
334// msgb_tlv_put(msg, GSM48_IE_CC_CAP, lv[0], lv+1);
335
336// return 0;
337//}
338
339///*! Decode TS 04.08 Called Party BCD Number IE (10.5.4.7)
340// * \param[out] called Caller-provided memory for decoded number
341// * \param[in] lv Length-Value portion of IE
342// * \returns 0 on success; negative on error */
343//int gsm48_decode_called(struct gsm_mncc_number *called,
344// const uint8_t *lv)
345//{
346// uint8_t in_len = lv[0];
347
348// if (in_len < 1)
349// return -EINVAL;
350
351// /* octet 3 */
352// called->plan = lv[1] & 0x0f;
353// called->type = (lv[1] & 0x70) >> 4;
354
355// /* octet 4..N */
356// gsm48_decode_bcd_number(called->number, sizeof(called->number), lv, 1);
357
358// return 0;
359//}
360
361///*! Encode TS 04.08 Called Party IE (10.5.4.7)
362// * \param[out] msg Mesage Buffer to which to append IE (as TLV)
363// * \param[in] called MNCC Number to encode/append
364// * \returns 0 on success; negative on error */
365//int gsm48_encode_called(struct msgb *msg,
366// const struct gsm_mncc_number *called)
367//{
368// uint8_t lv[18];
369// int ret;
370
371// /* octet 3 */
372// lv[1] = 0x80; /* no extension */
373// lv[1] |= called->plan;
374// lv[1] |= called->type << 4;
375
376// /* octet 4..N, octet 2 */
377// ret = gsm48_encode_bcd_number(lv, sizeof(lv), 1, called->number);
378// if (ret < 0)
379// return ret;
380
381// msgb_tlv_put(msg, GSM48_IE_CALLED_BCD, lv[0], lv+1);
382
383// return 0;
384//}
385
386///*! Decode TS 04.08 Caller ID
387// * \param[out] called Caller-provided memory for decoded number
388// * \param[in] lv Length-Value portion of IE
389// * \returns 0 on success; negative on error */
390//int gsm48_decode_callerid(struct gsm_mncc_number *callerid,
391// const uint8_t *lv)
392//{
393// uint8_t in_len = lv[0];
394// int i = 1;
395
396// if (in_len < 1)
397// return -EINVAL;
398
399// /* octet 3 */
400// callerid->plan = lv[1] & 0x0f;
401// callerid->type = (lv[1] & 0x70) >> 4;
402
403// /* octet 3a */
404// if (!(lv[1] & 0x80)) {
405// callerid->screen = lv[2] & 0x03;
406// callerid->present = (lv[2] & 0x60) >> 5;
407// i = 2;
408// }
409
410// /* octet 4..N */
411// gsm48_decode_bcd_number(callerid->number, sizeof(callerid->number), lv, i);
412
413// return 0;
414//}
415
416///*! Encode TS 04.08 Caller ID IE
417// * \param[out] msg Mesage Buffer to which to append IE (as TLV)
418// * \param[in] ie IE Identifier (tag)
419// * \param[in] max_len maximum generated output in bytes
420// * \param[in] callerid MNCC Number to encode/append
421// * \returns 0 on success; negative on error */
422//int gsm48_encode_callerid(struct msgb *msg, int ie, int max_len,
423// const struct gsm_mncc_number *callerid)
424//{
425// uint8_t * lv = malloc(sizeof(uint8_t)*(max_len - 1));
426// int h_len = 1;
427// int ret;
428
429// /* octet 3 */
430// lv[1] = callerid->plan;
431// lv[1] |= callerid->type << 4;
432
433// if (callerid->present || callerid->screen) {
434// /* octet 3a */
435// lv[2] = callerid->screen;
436// lv[2] |= callerid->present << 5;
437// lv[2] |= 0x80;
438// h_len++;
439// } else
440// lv[1] |= 0x80;
441
442// /* octet 4..N, octet 2 */
443// ret = gsm48_encode_bcd_number(lv, sizeof(lv), h_len, callerid->number);
444// if (ret < 0)
445// return ret;
446
447// msgb_tlv_put(msg, ie, lv[0], lv+1);
448// free(lv);
449// return 0;
450//}
451
452///*! Decode TS 04.08 Cause IE (10.5.4.11)
453// * \param[out] cause Caller-provided memory for output
454// * \param[in] lv LV portion of Cause IE
455// * \returns 0 on success; negative on error */
456//int gsm48_decode_cause(struct gsm_mncc_cause *cause,
457// const uint8_t *lv)
458//{
459// uint8_t in_len = lv[0];
460// int i;
461
462// if (in_len < 2)
463// return -EINVAL;
464
465// cause->diag_len = 0;
466
467// /* octet 3 */
468// cause->location = lv[1] & 0x0f;
469// cause->coding = (lv[1] & 0x60) >> 5;
470
471// i = 1;
472// if (!(lv[i] & 0x80)) {
473// i++; /* octet 3a */
474// if (in_len < i+1)
475// return 0;
476// cause->rec = 1;
477// cause->rec_val = lv[i] & 0x7f;
478// }
479// i++;
480
481// /* octet 4 */
482// cause->value = lv[i] & 0x7f;
483// i++;
484
485// if (in_len < i) /* no diag */
486// return 0;
487
488// if (in_len - (i-1) > 32) /* maximum 32 octets */
489// return 0;
490
491// /* octet 5-N */
492// memcpy(cause->diag, lv + i, in_len - (i-1));
493// cause->diag_len = in_len - (i-1);
494
495// return 0;
496//}
497
498///*! Encode TS 04.08 Cause IE (10.5.4.11)
499// * \param[out] msg Message Buffer to which to append IE
500// * \param[in] lv_only Encode as LV (1) or TLV (0)
501// * \param[in] cause Cause value to be encoded
502// * \returns 0 on success; negative on error */
503//int gsm48_encode_cause(struct msgb *msg, int lv_only,
504// const struct gsm_mncc_cause *cause)
505//{
506// uint8_t lv[32+4];
507// int i;
508
509// if (cause->diag_len > 32)
510// return -EINVAL;
511
512// /* octet 3 */
513// lv[1] = cause->location;
514// lv[1] |= cause->coding << 5;
515
516// i = 1;
517// if (cause->rec) {
518// i++; /* octet 3a */
519// lv[i] = cause->rec_val;
520// }
521// lv[i] |= 0x80; /* end of octet 3 */
522
523// /* octet 4 */
524// i++;
525// lv[i] = 0x80 | cause->value;
526
527// /* octet 5-N */
528// if (cause->diag_len) {
529// memcpy(lv + i, cause->diag, cause->diag_len);
530// i += cause->diag_len;
531// }
532
533// lv[0] = i;
534// if (lv_only)
535// msgb_lv_put(msg, lv[0], lv+1);
536// else
537// msgb_tlv_put(msg, GSM48_IE_CAUSE, lv[0], lv+1);
538
539// return 0;
540//}
541
542///*! Decode TS 04.08 Calling Number IE (10.5.4.9) */
543//int gsm48_decode_calling(struct gsm_mncc_number *calling,
544// const uint8_t *lv)
545//{
546// return gsm48_decode_callerid(calling, lv);
547//}
548
549///*! Encode TS 04.08 Calling Number IE (10.5.4.9) */
550//int gsm48_encode_calling(struct msgb *msg,
551// const struct gsm_mncc_number *calling)
552//{
553// return gsm48_encode_callerid(msg, GSM48_IE_CALLING_BCD, 14, calling);
554//}
555
556///*! Decode TS 04.08 Connected Number IE (10.5.4.13) */
557//int gsm48_decode_connected(struct gsm_mncc_number *connected,
558// const uint8_t *lv)
559//{
560// return gsm48_decode_callerid(connected, lv);
561//}
562
563///*! Encode TS 04.08 Connected Number IE (10.5.4.13) */
564//int gsm48_encode_connected(struct msgb *msg,
565// const struct gsm_mncc_number *connected)
566//{
567// return gsm48_encode_callerid(msg, GSM48_IE_CONN_BCD, 14, connected);
568//}
569
570///*! Decode TS 04.08 Redirecting Number IE (10.5.4.21b) */
571//int gsm48_decode_redirecting(struct gsm_mncc_number *redirecting,
572// const uint8_t *lv)
573//{
574// return gsm48_decode_callerid(redirecting, lv);
575//}
576
577///*! Encode TS 04.08 Redirecting Number IE (10.5.4.21b) */
578//int gsm48_encode_redirecting(struct msgb *msg,
579// const struct gsm_mncc_number *redirecting)
580//{
581// return gsm48_encode_callerid(msg, GSM48_IE_REDIR_BCD, 19, redirecting);
582//}
583
584///*! Decode TS 04.08 Facility IE (10.5.4.15) */
585//int gsm48_decode_facility(struct gsm_mncc_facility *facility,
586// const uint8_t *lv)
587//{
588// uint8_t in_len = lv[0];
589
590// if (in_len < 1)
591// return -EINVAL;
592
593// if (in_len > sizeof(facility->info))
594// return -EINVAL;
595
596// memcpy(facility->info, lv+1, in_len);
597// facility->len = in_len;
598
599// return 0;
600//}
601
602///*! Encode TS 04.08 Facility IE (10.5.4.15) */
603//int gsm48_encode_facility(struct msgb *msg, int lv_only,
604// const struct gsm_mncc_facility *facility)
605//{
606// uint8_t lv[GSM_MAX_FACILITY + 1];
607
608// if (facility->len < 1 || facility->len > GSM_MAX_FACILITY)
609// return -EINVAL;
610
611// memcpy(lv+1, facility->info, facility->len);
612// lv[0] = facility->len;
613// if (lv_only)
614// msgb_lv_put(msg, lv[0], lv+1);
615// else
616// msgb_tlv_put(msg, GSM48_IE_FACILITY, lv[0], lv+1);
617
618// return 0;
619//}
620
621///*! Decode TS 04.08 Notify IE (10.5.4.20) */
622//int gsm48_decode_notify(int *notify, const uint8_t *v)
623//{
624// *notify = v[0] & 0x7f;
625
626// return 0;
627//}
628
629///*! Encode TS 04.08 Notify IE (10.5.4.20) */
630//int gsm48_encode_notify(struct msgb *msg, int notify)
631//{
632// msgb_v_put(msg, notify | 0x80);
633
634// return 0;
635//}
636
637///*! Decode TS 04.08 Signal IE (10.5.4.23) */
638//int gsm48_decode_signal(int *signal, const uint8_t *v)
639//{
640// *signal = v[0];
641
642// return 0;
643//}
644
645///*! Encode TS 04.08 Signal IE (10.5.4.23) */
646//int gsm48_encode_signal(struct msgb *msg, int signal)
647//{
648// msgb_tv_put(msg, GSM48_IE_SIGNAL, signal);
649
650// return 0;
651//}
652
653///*! Decode TS 04.08 Keypad IE (10.5.4.17) */
654//int gsm48_decode_keypad(int *keypad, const uint8_t *lv)
655//{
656// uint8_t in_len = lv[0];
657
658// if (in_len < 1)
659// return -EINVAL;
660
661// *keypad = lv[1] & 0x7f;
662
663// return 0;
664//}
665
666///*! Encode TS 04.08 Keypad IE (10.5.4.17) */
667//int gsm48_encode_keypad(struct msgb *msg, int keypad)
668//{
669// msgb_tv_put(msg, GSM48_IE_KPD_FACILITY, keypad);
670
671// return 0;
672//}
673
674///*! Decode TS 04.08 Progress IE (10.5.4.21) */
675//int gsm48_decode_progress(struct gsm_mncc_progress *progress,
676// const uint8_t *lv)
677//{
678// uint8_t in_len = lv[0];
679
680// if (in_len < 2)
681// return -EINVAL;
682
683// progress->coding = (lv[1] & 0x60) >> 5;
684// progress->location = lv[1] & 0x0f;
685// progress->descr = lv[2] & 0x7f;
686
687// return 0;
688//}
689
690///*! Encode TS 04.08 Progress IE (10.5.4.21) */
691//int gsm48_encode_progress(struct msgb *msg, int lv_only,
692// const struct gsm_mncc_progress *p)
693//{
694// uint8_t lv[3];
695
696// lv[0] = 2;
697// lv[1] = 0x80 | ((p->coding & 0x3) << 5) | (p->location & 0xf);
698// lv[2] = 0x80 | (p->descr & 0x7f);
699// if (lv_only)
700// msgb_lv_put(msg, lv[0], lv+1);
701// else
702// msgb_tlv_put(msg, GSM48_IE_PROGR_IND, lv[0], lv+1);
703
704// return 0;
705//}
706
707///*! Decode TS 04.08 User-User IE (10.5.4.25) */
708//int gsm48_decode_useruser(struct gsm_mncc_useruser *uu,
709// const uint8_t *lv)
710//{
711// uint8_t in_len = lv[0];
712// char *info = uu->info;
713// int info_len = sizeof(uu->info);
714// int i;
715
716// if (in_len < 1)
717// return -EINVAL;
718
719// uu->proto = lv[1];
720
721// for (i = 2; i <= in_len; i++) {
722// info_len--;
723// if (info_len <= 1)
724// break;
725// *info++ = lv[i];
726// }
727// if (info_len >= 1)
728// *info++ = '\0';
729
730// return 0;
731//}
732
733///*! Encode TS 04.08 User-User IE (10.5.4.25) */
734//int gsm48_encode_useruser(struct msgb *msg, int lv_only,
735// const struct gsm_mncc_useruser *uu)
736//{
737// uint8_t lv[GSM_MAX_USERUSER + 2];
738
739// if (strlen(uu->info) > GSM_MAX_USERUSER)
740// return -EINVAL;
741
742// lv[0] = 1 + strlen(uu->info);
743// lv[1] = uu->proto;
744// memcpy(lv + 2, uu->info, strlen(uu->info));
745// if (lv_only)
746// msgb_lv_put(msg, lv[0], lv+1);
747// else
748// msgb_tlv_put(msg, GSM48_IE_USER_USER, lv[0], lv+1);
749
750// return 0;
751//}
752
753///*! Decode TS 04.08 SS Version IE (10.5.4.24) */
754//int gsm48_decode_ssversion(struct gsm_mncc_ssversion *ssv,
755// const uint8_t *lv)
756//{
757// uint8_t in_len = lv[0];
758
759// if (in_len < 1 || in_len < sizeof(ssv->info))
760// return -EINVAL;
761
762// memcpy(ssv->info, lv + 1, in_len);
763// ssv->len = in_len;
764
765// return 0;
766//}
767
768///*! Encode TS 04.08 SS Version IE (10.5.4.24) */
769//int gsm48_encode_ssversion(struct msgb *msg,
770// const struct gsm_mncc_ssversion *ssv)
771//{
772// uint8_t lv[GSM_MAX_SSVERSION + 1];
773
774// if (ssv->len > GSM_MAX_SSVERSION)
775// return -EINVAL;
776
777// lv[0] = ssv->len;
778// memcpy(lv + 1, ssv->info, ssv->len);
779// msgb_tlv_put(msg, GSM48_IE_SS_VERS, lv[0], lv+1);
780
781// return 0;
782//}
783
784///* decode 'more data' does not require a function, because it has no value */
785
786///*! Encode TS 04.08 More Data IE (10.5.4.19) */
787//int gsm48_encode_more(struct msgb *msg)
788//{
789// uint8_t *ie;
790
791// ie = msgb_put(msg, 1);
792// ie[0] = GSM48_IE_MORE_DATA;
793
794// return 0;
795//}
796
797static int32_t smod(int32_t n, int32_t m)
798{
799 int32_t res;
800
801 res = n % m;
802
803 if (res <= 0)
804 res += m;
805
806 return res;
807}
808
809/*! Decode TS 04.08 Cell Channel Description IE (10.5.2.1b) and other frequency lists
810 * \param[out] f Caller-provided output memory
811 * \param[in] cd Cell Channel Description IE
812 * \param[in] len Length of \a cd in bytes
813 * \returns 0 on success; negative on error */
814int gsm48_decode_freq_list(struct gsm_sysinfo_freq *f, uint8_t *cd,
815 uint8_t len, uint8_t mask, uint8_t frqt)
816{
817 int i;
818
819 /* NOTES:
820 *
821 * The Range format uses "SMOD" computation.
822 * e.g. "n SMOD m" equals "((n - 1) % m) + 1"
823 * A cascade of multiple SMOD computations is simpified:
824 * "(n SMOD m) SMOD o" equals "(((n - 1) % m) % o) + 1"
825 *
826 * The Range format uses 16 octets of data in SYSTEM INFORMATION.
827 * When used in dedicated messages, the length can be less.
828 * In this case the ranges are decoded for all frequencies that
829 * fit in the block of given length.
830 */
831
832 /* tabula rasa */
833 for (i = 0; i < 1024; i++)
834 f[i].mask &= ~frqt;
835
836 /* 00..XXX. */
837 if ((cd[0] & 0xc0 & mask) == 0x00) {
838 /* Bit map 0 format */
839 if (len < 16)
840 return -EINVAL;
841 for (i = 1; i <= 124; i++)
842 if ((cd[15 - ((i-1) >> 3)] & (1 << ((i-1) & 7))))
843 f[i].mask |= frqt;
844
845 return 0;
846 }
847
848 /* 10..0XX. */
849 if ((cd[0] & 0xc8 & mask) == 0x80) {
850 /* Range 1024 format */
851 uint16_t w[17]; /* 1..16 */
852 struct gsm48_range_1024 *r = (struct gsm48_range_1024 *)cd;
853
854 if (len < 2)
855 return -EINVAL;
856 memset(w, 0, sizeof(w));
857 if (r->f0)
858 f[0].mask |= frqt;
859 w[1] = (r->w1_hi << 8) | r->w1_lo;
860 if (len >= 4)
861 w[2] = (r->w2_hi << 1) | r->w2_lo;
862 if (len >= 5)
863 w[3] = (r->w3_hi << 2) | r->w3_lo;
864 if (len >= 6)
865 w[4] = (r->w4_hi << 2) | r->w4_lo;
866 if (len >= 7)
867 w[5] = (r->w5_hi << 2) | r->w5_lo;
868 if (len >= 8)
869 w[6] = (r->w6_hi << 2) | r->w6_lo;
870 if (len >= 9)
871 w[7] = (r->w7_hi << 2) | r->w7_lo;
872 if (len >= 10)
873 w[8] = (r->w8_hi << 1) | r->w8_lo;
874 if (len >= 10)
875 w[9] = r->w9;
876 if (len >= 11)
877 w[10] = r->w10;
878 if (len >= 12)
879 w[11] = (r->w11_hi << 6) | r->w11_lo;
880 if (len >= 13)
881 w[12] = (r->w12_hi << 5) | r->w12_lo;
882 if (len >= 14)
883 w[13] = (r->w13_hi << 4) | r->w13_lo;
884 if (len >= 15)
885 w[14] = (r->w14_hi << 3) | r->w14_lo;
886 if (len >= 16)
887 w[15] = (r->w15_hi << 2) | r->w15_lo;
888 if (len >= 16)
889 w[16] = r->w16;
890 if (w[1])
891 f[w[1]].mask |= frqt;
892 if (w[2])
893 f[smod(w[1] - 512 + w[2], 1023)].mask |= frqt;
894 if (w[3])
895 f[smod(w[1] + w[3], 1023)].mask |= frqt;
896 if (w[4])
897 f[smod(w[1] - 512 + smod(w[2] - 256 + w[4], 511), 1023)].mask |= frqt;
898 if (w[5])
899 f[smod(w[1] + smod(w[3] - 256 + w[5], 511), 1023)].mask |= frqt;
900 if (w[6])
901 f[smod(w[1] - 512 + smod(w[2] + w[6], 511), 1023)].mask |= frqt;
902 if (w[7])
903 f[smod(w[1] + smod(w[3] + w[7], 511), 1023)].mask |= frqt;
904 if (w[8])
905 f[smod(w[1] - 512 + smod(w[2] - 256 + smod(w[4] - 128 + w[8] , 255), 511), 1023)].mask |= frqt;
906 if (w[9])
907 f[smod(w[1] + smod(w[3] - 256 + smod(w[5] - 128 + w[9] , 255), 511), 1023)].mask |= frqt;
908 if (w[10])
909 f[smod(w[1] - 512 + smod(w[2] + smod(w[6] - 128 + w[10], 255), 511), 1023)].mask |= frqt;
910 if (w[11])
911 f[smod(w[1] + smod(w[3] + smod(w[7] - 128 + w[11], 255), 511), 1023)].mask |= frqt;
912 if (w[12])
913 f[smod(w[1] - 512 + smod(w[2] - 256 + smod(w[4] + w[12], 255), 511), 1023)].mask |= frqt;
914 if (w[13])
915 f[smod(w[1] + smod(w[3] - 256 + smod(w[5] + w[13], 255), 511), 1023)].mask |= frqt;
916 if (w[14])
917 f[smod(w[1] - 512 + smod(w[2] + smod(w[6] + w[14], 255), 511), 1023)].mask |= frqt;
918 if (w[15])
919 f[smod(w[1] + smod(w[3] + smod(w[7] + w[15], 255), 511), 1023)].mask |= frqt;
920 if (w[16])
921 f[smod(w[1] - 512 + smod(w[2] - 256 + smod(w[4] - 128 + smod(w[8] - 64 + w[16], 127), 255), 511), 1023)].mask |= frqt;
922
923 return 0;
924 }
925 /* 10..100. */
926 if ((cd[0] & 0xce & mask) == 0x88) {
927 /* Range 512 format */
928 uint16_t w[18]; /* 1..17 */
929 struct gsm48_range_512 *r = (struct gsm48_range_512 *)cd;
930
931 if (len < 4)
932 return -EINVAL;
933 memset(w, 0, sizeof(w));
934 w[0] = (r->orig_arfcn_hi << 9) | (r->orig_arfcn_mid << 1) | r->orig_arfcn_lo;
935 w[1] = (r->w1_hi << 2) | r->w1_lo;
936 if (len >= 5)
937 w[2] = (r->w2_hi << 2) | r->w2_lo;
938 if (len >= 6)
939 w[3] = (r->w3_hi << 2) | r->w3_lo;
940 if (len >= 7)
941 w[4] = (r->w4_hi << 1) | r->w4_lo;
942 if (len >= 7)
943 w[5] = r->w5;
944 if (len >= 8)
945 w[6] = r->w6;
946 if (len >= 9)
947 w[7] = (r->w7_hi << 6) | r->w7_lo;
948 if (len >= 10)
949 w[8] = (r->w8_hi << 4) | r->w8_lo;
950 if (len >= 11)
951 w[9] = (r->w9_hi << 2) | r->w9_lo;
952 if (len >= 11)
953 w[10] = r->w10;
954 if (len >= 12)
955 w[11] = r->w11;
956 if (len >= 13)
957 w[12] = (r->w12_hi << 4) | r->w12_lo;
958 if (len >= 14)
959 w[13] = (r->w13_hi << 2) | r->w13_lo;
960 if (len >= 14)
961 w[14] = r->w14;
962 if (len >= 15)
963 w[15] = r->w15;
964 if (len >= 16)
965 w[16] = (r->w16_hi << 3) | r->w16_lo;
966 if (len >= 16)
967 w[17] = r->w17;
968 f[w[0]].mask |= frqt;
969 if (w[1])
970 f[(w[0] + w[1]) % 1024].mask |= frqt;
971 if (w[2])
972 f[(w[0] + smod(w[1] - 256 + w[2], 511)) % 1024].mask |= frqt;
973 if (w[3])
974 f[(w[0] + smod(w[1] + w[3], 511)) % 1024].mask |= frqt;
975 if (w[4])
976 f[(w[0] + smod(w[1] - 256 + smod(w[2] - 128 + w[4], 255), 511)) % 1024].mask |= frqt;
977 if (w[5])
978 f[(w[0] + smod(w[1] + smod(w[3] - 128 + w[5], 255), 511)) % 1024].mask |= frqt;
979 if (w[6])
980 f[(w[0] + smod(w[1] - 256 + smod(w[2] + w[6], 255), 511)) % 1024].mask |= frqt;
981 if (w[7])
982 f[(w[0] + smod(w[1] + smod(w[3] + w[7], 255), 511)) % 1024].mask |= frqt;
983 if (w[8])
984 f[(w[0] + smod(w[1] - 256 + smod(w[2] - 128 + smod(w[4] - 64 + w[8] , 127), 255), 511)) % 1024].mask |= frqt;
985 if (w[9])
986 f[(w[0] + smod(w[1] + smod(w[3] - 128 + smod(w[5] - 64 + w[9] , 127), 255), 511)) % 1024].mask |= frqt;
987 if (w[10])
988 f[(w[0] + smod(w[1] - 256 + smod(w[2] + smod(w[6] - 64 + w[10], 127), 255), 511)) % 1024].mask |= frqt;
989 if (w[11])
990 f[(w[0] + smod(w[1] + smod(w[3] + smod(w[7] - 64 + w[11], 127), 255), 511)) % 1024].mask |= frqt;
991 if (w[12])
992 f[(w[0] + smod(w[1] - 256 + smod(w[2] - 128 + smod(w[4] + w[12], 127), 255), 511)) % 1024].mask |= frqt;
993 if (w[13])
994 f[(w[0] + smod(w[1] + smod(w[3] - 128 + smod(w[5] + w[13], 127), 255), 511)) % 1024].mask |= frqt;
995 if (w[14])
996 f[(w[0] + smod(w[1] - 256 + smod(w[2] + smod(w[6] + w[14], 127), 255), 511)) % 1024].mask |= frqt;
997 if (w[15])
998 f[(w[0] + smod(w[1] + smod(w[3] + smod(w[7] + w[15], 127), 255), 511)) % 1024].mask |= frqt;
999 if (w[16])
1000 f[(w[0] + smod(w[1] - 256 + smod(w[2] - 128 + smod(w[4] - 64 + smod(w[8] - 32 + w[16], 63), 127), 255), 511)) % 1024].mask |= frqt;
1001 if (w[17])
1002 f[(w[0] + smod(w[1] + smod(w[3] - 128 + smod(w[5] - 64 + smod(w[9] - 32 + w[17], 63), 127), 255), 511)) % 1024].mask |= frqt;
1003
1004 return 0;
1005 }
1006 /* 10..101. */
1007 if ((cd[0] & 0xce & mask) == 0x8a) {
1008 /* Range 256 format */
1009 uint16_t w[22]; /* 1..21 */
1010 struct gsm48_range_256 *r = (struct gsm48_range_256 *)cd;
1011
1012 if (len < 4)
1013 return -EINVAL;
1014 memset(w, 0, sizeof(w));
1015 w[0] = (r->orig_arfcn_hi << 9) | (r->orig_arfcn_mid << 1) | r->orig_arfcn_lo;
1016 w[1] = (r->w1_hi << 1) | r->w1_lo;
1017 if (len >= 4)
1018 w[2] = r->w2;
1019 if (len >= 5)
1020 w[3] = r->w3;
1021 if (len >= 6)
1022 w[4] = (r->w4_hi << 5) | r->w4_lo;
1023 if (len >= 7)
1024 w[5] = (r->w5_hi << 3) | r->w5_lo;
1025 if (len >= 8)
1026 w[6] = (r->w6_hi << 1) | r->w6_lo;
1027 if (len >= 8)
1028 w[7] = r->w7;
1029 if (len >= 9)
1030 w[8] = (r->w8_hi << 4) | r->w8_lo;
1031 if (len >= 10)
1032 w[9] = (r->w9_hi << 1) | r->w9_lo;
1033 if (len >= 10)
1034 w[10] = r->w10;
1035 if (len >= 11)
1036 w[11] = (r->w11_hi << 3) | r->w11_lo;
1037 if (len >= 11)
1038 w[12] = r->w12;
1039 if (len >= 12)
1040 w[13] = r->w13;
1041 if (len >= 13)
1042 w[14] = (r->w14_hi << 2) | r->w14_lo;
1043 if (len >= 13)
1044 w[15] = r->w15;
1045 if (len >= 14)
1046 w[16] = (r->w16_hi << 3) | r->w16_lo;
1047 if (len >= 14)
1048 w[17] = r->w17;
1049 if (len >= 15)
1050 w[18] = (r->w18_hi << 3) | r->w18_lo;
1051 if (len >= 15)
1052 w[19] = r->w19;
1053 if (len >= 16)
1054 w[20] = (r->w20_hi << 3) | r->w20_lo;
1055 if (len >= 16)
1056 w[21] = r->w21;
1057 f[w[0]].mask |= frqt;
1058 if (w[1])
1059 f[(w[0] + w[1]) % 1024].mask |= frqt;
1060 if (w[2])
1061 f[(w[0] + smod(w[1] - 128 + w[2], 255)) % 1024].mask |= frqt;
1062 if (w[3])
1063 f[(w[0] + smod(w[1] + w[3], 255)) % 1024].mask |= frqt;
1064 if (w[4])
1065 f[(w[0] + smod(w[1] - 128 + smod(w[2] - 64 + w[4], 127), 255)) % 1024].mask |= frqt;
1066 if (w[5])
1067 f[(w[0] + smod(w[1] + smod(w[3] - 64 + w[5], 127), 255)) % 1024].mask |= frqt;
1068 if (w[6])
1069 f[(w[0] + smod(w[1] - 128 + smod(w[2] + w[6], 127), 255)) % 1024].mask |= frqt;
1070 if (w[7])
1071 f[(w[0] + smod(w[1] + smod(w[3] + w[7], 127), 255)) % 1024].mask |= frqt;
1072 if (w[8])
1073 f[(w[0] + smod(w[1] - 128 + smod(w[2] - 64 + smod(w[4] - 32 + w[8] , 63), 127), 255)) % 1024].mask |= frqt;
1074 if (w[9])
1075 f[(w[0] + smod(w[1] + smod(w[3] - 64 + smod(w[5] - 32 + w[9] , 63), 127), 255)) % 1024].mask |= frqt;
1076 if (w[10])
1077 f[(w[0] + smod(w[1] - 128 + smod(w[2] + smod(w[6] - 32 + w[10], 63), 127), 255)) % 1024].mask |= frqt;
1078 if (w[11])
1079 f[(w[0] + smod(w[1] + smod(w[3] + smod(w[7] - 32 + w[11], 63), 127), 255)) % 1024].mask |= frqt;
1080 if (w[12])
1081 f[(w[0] + smod(w[1] - 128 + smod(w[2] - 64 + smod(w[4] + w[12], 63), 127), 255)) % 1024].mask |= frqt;
1082 if (w[13])
1083 f[(w[0] + smod(w[1] + smod(w[3] - 64 + smod(w[5] + w[13], 63), 127), 255)) % 1024].mask |= frqt;
1084 if (w[14])
1085 f[(w[0] + smod(w[1] - 128 + smod(w[2] + smod(w[6] + w[14], 63), 127), 255)) % 1024].mask |= frqt;
1086 if (w[15])
1087 f[(w[0] + smod(w[1] + smod(w[3] + smod(w[7] + w[15], 63), 127), 255)) % 1024].mask |= frqt;
1088 if (w[16])
1089 f[(w[0] + smod(w[1] - 128 + smod(w[2] - 64 + smod(w[4] - 32 + smod(w[8] - 16 + w[16], 31), 63), 127), 255)) % 1024].mask |= frqt;
1090 if (w[17])
1091 f[(w[0] + smod(w[1] + smod(w[3] - 64 + smod(w[5] - 32 + smod(w[9] - 16 + w[17], 31), 63), 127), 255)) % 1024].mask |= frqt;
1092 if (w[18])
1093 f[(w[0] + smod(w[1] - 128 + smod(w[2] + smod(w[6] - 32 + smod(w[10] - 16 + w[18], 31), 63), 127), 255)) % 1024].mask |= frqt;
1094 if (w[19])
1095 f[(w[0] + smod(w[1] + smod(w[3] + smod(w[7] - 32 + smod(w[11] - 16 + w[19], 31), 63), 127), 255)) % 1024].mask |= frqt;
1096 if (w[20])
1097 f[(w[0] + smod(w[1] - 128 + smod(w[2] - 64 + smod(w[4] + smod(w[12] - 16 + w[20], 31), 63), 127), 255)) % 1024].mask |= frqt;
1098 if (w[21])
1099 f[(w[0] + smod(w[1] + smod(w[3] - 64 + smod(w[5] + smod(w[13] - 16 + w[21], 31), 63), 127), 255)) % 1024].mask |= frqt;
1100
1101 return 0;
1102 }
1103 /* 10..110. */
1104 if ((cd[0] & 0xce & mask) == 0x8c) {
1105 /* Range 128 format */
1106 uint16_t w[29]; /* 1..28 */
1107 struct gsm48_range_128 *r = (struct gsm48_range_128 *)cd;
1108
1109 if (len < 3)
1110 return -EINVAL;
1111 memset(w, 0, sizeof(w));
1112 w[0] = (r->orig_arfcn_hi << 9) | (r->orig_arfcn_mid << 1) | r->orig_arfcn_lo;
1113 w[1] = r->w1;
1114 if (len >= 4)
1115 w[2] = r->w2;
1116 if (len >= 5)
1117 w[3] = (r->w3_hi << 4) | r->w3_lo;
1118 if (len >= 6)
1119 w[4] = (r->w4_hi << 1) | r->w4_lo;
1120 if (len >= 6)
1121 w[5] = r->w5;
1122 if (len >= 7)
1123 w[6] = (r->w6_hi << 3) | r->w6_lo;
1124 if (len >= 7)
1125 w[7] = r->w7;
1126 if (len >= 8)
1127 w[8] = r->w8;
1128 if (len >= 8)
1129 w[9] = r->w9;
1130 if (len >= 9)
1131 w[10] = r->w10;
1132 if (len >= 9)
1133 w[11] = r->w11;
1134 if (len >= 10)
1135 w[12] = r->w12;
1136 if (len >= 10)
1137 w[13] = r->w13;
1138 if (len >= 11)
1139 w[14] = r->w14;
1140 if (len >= 11)
1141 w[15] = r->w15;
1142 if (len >= 12)
1143 w[16] = r->w16;
1144 if (len >= 12)
1145 w[17] = r->w17;
1146 if (len >= 13)
1147 w[18] = (r->w18_hi << 1) | r->w18_lo;
1148 if (len >= 13)
1149 w[19] = r->w19;
1150 if (len >= 13)
1151 w[20] = r->w20;
1152 if (len >= 14)
1153 w[21] = (r->w21_hi << 2) | r->w21_lo;
1154 if (len >= 14)
1155 w[22] = r->w22;
1156 if (len >= 14)
1157 w[23] = r->w23;
1158 if (len >= 15)
1159 w[24] = r->w24;
1160 if (len >= 15)
1161 w[25] = r->w25;
1162 if (len >= 16)
1163 w[26] = (r->w26_hi << 1) | r->w26_lo;
1164 if (len >= 16)
1165 w[27] = r->w27;
1166 if (len >= 16)
1167 w[28] = r->w28;
1168 f[w[0]].mask |= frqt;
1169 if (w[1])
1170 f[(w[0] + w[1]) % 1024].mask |= frqt;
1171 if (w[2])
1172 f[(w[0] + smod(w[1] - 64 + w[2], 127)) % 1024].mask |= frqt;
1173 if (w[3])
1174 f[(w[0] + smod(w[1] + w[3], 127)) % 1024].mask |= frqt;
1175 if (w[4])
1176 f[(w[0] + smod(w[1] - 64 + smod(w[2] - 32 + w[4], 63), 127)) % 1024].mask |= frqt;
1177 if (w[5])
1178 f[(w[0] + smod(w[1] + smod(w[3] - 32 + w[5], 63), 127)) % 1024].mask |= frqt;
1179 if (w[6])
1180 f[(w[0] + smod(w[1] - 64 + smod(w[2] + w[6], 63), 127)) % 1024].mask |= frqt;
1181 if (w[7])
1182 f[(w[0] + smod(w[1] + smod(w[3] + w[7], 63), 127)) % 1024].mask |= frqt;
1183 if (w[8])
1184 f[(w[0] + smod(w[1] - 64 + smod(w[2] - 32 + smod(w[4] - 16 + w[8] , 31), 63), 127)) % 1024].mask |= frqt;
1185 if (w[9])
1186 f[(w[0] + smod(w[1] + smod(w[3] - 32 + smod(w[5] - 16 + w[9] , 31), 63), 127)) % 1024].mask |= frqt;
1187 if (w[10])
1188 f[(w[0] + smod(w[1] - 64 + smod(w[2] + smod(w[6] - 16 + w[10], 31), 63), 127)) % 1024].mask |= frqt;
1189 if (w[11])
1190 f[(w[0] + smod(w[1] + smod(w[3] + smod(w[7] - 16 + w[11], 31), 63), 127)) % 1024].mask |= frqt;
1191 if (w[12])
1192 f[(w[0] + smod(w[1] - 64 + smod(w[2] - 32 + smod(w[4] + w[12], 31), 63), 127)) % 1024].mask |= frqt;
1193 if (w[13])
1194 f[(w[0] + smod(w[1] + smod(w[3] - 32 + smod(w[5] + w[13], 31), 63), 127)) % 1024].mask |= frqt;
1195 if (w[14])
1196 f[(w[0] + smod(w[1] - 64 + smod(w[2] + smod(w[6] + w[14], 31), 63), 127)) % 1024].mask |= frqt;
1197 if (w[15])
1198 f[(w[0] + smod(w[1] + smod(w[3] + smod(w[7] + w[15], 31), 63), 127)) % 1024].mask |= frqt;
1199 if (w[16])
1200 f[(w[0] + smod(w[1] - 64 + smod(w[2] - 32 + smod(w[4] - 16 + smod(w[8] - 8 + w[16], 15), 31), 63), 127)) % 1024].mask |= frqt;
1201 if (w[17])
1202 f[(w[0] + smod(w[1] + smod(w[3] - 32 + smod(w[5] - 16 + smod(w[9] - 8 + w[17], 15), 31), 63), 127)) % 1024].mask |= frqt;
1203 if (w[18])
1204 f[(w[0] + smod(w[1] - 64 + smod(w[2] + smod(w[6] - 16 + smod(w[10] - 8 + w[18], 15), 31), 63), 127)) % 1024].mask |= frqt;
1205 if (w[19])
1206 f[(w[0] + smod(w[1] + smod(w[3] + smod(w[7] - 16 + smod(w[11] - 8 + w[19], 15), 31), 63), 127)) % 1024].mask |= frqt;
1207 if (w[20])
1208 f[(w[0] + smod(w[1] - 64 + smod(w[2] - 32 + smod(w[4] + smod(w[12] - 8 + w[20], 15), 31), 63), 127)) % 1024].mask |= frqt;
1209 if (w[21])
1210 f[(w[0] + smod(w[1] + smod(w[3] - 32 + smod(w[5] + smod(w[13] - 8 + w[21], 15), 31), 63), 127)) % 1024].mask |= frqt;
1211 if (w[22])
1212 f[(w[0] + smod(w[1] - 64 + smod(w[2] + smod(w[6] + smod(w[14] - 8 + w[22], 15), 31), 63), 127)) % 1024].mask |= frqt;
1213 if (w[23])
1214 f[(w[0] + smod(w[1] + smod(w[3] + smod(w[7] + smod(w[15] - 8 + w[23], 15), 31), 63), 127)) % 1024].mask |= frqt;
1215 if (w[24])
1216 f[(w[0] + smod(w[1] - 64 + smod(w[2] - 32 + smod(w[4] - 16 + smod(w[8] + w[24], 15), 31), 63), 127)) % 1024].mask |= frqt;
1217 if (w[25])
1218 f[(w[0] + smod(w[1] + smod(w[3] - 32 + smod(w[5] - 16 + smod(w[9] + w[25], 15), 31), 63), 127)) % 1024].mask |= frqt;
1219 if (w[26])
1220 f[(w[0] + smod(w[1] - 64 + smod(w[2] + smod(w[6] - 16 + smod(w[10] + w[26], 15), 31), 63), 127)) % 1024].mask |= frqt;
1221 if (w[27])
1222 f[(w[0] + smod(w[1] + smod(w[3] + smod(w[7] - 16 + smod(w[11] + w[27], 15), 31), 63), 127)) % 1024].mask |= frqt;
1223 if (w[28])
1224 f[(w[0] + smod(w[1] - 64 + smod(w[2] - 32 + smod(w[4] + smod(w[12] + w[28], 15), 31), 63), 127)) % 1024].mask |= frqt;
1225
1226 return 0;
1227 }
1228 /* 10..111. */
1229 if ((cd[0] & 0xce & mask) == 0x8e) {
1230 /* Variable bitmap format (can be any length >= 3) */
1231 uint16_t orig = 0;
1232 struct gsm48_var_bit *r = (struct gsm48_var_bit *)cd;
1233
1234 if (len < 3)
1235 return -EINVAL;
1236 orig = (r->orig_arfcn_hi << 9) | (r->orig_arfcn_mid << 1) | r->orig_arfcn_lo;
1237 f[orig].mask |= frqt;
1238 for (i = 1; 2 + (i >> 3) < len; i++)
1239 if ((cd[2 + (i >> 3)] & (0x80 >> (i & 7))))
1240 f[(orig + i) % 1024].mask |= frqt;
1241
1242 return 0;
1243 }
1244
1245 return 0;
1246}
1247/*! @} */