1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/* TRX implementation of Free Software for Calypso Phone */
/*
* Copyright (C) 2013 Sylvain Munaut <tnt@246tNt.com>
*
* All Rights Reserved
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <inttypes.h>
#include <stdint.h>
#include <string.h>
#include <stdio.h>
#include <defines.h>
#include <asm/system.h>
#include <layer1/trx.h>
#include "burst_queue.h"
/* Burst queue */
BURST_QUEUE_STATIC(g_bq, 8, 512, static)
/* Filler table */
static struct burst_data fill_tn0[51];
/* TRX Helpers **************************************************************/
static void
trx_init_filler(void)
{
int i;
for (i=0; i<51; i++) {
if ((i % 51) == 50)
fill_tn0[i].type = BURST_DUMMY;
else if (((i % 51) % 10) == 0)
fill_tn0[i].type = BURST_FB;
else if (((i % 51) % 10) == 1)
fill_tn0[i].type = BURST_SB;
else
fill_tn0[i].type = BURST_DUMMY;
}
}
static void
trx_discarded_burst(struct burst_data *burst,
int head, uint32_t fn, __unused void *data)
{
/* Only TN=0 */
if (head)
return;
/* Debug */
printf("STALE BURST %" PRIu32 "\n", fn);
/* Still copy to the filler table */
memcpy(&fill_tn0[fn % 51], burst, sizeof(struct burst_data));
}
/* TRX Interface ************************************************************/
void
trx_init(void)
{
/* Init burst queue */
bq_reset(&g_bq);
bq_set_discard_fn(&g_bq, trx_discarded_burst, NULL);
/* Init filler table */
trx_init_filler();
}
int
trx_put_burst(uint32_t fn, uint8_t tn, uint8_t type, uint8_t *data)
{
struct burst_data *burst;
unsigned long flags;
local_firq_save(flags);
burst = bq_push(&g_bq, tn, fn);
if (!burst)
goto exit;
burst->type = type;
if (burst->type == BURST_NB)
memcpy(burst->data, data, 15);
exit:
local_irq_restore(flags);
return 0;
}
int
trx_get_burst(uint32_t fn, uint8_t tn, uint8_t *data)
{
struct burst_data *burst;
int rc;
/* Check for new burst */
burst = bq_pop_head(&g_bq, tn, fn);
if (burst) {
/* New burst: Copy to fill table & use it */
memcpy(&fill_tn0[fn % 51], burst, sizeof(struct burst_data));
// printf("O %d %d %p\n", fn, g_bq.used, burst);
} else {
/* No data, just use the one from fill table */
burst = &fill_tn0[fn % 51];
}
rc = burst->type;
if (burst->type == BURST_NB)
memcpy(data, burst->data, 15);
return rc;
}
|
