--- a/hotspot/make/solaris/makefiles/fastdebug.make Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/make/solaris/makefiles/fastdebug.make Thu Jul 31 13:42:21 2008 -0700
@@ -38,6 +38,8 @@
# Problem with SS12 compiler, dtrace doesn't like the .o files (bug 6693876)
ifeq ($(COMPILER_REV), 5.9)
+ # To avoid jvm98 crash
+ OPT_CFLAGS/instanceKlass.o = $(OPT_CFLAGS/SLOWER)
# Not clear this workaround could be skipped in some cases.
OPT_CFLAGS/vmGCOperations.o = $(OPT_CFLAGS/SLOWER)
OPT_CFLAGS/java.o = $(OPT_CFLAGS/SLOWER)
--- a/hotspot/src/cpu/x86/vm/stubGenerator_x86_32.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/cpu/x86/vm/stubGenerator_x86_32.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -779,9 +779,9 @@
__ shrl(end, CardTableModRefBS::card_shift);
__ subl(end, start); // end --> count
__ BIND(L_loop);
- ExternalAddress base((address)ct->byte_map_base);
- Address index(start, count, Address::times_1, 0);
- __ movbyte(ArrayAddress(base, index), 0);
+ intptr_t disp = (intptr_t) ct->byte_map_base;
+ Address cardtable(start, count, Address::times_1, disp);
+ __ movb(cardtable, 0);
__ decrement(count);
__ jcc(Assembler::greaterEqual, L_loop);
}
--- a/hotspot/src/cpu/x86/vm/stubGenerator_x86_64.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/cpu/x86/vm/stubGenerator_x86_64.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -1222,8 +1222,16 @@
__ shrq(end, CardTableModRefBS::card_shift);
__ subq(end, start); // number of bytes to copy
+ intptr_t disp = (intptr_t) ct->byte_map_base;
+ if (__ is_simm32(disp)) {
+ Address cardtable(noreg, noreg, Address::no_scale, disp);
+ __ lea(scratch, cardtable);
+ } else {
+ ExternalAddress cardtable((address)disp);
+ __ lea(scratch, cardtable);
+ }
+
const Register count = end; // 'end' register contains bytes count now
- __ lea(scratch, ExternalAddress((address)ct->byte_map_base));
__ addq(start, scratch);
__ BIND(L_loop);
__ movb(Address(start, count, Address::times_1), 0);
--- a/hotspot/src/share/vm/adlc/formssel.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/adlc/formssel.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -3825,6 +3825,8 @@
strcmp(opType,"ConvL2D")==0 ||
strcmp(opType,"ConvL2F")==0 ||
strcmp(opType,"ConvL2I")==0 ||
+ strcmp(opType,"DecodeN")==0 ||
+ strcmp(opType,"EncodeP")==0 ||
strcmp(opType,"RoundDouble")==0 ||
strcmp(opType,"RoundFloat")==0 ||
strcmp(opType,"ReverseBytesI")==0 ||
--- a/hotspot/src/share/vm/ci/ciMethodBlocks.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/ci/ciMethodBlocks.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -351,7 +351,7 @@
}
#ifndef PRODUCT
-static char *flagnames[] = {
+static const char *flagnames[] = {
"Processed",
"Handler",
"MayThrow",
--- a/hotspot/src/share/vm/compiler/oopMap.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/compiler/oopMap.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -188,10 +188,6 @@
}
}
-void OopMap::set_stack_obj(VMReg reg) {
- set_xxx(reg, OopMapValue::stack_obj, VMRegImpl::Bad());
-}
-
// OopMapSet
OopMapSet::OopMapSet() {
@@ -399,8 +395,7 @@
if ( loc != NULL ) {
if ( omv.type() == OopMapValue::oop_value ) {
#ifdef ASSERT
- if (COMPILER2_PRESENT(!DoEscapeAnalysis &&)
- (((uintptr_t)loc & (sizeof(*loc)-1)) != 0) ||
+ if ((((uintptr_t)loc & (sizeof(*loc)-1)) != 0) ||
!Universe::heap()->is_in_or_null(*loc)) {
tty->print_cr("# Found non oop pointer. Dumping state at failure");
// try to dump out some helpful debugging information
@@ -431,17 +426,6 @@
}
}
}
-
-#ifdef COMPILER2
- if (DoEscapeAnalysis) {
- for (OopMapStream oms(map, OopMapValue::stack_obj); !oms.is_done(); oms.next()) {
- omv = oms.current();
- assert(omv.is_stack_loc(), "should refer to stack location");
- oop loc = (oop) fr->oopmapreg_to_location(omv.reg(),reg_map);
- oop_fn->do_oop(&loc);
- }
- }
-#endif // COMPILER2
}
@@ -540,9 +524,6 @@
st->print("Derived_oop_" );
optional->print_on(st);
break;
- case OopMapValue::stack_obj:
- st->print("Stack");
- break;
default:
ShouldNotReachHere();
}
--- a/hotspot/src/share/vm/compiler/oopMap.hpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/compiler/oopMap.hpp Thu Jul 31 13:42:21 2008 -0700
@@ -46,7 +46,7 @@
public:
// Constants
- enum { type_bits = 6,
+ enum { type_bits = 5,
register_bits = BitsPerShort - type_bits };
enum { type_shift = 0,
@@ -63,8 +63,7 @@
value_value = 2,
narrowoop_value = 4,
callee_saved_value = 8,
- derived_oop_value= 16,
- stack_obj = 32 };
+ derived_oop_value= 16 };
// Constructors
OopMapValue () { set_value(0); set_content_reg(VMRegImpl::Bad()); }
@@ -93,14 +92,12 @@
bool is_narrowoop() { return mask_bits(value(), type_mask_in_place) == narrowoop_value; }
bool is_callee_saved() { return mask_bits(value(), type_mask_in_place) == callee_saved_value; }
bool is_derived_oop() { return mask_bits(value(), type_mask_in_place) == derived_oop_value; }
- bool is_stack_obj() { return mask_bits(value(), type_mask_in_place) == stack_obj; }
void set_oop() { set_value((value() & register_mask_in_place) | oop_value); }
void set_value() { set_value((value() & register_mask_in_place) | value_value); }
void set_narrowoop() { set_value((value() & register_mask_in_place) | narrowoop_value); }
void set_callee_saved() { set_value((value() & register_mask_in_place) | callee_saved_value); }
void set_derived_oop() { set_value((value() & register_mask_in_place) | derived_oop_value); }
- void set_stack_obj() { set_value((value() & register_mask_in_place) | stack_obj); }
VMReg reg() const { return VMRegImpl::as_VMReg(mask_bits(value(), register_mask_in_place) >> register_shift); }
oop_types type() const { return (oop_types)mask_bits(value(), type_mask_in_place); }
@@ -180,7 +177,6 @@
void set_dead ( VMReg local);
void set_callee_saved( VMReg local, VMReg caller_machine_register );
void set_derived_oop ( VMReg local, VMReg derived_from_local_register );
- void set_stack_obj( VMReg local);
void set_xxx(VMReg reg, OopMapValue::oop_types x, VMReg optional);
int heap_size() const;
--- a/hotspot/src/share/vm/opto/bytecodeInfo.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/bytecodeInfo.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -83,7 +83,7 @@
ciMethod* caller_method, Compile* C) {
// True when EA is ON and a java constructor is called or
// a super constructor is called from an inlined java constructor.
- return DoEscapeAnalysis && EliminateAllocations &&
+ return C->do_escape_analysis() && EliminateAllocations &&
( callee_method->is_initializer() ||
(caller_method->is_initializer() &&
caller_method != C->method() &&
--- a/hotspot/src/share/vm/opto/c2_globals.hpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/c2_globals.hpp Thu Jul 31 13:42:21 2008 -0700
@@ -373,7 +373,7 @@
product(intx, AutoBoxCacheMax, 128, \
"Sets max value cached by the java.lang.Integer autobox cache") \
\
- product(bool, DoEscapeAnalysis, false, \
+ product(bool, DoEscapeAnalysis, true, \
"Perform escape analysis") \
\
notproduct(bool, PrintEscapeAnalysis, false, \
@@ -388,6 +388,9 @@
product(intx, EliminateAllocationArraySizeLimit, 64, \
"Array size (number of elements) limit for scalar replacement") \
\
+ product(intx, ValueSearchLimit, 1000, \
+ "Recursion limit in PhaseMacroExpand::value_from_mem_phi") \
+ \
product(intx, MaxLabelRootDepth, 1100, \
"Maximum times call Label_Root to prevent stack overflow") \
\
--- a/hotspot/src/share/vm/opto/callnode.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/callnode.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -631,61 +631,13 @@
bool CallNode::may_modify(const TypePtr *addr_t, PhaseTransform *phase) {
const TypeOopPtr *adrInst_t = addr_t->isa_oopptr();
- // if not an InstPtr or not an instance type, assume the worst
- if (adrInst_t == NULL || !adrInst_t->is_known_instance_field()) {
+ // If not an OopPtr or not an instance type, assume the worst.
+ // Note: currently this method is called only for instance types.
+ if (adrInst_t == NULL || !adrInst_t->is_known_instance()) {
return true;
}
- Compile *C = phase->C;
- int offset = adrInst_t->offset();
- assert(adrInst_t->klass_is_exact() && offset >= 0, "should be valid offset");
- ciKlass* adr_k = adrInst_t->klass();
- assert(adr_k->is_loaded() &&
- adr_k->is_java_klass() &&
- !adr_k->is_interface(),
- "only non-abstract classes are expected");
-
- int base_idx = C->get_alias_index(adrInst_t);
- int size = BytesPerLong; // If we don't know the size, assume largest.
- if (adrInst_t->isa_instptr()) {
- ciField* field = C->alias_type(base_idx)->field();
- if (field != NULL) {
- size = field->size_in_bytes();
- }
- } else {
- assert(adrInst_t->isa_aryptr(), "only arrays are expected");
- size = type2aelembytes(adr_k->as_array_klass()->element_type()->basic_type());
- }
-
- ciMethod * meth = is_CallStaticJava() ? as_CallStaticJava()->method() : NULL;
- BCEscapeAnalyzer *bcea = (meth != NULL) ? meth->get_bcea() : NULL;
-
- const TypeTuple * d = tf()->domain();
- for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
- const Type* t = d->field_at(i);
- Node *arg = in(i);
- const Type *at = phase->type(arg);
- if (at == TypePtr::NULL_PTR || at == Type::TOP)
- continue; // null can't affect anything
-
- const TypeOopPtr *at_ptr = at->isa_oopptr();
- if (!arg->is_top() && (t->isa_oopptr() != NULL ||
- t->isa_ptr() && at_ptr != NULL)) {
- assert(at_ptr != NULL, "expecting an OopPtr");
- ciKlass* at_k = at_ptr->klass();
- if ((adrInst_t->base() == at_ptr->base()) &&
- at_k->is_loaded() &&
- at_k->is_java_klass()) {
- // If we have found an argument matching addr_t, check if the field
- // at the specified offset is modified.
- if ((at_k->is_interface() || adr_k == at_k ||
- adr_k->is_subclass_of(at_k) && !at_ptr->klass_is_exact()) &&
- (bcea == NULL ||
- bcea->is_arg_modified(i - TypeFunc::Parms, offset, size))) {
- return true;
- }
- }
- }
- }
+ // The instance_id is set only for scalar-replaceable allocations which
+ // are not passed as arguments according to Escape Analysis.
return false;
}
--- a/hotspot/src/share/vm/opto/cfgnode.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/cfgnode.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -713,7 +713,9 @@
assert(type() == Type::MEMORY &&
(t == TypePtr::BOTTOM || t == TypeRawPtr::BOTTOM ||
t->isa_oopptr() && !t->is_oopptr()->is_known_instance() &&
- t->is_oopptr()->cast_to_instance_id(t_oop->instance_id()) == t_oop),
+ t->is_oopptr()->cast_to_exactness(true)
+ ->is_oopptr()->cast_to_ptr_type(t_oop->ptr())
+ ->is_oopptr()->cast_to_instance_id(t_oop->instance_id()) == t_oop),
"bottom or raw memory required");
// Check if an appropriate node already exists.
@@ -1089,6 +1091,8 @@
if (rc == NULL || phase->type(rc) == Type::TOP)
continue; // ignore unreachable control path
Node* n = in(i);
+ if (n == NULL)
+ continue;
Node* un = n->uncast();
if (un == NULL || un == this || phase->type(un) == Type::TOP) {
continue; // ignore if top, or in(i) and "this" are in a data cycle
--- a/hotspot/src/share/vm/opto/compile.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/compile.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -583,18 +583,32 @@
NOT_PRODUCT( verify_graph_edges(); )
// Perform escape analysis
- if (_do_escape_analysis)
- _congraph = new ConnectionGraph(this);
- if (_congraph != NULL) {
- NOT_PRODUCT( TracePhase t2("escapeAnalysis", &_t_escapeAnalysis, TimeCompiler); )
- _congraph->compute_escape();
- if (failing()) return;
+ if (_do_escape_analysis && ConnectionGraph::has_candidates(this)) {
+ TracePhase t2("escapeAnalysis", &_t_escapeAnalysis, true);
+ // Add ConP#NULL and ConN#NULL nodes before ConnectionGraph construction.
+ PhaseGVN* igvn = initial_gvn();
+ Node* oop_null = igvn->zerocon(T_OBJECT);
+ Node* noop_null = igvn->zerocon(T_NARROWOOP);
+
+ _congraph = new(comp_arena()) ConnectionGraph(this);
+ bool has_non_escaping_obj = _congraph->compute_escape();
#ifndef PRODUCT
if (PrintEscapeAnalysis) {
_congraph->dump();
}
#endif
+ // Cleanup.
+ if (oop_null->outcnt() == 0)
+ igvn->hash_delete(oop_null);
+ if (noop_null->outcnt() == 0)
+ igvn->hash_delete(noop_null);
+
+ if (!has_non_escaping_obj) {
+ _congraph = NULL;
+ }
+
+ if (failing()) return;
}
// Now optimize
Optimize();
@@ -995,9 +1009,14 @@
int offset = tj->offset();
TypePtr::PTR ptr = tj->ptr();
+ // Known instance (scalarizable allocation) alias only with itself.
+ bool is_known_inst = tj->isa_oopptr() != NULL &&
+ tj->is_oopptr()->is_known_instance();
+
// Process weird unsafe references.
if (offset == Type::OffsetBot && (tj->isa_instptr() /*|| tj->isa_klassptr()*/)) {
assert(InlineUnsafeOps, "indeterminate pointers come only from unsafe ops");
+ assert(!is_known_inst, "scalarizable allocation should not have unsafe references");
tj = TypeOopPtr::BOTTOM;
ptr = tj->ptr();
offset = tj->offset();
@@ -1005,14 +1024,20 @@
// Array pointers need some flattening
const TypeAryPtr *ta = tj->isa_aryptr();
- if( ta && _AliasLevel >= 2 ) {
+ if( ta && is_known_inst ) {
+ if ( offset != Type::OffsetBot &&
+ offset > arrayOopDesc::length_offset_in_bytes() ) {
+ offset = Type::OffsetBot; // Flatten constant access into array body only
+ tj = ta = TypeAryPtr::make(ptr, ta->ary(), ta->klass(), true, offset, ta->instance_id());
+ }
+ } else if( ta && _AliasLevel >= 2 ) {
// For arrays indexed by constant indices, we flatten the alias
// space to include all of the array body. Only the header, klass
// and array length can be accessed un-aliased.
if( offset != Type::OffsetBot ) {
if( ta->const_oop() ) { // methodDataOop or methodOop
offset = Type::OffsetBot; // Flatten constant access into array body
- tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),ta->ary(),ta->klass(),false,Type::OffsetBot, ta->instance_id());
+ tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),ta->ary(),ta->klass(),false,offset);
} else if( offset == arrayOopDesc::length_offset_in_bytes() ) {
// range is OK as-is.
tj = ta = TypeAryPtr::RANGE;
@@ -1026,29 +1051,29 @@
ptr = TypePtr::BotPTR;
} else { // Random constant offset into array body
offset = Type::OffsetBot; // Flatten constant access into array body
- tj = ta = TypeAryPtr::make(ptr,ta->ary(),ta->klass(),false,Type::OffsetBot, ta->instance_id());
+ tj = ta = TypeAryPtr::make(ptr,ta->ary(),ta->klass(),false,offset);
}
}
// Arrays of fixed size alias with arrays of unknown size.
if (ta->size() != TypeInt::POS) {
const TypeAry *tary = TypeAry::make(ta->elem(), TypeInt::POS);
- tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,ta->klass(),false,offset, ta->instance_id());
+ tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,ta->klass(),false,offset);
}
// Arrays of known objects become arrays of unknown objects.
if (ta->elem()->isa_narrowoop() && ta->elem() != TypeNarrowOop::BOTTOM) {
const TypeAry *tary = TypeAry::make(TypeNarrowOop::BOTTOM, ta->size());
- tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,NULL,false,offset, ta->instance_id());
+ tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,NULL,false,offset);
}
if (ta->elem()->isa_oopptr() && ta->elem() != TypeInstPtr::BOTTOM) {
const TypeAry *tary = TypeAry::make(TypeInstPtr::BOTTOM, ta->size());
- tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,NULL,false,offset, ta->instance_id());
+ tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,NULL,false,offset);
}
// Arrays of bytes and of booleans both use 'bastore' and 'baload' so
// cannot be distinguished by bytecode alone.
if (ta->elem() == TypeInt::BOOL) {
const TypeAry *tary = TypeAry::make(TypeInt::BYTE, ta->size());
ciKlass* aklass = ciTypeArrayKlass::make(T_BYTE);
- tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,aklass,false,offset, ta->instance_id());
+ tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,aklass,false,offset);
}
// During the 2nd round of IterGVN, NotNull castings are removed.
// Make sure the Bottom and NotNull variants alias the same.
@@ -1068,21 +1093,24 @@
if( ptr == TypePtr::Constant ) {
// No constant oop pointers (such as Strings); they alias with
// unknown strings.
+ assert(!is_known_inst, "not scalarizable allocation");
tj = to = TypeInstPtr::make(TypePtr::BotPTR,to->klass(),false,0,offset);
- } else if( to->is_known_instance_field() ) {
+ } else if( is_known_inst ) {
tj = to; // Keep NotNull and klass_is_exact for instance type
} else if( ptr == TypePtr::NotNull || to->klass_is_exact() ) {
// During the 2nd round of IterGVN, NotNull castings are removed.
// Make sure the Bottom and NotNull variants alias the same.
// Also, make sure exact and non-exact variants alias the same.
- tj = to = TypeInstPtr::make(TypePtr::BotPTR,to->klass(),false,0,offset, to->instance_id());
+ tj = to = TypeInstPtr::make(TypePtr::BotPTR,to->klass(),false,0,offset);
}
// Canonicalize the holder of this field
ciInstanceKlass *k = to->klass()->as_instance_klass();
if (offset >= 0 && offset < instanceOopDesc::base_offset_in_bytes()) {
// First handle header references such as a LoadKlassNode, even if the
// object's klass is unloaded at compile time (4965979).
- tj = to = TypeInstPtr::make(TypePtr::BotPTR, env()->Object_klass(), false, NULL, offset, to->instance_id());
+ if (!is_known_inst) { // Do it only for non-instance types
+ tj = to = TypeInstPtr::make(TypePtr::BotPTR, env()->Object_klass(), false, NULL, offset);
+ }
} else if (offset < 0 || offset >= k->size_helper() * wordSize) {
to = NULL;
tj = TypeOopPtr::BOTTOM;
@@ -1090,7 +1118,11 @@
} else {
ciInstanceKlass *canonical_holder = k->get_canonical_holder(offset);
if (!k->equals(canonical_holder) || tj->offset() != offset) {
- tj = to = TypeInstPtr::make(to->ptr(), canonical_holder, false, NULL, offset, to->instance_id());
+ if( is_known_inst ) {
+ tj = to = TypeInstPtr::make(to->ptr(), canonical_holder, true, NULL, offset, to->instance_id());
+ } else {
+ tj = to = TypeInstPtr::make(to->ptr(), canonical_holder, false, NULL, offset);
+ }
}
}
}
@@ -1276,7 +1308,9 @@
assert(flat != TypePtr::BOTTOM, "cannot alias-analyze an untyped ptr");
if (flat->isa_oopptr() && !flat->isa_klassptr()) {
const TypeOopPtr* foop = flat->is_oopptr();
- const TypePtr* xoop = foop->cast_to_exactness(!foop->klass_is_exact())->is_ptr();
+ // Scalarizable allocations have exact klass always.
+ bool exact = !foop->klass_is_exact() || foop->is_known_instance();
+ const TypePtr* xoop = foop->cast_to_exactness(exact)->is_ptr();
assert(foop == flatten_alias_type(xoop), "exactness must not affect alias type");
}
assert(flat == flatten_alias_type(flat), "exact bit doesn't matter");
--- a/hotspot/src/share/vm/opto/escape.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/escape.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -25,16 +25,6 @@
#include "incls/_precompiled.incl"
#include "incls/_escape.cpp.incl"
-uint PointsToNode::edge_target(uint e) const {
- assert(_edges != NULL && e < (uint)_edges->length(), "valid edge index");
- return (_edges->at(e) >> EdgeShift);
-}
-
-PointsToNode::EdgeType PointsToNode::edge_type(uint e) const {
- assert(_edges != NULL && e < (uint)_edges->length(), "valid edge index");
- return (EdgeType) (_edges->at(e) & EdgeMask);
-}
-
void PointsToNode::add_edge(uint targIdx, PointsToNode::EdgeType et) {
uint v = (targIdx << EdgeShift) + ((uint) et);
if (_edges == NULL) {
@@ -72,10 +62,14 @@
"F" // FieldEdge
};
-void PointsToNode::dump() const {
+void PointsToNode::dump(bool print_state) const {
NodeType nt = node_type();
- EscapeState es = escape_state();
- tty->print("%s %s %s [[", node_type_names[(int) nt], esc_names[(int) es], _scalar_replaceable ? "" : "NSR");
+ tty->print("%s ", node_type_names[(int) nt]);
+ if (print_state) {
+ EscapeState es = escape_state();
+ tty->print("%s %s ", esc_names[(int) es], _scalar_replaceable ? "":"NSR");
+ }
+ tty->print("[[");
for (uint i = 0; i < edge_count(); i++) {
tty->print(" %d%s", edge_target(i), edge_type_suffix[(int) edge_type(i)]);
}
@@ -87,17 +81,29 @@
}
#endif
-ConnectionGraph::ConnectionGraph(Compile * C) : _processed(C->comp_arena()), _node_map(C->comp_arena()) {
- _collecting = true;
- this->_compile = C;
- const PointsToNode &dummy = PointsToNode();
- int sz = C->unique();
- _nodes = new(C->comp_arena()) GrowableArray<PointsToNode>(C->comp_arena(), sz, sz, dummy);
- _phantom_object = C->top()->_idx;
- PointsToNode *phn = ptnode_adr(_phantom_object);
- phn->_node = C->top();
- phn->set_node_type(PointsToNode::JavaObject);
- phn->set_escape_state(PointsToNode::GlobalEscape);
+ConnectionGraph::ConnectionGraph(Compile * C) :
+ _nodes(C->comp_arena(), C->unique(), C->unique(), PointsToNode()),
+ _processed(C->comp_arena()),
+ _collecting(true),
+ _compile(C),
+ _node_map(C->comp_arena()) {
+
+ _phantom_object = C->top()->_idx,
+ add_node(C->top(), PointsToNode::JavaObject, PointsToNode::GlobalEscape,true);
+
+ // Add ConP(#NULL) and ConN(#NULL) nodes.
+ PhaseGVN* igvn = C->initial_gvn();
+ Node* oop_null = igvn->zerocon(T_OBJECT);
+ _oop_null = oop_null->_idx;
+ assert(_oop_null < C->unique(), "should be created already");
+ add_node(oop_null, PointsToNode::JavaObject, PointsToNode::NoEscape, true);
+
+ if (UseCompressedOops) {
+ Node* noop_null = igvn->zerocon(T_NARROWOOP);
+ _noop_null = noop_null->_idx;
+ assert(_noop_null < C->unique(), "should be created already");
+ add_node(noop_null, PointsToNode::JavaObject, PointsToNode::NoEscape, true);
+ }
}
void ConnectionGraph::add_pointsto_edge(uint from_i, uint to_i) {
@@ -182,32 +188,36 @@
// If we are still collecting or there were no non-escaping allocations
// we don't know the answer yet
- if (_collecting || !_has_allocations)
+ if (_collecting)
return PointsToNode::UnknownEscape;
// if the node was created after the escape computation, return
// UnknownEscape
- if (idx >= (uint)_nodes->length())
+ if (idx >= nodes_size())
return PointsToNode::UnknownEscape;
- es = _nodes->at_grow(idx).escape_state();
+ es = ptnode_adr(idx)->escape_state();
// if we have already computed a value, return it
if (es != PointsToNode::UnknownEscape)
return es;
+ // PointsTo() calls n->uncast() which can return a new ideal node.
+ if (n->uncast()->_idx >= nodes_size())
+ return PointsToNode::UnknownEscape;
+
// compute max escape state of anything this node could point to
VectorSet ptset(Thread::current()->resource_area());
PointsTo(ptset, n, phase);
for(VectorSetI i(&ptset); i.test() && es != PointsToNode::GlobalEscape; ++i) {
uint pt = i.elem;
- PointsToNode::EscapeState pes = _nodes->adr_at(pt)->escape_state();
+ PointsToNode::EscapeState pes = ptnode_adr(pt)->escape_state();
if (pes > es)
es = pes;
}
// cache the computed escape state
assert(es != PointsToNode::UnknownEscape, "should have computed an escape state");
- _nodes->adr_at(idx)->set_escape_state(es);
+ ptnode_adr(idx)->set_escape_state(es);
return es;
}
@@ -220,48 +230,50 @@
#endif
n = n->uncast();
- PointsToNode npt = _nodes->at_grow(n->_idx);
+ PointsToNode* npt = ptnode_adr(n->_idx);
// If we have a JavaObject, return just that object
- if (npt.node_type() == PointsToNode::JavaObject) {
+ if (npt->node_type() == PointsToNode::JavaObject) {
ptset.set(n->_idx);
return;
}
#ifdef ASSERT
- if (npt._node == NULL) {
+ if (npt->_node == NULL) {
if (orig_n != n)
orig_n->dump();
n->dump();
- assert(npt._node != NULL, "unregistered node");
+ assert(npt->_node != NULL, "unregistered node");
}
#endif
worklist.push(n->_idx);
while(worklist.length() > 0) {
int ni = worklist.pop();
- PointsToNode pn = _nodes->at_grow(ni);
- if (!visited.test_set(ni)) {
- // ensure that all inputs of a Phi have been processed
- assert(!_collecting || !pn._node->is_Phi() || _processed.test(ni),"");
+ if (visited.test_set(ni))
+ continue;
+
+ PointsToNode* pn = ptnode_adr(ni);
+ // ensure that all inputs of a Phi have been processed
+ assert(!_collecting || !pn->_node->is_Phi() || _processed.test(ni),"");
- int edges_processed = 0;
- for (uint e = 0; e < pn.edge_count(); e++) {
- uint etgt = pn.edge_target(e);
- PointsToNode::EdgeType et = pn.edge_type(e);
- if (et == PointsToNode::PointsToEdge) {
- ptset.set(etgt);
- edges_processed++;
- } else if (et == PointsToNode::DeferredEdge) {
- worklist.push(etgt);
- edges_processed++;
- } else {
- assert(false,"neither PointsToEdge or DeferredEdge");
- }
+ int edges_processed = 0;
+ uint e_cnt = pn->edge_count();
+ for (uint e = 0; e < e_cnt; e++) {
+ uint etgt = pn->edge_target(e);
+ PointsToNode::EdgeType et = pn->edge_type(e);
+ if (et == PointsToNode::PointsToEdge) {
+ ptset.set(etgt);
+ edges_processed++;
+ } else if (et == PointsToNode::DeferredEdge) {
+ worklist.push(etgt);
+ edges_processed++;
+ } else {
+ assert(false,"neither PointsToEdge or DeferredEdge");
}
- if (edges_processed == 0) {
- // no deferred or pointsto edges found. Assume the value was set
- // outside this method. Add the phantom object to the pointsto set.
- ptset.set(_phantom_object);
- }
+ }
+ if (edges_processed == 0) {
+ // no deferred or pointsto edges found. Assume the value was set
+ // outside this method. Add the phantom object to the pointsto set.
+ ptset.set(_phantom_object);
}
}
}
@@ -272,11 +284,11 @@
deferred_edges->clear();
visited->Clear();
- uint i = 0;
+ visited->set(ni);
PointsToNode *ptn = ptnode_adr(ni);
// Mark current edges as visited and move deferred edges to separate array.
- while (i < ptn->edge_count()) {
+ for (uint i = 0; i < ptn->edge_count(); ) {
uint t = ptn->edge_target(i);
#ifdef ASSERT
assert(!visited->test_set(t), "expecting no duplications");
@@ -293,24 +305,23 @@
for (int next = 0; next < deferred_edges->length(); ++next) {
uint t = deferred_edges->at(next);
PointsToNode *ptt = ptnode_adr(t);
- for (uint j = 0; j < ptt->edge_count(); j++) {
- uint n1 = ptt->edge_target(j);
- if (visited->test_set(n1))
+ uint e_cnt = ptt->edge_count();
+ for (uint e = 0; e < e_cnt; e++) {
+ uint etgt = ptt->edge_target(e);
+ if (visited->test_set(etgt))
continue;
- switch(ptt->edge_type(j)) {
- case PointsToNode::PointsToEdge:
- add_pointsto_edge(ni, n1);
- if(n1 == _phantom_object) {
- // Special case - field set outside (globally escaping).
- ptn->set_escape_state(PointsToNode::GlobalEscape);
- }
- break;
- case PointsToNode::DeferredEdge:
- deferred_edges->append(n1);
- break;
- case PointsToNode::FieldEdge:
- assert(false, "invalid connection graph");
- break;
+
+ PointsToNode::EdgeType et = ptt->edge_type(e);
+ if (et == PointsToNode::PointsToEdge) {
+ add_pointsto_edge(ni, etgt);
+ if(etgt == _phantom_object) {
+ // Special case - field set outside (globally escaping).
+ ptn->set_escape_state(PointsToNode::GlobalEscape);
+ }
+ } else if (et == PointsToNode::DeferredEdge) {
+ deferred_edges->append(etgt);
+ } else {
+ assert(false,"invalid connection graph");
}
}
}
@@ -322,15 +333,15 @@
// a pointsto edge is added if it is a JavaObject
void ConnectionGraph::add_edge_from_fields(uint adr_i, uint to_i, int offs) {
- PointsToNode an = _nodes->at_grow(adr_i);
- PointsToNode to = _nodes->at_grow(to_i);
- bool deferred = (to.node_type() == PointsToNode::LocalVar);
+ PointsToNode* an = ptnode_adr(adr_i);
+ PointsToNode* to = ptnode_adr(to_i);
+ bool deferred = (to->node_type() == PointsToNode::LocalVar);
- for (uint fe = 0; fe < an.edge_count(); fe++) {
- assert(an.edge_type(fe) == PointsToNode::FieldEdge, "expecting a field edge");
- int fi = an.edge_target(fe);
- PointsToNode pf = _nodes->at_grow(fi);
- int po = pf.offset();
+ for (uint fe = 0; fe < an->edge_count(); fe++) {
+ assert(an->edge_type(fe) == PointsToNode::FieldEdge, "expecting a field edge");
+ int fi = an->edge_target(fe);
+ PointsToNode* pf = ptnode_adr(fi);
+ int po = pf->offset();
if (po == offs || po == Type::OffsetBot || offs == Type::OffsetBot) {
if (deferred)
add_deferred_edge(fi, to_i);
@@ -343,13 +354,13 @@
// Add a deferred edge from node given by "from_i" to any field of adr_i
// whose offset matches "offset".
void ConnectionGraph::add_deferred_edge_to_fields(uint from_i, uint adr_i, int offs) {
- PointsToNode an = _nodes->at_grow(adr_i);
- for (uint fe = 0; fe < an.edge_count(); fe++) {
- assert(an.edge_type(fe) == PointsToNode::FieldEdge, "expecting a field edge");
- int fi = an.edge_target(fe);
- PointsToNode pf = _nodes->at_grow(fi);
- int po = pf.offset();
- if (pf.edge_count() == 0) {
+ PointsToNode* an = ptnode_adr(adr_i);
+ for (uint fe = 0; fe < an->edge_count(); fe++) {
+ assert(an->edge_type(fe) == PointsToNode::FieldEdge, "expecting a field edge");
+ int fi = an->edge_target(fe);
+ PointsToNode* pf = ptnode_adr(fi);
+ int po = pf->offset();
+ if (pf->edge_count() == 0) {
// we have not seen any stores to this field, assume it was set outside this method
add_pointsto_edge(fi, _phantom_object);
}
@@ -504,29 +515,30 @@
igvn->set_type(addp, tinst);
// record the allocation in the node map
set_map(addp->_idx, get_map(base->_idx));
- // if the Address input is not the appropriate instance type
- // (due to intervening casts,) insert a cast
- Node *adr = addp->in(AddPNode::Address);
- const TypeOopPtr *atype = igvn->type(adr)->isa_oopptr();
- if (atype != NULL && atype->instance_id() != inst_id) {
- assert(!atype->is_known_instance(), "no conflicting instances");
- const TypeOopPtr *new_atype = base_t->add_offset(atype->offset())->isa_oopptr();
- Node *acast = new (_compile, 2) CastPPNode(adr, new_atype);
- acast->set_req(0, adr->in(0));
- igvn->set_type(acast, new_atype);
- record_for_optimizer(acast);
- Node *bcast = acast;
- Node *abase = addp->in(AddPNode::Base);
- if (abase != adr) {
- bcast = new (_compile, 2) CastPPNode(abase, base_t);
- bcast->set_req(0, abase->in(0));
- igvn->set_type(bcast, base_t);
- record_for_optimizer(bcast);
+
+ // Set addp's Base and Address to 'base'.
+ Node *abase = addp->in(AddPNode::Base);
+ Node *adr = addp->in(AddPNode::Address);
+ if (adr->is_Proj() && adr->in(0)->is_Allocate() &&
+ adr->in(0)->_idx == (uint)inst_id) {
+ // Skip AddP cases #3 and #5.
+ } else {
+ assert(!abase->is_top(), "sanity"); // AddP case #3
+ if (abase != base) {
+ igvn->hash_delete(addp);
+ addp->set_req(AddPNode::Base, base);
+ if (abase == adr) {
+ addp->set_req(AddPNode::Address, base);
+ } else {
+ // AddP case #4 (adr is array's element offset AddP node)
+#ifdef ASSERT
+ const TypeOopPtr *atype = igvn->type(adr)->isa_oopptr();
+ assert(adr->is_AddP() && atype != NULL &&
+ atype->instance_id() == inst_id, "array's element offset should be processed first");
+#endif
+ }
+ igvn->hash_insert(addp);
}
- igvn->hash_delete(addp);
- addp->set_req(AddPNode::Base, bcast);
- addp->set_req(AddPNode::Address, acast);
- igvn->hash_insert(addp);
}
// Put on IGVN worklist since at least addp's type was changed above.
record_for_optimizer(addp);
@@ -664,27 +676,31 @@
Compile* C = phase->C;
const TypeOopPtr *tinst = C->get_adr_type(alias_idx)->isa_oopptr();
bool is_instance = (tinst != NULL) && tinst->is_known_instance();
+ Node *start_mem = C->start()->proj_out(TypeFunc::Memory);
Node *prev = NULL;
Node *result = orig_mem;
while (prev != result) {
prev = result;
+ if (result == start_mem)
+ break; // hit one of our sentinals
if (result->is_Mem()) {
- MemNode *mem = result->as_Mem();
- const Type *at = phase->type(mem->in(MemNode::Address));
+ const Type *at = phase->type(result->in(MemNode::Address));
if (at != Type::TOP) {
assert (at->isa_ptr() != NULL, "pointer type required.");
int idx = C->get_alias_index(at->is_ptr());
if (idx == alias_idx)
break;
}
- result = mem->in(MemNode::Memory);
+ result = result->in(MemNode::Memory);
}
if (!is_instance)
continue; // don't search further for non-instance types
// skip over a call which does not affect this memory slice
if (result->is_Proj() && result->as_Proj()->_con == TypeFunc::Memory) {
Node *proj_in = result->in(0);
- if (proj_in->is_Call()) {
+ if (proj_in->is_Allocate() && proj_in->_idx == (uint)tinst->instance_id()) {
+ break; // hit one of our sentinals
+ } else if (proj_in->is_Call()) {
CallNode *call = proj_in->as_Call();
if (!call->may_modify(tinst, phase)) {
result = call->in(TypeFunc::Memory);
@@ -721,12 +737,17 @@
}
}
}
- if (is_instance && result->is_Phi()) {
+ if (result->is_Phi()) {
PhiNode *mphi = result->as_Phi();
assert(mphi->bottom_type() == Type::MEMORY, "memory phi required");
const TypePtr *t = mphi->adr_type();
if (C->get_alias_index(t) != alias_idx) {
+ // Create a new Phi with the specified alias index type.
result = split_memory_phi(mphi, alias_idx, orig_phis, phase);
+ } else if (!is_instance) {
+ // Push all non-instance Phis on the orig_phis worklist to update inputs
+ // during Phase 4 if needed.
+ orig_phis.append_if_missing(mphi);
}
}
// the result is either MemNode, PhiNode, InitializeNode.
@@ -835,6 +856,11 @@
// Phase 1: Process possible allocations from alloc_worklist.
// Create instance types for the CheckCastPP for allocations where possible.
+ //
+ // (Note: don't forget to change the order of the second AddP node on
+ // the alloc_worklist if the order of the worklist processing is changed,
+ // see the comment in find_second_addp().)
+ //
while (alloc_worklist.length() != 0) {
Node *n = alloc_worklist.pop();
uint ni = n->_idx;
@@ -842,7 +868,7 @@
if (n->is_Call()) {
CallNode *alloc = n->as_Call();
// copy escape information to call node
- PointsToNode* ptn = _nodes->adr_at(alloc->_idx);
+ PointsToNode* ptn = ptnode_adr(alloc->_idx);
PointsToNode::EscapeState es = escape_state(alloc, igvn);
// We have an allocation or call which returns a Java object,
// see if it is unescaped.
@@ -858,10 +884,14 @@
!n->is_CheckCastPP()) // not unique CheckCastPP.
continue;
// The inline code for Object.clone() casts the allocation result to
- // java.lang.Object and then to the the actual type of the allocated
+ // java.lang.Object and then to the actual type of the allocated
// object. Detect this case and use the second cast.
+ // Also detect j.l.reflect.Array.newInstance(jobject, jint) case when
+ // the allocation result is cast to java.lang.Object and then
+ // to the actual Array type.
if (alloc->is_Allocate() && n->as_Type()->type() == TypeInstPtr::NOTNULL
- && igvn->type(alloc->in(AllocateNode::KlassNode)) != TypeKlassPtr::OBJECT) {
+ && (alloc->is_AllocateArray() ||
+ igvn->type(alloc->in(AllocateNode::KlassNode)) != TypeKlassPtr::OBJECT)) {
Node *cast2 = NULL;
for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
Node *use = n->fast_out(i);
@@ -877,7 +907,7 @@
}
}
set_escape_state(n->_idx, es);
- // in order for an object to be stackallocatable, it must be:
+ // in order for an object to be scalar-replaceable, it must be:
// - a direct allocation (not a call returning an object)
// - non-escaping
// - eligible to be a unique type
@@ -887,7 +917,7 @@
const TypeOopPtr *t = igvn->type(n)->isa_oopptr();
if (t == NULL)
continue; // not a TypeInstPtr
- tinst = t->cast_to_instance_id(ni);
+ tinst = t->cast_to_exactness(true)->is_oopptr()->cast_to_instance_id(ni);
igvn->hash_delete(n);
igvn->set_type(n, tinst);
n->raise_bottom_type(tinst);
@@ -899,7 +929,7 @@
// First, put on the worklist all Field edges from Connection Graph
// which is more accurate then putting immediate users from Ideal Graph.
for (uint e = 0; e < ptn->edge_count(); e++) {
- Node *use = _nodes->adr_at(ptn->edge_target(e))->_node;
+ Node *use = ptnode_adr(ptn->edge_target(e))->_node;
assert(ptn->edge_type(e) == PointsToNode::FieldEdge && use->is_AddP(),
"only AddP nodes are Field edges in CG");
if (use->outcnt() > 0) { // Don't process dead nodes
@@ -996,12 +1026,12 @@
memnode_worklist.append_if_missing(use);
} else if (use->is_MergeMem()) {
mergemem_worklist.append_if_missing(use);
- } else if (use->is_Call() && tinst != NULL) {
+ } else if (use->is_SafePoint() && tinst != NULL) {
// Look for MergeMem nodes for calls which reference unique allocation
// (through CheckCastPP nodes) even for debug info.
Node* m = use->in(TypeFunc::Memory);
uint iid = tinst->instance_id();
- while (m->is_Proj() && m->in(0)->is_Call() &&
+ while (m->is_Proj() && m->in(0)->is_SafePoint() &&
m->in(0) != use && !m->in(0)->_idx != iid) {
m = m->in(0)->in(TypeFunc::Memory);
}
@@ -1062,7 +1092,7 @@
}
if (mem != n->in(MemNode::Memory)) {
set_map(n->_idx, mem);
- _nodes->adr_at(n->_idx)->_node = n;
+ ptnode_adr(n->_idx)->_node = n;
}
if (n->is_Load()) {
continue; // don't push users
@@ -1203,8 +1233,8 @@
// to recursively process Phi's encounted on the input memory
// chains as is done in split_memory_phi() since they will
// also be processed here.
- while (orig_phis.length() != 0) {
- PhiNode *phi = orig_phis.pop();
+ for (int j = 0; j < orig_phis.length(); j++) {
+ PhiNode *phi = orig_phis.at(j);
int alias_idx = _compile->get_alias_index(phi->adr_type());
igvn->hash_delete(phi);
for (uint i = 1; i < phi->req(); i++) {
@@ -1223,10 +1253,10 @@
// Update the memory inputs of MemNodes with the value we computed
// in Phase 2.
- for (int i = 0; i < _nodes->length(); i++) {
+ for (uint i = 0; i < nodes_size(); i++) {
Node *nmem = get_map(i);
if (nmem != NULL) {
- Node *n = _nodes->adr_at(i)->_node;
+ Node *n = ptnode_adr(i)->_node;
if (n != NULL && n->is_Mem()) {
igvn->hash_delete(n);
n->set_req(MemNode::Memory, nmem);
@@ -1237,28 +1267,48 @@
}
}
-void ConnectionGraph::compute_escape() {
+bool ConnectionGraph::has_candidates(Compile *C) {
+ // EA brings benefits only when the code has allocations and/or locks which
+ // are represented by ideal Macro nodes.
+ int cnt = C->macro_count();
+ for( int i=0; i < cnt; i++ ) {
+ Node *n = C->macro_node(i);
+ if ( n->is_Allocate() )
+ return true;
+ if( n->is_Lock() ) {
+ Node* obj = n->as_Lock()->obj_node()->uncast();
+ if( !(obj->is_Parm() || obj->is_Con()) )
+ return true;
+ }
+ }
+ return false;
+}
+
+bool ConnectionGraph::compute_escape() {
+ Compile* C = _compile;
// 1. Populate Connection Graph (CG) with Ideal nodes.
Unique_Node_List worklist_init;
- worklist_init.map(_compile->unique(), NULL); // preallocate space
+ worklist_init.map(C->unique(), NULL); // preallocate space
// Initialize worklist
- if (_compile->root() != NULL) {
- worklist_init.push(_compile->root());
+ if (C->root() != NULL) {
+ worklist_init.push(C->root());
}
GrowableArray<int> cg_worklist;
- PhaseGVN* igvn = _compile->initial_gvn();
+ PhaseGVN* igvn = C->initial_gvn();
bool has_allocations = false;
// Push all useful nodes onto CG list and set their type.
for( uint next = 0; next < worklist_init.size(); ++next ) {
Node* n = worklist_init.at(next);
record_for_escape_analysis(n, igvn);
- if (n->is_Call() &&
- _nodes->adr_at(n->_idx)->node_type() == PointsToNode::JavaObject) {
+ // Only allocations and java static calls results are checked
+ // for an escape status. See process_call_result() below.
+ if (n->is_Allocate() || n->is_CallStaticJava() &&
+ ptnode_adr(n->_idx)->node_type() == PointsToNode::JavaObject) {
has_allocations = true;
}
if(n->is_AddP())
@@ -1269,24 +1319,23 @@
}
}
- if (has_allocations) {
- _has_allocations = true;
- } else {
- _has_allocations = false;
+ if (!has_allocations) {
_collecting = false;
- return; // Nothing to do.
+ return false; // Nothing to do.
}
// 2. First pass to create simple CG edges (doesn't require to walk CG).
- for( uint next = 0; next < _delayed_worklist.size(); ++next ) {
+ uint delayed_size = _delayed_worklist.size();
+ for( uint next = 0; next < delayed_size; ++next ) {
Node* n = _delayed_worklist.at(next);
build_connection_graph(n, igvn);
}
// 3. Pass to create fields edges (Allocate -F-> AddP).
- for( int next = 0; next < cg_worklist.length(); ++next ) {
+ uint cg_length = cg_worklist.length();
+ for( uint next = 0; next < cg_length; ++next ) {
int ni = cg_worklist.at(next);
- build_connection_graph(_nodes->adr_at(ni)->_node, igvn);
+ build_connection_graph(ptnode_adr(ni)->_node, igvn);
}
cg_worklist.clear();
@@ -1294,8 +1343,8 @@
// 4. Build Connection Graph which need
// to walk the connection graph.
- for (uint ni = 0; ni < (uint)_nodes->length(); ni++) {
- PointsToNode* ptn = _nodes->adr_at(ni);
+ for (uint ni = 0; ni < nodes_size(); ni++) {
+ PointsToNode* ptn = ptnode_adr(ni);
Node *n = ptn->_node;
if (n != NULL) { // Call, AddP, LoadP, StoreP
build_connection_graph(n, igvn);
@@ -1305,140 +1354,226 @@
}
VectorSet ptset(Thread::current()->resource_area());
- GrowableArray<Node*> alloc_worklist;
- GrowableArray<int> worklist;
GrowableArray<uint> deferred_edges;
VectorSet visited(Thread::current()->resource_area());
- // remove deferred edges from the graph and collect
- // information we will need for type splitting
- for( int next = 0; next < cg_worklist.length(); ++next ) {
+ // 5. Remove deferred edges from the graph and collect
+ // information needed for type splitting.
+ cg_length = cg_worklist.length();
+ for( uint next = 0; next < cg_length; ++next ) {
int ni = cg_worklist.at(next);
- PointsToNode* ptn = _nodes->adr_at(ni);
+ PointsToNode* ptn = ptnode_adr(ni);
PointsToNode::NodeType nt = ptn->node_type();
- Node *n = ptn->_node;
if (nt == PointsToNode::LocalVar || nt == PointsToNode::Field) {
remove_deferred(ni, &deferred_edges, &visited);
+ Node *n = ptn->_node;
if (n->is_AddP()) {
- // If this AddP computes an address which may point to more that one
- // object or more then one field (array's element), nothing the address
- // points to can be scalar replaceable.
+ // Search for objects which are not scalar replaceable.
+ // Mark their escape state as ArgEscape to propagate the state
+ // to referenced objects.
+ // Note: currently there are no difference in compiler optimizations
+ // for ArgEscape objects and NoEscape objects which are not
+ // scalar replaceable.
+
+ int offset = ptn->offset();
Node *base = get_addp_base(n);
ptset.Clear();
PointsTo(ptset, base, igvn);
- if (ptset.Size() > 1 ||
- (ptset.Size() != 0 && ptn->offset() == Type::OffsetBot)) {
+ int ptset_size = ptset.Size();
+
+ // Check if a field's initializing value is recorded and add
+ // a corresponding NULL field's value if it is not recorded.
+ // Connection Graph does not record a default initialization by NULL
+ // captured by Initialize node.
+ //
+ // Note: it will disable scalar replacement in some cases:
+ //
+ // Point p[] = new Point[1];
+ // p[0] = new Point(); // Will be not scalar replaced
+ //
+ // but it will save us from incorrect optimizations in next cases:
+ //
+ // Point p[] = new Point[1];
+ // if ( x ) p[0] = new Point(); // Will be not scalar replaced
+ //
+ // Without a control flow analysis we can't distinguish above cases.
+ //
+ if (offset != Type::OffsetBot && ptset_size == 1) {
+ uint elem = ptset.getelem(); // Allocation node's index
+ // It does not matter if it is not Allocation node since
+ // only non-escaping allocations are scalar replaced.
+ if (ptnode_adr(elem)->_node->is_Allocate() &&
+ ptnode_adr(elem)->escape_state() == PointsToNode::NoEscape) {
+ AllocateNode* alloc = ptnode_adr(elem)->_node->as_Allocate();
+ InitializeNode* ini = alloc->initialization();
+ Node* value = NULL;
+ if (ini != NULL) {
+ BasicType ft = UseCompressedOops ? T_NARROWOOP : T_OBJECT;
+ Node* store = ini->find_captured_store(offset, type2aelembytes(ft), igvn);
+ if (store != NULL && store->is_Store())
+ value = store->in(MemNode::ValueIn);
+ }
+ if (value == NULL || value != ptnode_adr(value->_idx)->_node) {
+ // A field's initializing value was not recorded. Add NULL.
+ uint null_idx = UseCompressedOops ? _noop_null : _oop_null;
+ add_pointsto_edge(ni, null_idx);
+ }
+ }
+ }
+
+ // An object is not scalar replaceable if the field which may point
+ // to it has unknown offset (unknown element of an array of objects).
+ //
+ if (offset == Type::OffsetBot) {
+ uint e_cnt = ptn->edge_count();
+ for (uint ei = 0; ei < e_cnt; ei++) {
+ uint npi = ptn->edge_target(ei);
+ set_escape_state(npi, PointsToNode::ArgEscape);
+ ptnode_adr(npi)->_scalar_replaceable = false;
+ }
+ }
+
+ // Currently an object is not scalar replaceable if a LoadStore node
+ // access its field since the field value is unknown after it.
+ //
+ bool has_LoadStore = false;
+ for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
+ Node *use = n->fast_out(i);
+ if (use->is_LoadStore()) {
+ has_LoadStore = true;
+ break;
+ }
+ }
+ // An object is not scalar replaceable if the address points
+ // to unknown field (unknown element for arrays, offset is OffsetBot).
+ //
+ // Or the address may point to more then one object. This may produce
+ // the false positive result (set scalar_replaceable to false)
+ // since the flow-insensitive escape analysis can't separate
+ // the case when stores overwrite the field's value from the case
+ // when stores happened on different control branches.
+ //
+ if (ptset_size > 1 || ptset_size != 0 &&
+ (has_LoadStore || offset == Type::OffsetBot)) {
for( VectorSetI j(&ptset); j.test(); ++j ) {
- uint pt = j.elem;
- ptnode_adr(pt)->_scalar_replaceable = false;
+ set_escape_state(j.elem, PointsToNode::ArgEscape);
+ ptnode_adr(j.elem)->_scalar_replaceable = false;
}
}
}
- } else if (nt == PointsToNode::JavaObject && n->is_Call()) {
- // Push call on alloc_worlist (alocations are calls)
- // for processing by split_unique_types().
- alloc_worklist.append(n);
}
}
+ // 6. Propagate escape states.
+ GrowableArray<int> worklist;
+ bool has_non_escaping_obj = false;
+
// push all GlobalEscape nodes on the worklist
- for( int next = 0; next < cg_worklist.length(); ++next ) {
+ for( uint next = 0; next < cg_length; ++next ) {
int nk = cg_worklist.at(next);
- if (_nodes->adr_at(nk)->escape_state() == PointsToNode::GlobalEscape)
- worklist.append(nk);
+ if (ptnode_adr(nk)->escape_state() == PointsToNode::GlobalEscape)
+ worklist.push(nk);
}
- // mark all node reachable from GlobalEscape nodes
+ // mark all nodes reachable from GlobalEscape nodes
while(worklist.length() > 0) {
- PointsToNode n = _nodes->at(worklist.pop());
- for (uint ei = 0; ei < n.edge_count(); ei++) {
- uint npi = n.edge_target(ei);
+ PointsToNode* ptn = ptnode_adr(worklist.pop());
+ uint e_cnt = ptn->edge_count();
+ for (uint ei = 0; ei < e_cnt; ei++) {
+ uint npi = ptn->edge_target(ei);
PointsToNode *np = ptnode_adr(npi);
if (np->escape_state() < PointsToNode::GlobalEscape) {
np->set_escape_state(PointsToNode::GlobalEscape);
- worklist.append_if_missing(npi);
+ worklist.push(npi);
}
}
}
// push all ArgEscape nodes on the worklist
- for( int next = 0; next < cg_worklist.length(); ++next ) {
+ for( uint next = 0; next < cg_length; ++next ) {
int nk = cg_worklist.at(next);
- if (_nodes->adr_at(nk)->escape_state() == PointsToNode::ArgEscape)
+ if (ptnode_adr(nk)->escape_state() == PointsToNode::ArgEscape)
worklist.push(nk);
}
- // mark all node reachable from ArgEscape nodes
+ // mark all nodes reachable from ArgEscape nodes
while(worklist.length() > 0) {
- PointsToNode n = _nodes->at(worklist.pop());
- for (uint ei = 0; ei < n.edge_count(); ei++) {
- uint npi = n.edge_target(ei);
+ PointsToNode* ptn = ptnode_adr(worklist.pop());
+ if (ptn->node_type() == PointsToNode::JavaObject)
+ has_non_escaping_obj = true; // Non GlobalEscape
+ uint e_cnt = ptn->edge_count();
+ for (uint ei = 0; ei < e_cnt; ei++) {
+ uint npi = ptn->edge_target(ei);
PointsToNode *np = ptnode_adr(npi);
if (np->escape_state() < PointsToNode::ArgEscape) {
np->set_escape_state(PointsToNode::ArgEscape);
- worklist.append_if_missing(npi);
+ worklist.push(npi);
}
}
}
+ GrowableArray<Node*> alloc_worklist;
+
// push all NoEscape nodes on the worklist
- for( int next = 0; next < cg_worklist.length(); ++next ) {
+ for( uint next = 0; next < cg_length; ++next ) {
int nk = cg_worklist.at(next);
- if (_nodes->adr_at(nk)->escape_state() == PointsToNode::NoEscape)
+ if (ptnode_adr(nk)->escape_state() == PointsToNode::NoEscape)
worklist.push(nk);
}
- // mark all node reachable from NoEscape nodes
+ // mark all nodes reachable from NoEscape nodes
while(worklist.length() > 0) {
- PointsToNode n = _nodes->at(worklist.pop());
- for (uint ei = 0; ei < n.edge_count(); ei++) {
- uint npi = n.edge_target(ei);
+ PointsToNode* ptn = ptnode_adr(worklist.pop());
+ if (ptn->node_type() == PointsToNode::JavaObject)
+ has_non_escaping_obj = true; // Non GlobalEscape
+ Node* n = ptn->_node;
+ if (n->is_Allocate() && ptn->_scalar_replaceable ) {
+ // Push scalar replaceable alocations on alloc_worklist
+ // for processing in split_unique_types().
+ alloc_worklist.append(n);
+ }
+ uint e_cnt = ptn->edge_count();
+ for (uint ei = 0; ei < e_cnt; ei++) {
+ uint npi = ptn->edge_target(ei);
PointsToNode *np = ptnode_adr(npi);
if (np->escape_state() < PointsToNode::NoEscape) {
np->set_escape_state(PointsToNode::NoEscape);
- worklist.append_if_missing(npi);
+ worklist.push(npi);
}
}
}
_collecting = false;
+ assert(C->unique() == nodes_size(), "there should be no new ideal nodes during ConnectionGraph build");
- has_allocations = false; // Are there scalar replaceable allocations?
+ bool has_scalar_replaceable_candidates = alloc_worklist.length() > 0;
+ if ( has_scalar_replaceable_candidates &&
+ C->AliasLevel() >= 3 && EliminateAllocations ) {
- for( int next = 0; next < alloc_worklist.length(); ++next ) {
- Node* n = alloc_worklist.at(next);
- uint ni = n->_idx;
- PointsToNode* ptn = _nodes->adr_at(ni);
- PointsToNode::EscapeState es = ptn->escape_state();
- if (ptn->escape_state() == PointsToNode::NoEscape &&
- ptn->_scalar_replaceable) {
- has_allocations = true;
- break;
- }
- }
- if (!has_allocations) {
- return; // Nothing to do.
- }
+ // Now use the escape information to create unique types for
+ // scalar replaceable objects.
+ split_unique_types(alloc_worklist);
- if(_compile->AliasLevel() >= 3 && EliminateAllocations) {
- // Now use the escape information to create unique types for
- // unescaped objects
- split_unique_types(alloc_worklist);
- if (_compile->failing()) return;
+ if (C->failing()) return false;
// Clean up after split unique types.
ResourceMark rm;
- PhaseRemoveUseless pru(_compile->initial_gvn(), _compile->for_igvn());
+ PhaseRemoveUseless pru(C->initial_gvn(), C->for_igvn());
+
+ C->print_method("After Escape Analysis", 2);
#ifdef ASSERT
- } else if (PrintEscapeAnalysis || PrintEliminateAllocations) {
+ } else if (Verbose && (PrintEscapeAnalysis || PrintEliminateAllocations)) {
tty->print("=== No allocations eliminated for ");
- C()->method()->print_short_name();
+ C->method()->print_short_name();
if(!EliminateAllocations) {
tty->print(" since EliminateAllocations is off ===");
- } else if(_compile->AliasLevel() < 3) {
+ } else if(!has_scalar_replaceable_candidates) {
+ tty->print(" since there are no scalar replaceable candidates ===");
+ } else if(C->AliasLevel() < 3) {
tty->print(" since AliasLevel < 3 ===");
}
tty->cr();
#endif
}
+ return has_non_escaping_obj;
}
void ConnectionGraph::process_call_arguments(CallNode *call, PhaseTransform *phase) {
@@ -1538,7 +1673,7 @@
}
}
if (copy_dependencies)
- call_analyzer->copy_dependencies(C()->dependencies());
+ call_analyzer->copy_dependencies(_compile->dependencies());
break;
}
}
@@ -1561,7 +1696,6 @@
for( VectorSetI j(&ptset); j.test(); ++j ) {
uint pt = j.elem;
set_escape_state(pt, PointsToNode::GlobalEscape);
- PointsToNode *ptadr = ptnode_adr(pt);
}
}
}
@@ -1569,9 +1703,10 @@
}
}
void ConnectionGraph::process_call_result(ProjNode *resproj, PhaseTransform *phase) {
- PointsToNode *ptadr = ptnode_adr(resproj->_idx);
+ CallNode *call = resproj->in(0)->as_Call();
+ uint call_idx = call->_idx;
+ uint resproj_idx = resproj->_idx;
- CallNode *call = resproj->in(0)->as_Call();
switch (call->Opcode()) {
case Op_Allocate:
{
@@ -1587,7 +1722,6 @@
ciKlass* cik = kt->klass();
ciInstanceKlass* ciik = cik->as_instance_klass();
- PointsToNode *ptadr = ptnode_adr(call->_idx);
PointsToNode::EscapeState es;
uint edge_to;
if (cik->is_subclass_of(_compile->env()->Thread_klass()) || ciik->has_finalizer()) {
@@ -1595,25 +1729,24 @@
edge_to = _phantom_object; // Could not be worse
} else {
es = PointsToNode::NoEscape;
- edge_to = call->_idx;
+ edge_to = call_idx;
}
- set_escape_state(call->_idx, es);
- add_pointsto_edge(resproj->_idx, edge_to);
- _processed.set(resproj->_idx);
+ set_escape_state(call_idx, es);
+ add_pointsto_edge(resproj_idx, edge_to);
+ _processed.set(resproj_idx);
break;
}
case Op_AllocateArray:
{
- PointsToNode *ptadr = ptnode_adr(call->_idx);
int length = call->in(AllocateNode::ALength)->find_int_con(-1);
if (length < 0 || length > EliminateAllocationArraySizeLimit) {
// Not scalar replaceable if the length is not constant or too big.
- ptadr->_scalar_replaceable = false;
+ ptnode_adr(call_idx)->_scalar_replaceable = false;
}
- set_escape_state(call->_idx, PointsToNode::NoEscape);
- add_pointsto_edge(resproj->_idx, call->_idx);
- _processed.set(resproj->_idx);
+ set_escape_state(call_idx, PointsToNode::NoEscape);
+ add_pointsto_edge(resproj_idx, call_idx);
+ _processed.set(resproj_idx);
break;
}
@@ -1631,19 +1764,17 @@
// Note: we use isa_ptr() instead of isa_oopptr() here because the
// _multianewarray functions return a TypeRawPtr.
if (ret_type == NULL || ret_type->isa_ptr() == NULL) {
- _processed.set(resproj->_idx);
+ _processed.set(resproj_idx);
break; // doesn't return a pointer type
}
ciMethod *meth = call->as_CallJava()->method();
const TypeTuple * d = call->tf()->domain();
if (meth == NULL) {
// not a Java method, assume global escape
- set_escape_state(call->_idx, PointsToNode::GlobalEscape);
- if (resproj != NULL)
- add_pointsto_edge(resproj->_idx, _phantom_object);
+ set_escape_state(call_idx, PointsToNode::GlobalEscape);
+ add_pointsto_edge(resproj_idx, _phantom_object);
} else {
BCEscapeAnalyzer *call_analyzer = meth->get_bcea();
- VectorSet ptset(Thread::current()->resource_area());
bool copy_dependencies = false;
if (call_analyzer->is_return_allocated()) {
@@ -1651,13 +1782,12 @@
// update dependency information.
// Mark it as NoEscape so that objects referenced by
// it's fields will be marked as NoEscape at least.
- set_escape_state(call->_idx, PointsToNode::NoEscape);
- if (resproj != NULL)
- add_pointsto_edge(resproj->_idx, call->_idx);
+ set_escape_state(call_idx, PointsToNode::NoEscape);
+ add_pointsto_edge(resproj_idx, call_idx);
copy_dependencies = true;
- } else if (call_analyzer->is_return_local() && resproj != NULL) {
+ } else if (call_analyzer->is_return_local()) {
// determine whether any arguments are returned
- set_escape_state(call->_idx, PointsToNode::NoEscape);
+ set_escape_state(call_idx, PointsToNode::NoEscape);
for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
const Type* at = d->field_at(i);
@@ -1665,36 +1795,35 @@
Node *arg = call->in(i)->uncast();
if (call_analyzer->is_arg_returned(i - TypeFunc::Parms)) {
- PointsToNode *arg_esp = _nodes->adr_at(arg->_idx);
+ PointsToNode *arg_esp = ptnode_adr(arg->_idx);
if (arg_esp->node_type() == PointsToNode::UnknownType)
done = false;
else if (arg_esp->node_type() == PointsToNode::JavaObject)
- add_pointsto_edge(resproj->_idx, arg->_idx);
+ add_pointsto_edge(resproj_idx, arg->_idx);
else
- add_deferred_edge(resproj->_idx, arg->_idx);
+ add_deferred_edge(resproj_idx, arg->_idx);
arg_esp->_hidden_alias = true;
}
}
}
copy_dependencies = true;
} else {
- set_escape_state(call->_idx, PointsToNode::GlobalEscape);
- if (resproj != NULL)
- add_pointsto_edge(resproj->_idx, _phantom_object);
+ set_escape_state(call_idx, PointsToNode::GlobalEscape);
+ add_pointsto_edge(resproj_idx, _phantom_object);
for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
const Type* at = d->field_at(i);
if (at->isa_oopptr() != NULL) {
Node *arg = call->in(i)->uncast();
- PointsToNode *arg_esp = _nodes->adr_at(arg->_idx);
+ PointsToNode *arg_esp = ptnode_adr(arg->_idx);
arg_esp->_hidden_alias = true;
}
}
}
if (copy_dependencies)
- call_analyzer->copy_dependencies(C()->dependencies());
+ call_analyzer->copy_dependencies(_compile->dependencies());
}
if (done)
- _processed.set(resproj->_idx);
+ _processed.set(resproj_idx);
break;
}
@@ -1709,13 +1838,11 @@
// Note: we use isa_ptr() instead of isa_oopptr() here because the
// _multianewarray functions return a TypeRawPtr.
if (ret_type->isa_ptr() != NULL) {
- PointsToNode *ptadr = ptnode_adr(call->_idx);
- set_escape_state(call->_idx, PointsToNode::GlobalEscape);
- if (resproj != NULL)
- add_pointsto_edge(resproj->_idx, _phantom_object);
+ set_escape_state(call_idx, PointsToNode::GlobalEscape);
+ add_pointsto_edge(resproj_idx, _phantom_object);
}
}
- _processed.set(resproj->_idx);
+ _processed.set(resproj_idx);
}
}
}
@@ -1743,7 +1870,7 @@
// Check if a call returns an object.
const TypeTuple *r = n->as_Call()->tf()->range();
- if (r->cnt() > TypeFunc::Parms &&
+ if (n->is_CallStaticJava() && r->cnt() > TypeFunc::Parms &&
n->as_Call()->proj_out(TypeFunc::Parms) != NULL) {
// Note: use isa_ptr() instead of isa_oopptr() here because
// the _multianewarray functions return a TypeRawPtr.
@@ -1776,7 +1903,7 @@
{
add_node(n, PointsToNode::LocalVar, PointsToNode::UnknownEscape, false);
int ti = n->in(1)->_idx;
- PointsToNode::NodeType nt = _nodes->adr_at(ti)->node_type();
+ PointsToNode::NodeType nt = ptnode_adr(ti)->node_type();
if (nt == PointsToNode::UnknownType) {
_delayed_worklist.push(n); // Process it later.
break;
@@ -1828,7 +1955,7 @@
case Op_LoadN:
{
const Type *t = phase->type(n);
- if (!t->isa_narrowoop() && t->isa_ptr() == NULL) {
+ if (t->make_ptr() == NULL) {
_processed.set(n->_idx);
return;
}
@@ -1851,8 +1978,9 @@
}
case Op_Phi:
{
- if (n->as_Phi()->type()->isa_ptr() == NULL) {
- // nothing to do if not an oop
+ const Type *t = n->as_Phi()->type();
+ if (t->make_ptr() == NULL) {
+ // nothing to do if not an oop or narrow oop
_processed.set(n->_idx);
return;
}
@@ -1866,7 +1994,7 @@
if (in->is_top() || in == n)
continue; // ignore top or inputs which go back this node
int ti = in->_idx;
- PointsToNode::NodeType nt = _nodes->adr_at(ti)->node_type();
+ PointsToNode::NodeType nt = ptnode_adr(ti)->node_type();
if (nt == PointsToNode::UnknownType) {
break;
} else if (nt == PointsToNode::JavaObject) {
@@ -1904,7 +2032,7 @@
// Treat Return value as LocalVar with GlobalEscape escape state.
add_node(n, PointsToNode::LocalVar, PointsToNode::GlobalEscape, false);
int ti = n->in(TypeFunc::Parms)->_idx;
- PointsToNode::NodeType nt = _nodes->adr_at(ti)->node_type();
+ PointsToNode::NodeType nt = ptnode_adr(ti)->node_type();
if (nt == PointsToNode::UnknownType) {
_delayed_worklist.push(n); // Process it later.
break;
@@ -1968,17 +2096,17 @@
}
void ConnectionGraph::build_connection_graph(Node *n, PhaseTransform *phase) {
+ uint n_idx = n->_idx;
+
// Don't set processed bit for AddP, LoadP, StoreP since
// they may need more then one pass to process.
- if (_processed.test(n->_idx))
+ if (_processed.test(n_idx))
return; // No need to redefine node's state.
- PointsToNode *ptadr = ptnode_adr(n->_idx);
-
if (n->is_Call()) {
CallNode *call = n->as_Call();
process_call_arguments(call, phase);
- _processed.set(n->_idx);
+ _processed.set(n_idx);
return;
}
@@ -1991,7 +2119,7 @@
PointsTo(ptset, base, phase);
for( VectorSetI i(&ptset); i.test(); ++i ) {
uint pt = i.elem;
- add_field_edge(pt, n->_idx, address_offset(n, phase));
+ add_field_edge(pt, n_idx, address_offset(n, phase));
}
break;
}
@@ -2006,12 +2134,12 @@
case Op_DecodeN:
{
int ti = n->in(1)->_idx;
- if (_nodes->adr_at(ti)->node_type() == PointsToNode::JavaObject) {
- add_pointsto_edge(n->_idx, ti);
+ if (ptnode_adr(ti)->node_type() == PointsToNode::JavaObject) {
+ add_pointsto_edge(n_idx, ti);
} else {
- add_deferred_edge(n->_idx, ti);
+ add_deferred_edge(n_idx, ti);
}
- _processed.set(n->_idx);
+ _processed.set(n_idx);
break;
}
case Op_ConP:
@@ -2040,7 +2168,7 @@
{
const Type *t = phase->type(n);
#ifdef ASSERT
- if (!t->isa_narrowoop() && t->isa_ptr() == NULL)
+ if (t->make_ptr() == NULL)
assert(false, "Op_LoadP");
#endif
@@ -2060,7 +2188,7 @@
int offset = address_offset(adr, phase);
for( VectorSetI i(&ptset); i.test(); ++i ) {
uint pt = i.elem;
- add_deferred_edge_to_fields(n->_idx, pt, offset);
+ add_deferred_edge_to_fields(n_idx, pt, offset);
}
break;
}
@@ -2072,7 +2200,8 @@
case Op_Phi:
{
#ifdef ASSERT
- if (n->as_Phi()->type()->isa_ptr() == NULL)
+ const Type *t = n->as_Phi()->type();
+ if (t->make_ptr() == NULL)
assert(false, "Op_Phi");
#endif
for (uint i = 1; i < n->req() ; i++) {
@@ -2083,13 +2212,13 @@
if (in->is_top() || in == n)
continue; // ignore top or inputs which go back this node
int ti = in->_idx;
- if (_nodes->adr_at(in->_idx)->node_type() == PointsToNode::JavaObject) {
- add_pointsto_edge(n->_idx, ti);
+ if (ptnode_adr(in->_idx)->node_type() == PointsToNode::JavaObject) {
+ add_pointsto_edge(n_idx, ti);
} else {
- add_deferred_edge(n->_idx, ti);
+ add_deferred_edge(n_idx, ti);
}
}
- _processed.set(n->_idx);
+ _processed.set(n_idx);
break;
}
case Op_Proj:
@@ -2097,7 +2226,7 @@
// we are only interested in the result projection from a call
if (n->as_Proj()->_con == TypeFunc::Parms && n->in(0)->is_Call() ) {
process_call_result(n->as_Proj(), phase);
- assert(_processed.test(n->_idx), "all call results should be processed");
+ assert(_processed.test(n_idx), "all call results should be processed");
} else {
assert(false, "Op_Proj");
}
@@ -2112,12 +2241,12 @@
}
#endif
int ti = n->in(TypeFunc::Parms)->_idx;
- if (_nodes->adr_at(ti)->node_type() == PointsToNode::JavaObject) {
- add_pointsto_edge(n->_idx, ti);
+ if (ptnode_adr(ti)->node_type() == PointsToNode::JavaObject) {
+ add_pointsto_edge(n_idx, ti);
} else {
- add_deferred_edge(n->_idx, ti);
+ add_deferred_edge(n_idx, ti);
}
- _processed.set(n->_idx);
+ _processed.set(n_idx);
break;
}
case Op_StoreP:
@@ -2162,9 +2291,9 @@
PhaseGVN *igvn = _compile->initial_gvn();
bool first = true;
- uint size = (uint)_nodes->length();
+ uint size = nodes_size();
for (uint ni = 0; ni < size; ni++) {
- PointsToNode *ptn = _nodes->adr_at(ni);
+ PointsToNode *ptn = ptnode_adr(ni);
PointsToNode::NodeType ptn_type = ptn->node_type();
if (ptn_type != PointsToNode::JavaObject || ptn->_node == NULL)
@@ -2174,7 +2303,7 @@
if (first) {
tty->cr();
tty->print("======== Connection graph for ");
- C()->method()->print_short_name();
+ _compile->method()->print_short_name();
tty->cr();
first = false;
}
@@ -2182,20 +2311,18 @@
ptn->dump();
// Print all locals which reference this allocation
for (uint li = ni; li < size; li++) {
- PointsToNode *ptn_loc = _nodes->adr_at(li);
+ PointsToNode *ptn_loc = ptnode_adr(li);
PointsToNode::NodeType ptn_loc_type = ptn_loc->node_type();
if ( ptn_loc_type == PointsToNode::LocalVar && ptn_loc->_node != NULL &&
ptn_loc->edge_count() == 1 && ptn_loc->edge_target(0) == ni ) {
- tty->print("%6d LocalVar [[%d]]", li, ni);
- _nodes->adr_at(li)->_node->dump();
+ ptnode_adr(li)->dump(false);
}
}
if (Verbose) {
// Print all fields which reference this allocation
for (uint i = 0; i < ptn->edge_count(); i++) {
uint ei = ptn->edge_target(i);
- tty->print("%6d Field [[%d]]", ei, ni);
- _nodes->adr_at(ei)->_node->dump();
+ ptnode_adr(ei)->dump(false);
}
}
tty->cr();
--- a/hotspot/src/share/vm/opto/escape.hpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/escape.hpp Thu Jul 31 13:42:21 2008 -0700
@@ -178,23 +178,33 @@
// count of outgoing edges
uint edge_count() const { return (_edges == NULL) ? 0 : _edges->length(); }
+
// node index of target of outgoing edge "e"
- uint edge_target(uint e) const;
+ uint edge_target(uint e) const {
+ assert(_edges != NULL, "valid edge index");
+ return (_edges->at(e) >> EdgeShift);
+ }
// type of outgoing edge "e"
- EdgeType edge_type(uint e) const;
+ EdgeType edge_type(uint e) const {
+ assert(_edges != NULL, "valid edge index");
+ return (EdgeType) (_edges->at(e) & EdgeMask);
+ }
+
// add a edge of the specified type pointing to the specified target
void add_edge(uint targIdx, EdgeType et);
+
// remove an edge of the specified type pointing to the specified target
void remove_edge(uint targIdx, EdgeType et);
+
#ifndef PRODUCT
- void dump() const;
+ void dump(bool print_state=true) const;
#endif
};
class ConnectionGraph: public ResourceObj {
private:
- GrowableArray<PointsToNode>* _nodes; // Connection graph nodes indexed
+ GrowableArray<PointsToNode> _nodes; // Connection graph nodes indexed
// by ideal node index.
Unique_Node_List _delayed_worklist; // Nodes to be processed before
@@ -207,24 +217,22 @@
// is still being collected. If false,
// no new nodes will be processed.
- bool _has_allocations; // Indicates whether method has any
- // non-escaping allocations.
-
uint _phantom_object; // Index of globally escaping object
// that pointer values loaded from
// a field which has not been set
// are assumed to point to.
+ uint _oop_null; // ConP(#NULL)
+ uint _noop_null; // ConN(#NULL)
Compile * _compile; // Compile object for current compilation
- // address of an element in _nodes. Used when the element is to be modified
- PointsToNode *ptnode_adr(uint idx) {
- if ((uint)_nodes->length() <= idx) {
- // expand _nodes array
- PointsToNode dummy = _nodes->at_grow(idx);
- }
- return _nodes->adr_at(idx);
+ // Address of an element in _nodes. Used when the element is to be modified
+ PointsToNode *ptnode_adr(uint idx) const {
+ // There should be no new ideal nodes during ConnectionGraph build,
+ // growableArray::adr_at() will throw assert otherwise.
+ return _nodes.adr_at(idx);
}
+ uint nodes_size() const { return _nodes.length(); }
// Add node to ConnectionGraph.
void add_node(Node *n, PointsToNode::NodeType nt, PointsToNode::EscapeState es, bool done);
@@ -307,30 +315,30 @@
// Set the escape state of a node
void set_escape_state(uint ni, PointsToNode::EscapeState es);
- // Get Compile object for current compilation.
- Compile *C() const { return _compile; }
-
public:
ConnectionGraph(Compile *C);
+ // Check for non-escaping candidates
+ static bool has_candidates(Compile *C);
+
// Compute the escape information
- void compute_escape();
+ bool compute_escape();
// escape state of a node
PointsToNode::EscapeState escape_state(Node *n, PhaseTransform *phase);
// other information we have collected
bool is_scalar_replaceable(Node *n) {
- if (_collecting)
+ if (_collecting || (n->_idx >= nodes_size()))
return false;
- PointsToNode ptn = _nodes->at_grow(n->_idx);
- return ptn.escape_state() == PointsToNode::NoEscape && ptn._scalar_replaceable;
+ PointsToNode* ptn = ptnode_adr(n->_idx);
+ return ptn->escape_state() == PointsToNode::NoEscape && ptn->_scalar_replaceable;
}
bool hidden_alias(Node *n) {
- if (_collecting)
+ if (_collecting || (n->_idx >= nodes_size()))
return true;
- PointsToNode ptn = _nodes->at_grow(n->_idx);
- return (ptn.escape_state() != PointsToNode::NoEscape) || ptn._hidden_alias;
+ PointsToNode* ptn = ptnode_adr(n->_idx);
+ return (ptn->escape_state() != PointsToNode::NoEscape) || ptn->_hidden_alias;
}
#ifndef PRODUCT
--- a/hotspot/src/share/vm/opto/idealGraphPrinter.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/idealGraphPrinter.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -473,10 +473,12 @@
print_prop("is_dontcare", "false");
}
+#ifdef ASSERT
Node* old = C->matcher()->find_old_node(node);
if (old != NULL) {
print_prop("old_node_idx", old->_idx);
}
+#endif
}
if (node->is_Proj()) {
--- a/hotspot/src/share/vm/opto/ifnode.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/ifnode.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -725,6 +725,11 @@
int true_path = phi->is_diamond_phi();
if( true_path == 0 ) return NULL;
+ // Make sure that iff and the control of the phi are different. This
+ // should really only happen for dead control flow since it requires
+ // an illegal cycle.
+ if (phi->in(0)->in(1)->in(0) == iff) return NULL;
+
// phi->region->if_proj->ifnode->bool->cmp
BoolNode *bol2 = phi->in(0)->in(1)->in(0)->in(1)->as_Bool();
@@ -751,6 +756,7 @@
}
Node* new_bol = (flip ? phase->transform( bol2->negate(phase) ) : bol2);
+ assert(new_bol != iff->in(1), "must make progress");
iff->set_req(1, new_bol);
// Intervening diamond probably goes dead
phase->C->set_major_progress();
--- a/hotspot/src/share/vm/opto/lcm.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/lcm.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -322,7 +322,7 @@
uint choice = 0; // Bigger is most important
uint latency = 0; // Bigger is scheduled first
uint score = 0; // Bigger is better
- uint idx; // Index in worklist
+ int idx = -1; // Index in worklist
for( uint i=0; i<cnt; i++ ) { // Inspect entire worklist
// Order in worklist is used to break ties.
@@ -412,9 +412,10 @@
}
} // End of for all ready nodes in worklist
- Node *n = worklist[idx]; // Get the winner
+ assert(idx >= 0, "index should be set");
+ Node *n = worklist[(uint)idx]; // Get the winner
- worklist.map(idx,worklist.pop()); // Compress worklist
+ worklist.map((uint)idx, worklist.pop()); // Compress worklist
return n;
}
@@ -599,7 +600,14 @@
assert(cfg->_bbs[oop_store->_idx]->_dom_depth <= this->_dom_depth, "oop_store must dominate card-mark");
}
}
- if( n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_MemBarAcquire ) {
+ if( n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_MemBarAcquire &&
+ n->req() > TypeFunc::Parms ) {
+ // MemBarAcquire could be created without Precedent edge.
+ // del_req() replaces the specified edge with the last input edge
+ // and then removes the last edge. If the specified edge > number of
+ // edges the last edge will be moved outside of the input edges array
+ // and the edge will be lost. This is why this code should be
+ // executed only when Precedent (== TypeFunc::Parms) edge is present.
Node *x = n->in(TypeFunc::Parms);
n->del_req(TypeFunc::Parms);
n->add_prec(x);
--- a/hotspot/src/share/vm/opto/loopopts.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/loopopts.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -578,7 +578,8 @@
Node *cmov = conditional_move( n );
if( cmov ) return cmov;
}
- if( n->is_CFG() || n_op == Op_StorePConditional || n_op == Op_StoreLConditional || n_op == Op_CompareAndSwapI || n_op == Op_CompareAndSwapL ||n_op == Op_CompareAndSwapP) return n;
+ if( n->is_CFG() || n->is_LoadStore() )
+ return n;
if( n_op == Op_Opaque1 || // Opaque nodes cannot be mod'd
n_op == Op_Opaque2 ) {
if( !C->major_progress() ) // If chance of no more loop opts...
@@ -1891,18 +1892,19 @@
_igvn.hash_delete(use);
use->set_req(j, n_clone);
_igvn._worklist.push(use);
+ Node* use_c;
if (!use->is_Phi()) {
- Node* use_c = has_ctrl(use) ? get_ctrl(use) : use->in(0);
- set_ctrl(n_clone, use_c);
- assert(!loop->is_member(get_loop(use_c)), "should be outside loop");
- get_loop(use_c)->_body.push(n_clone);
+ use_c = has_ctrl(use) ? get_ctrl(use) : use->in(0);
} else {
// Use in a phi is considered a use in the associated predecessor block
- Node *prevbb = use->in(0)->in(j);
- set_ctrl(n_clone, prevbb);
- assert(!loop->is_member(get_loop(prevbb)), "should be outside loop");
- get_loop(prevbb)->_body.push(n_clone);
+ use_c = use->in(0)->in(j);
}
+ if (use_c->is_CountedLoop()) {
+ use_c = use_c->in(LoopNode::EntryControl);
+ }
+ set_ctrl(n_clone, use_c);
+ assert(!loop->is_member(get_loop(use_c)), "should be outside loop");
+ get_loop(use_c)->_body.push(n_clone);
_igvn.register_new_node_with_optimizer(n_clone);
#if !defined(PRODUCT)
if (TracePartialPeeling) {
--- a/hotspot/src/share/vm/opto/macro.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/macro.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -194,9 +194,10 @@
}
// Search for a memory operation for the specified memory slice.
-static Node *scan_mem_chain(Node *mem, int alias_idx, int offset, Node *start_mem, Node *alloc) {
+static Node *scan_mem_chain(Node *mem, int alias_idx, int offset, Node *start_mem, Node *alloc, PhaseGVN *phase) {
Node *orig_mem = mem;
Node *alloc_mem = alloc->in(TypeFunc::Memory);
+ const TypeOopPtr *tinst = phase->C->get_adr_type(alias_idx)->isa_oopptr();
while (true) {
if (mem == alloc_mem || mem == start_mem ) {
return mem; // hit one of our sentinals
@@ -208,7 +209,13 @@
// already know that the object is safe to eliminate.
if (in->is_Initialize() && in->as_Initialize()->allocation() == alloc) {
return in;
- } else if (in->is_Call() || in->is_MemBar()) {
+ } else if (in->is_Call()) {
+ CallNode *call = in->as_Call();
+ if (!call->may_modify(tinst, phase)) {
+ mem = call->in(TypeFunc::Memory);
+ }
+ mem = in->in(TypeFunc::Memory);
+ } else if (in->is_MemBar()) {
mem = in->in(TypeFunc::Memory);
} else {
assert(false, "unexpected projection");
@@ -231,8 +238,7 @@
} else {
return mem;
}
- if (mem == orig_mem)
- return mem;
+ assert(mem != orig_mem, "dead memory loop");
}
}
@@ -241,27 +247,50 @@
// on the input paths.
// Note: this function is recursive, its depth is limied by the "level" argument
// Returns the computed Phi, or NULL if it cannot compute it.
-Node *PhaseMacroExpand::value_from_mem_phi(Node *mem, BasicType ft, const Type *phi_type, const TypeOopPtr *adr_t, Node *alloc, int level) {
-
- if (level <= 0) {
- return NULL;
- }
+Node *PhaseMacroExpand::value_from_mem_phi(Node *mem, BasicType ft, const Type *phi_type, const TypeOopPtr *adr_t, Node *alloc, Node_Stack *value_phis, int level) {
+ assert(mem->is_Phi(), "sanity");
int alias_idx = C->get_alias_index(adr_t);
int offset = adr_t->offset();
int instance_id = adr_t->instance_id();
+ // Check if an appropriate value phi already exists.
+ Node* region = mem->in(0);
+ for (DUIterator_Fast kmax, k = region->fast_outs(kmax); k < kmax; k++) {
+ Node* phi = region->fast_out(k);
+ if (phi->is_Phi() && phi != mem &&
+ phi->as_Phi()->is_same_inst_field(phi_type, instance_id, alias_idx, offset)) {
+ return phi;
+ }
+ }
+ // Check if an appropriate new value phi already exists.
+ Node* new_phi = NULL;
+ uint size = value_phis->size();
+ for (uint i=0; i < size; i++) {
+ if ( mem->_idx == value_phis->index_at(i) ) {
+ return value_phis->node_at(i);
+ }
+ }
+
+ if (level <= 0) {
+ return NULL; // Give up: phi tree too deep
+ }
Node *start_mem = C->start()->proj_out(TypeFunc::Memory);
Node *alloc_mem = alloc->in(TypeFunc::Memory);
uint length = mem->req();
GrowableArray <Node *> values(length, length, NULL);
+ // create a new Phi for the value
+ PhiNode *phi = new (C, length) PhiNode(mem->in(0), phi_type, NULL, instance_id, alias_idx, offset);
+ transform_later(phi);
+ value_phis->push(phi, mem->_idx);
+
for (uint j = 1; j < length; j++) {
Node *in = mem->in(j);
if (in == NULL || in->is_top()) {
values.at_put(j, in);
} else {
- Node *val = scan_mem_chain(in, alias_idx, offset, start_mem, alloc);
+ Node *val = scan_mem_chain(in, alias_idx, offset, start_mem, alloc, &_igvn);
if (val == start_mem || val == alloc_mem) {
// hit a sentinel, return appropriate 0 value
values.at_put(j, _igvn.zerocon(ft));
@@ -280,33 +309,18 @@
} else if(val->is_Proj() && val->in(0) == alloc) {
values.at_put(j, _igvn.zerocon(ft));
} else if (val->is_Phi()) {
- // Check if an appropriate node already exists.
- Node* region = val->in(0);
- Node* old_phi = NULL;
- for (DUIterator_Fast kmax, k = region->fast_outs(kmax); k < kmax; k++) {
- Node* phi = region->fast_out(k);
- if (phi->is_Phi() && phi != val &&
- phi->as_Phi()->is_same_inst_field(phi_type, instance_id, alias_idx, offset)) {
- old_phi = phi;
- break;
- }
+ val = value_from_mem_phi(val, ft, phi_type, adr_t, alloc, value_phis, level-1);
+ if (val == NULL) {
+ return NULL;
}
- if (old_phi == NULL) {
- val = value_from_mem_phi(val, ft, phi_type, adr_t, alloc, level-1);
- if (val == NULL) {
- return NULL;
- }
- values.at_put(j, val);
- } else {
- values.at_put(j, old_phi);
- }
+ values.at_put(j, val);
} else {
- return NULL; // unknown node on this path
+ assert(false, "unknown node on this path");
+ return NULL; // unknown node on this path
}
}
}
- // create a new Phi for the value
- PhiNode *phi = new (C, length) PhiNode(mem->in(0), phi_type, NULL, instance_id, alias_idx, offset);
+ // Set Phi's inputs
for (uint j = 1; j < length; j++) {
if (values.at(j) == mem) {
phi->init_req(j, phi);
@@ -314,7 +328,6 @@
phi->init_req(j, values.at(j));
}
}
- transform_later(phi);
return phi;
}
@@ -329,7 +342,8 @@
Node *start_mem = C->start()->proj_out(TypeFunc::Memory);
Node *alloc_ctrl = alloc->in(TypeFunc::Control);
Node *alloc_mem = alloc->in(TypeFunc::Memory);
- VectorSet visited(Thread::current()->resource_area());
+ Arena *a = Thread::current()->resource_area();
+ VectorSet visited(a);
bool done = sfpt_mem == alloc_mem;
@@ -338,7 +352,7 @@
if (visited.test_set(mem->_idx)) {
return NULL; // found a loop, give up
}
- mem = scan_mem_chain(mem, alias_idx, offset, start_mem, alloc);
+ mem = scan_mem_chain(mem, alias_idx, offset, start_mem, alloc, &_igvn);
if (mem == start_mem || mem == alloc_mem) {
done = true; // hit a sentinel, return appropriate 0 value
} else if (mem->is_Initialize()) {
@@ -362,7 +376,7 @@
Node *unique_input = NULL;
Node *top = C->top();
for (uint i = 1; i < mem->req(); i++) {
- Node *n = scan_mem_chain(mem->in(i), alias_idx, offset, start_mem, alloc);
+ Node *n = scan_mem_chain(mem->in(i), alias_idx, offset, start_mem, alloc, &_igvn);
if (n == NULL || n == top || n == mem) {
continue;
} else if (unique_input == NULL) {
@@ -389,9 +403,18 @@
return mem->in(MemNode::ValueIn);
} else if (mem->is_Phi()) {
// attempt to produce a Phi reflecting the values on the input paths of the Phi
- Node * phi = value_from_mem_phi(mem, ft, ftype, adr_t, alloc, 8);
+ Node_Stack value_phis(a, 8);
+ Node * phi = value_from_mem_phi(mem, ft, ftype, adr_t, alloc, &value_phis, ValueSearchLimit);
if (phi != NULL) {
return phi;
+ } else {
+ // Kill all new Phis
+ while(value_phis.is_nonempty()) {
+ Node* n = value_phis.node();
+ _igvn.hash_delete(n);
+ _igvn.subsume_node(n, C->top());
+ value_phis.pop();
+ }
}
}
}
@@ -448,7 +471,7 @@
Node* n = use->fast_out(k);
if (!n->is_Store() && n->Opcode() != Op_CastP2X) {
DEBUG_ONLY(disq_node = n;)
- if (n->is_Load()) {
+ if (n->is_Load() || n->is_LoadStore()) {
NOT_PRODUCT(fail_eliminate = "Field load";)
} else {
NOT_PRODUCT(fail_eliminate = "Not store field referrence";)
--- a/hotspot/src/share/vm/opto/macro.hpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/macro.hpp Thu Jul 31 13:42:21 2008 -0700
@@ -79,7 +79,7 @@
const TypeFunc* slow_call_type,
address slow_call_address);
Node *value_from_mem(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc);
- Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc, int level);
+ Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc, Node_Stack *value_phis, int level);
bool eliminate_allocate_node(AllocateNode *alloc);
bool can_eliminate_allocation(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints);
--- a/hotspot/src/share/vm/opto/memnode.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/memnode.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -94,14 +94,19 @@
if (tinst == NULL || !tinst->is_known_instance_field())
return mchain; // don't try to optimize non-instance types
uint instance_id = tinst->instance_id();
+ Node *start_mem = phase->C->start()->proj_out(TypeFunc::Memory);
Node *prev = NULL;
Node *result = mchain;
while (prev != result) {
prev = result;
+ if (result == start_mem)
+ break; // hit one of our sentinals
// skip over a call which does not affect this memory slice
if (result->is_Proj() && result->as_Proj()->_con == TypeFunc::Memory) {
Node *proj_in = result->in(0);
- if (proj_in->is_Call()) {
+ if (proj_in->is_Allocate() && proj_in->_idx == instance_id) {
+ break; // hit one of our sentinals
+ } else if (proj_in->is_Call()) {
CallNode *call = proj_in->as_Call();
if (!call->may_modify(t_adr, phase)) {
result = call->in(TypeFunc::Memory);
@@ -115,6 +120,8 @@
}
} else if (proj_in->is_MemBar()) {
result = proj_in->in(TypeFunc::Memory);
+ } else {
+ assert(false, "unexpected projection");
}
} else if (result->is_MergeMem()) {
result = step_through_mergemem(phase, result->as_MergeMem(), t_adr, NULL, tty);
@@ -135,7 +142,9 @@
const TypePtr *t = mphi->adr_type();
if (t == TypePtr::BOTTOM || t == TypeRawPtr::BOTTOM ||
t->isa_oopptr() && !t->is_oopptr()->is_known_instance() &&
- t->is_oopptr()->cast_to_instance_id(t_oop->instance_id()) == t_oop) {
+ t->is_oopptr()->cast_to_exactness(true)
+ ->is_oopptr()->cast_to_ptr_type(t_oop->ptr())
+ ->is_oopptr()->cast_to_instance_id(t_oop->instance_id()) == t_oop) {
// clone the Phi with our address type
result = mphi->split_out_instance(t_adr, igvn);
} else {
--- a/hotspot/src/share/vm/opto/memnode.hpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/memnode.hpp Thu Jul 31 13:42:21 2008 -0700
@@ -607,6 +607,7 @@
};
//------------------------------LoadStoreNode---------------------------
+// Note: is_Mem() method returns 'true' for this class.
class LoadStoreNode : public Node {
public:
enum {
--- a/hotspot/src/share/vm/opto/node.hpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/node.hpp Thu Jul 31 13:42:21 2008 -0700
@@ -1399,6 +1399,10 @@
uint index() const {
return _inode_top->indx;
}
+ uint index_at(uint i) const {
+ assert(_inodes + i <= _inode_top, "in range");
+ return _inodes[i].indx;
+ }
void set_node(Node *n) {
_inode_top->node = n;
}
--- a/hotspot/src/share/vm/opto/parse.hpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/parse.hpp Thu Jul 31 13:42:21 2008 -0700
@@ -479,7 +479,7 @@
float branch_prediction(float &cnt, BoolTest::mask btest, int target_bci);
bool seems_never_taken(float prob);
- void do_ifnull(BoolTest::mask btest);
+ void do_ifnull(BoolTest::mask btest, Node* c);
void do_if(BoolTest::mask btest, Node* c);
void repush_if_args();
void adjust_map_after_if(BoolTest::mask btest, Node* c, float prob,
--- a/hotspot/src/share/vm/opto/parse2.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/parse2.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -875,6 +875,8 @@
return prob < PROB_MIN;
}
+//-------------------------------repush_if_args--------------------------------
+// Push arguments of an "if" bytecode back onto the stack by adjusting _sp.
inline void Parse::repush_if_args() {
#ifndef PRODUCT
if (PrintOpto && WizardMode) {
@@ -892,7 +894,7 @@
}
//----------------------------------do_ifnull----------------------------------
-void Parse::do_ifnull(BoolTest::mask btest) {
+void Parse::do_ifnull(BoolTest::mask btest, Node *c) {
int target_bci = iter().get_dest();
Block* branch_block = successor_for_bci(target_bci);
@@ -904,7 +906,7 @@
// (An earlier version of do_ifnull omitted this trap for OSR methods.)
#ifndef PRODUCT
if (PrintOpto && Verbose)
- tty->print_cr("Never-taken backedge stops compilation at bci %d",bci());
+ tty->print_cr("Never-taken edge stops compilation at bci %d",bci());
#endif
repush_if_args(); // to gather stats on loop
// We need to mark this branch as taken so that if we recompile we will
@@ -923,18 +925,7 @@
return;
}
- // If this is a backwards branch in the bytecodes, add Safepoint
- maybe_add_safepoint(target_bci);
-
explicit_null_checks_inserted++;
- Node* a = null();
- Node* b = pop();
- Node* c = _gvn.transform( new (C, 3) CmpPNode(b, a) );
-
- // Make a cast-away-nullness that is control dependent on the test
- const Type *t = _gvn.type(b);
- const Type *t_not_null = t->join(TypePtr::NOTNULL);
- Node *cast = new (C, 2) CastPPNode(b,t_not_null);
// Generate real control flow
Node *tst = _gvn.transform( new (C, 2) BoolNode( c, btest ) );
@@ -996,7 +987,7 @@
if (prob == PROB_UNKNOWN) {
#ifndef PRODUCT
if (PrintOpto && Verbose)
- tty->print_cr("Never-taken backedge stops compilation at bci %d",bci());
+ tty->print_cr("Never-taken edge stops compilation at bci %d",bci());
#endif
repush_if_args(); // to gather stats on loop
// We need to mark this branch as taken so that if we recompile we will
@@ -2100,11 +2091,15 @@
break;
}
- case Bytecodes::_ifnull:
- do_ifnull(BoolTest::eq);
- break;
- case Bytecodes::_ifnonnull:
- do_ifnull(BoolTest::ne);
+ case Bytecodes::_ifnull: btest = BoolTest::eq; goto handle_if_null;
+ case Bytecodes::_ifnonnull: btest = BoolTest::ne; goto handle_if_null;
+ handle_if_null:
+ // If this is a backwards branch in the bytecodes, add Safepoint
+ maybe_add_safepoint(iter().get_dest());
+ a = null();
+ b = pop();
+ c = _gvn.transform( new (C, 3) CmpPNode(b, a) );
+ do_ifnull(btest, c);
break;
case Bytecodes::_if_acmpeq: btest = BoolTest::eq; goto handle_if_acmp;
--- a/hotspot/src/share/vm/opto/superword.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/superword.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -1196,8 +1196,10 @@
Node *n = lp()->fast_out(i);
if (in_bb(n) && (n->is_Phi() && n->bottom_type() == Type::MEMORY)) {
Node* n_tail = n->in(LoopNode::LoopBackControl);
- _mem_slice_head.push(n);
- _mem_slice_tail.push(n_tail);
+ if (n_tail != n->in(LoopNode::EntryControl)) {
+ _mem_slice_head.push(n);
+ _mem_slice_tail.push(n_tail);
+ }
}
}
--- a/hotspot/src/share/vm/opto/type.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/opto/type.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -2218,7 +2218,7 @@
return make(ptr, _offset);
}
-//-----------------------------cast_to_instance-------------------------------
+//-----------------------------cast_to_instance_id----------------------------
const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const {
// There are no instances of a general oop.
// Return self unchanged.
@@ -2610,8 +2610,7 @@
// Ptr is never Null
assert( ptr != Null, "NULL pointers are not typed" );
- if ( instance_id > 0 )
- xk = true; // instances are always exactly typed
+ assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed");
if (!UseExactTypes) xk = false;
if (ptr == Constant) {
// Note: This case includes meta-object constants, such as methods.
@@ -2650,16 +2649,10 @@
return make(ptr(), klass(), klass_is_exact, const_oop(), _offset, _instance_id);
}
-//-----------------------------cast_to_instance-------------------------------
+//-----------------------------cast_to_instance_id----------------------------
const TypeOopPtr *TypeInstPtr::cast_to_instance_id(int instance_id) const {
if( instance_id == _instance_id ) return this;
- bool exact = _klass_is_exact;
- PTR ptr_t = _ptr;
- if ( instance_id > 0 ) { // instances are always exactly typed
- if (UseExactTypes) exact = true;
- ptr_t = NotNull;
- }
- return make(ptr_t, klass(), exact, const_oop(), _offset, instance_id);
+ return make(_ptr, klass(), _klass_is_exact, const_oop(), _offset, instance_id);
}
//------------------------------xmeet_unloaded---------------------------------
@@ -2899,6 +2892,7 @@
xk = above_centerline(ptr) ? tinst_xk : false;
// Watch out for Constant vs. AnyNull interface.
if (ptr == Constant) ptr = NotNull; // forget it was a constant
+ instance_id = InstanceBot;
}
ciObject* o = NULL; // the Constant value, if any
if (ptr == Constant) {
@@ -2989,6 +2983,7 @@
// class hierarchy - which means we have to fall to at least NotNull.
if( ptr == TopPTR || ptr == AnyNull || ptr == Constant )
ptr = NotNull;
+ instance_id = InstanceBot;
// Now we find the LCA of Java classes
ciKlass* k = this_klass->least_common_ancestor(tinst_klass);
@@ -3101,8 +3096,7 @@
assert(!(k == NULL && ary->_elem->isa_int()),
"integral arrays must be pre-equipped with a class");
if (!xk) xk = ary->ary_must_be_exact();
- if ( instance_id > 0 )
- xk = true; // instances are always exactly typed
+ assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed");
if (!UseExactTypes) xk = (ptr == Constant);
return (TypeAryPtr*)(new TypeAryPtr(ptr, NULL, ary, k, xk, offset, instance_id))->hashcons();
}
@@ -3113,8 +3107,7 @@
"integral arrays must be pre-equipped with a class");
assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" );
if (!xk) xk = (o != NULL) || ary->ary_must_be_exact();
- if ( instance_id > 0 )
- xk = true; // instances are always exactly typed
+ assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed");
if (!UseExactTypes) xk = (ptr == Constant);
return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, instance_id))->hashcons();
}
@@ -3134,16 +3127,10 @@
return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _instance_id);
}
-//-----------------------------cast_to_instance-------------------------------
+//-----------------------------cast_to_instance_id----------------------------
const TypeOopPtr *TypeAryPtr::cast_to_instance_id(int instance_id) const {
if( instance_id == _instance_id ) return this;
- bool exact = _klass_is_exact;
- PTR ptr_t = _ptr;
- if ( instance_id > 0 ) { // instances are always exactly typed
- if (UseExactTypes) exact = true;
- ptr_t = NotNull;
- }
- return make(ptr_t, const_oop(), _ary, klass(), exact, _offset, instance_id);
+ return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, instance_id);
}
//-----------------------------narrow_size_type-------------------------------
@@ -3300,6 +3287,7 @@
} else {
// Something like byte[int+] meets char[int+].
// This must fall to bottom, not (int[-128..65535])[int+].
+ instance_id = InstanceBot;
tary = TypeAry::make(Type::BOTTOM, tary->_size);
}
}
@@ -3316,6 +3304,7 @@
if( tap->const_oop() != NULL && !o->equals(tap->const_oop()) ) {
ptr = NotNull;
o = NULL;
+ instance_id = InstanceBot;
}
} else if( above_centerline(_ptr) ) {
o = tap->const_oop();
--- a/hotspot/src/share/vm/runtime/arguments.cpp Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/src/share/vm/runtime/arguments.cpp Thu Jul 31 13:42:21 2008 -0700
@@ -2495,6 +2495,9 @@
if (match_option(option, "-XX:+PrintVMOptions", &tail)) {
PrintVMOptions = true;
}
+ if (match_option(option, "-XX:-PrintVMOptions", &tail)) {
+ PrintVMOptions = false;
+ }
}
// Parse default .hotspotrc settings file
--- a/hotspot/test/compiler/6646019/Test.java Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/test/compiler/6646019/Test.java Thu Jul 31 13:42:21 2008 -0700
@@ -1,23 +1,24 @@
/*
- * Copyright 2008 Sun Microsystems, Inc. All rights reserved.
- * SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
- *
+ * Copyright 2008 Sun Microsystems, Inc. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
- *
- *
- *
- *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
*
- *
- *
- *
- *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
*
- *
- *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
- *
- *
+ * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
*
*/
--- a/hotspot/test/compiler/6689060/Test.java Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/test/compiler/6689060/Test.java Thu Jul 31 13:42:21 2008 -0700
@@ -1,24 +1,24 @@
/*
- * Copyright 2008 Sun Microsystems, Inc. All rights reserved.
- * SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
- *
+ * Copyright 2008 Sun Microsystems, Inc. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
- *
- *
- *
- *
- *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
*
- *
- *
- *
- *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
*
- *
- *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
- *
- *
+ * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
*
*/
--- a/hotspot/test/compiler/6695810/Test.java Wed Jul 30 15:06:29 2008 -0400
+++ b/hotspot/test/compiler/6695810/Test.java Thu Jul 31 13:42:21 2008 -0700
@@ -1,24 +1,24 @@
/*
- * Copyright 2008 Sun Microsystems, Inc. All rights reserved.
- * SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
- *
+ * Copyright 2008 Sun Microsystems, Inc. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
- *
- *
- *
- *
- *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
*
- *
- *
- *
- *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
*
- *
- *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
- *
- *
+ * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
*
*/
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/hotspot/test/compiler/6700047/Test6700047.java Thu Jul 31 13:42:21 2008 -0700
@@ -0,0 +1,60 @@
+/*
+ * Copyright 2008 Sun Microsystems, Inc. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ */
+
+/**
+ * @test
+ * @bug 6700047
+ * @summary C2 failed in idom_no_update
+ * @run main Test6700047
+ */
+
+public class Test6700047 {
+ public static void main(String[] args) {
+ for (int i = 0; i < 100000; i++) {
+ intToLeftPaddedAsciiBytes();
+ }
+ }
+
+ public static int intToLeftPaddedAsciiBytes() {
+ int offset = 40;
+ int q;
+ int r;
+ int i = 100;
+ int result = 1;
+ while (offset > 0) {
+ q = (i * 52429);
+ r = i;
+ offset--;
+ i = q;
+ if (i == 0) {
+ break;
+ }
+ }
+ if (offset > 0) {
+ for(int j = 0; j < offset; j++) {
+ result++;
+ }
+ }
+ return result;
+ }
+}
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/hotspot/test/compiler/6712835/Test6712835.java Thu Jul 31 13:42:21 2008 -0700
@@ -0,0 +1,1578 @@
+/*
+ * Copyright 2008 Sun Microsystems, Inc. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ */
+
+/**
+ * @test
+ * @bug 6712835
+ * @summary Server compiler fails with assertion (loop_count < K,"infinite loop in PhaseIterGVN::transform")
+ * @run main/othervm -Xcomp Test6712835
+ */
+
+/* Complexity upper bound: 349851 ops */
+
+abstract class Tester_Class_0 {
+ boolean var_1 = true;
+ static double var_2;
+ float var_3 = 1.8301116E38F;
+ final String var_4 = "wck";
+ final static short var_5 = 25624;
+
+
+ public Tester_Class_0()
+ {
+ var_2 = (byte)1.7374809293839066E308;
+ {
+ double var_18 = false ? 8027040614338917376L * var_3 + - (var_2 = var_5) : (var_3 += (char)4.491494085158084E307);
+ var_3 *= ~ ((byte)702579792) / 6600332715431236608L;
+ long var_19 = 0L;
+ var_18 -= 1759091496;
+ do
+ {
+ final long var_20 = (new long[(byte)(var_3 += + +1.6695243696502334E308)][(byte)((byte)1110410742 | ~var_19)])[var_1 & var_1 ? (byte)1047514041090199552L : (byte)var_5][(byte)(var_1 ? 123309551 : - ((byte)5932930312361050112L))];
+ var_19++;
+ final short var_21 = var_5;
+ } while (var_19 < 1 && var_1 ^ var_3 == + ((byte)var_5));
+ {
+ int var_22;
+ }
+ {
+ var_4.endsWith("o");
+ }
+ int var_23 = 0;
+ var_1 &= (var_1 = true);
+ for (byte var_24 = 26; (var_1 = !var_1) && var_23 < 1; var_18 += var_1 ^ (var_1 |= false) ^ true ? var_24 : (byte)1504077779675035648L)
+ {
+ var_18 *= var_23;
+ var_23++;
+ float var_25;
+ (((new Tester_Class_0[var_24][var_24][var_24])[var_24])[var_24 >>= var_19][var_24 &= 6702582681202665472L]).var_3 *= var_5;
+ }
+ var_1 = (var_3 -= var_5) > (byte)func_2(1317089759, var_5, (byte)var_19) % (false & true ? 475183200 : 8947159119888251904L);
+ var_18 /= ~var_19 ^ ((byte)(var_18 %= (int)var_5) >= 6773554922270913536L ? (byte)var_5 : (byte)'u');
+ var_3 = ~ ((byte)var_19);
+ }
+ double var_26 = 0;
+ var_1 &= (var_1 |= ! (var_1 |= true));
+ while (var_26 < 1)
+ {
+ var_2 = 'e';
+ var_26++;
+ var_1 ^= !true | 'j' * ((var_2 = 93384362) + var_5) <= var_5;
+ var_2 = true ? 2056852215 : var_5;
+ }
+ switch ((new char[(byte)var_3])[(byte)(short)var_4.charAt(438929928)] / (new byte[(byte)1779353916050551808L][(byte)+ ~8903539475459755008L])[(byte)836413337621087232L][(byte)784406244])
+ {
+ case 101:
+ var_3 -= var_5;
+ break;
+
+ case 'L':
+
+ case 20:
+ final int var_27 = 2146473580;
+ break;
+
+ case 18:
+
+ default:
+ "mwh".substring((byte)(float)'A' % var_5, ']' | var_5 ^ ~ ((byte)'E'));
+ break;
+
+ case 'H':
+
+ }
+ var_3 = var_5;
+ long var_28;
+ var_28 = (var_1 = 'u' != (var_3 = var_1 ? 1384770002488557568L : ~ ~6691557565676772352L)) ? - ((byte)938410603) : var_5;
+ ((new Tester_Class_0[(byte)var_26])[(byte)'w']).var_3 = (byte)(short)'I';
+ var_2 = (var_1 ^= "sfltwylm".startsWith("ytmeds")) ? 1837260339 * 434565574 : (new double[(byte)var_26])[(byte)var_3];
+ }
+
+
+
+ public boolean equals(Object obj)
+ {
+ var_2 = 785819716 / 'i';
+ switch ((! (var_1 ^= var_1) ^ (! ((false | (var_1 |= var_1)) ^ !false) ? false : (var_1 |= !false)) ? var_1 : ! !var_1 ^ var_1) ? 1426689390 : var_5 * var_5)
+ {
+ case '`':
+
+ case 89:
+
+ case 13:
+ char var_9 = 'W';
+ break;
+
+ case 31:
+
+ case 15:
+
+ case 'm':
+ var_1 &= var_1;
+ break;
+
+ case 'Z':
+
+ case 34:
+ String[] var_10 = (new String[(byte)5534253842608756736L][(byte)'M'])[(byte)8717534666212195328L];
+ break;
+
+ case 124:
+
+ }
+ var_3 += var_5;
+ var_1 |= (var_1 |= (var_1 = (var_1 |= var_5 >= (var_2 = (byte)var_3))));
+ var_1 ^= (var_1 = var_4.endsWith(new String()));
+ var_2 = (var_3 %= 664966429);
+ {
+ var_4.lastIndexOf((int)('i' * (! !true & (true & !var_1) ? (byte)2.2562587635371023E307 : (byte)(var_3 %= var_3)) / var_3), 'P' % (false ? (byte)'N' : (byte)943393108));
+ }
+ var_3 /= false | ! !var_1 ? (char)1.3721055E38F : '\\';
+ if (var_1)
+ {
+ var_4.compareTo("uaqmqwg");
+ }
+ else
+ {
+ var_1 ^= var_1 & (var_1 &= (var_1 ^= (var_1 ^= var_1)));
+ }
+ var_3 *= (new int[(byte)1980200282][(byte)'i'])[(byte)(var_2 = (byte)'O')][false ? (byte)2.4739911E38F : (byte)- ((byte)1.6045903096088714E308)];
+ var_1 = var_5 != (byte)var_5 & (1.5002759009669559E308 < (byte)5110733568033040384L ^ (var_1 ? (var_1 ^= true) : var_1));
+ long var_11;
+ return (var_2 = (byte)'B') < 550125954;
+ }
+
+
+ public static char func_0(final int arg_0, long[] arg_1, final boolean arg_2)
+ {
+ var_2 = (short)(false ? (byte)1.2577737E38F : (byte)'t');
+ "xdf".codePointBefore((!arg_2 ? (byte)1426638765 : (byte)541094055) * ((byte)var_5 / var_5));
+ ((new Tester_Class_0[(byte)(short)(var_2 = 'A')])[(byte)arg_0]).var_3 = 7823141134226481152L;
+ ((new Tester_Class_0[(byte)- ~1368497135389664256L])[!false || true ? (byte)2.5393905E38F : (byte)2.4415902E38F]).var_3 -= (int)(false ? (byte)var_5 : (byte)"musnlk".charAt(785792957));
+ ((new Tester_Class_0[(byte)357672172])[(byte)7.709380171237795E307]).var_3 = arg_0;
+ ((new Tester_Class_0[(byte)var_5])[(byte)('Z' / + + -2.6037312E38F)]).var_3 %= arg_2 ? + - - + - + +4.6761156E37F : (byte)- (var_2 = - - ~3113191255384341504L);
+ (("exseqpham" + "uigdxg").equalsIgnoreCase("oeutvibnv") ? "l" : "qra").replace(false ^ true ? 't' : "jwpf".charAt(+ ((byte)arg_0)), 6.624090730243228E307 > 2.7771497E38F ? 't' : "tcfesyg".charAt(arg_0));
+ ((new Tester_Class_0[(byte)arg_0][(byte)6943189372481268736L])[(byte)2.6713643513095145E307][(byte)var_5]).var_1 &= !"ipgqq".endsWith("aecnyvpmf");
+ ((new Tester_Class_0[(byte)(+ +2158971337956592640L ^ var_5)])[false ? (byte)8594725249859841024L : (byte)var_5]).var_3 = (byte)"jd".charAt((byte)1.6298661301128909E307 << (byte)'B');
+ var_2 = (float)1014982842 * (byte)var_5 * ((new Tester_Class_0[(byte)2.7842814E38F])[(byte)"n".charAt('e' ^ (byte)arg_0)]).var_3;
+ if (false)
+ {
+ ((new Tester_Class_0[(byte)8.702990410251979E307][(byte)8.865924E37F])[(byte)var_5][(byte)+ ((long)var_5)]).var_1 ^= arg_2;
+ }
+ else
+ {
+ ((new Tester_Class_0[(byte)('I' | var_5)])[(byte)('L' + (+ - - (var_2 = 'N') + 1.324025E38F))]).var_3 = var_5 % '[' + (byte)var_5;
+ }
+ ((new Tester_Class_0[(byte)7.41761E37F][(byte)(var_2 = var_5)])[(byte)var_5][(byte)'o']).var_1 &= false;
+ ((new Tester_Class_0[(byte)+ ((byte)7.9065203E37F)])[(byte)var_5]).var_1 ^= 630582880 > - (var_2 = var_5);
+ return 'K';
+ }
+
+ protected float func_1(int arg_0, final Object arg_1, Object arg_2)
+ {
+ var_1 ^= (var_1 ^= true) & !var_1;
+ {
+ var_3 -= var_3;
+ var_2 = var_1 && (var_1 &= ! !true) | + ~3353396000385141760L < 7949306917320622080L ? (byte)306954754 : (byte)var_5;
+ final long var_12 = 1048994076885686272L;
+ }
+ short var_13 = 8706;
+ byte var_14 = (new byte[(byte)6.697464316212731E307])[(byte)var_4.indexOf("clbr", (byte)var_5 + 'F')];
+ ((new Tester_Class_0[var_14][var_14 &= 'b'])[var_14][var_14]).var_1 |= var_14 >= var_3;
+ (((new String[var_14][var_14])[var_14])[var_14]).codePointAt(585064460);
+ var_14 -= 2121015302;
+ var_2 = 1.241922E38F;
+ {
+ (((new Tester_Class_0[var_14][var_14 ^= 'y'])[var_14])[var_14 |= var_14]).var_3 *= 5756647686007829504L;
+ }
+ {
+ var_13--;
+ }
+ double var_15;
+ var_1 = (var_1 = true) ? false : true;
+ arg_0--;
+ return var_3;
+ }
+
+ public final static short func_2(int arg_0, final short arg_1, byte arg_2)
+ {
+ arg_0 %= (((new Tester_Class_0[arg_2][arg_2])[arg_2++][--arg_2]).var_1 |= true) ? 'e' : var_5 >>> arg_2;
+ float var_16 = ((false ? ~3951083684045828096L >>> - -3880809660598466560L : arg_0) ^ arg_1) - 1.1257035E37F;
+ var_2 = var_5 + 3.3679594E38F;
+ arg_2 += true & (((new Tester_Class_0[arg_2])[arg_2 *= 4301185995603340288L]).var_1 = arg_1 != arg_1) ? (var_2 = arg_0) : 988311987505040384L + ']' >>> --arg_2;
+ arg_2 = arg_2;
+ var_16 /= (arg_2 += (arg_0 += (var_16 %= arg_2)) + (var_16 -= arg_2));
+ var_16 += 7416220016668043264L;
+ ((new Tester_Class_0[arg_2])[arg_2]).var_1 &= false;
+ ((new Tester_Class_0[--arg_2])[--arg_2]).var_1 = true | (true & true ? true : false);
+ arg_2 -= (var_2 = 7997355759027275776L);
+ ((new Tester_Class_0[arg_2])[arg_2 %= 8660960251961819136L]).var_3 *= 4180634858198604800L;
+ arg_0 /= -1.3063173E38F;
+ var_2 = arg_2;
+ var_2 = (6266377813429248L ^ 'j') / (!false & (1.1423139843154216E308 >= (var_2 = arg_2) || (((new Tester_Class_0[arg_2])[arg_2]).var_1 ^= true)) ? (short)('e' * arg_0) : var_5);
+ --arg_0;
+ var_2 = (+ - ~8598445599816821760L << arg_1) % 1890075208 & (!true & !true ^ false & false ? 'w' : 'm') % (5614521287604667392L / arg_2) & ~193105176465084416L;
+ arg_2 &= (arg_2 |= arg_0) ^ ((((new Tester_Class_0[arg_2][arg_2])[arg_2])[arg_2]).var_1 ? arg_2 : (new long[arg_2])[arg_2]);
+ ((new Tester_Class_0[arg_2 &= 'V'][arg_2])[arg_2 /= 5486057194586717184L][arg_2 %= var_16]).var_1 |= (new boolean[((new Tester_Class_0[arg_2])[arg_2]).var_1 ? arg_2 : arg_2])[arg_2];
+ return ((((new Tester_Class_0[arg_2][arg_2][arg_2])[--arg_2])[arg_2 |= arg_2][arg_2 %= 6782653882738869248L]).var_1 ? false : !true | "hopq".equalsIgnoreCase("wvm") | "qmhtjvm".endsWith("gewqas")) && ! !false & false ? arg_1 : arg_1;
+ }
+
+ protected final static char func_3(byte arg_0, final int arg_1, final short arg_2, long[] arg_3)
+ {
+ ((new Tester_Class_0[arg_0 ^= 1902924521091955712L])[arg_0]).var_1 &= ((((new Tester_Class_0[arg_0][arg_0])[--arg_0])[arg_0 *= - -1.0959788E38F]).var_1 = false);
+ {
+ var_2 = (new float[arg_0][(byte)1082004329])[arg_0][arg_0 <<= 'T'];
+ }
+ ((new Tester_Class_0[arg_0 >>= arg_1][arg_0])[arg_0][arg_0]).var_1 |= ((new Tester_Class_0[arg_0])[--arg_0]).var_4.startsWith(((new Tester_Class_0[arg_0])[arg_0]).var_4);
+ ((new Tester_Class_0[(byte)var_5])[arg_0]).var_4.substring(273513722, 'f' * 'n').substring((new short[arg_0][arg_0])[arg_0][arg_0] % 'C' >> (arg_3[arg_0] - 's') % ("".charAt(arg_1) & var_5));
+ var_2 = 'Q' + (char)arg_0;
+ {
+ ((new Tester_Class_0[++arg_0])[arg_0]).var_1 ^= !true || !true ? !false ^ false : ! (1.7030813E38F != ~arg_0);
+ }
+ {
+ "jbdu".indexOf(((new Tester_Class_0[arg_0 *= 2628674024589069312L])[arg_0 -= arg_1]).var_4, "gqglwwbab".charAt(~arg_0) >>> 'M');
+ }
+ {
+ --arg_0;
+ }
+ ((new Tester_Class_0[arg_0])[arg_0]).var_1 = 'n' == ('t' | (+9156142987836739584L | 's')) - 2915339344736463872L;
+ int var_17;
+ var_17 = 'k';
+ var_17 = (((new Tester_Class_0[arg_0])[arg_0]).var_1 &= false) ? (short)'q' : arg_2;
+ return '`';
+ }
+
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Tester_Class_0.var_5 = "; result += Test6712835.Printer.print(var_5);
+ result += "\n";
+ result += "Tester_Class_0.var_4 = "; result += Test6712835.Printer.print(var_4);
+ result += "\n";
+ result += "Tester_Class_0.var_1 = "; result += Test6712835.Printer.print(var_1);
+ result += "\n";
+ result += "Tester_Class_0.var_2 = "; result += Test6712835.Printer.print(var_2);
+ result += "\n";
+ result += "Tester_Class_0.var_3 = "; result += Test6712835.Printer.print(var_3);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+}
+
+
+final class Tester_Class_1 extends Tester_Class_0 {
+ final boolean var_29 = false;
+ static short var_30;
+ Tester_Class_0 var_31;
+
+
+ public Tester_Class_1()
+ {
+ new String();
+ byte var_43 = (var_1 ? var_29 : var_1) ? (byte)(~ ~ ~6520122970162626560L | ~6642750731731981312L) : (byte)(var_30 = var_5);
+ {
+ var_2 = Tester_Class_0.var_5;
+ }
+ ((Tester_Class_0)(new Object[var_43])[var_43]).var_1 = var_29;
+ var_43 += 512311665;
+ }
+
+
+
+
+ final int func_0()
+ {
+ Tester_Class_0.var_2 = var_29 ? (var_29 ? (byte)'D' : (byte)Tester_Class_0.var_5) : (!var_1 ^ var_1 | (var_1 ^= var_1) ? (byte)'J' : (byte)51510881);
+ new String();
+ new String();
+ new String();
+ return 1731501229;
+ }
+
+ private final static void func_1(final String arg_0, final Object arg_1)
+ {
+ long var_32 = ((new Tester_Class_1[(byte)37719380])['I' == Tester_Class_0.var_5 + Tester_Class_0.var_5 ? (byte)(var_30 = (byte)1.3043569561522328E308) : (byte)1.1111420042091164E308]).var_1 ? ~2569063513521638400L - Tester_Class_0.var_5 ^ 'm' : 660383226;
+ ((Tester_Class_0)arg_1).var_3 += (char)8417109805993570304L;
+ var_30 = var_5;
+ var_2 = (new byte[(byte)2102078692])[(byte)7.942050823719592E307];
+ if (((new Tester_Class_1[(byte)224717297])[(byte)2889830453578512384L]).var_1)
+ {
+ Tester_Class_0.var_2 = (new byte[(byte)'C'])[(byte)Tester_Class_0.var_5];
+ }
+ else
+ {
+ var_32 <<= 'u';
+ }
+ Tester_Class_0.var_2 = Tester_Class_0.var_5;
+ final Object var_33 = arg_1;
+ final byte var_34 = 40;
+ ++var_32;
+ (((new Tester_Class_1[var_34][var_34])[var_34][var_34]).var_31 = ((new Tester_Class_0[var_34][var_34])[var_34])[var_34]).var_1 ^= (((new Tester_Class_1[var_34][var_34])[var_34][var_34]).var_31 = (Tester_Class_0)var_33).var_1;
+ ((new Tester_Class_1[var_34])[var_34]).var_31 = (((new Tester_Class_1[var_34])[((new Tester_Class_1[var_34][var_34])[var_34][var_34]).var_1 ? var_34 : var_34]).var_31 = (((new Tester_Class_1[(byte)2.4941036E38F])[var_34]).var_31 = (Tester_Class_0)arg_1));
+ }
+
+ public static int[][] func_2(long arg_0, final float arg_1, short arg_2, final double arg_3)
+ {
+ long var_35;
+ {
+ arg_0++;
+ var_2 = true ? (byte)9.691601510156328E307 : (byte)"a".charAt(~ ((byte)arg_1));
+ if (((new Tester_Class_1[(byte)'\\'][(byte)arg_2])[(byte)arg_2][(byte)arg_0]).var_29)
+ {
+ arg_2++;
+ }
+ else
+ {
+ Tester_Class_0.var_2 = arg_2;
+ var_30 = arg_2;
+ Tester_Class_0.var_2 = arg_0;
+ }
+ arg_2 /= 157487965;
+ arg_2 -= func_2(~ ((byte)arg_0), (short)arg_3, (byte)+2.2503214E38F);
+ }
+ arg_0--;
+ double var_36;
+ arg_0 <<= (arg_0 >>= (arg_0 = 'O'));
+ {
+ arg_0++;
+ --arg_0;
+ }
+ --arg_2;
+ ++arg_2;
+ "gbcrkn".length();
+ var_30 = (short)7.14672E37F;
+ {
+ arg_0 %= (arg_0 >>= (arg_2 *= (byte)1.5835087622116814E308)) % arg_3;
+ var_36 = 'n';
+ int[][] var_37 = new int[(byte)(double)arg_0][(byte)(arg_2 >>= 'o')];
+ if ((byte)1390907656194158592L <= arg_2)
+ {
+ "uuoeps".indexOf("", 899321600);
+ }
+ else
+ {
+ var_36 = - ~ -arg_0;
+ }
+ short var_38 = var_5;
+ var_36 = ~arg_0 + (6482428938632186880L + 6995927649252739072L);
+ }
+ if (((new Tester_Class_1[(byte)arg_1][(byte)arg_2])[(new byte[(byte)arg_0])[(byte)var_5]][(byte)'s']).var_1 = false)
+ {
+ ++arg_0;
+ }
+ else
+ {
+ ((new Tester_Class_1[(byte)2.7176027E38F])[(byte)((arg_2 -= 2.595396436487417E307) % 'p')]).var_1 ^= ((new Tester_Class_1[(byte)4.393706E36F])[false ? (byte)4826960994531808256L : (byte)arg_0]).var_29;
+ }
+ int var_39 = 0;
+ arg_2 <<= 'Y';
+ while (var_39 < 1 && false)
+ {
+ arg_0++;
+ var_39++;
+ Object var_40;
+ ((Tester_Class_0)(var_40 = new long[(byte)3.285531E38F])).var_3 += var_39;
+ }
+ Object var_41;
+ "w".substring(1359453539);
+ return new int[(byte)((arg_2 /= 4.143015135482291E307) - 3.2659622E38F)][(byte)++arg_2];
+ }
+
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Tester_Class_1.var_5 = "; result += Test6712835.Printer.print(var_5);
+ result += "\n";
+ result += "Tester_Class_1.var_30 = "; result += Test6712835.Printer.print(var_30);
+ result += "\n";
+ result += "Tester_Class_1.var_4 = "; result += Test6712835.Printer.print(var_4);
+ result += "\n";
+ result += "Tester_Class_1.var_1 = "; result += Test6712835.Printer.print(var_1);
+ result += "\n";
+ result += "Tester_Class_1.var_29 = "; result += Test6712835.Printer.print(var_29);
+ result += "\n";
+ result += "Tester_Class_1.var_2 = "; result += Test6712835.Printer.print(var_2);
+ result += "\n";
+ result += "Tester_Class_1.var_3 = "; result += Test6712835.Printer.print(var_3);
+ result += "\n";
+ result += "Tester_Class_1.var_31 = "; result += Test6712835.Printer.print(var_31);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+}
+
+
+final class Tester_Class_2 extends Tester_Class_0 {
+ static float var_44 = 2.7867988E38F;
+ static byte var_45;
+ static long var_46 = 4319798868443575296L;
+
+
+ public Tester_Class_2()
+ {
+ Tester_Class_1.var_30 = (byte)3.1718026E38F;
+ var_45 = (new byte[(byte)'o'])[var_45 = (byte)Tester_Class_0.var_5];
+ Tester_Class_1.var_30 = (Tester_Class_1.var_30 = Tester_Class_0.var_5);
+ if (true)
+ {
+ ++var_46;
+ boolean var_51 = false ? (var_1 &= !var_1) : true;
+ --var_46;
+ if (false)
+ {
+ var_3 *= 6.882788442363403E307;
+ }
+ else
+ {
+ Tester_Class_0.var_2 = '`';
+ }
+ final float var_52 = (var_1 ^= var_1 || (var_1 &= false)) | (var_51 |= (var_51 &= false)) ? (byte)4.751813848964725E307 : (var_3 *= var_5);
+ (false ? var_4 : var_4).startsWith("j" + var_4);
+ var_46++;
+ var_3 %= Tester_Class_1.var_5;
+ }
+ else
+ {
+ Tester_Class_1.var_30 = (var_45 = (var_45 = (var_45 = (byte)Tester_Class_1.var_5)));
+ Tester_Class_1.var_2 = (var_3 -= ~ ((byte)var_46) - 2018787280);
+ Tester_Class_1.var_30 = (Tester_Class_1.var_30 = (Tester_Class_1.var_30 = (Tester_Class_1.var_30 = var_5)));
+ }
+ char var_53;
+ ++var_46;
+ short var_54 = 138;
+ ++var_46;
+ var_2 = 1435782089;
+ Tester_Class_0.var_2 = var_46;
+ }
+
+
+
+
+ protected final boolean func_0(final boolean arg_0, final boolean arg_1)
+ {
+ var_2 = 2.6153986361247174E307;
+ var_45 = (var_45 = (var_45 = (var_45 = (var_45 = (byte)(var_44 += var_46)))));
+ var_46++;
+ long var_47 = 0L;
+ var_3 -= + ((byte)(~var_46 * ~var_46 ^ var_46 % 1910419567));
+ do
+ {
+ ++var_46;
+ var_47++;
+ char var_48 = 'b';
+ } while (var_47 < 2);
+ new Tester_Class_1().var_31 = ((new Tester_Class_1[var_45 = (byte)3.0853839E38F])[(new byte[var_45 = (byte)1.4974966426791287E308])[var_45 = (byte)Tester_Class_0.var_5]]).var_1 ? new Tester_Class_1() : new Tester_Class_1();
+ var_45 = (var_45 = (byte)var_44);
+ double var_49 = 0;
+ var_45 = (byte)(Tester_Class_1.var_30 = Tester_Class_0.var_5);
+ while (((false ^ (var_1 &= var_1) | (var_1 |= arg_0) ? new Tester_Class_1() : new Tester_Class_1()).var_29 ? var_1 : false && (var_1 ^= arg_0)) && (var_49 < 3 && (true ? new Tester_Class_1() : new Tester_Class_1()).var_1))
+ {
+ var_45 = (var_45 = (var_45 = (var_45 = (var_45 = (byte)1.933612E38F))));
+ var_49++;
+ var_45 = (var_45 = (var_45 = (var_45 = (byte)685709636)));
+ long var_50;
+ }
+ var_45 = (var_45 = (var_45 = (byte)var_5));
+ var_46--;
+ return true;
+ }
+
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Tester_Class_2.var_46 = "; result += Test6712835.Printer.print(var_46);
+ result += "\n";
+ result += "Tester_Class_2.var_2 = "; result += Test6712835.Printer.print(var_2);
+ result += "\n";
+ result += "Tester_Class_2.var_3 = "; result += Test6712835.Printer.print(var_3);
+ result += "\n";
+ result += "Tester_Class_2.var_44 = "; result += Test6712835.Printer.print(var_44);
+ result += "\n";
+ result += "Tester_Class_2.var_5 = "; result += Test6712835.Printer.print(var_5);
+ result += "\n";
+ result += "Tester_Class_2.var_45 = "; result += Test6712835.Printer.print(var_45);
+ result += "\n";
+ result += "Tester_Class_2.var_4 = "; result += Test6712835.Printer.print(var_4);
+ result += "\n";
+ result += "Tester_Class_2.var_1 = "; result += Test6712835.Printer.print(var_1);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+}
+
+
+class Tester_Class_3 extends Tester_Class_0 {
+ static boolean var_55 = true;
+ short var_56;
+ char var_57 = (char)723612093;
+ final static byte var_58 = 118;
+ static float var_59 = true ? -2818156175448416256L : - - (Tester_Class_2.var_44 += var_58);
+ static Tester_Class_1 var_60;
+ byte var_61 = 112;
+ Tester_Class_2[] var_62;
+ static short var_63 = 19813;
+ static double var_64 = (var_55 = true) ? (Tester_Class_1.var_2 = 'M') : Tester_Class_2.var_46;
+
+
+ public Tester_Class_3()
+ {
+ var_56 = var_58;
+ Tester_Class_1 var_65 = var_60 = (var_60 = (var_60 = (new Tester_Class_1[var_61 |= '\\'])[(var_1 = true) || var_55 ? var_58 : var_61]));
+ var_64 /= 1253632965 * '`';
+ Tester_Class_2.var_46 >>>= var_58;
+ (((var_61 = var_58) * (var_55 ? 1641980027 : var_63) >= 1490788063 ? var_65 : var_65).var_29 ? var_65 : var_65).var_31 = (new Tester_Class_2[var_58])[var_58];
+ ++var_63;
+ new String();
+ var_64 += var_55 ? (var_61 >>>= 'Q') : (var_63 <<= var_57);
+ ((new Tester_Class_2().var_3 >= Tester_Class_2.var_46 ? !var_55 : var_4.startsWith(var_4, 586086925)) ? "gjsdhuop" : "juqrt").substring(("pm" + ((new Tester_Class_2[var_61][var_58])[var_58][var_58]).var_4).codePointBefore((~var_61 << 3032688286897486848L) - Tester_Class_1.var_5), (var_61 += 4.0796373033184064E306) >> (Tester_Class_2.var_46 >>> var_58));
+ var_63 -= (var_63 ^= var_57);
+ var_64 = var_5 - (Tester_Class_2.var_46 *= var_57);
+ Tester_Class_2.var_46 &= 7544159045139005440L;
+ var_55 |= false;
+ Tester_Class_2.var_46 = var_61;
+ }
+
+
+
+
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Tester_Class_3.var_57 = "; result += Test6712835.Printer.print(var_57);
+ result += "\n";
+ result += "Tester_Class_3.var_62 = "; result += Test6712835.Printer.print(var_62);
+ result += "\n";
+ result += "Tester_Class_3.var_2 = "; result += Test6712835.Printer.print(var_2);
+ result += "\n";
+ result += "Tester_Class_3.var_64 = "; result += Test6712835.Printer.print(var_64);
+ result += "\n";
+ result += "Tester_Class_3.var_3 = "; result += Test6712835.Printer.print(var_3);
+ result += "\n";
+ result += "Tester_Class_3.var_59 = "; result += Test6712835.Printer.print(var_59);
+ result += "\n";
+ result += "Tester_Class_3.var_5 = "; result += Test6712835.Printer.print(var_5);
+ result += "\n";
+ result += "Tester_Class_3.var_56 = "; result += Test6712835.Printer.print(var_56);
+ result += "\n";
+ result += "Tester_Class_3.var_63 = "; result += Test6712835.Printer.print(var_63);
+ result += "\n";
+ result += "Tester_Class_3.var_58 = "; result += Test6712835.Printer.print(var_58);
+ result += "\n";
+ result += "Tester_Class_3.var_61 = "; result += Test6712835.Printer.print(var_61);
+ result += "\n";
+ result += "Tester_Class_3.var_4 = "; result += Test6712835.Printer.print(var_4);
+ result += "\n";
+ result += "Tester_Class_3.var_1 = "; result += Test6712835.Printer.print(var_1);
+ result += "\n";
+ result += "Tester_Class_3.var_55 = "; result += Test6712835.Printer.print(var_55);
+ result += "\n";
+ result += "Tester_Class_3.var_60 = "; result += Test6712835.Printer.print(var_60);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+}
+
+
+final class Tester_Class_4 {
+ static long var_66;
+ final long var_67 = 7113579489152300032L * 985636454;
+ int[] var_68;
+ Tester_Class_3 var_69;
+ final long var_70 = Tester_Class_2.var_46 <<= Tester_Class_1.var_5;
+ byte var_71 = Tester_Class_3.var_58;
+
+
+ public Tester_Class_4()
+ {
+ Tester_Class_2.var_46++;
+ (var_69 = new Tester_Class_3()).var_61 += (!true | (Tester_Class_3.var_55 ^= Tester_Class_3.var_55) ? new Tester_Class_3() : new Tester_Class_3()).var_61;
+ final String[][] var_79 = new String[var_71 >>= (Tester_Class_3.var_63 ^= 'm')][((Tester_Class_3)(new Tester_Class_1().var_31 = new Tester_Class_2())).var_61 >>= (var_71 >>>= (Tester_Class_2.var_46 += 465205188010511360L))];
+ ++(var_69 = (var_69 = (var_69 = (Tester_Class_3)(new Object[Tester_Class_3.var_58][var_71])[Tester_Class_3.var_58][var_71]))).var_61;
+ (((new Tester_Class_2[var_71][Tester_Class_3.var_58])[Tester_Class_2.var_45 = var_71])[var_71]).var_3 += (Tester_Class_2.var_46 <<= (Tester_Class_2.var_46 /= 9.03047405760868E307) >> (new Tester_Class_2().var_1 ? 2099696051 : Tester_Class_3.var_63));
+ Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = new Tester_Class_1())));
+ char var_80;
+ Tester_Class_3.var_64 += 355712574;
+ ++Tester_Class_2.var_46;
+ }
+
+
+
+
+ private final static Tester_Class_1 func_0(boolean arg_0, double arg_1)
+ {
+ Tester_Class_3.var_60 = (Tester_Class_3.var_60 = new Tester_Class_1());
+ byte var_72 = (byte)Tester_Class_2.var_46;
+ Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = new Tester_Class_1()))));
+ float var_73 = 0F;
+ "flfix".offsetByCodePoints((Tester_Class_3.var_63 ^= 3286104714651747328L) + ((Tester_Class_3)(new Tester_Class_0[var_72])[var_72]).var_61, Tester_Class_0.var_5 + Tester_Class_3.var_58);
+ while (var_73 < 2 && (false ? (Tester_Class_3.var_60 = new Tester_Class_1()) : (Tester_Class_1)(new Tester_Class_0[var_72])[var_72]).var_29)
+ {
+ ((Tester_Class_3)(Tester_Class_0)(new Object[var_72])[Tester_Class_3.var_58]).var_61 >>= ((new Tester_Class_4[var_72])[var_72]).var_67;
+ var_73++;
+ new String("blod");
+ --var_72;
+ }
+ ((new Tester_Class_4[Tester_Class_3.var_58][var_72])[new Tester_Class_3().var_61][Tester_Class_3.var_58]).var_69 = new Tester_Class_3();
+ float var_74 = (! ("dkcx".lastIndexOf(Tester_Class_1.var_5 >> - (var_72 >>>= 1433506903139345408L)) == Tester_Class_2.var_46) ? 'O' : 'e' - new Tester_Class_2().var_3) * ~ (var_72 ^= var_72);
+ Tester_Class_3.var_60 = !true ? new Tester_Class_1() : (new Tester_Class_1[Tester_Class_3.var_58])[var_72];
+ ((arg_0 &= Tester_Class_3.var_55 | (Tester_Class_3.var_60 = new Tester_Class_1()).var_29) ? (Tester_Class_3.var_60 = (Tester_Class_1)(new Tester_Class_1().var_31 = new Tester_Class_2())) : (Tester_Class_3.var_60 = (new Tester_Class_1[var_72])[Tester_Class_3.var_58])).var_31 = (new Tester_Class_3[var_72 |= 546982927])[Tester_Class_3.var_58];
+ long var_75 = 0L;
+ final double var_76 = +arg_1;
+ while (var_75 < 1)
+ {
+ short var_77;
+ var_75++;
+ new Tester_Class_3().var_57 = (false & true ? new Tester_Class_3() : new Tester_Class_3()).var_57;
+ (Tester_Class_3.var_60 = (new Tester_Class_1[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_31 = (new Tester_Class_2[Tester_Class_3.var_58][var_72])[var_72][var_72];
+ }
+ Tester_Class_3.var_64 *= (arg_0 ? (Tester_Class_3.var_55 ^= (arg_0 ^= arg_0)) & ! (Tester_Class_3.var_55 = arg_0) : arg_0) ^ new Tester_Class_1().var_29 ? ++((new Tester_Class_3[var_72][var_72])[(new byte[Tester_Class_3.var_58])[Tester_Class_3.var_58]][(((new Tester_Class_4[var_72][Tester_Class_3.var_58])[Tester_Class_3.var_58][Tester_Class_3.var_58]).var_69 = (new Tester_Class_3[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_61]).var_57 : 'C';
+ long var_78;
+ var_74 %= (Tester_Class_3.var_55 |= (arg_0 = (arg_0 ^= (arg_0 &= !arg_0)))) ? new Tester_Class_3().var_61 : (Tester_Class_3.var_63 ^= var_72);
+ arg_1 /= (Tester_Class_2.var_46 &= 'W');
+ --(((new Tester_Class_4[var_72])[var_72]).var_69 = (((new Tester_Class_4[var_72])[var_72]).var_69 = new Tester_Class_3())).var_61;
+ return (new Tester_Class_1[var_72][Tester_Class_3.var_58])[var_72][new Tester_Class_3().var_61];
+ }
+
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Tester_Class_4.var_68 = "; result += Test6712835.Printer.print(var_68);
+ result += "\n";
+ result += "Tester_Class_4.var_66 = "; result += Test6712835.Printer.print(var_66);
+ result += "\n";
+ result += "Tester_Class_4.var_67 = "; result += Test6712835.Printer.print(var_67);
+ result += "\n";
+ result += "Tester_Class_4.var_70 = "; result += Test6712835.Printer.print(var_70);
+ result += "\n";
+ result += "Tester_Class_4.var_71 = "; result += Test6712835.Printer.print(var_71);
+ result += "\n";
+ result += "Tester_Class_4.var_69 = "; result += Test6712835.Printer.print(var_69);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+}
+
+
+final class Tester_Class_5 extends Tester_Class_0 {
+ static boolean var_81;
+ final int var_82 = 174395841;
+ int var_83;
+ byte var_84;
+ boolean var_85 = Tester_Class_3.var_55;
+ static boolean var_86 = Tester_Class_3.var_55;
+
+
+ public Tester_Class_5()
+ {
+ {
+ short var_87 = (new short[Tester_Class_3.var_58][var_84 = Tester_Class_3.var_58])[(((new Tester_Class_4[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_69 = (Tester_Class_3)(Tester_Class_0)(new Object[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_61][Tester_Class_3.var_58];
+ Tester_Class_4 var_88 = var_85 ^ (var_81 = false) ? (new Tester_Class_4[Tester_Class_3.var_58])[Tester_Class_3.var_58] : (new Tester_Class_4[Tester_Class_3.var_58])[Tester_Class_3.var_58];
+ {
+ ++var_87;
+ }
+ short var_89;
+ (var_88.var_69 = (new Tester_Class_3[var_88.var_71][var_88.var_71])[var_88.var_71][var_88.var_71]).var_61 += (((Tester_Class_2)(new Tester_Class_1().var_31 = new Tester_Class_2())).var_3 = Tester_Class_3.var_58);
+ var_88 = var_88;
+ }
+ {
+ ++Tester_Class_2.var_46;
+ --Tester_Class_2.var_46;
+ }
+ {
+ Tester_Class_2.var_46++;
+ Tester_Class_3.var_64 /= Tester_Class_3.var_59;
+ ((Tester_Class_4)(new Object[Tester_Class_2.var_45 = Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_71 %= (var_3 /= 3637233239489444864L);
+ ++Tester_Class_2.var_46;
+ }
+ new Tester_Class_3().var_57++;
+ var_85 &= (Tester_Class_3.var_55 |= false);
+ Tester_Class_3.var_60 = new Tester_Class_1();
+ Tester_Class_2.var_46++;
+ ((Tester_Class_3)(true ? (new Tester_Class_2[Tester_Class_3.var_58])[Tester_Class_3.var_58] : (new Tester_Class_0[Tester_Class_3.var_58])[Tester_Class_2.var_45 = Tester_Class_3.var_58])).var_57 *= ((new Tester_Class_3[Tester_Class_3.var_58])[(byte)'`']).var_57;
+ var_3 += (int)Tester_Class_3.var_59 ^ (Tester_Class_2.var_46 -= Tester_Class_2.var_46) % ~((new Tester_Class_4[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_71;
+ ++Tester_Class_2.var_46;
+ --Tester_Class_2.var_46;
+ var_83 = Tester_Class_3.var_58;
+ }
+
+
+
+
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Tester_Class_5.var_82 = "; result += Test6712835.Printer.print(var_82);
+ result += "\n";
+ result += "Tester_Class_5.var_83 = "; result += Test6712835.Printer.print(var_83);
+ result += "\n";
+ result += "Tester_Class_5.var_2 = "; result += Test6712835.Printer.print(var_2);
+ result += "\n";
+ result += "Tester_Class_5.var_3 = "; result += Test6712835.Printer.print(var_3);
+ result += "\n";
+ result += "Tester_Class_5.var_5 = "; result += Test6712835.Printer.print(var_5);
+ result += "\n";
+ result += "Tester_Class_5.var_84 = "; result += Test6712835.Printer.print(var_84);
+ result += "\n";
+ result += "Tester_Class_5.var_4 = "; result += Test6712835.Printer.print(var_4);
+ result += "\n";
+ result += "Tester_Class_5.var_1 = "; result += Test6712835.Printer.print(var_1);
+ result += "\n";
+ result += "Tester_Class_5.var_81 = "; result += Test6712835.Printer.print(var_81);
+ result += "\n";
+ result += "Tester_Class_5.var_85 = "; result += Test6712835.Printer.print(var_85);
+ result += "\n";
+ result += "Tester_Class_5.var_86 = "; result += Test6712835.Printer.print(var_86);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+}
+
+
+class Tester_Class_6 extends Tester_Class_0 {
+ long var_90 = 8467263472031702016L;
+ final static int var_91 = 1648594448 * ']';
+ char var_92 = 'x';
+ short var_93 = Tester_Class_3.var_63;
+ Tester_Class_4 var_94;
+ String[] var_95;
+ static short var_96 = Tester_Class_3.var_63 -= 83376045 << 40225606;
+ final static double var_97 = 5.387227213380301E307;
+ final static short var_98 = Tester_Class_3.var_63 &= var_91;
+ byte var_99 = 44;
+
+
+ public Tester_Class_6()
+ {
+ (Tester_Class_3.var_60 = (Tester_Class_1)(new Object[Tester_Class_3.var_58][var_99])[Tester_Class_3.var_58][var_99]).var_31 = true | true ? (Tester_Class_5)(new Object[var_99])[Tester_Class_3.var_58] : (Tester_Class_5)(new Object[Tester_Class_3.var_58])[var_99];
+ var_92 &= 'p';
+ Tester_Class_5.var_81 = (((new Tester_Class_1[var_99][Tester_Class_3.var_58])[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_29;
+ {
+ {
+ ++Tester_Class_2.var_46;
+ Tester_Class_3.var_2 = var_98;
+ var_93 -= var_96;
+ }
+ Tester_Class_2.var_46--;
+ {
+ (var_5 == (((Tester_Class_3)(new Tester_Class_0[var_99])[Tester_Class_3.var_58]).var_61 /= var_5) ? "fsajxeuao".replace('s', 'K') : var_4).substring('e' >>> var_5).toLowerCase();
+ }
+ var_93 %= ((new Tester_Class_6[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_90;
+ var_93 /= var_93;
+ if (Tester_Class_5.var_86)
+ {
+ (var_94 = (new Tester_Class_4[var_99])[var_99]).var_69 = (new Tester_Class_3[var_99])[var_99 %= -var_90];
+ }
+ else
+ {
+ --var_96;
+ }
+ var_93 *= 'O';
+ final long var_103 = 7573900518735055872L;
+ --Tester_Class_3.var_63;
+ }
+ Tester_Class_3.var_64 /= var_93;
+ if (true)
+ {
+ --Tester_Class_2.var_46;
+ Tester_Class_5 var_104;
+ final double var_105 = Tester_Class_3.var_64 += Tester_Class_5.var_86 & (new Tester_Class_2().var_1 & ((Tester_Class_3.var_55 = (var_1 ^= Tester_Class_5.var_86) & false) & (Tester_Class_5.var_81 = Tester_Class_5.var_86))) ? (byte)'g' : var_99;
+ Tester_Class_3.var_64 *= var_99;
+ }
+ else
+ {
+ char var_106 = var_92 -= Tester_Class_3.var_58;
+ }
+ double[] var_107 = ((new double[Tester_Class_3.var_58][var_99][var_99])[var_99])[false ? Tester_Class_3.var_58 : Tester_Class_3.var_58];
+ var_99 <<= (Tester_Class_3.var_63 >>= Tester_Class_3.var_58);
+ ++var_99;
+ }
+
+
+
+
+ final static byte func_0(final byte arg_0, final char arg_1, final Tester_Class_5[] arg_2)
+ {
+ ((Tester_Class_4)(new Object[Tester_Class_3.var_58][Tester_Class_3.var_58])[Tester_Class_3.var_58][arg_0]).var_69 = (Tester_Class_3)(new Tester_Class_0[Tester_Class_3.var_58])[Tester_Class_2.var_45 = Tester_Class_3.var_58];
+ long var_100 = 0L;
+ Tester_Class_3.var_64 /= (Tester_Class_5.var_86 = true) || 'o' > (Tester_Class_3.var_63 -= (float)arg_0) ? var_98 : 1.7875238E38F;
+ do
+ {
+ Tester_Class_3.var_64 %= var_5;
+ var_100++;
+ Tester_Class_3.var_64 += var_96 + 'r';
+ } while (true && (var_100 < 1 && (new Tester_Class_1().var_29 ? new Tester_Class_1() : (new Tester_Class_1[arg_0][Tester_Class_3.var_58])[arg_0][Tester_Class_3.var_58]).var_29));
+ (Tester_Class_3.var_55 ^ (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = new Tester_Class_1()))).var_29 ? new Tester_Class_3() : new Tester_Class_3()).var_57 = ((((new Tester_Class_6[Tester_Class_3.var_58][Tester_Class_3.var_58])[Tester_Class_3.var_58][Tester_Class_3.var_58]).var_94 = (((new Tester_Class_6[Tester_Class_3.var_58][Tester_Class_3.var_58])[Tester_Class_3.var_58][arg_0]).var_94 = (new Tester_Class_4[Tester_Class_3.var_58][arg_0])[Tester_Class_3.var_58][Tester_Class_3.var_58])).var_69 = new Tester_Class_3()).var_57;
+ final double var_101 = 1.6798216578519203E308;
+ Tester_Class_3.var_60 = (Tester_Class_3.var_60 = false ? new Tester_Class_1() : (Tester_Class_3.var_60 = new Tester_Class_1()));
+ Tester_Class_2 var_102 = new Tester_Class_2();
+ return Tester_Class_3.var_58;
+ }
+
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Tester_Class_6.var_92 = "; result += Test6712835.Printer.print(var_92);
+ result += "\n";
+ result += "Tester_Class_6.var_91 = "; result += Test6712835.Printer.print(var_91);
+ result += "\n";
+ result += "Tester_Class_6.var_95 = "; result += Test6712835.Printer.print(var_95);
+ result += "\n";
+ result += "Tester_Class_6.var_90 = "; result += Test6712835.Printer.print(var_90);
+ result += "\n";
+ result += "Tester_Class_6.var_2 = "; result += Test6712835.Printer.print(var_2);
+ result += "\n";
+ result += "Tester_Class_6.var_97 = "; result += Test6712835.Printer.print(var_97);
+ result += "\n";
+ result += "Tester_Class_6.var_3 = "; result += Test6712835.Printer.print(var_3);
+ result += "\n";
+ result += "Tester_Class_6.var_5 = "; result += Test6712835.Printer.print(var_5);
+ result += "\n";
+ result += "Tester_Class_6.var_93 = "; result += Test6712835.Printer.print(var_93);
+ result += "\n";
+ result += "Tester_Class_6.var_96 = "; result += Test6712835.Printer.print(var_96);
+ result += "\n";
+ result += "Tester_Class_6.var_98 = "; result += Test6712835.Printer.print(var_98);
+ result += "\n";
+ result += "Tester_Class_6.var_99 = "; result += Test6712835.Printer.print(var_99);
+ result += "\n";
+ result += "Tester_Class_6.var_4 = "; result += Test6712835.Printer.print(var_4);
+ result += "\n";
+ result += "Tester_Class_6.var_1 = "; result += Test6712835.Printer.print(var_1);
+ result += "\n";
+ result += "Tester_Class_6.var_94 = "; result += Test6712835.Printer.print(var_94);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+}
+
+
+abstract class Tester_Class_7 {
+ final static char var_108 = '_';
+ static Tester_Class_3 var_109;
+ final short var_110 = 4360;
+ short var_111;
+ Object var_112;
+ Tester_Class_4 var_113;
+ static Tester_Class_5 var_114;
+ final short var_115 = Tester_Class_6.var_96;
+ final static float var_116 = Tester_Class_3.var_59;
+
+
+ public Tester_Class_7()
+ {
+ --Tester_Class_2.var_46;
+ --Tester_Class_6.var_96;
+ var_113 = (new Tester_Class_4[new Tester_Class_6().var_99])[Tester_Class_3.var_58];
+ --Tester_Class_2.var_46;
+ Tester_Class_6.var_96--;
+ Tester_Class_3.var_63 -= 'i';
+ if (!Tester_Class_5.var_86)
+ {
+ Tester_Class_3.var_64 %= var_116;
+ if ((Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_1)(Tester_Class_0)(var_112 = "yosyghjm"))).var_29)
+ {
+ Tester_Class_2.var_46++;
+ }
+ else
+ {
+ (var_114 = (var_114 = (Tester_Class_5)(Tester_Class_0)(var_112 = "bxt"))).var_83 = (Tester_Class_2.var_45 = (Tester_Class_2.var_45 = Tester_Class_3.var_58));
+ }
+ var_114 = (var_114 = (var_114 = (var_114 = (var_114 = (var_114 = (Tester_Class_5)(var_112 = "blrobgg"))))));
+ var_113 = (((Tester_Class_6)(var_112 = "popebwfp")).var_94 = (new Tester_Class_4[Tester_Class_3.var_58])[Tester_Class_3.var_58]);
+ }
+ else
+ {
+ Tester_Class_3.var_60 = new Tester_Class_1();
+ }
+ final Tester_Class_6 var_122 = new Tester_Class_6();
+ var_122.var_92 &= (var_122.var_92 |= var_108);
+ ((new Tester_Class_5[var_122.var_99])[((new Tester_Class_3[Tester_Class_3.var_58])[var_122.var_99--]).var_61]).var_83 = 1708230145;
+ }
+
+
+
+ public boolean equals(Object obj)
+ {
+ (((Tester_Class_5.var_81 = (Tester_Class_5.var_81 = false)) ? (Tester_Class_3.var_55 &= false) : !Tester_Class_3.var_55 & ((Tester_Class_1)obj).var_29) ? (new Tester_Class_2[Tester_Class_3.var_58])[Tester_Class_3.var_58] : (Tester_Class_2)obj).equals((Tester_Class_5.var_86 |= Tester_Class_3.var_55) | (Tester_Class_3.var_55 = Tester_Class_3.var_55) ? obj : (Tester_Class_6)(Tester_Class_0)obj);
+ Tester_Class_3.var_64 *= 2.8258473339654136E307;
+ {
+ final int var_118 = 1248523063;
+ short var_119 = 30906;
+ Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_1)obj);
+ ((Tester_Class_6)(((Tester_Class_1)obj).var_31 = ((var_113 = (Tester_Class_4)obj).var_69 = (Tester_Class_3)obj))).var_94 = (var_113 = (Tester_Class_4)(var_112 = (Tester_Class_1)obj));
+ }
+ final Tester_Class_1 var_120 = false ^ (((Tester_Class_1)obj).var_1 = !true) ^ (((Tester_Class_6)(Tester_Class_0)obj).var_92 *= (((Tester_Class_3)obj).var_57 |= (Tester_Class_2.var_46 >>= 6986775136305733632L))) < (byte)Tester_Class_6.var_97 ? (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_1)obj)) : (true ? (Tester_Class_1)obj : (Tester_Class_1)obj);
+ (var_114 = (var_114 = (Tester_Class_5)obj)).var_83 = (((new Tester_Class_6[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_92 &= ((Tester_Class_4)obj).var_70 << (Tester_Class_2.var_45 = Tester_Class_3.var_58));
+ var_114 = (Tester_Class_5)obj;
+ obj = ((Tester_Class_3.var_60 = var_120).var_29 ? false : false) ? (new Tester_Class_6[Tester_Class_3.var_58])[Tester_Class_3.var_58] : obj;
+ (var_120.var_29 ? (Tester_Class_6)(obj = (Tester_Class_3.var_60 = var_120)) : (new Tester_Class_6[Tester_Class_3.var_58])[((Tester_Class_3)obj).var_61 ^= Tester_Class_6.var_91]).var_90 ^= 2127530040436251648L;
+ Object var_121;
+ return (new boolean[Tester_Class_3.var_58])[((var_113 = (Tester_Class_4)obj).var_69 = (var_109 = (new Tester_Class_3[Tester_Class_3.var_58][Tester_Class_3.var_58])[Tester_Class_3.var_58][Tester_Class_3.var_58])).var_61];
+ }
+
+
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Tester_Class_7.var_108 = "; result += Test6712835.Printer.print(var_108);
+ result += "\n";
+ result += "Tester_Class_7.var_116 = "; result += Test6712835.Printer.print(var_116);
+ result += "\n";
+ result += "Tester_Class_7.var_110 = "; result += Test6712835.Printer.print(var_110);
+ result += "\n";
+ result += "Tester_Class_7.var_111 = "; result += Test6712835.Printer.print(var_111);
+ result += "\n";
+ result += "Tester_Class_7.var_115 = "; result += Test6712835.Printer.print(var_115);
+ result += "\n";
+ result += "Tester_Class_7.var_114 = "; result += Test6712835.Printer.print(var_114);
+ result += "\n";
+ result += "Tester_Class_7.var_113 = "; result += Test6712835.Printer.print(var_113);
+ result += "\n";
+ result += "Tester_Class_7.var_109 = "; result += Test6712835.Printer.print(var_109);
+ result += "\n";
+ result += "Tester_Class_7.var_112 = "; result += Test6712835.Printer.print(var_112);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+}
+
+
+class Tester_Class_8 extends Tester_Class_7 {
+ static char var_123;
+ Tester_Class_4 var_124;
+ static short var_125;
+
+
+ public Tester_Class_8()
+ {
+ {
+ Tester_Class_3.var_64 -= (Tester_Class_2.var_46 *= Tester_Class_3.var_64);
+ {
+ Tester_Class_2.var_46--;
+ }
+ ++Tester_Class_3.var_63;
+ Tester_Class_5.var_86 |= true;
+ Tester_Class_6.var_96--;
+ }
+ "w".indexOf(312689020);
+ if (false)
+ {
+ (Tester_Class_7.var_114 = (new Tester_Class_5[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_83 = 'I';
+ }
+ else
+ {
+ --Tester_Class_6.var_96;
+ }
+ switch (Tester_Class_5.var_86 ? Tester_Class_3.var_58 : Tester_Class_3.var_58)
+ {
+ case 95:
+
+ case 35:
+
+ }
+ Tester_Class_6.var_96--;
+ Tester_Class_3.var_64 *= 4.516167673347119E307;
+ --Tester_Class_3.var_63;
+ {
+ int var_126;
+ }
+ Tester_Class_3.var_60 = new Tester_Class_1();
+ Tester_Class_2.var_46++;
+ ((new Tester_Class_6[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_99 &= Tester_Class_6.var_91;
+ ((new Tester_Class_1[((new Tester_Class_4[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_71])[((Tester_Class_3)(var_112 = "fsmtm")).var_61]).var_31 = (Tester_Class_2)(new Tester_Class_0[Tester_Class_3.var_58])[Tester_Class_3.var_58];
+ }
+
+
+
+
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Tester_Class_8.var_108 = "; result += Test6712835.Printer.print(var_108);
+ result += "\n";
+ result += "Tester_Class_8.var_123 = "; result += Test6712835.Printer.print(var_123);
+ result += "\n";
+ result += "Tester_Class_8.var_116 = "; result += Test6712835.Printer.print(var_116);
+ result += "\n";
+ result += "Tester_Class_8.var_110 = "; result += Test6712835.Printer.print(var_110);
+ result += "\n";
+ result += "Tester_Class_8.var_111 = "; result += Test6712835.Printer.print(var_111);
+ result += "\n";
+ result += "Tester_Class_8.var_115 = "; result += Test6712835.Printer.print(var_115);
+ result += "\n";
+ result += "Tester_Class_8.var_125 = "; result += Test6712835.Printer.print(var_125);
+ result += "\n";
+ result += "Tester_Class_8.var_114 = "; result += Test6712835.Printer.print(var_114);
+ result += "\n";
+ result += "Tester_Class_8.var_113 = "; result += Test6712835.Printer.print(var_113);
+ result += "\n";
+ result += "Tester_Class_8.var_124 = "; result += Test6712835.Printer.print(var_124);
+ result += "\n";
+ result += "Tester_Class_8.var_109 = "; result += Test6712835.Printer.print(var_109);
+ result += "\n";
+ result += "Tester_Class_8.var_112 = "; result += Test6712835.Printer.print(var_112);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+}
+
+
+final class Tester_Class_9 {
+ final static String var_127 = "pxk";
+ Tester_Class_2 var_128;
+ final static char var_129 = '\\';
+ static float var_130;
+ static boolean var_131;
+ final static float var_132 = Tester_Class_3.var_59;
+ static Tester_Class_0 var_133;
+ boolean[] var_134;
+
+
+ public Tester_Class_9()
+ {
+ Tester_Class_2.var_44 -= Tester_Class_3.var_58;
+ Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (new Tester_Class_1[Tester_Class_3.var_58][Tester_Class_3.var_58])[Tester_Class_3.var_58][Tester_Class_3.var_58]));
+ {
+ Tester_Class_8 var_136;
+ }
+ ++Tester_Class_2.var_46;
+ Tester_Class_6.var_96--;
+ var_128 = (var_128 = (var_128 = (Tester_Class_2)(var_133 = (new Tester_Class_1[Tester_Class_3.var_58])[Tester_Class_3.var_58])));
+ ++Tester_Class_6.var_96;
+ ++Tester_Class_2.var_46;
+ Tester_Class_4 var_137;
+ var_128 = (var_128 = (new Tester_Class_2[Tester_Class_3.var_58])[Tester_Class_3.var_58]);
+ (Tester_Class_8.var_114 = (Tester_Class_8.var_114 = (new Tester_Class_5[Tester_Class_3.var_58])[Tester_Class_3.var_58])).var_83 = (((new Tester_Class_4[Tester_Class_3.var_58][Tester_Class_3.var_58])[Tester_Class_3.var_58][Tester_Class_3.var_58]).var_69 = (new Tester_Class_3[Tester_Class_3.var_58][Tester_Class_3.var_58])[Tester_Class_3.var_58][Tester_Class_3.var_58]).var_57++;
+ Tester_Class_2.var_46++;
+ }
+
+
+
+
+ protected static short func_1()
+ {
+ {
+ Tester_Class_3.var_63--;
+ }
+ Tester_Class_3.var_64 *= Tester_Class_2.var_46;
+ short var_135;
+ Tester_Class_3.var_64 -= Tester_Class_6.var_96;
+ return new Tester_Class_6().var_93;
+ }
+
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Tester_Class_9.var_129 = "; result += Test6712835.Printer.print(var_129);
+ result += "\n";
+ result += "Tester_Class_9.var_134 = "; result += Test6712835.Printer.print(var_134);
+ result += "\n";
+ result += "Tester_Class_9.var_130 = "; result += Test6712835.Printer.print(var_130);
+ result += "\n";
+ result += "Tester_Class_9.var_132 = "; result += Test6712835.Printer.print(var_132);
+ result += "\n";
+ result += "Tester_Class_9.var_131 = "; result += Test6712835.Printer.print(var_131);
+ result += "\n";
+ result += "Tester_Class_9.var_127 = "; result += Test6712835.Printer.print(var_127);
+ result += "\n";
+ result += "Tester_Class_9.var_128 = "; result += Test6712835.Printer.print(var_128);
+ result += "\n";
+ result += "Tester_Class_9.var_133 = "; result += Test6712835.Printer.print(var_133);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+}
+
+
+final class Tester_Class_10 extends Tester_Class_0 {
+ final static byte var_138 = 78;
+ Object var_139;
+ final static boolean var_140 = true;
+ float var_141 = 1.2816267E38F;
+ Tester_Class_8 var_142;
+ static Tester_Class_3 var_143;
+ short var_144 = var_1 ? (Tester_Class_6.var_96 &= 8024552544994698240L) : Tester_Class_0.var_5;
+ final boolean var_145 = var_140;
+ long var_146;
+ float[] var_147;
+
+
+ public Tester_Class_10()
+ {
+ "xuc".codePointCount(new Tester_Class_6().var_99 / ((new Tester_Class_9().var_128 = new Tester_Class_2()).var_1 ? var_138 : (int)(Tester_Class_3.var_64 += Tester_Class_3.var_64)), 882345740);
+ Tester_Class_3.var_64 /= Tester_Class_9.var_132;
+ Tester_Class_9.var_127.indexOf((Tester_Class_7.var_114 = (Tester_Class_8.var_114 = (Tester_Class_5)(var_139 = "mcyagebtv"))).var_83 = var_145 ? (Tester_Class_2.var_45 = Tester_Class_3.var_58) : Tester_Class_6.var_96);
+ --Tester_Class_2.var_46;
+ final float var_148 = 3.0263434E38F;
+ ((Tester_Class_7.var_114 = (Tester_Class_5)(Tester_Class_9.var_133 = new Tester_Class_1())).var_85 & ((Tester_Class_1)(var_139 = new Tester_Class_6())).var_1 ? "gmxwrgik" : Tester_Class_9.var_127).compareTo(var_4);
+ --Tester_Class_2.var_46;
+ new Tester_Class_6();
+ ++Tester_Class_2.var_46;
+ Tester_Class_3.var_60 = Tester_Class_5.var_86 ? new Tester_Class_1() : new Tester_Class_1();
+ {
+ --Tester_Class_6.var_96;
+ ((Tester_Class_7)(var_139 = new Tester_Class_1().var_4)).var_112 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_1)(var_139 = "gugsy")));
+ }
+ Tester_Class_9.var_133 = (Tester_Class_3.var_60 = new Tester_Class_1());
+ if (var_140 & !var_140)
+ {
+ Tester_Class_6.var_96++;
+ }
+ else
+ {
+ Tester_Class_2.var_46++;
+ }
+ {
+ ++new Tester_Class_6().var_92;
+ }
+ Tester_Class_7.var_109 = (((new Tester_Class_4[Tester_Class_3.var_58])[Tester_Class_3.var_58]).var_69 = (var_143 = new Tester_Class_3()));
+ Tester_Class_3.var_63--;
+ }
+
+
+
+
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Tester_Class_10.var_147 = "; result += Test6712835.Printer.print(var_147);
+ result += "\n";
+ result += "Tester_Class_10.var_146 = "; result += Test6712835.Printer.print(var_146);
+ result += "\n";
+ result += "Tester_Class_10.var_3 = "; result += Test6712835.Printer.print(var_3);
+ result += "\n";
+ result += "Tester_Class_10.var_141 = "; result += Test6712835.Printer.print(var_141);
+ result += "\n";
+ result += "Tester_Class_10.var_5 = "; result += Test6712835.Printer.print(var_5);
+ result += "\n";
+ result += "Tester_Class_10.var_144 = "; result += Test6712835.Printer.print(var_144);
+ result += "\n";
+ result += "Tester_Class_10.var_138 = "; result += Test6712835.Printer.print(var_138);
+ result += "\n";
+ result += "Tester_Class_10.var_1 = "; result += Test6712835.Printer.print(var_1);
+ result += "\n";
+ result += "Tester_Class_10.var_140 = "; result += Test6712835.Printer.print(var_140);
+ result += "\n";
+ result += "Tester_Class_10.var_145 = "; result += Test6712835.Printer.print(var_145);
+ result += "\n";
+ result += "Tester_Class_10.var_139 = "; result += Test6712835.Printer.print(var_139);
+ result += "\n";
+ result += "Tester_Class_10.var_142 = "; result += Test6712835.Printer.print(var_142);
+ result += "\n";
+ result += "Tester_Class_10.var_2 = "; result += Test6712835.Printer.print(var_2);
+ result += "\n";
+ result += "Tester_Class_10.var_4 = "; result += Test6712835.Printer.print(var_4);
+ result += "\n";
+ result += "Tester_Class_10.var_143 = "; result += Test6712835.Printer.print(var_143);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+}
+
+
+interface Tester_Interface_11 {
+ public Tester_Class_4 func_0(final int arg_0, final byte arg_1);
+ public Tester_Class_2 func_1(Tester_Class_5 arg_0, final Tester_Class_0 arg_1, final int arg_2);
+}
+
+public class Test6712835 {
+ final boolean var_149 = false;
+ Tester_Class_8 var_150;
+ final long var_151 = 8058077687473630208L;
+
+
+ protected final Tester_Class_1 func_0(final Object arg_0, Tester_Class_3 arg_1, final Tester_Class_4 arg_2, int arg_3)
+ {
+ Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_1)arg_0));
+ --Tester_Class_3.var_63;
+ (var_150 = (((new Tester_Class_10[arg_2.var_71])[(((Tester_Class_6)arg_0).var_94 = arg_2).var_71 &= Tester_Class_3.var_63 << ~arg_2.var_71]).var_142 = (var_150 = (((Tester_Class_10)arg_0).var_142 = (Tester_Class_8)arg_0)))).var_113 = arg_2;
+ Tester_Class_7.var_114 = (Tester_Class_7.var_114 = false ? (Tester_Class_5)arg_0 : (Tester_Class_5)arg_0);
+ ((((arg_1 = arg_1).var_1 |= "lgcrda".equalsIgnoreCase("ontlkst")) ? (Tester_Class_1)arg_0 : (Tester_Class_3.var_60 = (Tester_Class_1)arg_0)).var_29 ? (arg_1 = (Tester_Class_3)(((Tester_Class_7)arg_0).var_112 = (Tester_Class_9)arg_0)) : arg_1).var_57 >>>= ']';
+ Tester_Class_8.var_114 = (Tester_Class_5)arg_0;
+ ((Tester_Class_3.var_55 &= (arg_1.var_1 = true)) ? (Tester_Class_6)(new Tester_Class_0[Tester_Class_3.var_58][Tester_Class_10.var_138])[Tester_Class_10.var_138][Tester_Class_10.var_138] : (Tester_Class_6)arg_0).var_94 = arg_2;
+ {
+ Tester_Class_3.var_55 &= ((Tester_Class_3.var_60 = new Tester_Class_1()).var_1 &= false);
+ Tester_Class_2.var_44 -= (arg_3 |= + ~6610561718704644096L);
+ ((Tester_Class_8)arg_0).var_113 = ((((Tester_Class_10)(Tester_Class_0)arg_0).var_142 = (var_150 = (Tester_Class_8)arg_0)).var_124 = arg_2);
+ (! (false | Tester_Class_5.var_86) ? (Tester_Class_10)arg_0 : (new Tester_Class_10[arg_1.var_61][arg_1.var_61])[Tester_Class_10.var_138][Tester_Class_10.var_138]).var_139 = ((Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_1)arg_0)).var_31 = (((Tester_Class_9)arg_0).var_128 = (((Tester_Class_9)arg_0).var_128 = (Tester_Class_2)arg_0)));
+ }
+ final Tester_Interface_11 var_152 = !((Tester_Class_1)arg_0).var_29 ^ Tester_Class_5.var_86 ? (new Tester_Interface_11[arg_2.var_71][arg_1.var_61])[arg_1.var_61][arg_1.var_61] : (new Tester_Interface_11[arg_2.var_71][arg_2.var_71])[Tester_Class_10.var_138][Tester_Class_3.var_58];
+ Tester_Class_3.var_64 /= (arg_3 >>= ++((Tester_Class_6)(Tester_Class_0)arg_0).var_92) * Tester_Class_9.var_132;
+ Tester_Class_0 var_153 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_1)arg_0))))).var_31 = (((new Tester_Class_9[arg_1.var_61])[arg_1.var_61 *= 634692606]).var_128 = !false ? (Tester_Class_2)arg_0 : (Tester_Class_2)arg_0);
+ (Tester_Class_10.var_140 ? (Tester_Class_7)arg_0 : (var_150 = (Tester_Class_8)(Tester_Class_7)arg_0)).var_112 = Tester_Class_3.var_64 != ((((Tester_Class_10)(var_153 = (Tester_Class_8.var_114 = (Tester_Class_5)arg_0))).var_1 |= arg_1.var_1) ? (Tester_Class_6)var_153 : (Tester_Class_6)var_153).var_99-- ? (Tester_Class_7)((var_150 = (Tester_Class_8)arg_0).var_112 = (Tester_Class_10)var_153) : (Tester_Class_7)arg_0;
+ (((new Tester_Class_7[Tester_Class_10.var_138][arg_2.var_71])[Tester_Class_3.var_58])[arg_2.var_71]).var_112 = arg_0;
+ if (!false)
+ {
+ arg_3 <<= (Tester_Class_2.var_46 /= - ((byte)((Tester_Class_10)arg_0).var_144)) - ((Tester_Class_6)arg_0).var_99;
+ }
+ else
+ {
+ ((Tester_Class_7)(((Tester_Class_8)arg_0).var_112 = var_153)).var_113 = arg_2;
+ ((Tester_Class_9)arg_0).var_128 = (((Tester_Class_9)(((Tester_Class_7)arg_0).var_112 = (Tester_Class_7)arg_0)).var_128 = (((Tester_Class_9)arg_0).var_128 = (Tester_Class_2)arg_0));
+ }
+ (((Tester_Class_10)arg_0).var_142 = (Tester_Class_8)arg_0).var_124 = (((Tester_Class_6)var_153).var_94 = arg_2);
+ final char var_154 = arg_1.var_57 %= ((Tester_Class_6)var_153).var_93--;
+ (true ? arg_1 : (arg_1 = arg_1)).equals(arg_0);
+ (Tester_Class_10.var_140 ? (new Tester_Class_6[Tester_Class_10.var_138])[arg_2.var_71] : (new Tester_Class_6[(Tester_Class_10.var_143 = arg_1).var_61])[arg_1.var_61]).var_94 = ((((new Tester_Class_7[arg_2.var_71][arg_1.var_61][Tester_Class_10.var_138])[Tester_Class_10.var_138])[arg_2.var_71 = arg_2.var_71][Tester_Class_10.var_138]).var_113 = (((Tester_Class_7)arg_0).var_113 = arg_2));
+ Tester_Class_3.var_60 = ((Tester_Class_10)(((Tester_Class_7)arg_0).var_112 = (Tester_Class_7)(((Tester_Class_10)var_153).var_139 = new Tester_Class_6[Tester_Class_10.var_138][Tester_Class_10.var_138]))).var_1 ? (Tester_Class_3.var_60 = (Tester_Class_1)var_153) : (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_1)(Tester_Class_9.var_133 = (Tester_Class_10)arg_0)));
+ ((Tester_Class_7)(((Tester_Class_10)arg_0).var_139 = new Tester_Class_10[Tester_Class_3.var_58][--arg_2.var_71])).var_112 = new byte[(((Tester_Class_8)(Tester_Class_7)((var_150 = (var_150 = (Tester_Class_8)arg_0)).var_112 = arg_2)).var_113 = (((Tester_Class_7)arg_0).var_113 = arg_2)).var_71];
+ Tester_Class_8 var_155;
+ (Tester_Class_3.var_55 & arg_2.equals(arg_0) ? (Tester_Class_10)var_153 : (Tester_Class_10)var_153).var_3 %= Tester_Class_6.var_91;
+ return ((Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_1)var_153)))).var_29 ? ! !true : Tester_Class_10.var_140 | Tester_Class_3.var_55) || Tester_Class_3.var_55 ? (Tester_Class_3.var_60 = (Tester_Class_1)(((Tester_Class_10)var_153).var_139 = (Tester_Class_6)var_153)) : new Tester_Class_1();
+ }
+
+ protected Tester_Class_5 func_1(Tester_Class_0 arg_0, final float arg_1)
+ {
+ (!Tester_Class_10.var_140 ? (Tester_Class_6)arg_0 : (Tester_Class_6)arg_0).var_90 /= ((Tester_Class_8.var_109 = (new boolean[Tester_Class_10.var_138][Tester_Class_3.var_58])[((Tester_Class_6)arg_0).var_99][Tester_Class_10.var_138] ? (Tester_Class_3)((Tester_Class_3.var_60 = (Tester_Class_1)arg_0).var_31 = (Tester_Class_6)arg_0) : (Tester_Class_3)arg_0).var_61 *= Tester_Class_3.var_58);
+ {
+ "".toLowerCase();
+ }
+ ((Tester_Class_10)arg_0).var_139 = new Tester_Class_8();
+ arg_0 = (new Tester_Class_6[((Tester_Class_6)arg_0).var_99])[Tester_Class_3.var_58];
+ if (((Tester_Class_10)(arg_0 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_1)arg_0)))).var_145)
+ {
+ Tester_Class_3.var_63++;
+ }
+ else
+ {
+ ++Tester_Class_2.var_46;
+ }
+ (((Tester_Class_3.var_55 ^= Tester_Class_3.var_55 ^ true) ? (Tester_Class_10)arg_0 : (Tester_Class_10)arg_0).var_145 || true ? (Tester_Class_6)arg_0 : (Tester_Class_6)(((Tester_Class_7)(((Tester_Class_10)arg_0).var_139 = (Tester_Class_10)arg_0)).var_112 = "jlixai")).var_99--;
+ Tester_Class_5.var_81 = Tester_Class_3.var_55 && ! (arg_0.var_1 = arg_0.var_1);
+ {
+ ((new Tester_Class_6[Tester_Class_3.var_58])[(true ? (Tester_Class_6)(Tester_Class_9.var_133 = (Tester_Class_10)arg_0) : (Tester_Class_6)(((Tester_Class_1)arg_0).var_31 = (Tester_Class_10)arg_0)).var_99]).var_90 *= (Tester_Class_3.var_64 %= Tester_Class_3.var_63);
+ }
+ ++Tester_Class_2.var_46;
+ Tester_Class_0 var_156;
+ Tester_Class_2.var_46++;
+ Tester_Class_8.var_114 = (Tester_Class_7.var_114 = (Tester_Class_8.var_114 = (Tester_Class_5)arg_0));
+ Tester_Class_6.func_2((Tester_Class_7.var_114 = (Tester_Class_7.var_114 = (Tester_Class_7.var_114 = (Tester_Class_5)arg_0))).var_83 = (byte)(((Tester_Class_10)arg_0).var_142 = (new Tester_Class_8[Tester_Class_3.var_58][Tester_Class_3.var_58])[Tester_Class_3.var_58][Tester_Class_10.var_138]).var_110, Tester_Class_6.var_96, (new byte[Tester_Class_3.var_58])[Tester_Class_10.var_138]);
+ Tester_Class_7.var_114 = (new Tester_Class_5[Tester_Class_10.var_138])[((Tester_Class_3)arg_0).var_61];
+ boolean var_157 = Tester_Class_10.var_140;
+ (Tester_Class_3.var_60 = (Tester_Class_1)arg_0).var_1 ^= Tester_Class_10.var_140;
+ return Tester_Class_8.var_114 = (Tester_Class_7.var_114 = (Tester_Class_8.var_114 = (Tester_Class_5)arg_0));
+ }
+
+ final static int func_2(Tester_Class_6 arg_0)
+ {
+ new Tester_Class_9();
+ {
+ ++Tester_Class_3.var_63;
+ }
+ new Tester_Class_3().var_57--;
+ Tester_Class_1 var_158;
+ String var_159;
+ --Tester_Class_6.var_96;
+ {
+ new String();
+ }
+ var_159 = (var_159 = arg_0.var_4);
+ {
+ --Tester_Class_2.var_46;
+ }
+ final double var_160 = (Tester_Class_7.var_114 = (Tester_Class_8.var_114 = (Tester_Class_8.var_114 = (Tester_Class_5)(new Tester_Class_0[arg_0.var_99][arg_0.var_99])[Tester_Class_3.var_58][Tester_Class_3.var_58]))).var_1 ? Tester_Class_9.var_132 : Tester_Class_6.var_97;
+ Tester_Class_8 var_161;
+ char var_162 = 'O';
+ Tester_Class_2.var_46++;
+ Tester_Class_6.var_96++;
+ {
+ new String();
+ }
+ ++Tester_Class_6.var_96;
+ var_162 >>= ((new Tester_Class_4[arg_0.var_99])[arg_0.var_99++]).var_70 >> Tester_Class_6.var_91;
+ (Tester_Class_7.var_114 = (Tester_Class_7.var_114 = (new Tester_Class_5[Tester_Class_3.var_58])[++arg_0.var_99])).var_83 = (arg_0.var_93 <<= Tester_Class_7.var_108);
+ --Tester_Class_6.var_96;
+ {
+ new Tester_Class_9().var_128 = new Tester_Class_2();
+ }
+ arg_0 = arg_0;
+ {
+ Tester_Class_9 var_163;
+ }
+ ((Tester_Class_5)(Tester_Class_9.var_133 = arg_0)).var_83 = (arg_0.var_99 >>= Tester_Class_5.var_5);
+ arg_0.var_99 = Tester_Class_10.var_138;
+ Tester_Class_3.var_60 = (var_158 = (Tester_Class_3.var_60 = (Tester_Class_1)(Tester_Class_9.var_133 = arg_0)));
+ return Tester_Class_6.var_91;
+ }
+
+ protected final Tester_Class_9 func_3()
+ {
+ Tester_Class_2.var_44 = 3210658399310388224L;
+ ++Tester_Class_6.var_96;
+ short var_164 = 15978;
+ var_164++;
+ Tester_Class_5.var_81 = true;
+ return Tester_Class_3.var_55 ? new Tester_Class_9() : new Tester_Class_9();
+ }
+
+ final static Tester_Class_10 func_4(Tester_Class_3 arg_0, String arg_1, final byte[] arg_2, final Object arg_3)
+ {
+ Tester_Class_1 var_165;
+ Tester_Class_3.var_63 += new Tester_Class_6().var_92 >= 3821095133162842112L ? (arg_0.var_61 |= Tester_Class_6.var_91) : Tester_Class_10.var_138;
+ return false ? ((var_165 = (Tester_Class_1)arg_3).var_29 ? (Tester_Class_10)arg_3 : (Tester_Class_10)arg_3) : (Tester_Class_10)(Tester_Class_0)arg_3;
+ }
+
+ private static Object func_7(final short arg_0, String arg_1, final Tester_Class_3 arg_2)
+ {
+ Tester_Class_3.var_60 = (new Tester_Class_1[arg_2.var_61])[Tester_Class_10.var_138];
+ return ((new Tester_Class_7[arg_2.var_61 |= Tester_Class_3.var_63])[arg_2.var_61 *= Tester_Class_6.var_98]).var_112 = new Tester_Class_8();
+ }
+
+ public static String execute()
+ {
+ try {
+ Test6712835 t = new Test6712835();
+ try { t.test(); }
+ catch(Throwable e) { }
+ try { return t.toString(); }
+ catch (Throwable e) { return "Error during result conversion to String"; }
+ } catch (Throwable e) { return "Error during test execution"; }
+ }
+
+ public static void main(String[] args)
+ {
+ try {
+ Test6712835 t = new Test6712835();
+ try { t.test(); }
+ catch(Throwable e) { }
+ try { System.out.println(t); }
+ catch(Throwable e) { }
+ } catch (Throwable e) { }
+ }
+
+ private void test()
+ {
+ Tester_Class_3.var_60 = true ? (Tester_Class_3.var_60 = new Tester_Class_1()) : new Tester_Class_1();
+ double var_170 = 0;
+ Tester_Class_9.var_133 = (new Tester_Class_4().var_69 = new Tester_Class_3());
+ new Tester_Class_6();
+ String var_171;
+ new Tester_Class_9();
+ do
+ {
+ new String();
+ var_170++;
+ Tester_Class_3.var_64 = 1.0240330514364089E307;
+ new String();
+ var_171 = (var_171 = Tester_Class_9.var_127);
+ Tester_Class_3.var_63--;
+ } while (var_170 < 525);
+ ((new Tester_Class_10[Tester_Class_10.var_138])[Tester_Class_2.var_45 = Tester_Class_3.var_58]).var_142 = (Tester_Class_8)(Tester_Class_7)(new Tester_Class_10().var_139 = new Tester_Class_2());
+ long var_172 = 0L;
+ Tester_Class_3.var_64 /= (((new Tester_Class_6[Tester_Class_3.var_58])[Tester_Class_10.var_138]).var_99 ^= ((new Tester_Class_6[Tester_Class_3.var_58])[Tester_Class_10.var_138]).var_90) > 9.462466046830147E307 ? new Tester_Class_6().var_99 : Tester_Class_3.var_58;
+ short var_173;
+ (true ? new Tester_Class_2() : (func_3().var_128 = new Tester_Class_2())).var_3 *= (var_150 = new Tester_Class_8()).var_115;
+ (Tester_Class_3.var_60 = new Tester_Class_1()).var_31 = (((new Tester_Class_9[Tester_Class_3.var_58])[Tester_Class_10.var_138]).var_128 = (func_3().var_128 = (func_3().var_128 = (new Tester_Class_9().var_128 = new Tester_Class_2()))));
+ for (((new Tester_Class_10[new Tester_Class_6().var_99])[new Tester_Class_6().var_99++]).var_142 = (new Tester_Class_8[Tester_Class_10.var_138])[Tester_Class_3.var_58]; var_172 < 203 && (Tester_Class_3.var_55 &= (new boolean[Tester_Class_2.var_45 = Tester_Class_3.var_58])[Tester_Class_10.var_138]); Tester_Class_9.var_133 = (Tester_Class_7.var_114 = (new Tester_Class_5[Tester_Class_2.var_45 = Tester_Class_10.var_138][Tester_Class_10.var_138])[Tester_Class_3.var_58][Tester_Class_2.var_45 = Tester_Class_3.var_58]))
+ {
+ var_171 = Tester_Class_9.var_127;
+ var_172++;
+ Tester_Class_3.var_63++;
+ Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_1)(new Object[Tester_Class_3.var_58][Tester_Class_10.var_138])[Tester_Class_3.var_58][Tester_Class_3.var_58])));
+ ++Tester_Class_2.var_46;
+ Tester_Class_2.var_46--;
+ Tester_Class_3.var_64 -= Tester_Class_3.var_58;
+ }
+ (Tester_Class_3.var_60 = new Tester_Class_1()).var_31 = ((new Tester_Class_8().var_124 = new Tester_Class_4()).var_69 = new Tester_Class_3());
+ int var_174 = 0;
+ ((new Tester_Class_6[Tester_Class_10.var_138][Tester_Class_10.var_138])[Tester_Class_2.var_45 = Tester_Class_10.var_138][Tester_Class_2.var_45 = Tester_Class_3.var_58]).var_92 = 'Z';
+ while ((Tester_Class_9.var_131 = Tester_Class_3.var_55) && (var_174 < 24 && !true))
+ {
+ new Tester_Class_10();
+ var_174++;
+ Tester_Class_3.var_64 %= (((new Tester_Class_6[Tester_Class_3.var_58])[Tester_Class_2.var_45 = Tester_Class_3.var_58]).var_93 ^= (byte)Tester_Class_3.var_59);
+ ((Tester_Class_10)(Tester_Class_9.var_133 = (new Tester_Class_5[((Tester_Class_6)(new Tester_Class_0[Tester_Class_10.var_138])[(byte)(Tester_Class_2.var_46 >>>= Tester_Class_7.var_108)]).var_99])[Tester_Class_10.var_138])).var_139 = (new Tester_Class_10[new Tester_Class_6().var_99][new Tester_Class_4().var_71])[new Tester_Class_4().var_71];
+ }
+ int var_175 = 0;
+ (Tester_Class_10.var_140 ? (Tester_Class_2)(Tester_Class_9.var_133 = (Tester_Class_7.var_114 = (new Tester_Class_5[Tester_Class_10.var_138])[Tester_Class_10.var_138])) : new Tester_Class_2()).var_1 &= Tester_Class_3.var_55;
+ do
+ {
+ Tester_Class_10.var_143 = new Tester_Class_3();
+ var_175++;
+ ++Tester_Class_2.var_46;
+ } while ((false ? true : var_149) | !Tester_Class_10.var_140 && var_175 < 97);
+ Tester_Class_9.var_131 = true;
+ (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = (Tester_Class_3.var_60 = new Tester_Class_1())))).var_1 &= (((new Tester_Class_10().var_1 = !true) ? new Tester_Class_10() : new Tester_Class_10()).var_145 ? new Tester_Class_3() : new Tester_Class_3()).var_1;
+ (true ? func_3() : func_3()).var_128 = ((((Tester_Class_5.var_86 = (Tester_Class_3.var_55 &= !var_149)) ? new Tester_Class_10() : new Tester_Class_10()).var_145 ? new Tester_Class_9() : func_3()).var_128 = var_149 ? new Tester_Class_2() : new Tester_Class_2());
+ Tester_Class_3.var_59 -= (Tester_Class_5.var_81 = new Tester_Class_1().var_29) ^ !true ? 7920143378515332096L : new Tester_Class_6().var_92;
+ ((Tester_Class_3.var_60 = new Tester_Class_1()).var_1 ? (new Tester_Class_5[Tester_Class_10.var_138][Tester_Class_3.var_58])[Tester_Class_3.var_58][Tester_Class_3.var_58] : (Tester_Class_8.var_114 = new Tester_Class_5())).var_83 = Tester_Class_10.var_140 ? (Tester_Class_3.var_63 -= 2.0167496E38F) : ++Tester_Class_3.var_63;
+ double var_176 = 9.327780852480363E307;
+ }
+ public String toString()
+ {
+ String result = "[\n";
+ result += "Test6712835.var_151 = "; result += Printer.print(var_151);
+ result += "\n";
+ result += "Test6712835.var_149 = "; result += Printer.print(var_149);
+ result += "\n";
+ result += "Test6712835.var_150 = "; result += Printer.print(var_150);
+ result += "";
+ result += "\n]";
+ return result;
+ }
+ static class Printer
+ {
+ public static String print(boolean arg) { return String.valueOf(arg); }
+ public static String print(byte arg) { return String.valueOf(arg); }
+ public static String print(short arg) { return String.valueOf(arg); }
+ public static String print(char arg) { return String.valueOf((int)arg); }
+ public static String print(int arg) { return String.valueOf(arg); }
+ public static String print(long arg) { return String.valueOf(arg); }
+ public static String print(float arg) { return String.valueOf(arg); }
+ public static String print(double arg) { return String.valueOf(arg); }
+
+
+ public static String print(Object arg)
+ {
+ return print_r(new java.util.Stack(), arg);
+ }
+
+ private static String print_r(java.util.Stack visitedObjects, Object arg)
+ {
+ String result = "";
+ if (arg == null)
+ result += "null";
+ else
+ if (arg.getClass().isArray())
+ {
+ for (int i = 0; i < visitedObjects.size(); i++)
+ if (visitedObjects.elementAt(i) == arg) return "<recursive>";
+
+ visitedObjects.push(arg);
+
+ final String delimiter = ", ";
+ result += "[";
+
+ if (arg instanceof Object[])
+ {
+ Object[] array = (Object[]) arg;
+ for (int i = 0; i < array.length; i++)
+ {
+ result += print_r(visitedObjects, array[i]);
+ if (i < array.length - 1) result += delimiter;
+ }
+ }
+ else
+ if (arg instanceof boolean[])
+ {
+ boolean[] array = (boolean[]) arg;
+ for (int i = 0; i < array.length; i++)
+ {
+ result += print(array[i]);
+ if (i < array.length - 1) result += delimiter;
+ }
+ }
+ else
+ if (arg instanceof byte[])
+ {
+ byte[] array = (byte[]) arg;
+ for (int i = 0; i < array.length; i++)
+ {
+ result += print(array[i]);
+ if (i < array.length - 1) result += delimiter;
+ }
+ }
+ else
+ if (arg instanceof short[])
+ {
+ short[] array = (short[]) arg;
+ for (int i = 0; i < array.length; i++)
+ {
+ result += print(array[i]);
+ if (i < array.length - 1) result += delimiter;
+ }
+ }
+ else
+ if (arg instanceof char[])
+ {
+ char[] array = (char[]) arg;
+ for (int i = 0; i < array.length; i++)
+ {
+ result += print(array[i]);
+ if (i < array.length - 1) result += delimiter;
+ }
+ }
+ else
+ if (arg instanceof int[])
+ {
+ int[] array = (int[]) arg;
+ for (int i = 0; i < array.length; i++)
+ {
+ result += print(array[i]);
+ if (i < array.length - 1) result += delimiter;
+ }
+ }
+ else
+ if (arg instanceof long[])
+ {
+ long[] array = (long[]) arg;
+ for (int i = 0; i < array.length; i++)
+ {
+ result += print(array[i]);
+ if (i < array.length - 1) result += delimiter;
+ }
+ }
+ else
+ if (arg instanceof float[])
+ {
+ float[] array = (float[]) arg;
+ for (int i = 0; i < array.length; i++)
+ {
+ result += print(array[i]);
+ if (i < array.length - 1) result += delimiter;
+ }
+ }
+ else
+ if (arg instanceof double[])
+ {
+ double[] array = (double[]) arg;
+ for (int i = 0; i < array.length; i++)
+ {
+ result += print(array[i]);
+ if (i < array.length - 1) result += delimiter;
+ }
+ }
+
+ result += "]";
+ visitedObjects.pop();
+
+ } else
+ {
+ result += arg.toString();
+ }
+
+ return result;
+ }
+ }
+}
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/hotspot/test/compiler/6724218/Test.java Thu Jul 31 13:42:21 2008 -0700
@@ -0,0 +1,98 @@
+/*
+ * Copyright 2008 Sun Microsystems, Inc. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ */
+
+/*
+ * @test
+ * @bug 6724218
+ * @summary Fix raise_LCA_above_marks() early termination
+ * @run main/othervm -Xbatch -XX:CompileCommand=exclude,Test.update Test
+ */
+
+public class Test {
+ Test next = null;
+ Object value = null;
+
+ static boolean _closed = false;
+ static int size = 0;
+ static Test list = null;
+ static int cache_size = 0;
+ static Test cache = null;
+
+ Object get(int i) {
+ Test t = list;
+ list = t.next;
+ size -= 1;
+ Object o = t.value;
+ if (i > 0) {
+ t.next = cache;
+ t.value = null;
+ cache = t;
+ cache_size = +1;
+ }
+ return o;
+ }
+
+ void update() {
+ // Exclude compilation of this one.
+ if (size == 0) {
+ Test t;
+ if (cache_size > 0) {
+ t = cache;
+ cache = t.next;
+ cache_size = -1;
+ } else {
+ t = new Test();
+ }
+ t.value = new Object();
+ t.next = list;
+ list = t;
+ size += 1;
+ }
+ }
+
+ synchronized Object test(int i) {
+ while (true) {
+ if (_closed) {
+ return null;
+ } else if (size > 0) {
+ return get(i);
+ }
+ update();
+ }
+ }
+
+ public static void main(String argv[]) throws Exception {
+ Test t = new Test();
+ int lim = 500000;
+ Object o;
+ for (int j = 0; j < lim; j++) {
+ o = t.test(j&1);
+ if (o == null) {
+ throw new Exception("*** Failed on iteration " + j);
+ }
+ if ((j&1) == 0) {
+ t.update();
+ }
+ }
+ }
+}
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/hotspot/test/compiler/6726999/Test.java Thu Jul 31 13:42:21 2008 -0700
@@ -0,0 +1,1419 @@
+/*
+ * Copyright 2008 Sun Microsystems, Inc. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ *
+ */
+
+/*
+ * @test
+ * @bug 6726999
+ * @summary nsk/stress/jck12a/jck12a010 assert(n != NULL,"Bad immediate dominator info.");
+ * @run main/othervm -Xbatch -XX:CompileCommand=exclude,Test.dummy -XX:+AggressiveOpts Test
+ */
+
+import java.lang.reflect.Array;
+
+class Point {
+ int x;
+ int y;
+}
+
+public class Test {
+
+ void dummy() {
+ // Empty method to verify correctness of DebugInfo.
+ // Use -XX:CompileCommand=exclude,Test.dummy
+ }
+
+ int test0_0_0(int y) {
+ int x = 3;
+ Point p = new Point();
+ dummy();
+ p.x = x;
+ p.y = 3 * x + y;
+ return p.x * p.y;
+ }
+
+ int test0_0_1(int y) {
+ int x = 3;
+ Point p = null;
+ dummy();
+ p = new Point();
+ dummy();
+ p.x = x;
+ p.y = 3 * x + y;
+ return p.x * p.y;
+ }
+
+ int test0_0_2(int y) {
+ int x = 3;
+ Point p = new Point();
+ dummy();
+ p = new Point();
+ dummy();
+ p.x = x;
+ p.y = 3 * x + y;
+ return p.x * p.y;
+ }
+
+ int test0_0_3(int y) {
+ int x = 3;
+ Point p[] = new Point[1];
+ p[0] = new Point();
+ dummy();
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ return p[0].x * p[0].y;
+ }
+
+ int test0_0_4(int y) {
+ int x = 3;
+ Point p[] = new Point[1];
+ dummy();
+ p[0] = new Point();
+ dummy();
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ return p[0].x * p[0].y;
+ }
+
+ int test0_0_5(int y) {
+ int x = 3;
+ Point p[] = new Point[1];
+ dummy();
+ p[0] = null;
+ dummy();
+ p[0] = new Point();
+ dummy();
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ return p[0].x * p[0].y;
+ }
+
+ int test0_0_6(int y) {
+ int x = 3;
+ Point p[] = new Point[1];
+ p[0] = new Point();
+ dummy();
+ p[0] = new Point();
+ dummy();
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ return p[0].x * p[0].y;
+ }
+
+ int test0_1_3(int y) {
+ int x = 3;
+ Point p1 = new Point();
+ dummy();
+ Point p[] = new Point[1];
+ p[0] = p1;
+ dummy();
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ return p[0].x * p[0].y;
+ }
+
+ int test0_1_4(int y) {
+ int x = 3;
+ Point p1 = new Point();
+ dummy();
+ Point p[] = new Point[1];
+ dummy();
+ p[0] = p1;
+ dummy();
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ return p[0].x * p[0].y;
+ }
+
+ int test0_1_5(int y) {
+ int x = 3;
+ Point p1 = new Point();
+ dummy();
+ Point p[] = new Point[1];
+ dummy();
+ p[0] = null;
+ dummy();
+ p[0] = p1;
+ dummy();
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ return p[0].x * p[0].y;
+ }
+
+ int test0_1_6(int y) {
+ int x = 3;
+ Point p1 = new Point();
+ dummy();
+ Point p2 = new Point();
+ dummy();
+ Point p[] = new Point[1];
+ p[0] = p1;
+ dummy();
+ p[0] = p2;
+ dummy();
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ return p[0].x * p[0].y;
+ }
+
+ int test1_0_0(int y) {
+ Point p = new Point();
+ if ( (y & 1) == 1 ) {
+ p = new Point();
+ }
+ int x = 3;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test1_0_1(int y) {
+ Point p = null;
+ if ( (y & 1) == 1 ) {
+ p = new Point();
+ }
+ int x = 3;
+ if ( p == null )
+ return (3 * x + y) * x;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test1_0_2(int y) {
+ Point p[] = new Point[1];
+ if ( (y & 1) == 1 ) {
+ p[0] = new Point();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_0_3(int y) {
+ Point p[] = new Point[1];
+ p[0] = null;
+ if ( (y & 1) == 1 ) {
+ p[0] = new Point();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_0_4(int y) {
+ Point p[] = new Point[1];
+ p[0] = new Point();
+ if ( (y & 1) == 1 ) {
+ p[0] = new Point();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_0_5(int y) {
+ Point p[] = new Point[1];
+ if ( (y & 1) == 1 ) {
+ p[0] = new Point();
+ } else {
+ p[0] = null;
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_0_6(int y) {
+ Point p[] = new Point[1];
+ if ( (y & 1) == 1 ) {
+ p[0] = new Point();
+ } else {
+ p[0] = new Point();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_1_0(int y) {
+ Point p = new Point();
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p = new Point();
+ dummy();
+ }
+ int x = 3;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test1_1_1(int y) {
+ Point p = null;
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p = new Point();
+ dummy();
+ }
+ int x = 3;
+ if ( p == null )
+ return (3 * x + y) * x;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test1_1_2(int y) {
+ Point p[] = new Point[1];
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p[0] = new Point();
+ dummy();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_1_3(int y) {
+ Point p[] = new Point[1];
+ dummy();
+ p[0] = null;
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p[0] = new Point();
+ dummy();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_1_4(int y) {
+ Point p[] = new Point[1];
+ dummy();
+ p[0] = new Point();
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p[0] = new Point();
+ dummy();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_1_5(int y) {
+ Point p[] = new Point[1];
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p[0] = new Point();
+ dummy();
+ } else {
+ dummy();
+ p[0] = null;
+ dummy();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_1_6(int y) {
+ Point p[] = new Point[1];
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p[0] = new Point();
+ dummy();
+ } else {
+ dummy();
+ p[0] = new Point();
+ dummy();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_2_0(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p = new Point();
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p = p1;
+ dummy();
+ }
+ int x = 3;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test1_2_1(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p = null;
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p = p1;
+ dummy();
+ }
+ int x = 3;
+ if ( p == null )
+ return (3 * x + y) * x;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test1_2_2(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p[] = new Point[1];
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p[0] = p1;
+ dummy();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_2_3(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p[] = new Point[1];
+ dummy();
+ p[0] = null;
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p[0] = p1;
+ dummy();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_2_4(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p2 = new Point();
+ dummy();
+ Point p[] = new Point[1];
+ dummy();
+ p[0] = p1;
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p[0] = p2;
+ dummy();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_2_5(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p[] = new Point[1];
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p[0] = p1;
+ dummy();
+ } else {
+ dummy();
+ p[0] = null;
+ dummy();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test1_2_6(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p2 = new Point();
+ dummy();
+ Point p[] = new Point[1];
+ if ( (y & 1) == 1 ) {
+ dummy();
+ p[0] = p1;
+ dummy();
+ } else {
+ dummy();
+ p[0] = p2;
+ dummy();
+ }
+ int x = 3;
+ if ( p[0] == null )
+ return (3 * x + y) * x;
+ p[0].x = x;
+ p[0].y = 3 * x + y;
+ dummy();
+ return p[0].x * p[0].y;
+ }
+
+ int test2_0_0(int y) {
+ Point p = new Point();
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ p = new Point();
+ }
+ int x = 3;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test2_0_1(int y) {
+ Point p = null;
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ p = new Point();
+ }
+ int x = 3;
+ if ( p == null )
+ return (3 * x + y) * x;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test2_0_2(int y) {
+ Point p[] = new Point[3];
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ p[i] = new Point();
+ }
+ int x = 3;
+ int j = (y & 1);
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_0_3(int y) {
+ Point p[] = new Point[3];
+ int j = (y & 1);
+ p[j] = null;
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ p[i] = new Point();
+ }
+ int x = 3;
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_0_4(int y) {
+ Point p[] = new Point[3];
+ int j = (y & 1);
+ p[j] = new Point();
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ p[i] = new Point();
+ }
+ int x = 3;
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_0_5(int y) {
+ Point p[] = new Point[3];
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ p[i] = new Point();
+ }
+ for (int i = 0; i < lim; i++) {
+ p[i] = null;
+ }
+ int x = 3;
+ int j = (y & 1);
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_0_6(int y) {
+ Point p[] = new Point[3];
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ p[i] = new Point();
+ }
+ for (int i = 0; i < lim; i++) {
+ p[i] = new Point();
+ }
+ int x = 3;
+ int j = (y & 1);
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_1_0(int y) {
+ Point p = new Point();
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p = new Point();
+ dummy();
+ }
+ int x = 3;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test2_1_1(int y) {
+ Point p = null;
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p = new Point();
+ dummy();
+ }
+ int x = 3;
+ if ( p == null )
+ return (3 * x + y) * x;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test2_1_2(int y) {
+ Point p[] = new Point[3];
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = new Point();
+ dummy();
+ }
+ int x = 3;
+ int j = (y & 1);
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_1_3(int y) {
+ Point p[] = new Point[3];
+ dummy();
+ int j = (y & 1);
+ p[j] = null;
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = new Point();
+ dummy();
+ }
+ int x = 3;
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_1_4(int y) {
+ Point p[] = new Point[3];
+ dummy();
+ int j = (y & 1);
+ p[j] = new Point();
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = new Point();
+ dummy();
+ }
+ int x = 3;
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_1_5(int y) {
+ Point p[] = new Point[3];
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = new Point();
+ dummy();
+ }
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = null;
+ dummy();
+ }
+ int x = 3;
+ int j = (y & 1);
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_1_6(int y) {
+ Point p[] = new Point[3];
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = new Point();
+ dummy();
+ }
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = new Point();
+ dummy();
+ }
+ int x = 3;
+ int j = (y & 1);
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_2_0(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p = new Point();
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p = p1;
+ dummy();
+ }
+ int x = 3;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test2_2_1(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p = null;
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p = p1;
+ dummy();
+ }
+ int x = 3;
+ if ( p == null )
+ return (3 * x + y) * x;
+ p.x = x;
+ p.y = 3 * x + y;
+ dummy();
+ return p.x * p.y;
+ }
+
+ int test2_2_2(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p[] = new Point[3];
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = p1;
+ dummy();
+ }
+ int x = 3;
+ int j = (y & 1);
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_2_3(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p[] = new Point[3];
+ dummy();
+ int j = (y & 1);
+ p[j] = null;
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = p1;
+ dummy();
+ }
+ int x = 3;
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_2_4(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p2 = new Point();
+ dummy();
+ Point p[] = new Point[3];
+ dummy();
+ int j = (y & 1);
+ p[j] = p1;
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = p2;
+ dummy();
+ }
+ int x = 3;
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_2_5(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p[] = new Point[3];
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = p1;
+ dummy();
+ }
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = null;
+ dummy();
+ }
+ int x = 3;
+ int j = (y & 1);
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ int test2_2_6(int y) {
+ Point p1 = new Point();
+ dummy();
+ Point p2 = new Point();
+ dummy();
+ Point p[] = new Point[3];
+ int lim = (y & 3);
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = p1;
+ dummy();
+ }
+ for (int i = 0; i < lim; i++) {
+ dummy();
+ p[i] = p2;
+ dummy();
+ }
+ int x = 3;
+ int j = (y & 1);
+ if ( p[j] == null )
+ return (3 * x + y) * x;
+ p[j].x = x;
+ p[j].y = 3 * x + y;
+ dummy();
+ return p[j].x * p[0].y;
+ }
+
+ public static void main(String args[]) {
+ Test tsr = new Test();
+ Point p = new Point();
+ Point ptmp = p;
+ Class cls = Point.class;
+ int y = 0;
+ for (int i=0; i<10000; i++) {
+ y = tsr.test0_0_0(y);
+ y = tsr.test0_0_0(y);
+ y = tsr.test0_0_1(y);
+ y = tsr.test0_0_1(y);
+ y = tsr.test0_0_2(y);
+ y = tsr.test0_0_2(y);
+ y = tsr.test0_0_3(y);
+ y = tsr.test0_0_3(y);
+ y = tsr.test0_0_4(y);
+ y = tsr.test0_0_4(y);
+ y = tsr.test0_0_5(y);
+ y = tsr.test0_0_5(y);
+ y = tsr.test0_0_6(y);
+ y = tsr.test0_0_6(y);
+
+ y = tsr.test0_1_3(y);
+ y = tsr.test0_1_3(y);
+ y = tsr.test0_1_4(y);
+ y = tsr.test0_1_4(y);
+ y = tsr.test0_1_5(y);
+ y = tsr.test0_1_5(y);
+ y = tsr.test0_1_6(y);
+ y = tsr.test0_1_6(y);
+
+ y = tsr.test1_0_0(y&~1);
+ y = tsr.test1_0_1(y&~1);
+ y = tsr.test1_0_2(y&~1);
+ y = tsr.test1_0_3(y&~1);
+ y = tsr.test1_0_4(y&~1);
+ y = tsr.test1_0_5(y&~1);
+ y = tsr.test1_0_6(y&~1);
+ y = tsr.test1_0_0((y&~1)+1);
+ y = tsr.test1_0_1((y&~1)+1);
+ y = tsr.test1_0_2((y&~1)+1);
+ y = tsr.test1_0_3((y&~1)+1);
+ y = tsr.test1_0_4((y&~1)+1);
+ y = tsr.test1_0_5((y&~1)+1);
+ y = tsr.test1_0_6((y&~1)+1);
+
+ y = tsr.test1_1_0(y&~1);
+ y = tsr.test1_1_1(y&~1);
+ y = tsr.test1_1_2(y&~1);
+ y = tsr.test1_1_3(y&~1);
+ y = tsr.test1_1_4(y&~1);
+ y = tsr.test1_1_5(y&~1);
+ y = tsr.test1_1_6(y&~1);
+ y = tsr.test1_1_0((y&~1)+1);
+ y = tsr.test1_1_1((y&~1)+1);
+ y = tsr.test1_1_2((y&~1)+1);
+ y = tsr.test1_1_3((y&~1)+1);
+ y = tsr.test1_1_4((y&~1)+1);
+ y = tsr.test1_1_5((y&~1)+1);
+ y = tsr.test1_1_6((y&~1)+1);
+
+ y = tsr.test1_2_0(y&~1);
+ y = tsr.test1_2_1(y&~1);
+ y = tsr.test1_2_2(y&~1);
+ y = tsr.test1_2_3(y&~1);
+ y = tsr.test1_2_4(y&~1);
+ y = tsr.test1_2_5(y&~1);
+ y = tsr.test1_2_6(y&~1);
+ y = tsr.test1_2_0((y&~1)+1);
+ y = tsr.test1_2_1((y&~1)+1);
+ y = tsr.test1_2_2((y&~1)+1);
+ y = tsr.test1_2_3((y&~1)+1);
+ y = tsr.test1_2_4((y&~1)+1);
+ y = tsr.test1_2_5((y&~1)+1);
+ y = tsr.test1_2_6((y&~1)+1);
+
+ y = tsr.test2_0_0(y&~3);
+ y = tsr.test2_0_1(y&~3);
+ y = tsr.test2_0_2(y&~3);
+ y = tsr.test2_0_3(y&~3);
+ y = tsr.test2_0_4(y&~3);
+ y = tsr.test2_0_5(y&~3);
+ y = tsr.test2_0_6(y&~3);
+ y = tsr.test2_0_0((y&~3)+3);
+ y = tsr.test2_0_1((y&~3)+3);
+ y = tsr.test2_0_2((y&~3)+3);
+ y = tsr.test2_0_3((y&~3)+3);
+ y = tsr.test2_0_4((y&~3)+3);
+ y = tsr.test2_0_5((y&~3)+3);
+ y = tsr.test2_0_6((y&~3)+3);
+
+ y = tsr.test2_1_0(y&~3);
+ y = tsr.test2_1_1(y&~3);
+ y = tsr.test2_1_2(y&~3);
+ y = tsr.test2_1_3(y&~3);
+ y = tsr.test2_1_4(y&~3);
+ y = tsr.test2_1_5(y&~3);
+ y = tsr.test2_1_6(y&~3);
+ y = tsr.test2_1_0((y&~3)+3);
+ y = tsr.test2_1_1((y&~3)+3);
+ y = tsr.test2_1_2((y&~3)+3);
+ y = tsr.test2_1_3((y&~3)+3);
+ y = tsr.test2_1_4((y&~3)+3);
+ y = tsr.test2_1_5((y&~3)+3);
+ y = tsr.test2_1_6((y&~3)+3);
+
+ y = tsr.test2_2_0(y&~3);
+ y = tsr.test2_2_1(y&~3);
+ y = tsr.test2_2_2(y&~3);
+ y = tsr.test2_2_3(y&~3);
+ y = tsr.test2_2_4(y&~3);
+ y = tsr.test2_2_5(y&~3);
+ y = tsr.test2_2_6(y&~3);
+ y = tsr.test2_2_0((y&~3)+3);
+ y = tsr.test2_2_1((y&~3)+3);
+ y = tsr.test2_2_2((y&~3)+3);
+ y = tsr.test2_2_3((y&~3)+3);
+ y = tsr.test2_2_4((y&~3)+3);
+ y = tsr.test2_2_5((y&~3)+3);
+ y = tsr.test2_2_6((y&~3)+3);
+
+ }
+ for (int i=0; i<10000; i++) {
+ y = tsr.test0_0_0(y);
+ y = tsr.test0_0_0(y);
+ y = tsr.test0_0_1(y);
+ y = tsr.test0_0_1(y);
+ y = tsr.test0_0_2(y);
+ y = tsr.test0_0_2(y);
+ y = tsr.test0_0_3(y);
+ y = tsr.test0_0_3(y);
+ y = tsr.test0_0_4(y);
+ y = tsr.test0_0_4(y);
+ y = tsr.test0_0_5(y);
+ y = tsr.test0_0_5(y);
+ y = tsr.test0_0_6(y);
+ y = tsr.test0_0_6(y);
+
+ y = tsr.test0_1_3(y);
+ y = tsr.test0_1_3(y);
+ y = tsr.test0_1_4(y);
+ y = tsr.test0_1_4(y);
+ y = tsr.test0_1_5(y);
+ y = tsr.test0_1_5(y);
+ y = tsr.test0_1_6(y);
+ y = tsr.test0_1_6(y);
+
+ y = tsr.test1_0_0(y&~1);
+ y = tsr.test1_0_1(y&~1);
+ y = tsr.test1_0_2(y&~1);
+ y = tsr.test1_0_3(y&~1);
+ y = tsr.test1_0_4(y&~1);
+ y = tsr.test1_0_5(y&~1);
+ y = tsr.test1_0_6(y&~1);
+ y = tsr.test1_0_0((y&~1)+1);
+ y = tsr.test1_0_1((y&~1)+1);
+ y = tsr.test1_0_2((y&~1)+1);
+ y = tsr.test1_0_3((y&~1)+1);
+ y = tsr.test1_0_4((y&~1)+1);
+ y = tsr.test1_0_5((y&~1)+1);
+ y = tsr.test1_0_6((y&~1)+1);
+
+ y = tsr.test1_1_0(y&~1);
+ y = tsr.test1_1_1(y&~1);
+ y = tsr.test1_1_2(y&~1);
+ y = tsr.test1_1_3(y&~1);
+ y = tsr.test1_1_4(y&~1);
+ y = tsr.test1_1_5(y&~1);
+ y = tsr.test1_1_6(y&~1);
+ y = tsr.test1_1_0((y&~1)+1);
+ y = tsr.test1_1_1((y&~1)+1);
+ y = tsr.test1_1_2((y&~1)+1);
+ y = tsr.test1_1_3((y&~1)+1);
+ y = tsr.test1_1_4((y&~1)+1);
+ y = tsr.test1_1_5((y&~1)+1);
+ y = tsr.test1_1_6((y&~1)+1);
+
+ y = tsr.test1_2_0(y&~1);
+ y = tsr.test1_2_1(y&~1);
+ y = tsr.test1_2_2(y&~1);
+ y = tsr.test1_2_3(y&~1);
+ y = tsr.test1_2_4(y&~1);
+ y = tsr.test1_2_5(y&~1);
+ y = tsr.test1_2_6(y&~1);
+ y = tsr.test1_2_0((y&~1)+1);
+ y = tsr.test1_2_1((y&~1)+1);
+ y = tsr.test1_2_2((y&~1)+1);
+ y = tsr.test1_2_3((y&~1)+1);
+ y = tsr.test1_2_4((y&~1)+1);
+ y = tsr.test1_2_5((y&~1)+1);
+ y = tsr.test1_2_6((y&~1)+1);
+
+ y = tsr.test2_0_0(y&~3);
+ y = tsr.test2_0_1(y&~3);
+ y = tsr.test2_0_2(y&~3);
+ y = tsr.test2_0_3(y&~3);
+ y = tsr.test2_0_4(y&~3);
+ y = tsr.test2_0_5(y&~3);
+ y = tsr.test2_0_6(y&~3);
+ y = tsr.test2_0_0((y&~3)+3);
+ y = tsr.test2_0_1((y&~3)+3);
+ y = tsr.test2_0_2((y&~3)+3);
+ y = tsr.test2_0_3((y&~3)+3);
+ y = tsr.test2_0_4((y&~3)+3);
+ y = tsr.test2_0_5((y&~3)+3);
+ y = tsr.test2_0_6((y&~3)+3);
+
+ y = tsr.test2_1_0(y&~3);
+ y = tsr.test2_1_1(y&~3);
+ y = tsr.test2_1_2(y&~3);
+ y = tsr.test2_1_3(y&~3);
+ y = tsr.test2_1_4(y&~3);
+ y = tsr.test2_1_5(y&~3);
+ y = tsr.test2_1_6(y&~3);
+ y = tsr.test2_1_0((y&~3)+3);
+ y = tsr.test2_1_1((y&~3)+3);
+ y = tsr.test2_1_2((y&~3)+3);
+ y = tsr.test2_1_3((y&~3)+3);
+ y = tsr.test2_1_4((y&~3)+3);
+ y = tsr.test2_1_5((y&~3)+3);
+ y = tsr.test2_1_6((y&~3)+3);
+
+ y = tsr.test2_2_0(y&~3);
+ y = tsr.test2_2_1(y&~3);
+ y = tsr.test2_2_2(y&~3);
+ y = tsr.test2_2_3(y&~3);
+ y = tsr.test2_2_4(y&~3);
+ y = tsr.test2_2_5(y&~3);
+ y = tsr.test2_2_6(y&~3);
+ y = tsr.test2_2_0((y&~3)+3);
+ y = tsr.test2_2_1((y&~3)+3);
+ y = tsr.test2_2_2((y&~3)+3);
+ y = tsr.test2_2_3((y&~3)+3);
+ y = tsr.test2_2_4((y&~3)+3);
+ y = tsr.test2_2_5((y&~3)+3);
+ y = tsr.test2_2_6((y&~3)+3);
+
+ }
+ for (int i=0; i<10000; i++) {
+ y = tsr.test0_0_0(y);
+ y = tsr.test0_0_0(y);
+ y = tsr.test0_0_1(y);
+ y = tsr.test0_0_1(y);
+ y = tsr.test0_0_2(y);
+ y = tsr.test0_0_2(y);
+ y = tsr.test0_0_3(y);
+ y = tsr.test0_0_3(y);
+ y = tsr.test0_0_4(y);
+ y = tsr.test0_0_4(y);
+ y = tsr.test0_0_5(y);
+ y = tsr.test0_0_5(y);
+ y = tsr.test0_0_6(y);
+ y = tsr.test0_0_6(y);
+
+ y = tsr.test0_1_3(y);
+ y = tsr.test0_1_3(y);
+ y = tsr.test0_1_4(y);
+ y = tsr.test0_1_4(y);
+ y = tsr.test0_1_5(y);
+ y = tsr.test0_1_5(y);
+ y = tsr.test0_1_6(y);
+ y = tsr.test0_1_6(y);
+
+ y = tsr.test1_0_0(y&~1);
+ y = tsr.test1_0_1(y&~1);
+ y = tsr.test1_0_2(y&~1);
+ y = tsr.test1_0_3(y&~1);
+ y = tsr.test1_0_4(y&~1);
+ y = tsr.test1_0_5(y&~1);
+ y = tsr.test1_0_6(y&~1);
+ y = tsr.test1_0_0((y&~1)+1);
+ y = tsr.test1_0_1((y&~1)+1);
+ y = tsr.test1_0_2((y&~1)+1);
+ y = tsr.test1_0_3((y&~1)+1);
+ y = tsr.test1_0_4((y&~1)+1);
+ y = tsr.test1_0_5((y&~1)+1);
+ y = tsr.test1_0_6((y&~1)+1);
+
+ y = tsr.test1_1_0(y&~1);
+ y = tsr.test1_1_1(y&~1);
+ y = tsr.test1_1_2(y&~1);
+ y = tsr.test1_1_3(y&~1);
+ y = tsr.test1_1_4(y&~1);
+ y = tsr.test1_1_5(y&~1);
+ y = tsr.test1_1_6(y&~1);
+ y = tsr.test1_1_0((y&~1)+1);
+ y = tsr.test1_1_1((y&~1)+1);
+ y = tsr.test1_1_2((y&~1)+1);
+ y = tsr.test1_1_3((y&~1)+1);
+ y = tsr.test1_1_4((y&~1)+1);
+ y = tsr.test1_1_5((y&~1)+1);
+ y = tsr.test1_1_6((y&~1)+1);
+
+ y = tsr.test1_2_0(y&~1);
+ y = tsr.test1_2_1(y&~1);
+ y = tsr.test1_2_2(y&~1);
+ y = tsr.test1_2_3(y&~1);
+ y = tsr.test1_2_4(y&~1);
+ y = tsr.test1_2_5(y&~1);
+ y = tsr.test1_2_6(y&~1);
+ y = tsr.test1_2_0((y&~1)+1);
+ y = tsr.test1_2_1((y&~1)+1);
+ y = tsr.test1_2_2((y&~1)+1);
+ y = tsr.test1_2_3((y&~1)+1);
+ y = tsr.test1_2_4((y&~1)+1);
+ y = tsr.test1_2_5((y&~1)+1);
+ y = tsr.test1_2_6((y&~1)+1);
+
+ y = tsr.test2_0_0(y&~3);
+ y = tsr.test2_0_1(y&~3);
+ y = tsr.test2_0_2(y&~3);
+ y = tsr.test2_0_3(y&~3);
+ y = tsr.test2_0_4(y&~3);
+ y = tsr.test2_0_5(y&~3);
+ y = tsr.test2_0_6(y&~3);
+ y = tsr.test2_0_0((y&~3)+3);
+ y = tsr.test2_0_1((y&~3)+3);
+ y = tsr.test2_0_2((y&~3)+3);
+ y = tsr.test2_0_3((y&~3)+3);
+ y = tsr.test2_0_4((y&~3)+3);
+ y = tsr.test2_0_5((y&~3)+3);
+ y = tsr.test2_0_6((y&~3)+3);
+
+ y = tsr.test2_1_0(y&~3);
+ y = tsr.test2_1_1(y&~3);
+ y = tsr.test2_1_2(y&~3);
+ y = tsr.test2_1_3(y&~3);
+ y = tsr.test2_1_4(y&~3);
+ y = tsr.test2_1_5(y&~3);
+ y = tsr.test2_1_6(y&~3);
+ y = tsr.test2_1_0((y&~3)+3);
+ y = tsr.test2_1_1((y&~3)+3);
+ y = tsr.test2_1_2((y&~3)+3);
+ y = tsr.test2_1_3((y&~3)+3);
+ y = tsr.test2_1_4((y&~3)+3);
+ y = tsr.test2_1_5((y&~3)+3);
+ y = tsr.test2_1_6((y&~3)+3);
+
+ y = tsr.test2_2_0(y&~3);
+ y = tsr.test2_2_1(y&~3);
+ y = tsr.test2_2_2(y&~3);
+ y = tsr.test2_2_3(y&~3);
+ y = tsr.test2_2_4(y&~3);
+ y = tsr.test2_2_5(y&~3);
+ y = tsr.test2_2_6(y&~3);
+ y = tsr.test2_2_0((y&~3)+3);
+ y = tsr.test2_2_1((y&~3)+3);
+ y = tsr.test2_2_2((y&~3)+3);
+ y = tsr.test2_2_3((y&~3)+3);
+ y = tsr.test2_2_4((y&~3)+3);
+ y = tsr.test2_2_5((y&~3)+3);
+ y = tsr.test2_2_6((y&~3)+3);
+
+ }
+
+ int z = 0;
+ y = tsr.test0_0_0(0);
+ System.out.println("After 'test0_0_0' y=" + y);
+ y = tsr.test0_0_1(0);
+ System.out.println("After 'test0_0_1' y=" + y);
+ y = tsr.test0_0_2(0);
+ System.out.println("After 'test0_0_2' y=" + y);
+ y = tsr.test0_0_3(0);
+ System.out.println("After 'test0_0_3' y=" + y);
+ y = tsr.test0_0_4(0);
+ System.out.println("After 'test0_0_4' y=" + y);
+ y = tsr.test0_0_5(0);
+ System.out.println("After 'test0_0_5' y=" + y);
+ y = tsr.test0_0_6(0);
+ System.out.println("After 'test0_0_6' y=" + y);
+ y = tsr.test0_1_3(0);
+ System.out.println("After 'test0_1_3' y=" + y);
+ y = tsr.test0_1_4(0);
+ System.out.println("After 'test0_1_4' y=" + y);
+ y = tsr.test0_1_5(0);
+ System.out.println("After 'test0_1_5' y=" + y);
+ y = tsr.test0_1_6(0);
+ System.out.println("After 'test0_1_6' y=" + y);
+
+ y = tsr.test1_0_0(0);
+ System.out.println("After 'test1_0_0' y=" + y);
+ y = tsr.test1_0_1(0);
+ System.out.println("After 'test1_0_1' y=" + y);
+ y = tsr.test1_0_2(0);
+ System.out.println("After 'test1_0_2' y=" + y);
+ y = tsr.test1_0_3(0);
+ System.out.println("After 'test1_0_3' y=" + y);
+ y = tsr.test1_0_4(0);
+ System.out.println("After 'test1_0_4' y=" + y);
+ y = tsr.test1_0_5(0);
+ System.out.println("After 'test1_0_5' y=" + y);
+ y = tsr.test1_0_6(0);
+ System.out.println("After 'test1_0_6' y=" + y);
+
+ y = tsr.test1_1_0(0);
+ System.out.println("After 'test1_1_0' y=" + y);
+ y = tsr.test1_1_1(0);
+ System.out.println("After 'test1_1_1' y=" + y);
+ y = tsr.test1_1_2(0);
+ System.out.println("After 'test1_1_2' y=" + y);
+ y = tsr.test1_1_3(0);
+ System.out.println("After 'test1_1_3' y=" + y);
+ y = tsr.test1_1_4(0);
+ System.out.println("After 'test1_1_4' y=" + y);
+ y = tsr.test1_1_5(0);
+ System.out.println("After 'test1_1_5' y=" + y);
+ y = tsr.test1_1_6(0);
+ System.out.println("After 'test1_1_6' y=" + y);
+
+ y = tsr.test1_2_0(0);
+ System.out.println("After 'test1_2_0' y=" + y);
+ y = tsr.test1_2_1(0);
+ System.out.println("After 'test1_2_1' y=" + y);
+ y = tsr.test1_2_2(0);
+ System.out.println("After 'test1_2_2' y=" + y);
+ y = tsr.test1_2_3(0);
+ System.out.println("After 'test1_2_3' y=" + y);
+ y = tsr.test1_2_4(0);
+ System.out.println("After 'test1_2_4' y=" + y);
+ y = tsr.test1_2_5(0);
+ System.out.println("After 'test1_2_5' y=" + y);
+ y = tsr.test1_2_6(0);
+ System.out.println("After 'test1_2_6' y=" + y);
+
+ y = tsr.test2_0_0(0);
+ System.out.println("After 'test2_0_0' y=" + y);
+ y = tsr.test2_0_1(0);
+ System.out.println("After 'test2_0_1' y=" + y);
+ y = tsr.test2_0_2(0);
+ System.out.println("After 'test2_0_2' y=" + y);
+ y = tsr.test2_0_3(0);
+ System.out.println("After 'test2_0_3' y=" + y);
+ y = tsr.test2_0_4(0);
+ System.out.println("After 'test2_0_4' y=" + y);
+ y = tsr.test2_0_5(0);
+ System.out.println("After 'test2_0_5' y=" + y);
+ y = tsr.test2_0_6(0);
+ System.out.println("After 'test2_0_6' y=" + y);
+
+ y = tsr.test2_1_0(0);
+ System.out.println("After 'test2_1_0' y=" + y);
+ y = tsr.test2_1_1(0);
+ System.out.println("After 'test2_1_1' y=" + y);
+ y = tsr.test2_1_2(0);
+ System.out.println("After 'test2_1_2' y=" + y);
+ y = tsr.test2_1_3(0);
+ System.out.println("After 'test2_1_3' y=" + y);
+ y = tsr.test2_1_4(0);
+ System.out.println("After 'test2_1_4' y=" + y);
+ y = tsr.test2_1_5(0);
+ System.out.println("After 'test2_1_5' y=" + y);
+ y = tsr.test2_1_6(0);
+ System.out.println("After 'test2_1_6' y=" + y);
+
+ y = tsr.test2_2_0(0);
+ System.out.println("After 'test2_2_0' y=" + y);
+ y = tsr.test2_2_1(0);
+ System.out.println("After 'test2_2_1' y=" + y);
+ y = tsr.test2_2_2(0);
+ System.out.println("After 'test2_2_2' y=" + y);
+ y = tsr.test2_2_3(0);
+ System.out.println("After 'test2_2_3' y=" + y);
+ y = tsr.test2_2_4(0);
+ System.out.println("After 'test2_2_4' y=" + y);
+ y = tsr.test2_2_5(0);
+ System.out.println("After 'test2_2_5' y=" + y);
+ y = tsr.test2_2_6(0);
+ System.out.println("After 'test2_2_6' y=" + y);
+
+ }
+}