git.zerfleddert.de Git - proxmark3-svn/blob - 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
  21 /* write a bit to the graph */
  22 void AppendGraph(int redraw, int clock, int bit)
  23 {
  24   int i;
  25
  26   for (i = 0; i < (int)(clock / 2); ++i)
  27     GraphBuffer[GraphTraceLen++] = bit ^ 1;
  28
  29   for (i = (int)(clock / 2); i < clock; ++i)
  30     GraphBuffer[GraphTraceLen++] = bit;
  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
  50 // DETECT CLOCK NOW IN LFDEMOD.C
  51
  52 void setGraphBuf(uint8_t *buff, size_t size)
  53 {
  54         if ( buff == NULL ) return;
  55
  56         uint16_t i = 0;
  57         if ( size > MAX_GRAPH_TRACE_LEN )
  58                 size = MAX_GRAPH_TRACE_LEN;
  59   ClearGraph(0);
  60   for (; i < size; ++i){
  61                 GraphBuffer[i]=buff[i]-128;
  62   }
  63   GraphTraceLen=size;
  64   RepaintGraphWindow();
  65   return;
  66 }
  67 size_t getFromGraphBuf(uint8_t *buff)
  68 {
  69         if (buff == NULL ) return 0;
  70   uint32_t i;
  71   for (i=0;i<GraphTraceLen;++i){
  72     if (GraphBuffer[i]>127) GraphBuffer[i]=127; //trim
  73     if (GraphBuffer[i]<-127) GraphBuffer[i]=-127; //trim
  74     buff[i]=(uint8_t)(GraphBuffer[i]+128);
  75   }
  76   return i;
  77 }
  78
  79
  80 // Get or auto-detect clock rate
  81 int GetClock(const char *str, int peak, int verbose)
  82 {
  83         int clock;
  84         sscanf(str, "%i", &clock);
  85         if (!strcmp(str, ""))
  86                 clock = 0;
  87
  88         // Auto-detect clock
  89         if (!clock)
  90         {
  91                 uint8_t grph[MAX_GRAPH_TRACE_LEN]={0};
  92                 size_t size = getFromGraphBuf(grph);
  93                 if ( size == 0 ) {
  94                         PrintAndLog("Failed to copy from graphbuffer");
  95                         return -1;
  96                 }
  97                 DetectASKClock(grph,size,&clock,20);
  98                 // Only print this message if we're not looping something
  99                 if (!verbose){
 100                         PrintAndLog("Auto-detected clock rate: %d", clock);
 101                 }
 102         }
 103         return clock;
 104 }
 105
 106 // A simple test to see if there is any data inside Graphbuffer.
 107 bool HasGraphData(){
 108
 109         if ( GraphTraceLen <= 0) {
 110                 PrintAndLog("No data available, try reading something first");
 111                 return false;
 112         }
 113         return true;
 114 }
 115
 116 // Detect high and lows in Grapbuffer.
 117 // Only loops the first 256 values.
 118 void DetectHighLowInGraph(int *high, int *low, bool addFuzz) {
 119
 120         uint8_t loopMax = 255;
 121         if ( loopMax > GraphTraceLen)
 122                 loopMax = GraphTraceLen;
 123
 124         for (uint8_t i = 0; i < loopMax; ++i) {
 125                 if (GraphBuffer[i] > *high)
 126                         *high = GraphBuffer[i];
 127                 else if (GraphBuffer[i] < *low)
 128                         *low = GraphBuffer[i];
 129         }
 130
 131         //12% fuzz in case highs and lows aren't clipped
 132         if (addFuzz) {
 133                 *high = (int)(*high * .88);
 134                 *low  = (int)(*low  * .88);
 135         }
 136 }
 137
 138 int GetPskClock(const char *str, int peak, int verbose)
 139 {
 140         int clock;
 141         sscanf(str, "%i", &clock);
 142         if (!strcmp(str, ""))
 143                 clock = 0;
 144
 145         // Auto-detect clock
 146         if (!clock)
 147         {
 148                 uint8_t grph[MAX_GRAPH_TRACE_LEN]={0};
 149                 size_t size = getFromGraphBuf(grph);
 150                 if ( size == 0 ) {
 151                         PrintAndLog("Failed to copy from graphbuffer");
 152                         return -1;
 153                 }
 154                 clock = DetectPSKClock(grph,size,0);
 155                 // Only print this message if we're not looping something
 156                 if (!verbose){
 157                         PrintAndLog("Auto-detected clock rate: %d", clock);
 158                 }
 159         }
 160         return clock;
 161 }
 162
 163 int GetNrzClock(const char *str, int peak, int verbose)
 164 {
 165         int clock;
 166         sscanf(str, "%i", &clock);
 167         if (!strcmp(str, ""))
 168                 clock = 0;
 169
 170         // Auto-detect clock
 171         if (!clock)
 172         {
 173                 uint8_t grph[MAX_GRAPH_TRACE_LEN]={0};
 174                 size_t size = getFromGraphBuf(grph);
 175                 if ( size == 0 ) {
 176                         PrintAndLog("Failed to copy from graphbuffer");
 177                         return -1;
 178                 }
 179                 clock = DetectNRZClock(grph,size,0);
 180                 // Only print this message if we're not looping something
 181                 if (!verbose){
 182                         PrintAndLog("Auto-detected clock rate: %d", clock);
 183                 }
 184         }
 185         return clock;
 186 }