Searched refs:number_of_codes (Results 1 - 11 of 11) sorted by relevance

/openjdk7/hotspot/src/share/vm/interpreter/
H A DbytecodeHistogram.hpp59 NOT_PRODUCT(static int _counters[Bytecodes::number_of_codes];) // a counter for each bytecode
81 number_of_codes = 1 << log2_number_of_codes, // must be no less than Bytecodes::number_of_codes enumerator in enum:BytecodePairHistogram::Constants
82 number_of_pairs = number_of_codes * number_of_codes
H A DbytecodeHistogram.cpp109 int BytecodeHistogram::_counters[Bytecodes::number_of_codes];
113 int i = Bytecodes::number_of_codes;
120 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, Bytecodes::number_of_codes);
177 int c1 = e->index() % number_of_codes;
178 int c2 = e->index() / number_of_codes;
H A Dbytecodes.hpp308 number_of_codes enumerator in enum:Bytecodes::Code
342 static const char* _name [number_of_codes];
343 static BasicType _result_type [number_of_codes];
344 static s_char _depth [number_of_codes];
345 static u_char _lengths [number_of_codes];
346 static Code _java_code [number_of_codes];
393 static bool is_defined (int code) { return 0 <= code && code < number_of_codes && flags(code, false) != 0; }
H A Dbytecodes.cpp56 const char* Bytecodes::_name [Bytecodes::number_of_codes];
57 BasicType Bytecodes::_result_type [Bytecodes::number_of_codes];
58 s_char Bytecodes::_depth [Bytecodes::number_of_codes];
59 u_char Bytecodes::_lengths [Bytecodes::number_of_codes];
60 Bytecodes::Code Bytecodes::_java_code [Bytecodes::number_of_codes];
281 assert(number_of_codes <= 256, "too many bytecodes");
551 { for (int i = 0; i < number_of_codes; i++) {
H A DtemplateTable.hpp105 static Template _template_table [Bytecodes::number_of_codes];
106 static Template _template_table_wide[Bytecodes::number_of_codes];
H A DtemplateTable.cpp53 if (i < 0 || i >= Bytecodes::number_of_codes) i = this - TemplateTable::_template_table_wide;
172 Template TemplateTable::_template_table [Bytecodes::number_of_codes];
173 Template TemplateTable::_template_table_wide[Bytecodes::number_of_codes];
H A DtemplateInterpreter.cpp38 assert((int)Bytecodes::number_of_codes <= (int)DispatchTable::length,
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/interpreter/
H A DBytecodes.java277 public static final int number_of_codes = 233; field in class:Bytecodes
368 public static boolean isDefined (int code) { return 0 <= code && code < number_of_codes && flags(code, false) != 0; }
385 public static boolean isFastCode (int code) { return number_of_java_codes <= code && code < number_of_codes; }
495 _name = new String [number_of_codes];
496 _format = new String [number_of_codes];
497 _wide_format = new String [number_of_codes];
498 _result_type = new int [number_of_codes]; // See BasicType.java
499 _depth = new byte [number_of_codes];
500 _lengths = new byte [number_of_codes];
501 _java_code = new int [number_of_codes];
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dparse.hpp274 static uint _bytecodes_parsed [Bytecodes::number_of_codes];
275 static uint _nodes_constructed[Bytecodes::number_of_codes];
276 static uint _nodes_transformed[Bytecodes::number_of_codes];
277 static uint _new_values [Bytecodes::number_of_codes];
H A Dparse1.cpp62 uint Parse::BytecodeParseHistogram::_bytecodes_parsed [Bytecodes::number_of_codes];
63 uint Parse::BytecodeParseHistogram::_nodes_constructed[Bytecodes::number_of_codes];
64 uint Parse::BytecodeParseHistogram::_nodes_transformed[Bytecodes::number_of_codes];
65 uint Parse::BytecodeParseHistogram::_new_values [Bytecodes::number_of_codes];
1253 int i = Bytecodes::number_of_codes;
1286 for( i = 0; i < Bytecodes::number_of_codes; ++i ) { total += _bytecodes_parsed[i]; }
/openjdk7/hotspot/src/share/vm/runtime/
H A Dfprofiler.cpp1200 bytecode_ticks = NEW_C_HEAP_ARRAY(int, Bytecodes::number_of_codes, mtInternal);
1201 bytecode_ticks_stub = NEW_C_HEAP_ARRAY(int, Bytecodes::number_of_codes, mtInternal);
1202 for(int index = 0; index < Bytecodes::number_of_codes; index++) {
1290 for (int index = 0; index < Bytecodes::number_of_codes; index++) {

Completed in 74 milliseconds