org/jpc/emulator/memory/codeblock/optimised/OpcodeLogger.java

   1 /*
   2     JPC-RR: A x86 PC Hardware Emulator
   3     Release 1
   4
   5     Copyright (C) 2007-2009 Isis Innovation Limited
   6     Copyright (C) 2009 H. Ilari Liusvaara
   7
   8     This program is free software; you can redistribute it and/or modify
   9     it under the terms of the GNU General Public License version 2 as published by
  10     the Free Software Foundation.
  11
  12     This program is distributed in the hope that it will be useful,
  13     but WITHOUT ANY WARRANTY; without even the implied warranty of
  14     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15     GNU General Public License for more details.
  16
  17     You should have received a copy of the GNU General Public License along
  18     with this program; if not, write to the Free Software Foundation, Inc.,
  19     51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  20
  21     Based on JPC x86 PC Hardware emulator,
  22     A project from the Physics Dept, The University of Oxford
  23
  24     Details about original JPC can be found at:
  25
  26     www-jpc.physics.ox.ac.uk
  27
  28 */
  29
  30 package org.jpc.emulator.memory.codeblock.optimised;
  31
  32 import java.lang.reflect.Field;
  33 import java.lang.reflect.Modifier;
  34 import java.util.Hashtable;
  35
  36 /**Logs frequencies of opcodes and periodically prints the results
  37  *
  38  * @author Ian Preston
  39  */
  40 public class OpcodeLogger {
  41
  42     int[] opcodeCounts = new int[MicrocodeSet.MICROCODE_LIMIT];
  43     int count = 0;
  44     int MAX = 5000000;
  45     private String name;
  46
  47     OpcodeLogger(String name) {
  48         this.name = name;
  49     }
  50
  51     public boolean hasImmediate(int opcode)
  52     {
  53         if((opcode == 3) | (opcode == 8) | (opcode == 13)
  54                 | (opcode == 26) | (opcode == 27) | (opcode == 49)
  55                 | (opcode == 168) | (opcode == 229) | (opcode == 255))
  56            return true;
  57         else
  58            return false;
  59     }
  60
  61     public void addBlock(int[] microcodes)
  62     {
  63         boolean IM  = false;
  64         for(int j=0; j < microcodes.length; j++) {
  65             if(!IM) {
  66                 addOpcode(microcodes[j]);
  67                 if(hasImmediate(microcodes[j]))
  68                     IM = true;
  69             } else
  70                 IM = false;
  71         }
  72     }
  73
  74     public void addOpcode(int opcode)
  75     {
  76         opcodeCounts[opcode]++;
  77         count++;
  78         if(count >= MAX) {
  79             printStats();
  80             count = 0;
  81         }
  82     }
  83
  84     public void printStats()
  85     {
  86         System.out.println("*******************************");
  87         System.out.println(name);
  88         for(int i=0; i < opcodeCounts.length; i++)
  89             if(opcodeCounts[i] > 0)
  90                 System.out.println(reflectedNameCache.get(String.valueOf(i)) + ": " + opcodeCounts[i]);
  91     }
  92
  93     private static Hashtable<String, String> reflectedNameCache = new Hashtable<String, String>();
  94
  95     static
  96     {
  97         try {
  98             Class<MicrocodeSet> cls = MicrocodeSet.class;
  99             Field[] flds = cls.getDeclaredFields();
 100             int count = 0;
 101             for(int i=0; i<flds.length; i++) {
 102                 Field f = flds[i];
 103                 int mods = f.getModifiers();
 104                 if(!Modifier.isPublic(mods) || !Modifier.isStatic(mods) || !Modifier.isFinal(mods))
 105                     continue;
 106                 if(f.getType() != int.class)
 107                     continue;
 108
 109                 int value = f.getInt(null);
 110                 count++;
 111                 reflectedNameCache.put(String.valueOf(value), f.getName());
 112             }
 113         } catch (Throwable t) {
 114         }
 115     }
 116 }