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
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
//
// GENERATED FILE
//
use super::*;
use f2rust_std::*;
const FTSIZE: i32 = 5000;
const RSVUNT: i32 = 2;
const SCRUNT: i32 = 1;
const UTSIZE: i32 = ((20 + SCRUNT) + RSVUNT);
const READ: i32 = 1;
const WRITE: i32 = 2;
const SCRTCH: i32 = 3;
const NEW: i32 = 4;
const NUMAMH: i32 = 4;
const BIGI3E: i32 = 1;
const LTLI3E: i32 = 2;
const VAXGFL: i32 = 3;
const VAXDFL: i32 = 4;
const NUMBFF: i32 = 4;
const STRSIZ: i32 = 8;
const STRLEN: i32 = ((STRSIZ + 1) * NUMBFF);
const DAF: i32 = 1;
const DAS: i32 = 2;
const NUMARC: i32 = 2;
const RECL: i32 = 1024;
const FILEN: i32 = 255;
const CBFSIZ: i32 = 1024;
struct SaveVars {
STRBFF: ActualCharArray,
NATBFF: i32,
FIRST: bool,
}
impl SaveInit for SaveVars {
fn new() -> Self {
let mut STRBFF = ActualCharArray::new(STRSIZ, 1..=NUMBFF);
let mut NATBFF: i32 = 0;
let mut FIRST: bool = false;
FIRST = true;
NATBFF = 0;
Self {
STRBFF,
NATBFF,
FIRST,
}
}
}
//$Procedure T_XLTFWD ( Translate For Write, Double Precision Values )
pub fn T_XLTFWD(
INPUT: &[f64],
NUMDP: i32,
OUTBFF: i32,
OUTPUT: &mut [u8],
ctx: &mut Context,
) -> f2rust_std::Result<()> {
let save = ctx.get_vars::<SaveVars>();
let save = &mut *save.borrow_mut();
let INPUT = DummyArray::new(INPUT, 1..);
let mut TMPSTR = [b' '; STRSIZ as usize];
let mut DEQUIV: f64 = 0.0;
let mut J: i32 = 0;
let mut LENOPT: i32 = 0;
let mut SPACE: i32 = 0;
let mut VALUE: i32 = 0;
let IEQUIV = StackArray::<i32, 2>::new(1..=2);
//
// SPICELIB Functions
//
//
// Local Variables
//
//
// Equivalence DEQUIV to IEQUIV
//
//
// Saved Variables
//
//
// Data Statements
//
//
// Standard SPICE error handling.
//
if spicelib::RETURN(ctx) {
return Ok(());
} else {
spicelib::CHKIN(b"T_XLTFWD", ctx)?;
}
//
// Perform some initialization tasks.
//
if save.FIRST {
//
// Populate STRBFF with the appropriate binary file
// format labels.
//
for I in 1..=NUMBFF {
spicelib::ZZDDHGSD(b"BFF", I, &mut save.STRBFF[I], ctx);
}
//
// Fetch the native binary file format.
//
spicelib::ZZPLATFM(b"FILE_FORMAT", &mut TMPSTR, ctx);
spicelib::UCASE(&TMPSTR.clone(), &mut TMPSTR, ctx);
save.NATBFF = spicelib::ISRCHC(&TMPSTR, NUMBFF, save.STRBFF.as_arg());
if (save.NATBFF == 0) {
spicelib::SETMSG(b"The binary file format, \'#\', is not supported by this version of the toolkit. This is a serious problem, contact NAIF.", ctx);
spicelib::ERRCH(b"#", &TMPSTR, ctx);
spicelib::SIGERR(b"SPICE(BUG)", ctx)?;
spicelib::CHKOUT(b"T_XLTFWD", ctx)?;
return Ok(());
}
//
// Do not perform initialization tasks again.
//
save.FIRST = false;
}
//
// Check to see if OUTBFF is valid. This should never occur if this
// routine is called properly.
//
if ((OUTBFF < 1) || (OUTBFF > NUMBFF)) {
spicelib::SETMSG(b"The integer code used to indicate the binary file format of the input integers, #, is out of range. This error should never occur.", ctx);
spicelib::ERRINT(b"#", OUTBFF, ctx);
spicelib::SIGERR(b"SPICE(BUG)", ctx)?;
spicelib::CHKOUT(b"T_XLTFWD", ctx)?;
return Ok(());
}
//
// Get the length of the input string.
//
LENOPT = intrinsics::LEN(OUTPUT);
//
// Now branch depending on the value of NATBFF.
//
if (save.NATBFF == BIGI3E) {
if (OUTBFF == LTLI3E) {
//
// Before we go any further check to see that the length
// of the output string is appropriate and we have enough
// room to store the results. Since this string is to contain
// LTL-IEEE double precision numbers and this is a BIG-IEEE
// machine, characters are 1-byte and double precision numbers
// are 8-bytes. So the length of OUTPUT must be a multiple
// of 8.
//
SPACE = (LENOPT / 8);
if ((LENOPT - (SPACE * 8)) != 0) {
spicelib::SETMSG(b"The output string that is to be translated from the binary format # to format # has a length that is not a multiple of 8 bytes. This error should never occur.", ctx);
spicelib::ERRCH(b"#", &save.STRBFF[save.NATBFF], ctx);
spicelib::ERRCH(b"#", &save.STRBFF[OUTBFF], ctx);
spicelib::SIGERR(b"SPICE(BUG)", ctx)?;
spicelib::CHKOUT(b"T_XLTFWD", ctx)?;
return Ok(());
}
//
// Now check to see that there is enough room to store
// the number of integers we are to convert.
//
if (NUMDP > SPACE) {
spicelib::SETMSG(b"The caller specified that # double precision numbers are to be translated from binary format # to #. However there is only room to hold # numbers in the output array. This error should never occur.", ctx);
spicelib::ERRINT(b"#", NUMDP, ctx);
spicelib::ERRCH(b"#", &save.STRBFF[save.NATBFF], ctx);
spicelib::ERRCH(b"#", &save.STRBFF[OUTBFF], ctx);
spicelib::ERRINT(b"#", SPACE, ctx);
spicelib::SIGERR(b"SPICE(BUG)", ctx)?;
spicelib::CHKOUT(b"T_XLTFWD", ctx)?;
return Ok(());
}
//
// Start looping over each double precision number and
// converting them to the 8-byte character packages to
// be stored in OUTPUT.
//
for I in 1..=NUMDP {
//
// Compute the substring index of the first character
// in OUTPUT for this double precision number.
//
J = ((8 * (I - 1)) + 1);
//
// Now extract and arrange the bytes properly.
// Since these characters are to be stored in a file
// utilizing LTL-IEEE, we know that J is the
// least significant byte and that (J+7) is the
// most significant.
//
// INPUT:
//
// -------------------------------------
// . . .| | J | J+1 | J+2 | J+3 | |. . .
// -------------------------------------
//
// OUTPUT(J:J) = CHAR( INPUT(I)'s LSB )
// .
// .
// OUTPUT(J+7:J+7) = CHAR( INPUT(I)'s MSB )
//
// Perform the necessary computations.
//
spicelib::MOVED(INPUT.subarray(I), 1, std::slice::from_mut(&mut DEQUIV));
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[2], 24);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(fstr::substr_mut(OUTPUT, J..=J), &intrinsics::CHAR(VALUE));
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[2], 16);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 1)..=(J + 1)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[2], 8);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 2)..=(J + 2)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[2], -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 3)..=(J + 3)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[1], 24);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 4)..=(J + 4)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[1], 16);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 5)..=(J + 5)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[1], 8);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 6)..=(J + 6)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[1], -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 7)..=(J + 7)),
&intrinsics::CHAR(VALUE),
);
}
} else {
spicelib::SETMSG(b"Unable to translate double precision numbers from binary file format # to #. This error should never occur and is indicative of a bug. Contact NAIF.", ctx);
spicelib::ERRCH(b"#", &save.STRBFF[save.NATBFF], ctx);
spicelib::ERRCH(b"#", &save.STRBFF[OUTBFF], ctx);
spicelib::SIGERR(b"SPICE(BUG)", ctx)?;
spicelib::CHKOUT(b"T_XLTFWD", ctx)?;
return Ok(());
}
} else if (save.NATBFF == LTLI3E) {
if (OUTBFF == BIGI3E) {
//
// Before we go any further check to see that the length
// of the output string is appropriate and we have enough
// room to store the results. Since this string is to
// contain BIG-IEEE double precision values and this is a
// LTL-IEEE machine, characters are 1-byte and double
// precision values are 8-bytes. So the length of OUTPUT
// must be a multiple of 8.
//
SPACE = (LENOPT / 8);
if ((LENOPT - (SPACE * 8)) != 0) {
spicelib::SETMSG(b"The output string that is to be translated from the binary format # to format # has a length that is not a multiple of 8 bytes. This error should never occur.", ctx);
spicelib::ERRCH(b"#", &save.STRBFF[save.NATBFF], ctx);
spicelib::ERRCH(b"#", &save.STRBFF[OUTBFF], ctx);
spicelib::SIGERR(b"SPICE(BUG)", ctx)?;
spicelib::CHKOUT(b"T_XLTFWD", ctx)?;
return Ok(());
}
//
// Now check to see that there is enough room to store
// the number of integers we are to convert.
//
if (NUMDP > SPACE) {
spicelib::SETMSG(b"The caller specified that # double precision numbers are to be translated from binary format # to #. However there is only room to hold # numbers in the output array. This error should never occur.", ctx);
spicelib::ERRINT(b"#", NUMDP, ctx);
spicelib::ERRCH(b"#", &save.STRBFF[save.NATBFF], ctx);
spicelib::ERRCH(b"#", &save.STRBFF[OUTBFF], ctx);
spicelib::ERRINT(b"#", SPACE, ctx);
spicelib::SIGERR(b"SPICE(BUG)", ctx)?;
spicelib::CHKOUT(b"T_XLTFWD", ctx)?;
return Ok(());
}
//
// Start looping over each double precision number and
// converting them to the 8-byte character packages to
// be stored in OUTPUT.
//
for I in 1..=NUMDP {
//
// Compute the substring index of the first character
// in OUTPUT for this double precision number.
//
J = ((8 * (I - 1)) + 1);
//
// Now extract and arrange the bytes properly.
// Since these characters are to be stored in a file
// utilizing BIG-IEEE, we know that J is the most
// significant byte and that (J+7) is the least
// significant.
//
// INPUT:
//
// -------------------------------------
// . . .| | J | J+1 | J+2 | J+3 | |. . .
// -------------------------------------
//
// OUTPUT(J:J) = CHAR( INPUT(I)'s MSB )
// .
// .
// OUTPUT(J+7:J+7) = CHAR( INPUT(I)'s LSB )
//
// Perform the necessary computations.
//
spicelib::MOVED(INPUT.subarray(I), 1, std::slice::from_mut(&mut DEQUIV));
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[2], -24);
fstr::assign(fstr::substr_mut(OUTPUT, J..=J), &intrinsics::CHAR(VALUE));
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[2], 8);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 1)..=(J + 1)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[2], 16);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 2)..=(J + 2)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[2], 24);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 3)..=(J + 3)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[1], -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 4)..=(J + 4)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[1], 8);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 5)..=(J + 5)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[1], 16);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 6)..=(J + 6)),
&intrinsics::CHAR(VALUE),
);
VALUE = intrinsics::ISHFT(DummyArray::<i32>::from_equiv(&[DEQUIV], 1..=2)[1], 24);
VALUE = intrinsics::ISHFT(VALUE, -24);
fstr::assign(
fstr::substr_mut(OUTPUT, (J + 7)..=(J + 7)),
&intrinsics::CHAR(VALUE),
);
}
} else {
spicelib::SETMSG(b"Unable to translate double precision numbers from binary file format # to #. This error should never occur and is indicative of a bug. Contact NAIF.", ctx);
spicelib::ERRCH(b"#", &save.STRBFF[save.NATBFF], ctx);
spicelib::ERRCH(b"#", &save.STRBFF[OUTBFF], ctx);
spicelib::SIGERR(b"SPICE(BUG)", ctx)?;
spicelib::CHKOUT(b"T_XLTFWD", ctx)?;
return Ok(());
}
//
// The native binary file format on this platform is not supported
// for the conversion of integers. This is a bug, as this branch
// of code should never be reached in normal operation.
//
} else {
spicelib::SETMSG(b"The native binary file format of this toolkit build, #, is not currently supported for translation of double precision numbers from non-native formats.", ctx);
spicelib::ERRCH(b"#", &save.STRBFF[save.NATBFF], ctx);
spicelib::SIGERR(b"SPICE(BUG)", ctx)?;
spicelib::CHKOUT(b"T_XLTFWD", ctx)?;
return Ok(());
}
spicelib::CHKOUT(b"T_XLTFWD", ctx)?;
Ok(())
}