sha1speedtest.java

这是一个基于java编写的torrent的P2P源码

/*
 * Created on Mar 12, 2004
 * Created by Alon Rohter
 * Copyright (C) 2004, 2005, 2006 Aelitis, All Rights Reserved.
 * 
 * Copyright (C) 2004, 2005, 2006 Aelitis, All Rights Reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 * AELITIS, SAS au capital de 46,603.30 euros
 * 8 Allee Lenotre, La Grille Royale, 78600 Le Mesnil le Roi, France.
 */
package org.gudy.azureus2.core3.util.test;

import java.nio.*;

//import org.gudy.azureus2.core3.util.SHA1;
import org.gudy.azureus2.core3.util.SHA1;

/**
 */
public class SHA1SpeedTest {
  
  private static final int BUFF_MAX_SIZE = 4 * 1024 * 1024;
  
  private static final int[] LOOPS = {30000, 15000, 4000, 3000, 2000, 1200,  800};
  private static final int[] TESTS = {   16,    64,  256,  512, 1024, 2048, 4096};
  
	public static void main(String[] args) {
    
    //SHA1 sha1Jmule = new SHA1();
    SHA1 sha1Gudy = new SHA1();
    
    ByteBuffer dBuffer = ByteBuffer.allocateDirect( BUFF_MAX_SIZE );
    ByteBuffer fBuffer = ByteBuffer.allocateDirect( 20 );
    
    fBuffer.order(ByteOrder.BIG_ENDIAN);
    
    for (int i=0; i < BUFF_MAX_SIZE; i++) {
      byte b = (byte)(Math.random() * 255);
      dBuffer.put( b );
    }
    
    //allow time for setting thread to high-priority
    try { Thread.sleep(10000); } catch (Exception ignore) {}
    

    for (int t=0; t < TESTS.length; t++) {
      
      int buffsize = TESTS[t] * 1024;
      dBuffer.limit( buffsize );
      
      int loops = LOOPS[t];
    
    	String info = " [" + buffsize/1024 + "KB, " + loops + "x] = ";
      
    	float totalMBytes = ((float)buffsize / (1024 * 1024)) * loops;
    
    
    	System.out.print("JMule SHA1");
    	long jds = System.currentTimeMillis();
    	for (int i=0; i < loops; i++) {
    		dBuffer.position(0);
        dBuffer.limit( buffsize );
        fBuffer.position(0);
        //sha1Jmule.update( dBuffer );
    		//sha1Jmule.finalDigest( fBuffer );
    	}
    	long jde = System.currentTimeMillis();
  
    	long jdt = (jde - jds);
    	float jdspeed = totalMBytes / (jdt / 1000);
      
    	System.out.println(info + jdt + " ms @ " + jdspeed + " MB/s");

    
    	System.out.print("Gudy SHA1 ");
    	long gds = System.currentTimeMillis();
    	for (int i=0; i < loops; i++) {
        dBuffer.position(0);
        dBuffer.limit( buffsize );
    		sha1Gudy.reset();
        sha1Gudy.update( dBuffer );
    		sha1Gudy.digest();
    	}
    	long gde = System.currentTimeMillis();
    
    	long gdt = (gde - gds);
    	float gdspeed = totalMBytes / (gdt / 1000);
    	System.out.println(info + gdt + " ms @ " + gdspeed + " MB/s");
   
      System.out.println();
    
    }
    
    System.out.println("DONE");
    
    
	}

}