Searched defs:n2 (Results 1 - 22 of 22) sorted by relevance

/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/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/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/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/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 Dmulnode.cpp209 Node *n2 = phase->transform( new (phase->C) LShiftINode( in(1), phase->intcon(log2_intptr(bit2)) ) ); local
210 res = new (phase->C) AddINode( n2, n1 );
305 Node *n2 = phase->transform( new (phase->C) LShiftLNode( in(1), phase->intcon(log2_long(bit2)) ) ); local
306 res = new (phase->C) AddLNode( n2, n1 );
H A Dreg_split.cpp470 Node *n1, *n2, *n3; local
603 n2 = b->pred(inpidx);
605 pred = _cfg._bbs[n2->_idx];
609 n2 = Ltmp[slidx];
612 if( n1 != n2 ) {
616 if( n1 && n2 && (u1 != u2) ) {
619 // Move n2/u2 to n1/u1 for next iteration
620 n1 = n2;
623 if( (n3 == NULL) && (n2 != NULL) ){
624 n3 = n2;
[all...]
H A Dvectornode.hpp41 VectorNode(Node* n1, Node* n2, const TypeVect* vt) : TypeNode(vt, 3) { argument
44 init_req(2, n2);
57 static VectorNode* make(Compile* C, int opc, Node* n1, Node* n2, uint vlen, BasicType bt);
460 PackNode(Node* in1, Node* n2, const TypeVect* vt) : VectorNode(in1, n2, vt) {} argument
H A Dcfgnode.cpp1298 Node *n2 = phi->in(3-true_path); local
1308 Node *x = n2;
H A Dloopopts.cpp1101 Node *n2 = phi->in(i)->in(1)->in(2); local
1103 phi2->set_req( i, n2 );
1105 phi2->set_type( phi2->type()->meet(n2->bottom_type()) );
1169 Node *n1, *n2; local
1172 n2 = cmp_top->in(2);
1174 n1 = n2 = cmp_top;
1177 phi2->set_req( j, n2 );
1179 phi2->set_type( phi2->type()->meet(n2->bottom_type()) );
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 Dnode.hpp234 Node( Node *n0, Node *n1, Node *n2 );
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,
486 Node* n2 = in(i2); local
487 _in[i1] = n2;
H A DloopTransform.cpp208 Node* n2 = n1->in(3 - inv1_idx); local
209 int inv2_idx = is_invariant_addition(n2, phase);
211 Node* x = n2->in(3 - inv2_idx);
212 Node* inv2 = n2->in(inv2_idx);
214 bool neg_x = n2->is_Sub() && inv2_idx == 1;
215 bool neg_inv2 = n2->is_Sub() && inv2_idx == 2;
H A Dloopnode.cpp115 Node *n2 = cin; local
118 n2 = idom(n2);
120 dom_depth(n2) < c_d)
122 if (n2 == early || // Walked cin up to early
2022 Node* n2 = C->expensive_node(k); local
2023 if (is_node_unreachable(n2)) {
2027 assert(n1 != n2, "should be pair of nodes");
2030 Node* c2 = n2->in(0);
2048 _igvn._worklist.push(n2);
3294 dom_lca_for_get_late_ctrl_internal( Node *n1, Node *n2, Node *tag ) argument
[all...]
H A Dsuperword.cpp1898 bool SuperWord::same_velt_type(Node* n1, Node* n2) { argument
1900 const Type* vt2 = velt_type(n2);
1903 return data_size(n1) == data_size(n2);
H A Dcompile.cpp3542 int Compile::cmp_expensive_nodes(Node* n1, Node* n2) { argument
3543 if (n1->Opcode() < n2->Opcode()) return -1;
3544 else if (n1->Opcode() > n2->Opcode()) return 1;
3546 assert(n1->req() == n2->req(), err_msg_res("can't compare %s nodes: n1->req() = %d, n2->req() = %d", NodeClassNames[n1->Opcode()], n1->req(), n2->req()));
3548 if (n1->in(i) < n2->in(i)) return -1;
3549 else if (n1->in(i) > n2->in(i)) return 1;
3557 Node* n2 = *n2p; local
3559 return cmp_expensive_nodes(n1, n2);
[all...]
/openjdk7/langtools/test/tools/apt/mirror/declaration/
H A DConstructorDecl.java157 @Test(result={"N n1", "N n2", "java.lang.String[] ss"},
193 <N extends Number> C2(N n1, N n2, String... ss) throws Throwable { argument
/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);
/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/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java526 public int compare(LayoutNode n1, LayoutNode n2) {
527 return n1.pos - n2.pos;
532 public int compare(LayoutNode n1, LayoutNode n2) {
536 if (n2.vertex == null) {
539 return n1.preds.size() - n2.preds.size();
544 public int compare(LayoutNode n1, LayoutNode n2) {
548 if (n2.vertex == null) {
551 return n1.succs.size() - n2.succs.size();
707 public int offset(LayoutNode n1, LayoutNode n2) { argument
709 int v2 = space.get(n2
[all...]
H A DOldHierarchicalLayoutManager.java957 private boolean intersect(Node<NodeData, EdgeData> n1, Node<NodeData, EdgeData> n2) { argument
958 return intersect(n1.getData().getCoordinate(), n1.getData().getWidth() + OFFSET, n2.getData().getCoordinate(), n2.getData().getWidth() + OFFSET);
/openjdk7/jdk/test/java/lang/invoke/indify/
H A DIndify.java604 char nameAndTypeMark(short n1, short n2) { argument
607 String descr = cf.pool.getString(CONSTANT_Utf8, n2);

Completed in 329 milliseconds