| /openjdk7/jdk/test/javax/swing/JTree/4314199/ |
| H A D | bug4314199.java | 79 DefaultMutableTreeNode n3 = new DefaultMutableTreeNode("Bug");
80 n2.add(n3);
81 n3.add(new DefaultMutableTreeNode("Blah"));
82 n3.add(new DefaultMutableTreeNode("Blah"));
83 n3.add(new DefaultMutableTreeNode("Blah"));
89 tree.expandPath(new TreePath(new Object[]{n1, n2, n3}));
|
| /openjdk7/jdk/test/javax/management/ObjectInstance/ |
| H A D | ObjectInstanceNullTest.java | 127 ObjectInstance n3 = new ObjectInstance(toto1,"Object");
129 testEquals(n3,n3);
130 testEquals(n3,n4);
131 testNotEquals(n1,n3);
137 testNotEquals(n5,n3);
139 testNotEquals(n6,n3);
|
| /openjdk7/langtools/test/tools/javac/generics/diamond/neg/ |
| H A D | Neg01.java | 21 Neg01<?> n3 = new Neg01<>("");
|
| H A D | Neg04.java | 21 Foo<?> n3 = new Foo<>("");
|
| /openjdk7/jdk/test/sun/security/pkcs11/KeyAgreement/ |
| H A D | TestInterop.java | 113 byte[] n3 = new byte[n1.length];
116 int n3Len = ka.generateSecret(n3, 0);
117 if (n3Len != n3.length) {
128 if (Arrays.equals(n3, n4) == false) {
|
| H A D | TestShort.java | 111 byte[] n3 = ka.generateSecret();
112 if (Arrays.equals(s3, n3) == false) {
|
| /openjdk7/hotspot/src/share/vm/opto/ |
| H A D | node.cpp | 385 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3) argument
395 assert( is_not_dead(n3), "can not use dead node");
399 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this);
403 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3, Node *n4) argument
413 assert( is_not_dead(n3), "can not use dead node");
418 _in[3] = n3; if (n3 != NULL) n3
423 Node(Node *n0, Node *n1, Node *n2, Node *n3, Node *n4, Node *n5) argument
446 Node(Node *n0, Node *n1, Node *n2, Node *n3, Node *n4, Node *n5, Node *n6) argument
[all...] |
| H A D | reg_split.cpp | 470 Node *n1, *n2, *n3; local
597 n3 = n1;
623 if( (n3 == NULL) && (n2 != NULL) ){
624 n3 = n2;
657 assert(n3,"No non-NULL reaching DEF for a Phi");
658 phi = new (C) PhiNode(b->head(), n3->bottom_type());
|
| H A D | node.hpp | 235 Node( Node *n0, Node *n1, Node *n2, Node *n3 );
236 Node( Node *n0, Node *n1, Node *n2, Node *n3, Node *n4 );
237 Node( Node *n0, Node *n1, Node *n2, Node *n3, Node *n4, Node *n5 );
238 Node( Node *n0, Node *n1, Node *n2, Node *n3,
|
| H A D | library_call.cpp | 5271 Node* n3 = new(C) LoadINode(NULL, memory(p3), p3, _gvn.type(p3)->is_ptr()); local
5272 Node* check_offset = ConvI2X(_gvn.transform(n3));
|
| /openjdk7/jdk/test/javax/management/MBeanInfo/ |
| H A D | MBeanInfoEqualsTest.java | 176 n3 = new MBeanNotificationInfo(new String[] {"a.b", "c.d"}, field in class:MBeanInfoEqualsTest
230 {n1a, n1b}, {n2a, n2b}, {n3}, {n4},
|