blob: 1c9a75b56c69438000f62c2714975e9dfe2c529c [file] [log] [blame]
Harald Welte060e27a2018-03-03 20:38:19 +01001module GPRS_TBF {
2
3/* GPRS TBF Routines, intended as minimal MS-Side GPRS implementation
4 *
5 * (C) 2018 by Harald Welte <laforge@gnumonks.org>
6 * All rights reserved.
7 *
8 * Released under the terms of GNU General Public License, Version 2 or
9 * (at your option) any later version.
Harald Welte34b5a952019-05-27 11:54:11 +020010 *
11 * SPDX-License-Identifier: GPL-2.0-or-later
Harald Welte060e27a2018-03-03 20:38:19 +010012 */
13
Harald Welte060e27a2018-03-03 20:38:19 +010014import from GSM_Types all;
15import from Osmocom_Types all;
16import from General_Types all;
17import from RLCMAC_Types all;
18import from RLCMAC_CSN1_Types all;
19import from LLC_Types all;
20import from GPRS_Context all;
21
Harald Weltecc5c1152018-03-09 12:54:01 +010022private const integer RLC_GPRS_SNS := 128;
23private const integer RLC_GPRS_WS := 64;
24private const integer RLC_EGPRS_MIN_WS := 64;
25private const integer RLC_EGPRS_MAX_WS := 1024;
26private const integer RLC_EGPRS_SNS := 2048;
27private const integer RLC_EGPRS_MAX_BSN_DELTA := 512;
28private const integer RLC_MAX_SNS := RLC_EGPRS_SNS;
29private const integer RLC_MAX_WS := RLC_EGPRS_MAX_WS;
30private const integer RLC_MAX_LEN := 74 /* MCS-9 data unit */
Harald Welte060e27a2018-03-03 20:38:19 +010031
Harald Weltecc5c1152018-03-09 12:54:01 +010032private const integer sns_half := (RLC_MAX_SNS / 2);
33private const integer mod_sns_half := (RLC_MAX_SNS / 2) - 1;
34
35
36/***********************************************************************
37 * Uplink TBF handling
38 ***********************************************************************/
39
40/* input parameters into TBF (mostly mode/cs + LLC PDUs */
Harald Welte060e27a2018-03-03 20:38:19 +010041type record UlTbfPars {
42 /* Acknowledged mode (true) or unacknowledged (false) */
43 boolean ack_mode,
44 /* Coding Scheme for transmission, determines block size */
45 GprsCodingScheme initial_cs,
46 /* list of abstract/decoded LLC PDUs */
47 record of PDU_LLC llc_pdus optional,
48 /* possibly computed: list of encoded LLC PDUs */
49 record of octetstring llc_pdus_enc
50}
51
52type record RlcEndpointTx {
53 /* send state variable V(S) (9.1.1): 0 .. SNS-1 */
54 integer v_s,
55 /* acknowledge state variable V(A) (9.1.2): BSN value of oldest RLC data block that has not
56 * been positively acknowledged by peer. */
57 integer v_a,
58 /* acknowledge state array V(B) (9.1.3) */
59 bitstring v_b
60}
61private function f_RlcEndpointTx_init(inout RlcEndpointTx ep) {
62 ep.v_s := 0;
63 ep.v_a := 0;
64 ep.v_b := int2bit(0, 128); /* FIXME: EGPRS 2048 bits length */
65}
66
Harald Welte060e27a2018-03-03 20:38:19 +010067type record UlTbfState {
68 /* "const" input state with TBF Data */
69 UlTbfPars tbf,
70 uint8_t num_ts,
71
72 RlcEndpointTx et,
73
74 integer tfi,
75 /* total length of all encoded LLC PDUs */
76 integer llc_pdu_totlen,
77 /* index of current/next PDU in llc_pdus_enc */
78 integer cur_pdu,
79 /* byte offset into current/next PDU; next byte to transmit */
80 integer cur_index,
81 /* block sequence number of next block within TBF */
82 integer bsn_p,
83 /* total number of bytes remaining in TBF */
84 integer total_bytes_remain,
85
86 /* list of already-sent RLC/MAC Blocks */
87 record of RlcmacUlBlock rlc_sent
88}
89
90function f_UlTbfState_init(inout UlTbfState us, in UlTbfPars utpars) {
91 var RlcmacUlBlock blk;
92
93 us.tbf := utpars;
94 us.num_ts := 1;
95
96 f_RlcEndpointTx_init(us.et);
97
98 us.tfi := 0; /* FIXME */
99 us.cur_pdu := 0;
100 us.cur_index := 0;
101 us.bsn_p := 0;
102 us.total_bytes_remain := 0;
103 us.rlc_sent := {};
104
105 /* encode all LLC PDUs from their abstract type to octetstring */
106 us.cur_pdu := 0; /* currently processed PDU */
107 us.cur_index := 0; /* next to-be transmitted index */
108 if (ispresent(us.tbf.llc_pdus)) {
109 us.tbf.llc_pdus_enc := {};
110 us.llc_pdu_totlen := 0;
111 for (var integer i := 0; i < sizeof(us.tbf.llc_pdus); i := i+1) {
112 var octetstring cur_enc := enc_PDU_LLC(us.tbf.llc_pdus[i]);
113 us.tbf.llc_pdus_enc := us.tbf.llc_pdus_enc & { cur_enc };
114 us.llc_pdu_totlen := us.llc_pdu_totlen + lengthof(cur_enc);
115 }
116 us.total_bytes_remain := us.llc_pdu_totlen;
117 }
118}
119
120private function f_UlTbf_ack_one_block(inout UlTbfState us, integer n) {
121 /* compute index into v_b */
122 var integer idx := n - us.et.v_a;
123 if (idx < 0 or idx > lengthof(us.et.v_b)) {
124 setverdict(fail, "UlTbf: Cannot ACK ", n, " while V(A) is ", us.et.v_a);
Daniel Willmannafce8662018-07-06 23:11:32 +0200125 mtc.stop;
Harald Welte060e27a2018-03-03 20:38:19 +0100126 }
127 /* set the bit in the acknowledge state array */
128 us.et.v_b[idx] := '1'B;
129}
130
131/* check if V(B) contains '1' at lower end: if yes, advance V(A) and shift V(B) */
132private function f_UlTbf_check_advance_v_a(inout UlTbfState us) {
133 log("FIXME: Implement this");
134}
135
136/* copy 'len' number of bytes from current pending LLC PDU */
137private function f_copy_from_llc(inout UlTbfState us, integer len) return octetstring
138{
139 var integer pdu_len := lengthof(us.tbf.llc_pdus_enc[us.cur_pdu])
140 var octetstring ret;
141
142 ret := substr(us.tbf.llc_pdus_enc[us.cur_pdu], us.cur_index, len);
143
144 us.cur_index := us.cur_index + len;
145 us.total_bytes_remain := us.total_bytes_remain - len;
146
Harald Welte060e27a2018-03-03 20:38:19 +0100147 /* if we completed this PDU, move on to the next, resetting the index */
148 if (us.cur_index >= pdu_len) {
149 us.cur_pdu := us.cur_pdu +1;
150 us.cur_index := 0;
151 log("copy_from_llc (incrementing pdu)");
152 }
153
154 return ret;
155}
156
157/* generate one LlcBlock (maximum size 'max_len') */
158private function f_ul_tbf_pull_one(out LlcBlock ret, inout LlcBlockHdr prev_hdr,
159 inout UlTbfState us, integer max_len,
160 boolean is_final) return boolean
161{
162 /* if we've already pulled all data from all LLC PDUs: nothing to do */
163 if (us.cur_pdu >= sizeof(us.tbf.llc_pdus_enc)) {
164 log("pull_one: No more data", us);
165 return false;
166 }
167
168 var integer pdu_len := lengthof(us.tbf.llc_pdus_enc[us.cur_pdu])
169 var integer cur_llc_remain_len := pdu_len - us.cur_index;
170 var integer len;
171 var LlcBlock lb;
172
173 if (us.cur_index == 0) {
174 /* start of a new LLC PDU */
175 prev_hdr.more := true;
176 }
177
178 if (cur_llc_remain_len > max_len) {
179 log("Chunk with length ", cur_llc_remain_len, " larger than space (",
180 max_len, ") left in block");
181 len := max_len;
182 lb := {
183 hdr := omit,
184 payload := f_copy_from_llc(us, len)
185 }
186 } else if (cur_llc_remain_len == max_len and is_final) {
187 /* final RLC block of TBF and LLC remainder fits exactly */
188 len := max_len;
189 lb := {
190 hdr := omit,
191 payload := f_copy_from_llc(us, len)
192 }
193 prev_hdr.e := true;
194 } else if (cur_llc_remain_len == max_len) {
195 /* LLC remaineder would fit exactly -> "singular case" with L=0 */
196 len := max_len - 1;
197 lb := {
198 hdr := {
199 length_ind := 0,
200 more := false,
201 e := true
202 },
203 payload := f_copy_from_llc(us, len)
204 }
205 prev_hdr.e := false;
206 } else {
207 /* normal case: cur_llc_remain_len < max_len */
208 len := cur_llc_remain_len;
209 lb := {
210 hdr := {
211 length_ind := len,
212 more := false,
213 e := true
214 },
215 payload := f_copy_from_llc(us, len)
216 }
217 prev_hdr.e := false;
218 }
219 ret := lb;
220 return true;
221}
222
223/* return encoded size of one given LlcBlock */
224private function f_LlcBlock_enc_len(LlcBlock blk) return integer {
225 if (isvalue(blk.hdr)) {
226 return 1 + lengthof(blk.payload);
227 } else {
228 return lengthof(blk.payload);
229 }
230}
231
232/* return encoded size of given record of LlcBlock */
233private function f_LlcBlocks_enc_len(LlcBlocks blks) return integer {
234 var integer sum := 0;
235 for (var integer i := 0; i < sizeof(blks); i := i+1) {
236 sum := sum + f_LlcBlock_enc_len(blks[i]);
237 }
238 return sum;
239}
240
241private function f_ul_tbf_pull_multi(out LlcBlocks ret, inout UlTbfState us, integer max_len,
242 boolean is_final) return boolean
243{
244 var integer space_left;
245 var boolean rc;
246 ret := {};
247
248 /* loop as long as we have pending LLC data and space left in the current block... */
249 for (space_left := max_len; space_left > 0; space_left := max_len - f_LlcBlocks_enc_len(ret)) {
250 var LlcBlock lb;
251 var integer ret_size := sizeof(ret);
252 if (ret_size > 0) {
253 rc := f_ul_tbf_pull_one(lb, ret[ret_size-1].hdr, us, space_left, is_final);
254 } else {
255 var LlcBlockHdr dummy_hdr;
256 rc := f_ul_tbf_pull_one(lb, dummy_hdr, us, space_left, is_final);
257 }
258 if (rc == false) {
259 /* we couldn't fill the full RLC block, insufficient LLC Data */
260 if (sizeof(ret) == 0) {
261 /* we couldn't obtain any LlcBlocks at all */
262 return false;
263 } else {
264 /* we have some LlcBlocks from earlier iterations */
265 return true;
266 }
267 }
268 ret := ret & {lb};
269 }
270 return true;
271}
272
273/* Determine 'K' value for given CS (TS 44.060 9.3.1.1) */
274private function f_k_for_cs(GprsCodingScheme cs) return integer {
275 /* FIXME: EGPRS */
276 return 1;
277}
278
279/* TS 44.060 9.3.1.1 */
280private function f_calc_cv(integer nbc, integer bsn_p, integer nts, GprsCodingScheme cs,
281 integer bs_cv_max) return integer {
282 var integer dividend := nbc - bsn_p - 1;
283 var integer k := f_k_for_cs(cs);
284 var integer divisor := nts * k;
285 var integer x := f_div_round_up(dividend, divisor);
286 if (x <= bs_cv_max) {
287 return x;
288 } else {
289 return 15;
290 }
291}
292
293private function f_rlcmac_hdr_size(boolean tlli_needed) return integer {
294 var integer ret := 2;
295 if (tlli_needed) {
296 ret := ret + 4;
297 }
298 return ret;
299}
300
301/* determine countdown value based on remaining length pending */
302private function f_ul_tbf_get_cv(inout UlTbfState us, GprsCodingScheme cs, boolean tlli_needed)
303return integer {
304 var integer hdr_size := f_rlcmac_hdr_size(tlli_needed); /* FIXME: PFI, ... */
305 var integer blk_len_net := f_gprs_blocksize(cs) - hdr_size;
306 var integer num_remain := f_div_round_up(us.total_bytes_remain, blk_len_net);
307 var integer cv := f_calc_cv(num_remain + sizeof(us.rlc_sent), us.bsn_p, us.num_ts, us.tbf.initial_cs, 14 /* FIXME */);
Harald Welte060e27a2018-03-03 20:38:19 +0100308 return cv;
309}
310
311
312function f_ul_tbf_get_next_block(out RlcmacUlBlock blk, inout UlTbfState us, inout MmContext mmctx,
313 boolean tlli_needed := false) return boolean {
314 var integer hdr_size := f_rlcmac_hdr_size(tlli_needed); /* FIXME: TLLI, PFI, ... */
315 var integer len_remain := f_gprs_blocksize(us.tbf.initial_cs) - hdr_size;
316 var octetstring payload;
317 var integer cv;
318 var LlcBlocks llc_blocks;
319
320 cv := f_ul_tbf_get_cv(us, us.tbf.initial_cs, tlli_needed);
321 /* potentially get multiple payload chunks of multiple LLC PDUs */
322 if (f_ul_tbf_pull_multi(llc_blocks, us, len_remain, false) == false) {
323 return false;
324 }
325
326 /* include TLLI when needed */
327 if (tlli_needed) {
328 blk := valueof(t_RLCMAC_UL_DATA_TLLI(us.tfi, cv, us.et.v_s,
329 llc_blocks, false, mmctx.tlli));
330 } else {
331 blk := valueof(t_RLCMAC_UL_DATA(us.tfi, cv, us.et.v_s, llc_blocks, false));
332 }
333
334 /* Increment Block Sequence Number */
335 us.bsn_p := us.bsn_p + 1;
336 us.et.v_s := us.bsn_p mod 128; /* FIXME: EGPRS SNS: 2048 */
337
338 /* append to list of sent blocks */
339 us.rlc_sent := us.rlc_sent & { blk };
340
341 return true;
342}
343
344function f_ul_tbf_process_acknack(inout UlTbfState us, RlcmacDlCtrlBlock db) {
345 if (ispresent(db.payload.u.ul_ack_nack.gprs)) {
346 var UlAckNackGprs uan_gprs := db.payload.u.ul_ack_nack.gprs;
347 if (ispresent(uan_gprs.cont_res_tlli)) {
348 /* FIXME: check for contention resolution */
349 }
350 var integer i;
351 /* iterate over received bitmap, ACK each block in our TBF state */
352 for (i := lengthof(uan_gprs.ack_nack_desc.receive_block_bitmap)-1; i >= 0; i := i-1) {
353 if (uan_gprs.ack_nack_desc.receive_block_bitmap[i] == '1'B) {
354 var integer seq := uan_gprs.ack_nack_desc.starting_seq_nr + i;
355 f_UlTbf_ack_one_block(us, seq);
356 }
357 }
358 f_UlTbf_check_advance_v_a(us);
359 }
360}
361
Harald Weltecc5c1152018-03-09 12:54:01 +0100362/***********************************************************************
363 * Downlink TBF handling
364 ***********************************************************************/
365
366type record RlcEndpointRx {
367 /* receive state variable V(R) (9.1.5): BSN one higher than highest BSN yet received (mod SNS) */
368 integer v_r,
369 /* receive window state variable V(Q) (9.1.6): Lowest BSN not yet received (mod SNS) */
370 integer v_q,
371 /* receive state array V(N) (9.1.7) */
372 bitstring v_n
373}
374
375private function f_RlcEndpointRx_init(inout RlcEndpointRx ep) {
376 ep.v_r := 0;
377 ep.v_q := 0;
378 ep.v_n := int2bit(0, 128); /* FIXME: EGPRS 2048 bits length */
379}
380
381type record DlTbfPars {
382 /* Acknowledged mode (true) or unacknowledged (false) */
383 boolean ack_mode,
384 /* Coding Scheme for transmission, determines block size */
385 GprsCodingScheme initial_cs,
386 /* Sequence Number Space */
387 integer sns,
388 /* Window Size */
389 integer ws
390}
391
392type record DlTbfState {
393 /* "const" input state with TBF Data */
394 DlTbfPars tbf,
395 uint8_t num_ts,
396
397 RlcEndpointRx er,
398
399 integer tfi,
400
401 /* list of abstract/decoded RLC PDUs */
402 record of RlcmacDlBlock rlc_received
403}
404
405function f_dl_tbf_mod_sns(DlTbfState ds, integer val) return integer
406{
407 return (val mod ds.tbf.sns);
408}
409
410function f_dl_tbf_is_in_window(integer bsn) return boolean {
411 setverdict(fail, "pleaes implement me");
Daniel Willmannafce8662018-07-06 23:11:32 +0200412 mtc.stop;
Harald Weltecc5c1152018-03-09 12:54:01 +0100413}
414
415function f_dl_tbf_is_received(inout DlTbfState ds, integer bsn) return boolean {
416 var integer offset_v_r;
417
418 if (not f_dl_tbf_is_in_window(bsn)) {
419 return false;
420 }
421
422 /* offset to the end of the received window */
423 offset_v_r := f_dl_tbf_mod_sns(ds, ds.er.v_r - 1 - bsn);
424 if (not (offset_v_r < ds.tbf.ws)) {
425 return false;
426 }
427
428 if (ds.er.v_n[bsn mod sns_half] == '1'B) {
429 return true;
430 }
431
432 return false;
433}
434
435function f_dl_tbf_mark_received(inout DlTbfState ds, integer bsn) {
436 ds.er.v_n[bsn mod sns_half] := '1'B;
437 f_dl_tbf_raise_v_r(ds, bsn);
438}
439
440/* Raise V(Q) if possible */
441function f_dl_tbf_raise_v_q(inout DlTbfState ds, integer bsn) return integer {
442 var integer count := 0;
443 while (ds.er.v_q != ds.er.v_r) {
444 var integer v_q_old := ds.er.v_q;
445 if (not f_dl_tbf_is_received(ds, v_q_old)) {
446 break;
447 }
448 ds.er.v_q := f_dl_tbf_mod_sns(ds, ds.er.v_q + 1)
449 log("RLCMAC: Taking block ", v_q_old, " out, raising V(Q) to ", ds.er.v_q);
450 count := count+1;
451 }
452 return count;
453}
454
455function f_dl_tbf_raise_v_r(inout DlTbfState ds, integer bsn) {
456 var integer offset_v_r := f_dl_tbf_mod_sns(ds, bsn + 1 - ds.er.v_r);
457 if (offset_v_r < (ds.tbf.sns / 2)) {
458 for (var integer i := offset_v_r; i > 0; i := i-1) {
459 /* mark as missing */
460 ds.er.v_n[bsn mod sns_half] := '0'B;
461 //raise_v_r_to(1);
462 }
463 log("RLCMAC: Raising V(R) to ", ds.er.v_r);
464 }
465}
466
467/* process the actual data and update TbfState */
468function f_dl_tbf_process_dl_data(inout DlTbfState ds, RlcmacDlDataBlock db) {
469 var integer bsn := db.mac_hdr.hdr_ext.bsn;
470 if (db.mac_hdr.hdr_ext.tfi != ds.tfi) {
471 setverdict(fail, "Unexpected TFI of DL Data Block ", db);
Daniel Willmannafce8662018-07-06 23:11:32 +0200472 mtc.stop;
Harald Weltecc5c1152018-03-09 12:54:01 +0100473 }
474 f_dl_tbf_mark_received(ds, bsn);
475 if (ds.tbf.ack_mode) {
476 /* In RLC acknowledged mode, the receive window is defined by the receive window
477 * state variable V(Q) in the following inequality[ V(Q) ≤ BSN < V(Q)+ WS ] modulo
478 * SNS */
479 if (bsn < ds.er.v_q or bsn > ds.er.v_q + ds.tbf.ws) {
480 setverdict(fail, "Unexpected BSN outside of window ", bsn);
Daniel Willmannafce8662018-07-06 23:11:32 +0200481 mtc.stop;
Harald Weltecc5c1152018-03-09 12:54:01 +0100482 }
483
484 /* In RLC acknowledged mode, the value of V(Q) shall be updated when the RLC
485 * receiver receives the RLC data block whose BSN is equal to V(Q). The value of
486 * V(Q) shall then be set to the BSN value of the next RLC data block in the receive
487 * window (modulo SNS) that has not yet been received, or it shall be set to V(R) if
488 * all RLC data blocks in the receive window have been received */
489 f_dl_tbf_mark_received(ds, bsn);
490 } else {
491 /* In RLC unacknowledged mode, if [V(R) - V(Q)] modulo SNS > WS after updating V(R),
492 * then V(Q) is set to [V(R) - WS] modulo SNS. */
493 /* FIXME */
494 }
495
496}
497
Harald Welte060e27a2018-03-03 20:38:19 +0100498
499
500}