blob: a35c780199f0f2308904af0c909717a7eb3a31ec [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.
10 */
11
12
13import from GSM_Types all;
14import from Osmocom_Types all;
15import from General_Types all;
16import from RLCMAC_Types all;
17import from RLCMAC_CSN1_Types all;
18import from LLC_Types all;
19import from GPRS_Context all;
20
21/* input parameters into TBF (mostly mode/cs + LLC PDUs */
22
23type record UlTbfPars {
24 /* Acknowledged mode (true) or unacknowledged (false) */
25 boolean ack_mode,
26 /* Coding Scheme for transmission, determines block size */
27 GprsCodingScheme initial_cs,
28 /* list of abstract/decoded LLC PDUs */
29 record of PDU_LLC llc_pdus optional,
30 /* possibly computed: list of encoded LLC PDUs */
31 record of octetstring llc_pdus_enc
32}
33
34type record RlcEndpointTx {
35 /* send state variable V(S) (9.1.1): 0 .. SNS-1 */
36 integer v_s,
37 /* acknowledge state variable V(A) (9.1.2): BSN value of oldest RLC data block that has not
38 * been positively acknowledged by peer. */
39 integer v_a,
40 /* acknowledge state array V(B) (9.1.3) */
41 bitstring v_b
42}
43private function f_RlcEndpointTx_init(inout RlcEndpointTx ep) {
44 ep.v_s := 0;
45 ep.v_a := 0;
46 ep.v_b := int2bit(0, 128); /* FIXME: EGPRS 2048 bits length */
47}
48
49type record RlcEndpointRx {
50 /* receive state variable V(R) (9.1.5): BSN one higher than highest BSN yet received (mod SNS) */
51 integer v_r,
52 /* receive window state variable V(Q) (9.1.6): Lowest BSN not yet received (mod SNS) */
53 integer v_q,
54 /* receive state array V(N) (9.1.7) */
55 bitstring v_n
56}
57
58private function f_RlcEndpointRx_init(inout RlcEndpointRx ep) {
59 ep.v_r := 0;
60 ep.v_q := 0;
61 ep.v_n := int2bit(0, 128); /* FIXME: EGPRS 2048 bits length */
62}
63
64
65type record UlTbfState {
66 /* "const" input state with TBF Data */
67 UlTbfPars tbf,
68 uint8_t num_ts,
69
70 RlcEndpointTx et,
71
72 integer tfi,
73 /* total length of all encoded LLC PDUs */
74 integer llc_pdu_totlen,
75 /* index of current/next PDU in llc_pdus_enc */
76 integer cur_pdu,
77 /* byte offset into current/next PDU; next byte to transmit */
78 integer cur_index,
79 /* block sequence number of next block within TBF */
80 integer bsn_p,
81 /* total number of bytes remaining in TBF */
82 integer total_bytes_remain,
83
84 /* list of already-sent RLC/MAC Blocks */
85 record of RlcmacUlBlock rlc_sent
86}
87
88function f_UlTbfState_init(inout UlTbfState us, in UlTbfPars utpars) {
89 var RlcmacUlBlock blk;
90
91 us.tbf := utpars;
92 us.num_ts := 1;
93
94 f_RlcEndpointTx_init(us.et);
95
96 us.tfi := 0; /* FIXME */
97 us.cur_pdu := 0;
98 us.cur_index := 0;
99 us.bsn_p := 0;
100 us.total_bytes_remain := 0;
101 us.rlc_sent := {};
102
103 /* encode all LLC PDUs from their abstract type to octetstring */
104 us.cur_pdu := 0; /* currently processed PDU */
105 us.cur_index := 0; /* next to-be transmitted index */
106 if (ispresent(us.tbf.llc_pdus)) {
107 us.tbf.llc_pdus_enc := {};
108 us.llc_pdu_totlen := 0;
109 for (var integer i := 0; i < sizeof(us.tbf.llc_pdus); i := i+1) {
110 var octetstring cur_enc := enc_PDU_LLC(us.tbf.llc_pdus[i]);
111 us.tbf.llc_pdus_enc := us.tbf.llc_pdus_enc & { cur_enc };
112 us.llc_pdu_totlen := us.llc_pdu_totlen + lengthof(cur_enc);
113 }
114 us.total_bytes_remain := us.llc_pdu_totlen;
115 }
116}
117
118private function f_UlTbf_ack_one_block(inout UlTbfState us, integer n) {
119 /* compute index into v_b */
120 var integer idx := n - us.et.v_a;
121 if (idx < 0 or idx > lengthof(us.et.v_b)) {
122 setverdict(fail, "UlTbf: Cannot ACK ", n, " while V(A) is ", us.et.v_a);
123 self.stop;
124 }
125 /* set the bit in the acknowledge state array */
126 us.et.v_b[idx] := '1'B;
127}
128
129/* check if V(B) contains '1' at lower end: if yes, advance V(A) and shift V(B) */
130private function f_UlTbf_check_advance_v_a(inout UlTbfState us) {
131 log("FIXME: Implement this");
132}
133
134/* copy 'len' number of bytes from current pending LLC PDU */
135private function f_copy_from_llc(inout UlTbfState us, integer len) return octetstring
136{
137 var integer pdu_len := lengthof(us.tbf.llc_pdus_enc[us.cur_pdu])
138 var octetstring ret;
139
140 ret := substr(us.tbf.llc_pdus_enc[us.cur_pdu], us.cur_index, len);
141
142 us.cur_index := us.cur_index + len;
143 us.total_bytes_remain := us.total_bytes_remain - len;
144
145 log("copy_from_llc: ", ret, " us: ", us);
146
147 /* 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 */);
308 log("CV=", cv, ", num_rmain=", num_remain, " from ", us);
309 return cv;
310}
311
312
313function f_ul_tbf_get_next_block(out RlcmacUlBlock blk, inout UlTbfState us, inout MmContext mmctx,
314 boolean tlli_needed := false) return boolean {
315 var integer hdr_size := f_rlcmac_hdr_size(tlli_needed); /* FIXME: TLLI, PFI, ... */
316 var integer len_remain := f_gprs_blocksize(us.tbf.initial_cs) - hdr_size;
317 var octetstring payload;
318 var integer cv;
319 var LlcBlocks llc_blocks;
320
321 cv := f_ul_tbf_get_cv(us, us.tbf.initial_cs, tlli_needed);
322 /* potentially get multiple payload chunks of multiple LLC PDUs */
323 if (f_ul_tbf_pull_multi(llc_blocks, us, len_remain, false) == false) {
324 return false;
325 }
326
327 /* include TLLI when needed */
328 if (tlli_needed) {
329 blk := valueof(t_RLCMAC_UL_DATA_TLLI(us.tfi, cv, us.et.v_s,
330 llc_blocks, false, mmctx.tlli));
331 } else {
332 blk := valueof(t_RLCMAC_UL_DATA(us.tfi, cv, us.et.v_s, llc_blocks, false));
333 }
334
335 /* Increment Block Sequence Number */
336 us.bsn_p := us.bsn_p + 1;
337 us.et.v_s := us.bsn_p mod 128; /* FIXME: EGPRS SNS: 2048 */
338
339 /* append to list of sent blocks */
340 us.rlc_sent := us.rlc_sent & { blk };
341
342 return true;
343}
344
345function f_ul_tbf_process_acknack(inout UlTbfState us, RlcmacDlCtrlBlock db) {
346 if (ispresent(db.payload.u.ul_ack_nack.gprs)) {
347 var UlAckNackGprs uan_gprs := db.payload.u.ul_ack_nack.gprs;
348 if (ispresent(uan_gprs.cont_res_tlli)) {
349 /* FIXME: check for contention resolution */
350 }
351 var integer i;
352 /* iterate over received bitmap, ACK each block in our TBF state */
353 for (i := lengthof(uan_gprs.ack_nack_desc.receive_block_bitmap)-1; i >= 0; i := i-1) {
354 if (uan_gprs.ack_nack_desc.receive_block_bitmap[i] == '1'B) {
355 var integer seq := uan_gprs.ack_nack_desc.starting_seq_nr + i;
356 f_UlTbf_ack_one_block(us, seq);
357 }
358 }
359 f_UlTbf_check_advance_v_a(us);
360 }
361}
362
363
364
365}