Searched refs:number_of_pairs (Results 1 - 12 of 12) sorted by relevance

/openjdk7/hotspot/src/share/vm/interpreter/
H A DbytecodeHistogram.hpp82 number_of_pairs = number_of_codes * number_of_codes enumerator in enum:BytecodePairHistogram::Constants
87 NOT_PRODUCT(static int _counters[number_of_pairs];) // a counter for each pair
H A DbytecodeHistogram.cpp149 int BytecodePairHistogram::_counters[BytecodePairHistogram::number_of_pairs];
155 int i = number_of_pairs;
162 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, number_of_pairs);
H A Dbytecode.hpp168 int number_of_pairs() const { return get_Java_u4_at(aligned_offset(1 + 1*jintSize)); } function in class:Bytecode_lookupswitch
170 assert(0 <= i && i < number_of_pairs(), "pair index out of bounds");
H A Dbytecode.cpp240 { int i = number_of_pairs() - 1;
H A Drewriter.cpp318 bc.number_of_pairs() < BinarySwitchThreshold
/openjdk7/hotspot/src/share/vm/ci/
H A DciMethodBlocks.cpp198 int len = sw.number_of_pairs();
H A DbcEscapeAnalyzer.cpp804 int len = sw.number_of_pairs();
H A DciTypeFlow.cpp1726 int npairs = lookupswitch.number_of_pairs();
/openjdk7/hotspot/src/share/vm/oops/
H A DmethodDataOop.cpp413 cell_count = 1 + per_case_cell_count * (sw.number_of_pairs() + 1); // 1 for default
444 int npairs = sw.number_of_pairs();
H A DgenerateOopMap.cpp549 int npairs = lookupswitch.number_of_pairs();
/openjdk7/hotspot/src/share/vm/compiler/
H A DmethodLiveness.cpp308 int npairs = lookupswitch.number_of_pairs();
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_GraphBuilder.cpp339 int l = sw.number_of_pairs();
1328 const int l = sw.number_of_pairs();

Completed in 60 milliseconds