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