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