Searched defs:n1 (Results 1 - 25 of 29) sorted by relevance

12

/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)) {
42 "["+n1.getObjectName()+" , "+
43 n1.getClassName()+"] ["+
50 "["+n1.getObjectName()+" , "+
51 n1.getClassName()+"] ["+
58 if (n1.hashCode() != n2.hashCode()) {
60 "["+n1.getObjectName()+" , "+
61 n1
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
163 log(n1 + " hc:" + n1.hashCode() + " v:" + (n1.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.java175 private InputNode n1; field in class:Difference.Pair
178 public Pair(InputNode n1, InputNode n2) { argument
179 this.n1 = n1;
186 for (Property p : n1.getProperties()) {
213 return n1;
/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;
89 return n1 + (n2 - n1) * (240.0f - h) / 60.0f;
91 return n1;
/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, n
378 PackNode* n1 = binary_tree_pack(C, lo, mid); local
[all...]
H A Dconnode.hpp142 BinaryNode( Node *n1, Node *n2 ) : Node(0,n1,n2) { } argument
H A Dcoalesce.cpp238 void PhaseCoalesce::combine_these_two( Node *n1, Node *n2 ) { argument
239 uint lr1 = _phc.Find(n1);
263 Node *n = n1; n1 = n2; n2 = n;
267 _phc.Union( n1, n2 );
H A Dmulnode.cpp208 Node *n1 = phase->transform( new (phase->C) LShiftINode( in(1), phase->intcon(log2_intptr(bit1)) ) ); local
210 res = new (phase->C) AddINode( n2, n1 );
215 Node *n1 = phase->transform( new (phase->C) LShiftINode( in(1), phase->intcon(log2_intptr(temp)) ) ); local
216 res = new (phase->C) SubINode( n1, in(1) );
304 Node *n1 = phase->transform( new (phase->C) LShiftLNode( in(1), phase->intcon(log2_long(bit1)) ) ); local
306 res = new (phase->C) AddLNode( n2, n1 );
311 Node *n1 = phase->transform( new (phase->C) LShiftLNode( in(1), phase->intcon(log2_long(temp)) ) ); local
312 res = new (phase->C) SubLNode( n1, in(1) );
H A DphaseX.hpp259 bool eqv(const Node* n1, const Node* n2) const { return n1 == n2; } argument
H A Dreg_split.cpp470 Node *n1, *n2, *n3; local
588 n1 = b->pred(1);
590 pred = _cfg._bbs[n1->_idx];
594 n1 = Ltmp[slidx];
597 n3 = n1;
612 if( n1 != n2 ) {
616 if( n1 && n2 && (u1 != u2) ) {
619 // Move n2/u2 to n1/u1 for next iteration
620 n1 = n2;
631 n1
[all...]
H A Dvectornode.hpp37 VectorNode(Node* n1, const TypeVect* vt) : TypeNode(vt, 2) { argument
39 init_req(1, n1);
41 VectorNode(Node* n1, Node* n2, const TypeVect* vt) : TypeNode(vt, 3) { argument
43 init_req(1, n1);
57 static VectorNode* make(Compile* C, int opc, Node* n1, Node* n2, uint vlen, BasicType bt);
H A Dcfgnode.cpp1297 Node *n1 = phi->in( true_path); local
1300 int op = n1->Opcode();
1310 if( x == n1->in(1) ) {
1311 y = n1->in(2);
1312 } else if( x == n1->in(2) ) {
1313 y = n1->in(1);
H A Dloopnode.hpp473 Node* reassociate_add_sub(Node* n1, PhaseIdealLoop *phase);
580 // 2) a use is the same as the current LCA passed as 'n1'
771 Node *dom_lca( Node *n1, Node *n2 ) const { argument
772 return find_non_split_ctrl(dom_lca_internal(n1, n2));
774 Node *dom_lca_internal( Node *n1, Node *n2 ) const;
H A Dloopopts.cpp1100 Node *n1 = phi->in(i)->in(1)->in(1); local
1102 phi1->set_req( i, n1 );
1104 phi1->set_type( phi1->type()->meet(n1->bottom_type()) );
1169 Node *n1, *n2; local
1171 n1 = cmp_top->in(1);
1174 n1 = n2 = cmp_top;
1176 phi1->set_req( j, n1 );
1178 phi1->set_type( phi1->type()->meet(n1->bottom_type()) );
H A Dmatcher.cpp875 Node* n1 = n->in(i); local
876 const TypePtr* n1at = n1->adr_type();
H A Dnode.cpp355 Node::Node(Node *n0, Node *n1)
363 assert( is_not_dead(n1), "can not use dead node");
365 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this);
369 Node::Node(Node *n0, Node *n1, Node *n2) argument
377 assert( is_not_dead(n1), "can not use dead node");
380 _in[1] = n1; if (n1 != NULL) n1
385 Node(Node *n0, Node *n1, Node *n2, Node *n3) argument
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.hpp233 Node( Node *n0, Node *n1 );
234 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,
485 Node* n1 = in(i1); local
488 _in[i2] = n1;
H A DloopTransform.cpp200 Node* IdealLoopTree::reassociate_add_sub(Node* n1, PhaseIdealLoop *phase) { argument
201 if (!n1->is_Add() && !n1->is_Sub() || n1->outcnt() == 0) return NULL;
202 if (is_invariant(n1)) return NULL;
203 int inv1_idx = is_invariant_addition(n1, phase);
206 if (n1->is_Add() && n1->in(2)->is_Con()) return NULL;
207 Node* inv1 = n1->in(inv1_idx);
208 Node* n2 = n1
[all...]
H A Dloopnode.cpp114 Node *n1 = early; local
117 n1 = idom(n1); // Walk up until break cycle
119 if (n1 == cin || // Walked early up to cin
123 dom_depth(n1) < c_d) {
1012 Node* n1 = expr; local
1013 int n1op = n1->Opcode();
1015 // Try to strip (n1 & M) or (n1 << N >> N) from n1
2017 Node* n1 = C->expensive_node(j); local
3116 dom_lca_internal( Node *n1, Node *n2 ) const argument
3294 dom_lca_for_get_late_ctrl_internal( Node *n1, Node *n2, Node *tag ) argument
[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/jaxp/src/com/sun/org/apache/xpath/internal/objects/
H A DXNodeSet.java751 * @param n1 First number to compare
756 abstract boolean compareNumbers(double n1, double n2); argument
784 * @param n1 First number to compare
787 * @return true if n1 is less than n2
789 boolean compareNumbers(double n1, double n2) argument
791 return n1 < n2;
820 * @param n1 First 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 <
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/java/lang/reflect/Generics/
H A DTestN1.java86 N1<X1, X2> baz(N1<X1, X2> n1) { return n1;} argument
87 N1<?, ?> bam(N1<T1, X2> n1) { return n1;} argument
88 N1<? extends T1, ?> boom(N1<T1, X2> n1) { return n1;} argument
/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) {
533 if (n1.vertex == null) {
539 return n1.preds.size() - n2.preds.size();
544 public int compare(LayoutNode n1, LayoutNode n2) {
545 if (n1.vertex == null) {
551 return n1.succs.size() - n2.succs.size();
707 public int offset(LayoutNode n1, LayoutNode n2) { argument
708 int v1 = space.get(n1
[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);
1067 for (Node<NodeData, EdgeData> n1 : nodes) {
1068 if (intersect(n1, node)) {
/openjdk7/hotspot/src/share/vm/classfile/
H A DclassLoader.cpp770 int n1 = (int)(strlen(pp->pkgname()) + 1); local
771 pp->set_pkgname((char*)memcpy(*top, pp->pkgname(), n1));
772 *top += n1;

Completed in 589 milliseconds

12