]>
Commit | Line | Data |
---|---|---|
1 | //----------------------------------------------------------------------------- | |
2 | // Copyright (C) 2010 iZsh <izsh at fail0verflow.com> | |
3 | // | |
4 | // This code is licensed to you under the terms of the GNU GPL, version 2 or, | |
5 | // at your option, any later version. See the LICENSE.txt file for the text of | |
6 | // the license. | |
7 | //----------------------------------------------------------------------------- | |
8 | // Graph utilities | |
9 | //----------------------------------------------------------------------------- | |
10 | ||
11 | #include <stdio.h> | |
12 | #include <stdbool.h> | |
13 | #include <string.h> | |
14 | #include "ui.h" | |
15 | #include "graph.h" | |
16 | #include "lfdemod.h" | |
17 | #include "cmddata.h" //for g_debugmode | |
18 | ||
19 | int GraphBuffer[MAX_GRAPH_TRACE_LEN]; | |
20 | int GraphTraceLen; | |
21 | /* write a manchester bit to the graph */ | |
22 | void AppendGraph(int redraw, int clock, int bit) | |
23 | { | |
24 | int i; | |
25 | //set first half the clock bit (all 1's or 0's for a 0 or 1 bit) | |
26 | for (i = 0; i < (int)(clock / 2); ++i) | |
27 | GraphBuffer[GraphTraceLen++] = bit ; | |
28 | //set second half of the clock bit (all 0's or 1's for a 0 or 1 bit) | |
29 | for (i = (int)(clock / 2); i < clock; ++i) | |
30 | GraphBuffer[GraphTraceLen++] = bit ^ 1; | |
31 | ||
32 | if (redraw) | |
33 | RepaintGraphWindow(); | |
34 | } | |
35 | ||
36 | // clear out our graph window | |
37 | int ClearGraph(int redraw) | |
38 | { | |
39 | int gtl = GraphTraceLen; | |
40 | memset(GraphBuffer, 0x00, GraphTraceLen); | |
41 | ||
42 | GraphTraceLen = 0; | |
43 | ||
44 | if (redraw) | |
45 | RepaintGraphWindow(); | |
46 | ||
47 | return gtl; | |
48 | } | |
49 | // option '1' to save GraphBuffer any other to restore | |
50 | void save_restoreGB(uint8_t saveOpt) | |
51 | { | |
52 | static int SavedGB[MAX_GRAPH_TRACE_LEN]; | |
53 | static int SavedGBlen; | |
54 | static bool GB_Saved = false; | |
55 | ||
56 | if (saveOpt==1) { //save | |
57 | memcpy(SavedGB, GraphBuffer, sizeof(GraphBuffer)); | |
58 | SavedGBlen = GraphTraceLen; | |
59 | GB_Saved=true; | |
60 | } else if (GB_Saved){ //restore | |
61 | memcpy(GraphBuffer, SavedGB, sizeof(GraphBuffer)); | |
62 | GraphTraceLen = SavedGBlen; | |
63 | RepaintGraphWindow(); | |
64 | } | |
65 | return; | |
66 | } | |
67 | ||
68 | // DETECT CLOCK NOW IN LFDEMOD.C | |
69 | ||
70 | void setGraphBuf(uint8_t *buff, size_t size) | |
71 | { | |
72 | if ( buff == NULL ) return; | |
73 | ||
74 | uint16_t i = 0; | |
75 | if ( size > MAX_GRAPH_TRACE_LEN ) | |
76 | size = MAX_GRAPH_TRACE_LEN; | |
77 | ClearGraph(0); | |
78 | for (; i < size; ++i){ | |
79 | GraphBuffer[i]=buff[i]-128; | |
80 | } | |
81 | GraphTraceLen=size; | |
82 | RepaintGraphWindow(); | |
83 | return; | |
84 | } | |
85 | size_t getFromGraphBuf(uint8_t *buff) | |
86 | { | |
87 | if (buff == NULL ) return 0; | |
88 | uint32_t i; | |
89 | for (i=0;i<GraphTraceLen;++i){ | |
90 | if (GraphBuffer[i]>127) GraphBuffer[i]=127; //trim | |
91 | if (GraphBuffer[i]<-127) GraphBuffer[i]=-127; //trim | |
92 | buff[i]=(uint8_t)(GraphBuffer[i]+128); | |
93 | } | |
94 | return i; | |
95 | } | |
96 | ||
97 | // A simple test to see if there is any data inside Graphbuffer. | |
98 | bool HasGraphData(){ | |
99 | ||
100 | if ( GraphTraceLen <= 0) { | |
101 | PrintAndLog("No data available, try reading something first"); | |
102 | return false; | |
103 | } | |
104 | return true; | |
105 | } | |
106 | ||
107 | // Detect high and lows in Grapbuffer. | |
108 | // Only loops the first 256 values. | |
109 | void DetectHighLowInGraph(int *high, int *low, bool addFuzz) { | |
110 | ||
111 | uint8_t loopMax = 255; | |
112 | if ( loopMax > GraphTraceLen) | |
113 | loopMax = GraphTraceLen; | |
114 | ||
115 | for (uint8_t i = 0; i < loopMax; ++i) { | |
116 | if (GraphBuffer[i] > *high) | |
117 | *high = GraphBuffer[i]; | |
118 | else if (GraphBuffer[i] < *low) | |
119 | *low = GraphBuffer[i]; | |
120 | } | |
121 | ||
122 | //12% fuzz in case highs and lows aren't clipped | |
123 | if (addFuzz) { | |
124 | *high = (int)(*high * .88); | |
125 | *low = (int)(*low * .88); | |
126 | } | |
127 | } | |
128 | ||
129 | // Get or auto-detect ask clock rate | |
130 | int GetAskClock(const char str[], bool printAns, bool verbose) | |
131 | { | |
132 | int clock; | |
133 | sscanf(str, "%i", &clock); | |
134 | if (!strcmp(str, "")) | |
135 | clock = 0; | |
136 | ||
137 | if (clock != 0) | |
138 | return clock; | |
139 | // Auto-detect clock | |
140 | uint8_t grph[MAX_GRAPH_TRACE_LEN]={0}; | |
141 | size_t size = getFromGraphBuf(grph); | |
142 | if (size == 0) { | |
143 | if (verbose) | |
144 | PrintAndLog("Failed to copy from graphbuffer"); | |
145 | return -1; | |
146 | } | |
147 | bool st = DetectST(grph, &size, &clock); | |
148 | int start = 0; | |
149 | if (st == false) { | |
150 | start = DetectASKClock(grph, size, &clock, 20); | |
151 | } | |
152 | // Only print this message if we're not looping something | |
153 | if (printAns) { | |
154 | PrintAndLog("Auto-detected clock rate: %d, Best Starting Position: %d", clock, start); | |
155 | } | |
156 | return clock; | |
157 | } | |
158 | ||
159 | uint8_t GetPskCarrier(const char str[], bool printAns, bool verbose) | |
160 | { | |
161 | uint8_t carrier=0; | |
162 | uint8_t grph[MAX_GRAPH_TRACE_LEN]={0}; | |
163 | size_t size = getFromGraphBuf(grph); | |
164 | if ( size == 0 ) { | |
165 | if (verbose) | |
166 | PrintAndLog("Failed to copy from graphbuffer"); | |
167 | return 0; | |
168 | } | |
169 | //uint8_t countPSK_FC(uint8_t *BitStream, size_t size) | |
170 | ||
171 | carrier = countFC(grph,size,0); | |
172 | // Only print this message if we're not looping something | |
173 | if (printAns){ | |
174 | PrintAndLog("Auto-detected PSK carrier rate: %d", carrier); | |
175 | } | |
176 | return carrier; | |
177 | } | |
178 | ||
179 | int GetPskClock(const char str[], bool printAns, bool verbose) | |
180 | { | |
181 | int clock; | |
182 | sscanf(str, "%i", &clock); | |
183 | if (!strcmp(str, "")) | |
184 | clock = 0; | |
185 | ||
186 | if (clock!=0) | |
187 | return clock; | |
188 | // Auto-detect clock | |
189 | uint8_t grph[MAX_GRAPH_TRACE_LEN]={0}; | |
190 | size_t size = getFromGraphBuf(grph); | |
191 | if ( size == 0 ) { | |
192 | if (verbose) | |
193 | PrintAndLog("Failed to copy from graphbuffer"); | |
194 | return -1; | |
195 | } | |
196 | clock = DetectPSKClock(grph,size,0); | |
197 | // Only print this message if we're not looping something | |
198 | if (printAns){ | |
199 | PrintAndLog("Auto-detected clock rate: %d", clock); | |
200 | } | |
201 | return clock; | |
202 | } | |
203 | ||
204 | uint8_t GetNrzClock(const char str[], bool printAns, bool verbose) | |
205 | { | |
206 | int clock; | |
207 | sscanf(str, "%i", &clock); | |
208 | if (!strcmp(str, "")) | |
209 | clock = 0; | |
210 | ||
211 | if (clock!=0) | |
212 | return clock; | |
213 | // Auto-detect clock | |
214 | uint8_t grph[MAX_GRAPH_TRACE_LEN]={0}; | |
215 | size_t size = getFromGraphBuf(grph); | |
216 | if ( size == 0 ) { | |
217 | if (verbose) | |
218 | PrintAndLog("Failed to copy from graphbuffer"); | |
219 | return -1; | |
220 | } | |
221 | size_t clkStartIdx = 0; | |
222 | clock = DetectNRZClock(grph, size, 0, &clkStartIdx); | |
223 | // Only print this message if we're not looping something | |
224 | if (printAns){ | |
225 | PrintAndLog("Auto-detected clock rate: %d", clock); | |
226 | } | |
227 | return clock; | |
228 | } | |
229 | //by marshmellow | |
230 | //attempt to detect the field clock and bit clock for FSK | |
231 | uint8_t GetFskClock(const char str[], bool printAns, bool verbose) | |
232 | { | |
233 | int clock; | |
234 | sscanf(str, "%i", &clock); | |
235 | if (!strcmp(str, "")) | |
236 | clock = 0; | |
237 | if (clock != 0) return (uint8_t)clock; | |
238 | ||
239 | ||
240 | uint8_t fc1=0, fc2=0, rf1=0; | |
241 | uint8_t ans = fskClocks(&fc1, &fc2, &rf1, verbose); | |
242 | if (ans == 0) return 0; | |
243 | if ((fc1==10 && fc2==8) || (fc1==8 && fc2==5)){ | |
244 | if (printAns) PrintAndLog("Detected Field Clocks: FC/%d, FC/%d - Bit Clock: RF/%d", fc1, fc2, rf1); | |
245 | return rf1; | |
246 | } | |
247 | if (verbose){ | |
248 | PrintAndLog("DEBUG: unknown fsk field clock detected"); | |
249 | PrintAndLog("Detected Field Clocks: FC/%d, FC/%d - Bit Clock: RF/%d", fc1, fc2, rf1); | |
250 | } | |
251 | return 0; | |
252 | } | |
253 | uint8_t fskClocks(uint8_t *fc1, uint8_t *fc2, uint8_t *rf1, bool verbose) | |
254 | { | |
255 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
256 | size_t size = getFromGraphBuf(BitStream); | |
257 | if (size==0) return 0; | |
258 | uint16_t ans = countFC(BitStream, size, 1); | |
259 | if (ans==0) { | |
260 | if (verbose || g_debugMode) PrintAndLog("DEBUG: No data found"); | |
261 | return 0; | |
262 | } | |
263 | *fc1 = (ans >> 8) & 0xFF; | |
264 | *fc2 = ans & 0xFF; | |
265 | ||
266 | *rf1 = detectFSKClk(BitStream, size, *fc1, *fc2); | |
267 | if (*rf1==0) { | |
268 | if (verbose || g_debugMode) PrintAndLog("DEBUG: Clock detect error"); | |
269 | return 0; | |
270 | } | |
271 | return 1; | |
272 | } | |
273 | bool graphJustNoise(int *BitStream, int size) | |
274 | { | |
275 | static const uint8_t THRESHOLD = 15; //might not be high enough for noisy environments | |
276 | //test samples are not just noise | |
277 | bool justNoise1 = 1; | |
278 | for(int idx=0; idx < size && justNoise1 ;idx++){ | |
279 | justNoise1 = BitStream[idx] < THRESHOLD; | |
280 | } | |
281 | return justNoise1; | |
282 | } |