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
|
/*
* Copyright 1992 by Jutta Degener and Carsten Bormann, Technische
* Universitaet Berlin. See the accompanying file "COPYRIGHT" for
* details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE.
*/
/*$Header: /tmp_amd/presto/export/kbs/jutta/src/gsm/RCS/bitter.c,v 1.1 1992/10/28 00:28:39 jutta Exp $*/
/* Generate code to pack a bit array from a name:#bits description */
#include <stdio.h>
#include "taste.h"
#include "proto.h"
void write_code P2((s_spex, n_spex), struct spex * s_spex, int n_spex)
{
struct spex * sp = s_spex;
int bits = 8;
int vars;
if (!n_spex) return;
vars = sp->varsize;
while (n_spex) {
if (bits == 8) printf("\t*c++ = ");
else printf("\t | ");
if (vars == bits) {
printf( (bits==8? "%s & 0x%lX;\n" : "(%s & 0x%lX);\n"),
sp->var,
~(0xfffffffe << (bits - 1)));
if (!-- n_spex) break;
sp++;
vars = sp->varsize;
bits = 8;
} else if (vars < bits) {
printf( "((%s & 0x%lX) << %d)",
sp->var,
~(0xfffffffe << (vars - 1)),
bits - vars);
bits -= vars;
if (!--n_spex) {
puts(";");
break;
}
else putchar('\n');
sp++;
vars = sp->varsize;
} else {
printf("((%s >> %d) & 0x%X);\n",
sp->var,
vars - bits,
~(0xfffffffe << (bits - 1)));
vars -= bits;
bits = 8;
}
}
}
|
