Searched refs:n2 (Results 1 - 25 of 61) sorted by relevance

123

/openjdk7/jdk/test/javax/management/ObjectInstance/
H A DObjectInstanceNullTest.java38 public static void testEquals(ObjectInstance n1, ObjectInstance n2) { argument
40 if (!n1.equals(n2) || !n2.equals(n1)) {
44 n2.getObjectName()+" , "+
45 n2.getClassName()+"]");
52 n2.getObjectName()+" , "+
53 n2.getClassName()+"]: " + x);
58 if (n1.hashCode() != n2.hashCode()) {
62 n2.getObjectName()+" , "+
63 n2
77 testNotEquals(ObjectInstance n1, ObjectInstance n2) argument
[all...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/bsd/
H A DBsdAddress.java306 // or negative. In unsigned terms, p1 < p2 < n1 < n2.
311 BsdAddress n2 = (BsdAddress) n1.addOffsetTo(10);
316 check(p1.lessThan(n2), "lessThan 3");
318 check(p2.lessThan(n2), "lessThan 5");
319 check(n1.lessThan(n2), "lessThan 6");
325 check(!n2.lessThan(n2), "lessThan 10");
329 check(!n2.lessThan(p1), "lessThan 13");
331 check(!n2.lessThan(p2), "lessThan 15");
332 check(!n2
[all...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/dummy/
H A DDummyAddress.java292 // or negative. In unsigned terms, p1 < p2 < n1 < n2.
297 DummyAddress n2 = (DummyAddress) n1.addOffsetTo(10);
302 check(p1.lessThan(n2), "lessThan 3");
304 check(p2.lessThan(n2), "lessThan 5");
305 check(n1.lessThan(n2), "lessThan 6");
311 check(!n2.lessThan(n2), "lessThan 10");
315 check(!n2.lessThan(p1), "lessThan 13");
317 check(!n2.lessThan(p2), "lessThan 15");
318 check(!n2
[all...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/linux/
H A DLinuxAddress.java306 // or negative. In unsigned terms, p1 < p2 < n1 < n2.
311 LinuxAddress n2 = (LinuxAddress) n1.addOffsetTo(10);
316 check(p1.lessThan(n2), "lessThan 3");
318 check(p2.lessThan(n2), "lessThan 5");
319 check(n1.lessThan(n2), "lessThan 6");
325 check(!n2.lessThan(n2), "lessThan 10");
329 check(!n2.lessThan(p1), "lessThan 13");
331 check(!n2.lessThan(p2), "lessThan 15");
332 check(!n2
[all...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/proc/
H A DProcAddress.java302 // or negative. In unsigned terms, p1 < p2 < n1 < n2.
307 ProcAddress n2 = (ProcAddress) n1.addOffsetTo(10);
312 check(p1.lessThan(n2), "lessThan 3");
314 check(p2.lessThan(n2), "lessThan 5");
315 check(n1.lessThan(n2), "lessThan 6");
321 check(!n2.lessThan(n2), "lessThan 10");
325 check(!n2.lessThan(p1), "lessThan 13");
327 check(!n2.lessThan(p2), "lessThan 15");
328 check(!n2
[all...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/remote/
H A DRemoteAddress.java301 // or negative. In unsigned terms, p1 < p2 < n1 < n2.
306 RemoteAddress n2 = (RemoteAddress) n1.addOffsetTo(10);
311 check(p1.lessThan(n2), "lessThan 3");
313 check(p2.lessThan(n2), "lessThan 5");
314 check(n1.lessThan(n2), "lessThan 6");
320 check(!n2.lessThan(n2), "lessThan 10");
324 check(!n2.lessThan(p1), "lessThan 13");
326 check(!n2.lessThan(p2), "lessThan 15");
327 check(!n2
[all...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/windbg/
H A DWindbgAddress.java311 // or negative. In unsigned terms, p1 < p2 < n1 < n2.
316 WindbgAddress n2 = (WindbgAddress) n1.addOffsetTo(10);
321 check(p1.lessThan(n2), "lessThan 3");
323 check(p2.lessThan(n2), "lessThan 5");
324 check(n1.lessThan(n2), "lessThan 6");
330 check(!n2.lessThan(n2), "lessThan 10");
334 check(!n2.lessThan(p1), "lessThan 13");
336 check(!n2.lessThan(p2), "lessThan 15");
337 check(!n2
[all...]
/openjdk7/jdk/test/java/io/BufferedReader/
H A DFill.java77 int n2 = r.read(cbuf);
79 + ": Read " + n1 + ", then " + n2 + " chars");
82 if (n2 != cbuf.length)
83 throw new Exception("Second read returned " + n2);
/openjdk7/jdk/test/javax/swing/JTree/4314199/
H A Dbug4314199.java77 DefaultMutableTreeNode n2 = new DefaultMutableTreeNode("Duke");
78 n1.add(n2);
80 n2.add(n3);
85 n2.add(n4);
89 tree.expandPath(new TreePath(new Object[]{n1, n2, n3}));
/openjdk7/jdk/test/javax/management/relation/
H A DRelationNotificationSourceTest.java56 Notification n2 =
68 if (!name.equals(n2.getSource()))
69 throw new Exception("FAILED: source is " + n2.getSource());
/openjdk7/hotspot/src/share/vm/opto/
H A Dvectornode.cpp248 VectorNode* VectorNode::make(Compile* C, int opc, Node* n1, Node* n2, uint vlen, BasicType bt) { argument
255 case Op_AddVB: return new (C) AddVBNode(n1, n2, vt);
256 case Op_AddVS: return new (C) AddVSNode(n1, n2, vt);
257 case Op_AddVI: return new (C) AddVINode(n1, n2, vt);
258 case Op_AddVL: return new (C) AddVLNode(n1, n2, vt);
259 case Op_AddVF: return new (C) AddVFNode(n1, n2, vt);
260 case Op_AddVD: return new (C) AddVDNode(n1, n2, vt);
262 case Op_SubVB: return new (C) SubVBNode(n1, n2, vt);
263 case Op_SubVS: return new (C) SubVSNode(n1, n2, vt);
264 case Op_SubVI: return new (C) SubVINode(n1, n2, v
379 PackNode* n2 = binary_tree_pack(C, mid, hi ); local
[all...]
H A Dnode.cpp369 Node::Node(Node *n0, Node *n1, Node *n2) argument
378 assert( is_not_dead(n2), "can not use dead node");
381 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this);
385 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3) argument
394 assert( is_not_dead(n2), "can not use dead node");
398 _in[2] = n2; if (n2 != NULL) n2
403 Node(Node *n0, Node *n1, Node *n2, Node *n3, Node *n4) argument
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 Dcoalesce.hpp55 void combine_these_two( Node *n1, Node *n2 );
/openjdk7/jdk/test/java/io/BufferedInputStream/
H A DFill.java81 int n2 = r.read(buf);
83 + ": Read " + n1 + ", then " + n2 + " bytes");
86 if (n2 != buf.length)
87 throw new Exception("Second read returned " + n2);
/openjdk7/jdk/src/share/classes/sun/misc/
H A DASCIICaseInsensitiveComparator.java41 int n1=s1.length(), n2=s2.length();
42 int minLen = n1 < n2 ? n1 : n2;
55 return n1 - n2;
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java106 InputNode n2 = new InputNode(n);
107 inputNodeMap.put(n, n2);
108 inputNodeMap.put(nB, n2);
109 graph.addNode(n2);
110 markAsChanged(n2, n, nB);
114 InputNode n2 = new InputNode(n);
115 graph.addNode(n2);
116 markAsNew(n2);
117 inputNodeMap.put(n, n2);
121 InputNode n2
176 private InputNode n2; field in class:Difference.Pair
178 Pair(InputNode n1, InputNode n2) argument
[all...]
/openjdk7/langtools/test/tools/javac/generics/diamond/neg/
H A DNeg01.java20 Neg01<? extends String> n2 = new Neg01<>("");
H A DNeg04.java20 Foo<? extends String> n2 = new Foo<>("");
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/objects/
H A DXNodeSet.java752 * @param n2 Second number to compare
756 abstract boolean compareNumbers(double n1, double n2); argument
785 * @param n2 Second number to compare
787 * @return true if n1 is less than n2
789 boolean compareNumbers(double n1, double n2) argument
791 return n1 < n2;
821 * @param n2 Second number to compare
823 * @return true if n1 is less than or equal to n2
825 boolean compareNumbers(double n1, double n2) argument
827 return n1 <= n2;
861 compareNumbers(double n1, double n2) argument
897 compareNumbers(double n1, double n2) argument
932 compareNumbers(double n1, double n2) argument
967 compareNumbers(double n1, double n2) argument
[all...]
/openjdk7/jdk/test/sun/security/pkcs11/KeyAgreement/
H A DTestInterop.java104 byte[] n2 = kbSunJCE.generateSecret();
106 if (Arrays.equals(n1, n2) == false) {
120 byte[] n4 = new byte[n2.length];
H A DTestShort.java103 byte[] n2 = ka.generateSecret();
104 if (Arrays.equals(s2, n2) == false) {
/openjdk7/jdk/src/share/classes/com/sun/java/swing/plaf/gtk/
H A DGTKColorType.java75 private static float hlsValue(float n1, float n2, float h) { argument
83 return n1 + (n2 - n1) * h / 60.0f;
86 return n2;
89 return n1 + (n2 - n1) * (240.0f - h) / 60.0f;
/openjdk7/jdk/src/share/demo/jfc/TableExample/
H A DTableSorter.java120 Number n2 = (Number) data.getValueAt(row2, column);
121 double d2 = n2.doubleValue();
134 long n2 = d2.getTime();
136 if (n1 < n2) {
138 } else if (n1 > n2) {
/openjdk7/langtools/test/tools/javac/scope/
H A DHashCollisionTest.java162 boolean clash(Name n1, Name n2) { argument
164 n2 + " hc:" + n2.hashCode() + " v:" + (n2.hashCode() & scopeHashMask));
165 return (n1.hashCode() & scopeHashMask) == (n2.hashCode() & scopeHashMask);
/openjdk7/jdk/src/share/classes/sun/security/smartcardio/
H A DChannelImpl.java142 private byte[] concat(byte[] b1, byte[] b2, int n2) { argument
144 if ((n1 == 0) && (n2 == b2.length)) {
147 byte[] res = new byte[n1 + n2];
149 System.arraycopy(b2, 0, res, n1, n2);

Completed in 181 milliseconds

123