/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/**
* WARNING: The contents of this source file are not part of any
* supported API. Code that depends on them does so at its own risk:
* they are subject to change or removal without notice.
*/
public abstract
/**
* Constructor
*/
}
/**
* Select the type
*
*/
switch(op) {
case ASGADD:
// The type of the right hand side can be
// anything except void. Fix for 4119864.
} else {
}
return;
}
/* Fall through */
} else {
}
break;
} else {
}
break;
// Fix for bug 4134459.
// We allow any integral type (even long) to
// be the right hand side of a shift operation.
}
// The intermediate type of the expression is the
// type of the left hand side after undergoing
// unary (not binary) type promotion. We ignore
// tm -- it contains information about both left
// and right hand sides -- and we compute the
// type only from the type of the lhs.
} else {
}
break;
default:
}
}
// The result is always the type of the left operand.
}
/**
* Get the increment, return NOINC if an increment is not possible
*/
int getIncrement() {
return val;
}
return NOINC;
}
/**
* Check an assignment expression
*/
return vset;
}
}
return vset;
}
/**
* Inline
*/
// Why not inlineLHS? But that does not work.
}
return this;
}
/**
* Create a copy of the expression for method inlining
*/
}
return e;
}
/**
* The cost of inlining this statement
*/
/*----------*
return (getIncrement() != NOINC)
? 2
: (3 + super.costInline(thresh, env, ctx));
*----------*/
return (getIncrement() != NOINC)
// Increment variable in place. Count 3 bytes for 'iinc'.
? 3
// Cost of rhs expression + cost of lhs expression + cost
// istore = 1 or 2, iadd = 1. Cost could be higher if
// a small constant. Costs are highly approximate.
} else {
// Cost of rhs expression + (2 * cost of access method call) +
// cost of operator. Does not account for cost of conversions,
// or duplications in value-needed context.
}
}
/**
* Code
*/
// Handle cases in which a '+=' or '-=' operator can be optimized using
// the 'iinc' instruction. See also 'IncDecExpression.codeIncDec'.
// The 'iinc' instruction cannot be used if an access method call is required.
int val = getIncrement();
if (valNeeded) {
}
return;
}
// Field is directly accessible.
if (valNeeded) {
}
} else {
// Must use access methods.
}
}
}
}
/**
* Print
*/
}
}