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

12

/openjdk7/hotspot/src/share/vm/opto/
H A Dsuperword.cpp1898 bool SuperWord::same_velt_type(Node* n1, Node* n2) { argument
1899 const Type* vt1 = velt_type(n1);
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()));
3547 for (uint i = 1; i < n1->req(); i++) {
3548 if (n1->in(i) < n2->in(i)) return -1;
3549 else if (n1
3556 Node* n1 = *n1p; local
[all...]
H A Dlibrary_call.cpp4811 Node* n1 = LoadKlassNode::make(_gvn, immutable_memory(), p1, TypeRawPtr::BOTTOM); local
4812 Node* dest_elem_klass = _gvn.transform(n1);
/openjdk7/jdk/test/java/lang/invoke/indify/
H A DIndify.java553 int n1 = e.itemIndex();
554 char nmark = poolMarks[(char)n1];
604 char nameAndTypeMark(short n1, short n2) { argument
605 char mark = poolMarks[(char)n1];
609 switch (poolMarks[(char)n1]) {

Completed in 77 milliseconds

12