ADD: marshmellows new lf command and DetectClock. (works great!)

[proxmark3-svn] / client / graph.c

diff --git a/client/graph.c b/client/graph.c
index 541e68f3404a30c98de216c16afc70b7c7da1349..bb8159951b2eb8c4637b5a0664f3fbb33d690ed3 100644 (file)
--- a/client/graph.c
+++ b/client/graph.c
@@ -9,6 +9,7 @@
 //-----------------------------------------------------------------------------
 
 #include <stdio.h>
 //-----------------------------------------------------------------------------
 
 #include <stdio.h>

+#include <stdbool.h>

 #include <string.h>
 #include "ui.h"
 #include "graph.h"
 #include <string.h>
 #include "ui.h"
 #include "graph.h"


@@ -20,11 +21,13 @@ int GraphTraceLen;
 void AppendGraph(int redraw, int clock, int bit)
 {
   int i;
 void AppendGraph(int redraw, int clock, int bit)
 {
   int i;

-
-  for (i = 0; i < (int)(clock / 2); ++i)
-    GraphBuffer[GraphTraceLen++] = bit ^ 1;
+  int half = (int)(clock/2);
+  int firstbit = bit ^ 1;
+ 
+  for (i = 0; i < half; ++i)
+    GraphBuffer[GraphTraceLen++] = firstbit;

   
   

-  for (i = (int)(clock / 2); i < clock; ++i)
+  for (i = 0; i <= half; ++i)

     GraphBuffer[GraphTraceLen++] = bit;
 
   if (redraw)
     GraphBuffer[GraphTraceLen++] = bit;
 
   if (redraw)


@@ -35,8 +38,10 @@ void AppendGraph(int redraw, int clock, int bit)
 int ClearGraph(int redraw)
 {
   int gtl = GraphTraceLen;
 int ClearGraph(int redraw)
 {
   int gtl = GraphTraceLen;

-  GraphTraceLen = 0;
+  memset(GraphBuffer, 0x00, GraphTraceLen);

 
 

+  GraphTraceLen = 0;
+ 

   if (redraw)
     RepaintGraphWindow();
 
   if (redraw)
     RepaintGraphWindow();
 


@@ -46,13 +51,15 @@ int ClearGraph(int redraw)
 /*
  * Detect clock rate
  */
 /*
  * Detect clock rate
  */

-int DetectClock(int peak)
+ //decommissioned - has difficulty detecting rf/32 and only works if data is manchester encoded
+/*
+int DetectClock2(int peak)

 {
   int i;
   int clock = 0xFFFF;
   int lastpeak = 0;
 
 {
   int i;
   int clock = 0xFFFF;
   int lastpeak = 0;
 

-  /* Detect peak if we don't have one */
+  // Detect peak if we don't have one 

   if (!peak)
     for (i = 0; i < GraphTraceLen; ++i)
       if (GraphBuffer[i] > peak)
   if (!peak)
     for (i = 0; i < GraphTraceLen; ++i)
       if (GraphBuffer[i] > peak)


@@ -60,18 +67,90 @@ int DetectClock(int peak)
 
   for (i = 1; i < GraphTraceLen; ++i)
   {
 
   for (i = 1; i < GraphTraceLen; ++i)
   {

-    /* If this is the beginning of a peak */
-    if (GraphBuffer[i - 1] != GraphBuffer[i] && GraphBuffer[i] == peak)
+    // If this is the beginning of a peak 
+    if (GraphBuffer[i - 1] != GraphBuffer[i] && GraphBuffer[i] >= peak)

     {
     {

-      /* Find lowest difference between peaks */
+      // Find lowest difference between peaks 

       if (lastpeak && i - lastpeak < clock)
         clock = i - lastpeak;
       lastpeak = i;
     }
   }
       if (lastpeak && i - lastpeak < clock)
         clock = i - lastpeak;
       lastpeak = i;
     }
   }

+       
+               return clock;
+}
+*/

 
 

-  return clock;
+// by marshmellow
+// not perfect especially with lower clocks or VERY good antennas (heavy wave clipping)
+// maybe somehow adjust peak trimming value based on samples to fix?
+int DetectClock(int peak)
+       {
+  int i=0;
+  int low=0;
+  int clk[]={16,32,40,50,64,100,128,256};
+  if (!peak){
+    for (i=0;i<GraphTraceLen;++i){
+      if(GraphBuffer[i]>peak){
+        peak = GraphBuffer[i]; 
+      }
+      if(GraphBuffer[i]<low){
+        low = GraphBuffer[i];
+      }
+    }
+    peak=(int)(peak*.75);
+    low= (int)(low*.75);
+  }
+  //int numbits;
+  int ii;
+  int loopCnt = 256;
+  if (GraphTraceLen<loopCnt) loopCnt = GraphTraceLen;
+  int clkCnt;
+  int tol = 0;
+  int bestErr=1000;
+  int errCnt[]={0,0,0,0,0,0,0,0};
+ // int good;
+  for(clkCnt=0; clkCnt<6;++clkCnt){
+    if (clk[clkCnt]==32){
+      tol=1;
+    }else{
+      tol=0;
+    }
+    bestErr=1000;
+    for (ii=0; ii<loopCnt; ++ii){
+      if ((GraphBuffer[ii]>=peak) || (GraphBuffer[ii]<=low)){
+        //numbits=0;
+        //good=1;
+        errCnt[clkCnt]=0;
+        for (i=0; i<((int)(GraphTraceLen/clk[clkCnt])-1); ++i){
+          if (GraphBuffer[ii+(i*clk[clkCnt])]>=peak || GraphBuffer[ii+(i*clk[clkCnt])]<=low){
+            //numbits++;
+          }else if(GraphBuffer[ii+(i*clk[clkCnt])-tol]>=peak || GraphBuffer[ii+(i*clk[clkCnt])-tol]<=low){
+          }else if(GraphBuffer[ii+(i*clk[clkCnt])+tol]>=peak || GraphBuffer[ii+(i*clk[clkCnt])+tol]<=low){
+          }else{  //error no peak detected
+            //numbits=0;
+            //good=0;
+            errCnt[clkCnt]++;
+            //break;
+          }    
+        }
+        if(errCnt[clkCnt]==0) return clk[clkCnt];
+        if(errCnt[clkCnt]<bestErr) bestErr=errCnt[clkCnt];
+      }
+    } 
+    errCnt[clkCnt]=bestErr;
+  }
+  int iii=0;
+  int best=0;
+  for (iii=0; iii<6;++iii){
+    if (errCnt[iii]<errCnt[best]){
+      best = iii;
+    }
+  }
+  PrintAndLog("clkCnt: %d, ii: %d, i: %d peak: %d, low: %d, errcnt: %d, errCnt64: %d",clkCnt,ii,i,peak,low,errCnt[best],errCnt[4]);
+  return clk[best];

 }
 }

+               

 
 /* Get or auto-detect clock rate */
 int GetClock(const char *str, int peak, int verbose)
 
 /* Get or auto-detect clock rate */
 int GetClock(const char *str, int peak, int verbose)


@@ -86,6 +165,7 @@ int GetClock(const char *str, int peak, int verbose)
   if (!clock)
   {
     clock = DetectClock(peak);
   if (!clock)
   {
     clock = DetectClock(peak);

+    //clock2 = DetectClock2(peak);

     /* Only print this message if we're not looping something */
     if (!verbose)
       PrintAndLog("Auto-detected clock rate: %d", clock);
     /* Only print this message if we're not looping something */
     if (!verbose)
       PrintAndLog("Auto-detected clock rate: %d", clock);


@@ -93,3 +173,15 @@ int GetClock(const char *str, int peak, int verbose)
 
   return clock;
 }
 
   return clock;
 }

+
+
+/* A simple test to see if there is any data inside Graphbuffer. 
+*/
+bool HasGraphData(){
+
+       if ( GraphTraceLen <= 0) {
+               PrintAndLog("No data available, try reading something first");
+               return false;
+       }
+       return true;    
+}
\ No newline at end of file