- int i=0;
- int peak=0;
- int low=128;
- int clk[]={16,32,40,50,64,100,128,256};
- int loopCnt = 256; //don't need to loop through entire array...
- if (size<loopCnt) loopCnt = size;
-
- //if we already have a valid clock quit
- for (;i<8;++i)
- if (clk[i]==clock) return clock;
-
- //get high and low peak
- for (i=0;i<loopCnt;++i){
- if(dest[i]>peak){
- peak = dest[i];
- }
- if(dest[i]<low){
- low = dest[i];
- }
- }
- peak=(int)((peak-128)*.75)+128;
- low= (int)((low-128)*.75)+128;
- int ii;
- int clkCnt;
- int tol = 0;
- int bestErr=1000;
- int errCnt[]={0,0,0,0,0,0,0,0};
- //test each valid clock from smallest to greatest to see which lines up
- for(clkCnt=0; clkCnt<6;++clkCnt){
- if (clk[clkCnt]==32){
- tol=1;
- }else{
- tol=0;
- }
- bestErr=1000;
- //try lining up the peaks by moving starting point (try first 256)
- for (ii=0; ii<loopCnt; ++ii){
- if ((dest[ii]>=peak) || (dest[ii]<=low)){
- errCnt[clkCnt]=0;
- // now that we have the first one lined up test rest of wave array
- for (i=0; i<((int)(size/clk[clkCnt])-1); ++i){
- if (dest[ii+(i*clk[clkCnt])]>=peak || dest[ii+(i*clk[clkCnt])]<=low){
- }else if(dest[ii+(i*clk[clkCnt])-tol]>=peak || dest[ii+(i*clk[clkCnt])-tol]<=low){
- }else if(dest[ii+(i*clk[clkCnt])+tol]>=peak || dest[ii+(i*clk[clkCnt])+tol]<=low){
- }else{ //error no peak detected
- errCnt[clkCnt]++;
- }
- }
- //if we found no errors this is correct one - return this clock
- if(errCnt[clkCnt]==0) return clk[clkCnt];
- //if we found errors see if it is lowest so far and save it as best run
- if(errCnt[clkCnt]<bestErr) bestErr=errCnt[clkCnt];
- }
- }
- }
- int iii=0;
- int best=0;
- for (iii=0; iii<6;++iii){
- if (errCnt[iii]<errCnt[best]){
- best = iii;
- }
- }
- return clk[best];
+ int i = 0;
+ int clk[] = {16,32,40,50,64,100,128,256};
+ uint8_t clkLen = sizeof clk / sizeof clk[0];
+
+ //if we already have a valid clock quit
+ for (; i < clkLen; ++i)
+ if (clk[i] == clock)
+ return clock;
+
+ int peak = 0;
+ int low = 128;
+ int loopCnt = 256;
+ if (size < loopCnt)
+ loopCnt = size;
+
+ //get high and low peak
+ for ( i = 0; i < loopCnt; ++i ){
+ if(dest[i] > peak)
+ peak = dest[i];
+ if(dest[i] < low)
+ low = dest[i];
+ }
+
+ peak = (int)(peak * .75);
+ low = (int)(low+128 * .25);
+
+ int ii, cnt, bestErr, tol = 0;
+ int errCnt[clkLen];
+ memset(errCnt, 0x00, clkLen);
+
+ int tmpIndex, tmphigh, tmplow;
+
+ //test each valid clock from smallest to greatest to see which lines up
+ for( cnt = 0; cnt < clkLen; ++cnt ){
+
+ tol = (clk[cnt] == 32) ? 1 : 0;
+ bestErr = 1000;
+ tmpIndex = tmphigh = tmplow = 0;
+
+ //try lining up the peaks by moving starting point (try first 256)
+ for (ii=0; ii < loopCnt; ++ii){
+
+ // not a peak? continue
+ if ( (dest[ii] < peak) && (dest[ii] > low))
+ continue;
+
+ errCnt[cnt] = 0;
+
+ // now that we have the first one lined up test rest of wave array
+ for ( i = 0; i < ((int)(size / clk[cnt]) - 1); ++i){
+
+ tmpIndex = ii + (i * clk[cnt] );
+ tmplow = dest[ tmpIndex - tol];
+ tmphigh = dest[ tmpIndex + tol];
+
+ if ( dest[tmpIndex] >= peak || dest[tmpIndex] <= low ) {
+ }
+ else if ( tmplow >= peak || tmplow <= low){
+ }
+ else if ( tmphigh >= peak || tmphigh <= low){
+ }
+ else
+ errCnt[cnt]++; //error no peak detected
+ }
+
+ //if we found no errors this is correct one - return this clock
+ if ( errCnt[cnt] == 0 )
+ return clk[cnt];
+
+ if ( errCnt[cnt] < bestErr)
+ bestErr = errCnt[cnt];
+ }
+ // save the least error.
+ errCnt[cnt] = bestErr;
+ }
+ // find best clock which has lowest number of errors
+ int j = 0, bestIndex = 0;
+ for (; j < clkLen; ++j){
+ if ( errCnt[j] < errCnt[bestIndex] )
+ bestIndex = j;
+ }
+ return clk[bestIndex];
projects / proxmark3-svn / blobdiff