-
Notifications
You must be signed in to change notification settings - Fork 1
/
dtime.c
238 lines (202 loc) · 4.59 KB
/
dtime.c
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
/*
This software is being provided to you, the LICENSEE, by the
Massachusetts Institute of Technology (M.I.T.) under the following
license. By obtaining, using and/or copying this software, you agree
that you have read, understood, and will comply with these terms and
conditions:
Permission to use, copy, modify and distribute, including the right to
grant others the right to distribute at any tier, this software and
its documentation for any purpose and without fee or royalty is hereby
granted, provided that you agree to comply with the following
copyright notice and statements, including the disclaimer, and that
the same appear on ALL copies of the software and documentation,
including modifications that you make for internal use or for
distribution:
Copyright 1992,1993 by the Massachusetts Institute of Technology.
All rights reserved.
THIS SOFTWARE IS PROVIDED "AS IS", AND M.I.T. MAKES NO REPRESENTATIONS
OR WARRANTIES, EXPRESS OR IMPLIED. By way of example, but not
limitation, M.I.T. MAKES NO REPRESENTATIONS OR WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE
OF THE LICENSED SOFTWARE OR DOCUMENTATION WILL NOT INFRINGE ANY THIRD
PARTY PATENTS, COPYRIGHTS, TRADEMARKS OR OTHER RIGHTS.
The name of the Massachusetts Institute of Technology or M.I.T. may
NOT be used in advertising or publicity pertaining to distribution of
the software. Title to copyright in this software and any associated
documentation shall at all times remain with M.I.T., and USER agrees
to preserve same.
*/
#include "xplot.h"
#include <stdio.h>
extern double atof();
#if defined(linux) || defined(ultrix)
#define remainder drem
#endif
extern double remainder();
/* basically doubles, but printed rep for time */
char *
dtime_unparse(coord c)
{
char *r;
char buf[50];
if ( fabs(c.d) <= 1E-16 ) /* XXX kludge */
(void) sprintf(buf, "0 s");
else if ( fabs(c.d) < .9995E-6 )
(void) sprintf(buf, "%7.3f ns", c.d * 1E9);
else if ( fabs(c.d) < .9995E-3 )
(void) sprintf(buf, "%7.3f us", c.d * 1E6);
else if ( fabs(c.d) < .9995E0 )
(void) sprintf(buf, "%7.3f ms", c.d * 1E3);
else if ( fabs(c.d) < .9995E3 )
(void) sprintf(buf, "%7.3f s", c.d);
else
(void) sprintf(buf, "%7.3f ks", c.d/ 1E3);
r = malloc((unsigned) strlen(buf)+1);
if (r == 0)
fatalerror("malloc returned 0");
(void) strcpy(r, buf);
return r;
}
coord
dtime_parse(char *s)
{
coord r;
r.d = atof(s);
return r;
}
coord
dtime_zero(void)
{
coord r;
r.d = 0.0;
return r;
}
int
dtime_cmp(coord c1, coord c2)
{
if (c1.d > c2.d) return 1;
else if (c1.d < c2.d) return -1;
else return 0;
}
coord
dtime_add(coord c1, coord c2)
{
coord r;
r.d = c1.d + c2.d;
return r;
}
coord
dtime_subtract(coord c1, coord c2)
{
coord r;
r.d = c1.d - c2.d;
return r;
}
coord
dtime_round_up(coord c1, coord c2)
{
coord r;
double rem = remainder(c1.d, c2.d);
if (rem > 0.0)
r.d = c1.d + (c2.d - rem);
else
r.d = c1.d - rem;
return r;
}
coord
dtime_round_down(coord c1, coord c2)
{
coord r;
double rem = remainder(c1.d, c2.d);
if (rem > 0.0)
r.d = c1.d - rem;
else
r.d = c1.d - (c2.d + rem);
return r;
}
coord
dtime_tick(int level)
{
coord r;
r.d = 1.0;
#define MIDLEVEL 60
while ( level < MIDLEVEL - 3 ) {
r.d /= 10.0;
level += 3;
}
while (level < MIDLEVEL) {
r.d /= 2.0; /* to 5 */
level++;
if (level < MIDLEVEL) {
r.d /= 2.5; /* to 2 */
level++;
}
if (level < MIDLEVEL) {
r.d /= 2.0; /* to 1 */
level++;
}
}
while ( level > MIDLEVEL + 3 ) {
r.d *= 10.0;
level -= 3;
}
while (level > MIDLEVEL) {
r.d *= 2.0; /* to 2 */
level--;
if (level > MIDLEVEL) {
r.d *= 2.5; /* to 5 */
level--;
}
if (level > MIDLEVEL) {
r.d *= 2.0; /* to 1 */
level--;
}
}
return r;
}
int dtime_subtick(int level)
{
int r = level;
if (level < 2) r = 0;
else
switch (level%3) {
case 2:
r = level - 2;
break;
case 1:
r = level - 1;
break;
case 0:
r = level - 1;
break;
}
return r;
}
double
dtime_map(coord c1, coord c2, int n, coord c)
{
double r;
r = ((c.d - c1.d) / (c2.d - c1.d)) * (double) n;
return r;
}
coord
dtime_unmap(coord c1,coord c2, int n, double x)
{
coord r;
r.d = ((double)x / (double)n) * (c2.d - c1.d) + c1.d;
return r;
}
struct coord_impl dtime_impl = {
dtime_unparse,
dtime_parse,
dtime_zero,
dtime_cmp,
dtime_add,
dtime_subtract,
dtime_round_up,
dtime_round_down,
dtime_tick,
dtime_subtick,
dtime_map,
dtime_unmap
};