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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
|
/**
* This file is part of samsung-ril.
*
* Copyright (C) 2010-2011 Joerie de Gram <j.de.gram@gmail.com>
* Copyright (C) 2011-2012 Paul Kocialkowski <contact@paulk.fr>
*
* samsung-ril is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* samsung-ril 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with samsung-ril. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#define LOG_TAG "RIL-UTIL"
#include <utils/Log.h>
#include "util.h"
#include "samsung-ril.h"
/**
* List
*/
struct list_head *list_head_alloc(void *data, struct list_head *prev, struct list_head *next)
{
struct list_head *list;
list = calloc(1, sizeof(struct list_head));
if (list == NULL)
return NULL;
list->data = data;
list->prev = prev;
list->next = next;
if (prev != NULL)
prev->next = list;
if (next != NULL)
next->prev = list;
return list;
}
void list_head_free(struct list_head *list)
{
if (list == NULL)
return;
if (list->next != NULL)
list->next->prev = list->prev;
if (list->prev != NULL)
list->prev->next = list->next;
memset(list, 0, sizeof(struct list_head));
free(list);
}
/**
* Converts a hexidecimal string to binary
*/
void hex2bin(const char *data, int length, unsigned char *buf)
{
int i = 0;
char b = 0;
unsigned char *p = buf;
length ^= 0x01;
while (i < length) {
b = 0;
if (data[i] - '0' < 10)
b = data[i] - '0';
else if (data[i] - 'a' < 7)
b = data[i] - 'a' + 10;
else if (data[i] - 'A' < 7)
b = data[i] - 'A' + 10;
i++;
b = (b << 4);
if (data[i] - '0' < 10)
b |= data[i] - '0';
else if (data[i] - 'a' < 7)
b |= data[i] - 'a' + 10;
else if (data[i] - 'A' < 7)
b |= data[i] - 'A' + 10;
i++;
*p++ = b;
}
}
/**
* Converts binary data to a hexidecimal string
*/
void bin2hex(const unsigned char *data, int length, char *buf)
{
int i;
char b;
char *p = buf;
for (i = 0; i < length; i++) {
b = 0;
b = (data[i] >> 4 & 0x0f);
b += (b < 10) ? '0' : ('a' - 10);
*p++ = b;
b = (data[i] & 0x0f);
b += (b < 10) ? '0' : ('a' - 10);
*p++ = b;
}
*p = '\0';
}
/**
* Converts GSM7 (8 bits) data to ASCII (7 bits)
*/
int gsm72ascii(unsigned char *data, char **data_dec, int length)
{
int t, u, d, o = 0;
int i;
int dec_length;
char *dec;
dec_length = ((length * 8) - ((length * 8) % 7) ) / 7;
dec = malloc(dec_length);
memset(dec, 0, dec_length);
for (i=0 ; i < length ; i++)
{
d = 7 - i % 7;
if (d == 7 && i != 0)
o++;
t = (data[i] - (((data[i] >> d) & 0xff) << d));
u = (data[i] >> d) & 0xff;
dec[i+o]+=t << (i + o) % 8;
if (u)
dec[i+1+o]+=u;
}
*data_dec = dec;
return dec_length;
}
/**
* Converts ASCII (7 bits) data to GSM7 (8 bits)
*/
int ascii2gsm7(char *data, unsigned char **data_enc, int length)
{
int d_off, d_pos, a_off, a_pos = 0;
int i;
int enc_length;
unsigned char *enc;
enc_length = ((length * 7) - (length * 7) % 8) / 8;
enc_length += (length * 7) % 8 > 0 ? 1 : 0;
//FIXME: why does samsung does that?
enc_length++;
enc = malloc(enc_length);
memset(enc, 0, enc_length);
for (i=0 ; i < length ; i++)
{
// offset from the right of data to keep
d_off = i % 8;
// position of the data we keep
d_pos = ((i * 7) - (i * 7) % 8) / 8;
d_pos += (i * 7) % 8 > 0 ? 1 : 0;
// adding the data with correct offset
enc[d_pos] |= data[i] >> d_off;
// numbers of bits to omit to get data to add another place
a_off = 8 - d_off;
// position (on the encoded feed) of the data to add
a_pos = d_pos - 1;
// adding the data to add at the correct position
enc[a_pos] |= data[i] << a_off;
}
*data_enc = enc;
//FIXME: what is going on here?
enc[enc_length - 2] |= 0x30;
enc[enc_length - 1] = 0x02;
return enc_length;
}
void hex_dump(void *data, int size)
{
/* dumps size bytes of *data to stdout. Looks like:
* [0000] 75 6E 6B 6E 6F 77 6E 20
* 30 FF 00 00 00 00 39 00 unknown 0.....9.
* (in a single line of course)
*/
unsigned char *p = data;
unsigned char c;
int n;
char bytestr[4] = {0};
char addrstr[10] = {0};
char hexstr[ 16*3 + 5] = {0};
char charstr[16*1 + 5] = {0};
for (n=1;n<=size;n++) {
if (n%16 == 1) {
/* store address for this line */
snprintf(addrstr, sizeof(addrstr), "%.4x",
((unsigned int)p-(unsigned int)data) );
}
c = *p;
if (isalnum(c) == 0) {
c = '.';
}
/* store hex str (for left side) */
snprintf(bytestr, sizeof(bytestr), "%02X ", *p);
strncat(hexstr, bytestr, sizeof(hexstr)-strlen(hexstr)-1);
/* store char str (for right side) */
snprintf(bytestr, sizeof(bytestr), "%c", c);
strncat(charstr, bytestr, sizeof(charstr)-strlen(charstr)-1);
if (n%16 == 0) {
/* line completed */
LOGD("[%4.4s] %-50.50s %s", addrstr, hexstr, charstr);
hexstr[0] = 0;
charstr[0] = 0;
} else if (n%8 == 0) {
/* half line: add whitespaces */
strncat(hexstr, " ", sizeof(hexstr)-strlen(hexstr)-1);
strncat(charstr, " ", sizeof(charstr)-strlen(charstr)-1);
}
p++; /* next byte */
}
if (strlen(hexstr) > 0) {
/* print rest of buffer if not empty */
LOGD("[%4.4s] %-50.50s %s\n", addrstr, hexstr, charstr);
}
}
/* writes the utf8 character encoded in v
* to the buffer utf8 at the specified offset
*/
int utf8_write(char *utf8, int offset, int v)
{
int result;
if (v < 0x80) {
result = 1;
if (utf8)
utf8[offset] = (char)v;
} else if (v < 0x800) {
result = 2;
if (utf8) {
utf8[offset + 0] = (char)(0xc0 | (v >> 6));
utf8[offset + 1] = (char)(0x80 | (v & 0x3f));
}
} else if (v < 0x10000) {
result = 3;
if (utf8) {
utf8[offset + 0] = (char)(0xe0 | (v >> 12));
utf8[offset + 1] = (char)(0x80 | ((v >> 6) & 0x3f));
utf8[offset + 2] = (char)(0x80 | (v & 0x3f));
}
} else {
result = 4;
if (utf8) {
utf8[offset + 0] = (char)(0xf0 | ((v >> 18) & 0x7));
utf8[offset + 1] = (char)(0x80 | ((v >> 12) & 0x3f));
utf8[offset + 2] = (char)(0x80 | ((v >> 6) & 0x3f));
utf8[offset + 3] = (char)(0x80 | (v & 0x3f));
}
}
return result;
}
SmsCodingScheme sms_get_coding_scheme(int dataCoding)
{
switch (dataCoding >> 4) {
case 0x00:
case 0x02:
case 0x03:
return SMS_CODING_SCHEME_GSM7;
case 0x01:
if (dataCoding == 0x10)
return SMS_CODING_SCHEME_GSM7;
if (dataCoding == 0x11)
return SMS_CODING_SCHEME_UCS2;
break;
case 0x04:
case 0x05:
case 0x06:
case 0x07:
if (dataCoding & 0x20)
return SMS_CODING_SCHEME_UNKNOWN;
if (((dataCoding >> 2) & 3) == 0)
return SMS_CODING_SCHEME_GSM7;
if (((dataCoding >> 2) & 3) == 2)
return SMS_CODING_SCHEME_UCS2;
break;
case 0xF:
if (!(dataCoding & 4))
return SMS_CODING_SCHEME_GSM7;
break;
}
return SMS_CODING_SCHEME_UNKNOWN;
}
|