/openjdk7/hotspot/src/share/vm/opto/ |
H A D | coalesce.cpp | 545 // "Pessimistic" means we do not hit the fixed point in one pass (and we are 549 // into one big live range, then check for self-interference. Everywhere 613 // If both are single def, then src_def powers one live range 673 // Else work back one in copy chain 716 IndexSetIterator one(n_lr1); 719 while ((neighbor = one.next()) != 0) 814 // productive. Since we can record only 1 bias, we want to choose one 815 // that stands a chance of working and this one probably does not.
|
H A D | mulnode.cpp | 47 // Multiplying a one preserves the other argument 49 register const Type *one = mul_id(); // The multiplicative identity local 50 if( phase->type( in(1) )->higher_equal( one ) ) return in(2); 51 if( phase->type( in(2) )->higher_equal( one ) ) return in(1); 188 if( con == 1 ) return NULL; // By one is handled by Identity call 284 if( con == CONST64(1) ) return NULL; // By one is handled by Identity call
|
H A D | library_call.cpp | 1254 Node* one = __ ConI(1); local 1279 __ if_then(__ AndI(cache, __ LShiftI(one, src2)), BoolTest::eq, zero); { 1280 __ if_then(md2, BoolTest::lt, __ AddI(__ value(j), one)); { 1281 __ increment(i, __ AddI(__ value(j), one)); 1288 __ increment(j, one); 1293 __ if_then(__ AndI(cache, __ LShiftI(one, src)), BoolTest::eq, zero, likely); { 1296 __ increment(i, one); 2204 Node* one = __ ConI(1); local 2206 __ if_then(is_instof, BoolTest::eq, one, unlikely); { 3870 // frame is the getCallerClass() frame, so we subtract one fro [all...] |
H A D | type.cpp | 605 // Current "this->_base" is one of: Bad, Multi, Control, Top, 845 const TypeF *TypeF::ONE; // Floating point one 962 const TypeD *TypeD::ONE; // Floating point one 2755 ciObject* one = const_oop(); 2757 if (one == NULL || two == NULL) { 2758 return (one == two) && TypePtr::eq(t); 2760 return one->equals(two) && TypePtr::eq(t); 2902 // Compute the MEET of two InstPtrs when at least one is unloaded. 3155 // If we split one up & one dow [all...] |
H A D | cfgnode.cpp | 67 // If a Region flows into a Region, merge into one big happy merge. This is 125 return phi->as_Phi(); // this one is good enough 136 // Check that only one use is a Phi 324 // Skip if only one use is an other Phi or Call or Uncommon trap. 509 // one of them was cut. The loop is dead if it was EntryContol. 510 // Loop node may have only one input because entry path 534 assert( n->req() == 2 && n->in(1) != NULL, "Only one data input expected" ); 586 assert( n->req() == 2 && n->in(1) != NULL, "Only one data input expected" ); 624 // If a Region flows into a Region, merge into one big happy merge. 632 // Check that only one us 1228 Node *one = phi->in(2); local [all...] |
H A D | loopnode.cpp | 112 // If same depth but not equal, one _must_ dominate the other 567 Node* one = (stride_con > 0) ? gvn->intcon( 1) : gvn->intcon(-1); local 568 limit = gvn->transform(new (C) AddINode(limit, one)); 1299 // Use the new loop head instead of the old shared one 1359 // Feed that region as the one backedge to this loop. 1515 // the one true backedge. 1523 // If I have one hot backedge, peel off myself loop. 1561 _required_safept->push(n); // save the one closest to the tail 1620 // 1) The first, and cheaper one, scans the loop body from 1654 nonlocal_ncsfpt = n; // save the one closes [all...] |
/openjdk7/jdk/test/java/math/BigInteger/ |
H A D | BigIntegerTest.java | 421 BigInteger one = base.modPow(exp, m); 422 if (!one.equals(BigInteger.ONE)) { 605 // next one, and make sure there are no primes in between
|
/openjdk7/jdk/src/share/classes/java/math/ |
H A D | MutableBigInteger.java | 72 * MutableBigInteger with one element value array with the value 1. Used by 82 * a one word capacity. 387 * Returns true iff this MutableBigInteger has a value of one. 509 * A primitive used for division. This method adds in one multiple of the 526 * This method is used for division. It multiplies an n word input a by one 622 // Result one word longer from carry-out; copy low-order 807 * This method is used for division of an n word dividend by a one word 808 * divisor. The quotient is placed into quotient. The one word divisor is 817 // Special case of one word dividend 877 * It special cases one wor 1070 unsignedLongCompare(long one, long two) argument [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/v2/model/impl/ |
H A D | ClassInfoImpl.java | 576 public ConflictException(List<Annotation> one) { argument 577 this.annotations = one;
|
/openjdk7/jdk/src/share/native/sun/awt/libpng/ |
H A D | CHANGES | 296 Replaced pngtest.png with one created with zlib 1.1.1 327 Replaced ansi2knr.c with the one from jpeg-v6 751 a 24-bit visual if one is available, and to allow abbreviated options. 1274 to put one in their application. 1402 Changed the one instance of "ln -sf" to "ln -f -s" in each Sun makefile. 1484 Imposed default one million column, one-million row limits on the image 1495 Fixed off-by-one error in one of the conversions to PNG_ROWBYTES() in 1606 Revised man page and libpng.txt to make it clear that one shoul [all...] |
H A D | pngrtran.c | 164 * one that pngrtran does first (scale) happens. This is necessary to allow the 533 /* Find the closest color to one we threw out */ 562 * and throw out one of them (chosen somewhat randomly). 817 * Since this is an API change (albeit a very minor one that removes an 1931 CONFIGURATION ERROR: you must enable at least one 16 to 8 method 2201 /* There is no harm in doing both of these because only one has any effect,
|
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/jvm/ |
H A D | Gen.java | 227 /** The opcode that loads a one constant of a given type code. 230 public static int one(int tc) { method in class:Gen 591 /** Add abstract methods for all methods defined in one of 602 /** Add abstract methods for all methods defined in one of 743 if (trees.length() == 1) { // mark one statement with the flags 1311 // in a new environment which calls the finally block if there is one. 1797 // Generate code for first string, possibly save one 1831 // Otherwise, duplicate expression, load one copy 1868 code.emitop0(one(od.typecode)); 1888 code.emitop0(one(o [all...] |
H A D | ClassReader.java | 991 // there may be more than one LocalVariableTable, and that 1256 * digits. This one does not. <b>copied from java.lang.Class</b> 1805 * list of names, one per entry in sym.type.getParameterTypes, with 1966 name = names.one; 2268 * thrown a related exception which is the one that 2289 * In practice, only one can be used at a time, so we share one 2361 * unless (1) we already have one the same kind (.class or .java), or 2362 * (2) we have one of the other kind, and the given class file
|
/openjdk7/hotspot/src/cpu/x86/vm/ |
H A D | templateTable_x86_64.cpp | 319 static float one = 1.0f, two = 2.0f; local 325 __ movflt(xmm0, ExternalAddress((address) &one)); 338 static double one = 1.0; local 344 __ movdbl(xmm0, ExternalAddress((address) &one)); 1235 // they are not equal, one could do a normal division (no correction 1246 // they are not equal, one could do a normal division (no correction 1268 // they are not equal, one could do a normal division (no correction 1282 // they are not equal, one could do a normal division (no correction 1425 // Note: should probably use only one movl to get both 2480 // could be one o [all...] |
/openjdk7/jdk/src/share/classes/sun/security/tools/ |
H A D | KeyTool.java | 199 IMPORTKEYSTORE("Imports.one.or.all.entries.from.another.keystore", 1053 // in PKCS11, clone a PrivateKeyEntry will delete the old one 1489 * we choose one that is compatible with the selected private key 1643 * Imports a JDK 1.1-style identity database. We can only store one 2590 // chain replaces the old one. 2704 * old one. 2947 // Not verified, skip to the next one 3406 // Try out each certificate in the vector, until we find one 3614 String one = list[i]; 3615 if (one [all...] |
/openjdk7/jdk/make/jpda/jdwp/ |
H A D | jdwp.spec | 705 "Returns the value of one or more static fields of the " 707 "or one of its superclasses, superinterfaces, or implemented interfaces. " 852 "generic signature if there is one. " 1013 (int count "Total number of constant pool entries plus one. This " 1050 "Sets the value of one or more static fields. " 1052 "or one of its superclasses, superinterfaces, or implemented interfaces. " 1082 "or one of its superclasses, superinterfaces, or implemented interfaces. " 1296 "Eight-byte arguments use two words; all others use one. ") 1389 "Eight-byte arguments use two words; all others use one. ") 1440 "Returns the value of one o [all...] |
/openjdk7/hotspot/src/cpu/sparc/vm/ |
H A D | templateTable_sparc.cpp | 54 assert(index == noreg || offset == 0, "only one offset"); 262 static float zero = 0.0, one = 1.0, two = 2.0; local 267 case 1: p = &one; break; 278 static double zero = 0.0, one = 1.0; local 283 case 1: p = &one; break; 2584 // one or two words depending on its type. As a result, we must find 3750 __ add( __ top_most_monitor(), O2 ); // last one to check 3752 __ delayed()->mov( Lmonitors, O3 ); // first one to check 3764 __ delayed()->mov(O3, O1); // rememeber this one if match 3770 __ delayed()->inc( O3, frame::interpreter_frame_monitor_size() * wordSize ); // check next one [all...] |
H A D | stubGenerator_sparc.cpp | 522 static jfloat zero = 0.0, one = 1.0; local 526 __ set((intptr_t)&one, L0); __ ldf( FloatRegisterImpl::S, L0, 0, F1); // 1.0 to F1 659 // prefers to work with just one kind of synch. instruction. 1137 prefetch_dist = (prefetch_dist + (iter_size-1)) & (-iter_size); // round up to one iteration copy size 1143 // 64 bytes tail + bytes copied in one loop iteration 1161 if (prefetch_count > 0) { // rounded up to one iteration count 1185 if (prefetch_count > 0) { // rounded up to one iteration count 1226 __ deccc(count, count_dec); // Can we do next iteration after this one? 1271 // Load 2 aligned 8-bytes chunks and use one from previous iteration 1330 // Load 2 aligned 8-bytes chunks and use one fro [all...] |
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | synchronizer.cpp | 506 // the number of spinners to at most one. We'll have N-2 threads blocked 517 // wakes at most one thread whereas we need to wake the entire list. 1141 TEVENT (omFlush - Move one) ; 1205 // The mark can be in one of the following states: 1365 // The state-transitions are one-way, so there's no chance of
|
/openjdk7/hotspot/src/os/bsd/vm/ |
H A D | os_bsd.cpp | 595 * by the nulls included by the sizeof operator (so actually one byte more 882 // gives us a one-page buffer if alloca() allocates slightly more memory. 1057 // call one more level start routine 2231 #error Method os::dll_load requires that one of following is defined:\ 3517 // in one of the methods further up the call chain. See bug 5044738. 3720 // has an assumption that setpriority() only modifies one kernel-thread/LWP, 4092 // More than one thread can get here with the same value of osthread, 4490 // check for flags, reset system-used one! 4761 // There's only one node(they start from 0), disable NUMA. 5764 * sets count to 1 and signals condvar. Only one threa [all...] |
/openjdk7/hotspot/src/os/linux/vm/ |
H A D | os_linux.cpp | 481 * by the nulls included by the sizeof operator (so actually one byte more 756 // gives us a one-page buffer if alloca() allocates slightly more memory. 886 // call one more level start routine 2006 #error Method os::dll_load requires that one of following is defined:\ 2179 // the OS version string. Some have more than one /etc/XXX-release file 2644 // See if the error is one we can let the caller handle. This 3438 // in one of the methods further up the call chain. See bug 5044738. 3641 // has an assumption that setpriority() only modifies one kernel-thread/LWP, 3938 // More than one thread can get here with the same value of osthread, 4304 // check for flags, reset system-used one! [all...] |
/openjdk7/hotspot/src/os/windows/vm/ |
H A D | os_windows.cpp | 183 // previous UnhandledExceptionFilter, if there is one 304 // set our UnhandledExceptionFilter and save any previous one 990 // Older versions of dbghelp.dll (the one shipped with Win2003 for example) may not support all 1525 #error Method os::dll_load requires that one of following \ 2287 // at the same address at the same time could cause one of the 2368 // update the enabled status, even if the zone contains only one page. 2384 // a one-time-only guard page, which it has released to us. The next 2820 // now go through and allocate one chunk at a time until all bytes are 2895 // Although the memory is allocated individually, it is returned as one. 2896 // NMT records it as one bloc [all...] |
/openjdk7/hotspot/src/os/solaris/vm/ |
H A D | os_solaris.cpp | 349 // thr_main after the first one (it looks like we trash 955 * by the nulls included by the sizeof operator (so actually one byte more 1673 // gethrtime can move backwards if read from one cpu and then a different cpu 1699 // gethrtime can move backwards if read from one cpu and then a different cpu 2157 #error Method os::dll_load requires that one of following is defined:\ 2711 // pending_signals has one int per signal 2812 // See if the error is one we can let the caller handle. This 2977 // board. An LWP is assigned to one of these groups upon creation. 3070 // the one described in the info parameter is encountered. 3198 // in one o [all...] |