/openjdk7/jdk/test/sun/security/ssl/sun/net/www/protocol/https/HttpsURLConnection/ |
H A D | TunnelProxy.java | 343 byte[] one; field in class:TunnelProxy.NioInputStream 356 one = new byte[1]; 365 return read (one, 0, 1); 466 byte[] one; field in class:TunnelProxy.NioOutputStream 473 one = new byte [1]; 477 one[0] = (byte)b; 478 write (one, 0, 1);
|
/openjdk7/jdk/src/share/native/java/lang/fdlibm/src/ |
H A D | e_pow.c | 83 one = 1.0, variable 124 i0 = ((*(int*)&one)>>29)^1; i1=1-i0; 130 if((iy|ly)==0) return one; 168 if(hy<0) return one/x; else return x; 182 if(hy<0) z = one/z; /* z = (1/|x|) */ 198 s = one; /* s (sign of result -ve**odd) = -1 else = 1 */ 199 if((n|(yisint-1))==0) s = -one;/* (-ve)**(odd int) */ 207 /* over/underflow if x is not close to one */ 212 t = ax-one; /* t has 20 trailing zeros */ 236 v = one/(a [all...] |
H A D | s_erf.c | 55 * is close to one. The interval is chosen because the fix 58 * guarantee the error is less than one ulp for erf. 131 one = 1.00000000000000000000e+00, /* 0x3FF00000, 0x00000000 */ variable 216 return (double)(1-i)+one/x; /* erf(+-inf)=+-1 */ 227 s = one+z*(qq1+z*(qq2+z*(qq3+z*(qq4+z*qq5)))); 232 s = fabs(x)-one; 234 Q = one+s*(qa1+s*(qa2+s*(qa3+s*(qa4+s*(qa5+s*qa6))))); 238 if(hx>=0) return one-tiny; else return tiny-one; 241 s = one/( [all...] |
H A D | e_lgamma_r.c | 82 * Note: one should avoid compute pi*(-x) directly in the 103 one = 1.00000000000000000000e+00, /* 0x3FF00000, 0x00000000 */ variable 209 case 4: y = __kernel_sin(pi*(one-y),zero,0); break; 235 if((ix|lx)==0) return one/zero; 244 return one/zero; 246 if(t==zero) return one/zero; /* -integer */ 258 if(ix>=0x3FE76944) {y = one-x; i= 0;} 259 else if(ix>=0x3FCDA661) {y= x-(tc-one); i=1;} 265 else {y=x-one;i=2;} 284 p2 = one [all...] |
/openjdk7/jdk/src/share/native/sun/security/ec/impl/ |
H A D | ec.c | 388 mp_int privKeyVal, order_1, one; local 392 MP_DIGITS(&one) = 0; 395 CHECK_MPI_OK( mp_init(&one, kmflag) ); 410 CHECK_MPI_OK( mp_set_int(&one, 1) ); 411 CHECK_MPI_OK( mp_sub(&order_1, &one, &order_1) ); 413 CHECK_MPI_OK( mp_add(&privKeyVal, &one, &privKeyVal) ); 419 mp_clear(&one);
|
/openjdk7/hotspot/src/share/vm/opto/ |
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 | 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 | loopTransform.cpp | 283 // Standard IF only has one input value to check for loop invariance 577 assert(trip_count > 1, "one iteration loop should be optimized out already"); 640 // After split at least one iteration will be executed in pre-loop. 741 // expression that does the alignment. Note that only one array base can be 1144 // Unroll the loop body one step - make each trip do 2 iterations. 1315 // Don't need to create new test since only one user. 1438 Node *one = _igvn.intcon(1); local 1439 set_ctrl(one, C->root()); 1440 newcle->set_req(1, one); 1593 Node *one local 1799 Node *one = _igvn.intcon(1); 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...] |
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...] |
/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 | sharedRuntimeTrans.cpp | 40 // generated; can not figure out how to turn down optimization for one 368 one = 1.0, variable 417 if(hugeX+x>one) return one+x;/* trigger inexact */ 424 if(k==0) return one-((x*c)/(c-2.0)-x); 425 else y = one-((lo-(x*c)/(2.0-c))-hi); 516 i0 = ((*(int*)&one)>>29)^1; i1=1-i0; 522 if((iy|ly)==0) return one; 560 if(hy<0) return one/x; else return x; 574 if(hy<0) z = one/ [all...] |
H A D | sharedRuntimeTrig.cpp | 40 // generated; can not figure out how to turn down optimization for one 162 * precsion, one may have to do something like: 256 one = 1.0, variable 324 z = one - z; 325 if(carry!=0) z -= scalbnA(one,q0); 361 fw = scalbnA(one,q0); 665 if(((int)x)==0) return one; /* generate inexact */ 670 return one - (0.5*z - (z*r - x*y)); 679 a = one-qx; 746 return one / fabs [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/langtools/src/share/classes/com/sun/tools/javac/util/ |
H A D | Names.java | 60 public final Name one; field in class:Names 170 one = fromString("1");
|
/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...] |
/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...] |