/openjdk7/jdk/test/java/util/concurrent/BlockingQueue/ |
H A D | CancelledProducerConsumerLoops.java | 77 static void oneRun(BlockingQueue<Integer> q, int npairs, int iters) throws Exception { argument 81 CyclicBarrier barrier = new CyclicBarrier(npairs * 2 + 1, timer); 82 Future<?>[] prods = new Future<?>[npairs]; 83 Future<?>[] cons = new Future<?>[npairs]; 85 for (int i = 0; i < npairs; ++i) { 93 for (int i = 1; i < npairs; ++i) { 104 for (int i = 1; i < npairs; ++i) {
|
H A D | ProducerConsumerLoops.java | 166 static void oneRun(BlockingQueue<Integer> q, int npairs, int iters) throws Exception { argument 170 CyclicBarrier barrier = new CyclicBarrier(npairs * 2 + 1, timer); 171 for (int i = 0; i < npairs; ++i) { 180 System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * npairs)) + " ns per transfer");
|
/openjdk7/langtools/src/share/classes/com/sun/tools/classfile/ |
H A D | Instruction.java | 109 R visitLookupSwitch(Instruction instr, int default_, int npairs, int[] matches, int[] offsets, P p); argument 228 int npairs = getInt(pad + 4); 229 return pad + 8 + 8 * npairs; 290 int npairs = getInt(pad + 4); 291 int[] matches = new int[npairs]; 292 int[] offsets = new int[npairs]; 293 for (int i = 0; i < npairs; i++) { 298 this, default_, npairs, matches, offsets, p);
|
/openjdk7/jdk/test/java/lang/instrument/ilib/ |
H A D | InjectBytecodes.java | 245 int npairs = c.readU4(); 246 c.skip(npairs * 8); 349 int npairs = c.readU4(); 351 trace(" npairs: " + npairs); 354 for (int i = 0; i< npairs; ++i) { 363 c.skip(npairs * 8); 524 int npairs = c.readU4(); 526 trace(" npairs: " + npairs); [all...] |
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | relocator.cpp | 237 int npairs = int_at(bci + 1 + pad + 4 * 1); local 238 return 1 + pad + 4*(2 + 2*npairs); 373 int npairs = int_at(bci + 1 + oldPad + 4 * 1); local 374 for (int k = 0; k < npairs; k++) { 378 bci += 1 + oldPad + (2 + (npairs*2))*4; 740 int npairs = int_at(bci+1+old_pad+4); local 741 len = npairs*2 + 2; // 2 for default, npairs.
|
/openjdk7/jaxp/src/com/sun/org/apache/bcel/internal/util/ |
H A D | CodeHTML.java | 164 int npairs = bytes.readInt(); 166 jump_table = new int[npairs]; 172 for(int i=0; i < npairs; i++) { 181 for(int i=0; i < npairs; i++) 477 int npairs = bytes.readInt(); 483 for(int j=0; j < npairs; j++) {
|
/openjdk7/langtools/src/share/classes/com/sun/tools/javap/ |
H A D | CodeWriter.java | 173 int default_, int npairs, int[] matches, int[] offsets, Integer indent) { 175 print("{ // " + npairs); 177 for (int i = 0; i < npairs; i++) {
|
/openjdk7/jaxp/src/com/sun/org/apache/bcel/internal/classfile/ |
H A D | Utility.java | 201 int default_offset=0, low, high, npairs; 255 npairs = bytes.readInt(); 258 match = new int[npairs]; 259 jump_table = new int[npairs]; 262 buf.append("\tdefault = " + default_offset + ", npairs = " + npairs + 265 for(int i=0; i < npairs; i++) { 272 if(i < npairs - 1)
|
/openjdk7/jdk/test/sun/reflect/CallerSensitive/ |
H A D | MethodFinder.java | 184 public Integer visitLookupSwitch(Instruction instr, int default_, int npairs, int[] matches, int[] offsets, List<Integer> p) {
|
/openjdk7/jdk/src/share/demo/jvmti/java_crw_demo/ |
H A D | java_crw_demo.c | 1137 int npairs; local 1161 npairs = readU4(ci); 1162 skip(ci, npairs * 8); 1248 int npairs; local 1281 npairs = readU4(ci); 1282 skip(ci, npairs * 8); 1371 int npairs; local 1413 npairs = readU4(ci); 1419 writeU4(ci, npairs); 1420 for (i = 0; i< npairs; [all...] |
/openjdk7/hotspot/src/share/vm/compiler/ |
H A D | methodLiveness.cpp | 308 int npairs = lookupswitch.number_of_pairs(); local 313 while(--npairs >= 0) { 314 LookupswitchPair pair = lookupswitch.pair_at(npairs);
|
/openjdk7/hotspot/src/share/vm/oops/ |
H A D | methodDataOop.cpp | 444 int npairs = sw.number_of_pairs(); local 445 assert(array_len() == per_case_cell_count * (npairs + 1), "wrong len"); 446 for (int count = 0; count < npairs; count++) {
|
H A D | generateOopMap.cpp | 549 int npairs = lookupswitch.number_of_pairs(); local 551 while(--npairs >= 0) { 552 LookupswitchPair pair = lookupswitch.pair_at(npairs);
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/interpreter/ |
H A D | Bytecodes.java | 325 int npairs = method.getBytecodeIntArg(alignedBCI + jintSize); 326 return (alignedBCI - bci) + (2 + 2*npairs)*jintSize;
|
/openjdk7/hotspot/src/share/vm/interpreter/ |
H A D | bytecodes.cpp | 129 jlong npairs = (jint)Bytes::get_Java_u4(aligned_bcp + jintSize); local 130 jlong len = (aligned_bcp - bcp) + (2 + 2*npairs)*jintSize;
|
H A D | bytecodeInterpreter.cpp | 1461 int32_t npairs = Bytes::get_Java_u4((address) &lpc[1]); local 1462 while (--npairs >= 0) {
|
/openjdk7/hotspot/src/share/vm/ci/ |
H A D | ciTypeFlow.cpp | 1726 int npairs = lookupswitch.number_of_pairs(); local 1728 new (arena) GrowableArray<Block*>(arena, npairs+1, 0, NULL); 1733 while(--npairs >= 0) { 1734 LookupswitchPair pair = lookupswitch.pair_at(npairs);
|
/openjdk7/jdk/src/share/native/common/ |
H A D | check_code.c | 1647 int npairs; local 1650 npairs = _ck_ntohl(lpc[1]); 1654 if (npairs < 0 || npairs >= 65536) 1657 return (unsigned char *)(&lpc[2 * (npairs + 1)]) - iptr;
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/oops/ |
H A D | GenerateOopMap.java | 2093 int npairs = lookupswitch.numberOfPairs(); 2095 while(--npairs >= 0) { 2096 LookupswitchPair pair = lookupswitch.pairAt(npairs);
|