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
|
/*
* Copyright © 2011 Keith Packard <keithp@keithp.com>
*
* This program 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; version 2 of the License.
*
* This program 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 this program; if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
package org.altusmetrum.altoslib_9;
import java.text.*;
import java.util.concurrent.*;
public class AltosEepromChunk {
public static final int chunk_size = 256;
public static final int per_line = 8;
public int data[];
public int address;
public ParseException parse_exception = null;
int[] ParseHex(String line) {
String[] tokens = line.split("\\s+");
int[] array = new int[tokens.length];
for (int i = 0; i < tokens.length; i++)
try {
array[i] = Integer.parseInt(tokens[i], 16);
} catch (NumberFormatException ne) {
return null;
}
return array;
}
public int data(int offset) {
return data[offset];
}
public int data16(int offset) {
return data[offset] | (data[offset + 1] << 8);
}
public int data32(int offset) {
return data[offset] | (data[offset + 1] << 8) |
(data[offset+2] << 16) | (data[offset+3] << 24);
}
public boolean erased(int start, int len) {
for (int i = 0; i < len; i++)
if (data[start+i] != 0xff)
return false;
return true;
}
public AltosEeprom eeprom(int offset, int log_format, AltosState state) throws ParseException {
AltosEeprom eeprom = null;
switch (log_format) {
case AltosLib.AO_LOG_FORMAT_FULL:
eeprom = new AltosEepromTM(this, offset);
break;
case AltosLib.AO_LOG_FORMAT_TINY:
eeprom = new AltosEepromTm(this, offset, state);
break;
case AltosLib.AO_LOG_FORMAT_TELEMETRY:
case AltosLib.AO_LOG_FORMAT_TELESCIENCE:
break;
case AltosLib.AO_LOG_FORMAT_TELEMEGA:
case AltosLib.AO_LOG_FORMAT_TELEMEGA_OLD:
eeprom = new AltosEepromMega(this, offset, log_format);
break;
case AltosLib.AO_LOG_FORMAT_TELEMETRUM:
eeprom = new AltosEepromMetrum2(this, offset);
break;
case AltosLib.AO_LOG_FORMAT_TELEMINI:
case AltosLib.AO_LOG_FORMAT_EASYMINI:
eeprom = new AltosEepromMini(this, offset);
break;
case AltosLib.AO_LOG_FORMAT_TELEGPS:
eeprom = new AltosEepromGPS(this, offset);
break;
default:
throw new ParseException("unknown eeprom format " + log_format, 0);
}
return eeprom;
}
public AltosEepromChunk(AltosLink link, int block, boolean flush)
throws TimeoutException, InterruptedException {
int offset;
data = new int[chunk_size];
address = block * chunk_size;
if (flush)
link.flush_input();
link.printf("e %x\n", block);
for (offset = 0; offset < chunk_size; offset += per_line) {
try {
String line = link.get_reply(5000);
if (line == null)
throw new TimeoutException();
int[] values = ParseHex(line);
if (values == null || values.length != per_line + 1)
throw new ParseException(String.format("invalid line %s", line), 0);
if (values[0] != offset)
throw new ParseException(String.format("data address out of sync at 0x%x",
address + offset), 0);
for (int i = 0; i < per_line; i++)
data[offset + i] = values[1 + i];
} catch (ParseException pe) {
for (int i = 0; i < per_line; i++)
data[offset + i] = 0xff;
if (parse_exception == null)
parse_exception = pe;
}
}
}
}
|
