null

Home

Sort by

Full Search
Definition
Symbol
File Path
History

In Project(s)

Searched defs:in2 (Results 1 - 10 of 10) sorted by relevance

/openjdk7/jdk/test/com/sun/crypto/provider/Cipher/RSA/
H A D	TestRSA.java	155 private final static String in2 = "0f:7d:6c:20:75:99:a5:bc:c1:53:b0:4e:8d:ef:98:fb:cf:2d:e5:1d:d4:bf:71:56:12:b7:a3:c3:e4:53:1b:07:d3:bb:94:a7:a7:28:75:1e:83:46:c9:80:4e:3f:ac:b2:47:06:9f:1b:68:38:73:b8:69:9e:6b:8b:8b:23:60:31:ae:ea:36:24:6f:85:af:de:a5:2a:88:7d:6a:9f:8a:9f:61:f6:59:3f:a8:ce:91:75:49:e9:34:b8:9f:b6:21:8c"; field in class:TestRSA 195 testKat("RSA/ECB/PKCS1Padding", Cipher.ENCRYPT_MODE, publicKey, in2, out2, false); 196 testKat("RSA/ECB/PKCS1Padding", Cipher.DECRYPT_MODE, privateKey, out2, in2, true);
/openjdk7/hotspot/src/share/vm/opto/
H A D	addnode.cpp	`65 Node in2 = add->in(2); local 78 if (in2->is_Load()) { 94 if( in2->is_Phi() && (phi = in2->as_Phi()) && !phi->is_copy() && phi->region()->is_Loop() && phi->in(2)==add){ 100 if( in1->_idx > in2->_idx ) { 241 Node in2 = in(2); local 243 int op2 = in2->Opcode(); 247 in1 = in2; 248 in2 = in(1); 250 op2 = in2 373 Node* in2 = in(2); local [all...]`
H A D	subnode.cpp	85 const Node* in2 = in(2); local 89 const Type* t2 = (in2 == this) ? Type::TOP : phase->type(in2); 94 if (in1->eqv_uncast(in2)) return add_id(); 133 Node in2 = in(2); local 135 uint op2 = in2->Opcode(); 139 if( phase->eqv( in1, this ) \|\| phase->eqv( in2, this ) \|\| 146 const Type t2 = phase->type( in2 ); 158 if( op1 == Op_AddI && ok_to_convert(in1, in2) ) { 161 Node sub2 = phase->transform( new (phase->C) SubINode( in1->in(1), in2 )); 263 Node in2 = in(2); local 373 const Node* in2 = in(2); local 644 Node* in2 = in(2)->uncast(); local 946 const Node* in2 = in(2); local 976 const Node* in2 = in(2); local [all...]
H A D	vectornode.hpp	73 AddVBNode(Node* in1, Node* in2, const TypeVect* vt) : VectorNode(in1,in2,vt) {} argument 81 AddVSNode(Node* in1, Node* in2, const TypeVect* vt) : VectorNode(in1,in2,vt) {} argument 89 AddVINode(Node* in1, Node* in2, const TypeVect* vt) : VectorNode(in1,in2,vt) {} argument 97 AddVLNode(Node* in1, Node* in2, const TypeVect* vt) : VectorNode(in1,in2,vt) {} argument 105 AddVFNode(Node* in1, Node* in2, const TypeVect* vt) : VectorNode(in1,in2,v argument 113 AddVDNode(Node* in1, Node* in2, const TypeVect* vt) argument 121 SubVBNode(Node* in1, Node* in2, const TypeVect* vt) argument 129 SubVSNode(Node* in1, Node* in2, const TypeVect* vt) argument 137 SubVINode(Node* in1, Node* in2, const TypeVect* vt) argument 145 SubVLNode(Node* in1, Node* in2, const TypeVect* vt) argument 153 SubVFNode(Node* in1, Node* in2, const TypeVect* vt) argument 161 SubVDNode(Node* in1, Node* in2, const TypeVect* vt) argument 169 MulVSNode(Node* in1, Node* in2, const TypeVect* vt) argument 177 MulVINode(Node* in1, Node* in2, const TypeVect* vt) argument 185 MulVFNode(Node* in1, Node* in2, const TypeVect* vt) argument 193 MulVDNode(Node* in1, Node* in2, const TypeVect* vt) argument 201 DivVFNode(Node* in1, Node* in2, const TypeVect* vt) argument 209 DivVDNode(Node* in1, Node* in2, const TypeVect* vt) argument 217 LShiftVBNode(Node* in1, Node* in2, const TypeVect* vt) argument 225 LShiftVSNode(Node* in1, Node* in2, const TypeVect* vt) argument 233 LShiftVINode(Node* in1, Node* in2, const TypeVect* vt) argument 241 LShiftVLNode(Node* in1, Node* in2, const TypeVect* vt) argument 249 RShiftVBNode(Node* in1, Node* in2, const TypeVect* vt) argument 257 RShiftVSNode(Node* in1, Node* in2, const TypeVect* vt) argument 265 RShiftVINode(Node* in1, Node* in2, const TypeVect* vt) argument 273 RShiftVLNode(Node* in1, Node* in2, const TypeVect* vt) argument 281 URShiftVBNode(Node* in1, Node* in2, const TypeVect* vt) argument 289 URShiftVSNode(Node* in1, Node* in2, const TypeVect* vt) argument 297 URShiftVINode(Node* in1, Node* in2, const TypeVect* vt) argument 305 URShiftVLNode(Node* in1, Node* in2, const TypeVect* vt) argument 332 AndVNode(Node* in1, Node* in2, const TypeVect* vt) argument 340 OrVNode(Node* in1, Node* in2, const TypeVect* vt) argument 348 XorVNode(Node* in1, Node* in2, const TypeVect* vt) argument 486 PackSNode(Node* in1, Node* in2, const TypeVect* vt) argument 495 PackINode(Node* in1, Node* in2, const TypeVect* vt) argument 504 PackLNode(Node* in1, Node* in2, const TypeVect* vt) argument 512 Pack2LNode(Node* in1, Node* in2, const TypeVect* vt) argument 521 PackFNode(Node* in1, Node* in2, const TypeVect* vt) argument 530 PackDNode(Node* in1, Node* in2, const TypeVect* vt) argument 538 Pack2DNode(Node* in1, Node* in2, const TypeVect* vt) argument [all...]
H A D	callnode.cpp	`1443 Node *in2 = next_control(ctrl->in(2)); local 1444 if (((in1->is_IfTrue() && in2->is_IfFalse()) \|\| 1445 (in2->is_IfTrue() && in1->is_IfFalse())) && (in1->in(0) == in2->in(0))) {`
H A D	cfgnode.cpp	`218 Node in2 = region->in(2); local 221 if( in1->is_Proj() && in2->is_Proj() && in3->is_Proj() ) { 223 Node in20 = in2->in(0); 229 (in1->Opcode() != in2->Opcode()) ) {`
H A D	loopnode.cpp	`3582 Node* in2 = in1->in(j); local 3583 if (in2 != NULL && in2 != n && in2 != in1 && !in2->is_top()) { 3584 tty->print("n->in(%d)->in(%d): ", i, j); in2->dump(); 3585 Node* in2_early = get_ctrl(in2); 3587 if (in2->in(0) != NULL && !in2->in(0)->is_top() && 3588 in2 [all...]`
H A D	superword.cpp	`1392 Node* in2 = vector_opd(p, 2); local 1396 in1 = in2; 1397 in2 = tmp; 1399 vn = VectorNode::make(C, opc, in1, in2, vlen, velt_basic_type(n));`
H A D	compile.cpp	`2662 Node* in2 = n->in(2); local 2664 in2 = in1; 2670 if (in2->is_DecodeN()) { 2671 new_in2 = in2->in(1); 2672 } else if (in2->Opcode() == Op_ConP) { 2673 const Type* t = in2->bottom_type(); 2727 if (in2->outcnt() == 0) { 2728 in2->disconnect_inputs(NULL, this); 2876 Node* in2 = n->in(2); local 2878 const TypeInt* t = in2 [all...]`
H A D	memnode.cpp	`1219 Node* in2 = clone(); local 1220 Node* in2_addr = in2->in(Address)->clone(); 1224 in2->set_req(0, region->in(load_index)); 1225 in2->set_req(Address, in2_addr); 1226 in2->set_req(Memory, mem_phi->in(load_index)); 1231 in2 = phase->transform(in2); 1235 result->set_req(load_index, in2);`

Completed in 134 milliseconds