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
|
/*
* *********************************************************************
* * Copyright (C) 1988, 1990 Stanford University. *
* * Permission to use, copy, modify, and distribute this *
* * software and its documentation for any purpose and without *
* * fee is hereby granted, provided that the above copyright *
* * notice appear in all copies. Stanford University *
* * makes no representations about the suitability of this *
* * software for any purpose. It is provided "as is" without *
* * express or implied warranty. Export of this software outside *
* * of the United States of America may require an export license. *
* *********************************************************************
*/
#include <stdio.h>
#include "ana.h"
private char result[ 200 ];
private char HexMap[] = "0123456789abcdefX";
/*
* Convert a trace entry (vector) to an ascii string
*/
public char *HistToStr( hist, nbits, b_digit, offset )
hptr *hist;
int nbits, b_digit, offset;
{
register char *p;
register int i, j;
Ulong digit;
/* Handle decimal notation (special cases) */
/* Since decimal does not map directly to bits, */
/* we only print the result if no bits are unknown. */
if (b_digit == 5) {
hptr *htmp = hist;
for (i = nbits; i > 0; i--) {
if ((*htmp)->val == X) {
sprintf(result, "???");
return (result);
}
htmp += offset;
}
digit = (Ulong)0;
for (i = nbits; i > 0; i--) {
digit <<= 1;
if ((*hist)->val == HIGH) digit |= 1;
hist += offset;
}
if (digit < 0)
sprintf(result, "(overflow)");
else
sprintf(result, PRINTF_LLONG "u", digit);
return (result);
}
/* Handle signed decimal notation */
else if (b_digit == 6) {
hptr *htmp = hist;
char negative;
negative = ((*htmp)->val == HIGH) ? 1 : 0;
for (i = nbits; i > 0; i--) {
if ((*htmp)->val == X) {
sprintf(result, "???");
return (result);
}
htmp += offset;
}
digit = (Ulong)0;
for (i = nbits; i > 0; i--) {
digit <<= 1;
if (((negative == 1) && ((*hist)->val == LOW)) ||
((negative == 0) && ((*hist)->val == HIGH)))
digit |= 1;
hist += offset;
}
if (negative) digit = -(digit + 1);
sprintf(result, PRINTF_LLONG "d", digit);
return (result);
}
p = result;
j = nbits % b_digit;
if( j == 0 )
j = b_digit;
for( i = nbits; i > 0; i -= j )
{
digit = 0;
do
{
switch( (*hist)->val )
{
case LOW :
digit = (digit << 1);
break;
case HIGH :
digit = (digit << 1) | 1;
break;
case X :
digit = 16;
while( j != 1 )
{
j--;
hist += offset;
}
break;
}
j--;
hist += offset;
}
while( j > 0 );
*p++ = HexMap[ digit ];
j = b_digit;
}
*p = '\0';
return( result );
}
|
