means distribution or otherwise making the Covered Code available to a third party.
1.1. "Contributor"
means each entity that creates or contributes to the creation of Modifications.
1.2. "Contributor Version"
means the combination of the Original Code, prior Modifications used by a Contributor,
and the Modifications made by that particular Contributor.
1.3. "Covered Code"
means the Original Code or Modifications or the combination of the Original Code and
Modifications, in each case including portions thereof.
1.4. "Electronic Distribution Mechanism"
means a mechanism generally accepted in the software development community for the
electronic transfer of data.
1.5. "Executable"
means Covered Code in any form other than Source Code.
1.6. "Initial Developer"
means the individual or entity identified as the Initial Developer in the Source Code
notice required by Exhibit A.
1.7. "Larger Work"
means a work which combines Covered Code or portions thereof with code not governed
by the terms of this License.
1.8. "License"
means this document.
1.8.1. "Licensable"
means having the right to grant, to the maximum extent possible, whether at the
time of the initial grant or subsequently acquired, any and all of the rights
conveyed herein.
1.9. "Modifications"
means any addition to or deletion from the substance or structure of either the
Original Code or any previous Modifications. When Covered Code is released as a
series of files, a Modification is:
Any addition to or deletion from the contents of a file
containing Original Code or previous Modifications.
Any new file that contains any part of the Original Code or
previous Modifications.
1.10. "Original Code"
means Source Code of computer software code which is described in the Source Code
notice required by Exhibit A as Original Code, and which,
at the time of its release under this License is not already Covered Code governed
by this License.
1.10.1. "Patent Claims"
means any patent claim(s), now owned or hereafter acquired, including without
limitation, method, process, and apparatus claims, in any patent Licensable by
grantor.
1.11. "Source Code"
means the preferred form of the Covered Code for making modifications to it,
including all modules it contains, plus any associated interface definition files,
scripts used to control compilation and installation of an Executable, or source
code differential comparisons against either the Original Code or another well known,
available Covered Code of the Contributor's choice. The Source Code can be in a
compressed or archival form, provided the appropriate decompression or de-archiving
software is widely available for no charge.
1.12. "You" (or "Your")
means an individual or a legal entity exercising rights under, and complying with
all of the terms of, this License or a future version of this License issued under
Section 6.1. For legal entities, "You" includes any entity
which controls, is controlled by, or is under common control with You. For purposes of
this definition, "control" means (a) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or otherwise, or (b)
ownership of more than fifty percent (50%) of the outstanding shares or beneficial
ownership of such entity.
2. Source Code License.
2.1. The Initial Developer Grant.
The Initial Developer hereby grants You a world-wide, royalty-free, non-exclusive
license, subject to third party intellectual property claims:
under intellectual property rights (other than patent or
trademark) Licensable by Initial Developer to use, reproduce, modify, display, perform,
sublicense and distribute the Original Code (or portions thereof) with or without
Modifications, and/or as part of a Larger Work; and
under Patents Claims infringed by the making, using or selling
of Original Code, to make, have made, use, practice, sell, and offer for sale, and/or
otherwise dispose of the Original Code (or portions thereof).
the licenses granted in this Section 2.1
(a) and (b) are effective on
the date Initial Developer first distributes Original Code under the terms of this
License.
Notwithstanding Section 2.1 (b)
above, no patent license is granted: 1) for code that You delete from the Original Code;
2) separate from the Original Code; or 3) for infringements caused by: i) the
modification of the Original Code or ii) the combination of the Original Code with other
software or devices.
2.2. Contributor Grant.
Subject to third party intellectual property claims, each Contributor hereby grants You
a world-wide, royalty-free, non-exclusive license
under intellectual property rights (other than patent or trademark)
Licensable by Contributor, to use, reproduce, modify, display, perform, sublicense and
distribute the Modifications created by such Contributor (or portions thereof) either on
an unmodified basis, with other Modifications, as Covered Code and/or as part of a Larger
Work; and
under Patent Claims infringed by the making, using, or selling of
Modifications made by that Contributor either alone and/or in combination with its
Contributor Version (or portions of such combination), to make, use, sell, offer for
sale, have made, and/or otherwise dispose of: 1) Modifications made by that Contributor
(or portions thereof); and 2) the combination of Modifications made by that Contributor
with its Contributor Version (or portions of such combination).
the licenses granted in Sections 2.2
(a) and 2.2 (b) are effective
on the date Contributor first makes Commercial Use of the Covered Code.
Notwithstanding Section 2.2 (b)
above, no patent license is granted: 1) for any code that Contributor has deleted from
the Contributor Version; 2) separate from the Contributor Version; 3) for infringements
caused by: i) third party modifications of Contributor Version or ii) the combination of
Modifications made by that Contributor with other software (except as part of the
Contributor Version) or other devices; or 4) under Patent Claims infringed by Covered Code
in the absence of Modifications made by that Contributor.
3. Distribution Obligations.
3.1. Application of License.
The Modifications which You create or to which You contribute are governed by the terms
of this License, including without limitation Section 2.2. The
Source Code version of Covered Code may be distributed only under the terms of this License
or a future version of this License released under Section 6.1,
and You must include a copy of this License with every copy of the Source Code You
distribute. You may not offer or impose any terms on any Source Code version that alters or
restricts the applicable version of this License or the recipients' rights hereunder.
However, You may include an additional document offering the additional rights described in
Section 3.5.
3.2. Availability of Source Code.
Any Modification which You create or to which You contribute must be made available in
Source Code form under the terms of this License either on the same media as an Executable
version or via an accepted Electronic Distribution Mechanism to anyone to whom you made an
Executable version available; and if made available via Electronic Distribution Mechanism,
must remain available for at least twelve (12) months after the date it initially became
available, or at least six (6) months after a subsequent version of that particular
Modification has been made available to such recipients. You are responsible for ensuring
that the Source Code version remains available even if the Electronic Distribution
Mechanism is maintained by a third party.
3.3. Description of Modifications.
You must cause all Covered Code to which You contribute to contain a file documenting the
changes You made to create that Covered Code and the date of any change. You must include a
prominent statement that the Modification is derived, directly or indirectly, from Original
Code provided by the Initial Developer and including the name of the Initial Developer in
(a) the Source Code, and (b) in any notice in an Executable version or related documentation
in which You describe the origin or ownership of the Covered Code.
3.4. Intellectual Property Matters
(a) Third Party Claims
If Contributor has knowledge that a license under a third party's intellectual property
rights is required to exercise the rights granted by such Contributor under Sections
2.1 or 2.2, Contributor must include a
text file with the Source Code distribution titled "LEGAL" which describes the claim and the
party making the claim in sufficient detail that a recipient will know whom to contact. If
Contributor obtains such knowledge after the Modification is made available as described in
Section 3.2, Contributor shall promptly modify the LEGAL file in
all copies Contributor makes available thereafter and shall take other steps (such as
notifying appropriate mailing lists or newsgroups) reasonably calculated to inform those who
received the Covered Code that new knowledge has been obtained.
(b) Contributor APIs
If Contributor's Modifications include an application programming interface and Contributor
has knowledge of patent licenses which are reasonably necessary to implement that
API, Contributor must also include this information in the
legal file.
(c) Representations.
Contributor represents that, except as disclosed pursuant to Section 3.4
(a) above, Contributor believes that Contributor's Modifications
are Contributor's original creation(s) and/or Contributor has sufficient rights to grant the
rights conveyed by this License.
3.5. Required Notices.
You must duplicate the notice in Exhibit A in each file of the
Source Code. If it is not possible to put such notice in a particular Source Code file due to
its structure, then You must include such notice in a location (such as a relevant directory)
where a user would be likely to look for such a notice. If You created one or more
Modification(s) You may add your name as a Contributor to the notice described in
Exhibit A. You must also duplicate this License in any documentation
for the Source Code where You describe recipients' rights or ownership rights relating to
Covered Code. You may choose to offer, and to charge a fee for, warranty, support, indemnity
or liability obligations to one or more recipients of Covered Code. However, You may do so
only on Your own behalf, and not on behalf of the Initial Developer or any Contributor. You
must make it absolutely clear than any such warranty, support, indemnity or liability
obligation is offered by You alone, and You hereby agree to indemnify the Initial Developer
and every Contributor for any liability incurred by the Initial Developer or such Contributor
as a result of warranty, support, indemnity or liability terms You offer.
3.6. Distribution of Executable Versions.
You may distribute Covered Code in Executable form only if the requirements of Sections
3.1, 3.2,
3.3, 3.4 and
3.5 have been met for that Covered Code, and if You include a
notice stating that the Source Code version of the Covered Code is available under the terms
of this License, including a description of how and where You have fulfilled the obligations
of Section 3.2. The notice must be conspicuously included in any
notice in an Executable version, related documentation or collateral in which You describe
recipients' rights relating to the Covered Code. You may distribute the Executable version of
Covered Code or ownership rights under a license of Your choice, which may contain terms
different from this License, provided that You are in compliance with the terms of this
License and that the license for the Executable version does not attempt to limit or alter the
recipient's rights in the Source Code version from the rights set forth in this License. If
You distribute the Executable version under a different license You must make it absolutely
clear that any terms which differ from this License are offered by You alone, not by the
Initial Developer or any Contributor. You hereby agree to indemnify the Initial Developer and
every Contributor for any liability incurred by the Initial Developer or such Contributor as
a result of any such terms You offer.
3.7. Larger Works.
You may create a Larger Work by combining Covered Code with other code not governed by the
terms of this License and distribute the Larger Work as a single product. In such a case,
You must make sure the requirements of this License are fulfilled for the Covered Code.
4. Inability to Comply Due to Statute or Regulation.
If it is impossible for You to comply with any of the terms of this License with respect to
some or all of the Covered Code due to statute, judicial order, or regulation then You must:
(a) comply with the terms of this License to the maximum extent possible; and (b) describe
the limitations and the code they affect. Such description must be included in the
legal file described in Section
3.4 and must be included with all distributions of the Source Code.
Except to the extent prohibited by statute or regulation, such description must be
sufficiently detailed for a recipient of ordinary skill to be able to understand it.
5. Application of this License.
This License applies to code to which the Initial Developer has attached the notice in
Exhibit A and to related Covered Code.
6. Versions of the License.
6.1. New Versions
Netscape Communications Corporation ("Netscape") may publish revised and/or new versions
of the License from time to time. Each version will be given a distinguishing version number.
6.2. Effect of New Versions
Once Covered Code has been published under a particular version of the License, You may
always continue to use it under the terms of that version. You may also choose to use such
Covered Code under the terms of any subsequent version of the License published by Netscape.
No one other than Netscape has the right to modify the terms applicable to Covered Code
created under this License.
6.3. Derivative Works
If You create or use a modified version of this License (which you may only do in order to
apply it to code which is not already Covered Code governed by this License), You must (a)
rename Your license so that the phrases "Mozilla", "MOZILLAPL", "MOZPL", "Netscape", "MPL",
"NPL" or any confusingly similar phrase do not appear in your license (except to note that
your license differs from this License) and (b) otherwise make it clear that Your version of
the license contains terms which differ from the Mozilla Public License and Netscape Public
License. (Filling in the name of the Initial Developer, Original Code or Contributor in the
notice described in Exhibit A shall not of themselves be deemed to
be modifications of this License.)
7. Disclaimer of warranty
Covered code is provided under this license on an "as is"
basis, without warranty of any kind, either expressed or implied, including, without
limitation, warranties that the covered code is free of defects, merchantable, fit for a
particular purpose or non-infringing. The entire risk as to the quality and performance of
the covered code is with you. Should any covered code prove defective in any respect, you
(not the initial developer or any other contributor) assume the cost of any necessary
servicing, repair or correction. This disclaimer of warranty constitutes an essential part
of this license. No use of any covered code is authorized hereunder except under this
disclaimer.
8. Termination
8.1. This License and the rights granted hereunder will terminate
automatically if You fail to comply with terms herein and fail to cure such breach
within 30 days of becoming aware of the breach. All sublicenses to the Covered Code which
are properly granted shall survive any termination of this License. Provisions which, by
their nature, must remain in effect beyond the termination of this License shall survive.
8.2. If You initiate litigation by asserting a patent infringement
claim (excluding declatory judgment actions) against Initial Developer or a Contributor
(the Initial Developer or Contributor against whom You file such action is referred to
as "Participant") alleging that:
such Participant's Contributor Version directly or indirectly
infringes any patent, then any and all rights granted by such Participant to You under
Sections 2.1 and/or 2.2 of this
License shall, upon 60 days notice from Participant terminate prospectively, unless if
within 60 days after receipt of notice You either: (i) agree in writing to pay
Participant a mutually agreeable reasonable royalty for Your past and future use of
Modifications made by such Participant, or (ii) withdraw Your litigation claim with
respect to the Contributor Version against such Participant. If within 60 days of
notice, a reasonable royalty and payment arrangement are not mutually agreed upon in
writing by the parties or the litigation claim is not withdrawn, the rights granted by
Participant to You under Sections 2.1 and/or
2.2 automatically terminate at the expiration of the 60 day
notice period specified above.
any software, hardware, or device, other than such Participant's
Contributor Version, directly or indirectly infringes any patent, then any rights
granted to You by such Participant under Sections 2.1(b)
and 2.2(b) are revoked effective as of the date You first
made, used, sold, distributed, or had made, Modifications made by that Participant.
8.3. If You assert a patent infringement claim against Participant
alleging that such Participant's Contributor Version directly or indirectly infringes
any patent where such claim is resolved (such as by license or settlement) prior to the
initiation of patent infringement litigation, then the reasonable value of the licenses
granted by such Participant under Sections 2.1 or
2.2 shall be taken into account in determining the amount or
value of any payment or license.
8.4. In the event of termination under Sections
8.1 or 8.2 above, all end user
license agreements (excluding distributors and resellers) which have been validly
granted by You or any distributor hereunder prior to termination shall survive
termination.
9. Limitation of liability
Under no circumstances and under no legal theory, whether
tort (including negligence), contract, or otherwise, shall you, the initial developer,
any other contributor, or any distributor of covered code, or any supplier of any of
such parties, be liable to any person for any indirect, special, incidental, or
consequential damages of any character including, without limitation, damages for loss
of goodwill, work stoppage, computer failure or malfunction, or any and all other
commercial damages or losses, even if such party shall have been informed of the
possibility of such damages. This limitation of liability shall not apply to liability
for death or personal injury resulting from such party's negligence to the extent
applicable law prohibits such limitation. Some jurisdictions do not allow the exclusion
or limitation of incidental or consequential damages, so this exclusion and limitation
may not apply to you.
10. U.S. government end users
The Covered Code is a "commercial item," as that term is defined in 48
C.F.R. 2.101 (Oct. 1995), consisting of
"commercial computer software" and "commercial computer software documentation," as such
terms are used in 48 C.F.R. 12.212 (Sept.
1995). Consistent with 48 C.F.R. 12.212 and 48 C.F.R.
227.7202-1 through 227.7202-4 (June 1995), all U.S. Government End Users
acquire Covered Code with only those rights set forth herein.
11. Miscellaneous
This License represents the complete agreement concerning subject matter hereof. If
any provision of this License is held to be unenforceable, such provision shall be
reformed only to the extent necessary to make it enforceable. This License shall be
governed by California law provisions (except to the extent applicable law, if any,
provides otherwise), excluding its conflict-of-law provisions. With respect to
disputes in which at least one party is a citizen of, or an entity chartered or
registered to do business in the United States of America, any litigation relating to
this License shall be subject to the jurisdiction of the Federal Courts of the
Northern District of California, with venue lying in Santa Clara County, California,
with the losing party responsible for costs, including without limitation, court
costs and reasonable attorneys' fees and expenses. The application of the United
Nations Convention on Contracts for the International Sale of Goods is expressly
excluded. Any law or regulation which provides that the language of a contract
shall be construed against the drafter shall not apply to this License.
12. Responsibility for claims
As between Initial Developer and the Contributors, each party is responsible for
claims and damages arising, directly or indirectly, out of its utilization of rights
under this License and You agree to work with Initial Developer and Contributors to
distribute such responsibility on an equitable basis. Nothing herein is intended or
shall be deemed to constitute any admission of liability.
13. Multiple-licensed code
Initial Developer may designate portions of the Covered Code as
"Multiple-Licensed". "Multiple-Licensed" means that the Initial Developer permits
you to utilize portions of the Covered Code under Your choice of the MPL
or the alternative licenses, if any, specified by the Initial Developer in the file
described in Exhibit A.
Exhibit A - Mozilla Public License.
"The contents of this file are subject to the Mozilla Public License
Version 1.1 (the "License"); you may not use this file except in
compliance with the License. You may obtain a copy of the License at
http://www.mozilla.org/MPL/
Software distributed under the License is distributed on an "AS IS"
basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
License for the specific language governing rights and limitations
under the License.
The Original Code is ______________________________________.
The Initial Developer of the Original Code is ________________________.
Portions created by ______________________ are Copyright (C) ______
_______________________. All Rights Reserved.
Contributor(s): ______________________________________.
Alternatively, the contents of this file may be used under the terms
of the _____ license (the "[___] License"), in which case the
provisions of [______] License are applicable instead of those
above. If you wish to allow use of your version of this file only
under the terms of the [____] License and not to allow others to use
your version of this file under the MPL, indicate your decision by
deleting the provisions above and replace them with the notice and
other provisions required by the [___] License. If you do not delete
the provisions above, a recipient may use your version of this file
under either the MPL or the [___] License."
NOTE: The text of this Exhibit A may differ slightly from the text of
the notices in the Source Code files of the Original Code. You should
use the text of this Exhibit A rather than the text found in the
Original Code Source Code for Your Modifications.
htmlunit-core-js-2.8/src/ 0000755 0001750 0001750 00000000000 11530107756 015203 5 ustar cavedon cavedon htmlunit-core-js-2.8/src/net/ 0000755 0001750 0001750 00000000000 11530107756 015771 5 ustar cavedon cavedon htmlunit-core-js-2.8/src/net/sourceforge/ 0000755 0001750 0001750 00000000000 11530107756 020314 5 ustar cavedon cavedon htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/ 0000755 0001750 0001750 00000000000 11530107756 022160 5 ustar cavedon cavedon htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/DecompileTest.java 0000644 0001750 0001750 00000001656 11261070323 025562 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Assert;
import org.junit.Test;
import org.mozilla.javascript.Context;
import org.mozilla.javascript.ContextAction;
import org.mozilla.javascript.Script;
/**
* Test for {@link Context#decompileScript(Script, int)}.
* @author Marc Guillemot
*/
public class DecompileTest {
/**
* As of head of trunk on 30.09.09, decompile of "new Date()" returns "new Date" without parentheses.
* @see Bug 519692
*/
@Test
public void newObject0Arg()
{
final String source = "var x = new Date().getTime();";
final ContextAction action = new ContextAction() {
public Object run(final Context cx) {
final Script script = cx.compileString(source, "my script", 0, null);
Assert.assertEquals(source, cx.decompileScript(script, 4).trim());
return null;
}
};
Utils.runWithAllOptimizationLevels(action);
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/PrimitiveTypeScopeResolutionTest.java 0000644 0001750 0001750 00000005024 11111044312 031533 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import net.sourceforge.htmlunit.Utils;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.mozilla.javascript.Context;
import org.mozilla.javascript.ContextAction;
import org.mozilla.javascript.Scriptable;
import org.mozilla.javascript.ScriptableObject;
/**
* Unit tests for Bug 374918 -
* String primitive prototype wrongly resolved when used with many top scopes
* @author Marc Guillemot
*/
@RunWith(RhinoPatchedRunner.class)
public class PrimitiveTypeScopeResolutionTest
{
/**
*/
@Test
public void functionCall() {
String str2 = "function f() { String.prototype.foo = function() { return 'from 2' }; \n"
+ "var s2 = 's2';\n"
+ "var s2Foo = s2.foo();\n"
+ "if (s2Foo != 'from 2') throw 's2 got: ' + s2Foo;\n" // fails
+ "}";
String str1 = "String.prototype.foo = function() { return 'from 1'}; scope2.f()";
testWithTwoScopes(str1, str2);
}
/**
*/
@Test
public void propertyAccess() {
String str2 = "function f() { String.prototype.foo = 'from 2'; \n"
+ "var s2 = 's2';\n"
+ "var s2Foo = s2.foo;\n"
+ "if (s2Foo != 'from 2') throw 's2 got: ' + s2Foo;\n" // fails
+ "}";
String str1 = "String.prototype.foo = 'from 1'; scope2.f()";
testWithTwoScopes(str1, str2);
}
private void testWithTwoScopes(final String scriptScope1, final String scriptScope2) {
final ContextAction action = new ContextAction()
{
public Object run(final Context cx)
{
final Scriptable scope1 = cx.initStandardObjects(new MySimpleScriptableObject("scope1"));
final Scriptable scope2 = cx.initStandardObjects(new MySimpleScriptableObject("scope2"));
cx.evaluateString(scope2, scriptScope2, "source2", 1, null);
scope1.put("scope2", scope1, scope2);
return cx.evaluateString(scope1, scriptScope1, "source1", 1, null);
}
};
Utils.runWithAllOptimizationLevels(action);
}
/**
* Simple utility allowing to better see the concerned scope while debugging
*/
static class MySimpleScriptableObject extends ScriptableObject
{
private String label_;
MySimpleScriptableObject(String label)
{
label_ = label;
}
@Override
public String getClassName()
{
return "MySimpleScriptableObject";
}
@Override
public String toString()
{
return label_;
}
};
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/NumberTest.java 0000644 0001750 0001750 00000001120 11327403546 025105 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Test;
/**
* Unit tests for Bug 538172 -
* Number.toString fails for 2.274341322658976E-309
* @author Marc Guillemot
*/
public class NumberTest
{
/**
* @throws Exception if the test fails
*/
@Test
public void test() throws Exception {
final String script = "var n = 2.274341322658976E-309;\n"
+ "var s = '' + n;\n"
+ "if (s != '2.274341322658976e-309') throw 'got ' + s";
Utilities.executeScript(script);
Utilities.executeScript("'' + 1");
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/RhinoPatchedRunner.java 0000644 0001750 0001750 00000002305 10776651054 026573 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import java.lang.reflect.Method;
import org.junit.internal.runners.InitializationError;
import org.junit.internal.runners.JUnit4ClassRunner;
import org.junit.internal.runners.TestMethod;
/**
* Runs the unit test, expecting them to fail when run with unpatched Rhino version
* (in fact when system property {@link #PROPERTY_RHINO} is set to {@link #PROPERTY_RHINO_VALUE_ORIGINAL}).
* @author Marc Guillemot
*/
public class RhinoPatchedRunner extends JUnit4ClassRunner {
private boolean runWithOriginalRhino;
public static final String PROPERTY_RHINO = "rhino";
public static final String PROPERTY_RHINO_VALUE_ORIGINAL = "original";
public RhinoPatchedRunner(final Class klass) throws InitializationError {
super(klass);
runWithOriginalRhino = PROPERTY_RHINO_VALUE_ORIGINAL.equalsIgnoreCase(System.getProperty(PROPERTY_RHINO));
}
@Override
protected TestMethod wrapMethod(final Method method) {
if (runWithOriginalRhino) {
return new TestMethod(method, getTestClass())
{
@Override
protected Class getExpectedException() {
return Throwable.class;
}
};
}
else {
return super.wrapMethod(method);
}
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/DelegatorAndHostObjectTest.java 0000644 0001750 0001750 00000004331 11332527432 030177 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Assert;
import org.junit.Test;
import org.mozilla.javascript.Context;
import org.mozilla.javascript.ContextAction;
import org.mozilla.javascript.Delegator;
import org.mozilla.javascript.Scriptable;
import org.mozilla.javascript.ScriptableObject;
/**
* Unit tests for Bug 539875 -
* Delegator incompatible with host objects with functions.
*
* @author Daniel Gredler
* @author Marc Guillemot
*/
public class DelegatorAndHostObjectTest {
public static class MyHostObject extends ScriptableObject {
private int x;
@Override
public String getClassName() {
return getClass().getSimpleName();
}
public Delegator jsFunction_createDelegator() {
return new Delegator(this);
}
public int jsFunction_methodWithParam(final MyHostObject param) {
return 123;
}
public int jsFunction_foo() {
return 42;
}
public int jsGet_x() {
return x;
}
public void jsSet_x(int x) {
this.x = x;
}
}
@Test
public void delegatorAndHostObjectFunction() {
testIt("new MyHostObject().createDelegator().foo()", 42);
}
@Test
public void delegatorAndHostObjectGetterSetter() {
testIt("var t = new MyHostObject().createDelegator(); t.x = 12; t.x;",
12);
}
@Test
public void delegatorAsParameter() {
testIt("var t = new MyHostObject().createDelegator(); t.methodWithParam(t);",
123);
}
@Test
public void delegatorAnd__defineGetter__() {
final String script = "var t = new MyHostObject().createDelegator();\n"
+ "t.__defineGetter__('foo', function(a) { return 'hello' });\n"
+ "t.foo;";
testIt(script, "hello");
}
private void testIt(final String script, final Object expected) {
final ContextAction action = new ContextAction() {
public Object run(final Context cx) {
try {
Scriptable scope = cx.initStandardObjects();
ScriptableObject.defineClass(scope, MyHostObject.class);
final Object o = cx.evaluateString(scope, script,
"test_script", 1, null);
Assert.assertEquals(expected, o);
return o;
} catch (final Exception e) {
throw new RuntimeException(e);
}
}
};
Utils.runWithAllOptimizationLevels(action);
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/HostExceptionsTest.java 0000644 0001750 0001750 00000006312 11261076053 026640 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Assert;
import org.junit.Test;
import org.mozilla.javascript.Context;
import org.mozilla.javascript.ContextAction;
import org.mozilla.javascript.ContextFactory;
import org.mozilla.javascript.Scriptable;
import org.mozilla.javascript.ScriptableObject;
/**
* It can be useful to avoid that JavaScript catch block can catch internal exceptions in host objects.
* Indeed it hides these exception and makes more difficult to find the root problems.
* @see Rhino bug 519935
* @author Marc Guillemot
*/
public class HostExceptionsTest {
/**
* JS catch block should always catch JS exceptions
*/
@Test
public void testCatchJSException() throws Exception {
doTest("foo.willThrowJSException", true);
doTest("foo.willThrowJSException", false);
}
/**
* Per default JS catch block catch Java exception
*/
@Test
public void testCatchJavaException() throws Exception {
doTest("foo.willThrowJavaException", true);
doTest("foo.throwJavaException()", true);
}
/**
* If configured, JS catch block should not catch Java exception
*/
@Test
public void testDontCatchJavaException_inGetter() throws Exception {
try {
doTest("foo.willThrowJavaException", false);
Assert.fail("Should have throw!");
}
catch(final Exception e)
{
Assert.assertSame(MyScriptable.javaException, e.getCause());
}
}
/**
* If configured, JS catch block should not catch Java exception
*/
@Test
public void testDontCatchJavaException_inFunction() throws Exception {
try {
doTest("foo.throwJavaException()", false);
Assert.fail("Should have throw!");
}
catch(final Exception e)
{
Assert.assertSame(MyScriptable.javaException, e.getCause());
}
}
private void doTest(final String jsExpression, final boolean contextFeatureJSCatchOn) throws Exception {
final String script = "var foo = new MyScriptable(); try { " + jsExpression + "} catch(e) {}";
final ContextFactory myContextFactory = new ContextFactory() {
protected boolean hasFeature(final Context cx, final int featureIndex) {
if (Context.FEATURE_HTMLUNIT_JS_CATCH_JAVA_EXCEPTION == featureIndex) {
return contextFeatureJSCatchOn;
}
return super.hasFeature(cx, featureIndex);
};
};
final ContextAction action = new ContextAction() {
public Object run(final Context cx) {
final Scriptable scope = cx.initStandardObjects();
try {
ScriptableObject.defineClass(scope, MyScriptable.class);
}
catch (final Exception e) {
throw new RuntimeException();
}
cx.evaluateString(scope, script, "test.js", 0, null);
return null;
}
};
Utils.runWithAllOptimizationLevels(myContextFactory, action);
}
public static class MyScriptable extends ScriptableObject {
static RuntimeException javaException = new NullPointerException();
@Override
public String getClassName() {
return "MyScriptable";
}
public String jsGet_willThrowJavaException() {
throw javaException;
}
public String jsGet_willThrowJSException() {
throw Context.reportRuntimeError("this is a JS exception");
}
public void jsFunction_throwJavaException() {
throw javaException;
}
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/ContextMethodsTest.java 0000644 0001750 0001750 00000003606 11154745020 026632 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import org.junit.Assert;
import org.junit.Test;
import org.mozilla.javascript.Context;
import org.mozilla.javascript.ContextAction;
import org.mozilla.javascript.ContextFactory;
import org.mozilla.javascript.ErrorReporter;
import org.mozilla.javascript.Evaluator;
import org.mozilla.javascript.Script;
import org.mozilla.javascript.Scriptable;
/**
* Unit tests for Bug 481152 -
* Open Context class for extension
* @author Marc Guillemot
*/
public class ContextMethodsTest
{
/**
* When {@link Context#compileString(String, String, int, Object)} is protected and not final,
* we can capture code passed to eval.
* @throws Exception if the test fails
*/
@Test
public void captureEvalScript() throws Exception {
final List compiled = new ArrayList();
final ContextFactory cf = new ContextFactory() {
@Override
protected Context makeContext() {
return new Context(this)
{
@Override
protected Script compileString(String source, Evaluator compiler,
ErrorReporter compilationErrorReporter, String sourceName,
int lineno, Object securityDomain) {
compiled.add(source);
return super.compileString(source, compiler, compilationErrorReporter,
sourceName, lineno, securityDomain);
}
};
}
};
final String source = "eval('1 + 2')";
final ContextAction action = new ContextAction()
{
public Object run(Context cx) {
final Scriptable scope = cx.initStandardObjects();
final Script script = cx.compileString(source, "", 1, (Object) null);
return script.exec(cx, scope);
};
};
cf.call(action);
final String[] expected = { "eval('1 + 2')", "1 + 2" };
Assert.assertEquals(Arrays.asList(expected), compiled);
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/ExceptionPropertiesTest.java 0000644 0001750 0001750 00000005515 11343213760 027677 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Assert;
import org.junit.Test;
import org.mozilla.javascript.Context;
import org.mozilla.javascript.ContextAction;
import org.mozilla.javascript.RhinoException;
import org.mozilla.javascript.ScriptableObject;
/**
* Unit tests for bug 549604.
* This tests verify the properties of a JS exception and ensures that they don't change with different optimization levels.
* @author Marc Guillemot
*/
public class ExceptionPropertiesTest {
final static String LS = System.getProperty("line.separator");
@Test
public void scriptStackTrace() {
testScriptStackTrace("null.method()", "\tat myScript.js:1" + LS);
final String script = "function f() \n"
+ "{\n"
+ " null.method();\n"
+ "}\n"
+ "f();\n";
testScriptStackTrace(script, "\tat myScript.js:3 (f)" + LS + "\tat myScript.js:5" + LS);
}
private void testScriptStackTrace(final String script, final String expectedStackTrace) {
testScriptStackTrace(script, expectedStackTrace, -1);
testScriptStackTrace(script, expectedStackTrace, 0);
testScriptStackTrace(script, expectedStackTrace, 1);
}
private void testScriptStackTrace(final String script, final String expectedStackTrace,
final int optimizationLevel) {
try {
Utilities.executeScript(script, optimizationLevel);
}
catch (final RhinoException e) {
Assert.assertEquals(expectedStackTrace, e.getScriptStackTrace());
}
}
@Test
public void fileName() {
testIt("try { null.method() } catch (e) { e.fileName }", "myScript.js");
testIt("try { null.property } catch (e) { e.fileName }", "myScript.js");
}
@Test
public void lineNumber() {
testIt("try { null.method() } catch (e) { e.lineNumber }", 1);
testIt("try {\n null.method() \n} catch (e) { e.lineNumber }", 2);
testIt("\ntry \n{\n null.method() \n} catch (e) { e.lineNumber }", 4);
testIt("function f() {\n null.method(); \n}\n try { f() } catch (e) { e.lineNumber }", 2);
}
@Test
public void stack() {
testIt("try { null.method() } catch (e) { e.stack }", "@myScript.js:1" + LS);
final String expectedStack = "f()@myScript.js:2" + LS
+ "@myScript.js:4" + LS;
testIt("function f() {\n null.method(); \n}\n try { f() } catch (e) { e.stack }", expectedStack);
}
private void testIt(final String script, final Object expected) {
final ContextAction action = new ContextAction() {
public Object run(final Context cx) {
try {
final ScriptableObject scope = cx.initStandardObjects();
final Object o = cx.evaluateString(scope, script,
"myScript.js", 1, null);
Assert.assertEquals(expected, o);
return o;
}
catch (final RuntimeException e) {
throw e;
}
catch (final Exception e) {
throw new RuntimeException(e);
}
}
};
Utils.runWithAllOptimizationLevels(action);
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/ArrayConcatTest.java 0000644 0001750 0001750 00000001111 11154745177 026072 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Test;
/**
* Unit tests for Bug 477604 -
* Array.concat causes ArrayIndexOutOfBoundException with non dense array
* @author Marc Guillemot
*/
public class ArrayConcatTest
{
/**
* @throws Exception if the test fails
*/
@Test
public void concat() throws Exception {
final String script = "var a = [1, 2, 3];\n"
+ "for (var i=10; i<20; ++i) a[i] = 't' + i;\n"
+ "var b = [1, 2, 3];\n"
+ "b.concat(a)";
Utilities.executeScript(script);
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/Utilities.java 0000644 0001750 0001750 00000002207 11343214034 024765 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.mozilla.javascript.Context;
import org.mozilla.javascript.ContextAction;
import org.mozilla.javascript.ContextFactory;
import org.mozilla.javascript.Scriptable;
/**
* Misc utilities.
* @author Marc Guillemot
*/
public class Utilities {
/**
* Execute the provided script in a fresh context
* @param script the script
*/
static void executeScript(final String script) {
final ContextAction action = new ContextAction()
{
public Object run(Context cx) {
final Scriptable scope = cx.initStandardObjects();
return cx.evaluateString(scope, script, "myScript.js", 1, null);
}
};
Utils.runWithAllOptimizationLevels(action);
}
/**
* Execute the provided script in a fresh context
* @param script the script
*/
static void executeScript(final String script, final int optimizationLevel) {
final ContextAction action = new ContextAction()
{
public Object run(Context cx) {
final Scriptable scope = cx.initStandardObjects();
return cx.evaluateString(scope, script, "myScript.js", 1, null);
}
};
Utils.runWithOptimizationLevel(action, optimizationLevel);
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/StackTraceTest.java 0000644 0001750 0001750 00000003175 11223107350 025702 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Assert;
import org.junit.Test;
import org.mozilla.javascript.Context;
import org.mozilla.javascript.ContextAction;
import org.mozilla.javascript.JavaScriptException;
import org.mozilla.javascript.Scriptable;
/**
* In certain cases stacktrace if lost in case of exception
* https://bugzilla.mozilla.org/show_bug.cgi?id=376717
* @author Marc Guillemot
*/
public class StackTraceTest
{
/**
* As of CVS head on May, 11. 2009, stacktrace information is lost when a call to some
* native function has been made.
*/
@Test
public void testFailureStackTrace() {
final String source1 = "function f2() { throw 'hello'; }; f2();";
final String source2 = "function f2() { 'H'.toLowerCase(); throw 'hello'; }; f2();";
runWithExpectedStackTrace(source1, " at test.js (f2)\n\tat test.js\n"); // works
runWithExpectedStackTrace(source2, " at test.js (f2)\n\tat test.js\n"); // fails
}
private void runWithExpectedStackTrace(final String _source, final String _expectedStackTrace)
{
final ContextAction action = new ContextAction() {
public Object run(final Context cx) {
final Scriptable scope = cx.initStandardObjects();
try {
cx.evaluateString(scope, _source, "test.js", 0, null);
}
catch (final JavaScriptException e)
{
Assert.assertEquals(_expectedStackTrace, e.getScriptStackTrace());
return null;
}
throw new RuntimeException("Exception expected!");
}
};
Utils.runWithOptimizationLevel(action, -1);
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/WriteReadOnlyPropertyTest.java 0000644 0001750 0001750 00000004724 11261073713 030163 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import java.lang.reflect.Method;
import org.junit.Assert;
import org.junit.Test;
import org.mozilla.javascript.Context;
import org.mozilla.javascript.ContextAction;
import org.mozilla.javascript.ContextFactory;
import org.mozilla.javascript.EcmaError;
import org.mozilla.javascript.ScriptableObject;
/**
* Test that read-only properties can be... set when needed.
* This was the standard behavior in Rhino until 1.7R2 but has changed then.
* It is needed to simulate IE as well as FF2 (but not FF3).
* @see Rhino bug 519933
* @author Marc Guillemot
*/
public class WriteReadOnlyPropertyTest {
/**
* @throws Exception if the test fails
*/
@Test
public void testWriteReadOnly_accepted() throws Exception {
testWriteReadOnly(true);
}
/**
* @throws Exception if the test fails
*/
@Test
public void testWriteReadOnly_throws() throws Exception {
try {
testWriteReadOnly(false);
Assert.fail();
}
catch (EcmaError e) {
Assert.assertTrue(e.getMessage(), e.getMessage().contains("Cannot set property myProp that has only a getter"));
}
}
void testWriteReadOnly(final boolean acceptWriteReadOnly) throws Exception {
final Method readMethod = Foo.class.getMethod("getMyProp", null);
final Foo foo = new Foo("hello");
foo.defineProperty("myProp", null, readMethod, null, ScriptableObject.EMPTY);
final String script = "foo.myProp = 123; foo.myProp";
final ContextAction action = new ContextAction() {
public Object run(final Context cx) {
final ScriptableObject top = cx.initStandardObjects();
ScriptableObject.putProperty(top, "foo", foo);
System.out.println(cx.evaluateString(top, script, "script", 0, null));
return null;
}
};
final ContextFactory contextFactory = new ContextFactory() {
@Override
protected boolean hasFeature(final Context cx, final int featureIndex) {
if (Context.FEATURE_HTMLUNIT_WRITE_READONLY_PROPERTIES == featureIndex) {
return acceptWriteReadOnly;
}
return super.hasFeature(cx, featureIndex);
}
};
contextFactory.call(action);
}
/**
* Simple utility allowing to better see the concerned scope while debugging
*/
static class Foo extends ScriptableObject
{
final String prop_;
Foo(final String label)
{
prop_ = label;
}
@Override
public String getClassName()
{
return "Foo";
}
public String getMyProp()
{
return prop_;
}
};
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/ArgumentsTest.java 0000644 0001750 0001750 00000001123 11321335670 025621 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Test;
/**
* String conversion of Arguments array used to be '[object Object]',
* with EcmaScript 5 it is now '[object Arguments]' what is not good for HtmlUnit.
* @author Marc Guillemot
*/
public class ArgumentsTest
{
/**
* @throws Exception if the test fails
*/
@Test
public void argumentstoString() throws Exception {
final String script = "function f() {\n"
+ "var s = arguments.toString();"
+ "if ('[object Object]' != s)\n"
+ " throw 'got: ' + s;"
+ "}\n"
+ "f()";
Utilities.executeScript(script);
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/UpperCaseHexTest.java 0000644 0001750 0001750 00000001061 11075604241 026210 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Test;
/**
* Test that encodeURIComponent uses upper case letters for hex encoding.
* https://bugzilla.mozilla.org/show_bug.cgi?id=429121
* (now fixed in Rhino itself)
* @author Marc Guillemot
*/
public class UpperCaseHexTest {
/**
* @throws Exception if the test fails
*/
@Test
public void testUpperCaseHex() throws Exception {
final String script = "var a = encodeURIComponent('$ a ;');\n"
+ "if (a != '%24%20a%20%3B') throw 'got: >' + a + '<'";
Utilities.executeScript(script);
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/FunctionCaller.java 0000644 0001750 0001750 00000002241 11311524415 025722 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Test;
import org.mozilla.javascript.Context;
import org.mozilla.javascript.ContextAction;
import org.mozilla.javascript.Scriptable;
/**
* Test for a basic implementation of caller property on functions.
* Implementation is not yet good enough to propose a patch to Rhino.
* @author Marc Guillemot
*/
public class FunctionCaller {
/**
* JS catch block should always catch JS exceptions
*/
@Test
public void callee() throws Exception {
final String script = "function f() {\n"
+ " var c = arguments.callee.caller;\n"
+ " if (c) throw 'got: ' + c;\n"
+ " if (g.caller) throw 'got: ' + c;\n"
+ " g();\n"
+ " if (g.caller) throw 'after g() got: ' + g.caller;\n"
+ "}\n"
+ "function g() {\n"
+ " var c = arguments.callee.caller;\n"
+ " if (c != f) throw 'got: ' + c;\n"
+ "}\n"
+ "f();\n";
final ContextAction action = new ContextAction() {
public Object run(final Context cx) {
final Scriptable scope = cx.initStandardObjects();
cx.evaluateString(scope, script, "test.js", 1, null);
return null;
}
};
Utils.runWithOptimizationLevel(action, -1);
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/PropertiesOrderTest.java 0000644 0001750 0001750 00000001345 11075604454 027017 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Test;
/**
* Test that Object properties are returned in the creation order.
* (now fixed in Rhino itself)
* @author Marc Guillemot
*/
public class PropertiesOrderTest {
/**
* Test for properties order as exposed in issues
* https://bugzilla.mozilla.org/show_bug.cgi?id=419090
* and
* https://bugzilla.mozilla.org/show_bug.cgi?id=383592
* @throws Exception if the test fails
*/
@Test
public void testPropertiesOrder() throws Exception {
final String script = "var o = {a: 1, b: 1, c: 1, d: 1};\n"
+ "var str = '';\n"
+ "for (var i in o) str += i + ' ';\n"
+ "if (str != 'a b c d ')\n"
+ " throw 'Got: ' + str";
Utilities.executeScript(script);
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/Utils.java 0000644 0001750 0001750 00000003070 11261076053 024117 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.mozilla.javascript.Context;
import org.mozilla.javascript.ContextAction;
import org.mozilla.javascript.ContextFactory;
/**
* Misc utilities to make test code easier.
* @author Marc Guillemot
*/
public class Utils
{
/**
* Runs the action successively with all available optimization levels
*/
public static void runWithAllOptimizationLevels(final ContextAction action)
{
runWithOptimizationLevel(action, -1);
runWithOptimizationLevel(action, 0);
runWithOptimizationLevel(action, 1);
}
/**
* Runs the action successively with all available optimization levels
*/
public static void runWithAllOptimizationLevels(final ContextFactory contextFactory, final ContextAction action)
{
runWithOptimizationLevel(contextFactory, action, -1);
runWithOptimizationLevel(contextFactory, action, 0);
runWithOptimizationLevel(contextFactory, action, 1);
}
/**
* Runs the provided action at the given optimization level
*/
public static void runWithOptimizationLevel(final ContextAction action, final int optimizationLevel)
{
runWithOptimizationLevel(new ContextFactory(), action, optimizationLevel);
}
/**
* Runs the provided action at the given optimization level
*/
public static void runWithOptimizationLevel(final ContextFactory contextFactory, final ContextAction action, final int optimizationLevel)
{
final Context cx = contextFactory.enterContext();
try
{
cx.setOptimizationLevel(optimizationLevel);
action.run(cx);
}
finally
{
Context.exit();
}
}
}
htmlunit-core-js-2.8/src/net/sourceforge/htmlunit/RegExpUnescapedSlashTest.java 0000644 0001750 0001750 00000000744 11075604454 027706 0 ustar cavedon cavedon package net.sourceforge.htmlunit;
import org.junit.Test;
/**
* Test that regexp like "[/]" are parsed correctly.
* https://bugzilla.mozilla.org/show_bug.cgi?id=368019
* (now fixed in Rhino itself)
* @author Marc Guillemot
*/
public class RegExpUnescapedSlashTest {
/**
* @throws Exception if the test fails
*/
@Test
public void testUnescapedSlashInSquareBrackets() throws Exception {
final String script = "var o = /[/]/;";
Utilities.executeScript(script);
}
}
htmlunit-core-js-2.8/LICENSE.txt 0000644 0001750 0001750 00000000643 10776653510 016247 0 ustar cavedon cavedon htmlunit-core-js.jar is a modified version of Mozilla Rhino (http://www.mozilla.org/rhino/)
which was initially developed by Netscape Communications Corporation. The changes to
the source code are provided in the file rhinoDiff.txt (and can be generated by calling cvs diff in the rhino folder).
This software is provided by the HtmlUnit team "as is" under the MPL 1.1 license,
available at http://www.mozilla.org/MPL htmlunit-core-js-2.8/lib/ 0000755 0001750 0001750 00000000000 11530107756 015162 5 ustar cavedon cavedon htmlunit-core-js-2.8/rhino/ 0000755 0001750 0001750 00000000000 11530107756 015533 5 ustar cavedon cavedon htmlunit-core-js-2.8/rhino/build.properties 0000644 0001750 0001750 00000004221 11222460357 020744 0 ustar cavedon cavedon # ***** BEGIN LICENSE BLOCK *****
# Version: MPL 1.1/GPL 2.0
#
# The contents of this file are subject to the Mozilla Public License Version
# 1.1 (the "License"); you may not use this file except in compliance with
# the License. You may obtain a copy of the License at
# http://www.mozilla.org/MPL/
#
# Software distributed under the License is distributed on an "AS IS" basis,
# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
# for the specific language governing rights and limitations under the
# License.
#
# The Original Code is Rhino code, released
# May 6, 1999.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1997-1999
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Igor Bukanov
#
# Alternatively, the contents of this file may be used under the terms of
# the GNU General Public License Version 2 or later (the "GPL"), in which
# case the provisions of the GPL are applicable instead of those above. If
# you wish to allow use of your version of this file only under the terms of
# the GPL and not to allow others to use your version of this file under the
# MPL, indicate your decision by deleting the provisions above and replacing
# them with the notice and other provisions required by the GPL. If you do
# not delete the provisions above, a recipient may use your version of this
# file under either the MPL or the GPL.
#
# ***** END LICENSE BLOCK *****
name: rhino
Name: Rhino
version: 1_7R3pre
# See Context#getImplementationVersion() for format of this!
implementation.version: Rhino 1.7 release 3 PRERELEASE ${implementation.date}
build.dir: build
rhino.jar: js.jar
small-rhino.jar: smalljs.jar
rhino-14.jar: js-14.jar
small-rhino-14.jar: smalljs-14.jar
dist.name: rhino${version}
dist.dir: ${build.dir}/${dist.name}
# compilation destionation
classes: ${build.dir}/classes
# compilation settings
debug: on
target-jvm: 1.5
source-level: 1.5
# jar generation settings
jar-compression: true
# optional external packages
xmlbeans: .
xbean.jar: ${xmlbeans}/lib/xbean.jar
jsr173.jar: ${xmlbeans}/lib/jsr173_1.0_api.jar
htmlunit-core-js-2.8/rhino/src/ 0000755 0001750 0001750 00000000000 11530107756 016322 5 ustar cavedon cavedon htmlunit-core-js-2.8/rhino/src/build.xml 0000644 0001750 0001750 00000006653 11222455466 020157 0 ustar cavedon cavedon
htmlunit-core-js-2.8/rhino/src/manifest 0000644 0001750 0001750 00000000354 11321335670 020051 0 ustar cavedon cavedon Manifest-Version: 1.0
Main-Class: org.mozilla.javascript.tools.shell.Main
Implementation-Version: 1.7R2
Implementation-Title: Mozilla Rhino 1.7R2
Implementation-Vendor: Mozilla Foundation
Implementation-URL: http://www.mozilla.org/rhino htmlunit-core-js-2.8/rhino/src/org/ 0000755 0001750 0001750 00000000000 11530107756 017111 5 ustar cavedon cavedon htmlunit-core-js-2.8/rhino/src/org/mozilla/ 0000755 0001750 0001750 00000000000 11530107756 020560 5 ustar cavedon cavedon htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/ 0000755 0001750 0001750 00000000000 11530107756 022726 5 ustar cavedon cavedon htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/NativeIterator.java 0000644 0001750 0001750 00000022772 11222455466 026545 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* Contributor(s):
* Norris Boyd
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript;
import java.util.Iterator;
/**
* This class implements iterator objects. See
* http://developer.mozilla.org/en/docs/New_in_JavaScript_1.7#Iterators
*
* @author Norris Boyd
*/
public final class NativeIterator extends IdScriptableObject {
private static final long serialVersionUID = -4136968203581667681L;
private static final Object ITERATOR_TAG = "Iterator";
static void init(ScriptableObject scope, boolean sealed) {
// Iterator
NativeIterator iterator = new NativeIterator();
iterator.exportAsJSClass(MAX_PROTOTYPE_ID, scope, sealed);
// Generator
NativeGenerator.init(scope, sealed);
// StopIteration
NativeObject obj = new StopIteration();
obj.setPrototype(getObjectPrototype(scope));
obj.setParentScope(scope);
if (sealed) { obj.sealObject(); }
ScriptableObject.defineProperty(scope, STOP_ITERATION, obj,
ScriptableObject.DONTENUM);
// Use "associateValue" so that generators can continue to
// throw StopIteration even if the property of the global
// scope is replaced or deleted.
scope.associateValue(ITERATOR_TAG, obj);
}
/**
* Only for constructing the prototype object.
*/
private NativeIterator() {
}
private NativeIterator(Object objectIterator) {
this.objectIterator = objectIterator;
}
/**
* Get the value of the "StopIteration" object. Note that this value
* is stored in the top-level scope using "associateValue" so the
* value can still be found even if a script overwrites or deletes
* the global "StopIteration" property.
* @param scope a scope whose parent chain reaches a top-level scope
* @return the StopIteration object
*/
public static Object getStopIterationObject(Scriptable scope) {
Scriptable top = ScriptableObject.getTopLevelScope(scope);
return ScriptableObject.getTopScopeValue(top, ITERATOR_TAG);
}
private static final String STOP_ITERATION = "StopIteration";
public static final String ITERATOR_PROPERTY_NAME = "__iterator__";
static class StopIteration extends NativeObject {
private static final long serialVersionUID = 2485151085722377663L;
@Override
public String getClassName() {
return STOP_ITERATION;
}
/* StopIteration has custom instanceof behavior since it
* doesn't have a constructor.
*/
@Override
public boolean hasInstance(Scriptable instance) {
return instance instanceof StopIteration;
}
}
@Override
public String getClassName() {
return "Iterator";
}
@Override
protected void initPrototypeId(int id) {
String s;
int arity;
switch (id) {
case Id_constructor: arity=2; s="constructor"; break;
case Id_next: arity=0; s="next"; break;
case Id___iterator__: arity=1; s=ITERATOR_PROPERTY_NAME; break;
default: throw new IllegalArgumentException(String.valueOf(id));
}
initPrototypeMethod(ITERATOR_TAG, id, s, arity);
}
@Override
public Object execIdCall(IdFunctionObject f, Context cx, Scriptable scope,
Scriptable thisObj, Object[] args)
{
if (!f.hasTag(ITERATOR_TAG)) {
return super.execIdCall(f, cx, scope, thisObj, args);
}
int id = f.methodId();
if (id == Id_constructor) {
return jsConstructor(cx, scope, thisObj, args);
}
if (!(thisObj instanceof NativeIterator))
throw incompatibleCallError(f);
NativeIterator iterator = (NativeIterator) thisObj;
switch (id) {
case Id_next:
return iterator.next(cx, scope);
case Id___iterator__:
/// XXX: what about argument? SpiderMonkey apparently ignores it
return thisObj;
default:
throw new IllegalArgumentException(String.valueOf(id));
}
}
/* The JavaScript constructor */
private static Object jsConstructor(Context cx, Scriptable scope,
Scriptable thisObj, Object[] args)
{
if (args.length == 0 || args[0] == null ||
args[0] == Undefined.instance)
{
throw ScriptRuntime.typeError1("msg.no.properties",
ScriptRuntime.toString(args[0]));
}
Scriptable obj = ScriptRuntime.toObject(scope, args[0]);
boolean keyOnly = args.length > 1 && ScriptRuntime.toBoolean(args[1]);
if (thisObj != null) {
// Called as a function. Convert to iterator if possible.
// For objects that implement java.lang.Iterable or
// java.util.Iterator, have JavaScript Iterator call the underlying
// iteration methods
Iterator iterator =
VMBridge.instance.getJavaIterator(cx, scope, obj);
if (iterator != null) {
scope = ScriptableObject.getTopLevelScope(scope);
return cx.getWrapFactory().wrap(cx, scope,
new WrappedJavaIterator(iterator, scope),
WrappedJavaIterator.class);
}
// Otherwise, just call the runtime routine
Scriptable jsIterator = ScriptRuntime.toIterator(cx, scope, obj,
keyOnly);
if (jsIterator != null) {
return jsIterator;
}
}
// Otherwise, just set up to iterate over the properties of the object.
// Do not call __iterator__ method.
Object objectIterator = ScriptRuntime.enumInit(obj, cx,
keyOnly ? ScriptRuntime.ENUMERATE_KEYS_NO_ITERATOR
: ScriptRuntime.ENUMERATE_ARRAY_NO_ITERATOR);
ScriptRuntime.setEnumNumbers(objectIterator, true);
NativeIterator result = new NativeIterator(objectIterator);
result.setPrototype(ScriptableObject.getClassPrototype(scope,
result.getClassName()));
result.setParentScope(scope);
return result;
}
private Object next(Context cx, Scriptable scope) {
Boolean b = ScriptRuntime.enumNext(this.objectIterator);
if (!b.booleanValue()) {
// Out of values. Throw StopIteration.
throw new JavaScriptException(
NativeIterator.getStopIterationObject(scope), null, 0);
}
return ScriptRuntime.enumId(this.objectIterator, cx);
}
static public class WrappedJavaIterator
{
WrappedJavaIterator(Iterator iterator, Scriptable scope) {
this.iterator = iterator;
this.scope = scope;
}
public Object next() {
if (!iterator.hasNext()) {
// Out of values. Throw StopIteration.
throw new JavaScriptException(
NativeIterator.getStopIterationObject(scope), null, 0);
}
return iterator.next();
}
public Object __iterator__(boolean b) {
return this;
}
private Iterator iterator;
private Scriptable scope;
}
// #string_id_map#
@Override
protected int findPrototypeId(String s) {
int id;
// #generated# Last update: 2007-06-11 09:43:19 EDT
L0: { id = 0; String X = null;
int s_length = s.length();
if (s_length==4) { X="next";id=Id_next; }
else if (s_length==11) { X="constructor";id=Id_constructor; }
else if (s_length==12) { X="__iterator__";id=Id___iterator__; }
if (X!=null && X!=s && !X.equals(s)) id = 0;
break L0;
}
// #/generated#
return id;
}
private static final int
Id_constructor = 1,
Id_next = 2,
Id___iterator__ = 3,
MAX_PROTOTYPE_ID = 3;
// #/string_id_map#
private Object objectIterator;
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/jdk13/ 0000755 0001750 0001750 00000000000 11530107756 023642 5 ustar cavedon cavedon htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/jdk13/VMBridge_jdk13.java 0000644 0001750 0001750 00000013410 11111044312 027116 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-2000
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript.jdk13;
import java.lang.reflect.AccessibleObject;
import java.lang.reflect.Constructor;
import java.lang.reflect.InvocationHandler;
import java.lang.reflect.InvocationTargetException;
import java.lang.reflect.Method;
import java.lang.reflect.Member;
import java.lang.reflect.Proxy;
import org.mozilla.javascript.*;
public class VMBridge_jdk13 extends VMBridge
{
private ThreadLocal contextLocal = new ThreadLocal();
@Override
protected Object getThreadContextHelper()
{
// To make subsequent batch calls to getContext/setContext faster
// associate permanently one element array with contextLocal
// so getContext/setContext would need just to read/write the first
// array element.
// Note that it is necessary to use Object[], not Context[] to allow
// garbage collection of Rhino classes. For details see comments
// by Attila Szegedi in
// https://bugzilla.mozilla.org/show_bug.cgi?id=281067#c5
Object[] storage = contextLocal.get();
if (storage == null) {
storage = new Object[1];
contextLocal.set(storage);
}
return storage;
}
@Override
protected Context getContext(Object contextHelper)
{
Object[] storage = (Object[])contextHelper;
return (Context)storage[0];
}
@Override
protected void setContext(Object contextHelper, Context cx)
{
Object[] storage = (Object[])contextHelper;
storage[0] = cx;
}
@Override
protected ClassLoader getCurrentThreadClassLoader()
{
return Thread.currentThread().getContextClassLoader();
}
@Override
protected boolean tryToMakeAccessible(Object accessibleObject)
{
if (!(accessibleObject instanceof AccessibleObject)) {
return false;
}
AccessibleObject accessible = (AccessibleObject)accessibleObject;
if (accessible.isAccessible()) {
return true;
}
try {
accessible.setAccessible(true);
} catch (Exception ex) { }
return accessible.isAccessible();
}
@Override
protected Object getInterfaceProxyHelper(ContextFactory cf,
Class[] interfaces)
{
// XXX: How to handle interfaces array withclasses from different
// class loaders? Using cf.getApplicationClassLoader() ?
ClassLoader loader = interfaces[0].getClassLoader();
Class cl = Proxy.getProxyClass(loader, interfaces);
Constructor c;
try {
c = cl.getConstructor(new Class[] { InvocationHandler.class });
} catch (NoSuchMethodException ex) {
// Should not happen
throw Kit.initCause(new IllegalStateException(), ex);
}
return c;
}
@Override
protected Object newInterfaceProxy(Object proxyHelper,
final ContextFactory cf,
final InterfaceAdapter adapter,
final Object target,
final Scriptable topScope)
{
Constructor c = (Constructor)proxyHelper;
InvocationHandler handler = new InvocationHandler() {
public Object invoke(Object proxy,
Method method,
Object[] args)
{
return adapter.invoke(cf, target, topScope, method, args);
}
};
Object proxy;
try {
proxy = c.newInstance(new Object[] { handler });
} catch (InvocationTargetException ex) {
throw Context.throwAsScriptRuntimeEx(ex);
} catch (IllegalAccessException ex) {
// Shouls not happen
throw Kit.initCause(new IllegalStateException(), ex);
} catch (InstantiationException ex) {
// Shouls not happen
throw Kit.initCause(new IllegalStateException(), ex);
}
return proxy;
}
@Override
protected boolean isVarArgs(Member member) {
return false;
}
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/ConstProperties.java 0000644 0001750 0001750 00000011526 10776622373 026751 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Bob Jervis
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
// API class
package org.mozilla.javascript;
public interface ConstProperties {
/**
* Sets a named const property in this object.
*
* The property is specified by a string name
* as defined for Scriptable.get.
*
* The possible values that may be passed in are as defined for
* Scriptable.get. A class that implements this method may choose
* to ignore calls to set certain properties, in which case those
* properties are effectively read-only.
* For properties defined in a prototype chain,
* use putProperty in ScriptableObject.
* Note that if a property a is defined in the prototype p
* of an object o, then evaluating o.a = 23 will cause
* set to be called on the prototype p with
* o as the start parameter.
* To preserve JavaScript semantics, it is the Scriptable
* object's responsibility to modify o.
* This design allows properties to be defined in prototypes and implemented
* in terms of getters and setters of Java values without consuming slots
* in each instance.
*
* The values that may be set are limited to the following:
*
*
java.lang.Boolean objects
*
java.lang.String objects
*
java.lang.Number objects
*
org.mozilla.javascript.Scriptable objects
*
null
*
The value returned by Context.getUndefinedValue()
*
* Arbitrary Java objects may be wrapped in a Scriptable by first calling
* Context.toObject. This allows the property of a JavaScript
* object to contain an arbitrary Java object as a value.
* Note that has will be called by the runtime first before
* set is called to determine in which object the
* property is defined.
* Note that this method is not expected to traverse the prototype chain,
* which is different from the ECMA [[Put]] operation.
* @param name the name of the property
* @param start the object whose property is being set
* @param value value to set the property to
* @see org.mozilla.javascript.Scriptable#has(String, Scriptable)
* @see org.mozilla.javascript.Scriptable#get(String, Scriptable)
* @see org.mozilla.javascript.ScriptableObject#putProperty(Scriptable, String, Object)
* @see org.mozilla.javascript.Context#toObject(Object, Scriptable)
*/
public void putConst(String name, Scriptable start, Object value);
/**
* Reserves a definition spot for a const. This will set up a definition
* of the const property, but set its value to undefined. The semantics of
* the start parameter is the same as for putConst.
* @param name The name of the property.
* @param start The object whose property is being reserved.
*/
public void defineConst(String name, Scriptable start);
/**
* Returns true if the named property is defined as a const on this object.
* @param name
* @return true if the named property is defined as a const, false
* otherwise.
*/
public boolean isConst(String name);
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/IdFunctionObject.java 0000644 0001750 0001750 00000013620 10776622373 026774 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Igor Bukanov
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
// API class
package org.mozilla.javascript;
public class IdFunctionObject extends BaseFunction
{
static final long serialVersionUID = -5332312783643935019L;
public IdFunctionObject(IdFunctionCall idcall, Object tag, int id, int arity)
{
if (arity < 0)
throw new IllegalArgumentException();
this.idcall = idcall;
this.tag = tag;
this.methodId = id;
this.arity = arity;
if (arity < 0) throw new IllegalArgumentException();
}
public IdFunctionObject(IdFunctionCall idcall, Object tag, int id,
String name, int arity, Scriptable scope)
{
super(scope, null);
if (arity < 0)
throw new IllegalArgumentException();
if (name == null)
throw new IllegalArgumentException();
this.idcall = idcall;
this.tag = tag;
this.methodId = id;
this.arity = arity;
this.functionName = name;
}
public void initFunction(String name, Scriptable scope)
{
if (name == null) throw new IllegalArgumentException();
if (scope == null) throw new IllegalArgumentException();
this.functionName = name;
setParentScope(scope);
}
public final boolean hasTag(Object tag)
{
return this.tag == tag;
}
public final int methodId()
{
return methodId;
}
public final void markAsConstructor(Scriptable prototypeProperty)
{
useCallAsConstructor = true;
setImmunePrototypeProperty(prototypeProperty);
}
public final void addAsProperty(Scriptable target)
{
ScriptableObject.defineProperty(target, functionName, this,
ScriptableObject.DONTENUM);
}
public void exportAsScopeProperty()
{
addAsProperty(getParentScope());
}
@Override
public Scriptable getPrototype()
{
// Lazy initialization of prototype: for native functions this
// may not be called at all
Scriptable proto = super.getPrototype();
if (proto == null) {
proto = getFunctionPrototype(getParentScope());
setPrototype(proto);
}
return proto;
}
@Override
public Object call(Context cx, Scriptable scope, Scriptable thisObj,
Object[] args)
{
return idcall.execIdCall(this, cx, scope, thisObj, args);
}
@Override
public Scriptable createObject(Context cx, Scriptable scope)
{
if (useCallAsConstructor) {
return null;
}
// Throw error if not explicitly coded to be used as constructor,
// to satisfy ECMAScript standard (see bugzilla 202019).
// To follow current (2003-05-01) SpiderMonkey behavior, change it to:
// return super.createObject(cx, scope);
throw ScriptRuntime.typeError1("msg.not.ctor", functionName);
}
@Override
String decompile(int indent, int flags)
{
StringBuffer sb = new StringBuffer();
boolean justbody = (0 != (flags & Decompiler.ONLY_BODY_FLAG));
if (!justbody) {
sb.append("function ");
sb.append(getFunctionName());
sb.append("() { ");
}
sb.append("[native code for ");
if (idcall instanceof Scriptable) {
Scriptable sobj = (Scriptable)idcall;
sb.append(sobj.getClassName());
sb.append('.');
}
sb.append(getFunctionName());
sb.append(", arity=");
sb.append(getArity());
sb.append(justbody ? "]\n" : "] }\n");
return sb.toString();
}
@Override
public int getArity()
{
return arity;
}
@Override
public int getLength() { return getArity(); }
@Override
public String getFunctionName()
{
return (functionName == null) ? "" : functionName;
}
public final RuntimeException unknown()
{
// It is program error to call id-like methods for unknown function
return new IllegalArgumentException(
"BAD FUNCTION ID="+methodId+" MASTER="+idcall);
}
private final IdFunctionCall idcall;
private final Object tag;
private final int methodId;
private int arity;
private boolean useCallAsConstructor;
private String functionName;
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/NativeJavaConstructor.java 0000644 0001750 0001750 00000005524 10776622373 030105 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
* Frank Mitchell
* Mike Shaver
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript;
/**
* This class reflects a single Java constructor into the JavaScript
* environment. It satisfies a request for an overloaded constructor,
* as introduced in LiveConnect 3.
* All NativeJavaConstructors behave as JSRef `bound' methods, in that they
* always construct the same NativeJavaClass regardless of any reparenting
* that may occur.
*
* @author Frank Mitchell
* @see NativeJavaMethod
* @see NativeJavaPackage
* @see NativeJavaClass
*/
public class NativeJavaConstructor extends BaseFunction
{
static final long serialVersionUID = -8149253217482668463L;
MemberBox ctor;
public NativeJavaConstructor(MemberBox ctor)
{
this.ctor = ctor;
}
@Override
public Object call(Context cx, Scriptable scope, Scriptable thisObj,
Object[] args)
{
return NativeJavaClass.constructSpecific(cx, scope, args, ctor);
}
@Override
public String getFunctionName()
{
String sig = JavaMembers.liveConnectSignature(ctor.argTypes);
return "".concat(sig);
}
@Override
public String toString()
{
return "[JavaConstructor " + ctor.getName() + "]";
}
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/TokenStream.java 0000644 0001750 0001750 00000157041 11321335670 026031 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Roger Lawrence
* Mike McCabe
* Igor Bukanov
* Ethan Hugg
* Bob Jervis
* Terry Lucas
* Milen Nankov
* Steve Yegge
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript;
import java.io.*;
/**
* This class implements the JavaScript scanner.
*
* It is based on the C source files jsscan.c and jsscan.h
* in the jsref package.
*
* @see org.mozilla.javascript.Parser
*
* @author Mike McCabe
* @author Brendan Eich
*/
class TokenStream
{
/*
* For chars - because we need something out-of-range
* to check. (And checking EOF by exception is annoying.)
* Note distinction from EOF token type!
*/
private final static int
EOF_CHAR = -1;
private final static char BYTE_ORDER_MARK = '\uFEFF';
TokenStream(Parser parser, Reader sourceReader, String sourceString,
int lineno)
{
this.parser = parser;
this.lineno = lineno;
if (sourceReader != null) {
if (sourceString != null) Kit.codeBug();
this.sourceReader = sourceReader;
this.sourceBuffer = new char[512];
this.sourceEnd = 0;
} else {
if (sourceString == null) Kit.codeBug();
this.sourceString = sourceString;
this.sourceEnd = sourceString.length();
}
this.sourceCursor = this.cursor = 0;
}
/* This function uses the cached op, string and number fields in
* TokenStream; if getToken has been called since the passed token
* was scanned, the op or string printed may be incorrect.
*/
String tokenToString(int token)
{
if (Token.printTrees) {
String name = Token.name(token);
switch (token) {
case Token.STRING:
case Token.REGEXP:
case Token.NAME:
return name + " `" + this.string + "'";
case Token.NUMBER:
return "NUMBER " + this.number;
}
return name;
}
return "";
}
static boolean isKeyword(String s)
{
return Token.EOF != stringToKeyword(s);
}
private static int stringToKeyword(String name)
{
// #string_id_map#
// The following assumes that Token.EOF == 0
final int
Id_break = Token.BREAK,
Id_case = Token.CASE,
Id_continue = Token.CONTINUE,
Id_default = Token.DEFAULT,
Id_delete = Token.DELPROP,
Id_do = Token.DO,
Id_else = Token.ELSE,
Id_export = Token.RESERVED,
Id_false = Token.FALSE,
Id_for = Token.FOR,
Id_function = Token.FUNCTION,
Id_if = Token.IF,
Id_in = Token.IN,
Id_let = Token.LET,
Id_new = Token.NEW,
Id_null = Token.NULL,
Id_return = Token.RETURN,
Id_switch = Token.SWITCH,
Id_this = Token.THIS,
Id_true = Token.TRUE,
Id_typeof = Token.TYPEOF,
Id_var = Token.VAR,
Id_void = Token.VOID,
Id_while = Token.WHILE,
Id_with = Token.WITH,
Id_yield = Token.YIELD,
// the following are #ifdef RESERVE_JAVA_KEYWORDS in jsscan.c
Id_abstract = Token.RESERVED,
Id_boolean = Token.RESERVED,
Id_byte = Token.RESERVED,
Id_catch = Token.CATCH,
Id_char = Token.RESERVED,
Id_class = Token.RESERVED,
Id_const = Token.CONST,
Id_debugger = Token.DEBUGGER,
Id_double = Token.RESERVED,
Id_enum = Token.RESERVED,
Id_extends = Token.RESERVED,
Id_final = Token.RESERVED,
Id_finally = Token.FINALLY,
Id_float = Token.RESERVED,
Id_goto = Token.RESERVED,
Id_implements = Token.RESERVED,
Id_import = Token.RESERVED,
Id_instanceof = Token.INSTANCEOF,
Id_int = Token.RESERVED,
Id_interface = Token.RESERVED,
Id_long = Token.RESERVED,
Id_native = Token.RESERVED,
Id_package = Token.RESERVED,
Id_private = Token.RESERVED,
Id_protected = Token.RESERVED,
Id_public = Token.RESERVED,
Id_short = Token.RESERVED,
Id_static = Token.RESERVED,
Id_super = Token.RESERVED,
Id_synchronized = Token.RESERVED,
Id_throw = Token.THROW,
Id_throws = Token.RESERVED,
Id_transient = Token.RESERVED,
Id_try = Token.TRY,
Id_volatile = Token.RESERVED;
int id;
String s = name;
// #generated# Last update: 2007-04-18 13:53:30 PDT
L0: { id = 0; String X = null; int c;
L: switch (s.length()) {
case 2: c=s.charAt(1);
if (c=='f') { if (s.charAt(0)=='i') {id=Id_if; break L0;} }
else if (c=='n') { if (s.charAt(0)=='i') {id=Id_in; break L0;} }
else if (c=='o') { if (s.charAt(0)=='d') {id=Id_do; break L0;} }
break L;
case 3: switch (s.charAt(0)) {
case 'f': if (s.charAt(2)=='r' && s.charAt(1)=='o') {id=Id_for; break L0;} break L;
case 'i': if (s.charAt(2)=='t' && s.charAt(1)=='n') {id=Id_int; break L0;} break L;
case 'l': if (s.charAt(2)=='t' && s.charAt(1)=='e') {id=Id_let; break L0;} break L;
case 'n': if (s.charAt(2)=='w' && s.charAt(1)=='e') {id=Id_new; break L0;} break L;
case 't': if (s.charAt(2)=='y' && s.charAt(1)=='r') {id=Id_try; break L0;} break L;
case 'v': if (s.charAt(2)=='r' && s.charAt(1)=='a') {id=Id_var; break L0;} break L;
} break L;
case 4: switch (s.charAt(0)) {
case 'b': X="byte";id=Id_byte; break L;
case 'c': c=s.charAt(3);
if (c=='e') { if (s.charAt(2)=='s' && s.charAt(1)=='a') {id=Id_case; break L0;} }
else if (c=='r') { if (s.charAt(2)=='a' && s.charAt(1)=='h') {id=Id_char; break L0;} }
break L;
case 'e': c=s.charAt(3);
if (c=='e') { if (s.charAt(2)=='s' && s.charAt(1)=='l') {id=Id_else; break L0;} }
else if (c=='m') { if (s.charAt(2)=='u' && s.charAt(1)=='n') {id=Id_enum; break L0;} }
break L;
case 'g': X="goto";id=Id_goto; break L;
case 'l': X="long";id=Id_long; break L;
case 'n': X="null";id=Id_null; break L;
case 't': c=s.charAt(3);
if (c=='e') { if (s.charAt(2)=='u' && s.charAt(1)=='r') {id=Id_true; break L0;} }
else if (c=='s') { if (s.charAt(2)=='i' && s.charAt(1)=='h') {id=Id_this; break L0;} }
break L;
case 'v': X="void";id=Id_void; break L;
case 'w': X="with";id=Id_with; break L;
} break L;
case 5: switch (s.charAt(2)) {
case 'a': X="class";id=Id_class; break L;
case 'e': c=s.charAt(0);
if (c=='b') { X="break";id=Id_break; }
else if (c=='y') { X="yield";id=Id_yield; }
break L;
case 'i': X="while";id=Id_while; break L;
case 'l': X="false";id=Id_false; break L;
case 'n': c=s.charAt(0);
if (c=='c') { X="const";id=Id_const; }
else if (c=='f') { X="final";id=Id_final; }
break L;
case 'o': c=s.charAt(0);
if (c=='f') { X="float";id=Id_float; }
else if (c=='s') { X="short";id=Id_short; }
break L;
case 'p': X="super";id=Id_super; break L;
case 'r': X="throw";id=Id_throw; break L;
case 't': X="catch";id=Id_catch; break L;
} break L;
case 6: switch (s.charAt(1)) {
case 'a': X="native";id=Id_native; break L;
case 'e': c=s.charAt(0);
if (c=='d') { X="delete";id=Id_delete; }
else if (c=='r') { X="return";id=Id_return; }
break L;
case 'h': X="throws";id=Id_throws; break L;
case 'm': X="import";id=Id_import; break L;
case 'o': X="double";id=Id_double; break L;
case 't': X="static";id=Id_static; break L;
case 'u': X="public";id=Id_public; break L;
case 'w': X="switch";id=Id_switch; break L;
case 'x': X="export";id=Id_export; break L;
case 'y': X="typeof";id=Id_typeof; break L;
} break L;
case 7: switch (s.charAt(1)) {
case 'a': X="package";id=Id_package; break L;
case 'e': X="default";id=Id_default; break L;
case 'i': X="finally";id=Id_finally; break L;
case 'o': X="boolean";id=Id_boolean; break L;
case 'r': X="private";id=Id_private; break L;
case 'x': X="extends";id=Id_extends; break L;
} break L;
case 8: switch (s.charAt(0)) {
case 'a': X="abstract";id=Id_abstract; break L;
case 'c': X="continue";id=Id_continue; break L;
case 'd': X="debugger";id=Id_debugger; break L;
case 'f': X="function";id=Id_function; break L;
case 'v': X="volatile";id=Id_volatile; break L;
} break L;
case 9: c=s.charAt(0);
if (c=='i') { X="interface";id=Id_interface; }
else if (c=='p') { X="protected";id=Id_protected; }
else if (c=='t') { X="transient";id=Id_transient; }
break L;
case 10: c=s.charAt(1);
if (c=='m') { X="implements";id=Id_implements; }
else if (c=='n') { X="instanceof";id=Id_instanceof; }
break L;
case 12: X="synchronized";id=Id_synchronized; break L;
}
if (X!=null && X!=s && !X.equals(s)) id = 0;
}
// #/generated#
// #/string_id_map#
if (id == 0) { return Token.EOF; }
return id & 0xff;
}
final String getSourceString() { return sourceString; }
final int getLineno() { return lineno; }
final String getString() { return string; }
final char getQuoteChar() {
return (char) quoteChar;
}
final double getNumber() { return number; }
final boolean isNumberOctal() { return isOctal; }
final boolean eof() { return hitEOF; }
final int getToken() throws IOException
{
int c;
retry:
for (;;) {
// Eat whitespace, possibly sensitive to newlines.
for (;;) {
c = getChar();
if (c == EOF_CHAR) {
tokenBeg = cursor - 1;
tokenEnd = cursor;
return Token.EOF;
} else if (c == '\n') {
dirtyLine = false;
tokenBeg = cursor - 1;
tokenEnd = cursor;
return Token.EOL;
} else if (!isJSSpace(c)) {
if (c != '-') {
dirtyLine = true;
}
break;
}
}
// Assume the token will be 1 char - fixed up below.
tokenBeg = cursor - 1;
tokenEnd = cursor;
if (c == '@') return Token.XMLATTR;
// identifier/keyword/instanceof?
// watch out for starting with a
boolean identifierStart;
boolean isUnicodeEscapeStart = false;
if (c == '\\') {
c = getChar();
if (c == 'u') {
identifierStart = true;
isUnicodeEscapeStart = true;
stringBufferTop = 0;
} else {
identifierStart = false;
ungetChar(c);
c = '\\';
}
} else {
identifierStart = Character.isJavaIdentifierStart((char)c);
if (identifierStart) {
stringBufferTop = 0;
addToString(c);
}
}
if (identifierStart) {
boolean containsEscape = isUnicodeEscapeStart;
for (;;) {
if (isUnicodeEscapeStart) {
// strictly speaking we should probably push-back
// all the bad characters if the uXXXX
// sequence is malformed. But since there isn't a
// correct context(is there?) for a bad Unicode
// escape sequence in an identifier, we can report
// an error here.
int escapeVal = 0;
for (int i = 0; i != 4; ++i) {
c = getChar();
escapeVal = Kit.xDigitToInt(c, escapeVal);
// Next check takes care about c < 0 and bad escape
if (escapeVal < 0) { break; }
}
if (escapeVal < 0) {
parser.addError("msg.invalid.escape");
return Token.ERROR;
}
addToString(escapeVal);
isUnicodeEscapeStart = false;
} else {
c = getChar();
if (c == '\\') {
c = getChar();
if (c == 'u') {
isUnicodeEscapeStart = true;
containsEscape = true;
} else {
parser.addError("msg.illegal.character");
return Token.ERROR;
}
} else {
if (c == EOF_CHAR || c == BYTE_ORDER_MARK
|| !Character.isJavaIdentifierPart((char)c))
{
break;
}
addToString(c);
}
}
}
ungetChar(c);
String str = getStringFromBuffer();
if (!containsEscape) {
// OPT we shouldn't have to make a string (object!) to
// check if it's a keyword.
// Return the corresponding token if it's a keyword
int result = stringToKeyword(str);
if (result != Token.EOF) {
if ((result == Token.LET || result == Token.YIELD) &&
parser.compilerEnv.getLanguageVersion()
< Context.VERSION_1_7)
{
// LET and YIELD are tokens only in 1.7 and later
string = result == Token.LET ? "let" : "yield";
result = Token.NAME;
}
if (result != Token.RESERVED) {
return result;
} else if (!parser.compilerEnv.
isReservedKeywordAsIdentifier())
{
return result;
}
}
}
this.string = (String)allStrings.intern(str);
return Token.NAME;
}
// is it a number?
if (isDigit(c) || (c == '.' && isDigit(peekChar()))) {
isOctal = false;
stringBufferTop = 0;
int base = 10;
if (c == '0') {
c = getChar();
if (c == 'x' || c == 'X') {
base = 16;
c = getChar();
} else if (isDigit(c)) {
base = 8;
isOctal = true;
} else {
addToString('0');
}
}
if (base == 16) {
while (0 <= Kit.xDigitToInt(c, 0)) {
addToString(c);
c = getChar();
}
} else {
while ('0' <= c && c <= '9') {
/*
* We permit 08 and 09 as decimal numbers, which
* makes our behavior a superset of the ECMA
* numeric grammar. We might not always be so
* permissive, so we warn about it.
*/
if (base == 8 && c >= '8') {
parser.addWarning("msg.bad.octal.literal",
c == '8' ? "8" : "9");
base = 10;
}
addToString(c);
c = getChar();
}
}
boolean isInteger = true;
if (base == 10 && (c == '.' || c == 'e' || c == 'E')) {
isInteger = false;
if (c == '.') {
do {
addToString(c);
c = getChar();
} while (isDigit(c));
}
if (c == 'e' || c == 'E') {
addToString(c);
c = getChar();
if (c == '+' || c == '-') {
addToString(c);
c = getChar();
}
if (!isDigit(c)) {
parser.addError("msg.missing.exponent");
return Token.ERROR;
}
do {
addToString(c);
c = getChar();
} while (isDigit(c));
}
}
ungetChar(c);
String numString = getStringFromBuffer();
this.string = numString;
double dval;
if (base == 10 && !isInteger) {
try {
// Use Java conversion to number from string...
dval = Double.valueOf(numString).doubleValue();
}
catch (NumberFormatException ex) {
parser.addError("msg.caught.nfe");
return Token.ERROR;
}
} else {
dval = ScriptRuntime.stringToNumber(numString, 0, base);
}
this.number = dval;
return Token.NUMBER;
}
// is it a string?
if (c == '"' || c == '\'') {
// We attempt to accumulate a string the fast way, by
// building it directly out of the reader. But if there
// are any escaped characters in the string, we revert to
// building it out of a StringBuffer.
quoteChar = c;
stringBufferTop = 0;
c = getChar();
strLoop: while (c != quoteChar) {
if (c == '\n' || c == EOF_CHAR) {
ungetChar(c);
tokenEnd = cursor;
parser.addError("msg.unterminated.string.lit");
return Token.ERROR;
}
if (c == '\\') {
// We've hit an escaped character
int escapeVal;
c = getChar();
switch (c) {
case 'b': c = '\b'; break;
case 'f': c = '\f'; break;
case 'n': c = '\n'; break;
case 'r': c = '\r'; break;
case 't': c = '\t'; break;
// \v a late addition to the ECMA spec,
// it is not in Java, so use 0xb
case 'v': c = 0xb; break;
case 'u':
// Get 4 hex digits; if the u escape is not
// followed by 4 hex digits, use 'u' + the
// literal character sequence that follows.
int escapeStart = stringBufferTop;
addToString('u');
escapeVal = 0;
for (int i = 0; i != 4; ++i) {
c = getChar();
escapeVal = Kit.xDigitToInt(c, escapeVal);
if (escapeVal < 0) {
continue strLoop;
}
addToString(c);
}
// prepare for replace of stored 'u' sequence
// by escape value
stringBufferTop = escapeStart;
c = escapeVal;
break;
case 'x':
// Get 2 hex digits, defaulting to 'x'+literal
// sequence, as above.
c = getChar();
escapeVal = Kit.xDigitToInt(c, 0);
if (escapeVal < 0) {
addToString('x');
continue strLoop;
} else {
int c1 = c;
c = getChar();
escapeVal = Kit.xDigitToInt(c, escapeVal);
if (escapeVal < 0) {
addToString('x');
addToString(c1);
continue strLoop;
} else {
// got 2 hex digits
c = escapeVal;
}
}
break;
case '\n':
// Remove line terminator after escape to follow
// SpiderMonkey and C/C++
c = getChar();
continue strLoop;
default:
if ('0' <= c && c < '8') {
int val = c - '0';
c = getChar();
if ('0' <= c && c < '8') {
val = 8 * val + c - '0';
c = getChar();
if ('0' <= c && c < '8' && val <= 037) {
// c is 3rd char of octal sequence only
// if the resulting val <= 0377
val = 8 * val + c - '0';
c = getChar();
}
}
ungetChar(c);
c = val;
}
}
}
addToString(c);
c = getChar();
}
String str = getStringFromBuffer();
this.string = (String)allStrings.intern(str);
return Token.STRING;
}
switch (c) {
case ';': return Token.SEMI;
case '[': return Token.LB;
case ']': return Token.RB;
case '{': return Token.LC;
case '}': return Token.RC;
case '(': return Token.LP;
case ')': return Token.RP;
case ',': return Token.COMMA;
case '?': return Token.HOOK;
case ':':
if (matchChar(':')) {
return Token.COLONCOLON;
} else {
return Token.COLON;
}
case '.':
if (matchChar('.')) {
return Token.DOTDOT;
} else if (matchChar('(')) {
return Token.DOTQUERY;
} else {
return Token.DOT;
}
case '|':
if (matchChar('|')) {
return Token.OR;
} else if (matchChar('=')) {
return Token.ASSIGN_BITOR;
} else {
return Token.BITOR;
}
case '^':
if (matchChar('=')) {
return Token.ASSIGN_BITXOR;
} else {
return Token.BITXOR;
}
case '&':
if (matchChar('&')) {
return Token.AND;
} else if (matchChar('=')) {
return Token.ASSIGN_BITAND;
} else {
return Token.BITAND;
}
case '=':
if (matchChar('=')) {
if (matchChar('=')) {
return Token.SHEQ;
} else {
return Token.EQ;
}
} else {
return Token.ASSIGN;
}
case '!':
if (matchChar('=')) {
if (matchChar('=')) {
return Token.SHNE;
} else {
return Token.NE;
}
} else {
return Token.NOT;
}
case '<':
/* NB:treat HTML begin-comment as comment-till-eol */
if (matchChar('!')) {
if (matchChar('-')) {
if (matchChar('-')) {
skipLine();
continue retry;
}
ungetCharIgnoreLineEnd('-');
}
ungetCharIgnoreLineEnd('!');
}
if (matchChar('<')) {
if (matchChar('=')) {
return Token.ASSIGN_LSH;
} else {
return Token.LSH;
}
} else {
if (matchChar('=')) {
return Token.LE;
} else {
return Token.LT;
}
}
case '>':
if (matchChar('>')) {
if (matchChar('>')) {
if (matchChar('=')) {
return Token.ASSIGN_URSH;
} else {
return Token.URSH;
}
} else {
if (matchChar('=')) {
return Token.ASSIGN_RSH;
} else {
return Token.RSH;
}
}
} else {
if (matchChar('=')) {
return Token.GE;
} else {
return Token.GT;
}
}
case '*':
if (matchChar('=')) {
return Token.ASSIGN_MUL;
} else {
return Token.MUL;
}
case '/':
markCommentStart();
// is it a // comment?
if (matchChar('/')) {
tokenBeg = cursor - 2;
skipLine();
commentType = Token.CommentType.LINE;
return Token.COMMENT;
}
// is it a /* or /** comment?
if (matchChar('*')) {
boolean lookForSlash = false;
tokenBeg = cursor - 2;
if (matchChar('*')) {
lookForSlash = true;
commentType = Token.CommentType.JSDOC;
} else {
commentType = Token.CommentType.BLOCK_COMMENT;
}
for (;;) {
c = getChar();
if (c == EOF_CHAR) {
tokenEnd = cursor - 1;
parser.addError("msg.unterminated.comment");
return Token.COMMENT;
} else if (c == '*') {
lookForSlash = true;
} else if (c == '/') {
if (lookForSlash) {
tokenEnd = cursor;
return Token.COMMENT;
}
} else {
lookForSlash = false;
tokenEnd = cursor;
}
}
}
if (matchChar('=')) {
return Token.ASSIGN_DIV;
} else {
return Token.DIV;
}
case '%':
if (matchChar('=')) {
return Token.ASSIGN_MOD;
} else {
return Token.MOD;
}
case '~':
return Token.BITNOT;
case '+':
if (matchChar('=')) {
return Token.ASSIGN_ADD;
} else if (matchChar('+')) {
return Token.INC;
} else {
return Token.ADD;
}
case '-':
if (matchChar('=')) {
c = Token.ASSIGN_SUB;
} else if (matchChar('-')) {
if (!dirtyLine) {
// treat HTML end-comment after possible whitespace
// after line start as comment-until-eol
if (matchChar('>')) {
markCommentStart("--");
skipLine();
commentType = Token.CommentType.HTML;
return Token.COMMENT;
}
}
c = Token.DEC;
} else {
c = Token.SUB;
}
dirtyLine = true;
return c;
default:
parser.addError("msg.illegal.character");
return Token.ERROR;
}
}
}
private static boolean isAlpha(int c)
{
// Use 'Z' < 'a'
if (c <= 'Z') {
return 'A' <= c;
} else {
return 'a' <= c && c <= 'z';
}
}
static boolean isDigit(int c)
{
return '0' <= c && c <= '9';
}
/* As defined in ECMA. jsscan.c uses C isspace() (which allows
* \v, I think.) note that code in getChar() implicitly accepts
* '\r' == \u000D as well.
*/
static boolean isJSSpace(int c)
{
if (c <= 127) {
return c == 0x20 || c == 0x9 || c == 0xC || c == 0xB;
} else {
return c == 0xA0 || c == BYTE_ORDER_MARK
|| Character.getType((char)c) == Character.SPACE_SEPARATOR;
}
}
private static boolean isJSFormatChar(int c)
{
return c > 127 && Character.getType((char)c) == Character.FORMAT;
}
/**
* Parser calls the method when it gets / or /= in literal context.
*/
void readRegExp(int startToken)
throws IOException
{
int start = tokenBeg;
stringBufferTop = 0;
if (startToken == Token.ASSIGN_DIV) {
// Miss-scanned /=
addToString('=');
} else {
if (startToken != Token.DIV) Kit.codeBug();
}
boolean inCharSet = false; // true if inside a '['..']' pair
int c;
while ((c = getChar()) != '/' || inCharSet) {
if (c == '\n' || c == EOF_CHAR) {
ungetChar(c);
tokenEnd = cursor - 1;
this.string = new String(stringBuffer, 0, stringBufferTop);
parser.reportError("msg.unterminated.re.lit");
return;
}
if (c == '\\') {
addToString(c);
c = getChar();
} else if (c == '[') {
inCharSet = true;
} else if (c == ']') {
inCharSet = false;
}
addToString(c);
}
int reEnd = stringBufferTop;
while (true) {
if (matchChar('g'))
addToString('g');
else if (matchChar('i'))
addToString('i');
else if (matchChar('m'))
addToString('m');
else if (matchChar('y')) // FireFox 3
addToString('y');
else
break;
}
tokenEnd = start + stringBufferTop + 2; // include slashes
if (isAlpha(peekChar())) {
parser.reportError("msg.invalid.re.flag");
}
this.string = new String(stringBuffer, 0, reEnd);
this.regExpFlags = new String(stringBuffer, reEnd,
stringBufferTop - reEnd);
}
String readAndClearRegExpFlags() {
String flags = this.regExpFlags;
this.regExpFlags = null;
return flags;
}
boolean isXMLAttribute()
{
return xmlIsAttribute;
}
int getFirstXMLToken() throws IOException
{
xmlOpenTagsCount = 0;
xmlIsAttribute = false;
xmlIsTagContent = false;
if (!canUngetChar())
return Token.ERROR;
ungetChar('<');
return getNextXMLToken();
}
int getNextXMLToken() throws IOException
{
tokenBeg = cursor;
stringBufferTop = 0; // remember the XML
for (int c = getChar(); c != EOF_CHAR; c = getChar()) {
if (xmlIsTagContent) {
switch (c) {
case '>':
addToString(c);
xmlIsTagContent = false;
xmlIsAttribute = false;
break;
case '/':
addToString(c);
if (peekChar() == '>') {
c = getChar();
addToString(c);
xmlIsTagContent = false;
xmlOpenTagsCount--;
}
break;
case '{':
ungetChar(c);
this.string = getStringFromBuffer();
return Token.XML;
case '\'':
case '"':
addToString(c);
if (!readQuotedString(c)) return Token.ERROR;
break;
case '=':
addToString(c);
xmlIsAttribute = true;
break;
case ' ':
case '\t':
case '\r':
case '\n':
addToString(c);
break;
default:
addToString(c);
xmlIsAttribute = false;
break;
}
if (!xmlIsTagContent && xmlOpenTagsCount == 0) {
this.string = getStringFromBuffer();
return Token.XMLEND;
}
} else {
switch (c) {
case '<':
addToString(c);
c = peekChar();
switch (c) {
case '!':
c = getChar(); // Skip !
addToString(c);
c = peekChar();
switch (c) {
case '-':
c = getChar(); // Skip -
addToString(c);
c = getChar();
if (c == '-') {
addToString(c);
if(!readXmlComment()) return Token.ERROR;
} else {
// throw away the string in progress
stringBufferTop = 0;
this.string = null;
parser.addError("msg.XML.bad.form");
return Token.ERROR;
}
break;
case '[':
c = getChar(); // Skip [
addToString(c);
if (getChar() == 'C' &&
getChar() == 'D' &&
getChar() == 'A' &&
getChar() == 'T' &&
getChar() == 'A' &&
getChar() == '[')
{
addToString('C');
addToString('D');
addToString('A');
addToString('T');
addToString('A');
addToString('[');
if (!readCDATA()) return Token.ERROR;
} else {
// throw away the string in progress
stringBufferTop = 0;
this.string = null;
parser.addError("msg.XML.bad.form");
return Token.ERROR;
}
break;
default:
if(!readEntity()) return Token.ERROR;
break;
}
break;
case '?':
c = getChar(); // Skip ?
addToString(c);
if (!readPI()) return Token.ERROR;
break;
case '/':
// End tag
c = getChar(); // Skip /
addToString(c);
if (xmlOpenTagsCount == 0) {
// throw away the string in progress
stringBufferTop = 0;
this.string = null;
parser.addError("msg.XML.bad.form");
return Token.ERROR;
}
xmlIsTagContent = true;
xmlOpenTagsCount--;
break;
default:
// Start tag
xmlIsTagContent = true;
xmlOpenTagsCount++;
break;
}
break;
case '{':
ungetChar(c);
this.string = getStringFromBuffer();
return Token.XML;
default:
addToString(c);
break;
}
}
}
tokenEnd = cursor;
stringBufferTop = 0; // throw away the string in progress
this.string = null;
parser.addError("msg.XML.bad.form");
return Token.ERROR;
}
/**
*
*/
private boolean readQuotedString(int quote) throws IOException
{
for (int c = getChar(); c != EOF_CHAR; c = getChar()) {
addToString(c);
if (c == quote) return true;
}
stringBufferTop = 0; // throw away the string in progress
this.string = null;
parser.addError("msg.XML.bad.form");
return false;
}
/**
*
*/
private boolean readXmlComment() throws IOException
{
for (int c = getChar(); c != EOF_CHAR;) {
addToString(c);
if (c == '-' && peekChar() == '-') {
c = getChar();
addToString(c);
if (peekChar() == '>') {
c = getChar(); // Skip >
addToString(c);
return true;
} else {
continue;
}
}
c = getChar();
}
stringBufferTop = 0; // throw away the string in progress
this.string = null;
parser.addError("msg.XML.bad.form");
return false;
}
/**
*
*/
private boolean readCDATA() throws IOException
{
for (int c = getChar(); c != EOF_CHAR;) {
addToString(c);
if (c == ']' && peekChar() == ']') {
c = getChar();
addToString(c);
if (peekChar() == '>') {
c = getChar(); // Skip >
addToString(c);
return true;
} else {
continue;
}
}
c = getChar();
}
stringBufferTop = 0; // throw away the string in progress
this.string = null;
parser.addError("msg.XML.bad.form");
return false;
}
/**
*
*/
private boolean readEntity() throws IOException
{
int declTags = 1;
for (int c = getChar(); c != EOF_CHAR; c = getChar()) {
addToString(c);
switch (c) {
case '<':
declTags++;
break;
case '>':
declTags--;
if (declTags == 0) return true;
break;
}
}
stringBufferTop = 0; // throw away the string in progress
this.string = null;
parser.addError("msg.XML.bad.form");
return false;
}
/**
*
*/
private boolean readPI() throws IOException
{
for (int c = getChar(); c != EOF_CHAR; c = getChar()) {
addToString(c);
if (c == '?' && peekChar() == '>') {
c = getChar(); // Skip >
addToString(c);
return true;
}
}
stringBufferTop = 0; // throw away the string in progress
this.string = null;
parser.addError("msg.XML.bad.form");
return false;
}
private String getStringFromBuffer()
{
tokenEnd = cursor;
return new String(stringBuffer, 0, stringBufferTop);
}
private void addToString(int c)
{
int N = stringBufferTop;
if (N == stringBuffer.length) {
char[] tmp = new char[stringBuffer.length * 2];
System.arraycopy(stringBuffer, 0, tmp, 0, N);
stringBuffer = tmp;
}
stringBuffer[N] = (char)c;
stringBufferTop = N + 1;
}
private boolean canUngetChar() {
return ungetCursor == 0 || ungetBuffer[ungetCursor - 1] != '\n';
}
private void ungetChar(int c)
{
// can not unread past across line boundary
if (ungetCursor != 0 && ungetBuffer[ungetCursor - 1] == '\n')
Kit.codeBug();
ungetBuffer[ungetCursor++] = c;
cursor--;
}
private boolean matchChar(int test) throws IOException
{
int c = getCharIgnoreLineEnd();
if (c == test) {
tokenEnd = cursor;
return true;
} else {
ungetCharIgnoreLineEnd(c);
return false;
}
}
private int peekChar() throws IOException
{
int c = getChar();
ungetChar(c);
return c;
}
private int getChar() throws IOException
{
if (ungetCursor != 0) {
cursor++;
return ungetBuffer[--ungetCursor];
}
for(;;) {
int c;
if (sourceString != null) {
if (sourceCursor == sourceEnd) {
hitEOF = true;
return EOF_CHAR;
}
cursor++;
c = sourceString.charAt(sourceCursor++);
} else {
if (sourceCursor == sourceEnd) {
if (!fillSourceBuffer()) {
hitEOF = true;
return EOF_CHAR;
}
}
cursor++;
c = sourceBuffer[sourceCursor++];
}
if (lineEndChar >= 0) {
if (lineEndChar == '\r' && c == '\n') {
lineEndChar = '\n';
continue;
}
lineEndChar = -1;
lineStart = sourceCursor - 1;
lineno++;
}
if (c <= 127) {
if (c == '\n' || c == '\r') {
lineEndChar = c;
c = '\n';
}
} else {
if (c == BYTE_ORDER_MARK) return c; // BOM is considered whitespace
if (isJSFormatChar(c)) {
continue;
}
if (ScriptRuntime.isJSLineTerminator(c)) {
lineEndChar = c;
c = '\n';
}
}
return c;
}
}
private int getCharIgnoreLineEnd() throws IOException
{
if (ungetCursor != 0) {
cursor++;
return ungetBuffer[--ungetCursor];
}
for(;;) {
int c;
if (sourceString != null) {
if (sourceCursor == sourceEnd) {
hitEOF = true;
return EOF_CHAR;
}
cursor++;
c = sourceString.charAt(sourceCursor++);
} else {
if (sourceCursor == sourceEnd) {
if (!fillSourceBuffer()) {
hitEOF = true;
return EOF_CHAR;
}
}
cursor++;
c = sourceBuffer[sourceCursor++];
}
if (c <= 127) {
if (c == '\n' || c == '\r') {
lineEndChar = c;
c = '\n';
}
} else {
if (c == BYTE_ORDER_MARK) return c; // BOM is considered whitespace
if (isJSFormatChar(c)) {
continue;
}
if (ScriptRuntime.isJSLineTerminator(c)) {
lineEndChar = c;
c = '\n';
}
}
return c;
}
}
private void ungetCharIgnoreLineEnd(int c)
{
ungetBuffer[ungetCursor++] = c;
cursor--;
}
private void skipLine() throws IOException
{
// skip to end of line
int c;
while ((c = getChar()) != EOF_CHAR && c != '\n') { }
ungetChar(c);
tokenEnd = cursor;
}
/**
* Returns the offset into the current line.
*/
final int getOffset()
{
int n = sourceCursor - lineStart;
if (lineEndChar >= 0) { --n; }
return n;
}
final String getLine()
{
if (sourceString != null) {
// String case
int lineEnd = sourceCursor;
if (lineEndChar >= 0) {
--lineEnd;
} else {
for (; lineEnd != sourceEnd; ++lineEnd) {
int c = sourceString.charAt(lineEnd);
if (ScriptRuntime.isJSLineTerminator(c)) {
break;
}
}
}
return sourceString.substring(lineStart, lineEnd);
} else {
// Reader case
int lineLength = sourceCursor - lineStart;
if (lineEndChar >= 0) {
--lineLength;
} else {
// Read until the end of line
for (;; ++lineLength) {
int i = lineStart + lineLength;
if (i == sourceEnd) {
try {
if (!fillSourceBuffer()) { break; }
} catch (IOException ioe) {
// ignore it, we're already displaying an error...
break;
}
// i recalculuation as fillSourceBuffer can move saved
// line buffer and change lineStart
i = lineStart + lineLength;
}
int c = sourceBuffer[i];
if (ScriptRuntime.isJSLineTerminator(c)) {
break;
}
}
}
return new String(sourceBuffer, lineStart, lineLength);
}
}
private boolean fillSourceBuffer() throws IOException
{
if (sourceString != null) Kit.codeBug();
if (sourceEnd == sourceBuffer.length) {
if (lineStart != 0 && !isMarkingComment()) {
System.arraycopy(sourceBuffer, lineStart, sourceBuffer, 0,
sourceEnd - lineStart);
sourceEnd -= lineStart;
sourceCursor -= lineStart;
lineStart = 0;
} else {
char[] tmp = new char[sourceBuffer.length * 2];
System.arraycopy(sourceBuffer, 0, tmp, 0, sourceEnd);
sourceBuffer = tmp;
}
}
int n = sourceReader.read(sourceBuffer, sourceEnd,
sourceBuffer.length - sourceEnd);
if (n < 0) {
return false;
}
sourceEnd += n;
return true;
}
/**
* Return the current position of the scanner cursor.
*/
public int getCursor() {
return cursor;
}
/**
* Return the absolute source offset of the last scanned token.
*/
public int getTokenBeg() {
return tokenBeg;
}
/**
* Return the absolute source end-offset of the last scanned token.
*/
public int getTokenEnd() {
return tokenEnd;
}
/**
* Return tokenEnd - tokenBeg
*/
public int getTokenLength() {
return tokenEnd - tokenBeg;
}
/**
* Return the type of the last scanned comment.
* @return type of last scanned comment, or 0 if none have been scanned.
*/
public Token.CommentType getCommentType() {
return commentType;
}
private void markCommentStart() {
markCommentStart("");
}
private void markCommentStart(String prefix) {
if (parser.compilerEnv.isRecordingComments() && sourceReader != null) {
commentPrefix = prefix;
commentCursor = sourceCursor - 1;
}
}
private boolean isMarkingComment() {
return commentCursor != -1;
}
final String getAndResetCurrentComment() {
if (sourceString != null) {
if (isMarkingComment()) Kit.codeBug();
return sourceString.substring(tokenBeg, tokenEnd);
} else {
if (!isMarkingComment()) Kit.codeBug();
StringBuilder comment = new StringBuilder(commentPrefix);
comment.append(sourceBuffer, commentCursor,
getTokenLength() - commentPrefix.length());
commentCursor = -1;
return comment.toString();
}
}
// stuff other than whitespace since start of line
private boolean dirtyLine;
String regExpFlags;
// Set this to an initial non-null value so that the Parser has
// something to retrieve even if an error has occurred and no
// string is found. Fosters one class of error, but saves lots of
// code.
private String string = "";
private double number;
private boolean isOctal;
// delimiter for last string literal scanned
private int quoteChar;
private char[] stringBuffer = new char[128];
private int stringBufferTop;
private ObjToIntMap allStrings = new ObjToIntMap(50);
// Room to backtrace from to < on failed match of the last - in 0 && buf.charAt(bl) == '0') {
// empty
}
buf.setLength(bl + 1);
}
/* Mapping of JSDToStrMode -> JS_dtoa mode */
private static final int dtoaModes[] = {
0, /* DTOSTR_STANDARD */
0, /* DTOSTR_STANDARD_EXPONENTIAL, */
3, /* DTOSTR_FIXED, */
2, /* DTOSTR_EXPONENTIAL, */
2}; /* DTOSTR_PRECISION */
static void
JS_dtostr(StringBuffer buffer, int mode, int precision, double d)
{
int decPt; /* Position of decimal point relative to first digit returned by JS_dtoa */
boolean[] sign = new boolean[1]; /* true if the sign bit was set in d */
int nDigits; /* Number of significand digits returned by JS_dtoa */
// JS_ASSERT(bufferSize >= (size_t)(mode <= DTOSTR_STANDARD_EXPONENTIAL ? DTOSTR_STANDARD_BUFFER_SIZE :
// DTOSTR_VARIABLE_BUFFER_SIZE(precision)));
if (mode == DTOSTR_FIXED && (d >= 1e21 || d <= -1e21))
mode = DTOSTR_STANDARD; /* Change mode here rather than below because the buffer may not be large enough to hold a large integer. */
decPt = JS_dtoa(d, dtoaModes[mode], mode >= DTOSTR_FIXED, precision, sign, buffer);
nDigits = buffer.length();
// Hack to fix Rhino bug 538172: 2.274341322658976E-309 -> F.774341322658976E-309
if (mode == DToA.DTOSTR_STANDARD && buffer.charAt(0) > '9') {
final char c0 = buffer.charAt(0);
final char c1 = buffer.charAt(1);
final int sum = (c0 - 'A' + 10) + (c1 - '0');
buffer.replace(0, 1, Integer.toString(sum));
decPt++;
}
/* If Infinity, -Infinity, or NaN, return the string regardless of the mode. */
if (decPt != 9999) {
boolean exponentialNotation = false;
int minNDigits = 0; /* Minimum number of significand digits required by mode and precision */
int p;
switch (mode) {
case DTOSTR_STANDARD:
if (decPt < -5 || decPt > 21)
exponentialNotation = true;
else
minNDigits = decPt;
break;
case DTOSTR_FIXED:
if (precision >= 0)
minNDigits = decPt + precision;
else
minNDigits = decPt;
break;
case DTOSTR_EXPONENTIAL:
// JS_ASSERT(precision > 0);
minNDigits = precision;
/* Fall through */
case DTOSTR_STANDARD_EXPONENTIAL:
exponentialNotation = true;
break;
case DTOSTR_PRECISION:
// JS_ASSERT(precision > 0);
minNDigits = precision;
if (decPt < -5 || decPt > precision)
exponentialNotation = true;
break;
}
/* If the number has fewer than minNDigits, pad it with zeros at the end */
if (nDigits < minNDigits) {
p = minNDigits;
nDigits = minNDigits;
do {
buffer.append('0');
} while (buffer.length() != p);
}
if (exponentialNotation) {
/* Insert a decimal point if more than one significand digit */
if (nDigits != 1) {
buffer.insert(1, '.');
}
buffer.append('e');
if ((decPt - 1) >= 0)
buffer.append('+');
buffer.append(decPt - 1);
// JS_snprintf(numEnd, bufferSize - (numEnd - buffer), "e%+d", decPt-1);
} else if (decPt != nDigits) {
/* Some kind of a fraction in fixed notation */
// JS_ASSERT(decPt <= nDigits);
if (decPt > 0) {
/* dd...dd . dd...dd */
buffer.insert(decPt, '.');
} else {
/* 0 . 00...00dd...dd */
for (int i = 0; i < 1 - decPt; i++)
buffer.insert(0, '0');
buffer.insert(1, '.');
}
}
}
/* If negative and neither -0.0 nor NaN, output a leading '-'. */
if (sign[0] &&
!(word0(d) == Sign_bit && word1(d) == 0) &&
!((word0(d) & Exp_mask) == Exp_mask &&
((word1(d) != 0) || ((word0(d) & Frac_mask) != 0)))) {
buffer.insert(0, '-');
}
}
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/Node.java 0000644 0001750 0001750 00000120527 11222455466 024467 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
* Roshan James
* Roger Lawrence
* Mike McCabe
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript;
import org.mozilla.javascript.ast.FunctionNode;
import org.mozilla.javascript.ast.Jump;
import org.mozilla.javascript.ast.Name;
import org.mozilla.javascript.ast.NumberLiteral;
import org.mozilla.javascript.ast.Scope;
import org.mozilla.javascript.ast.ScriptNode;
import java.util.Iterator;
import java.util.NoSuchElementException;
/**
* This class implements the root of the intermediate representation.
*
* @author Norris Boyd
* @author Mike McCabe
*/
public class Node implements Iterable
{
public static final int
FUNCTION_PROP = 1,
LOCAL_PROP = 2,
LOCAL_BLOCK_PROP = 3,
REGEXP_PROP = 4,
CASEARRAY_PROP = 5,
// the following properties are defined and manipulated by the
// optimizer -
// TARGETBLOCK_PROP - the block referenced by a branch node
// VARIABLE_PROP - the variable referenced by a BIND or NAME node
// ISNUMBER_PROP - this node generates code on Number children and
// delivers a Number result (as opposed to Objects)
// DIRECTCALL_PROP - this call node should emit code to test the function
// object against the known class and call direct if it
// matches.
TARGETBLOCK_PROP = 6,
VARIABLE_PROP = 7,
ISNUMBER_PROP = 8,
DIRECTCALL_PROP = 9,
SPECIALCALL_PROP = 10,
SKIP_INDEXES_PROP = 11, // array of skipped indexes of array literal
OBJECT_IDS_PROP = 12, // array of properties for object literal
INCRDECR_PROP = 13, // pre or post type of increment/decrement
CATCH_SCOPE_PROP = 14, // index of catch scope block in catch
LABEL_ID_PROP = 15, // label id: code generation uses it
MEMBER_TYPE_PROP = 16, // type of element access operation
NAME_PROP = 17, // property name
CONTROL_BLOCK_PROP = 18, // flags a control block that can drop off
PARENTHESIZED_PROP = 19, // expression is parenthesized
GENERATOR_END_PROP = 20,
DESTRUCTURING_ARRAY_LENGTH = 21,
DESTRUCTURING_NAMES = 22,
DESTRUCTURING_PARAMS = 23,
JSDOC_PROP = 24,
EXPRESSION_CLOSURE_PROP = 25, // JS 1.8 expression closure pseudo-return
DESTRUCTURING_SHORTHAND = 26, // JS 1.8 destructuring shorthand
LAST_PROP = 26;
// values of ISNUMBER_PROP to specify
// which of the children are Number types
public static final int
BOTH = 0,
LEFT = 1,
RIGHT = 2;
public static final int // values for SPECIALCALL_PROP
NON_SPECIALCALL = 0,
SPECIALCALL_EVAL = 1,
SPECIALCALL_WITH = 2;
public static final int // flags for INCRDECR_PROP
DECR_FLAG = 0x1,
POST_FLAG = 0x2;
public static final int // flags for MEMBER_TYPE_PROP
PROPERTY_FLAG = 0x1, // property access: element is valid name
ATTRIBUTE_FLAG = 0x2, // x.@y or x..@y
DESCENDANTS_FLAG = 0x4; // x..y or x..@i
private static class PropListItem
{
PropListItem next;
int type;
int intValue;
Object objectValue;
}
public Node(int nodeType) {
type = nodeType;
}
public Node(int nodeType, Node child) {
type = nodeType;
first = last = child;
child.next = null;
}
public Node(int nodeType, Node left, Node right) {
type = nodeType;
first = left;
last = right;
left.next = right;
right.next = null;
}
public Node(int nodeType, Node left, Node mid, Node right) {
type = nodeType;
first = left;
last = right;
left.next = mid;
mid.next = right;
right.next = null;
}
public Node(int nodeType, int line) {
type = nodeType;
lineno = line;
}
public Node(int nodeType, Node child, int line) {
this(nodeType, child);
lineno = line;
}
public Node(int nodeType, Node left, Node right, int line) {
this(nodeType, left, right);
lineno = line;
}
public Node(int nodeType, Node left, Node mid, Node right, int line) {
this(nodeType, left, mid, right);
lineno = line;
}
public static Node newNumber(double number) {
NumberLiteral n = new NumberLiteral();
n.setNumber(number);
return n;
}
public static Node newString(String str) {
return newString(Token.STRING, str);
}
public static Node newString(int type, String str) {
Name name = new Name();
name.setIdentifier(str);
name.setType(type);
return name;
}
public int getType() {
return type;
}
/**
* Sets the node type and returns this node.
*/
public Node setType(int type) {
this.type = type;
return this;
}
/**
* Gets the JsDoc comment string attached to this node.
* @return the comment string or {@code null} if no JsDoc is attached to
* this node
*/
public String getJsDoc() {
return (String) getProp(JSDOC_PROP);
}
/**
* Sets the JsDoc comment string attached to this node.
*/
public void setJsDoc(String jsdoc) {
putProp(JSDOC_PROP, jsdoc);
}
public boolean hasChildren() {
return first != null;
}
public Node getFirstChild() {
return first;
}
public Node getLastChild() {
return last;
}
public Node getNext() {
return next;
}
public Node getChildBefore(Node child) {
if (child == first)
return null;
Node n = first;
while (n.next != child) {
n = n.next;
if (n == null)
throw new RuntimeException("node is not a child");
}
return n;
}
public Node getLastSibling() {
Node n = this;
while (n.next != null) {
n = n.next;
}
return n;
}
public void addChildToFront(Node child) {
child.next = first;
first = child;
if (last == null) {
last = child;
}
}
public void addChildToBack(Node child) {
child.next = null;
if (last == null) {
first = last = child;
return;
}
last.next = child;
last = child;
}
public void addChildrenToFront(Node children) {
Node lastSib = children.getLastSibling();
lastSib.next = first;
first = children;
if (last == null) {
last = lastSib;
}
}
public void addChildrenToBack(Node children) {
if (last != null) {
last.next = children;
}
last = children.getLastSibling();
if (first == null) {
first = children;
}
}
/**
* Add 'child' before 'node'.
*/
public void addChildBefore(Node newChild, Node node) {
if (newChild.next != null)
throw new RuntimeException(
"newChild had siblings in addChildBefore");
if (first == node) {
newChild.next = first;
first = newChild;
return;
}
Node prev = getChildBefore(node);
addChildAfter(newChild, prev);
}
/**
* Add 'child' after 'node'.
*/
public void addChildAfter(Node newChild, Node node) {
if (newChild.next != null)
throw new RuntimeException(
"newChild had siblings in addChildAfter");
newChild.next = node.next;
node.next = newChild;
if (last == node)
last = newChild;
}
public void removeChild(Node child) {
Node prev = getChildBefore(child);
if (prev == null)
first = first.next;
else
prev.next = child.next;
if (child == last) last = prev;
child.next = null;
}
public void replaceChild(Node child, Node newChild) {
newChild.next = child.next;
if (child == first) {
first = newChild;
} else {
Node prev = getChildBefore(child);
prev.next = newChild;
}
if (child == last)
last = newChild;
child.next = null;
}
public void replaceChildAfter(Node prevChild, Node newChild) {
Node child = prevChild.next;
newChild.next = child.next;
prevChild.next = newChild;
if (child == last)
last = newChild;
child.next = null;
}
public void removeChildren() {
first = last = null;
}
private static final Node NOT_SET = new Node(Token.ERROR);
/**
* Iterates over the children of this Node. Supports child removal. Not
* thread-safe. If anyone changes the child list before the iterator
* finishes, the results are undefined and probably bad.
*/
public class NodeIterator implements Iterator {
private Node cursor; // points to node to be returned next
private Node prev = NOT_SET;
private Node prev2;
private boolean removed = false;
public NodeIterator() {
cursor = Node.this.first;
}
public boolean hasNext() {
return cursor != null;
}
public Node next() {
if (cursor == null) {
throw new NoSuchElementException();
}
removed = false;
prev2 = prev;
prev = cursor;
cursor = cursor.next;
return prev;
}
public void remove() {
if (prev == NOT_SET) {
throw new IllegalStateException("next() has not been called");
}
if (removed) {
throw new IllegalStateException(
"remove() already called for current element");
}
if (prev == first) {
first = prev.next;
} else if (prev == last) {
prev2.next = null;
last = prev2;
} else {
prev2.next = cursor;
}
}
}
/**
* Returns an {@link java.util.Iterator} over the node's children.
*/
public Iterator iterator() {
return new NodeIterator();
}
private static final String propToString(int propType)
{
if (Token.printTrees) {
// If Context.printTrees is false, the compiler
// can remove all these strings.
switch (propType) {
case FUNCTION_PROP: return "function";
case LOCAL_PROP: return "local";
case LOCAL_BLOCK_PROP: return "local_block";
case REGEXP_PROP: return "regexp";
case CASEARRAY_PROP: return "casearray";
case TARGETBLOCK_PROP: return "targetblock";
case VARIABLE_PROP: return "variable";
case ISNUMBER_PROP: return "isnumber";
case DIRECTCALL_PROP: return "directcall";
case SPECIALCALL_PROP: return "specialcall";
case SKIP_INDEXES_PROP: return "skip_indexes";
case OBJECT_IDS_PROP: return "object_ids_prop";
case INCRDECR_PROP: return "incrdecr_prop";
case CATCH_SCOPE_PROP: return "catch_scope_prop";
case LABEL_ID_PROP: return "label_id_prop";
case MEMBER_TYPE_PROP: return "member_type_prop";
case NAME_PROP: return "name_prop";
case CONTROL_BLOCK_PROP: return "control_block_prop";
case PARENTHESIZED_PROP: return "parenthesized_prop";
case GENERATOR_END_PROP: return "generator_end";
case DESTRUCTURING_ARRAY_LENGTH:
return "destructuring_array_length";
case DESTRUCTURING_NAMES: return "destructuring_names";
case DESTRUCTURING_PARAMS: return "destructuring_params";
default: Kit.codeBug();
}
}
return null;
}
private PropListItem lookupProperty(int propType)
{
PropListItem x = propListHead;
while (x != null && propType != x.type) {
x = x.next;
}
return x;
}
private PropListItem ensureProperty(int propType)
{
PropListItem item = lookupProperty(propType);
if (item == null) {
item = new PropListItem();
item.type = propType;
item.next = propListHead;
propListHead = item;
}
return item;
}
public void removeProp(int propType)
{
PropListItem x = propListHead;
if (x != null) {
PropListItem prev = null;
while (x.type != propType) {
prev = x;
x = x.next;
if (x == null) { return; }
}
if (prev == null) {
propListHead = x.next;
} else {
prev.next = x.next;
}
}
}
public Object getProp(int propType)
{
PropListItem item = lookupProperty(propType);
if (item == null) { return null; }
return item.objectValue;
}
public int getIntProp(int propType, int defaultValue)
{
PropListItem item = lookupProperty(propType);
if (item == null) { return defaultValue; }
return item.intValue;
}
public int getExistingIntProp(int propType)
{
PropListItem item = lookupProperty(propType);
if (item == null) { Kit.codeBug(); }
return item.intValue;
}
public void putProp(int propType, Object prop)
{
if (prop == null) {
removeProp(propType);
} else {
PropListItem item = ensureProperty(propType);
item.objectValue = prop;
}
}
public void putIntProp(int propType, int prop)
{
PropListItem item = ensureProperty(propType);
item.intValue = prop;
}
/**
* Return the line number recorded for this node.
* @return the line number
*/
public int getLineno() {
return lineno;
}
public void setLineno(int lineno) {
this.lineno = lineno;
}
/** Can only be called when getType() == Token.NUMBER */
public final double getDouble() {
return ((NumberLiteral)this).getNumber();
}
public final void setDouble(double number) {
((NumberLiteral)this).setNumber(number);
}
/** Can only be called when node has String context. */
public final String getString() {
return ((Name)this).getIdentifier();
}
/** Can only be called when node has String context. */
public final void setString(String s) {
if (s == null) Kit.codeBug();
((Name)this).setIdentifier(s);
}
/** Can only be called when node has String context. */
public Scope getScope() {
return ((Name)this).getScope();
}
/** Can only be called when node has String context. */
public void setScope(Scope s) {
if (s == null) Kit.codeBug();
if (!(this instanceof Name)) {
throw Kit.codeBug();
}
((Name)this).setScope(s);
}
public static Node newTarget()
{
return new Node(Token.TARGET);
}
public final int labelId()
{
if (type != Token.TARGET && type != Token.YIELD) Kit.codeBug();
return getIntProp(LABEL_ID_PROP, -1);
}
public void labelId(int labelId)
{
if (type != Token.TARGET && type != Token.YIELD) Kit.codeBug();
putIntProp(LABEL_ID_PROP, labelId);
}
/**
* Does consistent-return analysis on the function body when strict mode is
* enabled.
*
* function (x) { return (x+1) }
* is ok, but
* function (x) { if (x < 0) return (x+1); }
* is not becuase the function can potentially return a value when the
* condition is satisfied and if not, the function does not explicitly
* return value.
*
* This extends to checking mismatches such as "return" and "return "
* used in the same function. Warnings are not emitted if inconsistent
* returns exist in code that can be statically shown to be unreachable.
* Ex.
*
function (x) { while (true) { ... if (..) { return value } ... } }
*
* emits no warning. However if the loop had a break statement, then a
* warning would be emitted.
*
* The consistency analysis looks at control structures such as loops, ifs,
* switch, try-catch-finally blocks, examines the reachable code paths and
* warns the user about an inconsistent set of termination possibilities.
*
* Caveat: Since the parser flattens many control structures into almost
* straight-line code with gotos, it makes such analysis hard. Hence this
* analyser is written to taken advantage of patterns of code generated by
* the parser (for loops, try blocks and such) and does not do a full
* control flow analysis of the gotos and break/continue statements.
* Future changes to the parser will affect this analysis.
*/
/**
* These flags enumerate the possible ways a statement/function can
* terminate. These flags are used by endCheck() and by the Parser to
* detect inconsistent return usage.
*
* END_UNREACHED is reserved for code paths that are assumed to always be
* able to execute (example: throw, continue)
*
* END_DROPS_OFF indicates if the statement can transfer control to the
* next one. Statement such as return dont. A compound statement may have
* some branch that drops off control to the next statement.
*
* END_RETURNS indicates that the statement can return (without arguments)
* END_RETURNS_VALUE indicates that the statement can return a value.
*
* A compound statement such as
* if (condition) {
* return value;
* }
* Will be detected as (END_DROPS_OFF | END_RETURN_VALUE) by endCheck()
*/
public static final int END_UNREACHED = 0;
public static final int END_DROPS_OFF = 1;
public static final int END_RETURNS = 2;
public static final int END_RETURNS_VALUE = 4;
public static final int END_YIELDS = 8;
/**
* Checks that every return usage in a function body is consistent with the
* requirements of strict-mode.
* @return true if the function satisfies strict mode requirement.
*/
public boolean hasConsistentReturnUsage()
{
int n = endCheck();
return (n & END_RETURNS_VALUE) == 0 ||
(n & (END_DROPS_OFF|END_RETURNS|END_YIELDS)) == 0;
}
/**
* Returns in the then and else blocks must be consistent with each other.
* If there is no else block, then the return statement can fall through.
* @return logical OR of END_* flags
*/
private int endCheckIf()
{
Node th, el;
int rv = END_UNREACHED;
th = next;
el = ((Jump)this).target;
rv = th.endCheck();
if (el != null)
rv |= el.endCheck();
else
rv |= END_DROPS_OFF;
return rv;
}
/**
* Consistency of return statements is checked between the case statements.
* If there is no default, then the switch can fall through. If there is a
* default,we check to see if all code paths in the default return or if
* there is a code path that can fall through.
* @return logical OR of END_* flags
*/
private int endCheckSwitch()
{
int rv = END_UNREACHED;
// examine the cases
// for (n = first.next; n != null; n = n.next)
// {
// if (n.type == Token.CASE) {
// rv |= ((Jump)n).target.endCheck();
// } else
// break;
// }
// // we don't care how the cases drop into each other
// rv &= ~END_DROPS_OFF;
// // examine the default
// n = ((Jump)this).getDefault();
// if (n != null)
// rv |= n.endCheck();
// else
// rv |= END_DROPS_OFF;
// // remove the switch block
// rv |= getIntProp(CONTROL_BLOCK_PROP, END_UNREACHED);
return rv;
}
/**
* If the block has a finally, return consistency is checked in the
* finally block. If all code paths in the finally returns, then the
* returns in the try-catch blocks don't matter. If there is a code path
* that does not return or if there is no finally block, the returns
* of the try and catch blocks are checked for mismatch.
* @return logical OR of END_* flags
*/
private int endCheckTry()
{
int rv = END_UNREACHED;
// a TryStatement isn't a jump - needs rewriting
// check the finally if it exists
// n = ((Jump)this).getFinally();
// if(n != null) {
// rv = n.next.first.endCheck();
// } else {
// rv = END_DROPS_OFF;
// }
// // if the finally block always returns, then none of the returns
// // in the try or catch blocks matter
// if ((rv & END_DROPS_OFF) != 0) {
// rv &= ~END_DROPS_OFF;
// // examine the try block
// rv |= first.endCheck();
// // check each catch block
// n = ((Jump)this).target;
// if (n != null)
// {
// // point to the first catch_scope
// for (n = n.next.first; n != null; n = n.next.next)
// {
// // check the block of user code in the catch_scope
// rv |= n.next.first.next.first.endCheck();
// }
// }
// }
return rv;
}
/**
* Return statement in the loop body must be consistent. The default
* assumption for any kind of a loop is that it will eventually terminate.
* The only exception is a loop with a constant true condition. Code that
* follows such a loop is examined only if one can statically determine
* that there is a break out of the loop.
*
* @return logical OR of END_* flags
*/
private int endCheckLoop()
{
Node n;
int rv = END_UNREACHED;
// To find the loop body, we look at the second to last node of the
// loop node, which should be the predicate that the loop should
// satisfy.
// The target of the predicate is the loop-body for all 4 kinds of
// loops.
for (n = first; n.next != last; n = n.next) {
/* skip */
}
if (n.type != Token.IFEQ)
return END_DROPS_OFF;
// The target's next is the loop body block
rv = ((Jump)n).target.next.endCheck();
// check to see if the loop condition is true
if (n.first.type == Token.TRUE)
rv &= ~END_DROPS_OFF;
// look for effect of breaks
rv |= getIntProp(CONTROL_BLOCK_PROP, END_UNREACHED);
return rv;
}
/**
* A general block of code is examined statement by statement. If any
* statement (even compound ones) returns in all branches, then subsequent
* statements are not examined.
* @return logical OR of END_* flags
*/
private int endCheckBlock()
{
Node n;
int rv = END_DROPS_OFF;
// check each statment and if the statement can continue onto the next
// one, then check the next statement
for (n=first; ((rv & END_DROPS_OFF) != 0) && n != null; n = n.next)
{
rv &= ~END_DROPS_OFF;
rv |= n.endCheck();
}
return rv;
}
/**
* A labelled statement implies that there maybe a break to the label. The
* function processes the labelled statement and then checks the
* CONTROL_BLOCK_PROP property to see if there is ever a break to the
* particular label.
* @return logical OR of END_* flags
*/
private int endCheckLabel()
{
int rv = END_UNREACHED;
rv = next.endCheck();
rv |= getIntProp(CONTROL_BLOCK_PROP, END_UNREACHED);
return rv;
}
/**
* When a break is encountered annotate the statement being broken
* out of by setting its CONTROL_BLOCK_PROP property.
* @return logical OR of END_* flags
*/
private int endCheckBreak()
{
Node n = ((Jump) this).getJumpStatement();
n.putIntProp(CONTROL_BLOCK_PROP, END_DROPS_OFF);
return END_UNREACHED;
}
/**
* endCheck() examines the body of a function, doing a basic reachability
* analysis and returns a combination of flags END_* flags that indicate
* how the function execution can terminate. These constitute only the
* pessimistic set of termination conditions. It is possible that at
* runtime certain code paths will never be actually taken. Hence this
* analysis will flag errors in cases where there may not be errors.
* @return logical OR of END_* flags
*/
private int endCheck()
{
switch(type)
{
case Token.BREAK:
return endCheckBreak();
case Token.EXPR_VOID:
if (this.first != null)
return first.endCheck();
return END_DROPS_OFF;
case Token.YIELD:
return END_YIELDS;
case Token.CONTINUE:
case Token.THROW:
return END_UNREACHED;
case Token.RETURN:
if (this.first != null)
return END_RETURNS_VALUE;
else
return END_RETURNS;
case Token.TARGET:
if (next != null)
return next.endCheck();
else
return END_DROPS_OFF;
case Token.LOOP:
return endCheckLoop();
case Token.LOCAL_BLOCK:
case Token.BLOCK:
// there are several special kinds of blocks
if (first == null)
return END_DROPS_OFF;
switch(first.type) {
case Token.LABEL:
return first.endCheckLabel();
case Token.IFNE:
return first.endCheckIf();
case Token.SWITCH:
return first.endCheckSwitch();
case Token.TRY:
return first.endCheckTry();
default:
return endCheckBlock();
}
default:
return END_DROPS_OFF;
}
}
public boolean hasSideEffects()
{
switch (type) {
case Token.EXPR_VOID:
case Token.COMMA:
if (last != null)
return last.hasSideEffects();
else
return true;
case Token.HOOK:
if (first == null ||
first.next == null ||
first.next.next == null)
Kit.codeBug();
return first.next.hasSideEffects() &&
first.next.next.hasSideEffects();
case Token.AND:
case Token.OR:
if (first == null || last == null)
Kit.codeBug();
return first.hasSideEffects() || last.hasSideEffects();
case Token.ERROR: // Avoid cascaded error messages
case Token.EXPR_RESULT:
case Token.ASSIGN:
case Token.ASSIGN_ADD:
case Token.ASSIGN_SUB:
case Token.ASSIGN_MUL:
case Token.ASSIGN_DIV:
case Token.ASSIGN_MOD:
case Token.ASSIGN_BITOR:
case Token.ASSIGN_BITXOR:
case Token.ASSIGN_BITAND:
case Token.ASSIGN_LSH:
case Token.ASSIGN_RSH:
case Token.ASSIGN_URSH:
case Token.ENTERWITH:
case Token.LEAVEWITH:
case Token.RETURN:
case Token.GOTO:
case Token.IFEQ:
case Token.IFNE:
case Token.NEW:
case Token.DELPROP:
case Token.SETNAME:
case Token.SETPROP:
case Token.SETELEM:
case Token.CALL:
case Token.THROW:
case Token.RETHROW:
case Token.SETVAR:
case Token.CATCH_SCOPE:
case Token.RETURN_RESULT:
case Token.SET_REF:
case Token.DEL_REF:
case Token.REF_CALL:
case Token.TRY:
case Token.SEMI:
case Token.INC:
case Token.DEC:
case Token.IF:
case Token.ELSE:
case Token.SWITCH:
case Token.WHILE:
case Token.DO:
case Token.FOR:
case Token.BREAK:
case Token.CONTINUE:
case Token.VAR:
case Token.CONST:
case Token.LET:
case Token.LETEXPR:
case Token.WITH:
case Token.WITHEXPR:
case Token.CATCH:
case Token.FINALLY:
case Token.BLOCK:
case Token.LABEL:
case Token.TARGET:
case Token.LOOP:
case Token.JSR:
case Token.SETPROP_OP:
case Token.SETELEM_OP:
case Token.LOCAL_BLOCK:
case Token.SET_REF_OP:
case Token.YIELD:
return true;
default:
return false;
}
}
@Override
public String toString()
{
if (Token.printTrees) {
StringBuffer sb = new StringBuffer();
toString(new ObjToIntMap(), sb);
return sb.toString();
}
return String.valueOf(type);
}
private void toString(ObjToIntMap printIds, StringBuffer sb)
{
if (Token.printTrees) {
sb.append(Token.name(type));
if (this instanceof Name) {
sb.append(' ');
sb.append(getString());
Scope scope = getScope();
if (scope != null) {
sb.append("[scope: ");
appendPrintId(scope, printIds, sb);
sb.append("]");
}
} else if (this instanceof Scope) {
if (this instanceof ScriptNode) {
ScriptNode sof = (ScriptNode)this;
if (this instanceof FunctionNode) {
FunctionNode fn = (FunctionNode)this;
sb.append(' ');
sb.append(fn.getName());
}
sb.append(" [source name: ");
sb.append(sof.getSourceName());
sb.append("] [encoded source length: ");
sb.append(sof.getEncodedSourceEnd()
- sof.getEncodedSourceStart());
sb.append("] [base line: ");
sb.append(sof.getBaseLineno());
sb.append("] [end line: ");
sb.append(sof.getEndLineno());
sb.append(']');
}
if (((Scope)this).getSymbolTable() != null) {
sb.append(" [scope ");
appendPrintId(this, printIds, sb);
sb.append(": ");
Iterator iter =
((Scope) this).getSymbolTable().keySet().iterator();
while (iter.hasNext()) {
sb.append(iter.next());
sb.append(" ");
}
sb.append("]");
}
} else if (this instanceof Jump) {
Jump jump = (Jump)this;
if (type == Token.BREAK || type == Token.CONTINUE) {
sb.append(" [label: ");
appendPrintId(jump.getJumpStatement(), printIds, sb);
sb.append(']');
} else if (type == Token.TRY) {
Node catchNode = jump.target;
Node finallyTarget = jump.getFinally();
if (catchNode != null) {
sb.append(" [catch: ");
appendPrintId(catchNode, printIds, sb);
sb.append(']');
}
if (finallyTarget != null) {
sb.append(" [finally: ");
appendPrintId(finallyTarget, printIds, sb);
sb.append(']');
}
} else if (type == Token.LABEL || type == Token.LOOP
|| type == Token.SWITCH)
{
sb.append(" [break: ");
appendPrintId(jump.target, printIds, sb);
sb.append(']');
if (type == Token.LOOP) {
sb.append(" [continue: ");
appendPrintId(jump.getContinue(), printIds, sb);
sb.append(']');
}
} else {
sb.append(" [target: ");
appendPrintId(jump.target, printIds, sb);
sb.append(']');
}
} else if (type == Token.NUMBER) {
sb.append(' ');
sb.append(getDouble());
} else if (type == Token.TARGET) {
sb.append(' ');
appendPrintId(this, printIds, sb);
}
if (lineno != -1) {
sb.append(' ');
sb.append(lineno);
}
for (PropListItem x = propListHead; x != null; x = x.next) {
int type = x.type;
sb.append(" [");
sb.append(propToString(type));
sb.append(": ");
String value;
switch (type) {
case TARGETBLOCK_PROP : // can't add this as it recurses
value = "target block property";
break;
case LOCAL_BLOCK_PROP : // can't add this as it is dull
value = "last local block";
break;
case ISNUMBER_PROP:
switch (x.intValue) {
case BOTH:
value = "both";
break;
case RIGHT:
value = "right";
break;
case LEFT:
value = "left";
break;
default:
throw Kit.codeBug();
}
break;
case SPECIALCALL_PROP:
switch (x.intValue) {
case SPECIALCALL_EVAL:
value = "eval";
break;
case SPECIALCALL_WITH:
value = "with";
break;
default:
// NON_SPECIALCALL should not be stored
throw Kit.codeBug();
}
break;
case OBJECT_IDS_PROP: {
Object[] a = (Object[]) x.objectValue;
value = "[";
for (int i=0; i < a.length; i++) {
value += a[i].toString();
if (i+1 < a.length)
value += ", ";
}
value += "]";
break;
}
default :
Object obj = x.objectValue;
if (obj != null) {
value = obj.toString();
} else {
value = String.valueOf(x.intValue);
}
break;
}
sb.append(value);
sb.append(']');
}
}
}
public String toStringTree(ScriptNode treeTop) {
if (Token.printTrees) {
StringBuffer sb = new StringBuffer();
toStringTreeHelper(treeTop, this, null, 0, sb);
return sb.toString();
}
return null;
}
private static void toStringTreeHelper(ScriptNode treeTop, Node n,
ObjToIntMap printIds,
int level, StringBuffer sb)
{
if (Token.printTrees) {
if (printIds == null) {
printIds = new ObjToIntMap();
generatePrintIds(treeTop, printIds);
}
for (int i = 0; i != level; ++i) {
sb.append(" ");
}
n.toString(printIds, sb);
sb.append('\n');
for (Node cursor = n.getFirstChild(); cursor != null;
cursor = cursor.getNext())
{
if (cursor.getType() == Token.FUNCTION) {
int fnIndex = cursor.getExistingIntProp(Node.FUNCTION_PROP);
FunctionNode fn = treeTop.getFunctionNode(fnIndex);
toStringTreeHelper(fn, fn, null, level + 1, sb);
} else {
toStringTreeHelper(treeTop, cursor, printIds, level+1, sb);
}
}
}
}
private static void generatePrintIds(Node n, ObjToIntMap map)
{
if (Token.printTrees) {
map.put(n, map.size());
for (Node cursor = n.getFirstChild(); cursor != null;
cursor = cursor.getNext())
{
generatePrintIds(cursor, map);
}
}
}
private static void appendPrintId(Node n, ObjToIntMap printIds,
StringBuffer sb)
{
if (Token.printTrees) {
if (n != null) {
int id = printIds.get(n, -1);
sb.append('#');
if (id != -1) {
sb.append(id + 1);
} else {
sb.append("");
}
}
}
}
protected int type = Token.ERROR; // type of the node, e.g. Token.NAME
protected Node next; // next sibling
protected Node first; // first element of a linked list of children
protected Node last; // last element of a linked list of children
protected int lineno = -1;
/**
* Linked list of properties. Since vast majority of nodes would have
* no more then 2 properties, linked list saves memory and provides
* fast lookup. If this does not holds, propListHead can be replaced
* by UintMap.
*/
protected PropListItem propListHead;
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/Synchronizer.java 0000644 0001750 0001750 00000005627 10776622373 026310 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Delegator.java, released
* Sep 27, 2000.
*
* The Initial Developer of the Original Code is
* Matthias Radestock. .
* Portions created by the Initial Developer are Copyright (C) 2000
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
// API class
package org.mozilla.javascript;
/**
* This class provides support for implementing Java-style synchronized
* methods in Javascript.
*
* Synchronized functions are created from ordinary Javascript
* functions by the Synchronizer constructor, e.g.
* new Packages.org.mozilla.javascript.Synchronizer(fun).
* The resulting object is a function that establishes an exclusive
* lock on the this object of its invocation.
*
* The Rhino shell provides a short-cut for the creation of
* synchronized methods: sync(fun) has the same effect as
* calling the above constructor.
*
* @see org.mozilla.javascript.Delegator
* @author Matthias Radestock
*/
public class Synchronizer extends Delegator {
/**
* Create a new synchronized function from an existing one.
*
* @param obj the existing function
*/
public Synchronizer(Scriptable obj) {
super(obj);
}
/**
* @see org.mozilla.javascript.Function#call
*/
@Override
public Object call(Context cx, Scriptable scope, Scriptable thisObj,
Object[] args)
{
synchronized(thisObj instanceof Wrapper ? ((Wrapper)thisObj).unwrap() : thisObj) {
return ((Function)obj).call(cx,scope,thisObj,args);
}
}
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/jdk15/ 0000755 0001750 0001750 00000000000 11530107756 023644 5 ustar cavedon cavedon htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/jdk15/VMBridge_jdk15.java 0000644 0001750 0001750 00000006755 11111044312 027140 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-2000
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript.jdk15;
import java.lang.reflect.Member;
import java.lang.reflect.Method;
import java.lang.reflect.Constructor;
import java.util.Iterator;
import org.mozilla.javascript.*;
public class VMBridge_jdk15 extends org.mozilla.javascript.jdk13.VMBridge_jdk13
{
public VMBridge_jdk15() throws SecurityException, InstantiationException {
try {
// Just try and see if we can access the isVarArgs method.
// We want to fail loading if the method does not exist
// so that we can load a bridge to an older JDK instead.
Method.class.getMethod("isVarArgs", (Class[]) null);
} catch (NoSuchMethodException e) {
// Throw a fitting exception that is handled by
// org.mozilla.javascript.Kit.newInstanceOrNull:
throw new InstantiationException(e.getMessage());
}
}
@Override
public boolean isVarArgs(Member member) {
if (member instanceof Method)
return ((Method) member).isVarArgs();
else if (member instanceof Constructor)
return ((Constructor) member).isVarArgs();
else
return false;
}
/**
* If "obj" is a java.util.Iterator or a java.lang.Iterable, return a
* wrapping as a JavaScript Iterator. Otherwise, return null.
* This method is in VMBridge since Iterable is a JDK 1.5 addition.
*/
@Override
public Iterator getJavaIterator(Context cx, Scriptable scope, Object obj) {
if (obj instanceof Wrapper) {
Object unwrapped = ((Wrapper) obj).unwrap();
Iterator iterator = null;
if (unwrapped instanceof Iterator)
iterator = (Iterator) unwrapped;
if (unwrapped instanceof Iterable)
iterator = ((Iterable)unwrapped).iterator();
return iterator;
}
return null;
}
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/NativeJavaTopPackage.java 0000644 0001750 0001750 00000015607 11222455466 027573 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
* Frank Mitchell
* Mike Shaver
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript;
/**
* This class reflects Java packages into the JavaScript environment. We
* lazily reflect classes and subpackages, and use a caching/sharing
* system to ensure that members reflected into one JavaPackage appear
* in all other references to the same package (as with Packages.java.lang
* and java.lang).
*
* @author Mike Shaver
* @see NativeJavaArray
* @see NativeJavaObject
* @see NativeJavaClass
*/
public class NativeJavaTopPackage
extends NativeJavaPackage implements Function, IdFunctionCall
{
static final long serialVersionUID = -1455787259477709999L;
// we know these are packages so we can skip the class check
// note that this is ok even if the package isn't present.
private static final String[][] commonPackages = {
{"java", "lang", "reflect"},
{"java", "io"},
{"java", "math"},
{"java", "net"},
{"java", "util", "zip"},
{"java", "text", "resources"},
{"java", "applet"},
{"javax", "swing"}
};
NativeJavaTopPackage(ClassLoader loader)
{
super(true, "", loader);
}
public Object call(Context cx, Scriptable scope, Scriptable thisObj,
Object[] args)
{
return construct(cx, scope, args);
}
public Scriptable construct(Context cx, Scriptable scope, Object[] args)
{
ClassLoader loader = null;
if (args.length != 0) {
Object arg = args[0];
if (arg instanceof Wrapper) {
arg = ((Wrapper)arg).unwrap();
}
if (arg instanceof ClassLoader) {
loader = (ClassLoader)arg;
}
}
if (loader == null) {
Context.reportRuntimeError0("msg.not.classloader");
return null;
}
NativeJavaPackage pkg = new NativeJavaPackage(true, "", loader);
ScriptRuntime.setObjectProtoAndParent(pkg, scope);
return pkg;
}
public static void init(Context cx, Scriptable scope, boolean sealed)
{
ClassLoader loader = cx.getApplicationClassLoader();
final NativeJavaTopPackage top = new NativeJavaTopPackage(loader);
top.setPrototype(getObjectPrototype(scope));
top.setParentScope(scope);
for (int i = 0; i != commonPackages.length; i++) {
NativeJavaPackage parent = top;
for (int j = 0; j != commonPackages[i].length; j++) {
parent = parent.forcePackage(commonPackages[i][j], scope);
}
}
// getClass implementation
IdFunctionObject getClass = new IdFunctionObject(top, FTAG, Id_getClass,
"getClass", 1, scope);
// We want to get a real alias, and not a distinct JavaPackage
// with the same packageName, so that we share classes and top
// that are underneath.
String[] topNames = { "java", "javax", "org", "com", "edu", "net" };
NativeJavaPackage[] topPackages = new NativeJavaPackage[topNames.length];
for (int i=0; i < topNames.length; i++) {
topPackages[i] = (NativeJavaPackage)top.get(topNames[i], top);
}
// It's safe to downcast here since initStandardObjects takes
// a ScriptableObject.
ScriptableObject global = (ScriptableObject) scope;
if (sealed) {
getClass.sealObject();
}
getClass.exportAsScopeProperty();
global.defineProperty("Packages", top, ScriptableObject.DONTENUM);
for (int i=0; i < topNames.length; i++) {
global.defineProperty(topNames[i], topPackages[i],
ScriptableObject.DONTENUM);
}
}
public Object execIdCall(IdFunctionObject f, Context cx, Scriptable scope,
Scriptable thisObj, Object[] args)
{
if (f.hasTag(FTAG)) {
if (f.methodId() == Id_getClass) {
return js_getClass(cx, scope, args);
}
}
throw f.unknown();
}
private Scriptable js_getClass(Context cx, Scriptable scope, Object[] args)
{
if (args.length > 0 && args[0] instanceof Wrapper) {
Scriptable result = this;
Class cl = ((Wrapper) args[0]).unwrap().getClass();
// Evaluate the class name by getting successive properties of
// the string to find the appropriate NativeJavaClass object
String name = cl.getName();
int offset = 0;
for (;;) {
int index = name.indexOf('.', offset);
String propName = index == -1
? name.substring(offset)
: name.substring(offset, index);
Object prop = result.get(propName, result);
if (!(prop instanceof Scriptable))
break; // fall through to error
result = (Scriptable) prop;
if (index == -1)
return result;
offset = index+1;
}
}
throw Context.reportRuntimeError0("msg.not.java.obj");
}
private static final Object FTAG = "JavaTopPackage";
private static final int Id_getClass = 1;
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/resources/ 0000755 0001750 0001750 00000000000 11530107756 024740 5 ustar cavedon cavedon htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/resources/Messages.properties 0000644 0001750 0001750 00000052256 11321335670 030633 0 ustar cavedon cavedon #
# Default JavaScript messages file.
#
# ***** BEGIN LICENSE BLOCK *****
# Version: MPL 1.1/GPL 2.0
#
# The contents of this file are subject to the Mozilla Public License Version
# 1.1 (the "License"); you may not use this file except in compliance with
# the License. You may obtain a copy of the License at
# http://www.mozilla.org/MPL/
#
# Software distributed under the License is distributed on an "AS IS" basis,
# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
# for the specific language governing rights and limitations under the
# License.
#
# The Original Code is Rhino code, released
# May 6, 1999.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1997-1999
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Norris Boyd
# Bob Jervis
#
# Alternatively, the contents of this file may be used under the terms of
# the GNU General Public License Version 2 or later (the "GPL"), in which
# case the provisions of the GPL are applicable instead of those above. If
# you wish to allow use of your version of this file only under the terms of
# the GPL and not to allow others to use your version of this file under the
# MPL, indicate your decision by deleting the provisions above and replacing
# them with the notice and other provisions required by the GPL. If you do
# not delete the provisions above, a recipient may use your version of this
# file under either the MPL or the GPL.
#
# ***** END LICENSE BLOCK *****
# This is replaced during jar assembly from property string
# and should not be translated
implementation.version = @IMPLEMENTATION.VERSION@
#
# To add JavaScript error messages for a particular locale, create a
# new Messages_[locale].properties file, where [locale] is the Java
# string abbreviation for that locale. For example, JavaScript
# messages for the Polish locale should be located in
# Messages_pl.properties, and messages for the Italian Swiss locale
# should be located in Messages_it_CH.properties. Message properties
# files should be accessible through the classpath under
# org.mozilla.javascript.resources
#
# See:
# java.util.ResourceBundle
# java.text.MessageFormat
#
# SomeJavaClassWhereUsed
# Codegen
msg.dup.parms =\
Duplicate parameter name "{0}".
msg.too.big.jump =\
Program too complex: too big jump offset.
msg.too.big.index =\
Program too complex: internal index exceeds 64K limit.
msg.while.compiling.fn =\
Encountered code generation error while compiling function "{0}": {1}
msg.while.compiling.script =\
Encountered code generation error while compiling script: {0}
# Context
msg.ctor.not.found =\
Constructor for "{0}" not found.
msg.not.ctor =\
"{0}" is not a constructor.
# FunctionObject
msg.varargs.ctor =\
Method or constructor "{0}" must be static with the signature \
"(Context cx, Object[] args, Function ctorObj, boolean inNewExpr)" \
to define a variable arguments constructor.
msg.varargs.fun =\
Method "{0}" must be static with the signature \
"(Context cx, Scriptable thisObj, Object[] args, Function funObj)" \
to define a variable arguments function.
msg.incompat.call =\
Method "{0}" called on incompatible object.
msg.bad.parms =\
Unsupported parameter type "{0}" in method "{1}".
msg.bad.method.return =\
Unsupported return type "{0}" in method "{1}".
msg.bad.ctor.return =\
Construction of objects of type "{0}" is not supported.
msg.no.overload =\
Method "{0}" occurs multiple times in class "{1}".
msg.method.not.found =\
Method "{0}" not found in "{1}".
# IRFactory
msg.bad.for.in.lhs =\
Invalid left-hand side of for..in loop.
msg.mult.index =\
Only one variable allowed in for..in loop.
msg.bad.for.in.destruct =\
Left hand side of for..in loop must be an array of length 2 to accept \
key/value pair.
msg.cant.convert =\
Can''t convert to type "{0}".
msg.bad.assign.left =\
Invalid assignment left-hand side.
msg.bad.decr =\
Invalid decrement operand.
msg.bad.incr =\
Invalid increment operand.
msg.bad.yield =\
yield must be in a function.
msg.yield.parenthesized =\
yield expression must be parenthesized.
# NativeGlobal
msg.cant.call.indirect =\
Function "{0}" must be called directly, and not by way of a \
function of another name.
msg.eval.nonstring =\
Calling eval() with anything other than a primitive string value will \
simply return the value. Is this what you intended?
msg.eval.nonstring.strict =\
Calling eval() with anything other than a primitive string value is not \
allowed in strict mode.
msg.bad.destruct.op =\
Invalid destructuring assignment operator
# NativeCall
msg.only.from.new =\
"{0}" may only be invoked from a "new" expression.
msg.deprec.ctor =\
The "{0}" constructor is deprecated.
# NativeFunction
msg.no.function.ref.found =\
no source found to decompile function reference {0}
msg.arg.isnt.array =\
second argument to Function.prototype.apply must be an array
# NativeGlobal
msg.bad.esc.mask =\
invalid string escape mask
# NativeJavaClass
msg.cant.instantiate =\
error instantiating ({0}): class {1} is interface or abstract
msg.bad.ctor.sig =\
Found constructor with wrong signature: \
{0} calling {1} with signature {2}
msg.not.java.obj =\
Expected argument to getClass() to be a Java object.
msg.no.java.ctor =\
Java constructor for "{0}" with arguments "{1}" not found.
# NativeJavaMethod
msg.method.ambiguous =\
The choice of Java method {0}.{1} matching JavaScript argument types ({2}) is ambiguous; \
candidate methods are: {3}
msg.constructor.ambiguous =\
The choice of Java constructor {0} matching JavaScript argument types ({1}) is ambiguous; \
candidate constructors are: {2}
# NativeJavaObject
msg.conversion.not.allowed =\
Cannot convert {0} to {1}
msg.no.empty.interface.conversion =\
Cannot convert {0} to interface {1} with no methods
msg.no.function.interface.conversion =\
Cannot convert function {0} to interface since it contains methods with \
different signatures
# NativeJavaPackage
msg.not.classloader =\
Constructor for "Packages" expects argument of type java.lang.Classloader
# NativeRegExp
msg.bad.quant =\
Invalid quantifier {0}
msg.overlarge.backref =\
Overly large back reference {0}
msg.overlarge.min =\
Overly large minimum {0}
msg.overlarge.max =\
Overly large maximum {0}
msg.zero.quant =\
Zero quantifier {0}
msg.max.lt.min =\
Maximum {0} less than minimum
msg.unterm.quant =\
Unterminated quantifier {0}
msg.unterm.paren =\
Unterminated parenthetical {0}
msg.unterm.class =\
Unterminated character class {0}
msg.bad.range =\
Invalid range in character class.
msg.trail.backslash =\
Trailing \\ in regular expression.
msg.re.unmatched.right.paren =\
unmatched ) in regular expression.
msg.no.regexp =\
Regular expressions are not available.
msg.bad.backref =\
back-reference exceeds number of capturing parentheses.
msg.bad.regexp.compile =\
Only one argument may be specified if the first argument to \
RegExp.prototype.compile is a RegExp object.
msg.arg.not.object =\
Expected argument of type object, but instead had type {0}
# NativeDate
msg.invalid.date =\
Date is invalid.
msg.toisostring.must.return.primitive =\
toISOString must return a primitive value, but instead returned "{0}"
# Parser
msg.got.syntax.errors = \
Compilation produced {0} syntax errors.
msg.var.redecl =\
TypeError: redeclaration of var {0}.
msg.const.redecl =\
TypeError: redeclaration of const {0}.
msg.let.redecl =\
TypeError: redeclaration of variable {0}.
msg.parm.redecl =\
TypeError: redeclaration of formal parameter {0}.
msg.fn.redecl =\
TypeError: redeclaration of function {0}.
msg.let.decl.not.in.block =\
SyntaxError: let declaration not directly within block
msg.bad.object.init =\
SyntaxError: invalid object initializer
# NodeTransformer
msg.dup.label =\
duplicated label
msg.undef.label =\
undefined label
msg.bad.break =\
unlabelled break must be inside loop or switch
msg.continue.outside =\
continue must be inside loop
msg.continue.nonloop =\
continue can only use labeles of iteration statements
msg.bad.throw.eol =\
Line terminator is not allowed between the throw keyword and throw \
expression.
msg.no.paren.parms =\
missing ( before function parameters.
msg.no.parm =\
missing formal parameter
msg.no.paren.after.parms =\
missing ) after formal parameters
msg.no.brace.body =\
missing '{' before function body
msg.no.brace.after.body =\
missing } after function body
msg.no.paren.cond =\
missing ( before condition
msg.no.paren.after.cond =\
missing ) after condition
msg.no.semi.stmt =\
missing ; before statement
msg.missing.semi =\
missing ; after statement
msg.no.name.after.dot =\
missing name after . operator
msg.no.name.after.coloncolon =\
missing name after :: operator
msg.no.name.after.dotdot =\
missing name after .. operator
msg.no.name.after.xmlAttr =\
missing name after .@
msg.no.bracket.index =\
missing ] in index expression
msg.no.paren.switch =\
missing ( before switch expression
msg.no.paren.after.switch =\
missing ) after switch expression
msg.no.brace.switch =\
missing '{' before switch body
msg.bad.switch =\
invalid switch statement
msg.no.colon.case =\
missing : after case expression
msg.double.switch.default =\
double default label in the switch statement
msg.no.while.do =\
missing while after do-loop body
msg.no.paren.for =\
missing ( after for
msg.no.semi.for =\
missing ; after for-loop initializer
msg.no.semi.for.cond =\
missing ; after for-loop condition
msg.in.after.for.name =\
missing in after for
msg.no.paren.for.ctrl =\
missing ) after for-loop control
msg.no.paren.with =\
missing ( before with-statement object
msg.no.paren.after.with =\
missing ) after with-statement object
msg.no.with.strict =\
with statements not allowed in strict mode
msg.no.paren.after.let =\
missing ( after let
msg.no.paren.let =\
missing ) after variable list
msg.no.curly.let =\
missing } after let statement
msg.bad.return =\
invalid return
msg.no.brace.block =\
missing } in compound statement
msg.bad.label =\
invalid label
msg.bad.var =\
missing variable name
msg.bad.var.init =\
invalid variable initialization
msg.no.colon.cond =\
missing : in conditional expression
msg.no.paren.arg =\
missing ) after argument list
msg.no.bracket.arg =\
missing ] after element list
msg.bad.prop =\
invalid property id
msg.no.colon.prop =\
missing : after property id
msg.no.brace.prop =\
missing } after property list
msg.no.paren =\
missing ) in parenthetical
msg.reserved.id =\
identifier is a reserved word
msg.no.paren.catch =\
missing ( before catch-block condition
msg.bad.catchcond =\
invalid catch block condition
msg.catch.unreachable =\
any catch clauses following an unqualified catch are unreachable
msg.no.brace.try =\
missing '{' before try block
msg.no.brace.catchblock =\
missing '{' before catch-block body
msg.try.no.catchfinally =\
''try'' without ''catch'' or ''finally''
msg.no.return.value =\
function {0} does not always return a value
msg.anon.no.return.value =\
anonymous function does not always return a value
msg.return.inconsistent =\
return statement is inconsistent with previous usage
msg.generator.returns =\
TypeError: generator function {0} returns a value
msg.anon.generator.returns =\
TypeError: anonymous generator function returns a value
msg.syntax =\
syntax error
msg.unexpected.eof =\
Unexpected end of file
msg.XML.bad.form =\
illegally formed XML syntax
msg.XML.not.available =\
XML runtime not available
msg.too.deep.parser.recursion =\
Too deep recursion while parsing
msg.too.many.constructor.args =\
Too many constructor arguments
msg.too.many.function.args =\
Too many function arguments
msg.no.side.effects =\
Code has no side effects
msg.extra.trailing.semi =\
Extraneous trailing semicolon
msg.extra.trailing.comma =\
Trailing comma is not legal in an ECMA-262 object initializer
msg.trailing.array.comma =\
Trailing comma in array literal has different cross-browser behavior
msg.equal.as.assign =\
Test for equality (==) mistyped as assignment (=)?
msg.var.hides.arg =\
Variable {0} hides argument
msg.destruct.assign.no.init =\
Missing = in destructuring declaration
msg.no.octal.strict =\
Octal numbers prohibited in strict mode.
msg.dup.obj.lit.prop.strict =\
Property "{0}" already defined in this object literal.
msg.dup.param.strict =\
Parameter "{0}" already declared in this function.
msg.bad.id.strict =\
"{0}" is not a valid identifier for this use in strict mode.
# ScriptRuntime
# is there a better message for this?
# it's currently only used as a poison pill for caller, caller and arguments properties
msg.op.not.allowed =\
This operation is not allowed.
msg.no.properties =\
{0} has no properties.
msg.invalid.iterator =\
Invalid iterator value
msg.iterator.primitive =\
__iterator__ returned a primitive value
msg.assn.create.strict =\
Assignment to undeclared variable {0}
msg.ref.undefined.prop =\
Reference to undefined property "{0}"
msg.prop.not.found =\
Property {0} not found.
msg.set.prop.no.setter =\
Cannot set property {0} that has only a getter.
msg.invalid.type =\
Invalid JavaScript value of type {0}
msg.primitive.expected =\
Primitive type expected (had {0} instead)
msg.namespace.expected =\
Namespace object expected to left of :: (found {0} instead)
msg.null.to.object =\
Cannot convert null to an object.
msg.undef.to.object =\
Cannot convert undefined to an object.
msg.cyclic.value =\
Cyclic {0} value not allowed.
msg.is.not.defined =\
"{0}" is not defined.
msg.undef.prop.read =\
Cannot read property "{1}" from {0}
msg.undef.prop.write =\
Cannot set property "{1}" of {0} to "{2}"
msg.undef.prop.delete =\
Cannot delete property "{1}" of {0}
msg.undef.method.call =\
Cannot call method "{1}" of {0}
msg.undef.with =\
Cannot apply "with" to {0}
msg.isnt.function =\
{0} is not a function, it is {1}.
msg.isnt.function.in =\
Cannot call property {0} in object {1}. It is not a function, it is "{2}".
msg.function.not.found =\
Cannot find function {0}.
msg.function.not.found.in =\
Cannot find function {0} in object {1}.
msg.isnt.xml.object =\
{0} is not an xml object.
msg.no.ref.to.get =\
{0} is not a reference to read reference value.
msg.no.ref.to.set =\
{0} is not a reference to set reference value to {1}.
msg.no.ref.from.function =\
Function {0} can not be used as the left-hand side of assignment \
or as an operand of ++ or -- operator.
msg.bad.default.value =\
Object''s getDefaultValue() method returned an object.
msg.instanceof.not.object = \
Can''t use instanceof on a non-object.
msg.instanceof.bad.prototype = \
''prototype'' property of {0} is not an object.
msg.bad.radix = \
illegal radix {0}.
# ScriptableObject
msg.default.value =\
Cannot find default value for object.
msg.zero.arg.ctor =\
Cannot load class "{0}" which has no zero-parameter constructor.
duplicate.defineClass.name =\
Invalid method "{0}": name "{1}" is already in use.
msg.ctor.multiple.parms =\
Can''t define constructor or class {0} since more than one \
constructor has multiple parameters.
msg.extend.scriptable =\
{0} must extend ScriptableObject in order to define property {1}.
msg.bad.getter.parms =\
In order to define a property, getter {0} must have zero parameters \
or a single ScriptableObject parameter.
msg.obj.getter.parms =\
Expected static or delegated getter {0} to take a ScriptableObject parameter.
msg.getter.static =\
Getter and setter must both be static or neither be static.
msg.setter.return =\
Setter must have void return type: {0}
msg.setter2.parms =\
Two-parameter setter must take a ScriptableObject as its first parameter.
msg.setter1.parms =\
Expected single parameter setter for {0}
msg.setter2.expected =\
Expected static or delegated setter {0} to take two parameters.
msg.setter.parms =\
Expected either one or two parameters for setter.
msg.setter.bad.type =\
Unsupported parameter type "{0}" in setter "{1}".
msg.add.sealed =\
Cannot add a property to a sealed object: {0}.
msg.remove.sealed =\
Cannot remove a property from a sealed object: {0}.
msg.modify.sealed =\
Cannot modify a property of a sealed object: {0}.
msg.modify.readonly =\
Cannot modify readonly property: {0}.
msg.both.data.and.accessor.desc =\
Cannot be both a data and an accessor descriptor.
msg.change.configurable.false.to.true =\
Cannot change the configurable attribute of "{0}" from false to true.
msg.change.enumerable.with.configurable.false =\
Cannot change the enumerable attribute of "{0}" because configurable is false.
msg.change.writable.false.to.true.with.configurable.false =\
Cannot change the writable attribute of "{0}" from false to true because configurable is false.
msg.change.value.with.writable.false =\
Cannot change the value of attribute "{0}" because writable is false.
msg.change.getter.with.configurable.false =\
Cannot change the get attribute of "{0}" because configurable is false.
msg.change.setter.with.configurable.false =\
Cannot change the set attribute of "{0}" because configurable is false.
msg.change.property.data.to.accessor.with.configurable.false =\
Cannot change "{0}" from a data property to an accessor property because configurable is false.
msg.change.property.accessor.to.data.with.configurable.false =\
Cannot change "{0}" from an accessor property to a data property because configurable is false.
msg.not.extensible =\
Cannot add properties to this object because extensible is false.
# TokenStream
msg.missing.exponent =\
missing exponent
msg.caught.nfe =\
number format error
msg.unterminated.string.lit =\
unterminated string literal
msg.unterminated.comment =\
unterminated comment
msg.unterminated.re.lit =\
unterminated regular expression literal
msg.invalid.re.flag =\
invalid flag after regular expression
msg.no.re.input.for =\
no input for {0}
msg.illegal.character =\
illegal character
msg.invalid.escape =\
invalid Unicode escape sequence
msg.bad.namespace =\
not a valid default namespace statement. \
Syntax is: default xml namespace = EXPRESSION;
# TokensStream warnings
msg.bad.octal.literal =\
illegal octal literal digit {0}; interpreting it as a decimal digit
msg.reserved.keyword =\
illegal usage of future reserved keyword {0}; interpreting it as ordinary identifier
# LiveConnect errors
msg.java.internal.field.type =\
Internal error: type conversion of {0} to assign to {1} on {2} failed.
msg.java.conversion.implicit_method =\
Can''t find converter method "{0}" on class {1}.
msg.java.method.assign =\
Java method "{0}" cannot be assigned to.
msg.java.internal.private =\
Internal error: attempt to access private/protected field "{0}".
msg.java.no_such_method =\
Can''t find method {0}.
msg.script.is.not.constructor =\
Script objects are not constructors.
msg.nonjava.method =\
Java method "{0}" was invoked with {1} as "this" value that can not be converted to Java type {2}.
msg.java.member.not.found =\
Java class "{0}" has no public instance field or method named "{1}".
msg.java.array.index.out.of.bounds =\
Array index {0} is out of bounds [0..{1}].
msg.java.array.member.not.found =\
Java arrays have no public instance fields or methods named "{0}".
msg.pkg.int =\
Java package names may not be numbers.
msg.access.prohibited =\
Access to Java class "{0}" is prohibited.
# ImporterTopLevel
msg.ambig.import =\
Ambiguous import: "{0}" and and "{1}".
msg.not.pkg =\
Function importPackage must be called with a package; had "{0}" instead.
msg.not.class =\
Function importClass must be called with a class; had "{0}" instead.
msg.not.class.not.pkg =\
"{0}" is neither a class nor a package.
msg.prop.defined =\
Cannot import "{0}" since a property by that name is already defined.
#JavaAdapter
msg.adapter.zero.args =\
JavaAdapter requires at least one argument.
msg.not.java.class.arg = \
Argument {0} is not Java class: {1}.
#JavaAdapter
msg.only.one.super = \
Only one class may be extended by a JavaAdapter. Had {0} and {1}.
# Arrays
msg.arraylength.bad =\
Inappropriate array length.
# Arrays
msg.arraylength.too.big =\
Array length {0} exceeds supported capacity limit.
msg.empty.array.reduce =\
Reduce of empty array with no initial value
# URI
msg.bad.uri =\
Malformed URI sequence.
# Number
msg.bad.precision =\
Precision {0} out of range.
# NativeGenerator
msg.send.newborn =\
Attempt to send value to newborn generator
msg.already.exec.gen =\
Already executing generator
msg.StopIteration.invalid =\
StopIteration may not be changed to an arbitrary object.
# Interpreter
msg.yield.closing =\
Yield from closing generator
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/resources/Messages_fr.properties 0000644 0001750 0001750 00000035245 10776622373 031335 0 ustar cavedon cavedon #
# French JavaScript messages file.
#
# ***** BEGIN LICENSE BLOCK *****
# Version: MPL 1.1/GPL 2.0
#
# The contents of this file are subject to the Mozilla Public License Version
# 1.1 (the "License"); you may not use this file except in compliance with
# the License. You may obtain a copy of the License at
# http://www.mozilla.org/MPL/
#
# Software distributed under the License is distributed on an "AS IS" basis,
# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
# for the specific language governing rights and limitations under the
# License.
#
# The Original Code is Aviva Inc. code, released
# March 5, 2004.
#
# The Initial Developer of the Original Code is
# Aviva Inc.
# Portions created by the Initial Developer are Copyright (C) 2004
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Eugene Aresteanu
#
# Alternatively, the contents of this file may be used under the terms of
# the GNU General Public License Version 2 or later (the "GPL"), in which
# case the provisions of the GPL are applicable instead of those above. If
# you wish to allow use of your version of this file only under the terms of
# the GPL and not to allow others to use your version of this file under the
# MPL, indicate your decision by deleting the provisions above and replacing
# them with the notice and other provisions required by the GPL. If you do
# not delete the provisions above, a recipient may use your version of this
# file under either the MPL or the GPL.
#
# ***** END LICENSE BLOCK *****
msg.dup.parms =\
Le nom de param\u00E8tre "{0}" existe d\u00E9j\u00E0.
msg.too.big.jump =\
Programme trop complexe : d\u00E9calage de saut trop important
msg.too.big.index =\
Programme trop complexe : l''indice interne d\u00E9passe la limite de 64 ko
msg.ctor.not.found =\
Le constructeur de "{0}" est introuvable
msg.not.ctor =\
{0} n''est pas un constructeur
msg.varargs.ctor =\
La m\u00E9thode ou le constructeur "{0}" doit \u00EAtre statique avec la signature "(Context cx, arguments Object[], Function ctorObj, boolean inNewExpr)" pour d\u00E9finir un constructeur d''arguments de variable.
msg.varargs.fun =\
La m\u00E9thode "{0}" doit \u00EAtre statique avec la signature "(Context cx, Scriptable thisObj, arguments Object[], Function funObj)" pour d\u00E9finir une fonction d''arguments de variable
msg.incompat.call =\
La m\u00E9thode "{0}" a \u00E9t\u00E9 appel\u00E9e dans un objet non compatible
msg.bad.parms =\
Les param\u00E8tres de la m\u00E9thode sont incorrects pour "{0}"
msg.no.overload =\
La m\u00E9thode "{0}" appara\u00EEt plusieurs fois dans la classe "{1}"
msg.method.not.found =\
La m\u00E9thode "{0}" est introuvable dans "{1}"
msg.bad.for.in.lhs =\
La partie gauche de la boucle for..in est incorrecte
msg.bad.lhs.assign =\
La partie gauche de l''affectation est incorrecte
msg.mult.index =\
Une seule variable est autoris\u00E9e dans la boucle for..in
msg.cant.convert =\
La conversion en type "{0}" est impossible
msg.cant.call.indirect =\
La fonction "{0}" doit \u00EAtre appel\u00E9e directement et non par l''interm\u00E9diaire d''une fonction portant un autre nom
msg.eval.nonstring =\
Si vous appelez la fonction eval() avec une valeur qui n''appartient pas \u00E0 une cha\u00EEne primitive, c''est la valeur en question qui est renvoy\u00E9e. \u00E9tait-ce votre intention ?
msg.only.from.new =\
{0} ne peut \u00EAtre appel\u00E9e qu''\u00E0 partir d''une "nouvelle" expression.
msg.deprec.ctor =\
Le constructeur "{0}" est d\u00E9conseill\u00E9
msg.no.function.ref.found =\
aucune source n''a \u00E9t\u00E9 trouv\u00E9e pour d\u00E9compiler la r\u00E9f\u00E9rence de fonction {0}
msg.arg.isnt.array =\
le second argument de la m\u00E9thode Function.prototype.apply doit \u00EAtre un tableau
msg.bad.esc.mask =\
le masque d''\u00E9chappement de cha\u00EEne est incorrect
msg.cant.instantiate =\
erreur lors de l''instanciation ({0}) : la classe {1} est une classe interface ou abstract
msg.bad.ctor.sig =\
Un constructeur avec une signature incorrecte a \u00E9t\u00E9 d\u00E9tect\u00E9 : {0} qui appelle {1} avec la signature {2}
msg.not.java.obj =\
L''argument attendu pour la fonction getClass() doit \u00EAtre un objet Java
msg.no.java.ctor =\
Le constructeur Java de "{0}" avec les arguments "{1}" est introuvable
msg.method.ambiguous =\
Le choix de la m\u00E9thode Java {0}.{1} correspondant aux types d''argument JavaScript ({2}) est ambigu. Les m\u00E9thodes propos\u00E9es sont les suivantes : {3}
msg.constructor.ambiguous =\
Le choix du constructeur Java {0} correspondant aux types d''argument JavaScript ({1}) est ambigu. Les constructeurs propos\u00E9s sont les suivants : {2}
msg.conversion.not.allowed =\
Impossible de convertir {0} en {1}
msg.not.classloader =\
Le constructeur de "Packages" attend un argument de type java.lang.Classloader
msg.bad.quant =\
Le quantificateur {0} est incorrect
msg.overlarge.max =\
Le maximum {0} est trop important
msg.zero.quant =\
Le quantificateur {0} est nul
msg.max.lt.min =\
Le maximum {0} est inf\u00E9rieur au minimum
msg.unterm.quant =\
Le quantificateur {0} n''a pas de limite
msg.unterm.paren =\
Les parenth\u00E8ses {0} n''ont pas de limite
msg.unterm.class =\
La classe de caract\u00E8res {0} n''a pas de limite
msg.bad.range =\
La classe de caract\u00E8res contient une plage de valeurs incorrecte
msg.trail.backslash =\
\\ au d\u00E9but d''une expression r\u00E9guli\u00E8re
msg.no.regexp =\
Les expressions r\u00E9guli\u00E8res ne sont pas disponibles
msg.bad.backref =\
la r\u00E9f\u00E9rence ant\u00E9rieure d\u00E9passe le nombre de parenth\u00E8ses de capture
msg.dup.label =\
Le libell\u00E9 {0} existe d\u00E9j\u00E0
msg.undef.label =\
Le libell\u00E9 {0} n''est pas d\u00E9fini
msg.bad.break =\
Le saut non libell\u00E9 doit se trouver dans la boucle ou dans l''aiguillage
msg.continue.outside =\
continue doit se trouver dans la boucle
msg.continue.nonloop =\
Il n''est possible de continuer que dans l''instruction d''it\u00E9ration libell\u00E9e
msg.fn.redecl =\
La fonction "{0}" a \u00E9t\u00E9 de nouveau d\u00E9clar\u00E9e. La d\u00E9finition pr\u00E9c\u00E9dente sera ignor\u00E9e
msg.no.paren.parms =\
il manque ''('' avant les param\u00E8tres de la fonction
msg.no.parm =\
il manque un param\u00E8tre de forme
msg.no.paren.after.parms =\
il manque '')'' apr\u00E8s les param\u00E8tres de forme
msg.no.brace.body =\
il manque '{' avant le corps d''une fonction
msg.no.brace.after.body =\
il manque ''}'' apr\u00E8s le corps d''une fonction
msg.no.paren.cond =\
il manque ''('' avant une condition
msg.no.paren.after.cond =\
il manque '')'' apr\u00E8s une condition
msg.no.semi.stmt =\
il manque '';'' avant une instruction
msg.no.name.after.dot =\
il manque un nom apr\u00E8s un op\u00E9rateur ''.''
msg.no.bracket.index =\
il manque '']'' dans l''expression de l''indice
msg.no.paren.switch =\
il manque ''('' avant l''expression d''un aiguillage
msg.no.paren.after.switch =\
il manque '')'' apr\u00E8s l''expression d''un aiguillage
msg.no.brace.switch =\
il manque '{' avant le corps d''un aiguillage
msg.bad.switch =\
l''instruction d''aiguillage est incorrecte
msg.no.colon.case =\
il manque '':'' apr\u00E8s l''expression d''un cas
msg.no.while.do =\
il manque ''while'' apr\u00E8s le corps d''une boucle do-loop
msg.no.paren.for =\
il manque ''('' apr\u00E8s for
msg.no.semi.for =\
Il manque '';'' apr\u00E8s l''initialiseur for-loop
msg.no.semi.for.cond =\
il manque '';'' apr\u00E8s la condition for-loop
msg.no.paren.for.ctrl =\
il manque '')'' apr\u00E8s le contrôle for-loop
msg.no.paren.with =\
il manque ''('' avant un objet with-statement
msg.no.paren.after.with =\
il manque '')'' apr\u00E8s un objet with-statement
msg.bad.return =\
la valeur renvoy\u00E9e est incorrecte
msg.no.brace.block =\
il manque ''}'' dans une instruction compos\u00E9e
msg.bad.label =\
le libell\u00E9 est incorrect
msg.bad.var =\
il manque un nom de variable
msg.bad.var.init =\
l''initialisation de la variable est incorrecte
msg.no.colon.cond =\
il manque '':'' dans une expression conditionnelle
msg.no.paren.arg =\
il manque '')'' apr\u00E8s une liste d''arguments
msg.no.bracket.arg =\
il manque '']'' apr\u00E8s une liste d''\u00E9l\u00E9ments
msg.bad.prop =\
l''identifiant de propri\u00E9t\u00E9 est incorrect
msg.no.colon.prop =\
il manque '':'' apr\u00E8s un identifiant de propri\u00E9t\u00E9
msg.no.brace.prop =\
il manque ''}'' apr\u00E8s une liste de propri\u00E9t\u00E9s
msg.no.paren =\
il manque '')'' dans des parenth\u00E8ses
msg.reserved.id =\
l''identifiant est un mot r\u00E9serv\u00E9
msg.no.paren.catch =\
il manque ''('' avant une condition catch-block
msg.bad.catchcond =\
la condition catch-block est incorrecte
msg.catch.unreachable =\
aucune clause catch suivant une interception non qualifi\u00E9e ne peut \u00EAtre atteinte
msg.no.brace.catchblock =\
il manque '{' avant le corps catch-block
msg.try.no.catchfinally =\
''try'' a \u00E9t\u00E9 d\u00E9tect\u00E9 sans ''catch'' ni ''finally''
msg.syntax =\
erreur de syntaxe
msg.assn.create =\
Une variable va \u00EAtre cr\u00E9\u00E9e en raison de l''affectation \u00E0 un ''{0}'' non d\u00E9fini. Ajoutez une instruction de variable \u00E0 la port\u00E9e sup\u00E9rieure pour que cet avertissement ne soit plus affich\u00E9
msg.prop.not.found =\
La propri\u00E9t\u00E9 est introuvable
msg.invalid.type =\
Valeur JavaScript de type {0} incorrecte
msg.primitive.expected =\
Un type primitif \u00E9tait attendu (et non {0})
msg.null.to.object =\
Il est impossible de convertir la valeur null en objet
msg.undef.to.object =\
Il est impossible de convertir une valeur non d\u00E9finie en objet
msg.cyclic.value =\
La valeur cyclique {0} n''est pas autoris\u00E9e
msg.is.not.defined =\
"{0}" n''est pas d\u00E9fini
msg.isnt.function =\
{0} n''est pas une fonction, est un {1}
msg.bad.default.value =\
La m\u00E9thode getDefaultValue() de l''objet a renvoy\u00E9 un objet
msg.instanceof.not.object =\
Il est impossible d''utiliser une instance d''un \u00E9l\u00E9ment autre qu''un objet
msg.instanceof.bad.prototype =\
La propri\u00E9t\u00E9 ''prototype'' de {0} n''est pas un objet
msg.bad.radix =\
la base {0} n''est pas autoris\u00E9e
msg.default.value =\
La valeur par d\u00E9faut de l''objet est introuvable
msg.zero.arg.ctor =\
Il est impossible de charger la classe "{0}", qui ne poss\u00E8de pas de constructeur de param\u00E8tre z\u00E9ro
msg.multiple.ctors =\
Les m\u00E9thodes {0} et {1} ont \u00E9t\u00E9 d\u00E9tect\u00E9es alors qu''il est impossible d''utiliser plusieurs m\u00E9thodes constructor
msg.ctor.multiple.parms =\
Il est impossible de d\u00E9finir le constructeur ou la classe {0} car plusieurs constructeurs poss\u00E8dent plusieurs param\u00E8tres
msg.extend.scriptable =\
{0} doit \u00E9tendre ScriptableObject afin de d\u00E9finir la propri\u00E9t\u00E9 {1}
msg.bad.getter.parms =\
Pour d\u00E9finir une propri\u00E9t\u00E9, la m\u00E9thode d''obtention {0} doit avoir des param\u00E8tres z\u00E9ro ou un seul param\u00E8tre ScriptableObject
msg.obj.getter.parms =\
La m\u00E9thode d''obtention statique ou d\u00E9l\u00E9gu\u00E9e {0} doit utiliser un param\u00E8tre ScriptableObject
msg.getter.static =\
La m\u00E9thode d''obtention et la m\u00E9thode de d\u00E9finition doivent toutes deux avoir le m\u00EAme \u00E9tat (statique ou non)
msg.setter2.parms =\
La m\u00E9thode de d\u00E9finition \u00E0 deux param\u00E8tres doit utiliser un param\u00E8tre ScriptableObject comme premier param\u00E8tre
msg.setter1.parms =\
Une m\u00E9thode d''obtention \u00E0 param\u00E8tre unique est attendue pour {0}
msg.setter2.expected =\
La m\u00E9thode de d\u00E9finition statique ou d\u00E9l\u00E9gu\u00E9e {0} doit utiliser deux param\u00E8tres
msg.setter.parms =\
Un ou deux param\u00E8tres sont attendus pour la m\u00E9thode de d\u00E9finition
msg.add.sealed =\
Il est impossible d''ajouter une propri\u00E9t\u00E9 \u00E0 un objet ferm\u00E9
msg.remove.sealed =\
Il est impossible de supprimer une propri\u00E9t\u00E9 d''un objet ferm\u00E9
msg.token.replaces.pushback =\
le jeton de non-obtention {0} remplace le jeton de renvoi {1}
msg.missing.exponent =\
il manque un exposant
msg.caught.nfe =\
erreur de format de nombre : {0}
msg.unterminated.string.lit =\
le litt\u00E9ral de la cha\u00EEne n''a pas de limite
msg.unterminated.comment =\
le commentaire n''a pas de limite
msg.unterminated.re.lit =\
le litt\u00E9ral de l''expression r\u00E9guli\u00E8re n''a pas de limite
msg.invalid.re.flag =\
une expression r\u00E9guli\u00E8re est suivie d''un indicateur incorrect
msg.no.re.input.for =\
il n''y a pas d''entr\u00E9e pour {0}
msg.illegal.character =\
caract\u00E8re non autoris\u00E9
msg.invalid.escape =\
la s\u00E9quence d''\u00E9chappement Unicode est incorrecte
msg.bad.octal.literal =\
le chiffre octal du litt\u00E9ral, {0}, n''est pas autoris\u00E9 et sera interpr\u00E9t\u00E9 comme un chiffre d\u00E9cimal
msg.reserved.keyword =\
l''utilisation du futur mot-cl\u00E9 r\u00E9serv\u00E9 {0} n''est pas autoris\u00E9e et celui-ci sera interpr\u00E9t\u00E9 comme un identifiant ordinaire
msg.undefined =\
La valeur non d\u00E9finie ne poss\u00E8de pas de propri\u00E9t\u00E9
msg.java.internal.field.type =\
Erreur interne : la conversion de type de {0} afin d''affecter {1} \u00E0 {2} a \u00E9chou\u00E9
msg.java.conversion.implicit_method =\
La m\u00E9thode de conversion "{0}" est introuvable dans la classe {1}
sg.java.method.assign =\
La m\u00E9thode Java "{0}" ne peut pas \u00EAtre affect\u00E9e \u00E0
msg.java.internal.private =\
Erreur interne : une tentative d''acc\u00E9der \u00E0 un champ "{0}" priv\u00E9/prot\u00E9g\u00E9 a \u00E9t\u00E9 d\u00E9tect\u00E9e
msg.java.no_such_method =\
La m\u00E9thode ''{0}'' est introuvable
msg.script.is.not.constructor =\
Les objets Script ne sont pas des constructeurs
msg.nonjava.method =\
La m\u00E9thode Java "{0}" a \u00E9t\u00E9 appel\u00E9e avec une valeur ''this'' qui n''est pas un objet Java
msg.java.member.not.found =\
La classe Java "{0}" ne poss\u00E8de aucun champ ou aucune m\u00E9thode d''instance publique appel\u00E9 "{1}"
msg.java.array.index.out.of.bounds =\
Array index {0} is out of bounds [0..{1}].
msg.pkg.int =\
Les noms de package Java ne peuvent pas \u00EAtre des nombres
msg.ambig.import =\
Importation ambigu\u00EB : "{0}" et "{1}"
msg.not.pkg =\
La fonction importPackage doit \u00EAtre appel\u00E9e avec un package et non avec "{0}"
msg.not.class =\
La fonction importClass doit \u00EAtre appel\u00E9e avec une classe et non avec "{0}"
msg.prop.defined =\
Il est impossible d''importer "{0}" car une propri\u00E9t\u00E9 portant le m\u00EAme nom a d\u00E9j\u00E0 \u00E9t\u00E9 d\u00E9finie
sg.arraylength.bad =\
La longueur du tableau n''est pas appropri\u00E9e
msg.bad.uri =\
La s\u00E9quence URI n''est pas form\u00E9e correctement
msg.bad.precision =\
La pr\u00E9cision {0} ne se trouve pas dans la plage de valeurs
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/optimizer/ 0000755 0001750 0001750 00000000000 11530107756 024750 5 ustar cavedon cavedon htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/optimizer/OptRuntime.java 0000644 0001750 0001750 00000026133 11111044312 027705 0 ustar cavedon cavedon /* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-2000
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
* Roger Lawrence
* Hannes Wallnoefer
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript.optimizer;
import org.mozilla.javascript.*;
public final class OptRuntime extends ScriptRuntime
{
public static final Double zeroObj = new Double(0.0);
public static final Double oneObj = new Double(1.0);
public static final Double minusOneObj = new Double(-1.0);
/**
* Implement ....() call shrinking optimizer code.
*/
public static Object call0(Callable fun, Scriptable thisObj,
Context cx, Scriptable scope)
{
return fun.call(cx, scope, thisObj, ScriptRuntime.emptyArgs);
}
/**
* Implement ....(arg) call shrinking optimizer code.
*/
public static Object call1(Callable fun, Scriptable thisObj, Object arg0,
Context cx, Scriptable scope)
{
return fun.call(cx, scope, thisObj, new Object[] { arg0 } );
}
/**
* Implement ....(arg0, arg1) call shrinking optimizer code.
*/
public static Object call2(Callable fun, Scriptable thisObj,
Object arg0, Object arg1,
Context cx, Scriptable scope)
{
return fun.call(cx, scope, thisObj, new Object[] { arg0, arg1 });
}
/**
* Implement ....(arg0, arg1, ...) call shrinking optimizer code.
*/
public static Object callN(Callable fun, Scriptable thisObj,
Object[] args,
Context cx, Scriptable scope)
{
return fun.call(cx, scope, thisObj, args);
}
/**
* Implement name(args) call shrinking optimizer code.
*/
public static Object callName(Object[] args, String name,
Context cx, Scriptable scope)
{
Callable f = getNameFunctionAndThis(name, cx, scope);
Scriptable thisObj = lastStoredScriptable(cx);
return f.call(cx, scope, thisObj, args);
}
/**
* Implement name() call shrinking optimizer code.
*/
public static Object callName0(String name,
Context cx, Scriptable scope)
{
Callable f = getNameFunctionAndThis(name, cx, scope);
Scriptable thisObj = lastStoredScriptable(cx);
return f.call(cx, scope, thisObj, ScriptRuntime.emptyArgs);
}
/**
* Implement x.property() call shrinking optimizer code.
*/
public static Object callProp0(Object value, String property,
Context cx, Scriptable scope)
{
Callable f = getPropFunctionAndThis(value, property, cx, scope);
Scriptable thisObj = lastStoredScriptable(cx);
return f.call(cx, scope, thisObj, ScriptRuntime.emptyArgs);
}
public static Object add(Object val1, double val2)
{
if (val1 instanceof Scriptable)
val1 = ((Scriptable) val1).getDefaultValue(null);
if (!(val1 instanceof String))
return wrapDouble(toNumber(val1) + val2);
return ((String)val1).concat(toString(val2));
}
public static Object add(double val1, Object val2)
{
if (val2 instanceof Scriptable)
val2 = ((Scriptable) val2).getDefaultValue(null);
if (!(val2 instanceof String))
return wrapDouble(toNumber(val2) + val1);
return toString(val1).concat((String)val2);
}
public static Object elemIncrDecr(Object obj, double index,
Context cx, int incrDecrMask)
{
return ScriptRuntime.elemIncrDecr(obj, new Double(index), cx,
incrDecrMask);
}
public static Object[] padStart(Object[] currentArgs, int count) {
Object[] result = new Object[currentArgs.length + count];
System.arraycopy(currentArgs, 0, result, count, currentArgs.length);
return result;
}
public static void initFunction(NativeFunction fn, int functionType,
Scriptable scope, Context cx)
{
ScriptRuntime.initFunction(cx, scope, fn, functionType, false);
}
public static Object callSpecial(Context cx, Callable fun,
Scriptable thisObj, Object[] args,
Scriptable scope,
Scriptable callerThis, int callType,
String fileName, int lineNumber)
{
return ScriptRuntime.callSpecial(cx, fun, thisObj, args, scope,
callerThis, callType,
fileName, lineNumber);
}
public static Object newObjectSpecial(Context cx, Object fun,
Object[] args, Scriptable scope,
Scriptable callerThis, int callType)
{
return ScriptRuntime.newSpecial(cx, fun, args, scope, callType);
}
public static Double wrapDouble(double num)
{
if (num == 0.0) {
if (1 / num > 0) {
// +0.0
return zeroObj;
}
} else if (num == 1.0) {
return oneObj;
} else if (num == -1.0) {
return minusOneObj;
} else if (num != num) {
return NaNobj;
}
return new Double(num);
}
static String encodeIntArray(int[] array)
{
// XXX: this extremely inefficient for small integers
if (array == null) { return null; }
int n = array.length;
char[] buffer = new char[1 + n * 2];
buffer[0] = 1;
for (int i = 0; i != n; ++i) {
int value = array[i];
int shift = 1 + i * 2;
buffer[shift] = (char)(value >>> 16);
buffer[shift + 1] = (char)value;
}
return new String(buffer);
}
private static int[] decodeIntArray(String str, int arraySize)
{
// XXX: this extremely inefficient for small integers
if (arraySize == 0) {
if (str != null) throw new IllegalArgumentException();
return null;
}
if (str.length() != 1 + arraySize * 2 && str.charAt(0) != 1) {
throw new IllegalArgumentException();
}
int[] array = new int[arraySize];
for (int i = 0; i != arraySize; ++i) {
int shift = 1 + i * 2;
array[i] = (str.charAt(shift) << 16) | str.charAt(shift + 1);
}
return array;
}
public static Scriptable newArrayLiteral(Object[] objects,
String encodedInts,
int skipCount,
Context cx,
Scriptable scope)
{
int[] skipIndexces = decodeIntArray(encodedInts, skipCount);
return newArrayLiteral(objects, skipIndexces, cx, scope);
}
public static void main(final Script script, final String[] args)
{
ContextFactory.getGlobal().call(new ContextAction() {
public Object run(Context cx)
{
ScriptableObject global = getGlobal(cx);
// get the command line arguments and define "arguments"
// array in the top-level object
Object[] argsCopy = new Object[args.length];
System.arraycopy(args, 0, argsCopy, 0, args.length);
Scriptable argsObj = cx.newArray(global, argsCopy);
global.defineProperty("arguments", argsObj,
ScriptableObject.DONTENUM);
script.exec(cx, global);
return null;
}
});
}
public static void throwStopIteration(Object obj) {
throw new JavaScriptException(
NativeIterator.getStopIterationObject((Scriptable)obj), "", 0);
}
public static Scriptable createNativeGenerator(NativeFunction funObj,
Scriptable scope,
Scriptable thisObj,
int maxLocals,
int maxStack)
{
return new NativeGenerator(scope, funObj,
new GeneratorState(thisObj, maxLocals, maxStack));
}
public static Object[] getGeneratorStackState(Object obj) {
GeneratorState rgs = (GeneratorState) obj;
if (rgs.stackState == null)
rgs.stackState = new Object[rgs.maxStack];
return rgs.stackState;
}
public static Object[] getGeneratorLocalsState(Object obj) {
GeneratorState rgs = (GeneratorState) obj;
if (rgs.localsState == null)
rgs.localsState = new Object[rgs.maxLocals];
return rgs.localsState;
}
public static class GeneratorState {
static final String CLASS_NAME =
"org/mozilla/javascript/optimizer/OptRuntime$GeneratorState";
public int resumptionPoint;
static final String resumptionPoint_NAME = "resumptionPoint";
static final String resumptionPoint_TYPE = "I";
public Scriptable thisObj;
static final String thisObj_NAME = "thisObj";
static final String thisObj_TYPE =
"Lorg/mozilla/javascript/Scriptable;";
Object[] stackState;
Object[] localsState;
int maxLocals;
int maxStack;
GeneratorState(Scriptable thisObj, int maxLocals, int maxStack) {
this.thisObj = thisObj;
this.maxLocals = maxLocals;
this.maxStack = maxStack;
}
}
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/optimizer/Optimizer.java 0000644 0001750 0001750 00000051275 11321335670 027603 0 ustar cavedon cavedon /* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
* Roger Lawrence
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript.optimizer;
import org.mozilla.javascript.*;
import org.mozilla.javascript.ast.ScriptNode;
class Optimizer
{
static final int NoType = 0;
static final int NumberType = 1;
static final int AnyType = 3;
// It is assumed that (NumberType | AnyType) == AnyType
void optimize(ScriptNode scriptOrFn)
{
// run on one function at a time for now
int functionCount = scriptOrFn.getFunctionCount();
for (int i = 0; i != functionCount; ++i) {
OptFunctionNode f = OptFunctionNode.get(scriptOrFn, i);
optimizeFunction(f);
}
}
private void optimizeFunction(OptFunctionNode theFunction)
{
if (theFunction.fnode.requiresActivation()) return;
inDirectCallFunction = theFunction.isTargetOfDirectCall();
this.theFunction = theFunction;
ObjArray statementsArray = new ObjArray();
buildStatementList_r(theFunction.fnode, statementsArray);
Node[] theStatementNodes = new Node[statementsArray.size()];
statementsArray.toArray(theStatementNodes);
Block.runFlowAnalyzes(theFunction, theStatementNodes);
if (!theFunction.fnode.requiresActivation()) {
/*
* Now that we know which local vars are in fact always
* Numbers, we re-write the tree to take advantage of
* that. Any arithmetic or assignment op involving just
* Number typed vars is marked so that the codegen will
* generate non-object code.
*/
parameterUsedInNumberContext = false;
for (int i = 0; i < theStatementNodes.length; i++) {
rewriteForNumberVariables(theStatementNodes[i], NumberType);
}
theFunction.setParameterNumberContext(parameterUsedInNumberContext);
}
}
/*
Each directCall parameter is passed as a pair of values - an object
and a double. The value passed depends on the type of value available at
the call site. If a double is available, the object in java/lang/Void.TYPE
is passed as the object value, and if an object value is available, then
0.0 is passed as the double value.
The receiving routine always tests the object value before proceeding.
If the parameter is being accessed in a 'Number Context' then the code
sequence is :
if ("parameter_objectValue" == java/lang/Void.TYPE)
...fine..., use the parameter_doubleValue
else
toNumber(parameter_objectValue)
and if the parameter is being referenced in an Object context, the code is
if ("parameter_objectValue" == java/lang/Void.TYPE)
new Double(parameter_doubleValue)
else
...fine..., use the parameter_objectValue
If the receiving code never uses the doubleValue, it is converted on
entry to a Double instead.
*/
/*
We're referencing a node in a Number context (i.e. we'd prefer it
was a double value). If the node is a parameter in a directCall
function, mark it as being referenced in this context.
*/
private void markDCPNumberContext(Node n)
{
if (inDirectCallFunction && n.getType() == Token.GETVAR) {
int varIndex = theFunction.getVarIndex(n);
if (theFunction.isParameter(varIndex)) {
parameterUsedInNumberContext = true;
}
}
}
private boolean convertParameter(Node n)
{
if (inDirectCallFunction && n.getType() == Token.GETVAR) {
int varIndex = theFunction.getVarIndex(n);
if (theFunction.isParameter(varIndex)) {
n.removeProp(Node.ISNUMBER_PROP);
return true;
}
}
return false;
}
private int rewriteForNumberVariables(Node n, int desired)
{
switch (n.getType()) {
case Token.EXPR_VOID : {
Node child = n.getFirstChild();
int type = rewriteForNumberVariables(child, NumberType);
if (type == NumberType)
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
return NoType;
}
case Token.NUMBER :
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
return NumberType;
case Token.GETVAR :
{
int varIndex = theFunction.getVarIndex(n);
if (inDirectCallFunction
&& theFunction.isParameter(varIndex)
&& desired == NumberType)
{
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
return NumberType;
}
else if (theFunction.isNumberVar(varIndex)) {
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
return NumberType;
}
return NoType;
}
case Token.INC :
case Token.DEC : {
Node child = n.getFirstChild();
// "child" will be GETVAR or GETPROP or GETELEM
if (child.getType() == Token.GETVAR) {
if (rewriteForNumberVariables(child, NumberType) == NumberType &&
!convertParameter(child))
{
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
markDCPNumberContext(child);
return NumberType;
}
return NoType;
}
else if (child.getType() == Token.GETELEM) {
return rewriteForNumberVariables(child, NumberType);
}
return NoType;
}
case Token.SETVAR : {
Node lChild = n.getFirstChild();
Node rChild = lChild.getNext();
int rType = rewriteForNumberVariables(rChild, NumberType);
int varIndex = theFunction.getVarIndex(n);
if (inDirectCallFunction
&& theFunction.isParameter(varIndex))
{
if (rType == NumberType) {
if (!convertParameter(rChild)) {
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
return NumberType;
}
markDCPNumberContext(rChild);
return NoType;
}
else
return rType;
}
else if (theFunction.isNumberVar(varIndex)) {
if (rType != NumberType) {
n.removeChild(rChild);
n.addChildToBack(
new Node(Token.TO_DOUBLE, rChild));
}
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
markDCPNumberContext(rChild);
return NumberType;
}
else {
if (rType == NumberType) {
if (!convertParameter(rChild)) {
n.removeChild(rChild);
n.addChildToBack(
new Node(Token.TO_OBJECT, rChild));
}
}
return NoType;
}
}
case Token.LE :
case Token.LT :
case Token.GE :
case Token.GT : {
Node lChild = n.getFirstChild();
Node rChild = lChild.getNext();
int lType = rewriteForNumberVariables(lChild, NumberType);
int rType = rewriteForNumberVariables(rChild, NumberType);
markDCPNumberContext(lChild);
markDCPNumberContext(rChild);
if (convertParameter(lChild)) {
if (convertParameter(rChild)) {
return NoType;
} else if (rType == NumberType) {
n.putIntProp(Node.ISNUMBER_PROP, Node.RIGHT);
}
}
else if (convertParameter(rChild)) {
if (lType == NumberType) {
n.putIntProp(Node.ISNUMBER_PROP, Node.LEFT);
}
}
else {
if (lType == NumberType) {
if (rType == NumberType) {
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
}
else {
n.putIntProp(Node.ISNUMBER_PROP, Node.LEFT);
}
}
else {
if (rType == NumberType) {
n.putIntProp(Node.ISNUMBER_PROP, Node.RIGHT);
}
}
}
// we actually build a boolean value
return NoType;
}
case Token.ADD : {
Node lChild = n.getFirstChild();
Node rChild = lChild.getNext();
int lType = rewriteForNumberVariables(lChild, NumberType);
int rType = rewriteForNumberVariables(rChild, NumberType);
if (convertParameter(lChild)) {
if (convertParameter(rChild)) {
return NoType;
}
else {
if (rType == NumberType) {
n.putIntProp(Node.ISNUMBER_PROP, Node.RIGHT);
}
}
}
else {
if (convertParameter(rChild)) {
if (lType == NumberType) {
n.putIntProp(Node.ISNUMBER_PROP, Node.LEFT);
}
}
else {
if (lType == NumberType) {
if (rType == NumberType) {
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
return NumberType;
}
else {
n.putIntProp(Node.ISNUMBER_PROP, Node.LEFT);
}
}
else {
if (rType == NumberType) {
n.putIntProp(Node.ISNUMBER_PROP,
Node.RIGHT);
}
}
}
}
return NoType;
}
case Token.BITXOR :
case Token.BITOR :
case Token.BITAND :
case Token.RSH :
case Token.LSH :
case Token.SUB :
case Token.MUL :
case Token.DIV :
case Token.MOD : {
Node lChild = n.getFirstChild();
Node rChild = lChild.getNext();
int lType = rewriteForNumberVariables(lChild, NumberType);
int rType = rewriteForNumberVariables(rChild, NumberType);
markDCPNumberContext(lChild);
markDCPNumberContext(rChild);
if (lType == NumberType) {
if (rType == NumberType) {
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
return NumberType;
}
else {
if (!convertParameter(rChild)) {
n.removeChild(rChild);
n.addChildToBack(
new Node(Token.TO_DOUBLE, rChild));
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
}
return NumberType;
}
}
else {
if (rType == NumberType) {
if (!convertParameter(lChild)) {
n.removeChild(lChild);
n.addChildToFront(
new Node(Token.TO_DOUBLE, lChild));
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
}
return NumberType;
}
else {
if (!convertParameter(lChild)) {
n.removeChild(lChild);
n.addChildToFront(
new Node(Token.TO_DOUBLE, lChild));
}
if (!convertParameter(rChild)) {
n.removeChild(rChild);
n.addChildToBack(
new Node(Token.TO_DOUBLE, rChild));
}
n.putIntProp(Node.ISNUMBER_PROP, Node.BOTH);
return NumberType;
}
}
}
case Token.SETELEM :
case Token.SETELEM_OP : {
Node arrayBase = n.getFirstChild();
Node arrayIndex = arrayBase.getNext();
Node rValue = arrayIndex.getNext();
int baseType = rewriteForNumberVariables(arrayBase, NumberType);
if (baseType == NumberType) {// can never happen ???
if (!convertParameter(arrayBase)) {
n.removeChild(arrayBase);
n.addChildToFront(
new Node(Token.TO_OBJECT, arrayBase));
}
}
int indexType = rewriteForNumberVariables(arrayIndex, NumberType);
if (indexType == NumberType) {
if (!convertParameter(arrayIndex)) {
// setting the ISNUMBER_PROP signals the codegen
// to use the OptRuntime.setObjectIndex that takes
// a double index
n.putIntProp(Node.ISNUMBER_PROP, Node.LEFT);
}
}
int rValueType = rewriteForNumberVariables(rValue, NumberType);
if (rValueType == NumberType) {
if (!convertParameter(rValue)) {
n.removeChild(rValue);
n.addChildToBack(
new Node(Token.TO_OBJECT, rValue));
}
}
return NoType;
}
case Token.GETELEM : {
Node arrayBase = n.getFirstChild();
Node arrayIndex = arrayBase.getNext();
int baseType = rewriteForNumberVariables(arrayBase, NumberType);
if (baseType == NumberType) {// can never happen ???
if (!convertParameter(arrayBase)) {
n.removeChild(arrayBase);
n.addChildToFront(
new Node(Token.TO_OBJECT, arrayBase));
}
}
int indexType = rewriteForNumberVariables(arrayIndex, NumberType);
if (indexType == NumberType) {
if (!convertParameter(arrayIndex)) {
// setting the ISNUMBER_PROP signals the codegen
// to use the OptRuntime.getObjectIndex that takes
// a double index
n.putIntProp(Node.ISNUMBER_PROP, Node.RIGHT);
}
}
return NoType;
}
case Token.CALL :
{
Node child = n.getFirstChild(); // the function node
// must be an object
rewriteAsObjectChildren(child, child.getFirstChild());
child = child.getNext(); // the first arg
OptFunctionNode target
= (OptFunctionNode)n.getProp(Node.DIRECTCALL_PROP);
if (target != null) {
/*
we leave each child as a Number if it can be. The codegen will
handle moving the pairs of parameters.
*/
while (child != null) {
int type = rewriteForNumberVariables(child, NumberType);
if (type == NumberType) {
markDCPNumberContext(child);
}
child = child.getNext();
}
} else {
rewriteAsObjectChildren(n, child);
}
return NoType;
}
default : {
rewriteAsObjectChildren(n, n.getFirstChild());
return NoType;
}
}
}
private void rewriteAsObjectChildren(Node n, Node child)
{
// Force optimized children to be objects
while (child != null) {
Node nextChild = child.getNext();
int type = rewriteForNumberVariables(child, NoType);
if (type == NumberType) {
if (!convertParameter(child)) {
n.removeChild(child);
Node nuChild = new Node(Token.TO_OBJECT, child);
if (nextChild == null)
n.addChildToBack(nuChild);
else
n.addChildBefore(nuChild, nextChild);
}
}
child = nextChild;
}
}
private static void buildStatementList_r(Node node, ObjArray statements)
{
int type = node.getType();
if (type == Token.BLOCK
|| type == Token.LOCAL_BLOCK
|| type == Token.LOOP
|| type == Token.FUNCTION)
{
Node child = node.getFirstChild();
while (child != null) {
buildStatementList_r(child, statements);
child = child.getNext();
}
} else {
statements.add(node);
}
}
private boolean inDirectCallFunction;
OptFunctionNode theFunction;
private boolean parameterUsedInNumberContext;
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/optimizer/OptTransformer.java 0000644 0001750 0001750 00000011565 11222455466 030612 0 ustar cavedon cavedon /* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
* Roger Lawrence
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript.optimizer;
import org.mozilla.javascript.*;
import org.mozilla.javascript.ast.ScriptNode;
import java.util.Map;
/**
* This class performs node transforms to prepare for optimization.
*
* @see NodeTransformer
* @author Norris Boyd
*/
class OptTransformer extends NodeTransformer {
OptTransformer(Map possibleDirectCalls, ObjArray directCallTargets)
{
this.possibleDirectCalls = possibleDirectCalls;
this.directCallTargets = directCallTargets;
}
@Override
protected void visitNew(Node node, ScriptNode tree) {
detectDirectCall(node, tree);
super.visitNew(node, tree);
}
@Override
protected void visitCall(Node node, ScriptNode tree) {
detectDirectCall(node, tree);
super.visitCall(node, tree);
}
private void detectDirectCall(Node node, ScriptNode tree)
{
if (tree.getType() == Token.FUNCTION) {
Node left = node.getFirstChild();
// count the arguments
int argCount = 0;
Node arg = left.getNext();
while (arg != null) {
arg = arg.getNext();
argCount++;
}
if (argCount == 0) {
OptFunctionNode.get(tree).itsContainsCalls0 = true;
}
/*
* Optimize a call site by converting call("a", b, c) into :
*
* FunctionObjectFor"a" <-- instance variable init'd by constructor
*
* // this is a DIRECTCALL node
* fn = GetProp(tmp = GetBase("a"), "a");
* if (fn == FunctionObjectFor"a")
* fn.call(tmp, b, c)
* else
* ScriptRuntime.Call(fn, tmp, b, c)
*/
if (possibleDirectCalls != null) {
String targetName = null;
if (left.getType() == Token.NAME) {
targetName = left.getString();
} else if (left.getType() == Token.GETPROP) {
targetName = left.getFirstChild().getNext().getString();
} else if (left.getType() == Token.GETPROPNOWARN) {
throw Kit.codeBug();
}
if (targetName != null) {
OptFunctionNode ofn;
ofn = possibleDirectCalls.get(targetName);
if (ofn != null
&& argCount == ofn.fnode.getParamCount()
&& !ofn.fnode.requiresActivation())
{
// Refuse to directCall any function with more
// than 32 parameters - prevent code explosion
// for wacky test cases
if (argCount <= 32) {
node.putProp(Node.DIRECTCALL_PROP, ofn);
if (!ofn.isTargetOfDirectCall()) {
int index = directCallTargets.size();
directCallTargets.add(ofn);
ofn.setDirectTargetIndex(index);
}
}
}
}
}
}
}
private Map possibleDirectCalls;
private ObjArray directCallTargets;
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/optimizer/ClassCompiler.java 0000644 0001750 0001750 00000017274 11222455466 030370 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-2000
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Igor Bukanov
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript.optimizer;
import org.mozilla.javascript.*;
import org.mozilla.javascript.ast.AstRoot;
import org.mozilla.javascript.ast.FunctionNode;
import org.mozilla.javascript.ast.ScriptNode;
/**
* Generates class files from script sources.
*
* since 1.5 Release 5
* @author Igor Bukanov
*/
public class ClassCompiler
{
/**
* Construct ClassCompiler that uses the specified compiler environment
* when generating classes.
*/
public ClassCompiler(CompilerEnvirons compilerEnv)
{
if (compilerEnv == null) throw new IllegalArgumentException();
this.compilerEnv = compilerEnv;
this.mainMethodClassName = Codegen.DEFAULT_MAIN_METHOD_CLASS;
}
/**
* Set the class name to use for main method implementation.
* The class must have a method matching
* public static void main(Script sc, String[] args), it will be
* called when main(String[] args) is called in the generated
* class. The class name should be fully qulified name and include the
* package name like in org.foo.Bar.
*/
public void setMainMethodClass(String className)
{
// XXX Should this check for a valid class name?
mainMethodClassName = className;
}
/**
* Get the name of the class for main method implementation.
* @see #setMainMethodClass(String)
*/
public String getMainMethodClass()
{
return mainMethodClassName;
}
/**
* Get the compiler environment the compiler uses.
*/
public CompilerEnvirons getCompilerEnv()
{
return compilerEnv;
}
/**
* Get the class that the generated target will extend.
*/
public Class getTargetExtends()
{
return targetExtends;
}
/**
* Set the class that the generated target will extend.
*
* @param extendsClass the class it extends
*/
public void setTargetExtends(Class extendsClass)
{
targetExtends = extendsClass;
}
/**
* Get the interfaces that the generated target will implement.
*/
public Class[] getTargetImplements()
{
return targetImplements == null ? null : (Class[])targetImplements.clone();
}
/**
* Set the interfaces that the generated target will implement.
*
* @param implementsClasses an array of Class objects, one for each
* interface the target will extend
*/
public void setTargetImplements(Class[] implementsClasses)
{
targetImplements = implementsClasses == null ? null : (Class[])implementsClasses.clone();
}
/**
* Build class name for a auxiliary class generated by compiler.
* If the compiler needs to generate extra classes beyond the main class,
* it will call this function to build the auxiliary class name.
* The default implementation simply appends auxMarker to mainClassName
* but this can be overridden.
*/
protected String makeAuxiliaryClassName(String mainClassName,
String auxMarker)
{
return mainClassName+auxMarker;
}
/**
* Compile JavaScript source into one or more Java class files.
* The first compiled class will have name mainClassName.
* If the results of {@link #getTargetExtends()} or
* {@link #getTargetImplements()} are not null, then the first compiled
* class will extend the specified super class and implement
* specified interfaces.
*
* @return array where elements with even indexes specifies class name
* and the following odd index gives class file body as byte[]
* array. The initial element of the array always holds
* mainClassName and array[1] holds its byte code.
*/
public Object[] compileToClassFiles(String source,
String sourceLocation,
int lineno,
String mainClassName)
{
Parser p = new Parser(compilerEnv);
AstRoot ast = p.parse(source, sourceLocation, lineno);
IRFactory irf = new IRFactory(compilerEnv);
ScriptNode tree = irf.transformTree(ast);
// release reference to original parse tree & parser
irf = null;
ast = null;
p = null;
Class superClass = getTargetExtends();
Class[] interfaces = getTargetImplements();
String scriptClassName;
boolean isPrimary = (interfaces == null && superClass == null);
if (isPrimary) {
scriptClassName = mainClassName;
} else {
scriptClassName = makeAuxiliaryClassName(mainClassName, "1");
}
Codegen codegen = new Codegen();
codegen.setMainMethodClass(mainMethodClassName);
byte[] scriptClassBytes
= codegen.compileToClassFile(compilerEnv, scriptClassName,
tree, tree.getEncodedSource(),
false);
if (isPrimary) {
return new Object[] { scriptClassName, scriptClassBytes };
}
int functionCount = tree.getFunctionCount();
ObjToIntMap functionNames = new ObjToIntMap(functionCount);
for (int i = 0; i != functionCount; ++i) {
FunctionNode ofn = tree.getFunctionNode(i);
String name = ofn.getName();
if (name != null && name.length() != 0) {
functionNames.put(name, ofn.getParamCount());
}
}
if (superClass == null) {
superClass = ScriptRuntime.ObjectClass;
}
byte[] mainClassBytes
= JavaAdapter.createAdapterCode(
functionNames, mainClassName,
superClass, interfaces, scriptClassName);
return new Object[] { mainClassName, mainClassBytes,
scriptClassName, scriptClassBytes };
}
private String mainMethodClassName;
private CompilerEnvirons compilerEnv;
private Class targetExtends;
private Class[] targetImplements;
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/optimizer/Codegen.java 0000644 0001750 0001750 00000572770 11321335670 027175 0 ustar cavedon cavedon /* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-2000
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
* Kemal Bayram
* Igor Bukanov
* Bob Jervis
* Roger Lawrence
* Andi Vajda
* Hannes Wallnoefer
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript.optimizer;
import org.mozilla.javascript.*;
import org.mozilla.javascript.ast.FunctionNode;
import org.mozilla.javascript.ast.Jump;
import org.mozilla.javascript.ast.Name;
import org.mozilla.javascript.ast.ScriptNode;
import org.mozilla.classfile.*;
import java.util.*;
import java.lang.reflect.Constructor;
/**
* This class generates code for a given IR tree.
*
* @author Norris Boyd
* @author Roger Lawrence
*/
public class Codegen implements Evaluator
{
public void captureStackInfo(RhinoException ex) {
throw new UnsupportedOperationException();
}
public String getSourcePositionFromStack(Context cx, int[] linep) {
throw new UnsupportedOperationException();
}
public String getPatchedStack(RhinoException ex, String nativeStackTrace) {
throw new UnsupportedOperationException();
}
public List getScriptStack(RhinoException ex) {
throw new UnsupportedOperationException();
}
public void setEvalScriptFlag(Script script) {
throw new UnsupportedOperationException();
}
public Object compile(CompilerEnvirons compilerEnv,
ScriptNode tree,
String encodedSource,
boolean returnFunction)
{
int serial;
synchronized (globalLock) {
serial = ++globalSerialClassCounter;
}
String baseName = "c";
if (tree.getSourceName().length() > 0) {
baseName = tree.getSourceName().replaceAll("\\W", "_");
if (!Character.isJavaIdentifierStart(baseName.charAt(0))) {
baseName = "_" + baseName;
}
}
String mainClassName = "org.mozilla.javascript.gen." + baseName + "_" + serial;
byte[] mainClassBytes = compileToClassFile(compilerEnv, mainClassName,
tree, encodedSource,
returnFunction);
return new Object[] { mainClassName, mainClassBytes };
}
public Script createScriptObject(Object bytecode,
Object staticSecurityDomain)
{
Class cl = defineClass(bytecode, staticSecurityDomain);
Script script;
try {
script = (Script)cl.newInstance();
} catch (Exception ex) {
throw new RuntimeException
("Unable to instantiate compiled class:"+ex.toString());
}
return script;
}
public Function createFunctionObject(Context cx, Scriptable scope,
Object bytecode,
Object staticSecurityDomain)
{
Class cl = defineClass(bytecode, staticSecurityDomain);
NativeFunction f;
try {
Constructorctor = cl.getConstructors()[0];
Object[] initArgs = { scope, cx, Integer.valueOf(0) };
f = (NativeFunction)ctor.newInstance(initArgs);
} catch (Exception ex) {
throw new RuntimeException
("Unable to instantiate compiled class:"+ex.toString());
}
return f;
}
private Class defineClass(Object bytecode,
Object staticSecurityDomain)
{
Object[] nameBytesPair = (Object[])bytecode;
String className = (String)nameBytesPair[0];
byte[] classBytes = (byte[])nameBytesPair[1];
// The generated classes in this case refer only to Rhino classes
// which must be accessible through this class loader
ClassLoader rhinoLoader = getClass().getClassLoader();
GeneratedClassLoader loader;
loader = SecurityController.createLoader(rhinoLoader,
staticSecurityDomain);
Exception e;
try {
Class cl = loader.defineClass(className, classBytes);
loader.linkClass(cl);
return cl;
} catch (SecurityException x) {
e = x;
} catch (IllegalArgumentException x) {
e = x;
}
throw new RuntimeException("Malformed optimizer package " + e);
}
byte[] compileToClassFile(CompilerEnvirons compilerEnv,
String mainClassName,
ScriptNode scriptOrFn,
String encodedSource,
boolean returnFunction)
{
this.compilerEnv = compilerEnv;
transform(scriptOrFn);
if (Token.printTrees) {
System.out.println(scriptOrFn.toStringTree(scriptOrFn));
}
if (returnFunction) {
scriptOrFn = scriptOrFn.getFunctionNode(0);
}
initScriptNodesData(scriptOrFn);
this.mainClassName = mainClassName;
this.mainClassSignature
= ClassFileWriter.classNameToSignature(mainClassName);
try {
return generateCode(encodedSource);
} catch (ClassFileWriter.ClassFileFormatException e) {
throw reportClassFileFormatException(scriptOrFn, e.getMessage());
}
}
private RuntimeException reportClassFileFormatException(
ScriptNode scriptOrFn,
String message)
{
String msg = scriptOrFn instanceof FunctionNode
? ScriptRuntime.getMessage2("msg.while.compiling.fn",
((FunctionNode)scriptOrFn).getFunctionName(), message)
: ScriptRuntime.getMessage1("msg.while.compiling.script", message);
return Context.reportRuntimeError(msg, scriptOrFn.getSourceName(),
scriptOrFn.getLineno(), null, 0);
}
private void transform(ScriptNode tree)
{
initOptFunctions_r(tree);
int optLevel = compilerEnv.getOptimizationLevel();
Map possibleDirectCalls = null;
if (optLevel > 0) {
/*
* Collect all of the contained functions into a hashtable
* so that the call optimizer can access the class name & parameter
* count for any call it encounters
*/
if (tree.getType() == Token.SCRIPT) {
int functionCount = tree.getFunctionCount();
for (int i = 0; i != functionCount; ++i) {
OptFunctionNode ofn = OptFunctionNode.get(tree, i);
if (ofn.fnode.getFunctionType()
== FunctionNode.FUNCTION_STATEMENT)
{
String name = ofn.fnode.getName();
if (name.length() != 0) {
if (possibleDirectCalls == null) {
possibleDirectCalls = new HashMap();
}
possibleDirectCalls.put(name, ofn);
}
}
}
}
}
if (possibleDirectCalls != null) {
directCallTargets = new ObjArray();
}
OptTransformer ot = new OptTransformer(possibleDirectCalls,
directCallTargets);
ot.transform(tree);
if (optLevel > 0) {
(new Optimizer()).optimize(tree);
}
}
private static void initOptFunctions_r(ScriptNode scriptOrFn)
{
for (int i = 0, N = scriptOrFn.getFunctionCount(); i != N; ++i) {
FunctionNode fn = scriptOrFn.getFunctionNode(i);
new OptFunctionNode(fn);
initOptFunctions_r(fn);
}
}
private void initScriptNodesData(ScriptNode scriptOrFn)
{
ObjArray x = new ObjArray();
collectScriptNodes_r(scriptOrFn, x);
int count = x.size();
scriptOrFnNodes = new ScriptNode[count];
x.toArray(scriptOrFnNodes);
scriptOrFnIndexes = new ObjToIntMap(count);
for (int i = 0; i != count; ++i) {
scriptOrFnIndexes.put(scriptOrFnNodes[i], i);
}
}
private static void collectScriptNodes_r(ScriptNode n,
ObjArray x)
{
x.add(n);
int nestedCount = n.getFunctionCount();
for (int i = 0; i != nestedCount; ++i) {
collectScriptNodes_r(n.getFunctionNode(i), x);
}
}
private byte[] generateCode(String encodedSource)
{
boolean hasScript = (scriptOrFnNodes[0].getType() == Token.SCRIPT);
boolean hasFunctions = (scriptOrFnNodes.length > 1 || !hasScript);
String sourceFile = null;
if (compilerEnv.isGenerateDebugInfo()) {
sourceFile = scriptOrFnNodes[0].getSourceName();
}
ClassFileWriter cfw = new ClassFileWriter(mainClassName,
SUPER_CLASS_NAME,
sourceFile);
cfw.addField(ID_FIELD_NAME, "I",
ClassFileWriter.ACC_PRIVATE);
cfw.addField(DIRECT_CALL_PARENT_FIELD, mainClassSignature,
ClassFileWriter.ACC_PRIVATE);
cfw.addField(REGEXP_ARRAY_FIELD_NAME, REGEXP_ARRAY_FIELD_TYPE,
ClassFileWriter.ACC_PRIVATE);
if (hasFunctions) {
generateFunctionConstructor(cfw);
}
if (hasScript) {
cfw.addInterface("org/mozilla/javascript/Script");
generateScriptCtor(cfw);
generateMain(cfw);
generateExecute(cfw);
}
generateCallMethod(cfw);
generateResumeGenerator(cfw);
generateNativeFunctionOverrides(cfw, encodedSource);
int count = scriptOrFnNodes.length;
for (int i = 0; i != count; ++i) {
ScriptNode n = scriptOrFnNodes[i];
BodyCodegen bodygen = new BodyCodegen();
bodygen.cfw = cfw;
bodygen.codegen = this;
bodygen.compilerEnv = compilerEnv;
bodygen.scriptOrFn = n;
bodygen.scriptOrFnIndex = i;
try {
bodygen.generateBodyCode();
} catch (ClassFileWriter.ClassFileFormatException e) {
throw reportClassFileFormatException(n, e.getMessage());
}
if (n.getType() == Token.FUNCTION) {
OptFunctionNode ofn = OptFunctionNode.get(n);
generateFunctionInit(cfw, ofn);
if (ofn.isTargetOfDirectCall()) {
emitDirectConstructor(cfw, ofn);
}
}
}
if (directCallTargets != null) {
int N = directCallTargets.size();
for (int j = 0; j != N; ++j) {
cfw.addField(getDirectTargetFieldName(j),
mainClassSignature,
ClassFileWriter.ACC_PRIVATE);
}
}
emitRegExpInit(cfw);
emitConstantDudeInitializers(cfw);
return cfw.toByteArray();
}
private void emitDirectConstructor(ClassFileWriter cfw,
OptFunctionNode ofn)
{
/*
we generate ..
Scriptable directConstruct() {
Scriptable newInstance = createObject(cx, scope);
Object val = (cx, scope, newInstance, );
if (val instanceof Scriptable) {
return (Scriptable) val;
}
return newInstance;
}
*/
cfw.startMethod(getDirectCtorName(ofn.fnode),
getBodyMethodSignature(ofn.fnode),
(short)(ClassFileWriter.ACC_STATIC
| ClassFileWriter.ACC_PRIVATE));
int argCount = ofn.fnode.getParamCount();
int firstLocal = (4 + argCount * 3) + 1;
cfw.addALoad(0); // this
cfw.addALoad(1); // cx
cfw.addALoad(2); // scope
cfw.addInvoke(ByteCode.INVOKEVIRTUAL,
"org/mozilla/javascript/BaseFunction",
"createObject",
"(Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Lorg/mozilla/javascript/Scriptable;");
cfw.addAStore(firstLocal);
cfw.addALoad(0);
cfw.addALoad(1);
cfw.addALoad(2);
cfw.addALoad(firstLocal);
for (int i = 0; i < argCount; i++) {
cfw.addALoad(4 + (i * 3));
cfw.addDLoad(5 + (i * 3));
}
cfw.addALoad(4 + argCount * 3);
cfw.addInvoke(ByteCode.INVOKESTATIC,
mainClassName,
getBodyMethodName(ofn.fnode),
getBodyMethodSignature(ofn.fnode));
int exitLabel = cfw.acquireLabel();
cfw.add(ByteCode.DUP); // make a copy of direct call result
cfw.add(ByteCode.INSTANCEOF, "org/mozilla/javascript/Scriptable");
cfw.add(ByteCode.IFEQ, exitLabel);
// cast direct call result
cfw.add(ByteCode.CHECKCAST, "org/mozilla/javascript/Scriptable");
cfw.add(ByteCode.ARETURN);
cfw.markLabel(exitLabel);
cfw.addALoad(firstLocal);
cfw.add(ByteCode.ARETURN);
cfw.stopMethod((short)(firstLocal + 1));
}
static boolean isGenerator(ScriptNode node)
{
return (node.getType() == Token.FUNCTION ) &&
((FunctionNode)node).isGenerator();
}
// How dispatch to generators works:
// Two methods are generated corresponding to a user-written generator.
// One of these creates a generator object (NativeGenerator), which is
// returned to the user. The other method contains all of the body code
// of the generator.
// When a user calls a generator, the call() method dispatches control to
// to the method that creates the NativeGenerator object. Subsequently when
// the user invokes .next(), .send() or any such method on the generator
// object, the resumeGenerator() below dispatches the call to the
// method corresponding to the generator body. As a matter of convention
// the generator body is given the name of the generator activation function
// appended by "_gen".
private void generateResumeGenerator(ClassFileWriter cfw)
{
boolean hasGenerators = false;
for (int i=0; i < scriptOrFnNodes.length; i++) {
if (isGenerator(scriptOrFnNodes[i]))
hasGenerators = true;
}
// if there are no generators defined, we don't implement a
// resumeGenerator(). The base class provides a default implementation.
if (!hasGenerators)
return;
cfw.startMethod("resumeGenerator",
"(Lorg/mozilla/javascript/Context;" +
"Lorg/mozilla/javascript/Scriptable;" +
"ILjava/lang/Object;" +
"Ljava/lang/Object;)Ljava/lang/Object;",
(short)(ClassFileWriter.ACC_PUBLIC
| ClassFileWriter.ACC_FINAL));
// load arguments for dispatch to the corresponding *_gen method
cfw.addALoad(0);
cfw.addALoad(1);
cfw.addALoad(2);
cfw.addALoad(4);
cfw.addALoad(5);
cfw.addILoad(3);
cfw.addLoadThis();
cfw.add(ByteCode.GETFIELD, cfw.getClassName(), ID_FIELD_NAME, "I");
int startSwitch = cfw.addTableSwitch(0, scriptOrFnNodes.length - 1);
cfw.markTableSwitchDefault(startSwitch);
int endlabel = cfw.acquireLabel();
for (int i = 0; i < scriptOrFnNodes.length; i++) {
ScriptNode n = scriptOrFnNodes[i];
cfw.markTableSwitchCase(startSwitch, i, (short)6);
if (isGenerator(n)) {
String type = "(" +
mainClassSignature +
"Lorg/mozilla/javascript/Context;" +
"Lorg/mozilla/javascript/Scriptable;" +
"Ljava/lang/Object;" +
"Ljava/lang/Object;I)Ljava/lang/Object;";
cfw.addInvoke(ByteCode.INVOKESTATIC,
mainClassName,
getBodyMethodName(n) + "_gen",
type);
cfw.add(ByteCode.ARETURN);
} else {
cfw.add(ByteCode.GOTO, endlabel);
}
}
cfw.markLabel(endlabel);
pushUndefined(cfw);
cfw.add(ByteCode.ARETURN);
// this method uses as many locals as there are arguments (hence 6)
cfw.stopMethod((short)6);
}
private void generateCallMethod(ClassFileWriter cfw)
{
cfw.startMethod("call",
"(Lorg/mozilla/javascript/Context;" +
"Lorg/mozilla/javascript/Scriptable;" +
"Lorg/mozilla/javascript/Scriptable;" +
"[Ljava/lang/Object;)Ljava/lang/Object;",
(short)(ClassFileWriter.ACC_PUBLIC
| ClassFileWriter.ACC_FINAL));
// Generate code for:
// if (!ScriptRuntime.hasTopCall(cx)) {
// return ScriptRuntime.doTopCall(this, cx, scope, thisObj, args);
// }
int nonTopCallLabel = cfw.acquireLabel();
cfw.addALoad(1); //cx
cfw.addInvoke(ByteCode.INVOKESTATIC,
"org/mozilla/javascript/ScriptRuntime",
"hasTopCall",
"(Lorg/mozilla/javascript/Context;"
+")Z");
cfw.add(ByteCode.IFNE, nonTopCallLabel);
cfw.addALoad(0);
cfw.addALoad(1);
cfw.addALoad(2);
cfw.addALoad(3);
cfw.addALoad(4);
cfw.addInvoke(ByteCode.INVOKESTATIC,
"org/mozilla/javascript/ScriptRuntime",
"doTopCall",
"(Lorg/mozilla/javascript/Callable;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"[Ljava/lang/Object;"
+")Ljava/lang/Object;");
cfw.add(ByteCode.ARETURN);
cfw.markLabel(nonTopCallLabel);
// Now generate switch to call the real methods
cfw.addALoad(0);
cfw.addALoad(1);
cfw.addALoad(2);
cfw.addALoad(3);
cfw.addALoad(4);
int end = scriptOrFnNodes.length;
boolean generateSwitch = (2 <= end);
int switchStart = 0;
int switchStackTop = 0;
if (generateSwitch) {
cfw.addLoadThis();
cfw.add(ByteCode.GETFIELD, cfw.getClassName(), ID_FIELD_NAME, "I");
// do switch from (1, end - 1) mapping 0 to
// the default case
switchStart = cfw.addTableSwitch(1, end - 1);
}
for (int i = 0; i != end; ++i) {
ScriptNode n = scriptOrFnNodes[i];
if (generateSwitch) {
if (i == 0) {
cfw.markTableSwitchDefault(switchStart);
switchStackTop = cfw.getStackTop();
} else {
cfw.markTableSwitchCase(switchStart, i - 1,
switchStackTop);
}
}
if (n.getType() == Token.FUNCTION) {
OptFunctionNode ofn = OptFunctionNode.get(n);
if (ofn.isTargetOfDirectCall()) {
int pcount = ofn.fnode.getParamCount();
if (pcount != 0) {
// loop invariant:
// stack top == arguments array from addALoad4()
for (int p = 0; p != pcount; ++p) {
cfw.add(ByteCode.ARRAYLENGTH);
cfw.addPush(p);
int undefArg = cfw.acquireLabel();
int beyond = cfw.acquireLabel();
cfw.add(ByteCode.IF_ICMPLE, undefArg);
// get array[p]
cfw.addALoad(4);
cfw.addPush(p);
cfw.add(ByteCode.AALOAD);
cfw.add(ByteCode.GOTO, beyond);
cfw.markLabel(undefArg);
pushUndefined(cfw);
cfw.markLabel(beyond);
// Only one push
cfw.adjustStackTop(-1);
cfw.addPush(0.0);
// restore invariant
cfw.addALoad(4);
}
}
}
}
cfw.addInvoke(ByteCode.INVOKESTATIC,
mainClassName,
getBodyMethodName(n),
getBodyMethodSignature(n));
cfw.add(ByteCode.ARETURN);
}
cfw.stopMethod((short)5);
// 5: this, cx, scope, js this, args[]
}
private void generateMain(ClassFileWriter cfw)
{
cfw.startMethod("main", "([Ljava/lang/String;)V",
(short)(ClassFileWriter.ACC_PUBLIC
| ClassFileWriter.ACC_STATIC));
// load new ScriptImpl()
cfw.add(ByteCode.NEW, cfw.getClassName());
cfw.add(ByteCode.DUP);
cfw.addInvoke(ByteCode.INVOKESPECIAL, cfw.getClassName(),
"", "()V");
// load 'args'
cfw.add(ByteCode.ALOAD_0);
// Call mainMethodClass.main(Script script, String[] args)
cfw.addInvoke(ByteCode.INVOKESTATIC,
mainMethodClass,
"main",
"(Lorg/mozilla/javascript/Script;[Ljava/lang/String;)V");
cfw.add(ByteCode.RETURN);
// 1 = String[] args
cfw.stopMethod((short)1);
}
private void generateExecute(ClassFileWriter cfw)
{
cfw.startMethod("exec",
"(Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Ljava/lang/Object;",
(short)(ClassFileWriter.ACC_PUBLIC
| ClassFileWriter.ACC_FINAL));
final int CONTEXT_ARG = 1;
final int SCOPE_ARG = 2;
cfw.addLoadThis();
cfw.addALoad(CONTEXT_ARG);
cfw.addALoad(SCOPE_ARG);
cfw.add(ByteCode.DUP);
cfw.add(ByteCode.ACONST_NULL);
cfw.addInvoke(ByteCode.INVOKEVIRTUAL,
cfw.getClassName(),
"call",
"(Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"[Ljava/lang/Object;"
+")Ljava/lang/Object;");
cfw.add(ByteCode.ARETURN);
// 3 = this + context + scope
cfw.stopMethod((short)3);
}
private void generateScriptCtor(ClassFileWriter cfw)
{
cfw.startMethod("", "()V", ClassFileWriter.ACC_PUBLIC);
cfw.addLoadThis();
cfw.addInvoke(ByteCode.INVOKESPECIAL, SUPER_CLASS_NAME,
"", "()V");
// set id to 0
cfw.addLoadThis();
cfw.addPush(0);
cfw.add(ByteCode.PUTFIELD, cfw.getClassName(), ID_FIELD_NAME, "I");
cfw.add(ByteCode.RETURN);
// 1 parameter = this
cfw.stopMethod((short)1);
}
private void generateFunctionConstructor(ClassFileWriter cfw)
{
final int SCOPE_ARG = 1;
final int CONTEXT_ARG = 2;
final int ID_ARG = 3;
cfw.startMethod("", FUNCTION_CONSTRUCTOR_SIGNATURE,
ClassFileWriter.ACC_PUBLIC);
cfw.addALoad(0);
cfw.addInvoke(ByteCode.INVOKESPECIAL, SUPER_CLASS_NAME,
"", "()V");
cfw.addLoadThis();
cfw.addILoad(ID_ARG);
cfw.add(ByteCode.PUTFIELD, cfw.getClassName(), ID_FIELD_NAME, "I");
cfw.addLoadThis();
cfw.addALoad(CONTEXT_ARG);
cfw.addALoad(SCOPE_ARG);
int start = (scriptOrFnNodes[0].getType() == Token.SCRIPT) ? 1 : 0;
int end = scriptOrFnNodes.length;
if (start == end) throw badTree();
boolean generateSwitch = (2 <= end - start);
int switchStart = 0;
int switchStackTop = 0;
if (generateSwitch) {
cfw.addILoad(ID_ARG);
// do switch from (start + 1, end - 1) mapping start to
// the default case
switchStart = cfw.addTableSwitch(start + 1, end - 1);
}
for (int i = start; i != end; ++i) {
if (generateSwitch) {
if (i == start) {
cfw.markTableSwitchDefault(switchStart);
switchStackTop = cfw.getStackTop();
} else {
cfw.markTableSwitchCase(switchStart, i - 1 - start,
switchStackTop);
}
}
OptFunctionNode ofn = OptFunctionNode.get(scriptOrFnNodes[i]);
cfw.addInvoke(ByteCode.INVOKEVIRTUAL,
mainClassName,
getFunctionInitMethodName(ofn),
FUNCTION_INIT_SIGNATURE);
cfw.add(ByteCode.RETURN);
}
// 4 = this + scope + context + id
cfw.stopMethod((short)4);
}
private void generateFunctionInit(ClassFileWriter cfw,
OptFunctionNode ofn)
{
final int CONTEXT_ARG = 1;
final int SCOPE_ARG = 2;
cfw.startMethod(getFunctionInitMethodName(ofn),
FUNCTION_INIT_SIGNATURE,
(short)(ClassFileWriter.ACC_PRIVATE
| ClassFileWriter.ACC_FINAL));
// Call NativeFunction.initScriptFunction
cfw.addLoadThis();
cfw.addALoad(CONTEXT_ARG);
cfw.addALoad(SCOPE_ARG);
cfw.addInvoke(ByteCode.INVOKEVIRTUAL,
"org/mozilla/javascript/NativeFunction",
"initScriptFunction",
"(Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")V");
// precompile all regexp literals
int regexpCount = ofn.fnode.getRegexpCount();
if (regexpCount != 0) {
cfw.addLoadThis();
pushRegExpArray(cfw, ofn.fnode, CONTEXT_ARG, SCOPE_ARG);
cfw.add(ByteCode.PUTFIELD, mainClassName,
REGEXP_ARRAY_FIELD_NAME, REGEXP_ARRAY_FIELD_TYPE);
}
cfw.add(ByteCode.RETURN);
// 3 = (scriptThis/functionRef) + scope + context
cfw.stopMethod((short)3);
}
private void generateNativeFunctionOverrides(ClassFileWriter cfw,
String encodedSource)
{
// Override NativeFunction.getLanguageVersion() with
// public int getLanguageVersion() { return ; }
cfw.startMethod("getLanguageVersion", "()I",
ClassFileWriter.ACC_PUBLIC);
cfw.addPush(compilerEnv.getLanguageVersion());
cfw.add(ByteCode.IRETURN);
// 1: this and no argument or locals
cfw.stopMethod((short)1);
// The rest of NativeFunction overrides require specific code for each
// script/function id
final int Do_getFunctionName = 0;
final int Do_getParamCount = 1;
final int Do_getParamAndVarCount = 2;
final int Do_getParamOrVarName = 3;
final int Do_getEncodedSource = 4;
final int Do_getParamOrVarConst = 5;
final int SWITCH_COUNT = 6;
for (int methodIndex = 0; methodIndex != SWITCH_COUNT; ++methodIndex) {
if (methodIndex == Do_getEncodedSource && encodedSource == null) {
continue;
}
// Generate:
// prologue;
// switch over function id to implement function-specific action
// epilogue
short methodLocals;
switch (methodIndex) {
case Do_getFunctionName:
methodLocals = 1; // Only this
cfw.startMethod("getFunctionName", "()Ljava/lang/String;",
ClassFileWriter.ACC_PUBLIC);
break;
case Do_getParamCount:
methodLocals = 1; // Only this
cfw.startMethod("getParamCount", "()I",
ClassFileWriter.ACC_PUBLIC);
break;
case Do_getParamAndVarCount:
methodLocals = 1; // Only this
cfw.startMethod("getParamAndVarCount", "()I",
ClassFileWriter.ACC_PUBLIC);
break;
case Do_getParamOrVarName:
methodLocals = 1 + 1; // this + paramOrVarIndex
cfw.startMethod("getParamOrVarName", "(I)Ljava/lang/String;",
ClassFileWriter.ACC_PUBLIC);
break;
case Do_getParamOrVarConst:
methodLocals = 1 + 1 + 1; // this + paramOrVarName
cfw.startMethod("getParamOrVarConst", "(I)Z",
ClassFileWriter.ACC_PUBLIC);
break;
case Do_getEncodedSource:
methodLocals = 1; // Only this
cfw.startMethod("getEncodedSource", "()Ljava/lang/String;",
ClassFileWriter.ACC_PUBLIC);
cfw.addPush(encodedSource);
break;
default:
throw Kit.codeBug();
}
int count = scriptOrFnNodes.length;
int switchStart = 0;
int switchStackTop = 0;
if (count > 1) {
// Generate switch but only if there is more then one
// script/function
cfw.addLoadThis();
cfw.add(ByteCode.GETFIELD, cfw.getClassName(),
ID_FIELD_NAME, "I");
// do switch from 1 .. count - 1 mapping 0 to the default case
switchStart = cfw.addTableSwitch(1, count - 1);
}
for (int i = 0; i != count; ++i) {
ScriptNode n = scriptOrFnNodes[i];
if (i == 0) {
if (count > 1) {
cfw.markTableSwitchDefault(switchStart);
switchStackTop = cfw.getStackTop();
}
} else {
cfw.markTableSwitchCase(switchStart, i - 1,
switchStackTop);
}
// Impelemnet method-specific switch code
switch (methodIndex) {
case Do_getFunctionName:
// Push function name
if (n.getType() == Token.SCRIPT) {
cfw.addPush("");
} else {
String name = ((FunctionNode)n).getName();
cfw.addPush(name);
}
cfw.add(ByteCode.ARETURN);
break;
case Do_getParamCount:
// Push number of defined parameters
cfw.addPush(n.getParamCount());
cfw.add(ByteCode.IRETURN);
break;
case Do_getParamAndVarCount:
// Push number of defined parameters and declared variables
cfw.addPush(n.getParamAndVarCount());
cfw.add(ByteCode.IRETURN);
break;
case Do_getParamOrVarName:
// Push name of parameter using another switch
// over paramAndVarCount
int paramAndVarCount = n.getParamAndVarCount();
if (paramAndVarCount == 0) {
// The runtime should never call the method in this
// case but to make bytecode verifier happy return null
// as throwing execption takes more code
cfw.add(ByteCode.ACONST_NULL);
cfw.add(ByteCode.ARETURN);
} else if (paramAndVarCount == 1) {
// As above do not check for valid index but always
// return the name of the first param
cfw.addPush(n.getParamOrVarName(0));
cfw.add(ByteCode.ARETURN);
} else {
// Do switch over getParamOrVarName
cfw.addILoad(1); // param or var index
// do switch from 1 .. paramAndVarCount - 1 mapping 0
// to the default case
int paramSwitchStart = cfw.addTableSwitch(
1, paramAndVarCount - 1);
for (int j = 0; j != paramAndVarCount; ++j) {
if (cfw.getStackTop() != 0) Kit.codeBug();
String s = n.getParamOrVarName(j);
if (j == 0) {
cfw.markTableSwitchDefault(paramSwitchStart);
} else {
cfw.markTableSwitchCase(paramSwitchStart, j - 1,
0);
}
cfw.addPush(s);
cfw.add(ByteCode.ARETURN);
}
}
break;
case Do_getParamOrVarConst:
// Push name of parameter using another switch
// over paramAndVarCount
paramAndVarCount = n.getParamAndVarCount();
boolean [] constness = n.getParamAndVarConst();
if (paramAndVarCount == 0) {
// The runtime should never call the method in this
// case but to make bytecode verifier happy return null
// as throwing execption takes more code
cfw.add(ByteCode.ICONST_0);
cfw.add(ByteCode.IRETURN);
} else if (paramAndVarCount == 1) {
// As above do not check for valid index but always
// return the name of the first param
cfw.addPush(constness[0]);
cfw.add(ByteCode.IRETURN);
} else {
// Do switch over getParamOrVarName
cfw.addILoad(1); // param or var index
// do switch from 1 .. paramAndVarCount - 1 mapping 0
// to the default case
int paramSwitchStart = cfw.addTableSwitch(
1, paramAndVarCount - 1);
for (int j = 0; j != paramAndVarCount; ++j) {
if (cfw.getStackTop() != 0) Kit.codeBug();
if (j == 0) {
cfw.markTableSwitchDefault(paramSwitchStart);
} else {
cfw.markTableSwitchCase(paramSwitchStart, j - 1,
0);
}
cfw.addPush(constness[j]);
cfw.add(ByteCode.IRETURN);
}
}
break;
case Do_getEncodedSource:
// Push number encoded source start and end
// to prepare for encodedSource.substring(start, end)
cfw.addPush(n.getEncodedSourceStart());
cfw.addPush(n.getEncodedSourceEnd());
cfw.addInvoke(ByteCode.INVOKEVIRTUAL,
"java/lang/String",
"substring",
"(II)Ljava/lang/String;");
cfw.add(ByteCode.ARETURN);
break;
default:
throw Kit.codeBug();
}
}
cfw.stopMethod(methodLocals);
}
}
private void emitRegExpInit(ClassFileWriter cfw)
{
// precompile all regexp literals
int totalRegCount = 0;
for (int i = 0; i != scriptOrFnNodes.length; ++i) {
totalRegCount += scriptOrFnNodes[i].getRegexpCount();
}
if (totalRegCount == 0) {
return;
}
cfw.startMethod(REGEXP_INIT_METHOD_NAME, REGEXP_INIT_METHOD_SIGNATURE,
(short)(ClassFileWriter.ACC_STATIC | ClassFileWriter.ACC_PRIVATE
| ClassFileWriter.ACC_SYNCHRONIZED));
cfw.addField("_reInitDone", "Z",
(short)(ClassFileWriter.ACC_STATIC
| ClassFileWriter.ACC_PRIVATE));
cfw.add(ByteCode.GETSTATIC, mainClassName, "_reInitDone", "Z");
int doInit = cfw.acquireLabel();
cfw.add(ByteCode.IFEQ, doInit);
cfw.add(ByteCode.RETURN);
cfw.markLabel(doInit);
for (int i = 0; i != scriptOrFnNodes.length; ++i) {
ScriptNode n = scriptOrFnNodes[i];
int regCount = n.getRegexpCount();
for (int j = 0; j != regCount; ++j) {
String reFieldName = getCompiledRegexpName(n, j);
String reFieldType = "Ljava/lang/Object;";
String reString = n.getRegexpString(j);
String reFlags = n.getRegexpFlags(j);
cfw.addField(reFieldName, reFieldType,
(short)(ClassFileWriter.ACC_STATIC
| ClassFileWriter.ACC_PRIVATE));
cfw.addALoad(0); // proxy
cfw.addALoad(1); // context
cfw.addPush(reString);
if (reFlags == null) {
cfw.add(ByteCode.ACONST_NULL);
} else {
cfw.addPush(reFlags);
}
cfw.addInvoke(ByteCode.INVOKEINTERFACE,
"org/mozilla/javascript/RegExpProxy",
"compileRegExp",
"(Lorg/mozilla/javascript/Context;"
+"Ljava/lang/String;Ljava/lang/String;"
+")Ljava/lang/Object;");
cfw.add(ByteCode.PUTSTATIC, mainClassName,
reFieldName, reFieldType);
}
}
cfw.addPush(1);
cfw.add(ByteCode.PUTSTATIC, mainClassName, "_reInitDone", "Z");
cfw.add(ByteCode.RETURN);
cfw.stopMethod((short)2);
}
private void emitConstantDudeInitializers(ClassFileWriter cfw)
{
int N = itsConstantListSize;
if (N == 0)
return;
cfw.startMethod("", "()V",
(short)(ClassFileWriter.ACC_STATIC | ClassFileWriter.ACC_FINAL));
double[] array = itsConstantList;
for (int i = 0; i != N; ++i) {
double num = array[i];
String constantName = "_k" + i;
String constantType = getStaticConstantWrapperType(num);
cfw.addField(constantName, constantType,
(short)(ClassFileWriter.ACC_STATIC
| ClassFileWriter.ACC_PRIVATE));
int inum = (int)num;
if (inum == num) {
cfw.add(ByteCode.NEW, "java/lang/Integer");
cfw.add(ByteCode.DUP);
cfw.addPush(inum);
cfw.addInvoke(ByteCode.INVOKESPECIAL, "java/lang/Integer",
"", "(I)V");
} else {
cfw.addPush(num);
addDoubleWrap(cfw);
}
cfw.add(ByteCode.PUTSTATIC, mainClassName,
constantName, constantType);
}
cfw.add(ByteCode.RETURN);
cfw.stopMethod((short)0);
}
void pushRegExpArray(ClassFileWriter cfw, ScriptNode n,
int contextArg, int scopeArg)
{
int regexpCount = n.getRegexpCount();
if (regexpCount == 0) throw badTree();
cfw.addPush(regexpCount);
cfw.add(ByteCode.ANEWARRAY, "java/lang/Object");
cfw.addALoad(contextArg);
cfw.addInvoke(ByteCode.INVOKESTATIC,
"org/mozilla/javascript/ScriptRuntime",
"checkRegExpProxy",
"(Lorg/mozilla/javascript/Context;"
+")Lorg/mozilla/javascript/RegExpProxy;");
// Stack: proxy, array
cfw.add(ByteCode.DUP);
cfw.addALoad(contextArg);
cfw.addInvoke(ByteCode.INVOKESTATIC, mainClassName,
REGEXP_INIT_METHOD_NAME, REGEXP_INIT_METHOD_SIGNATURE);
for (int i = 0; i != regexpCount; ++i) {
// Stack: proxy, array
cfw.add(ByteCode.DUP2);
cfw.addALoad(contextArg);
cfw.addALoad(scopeArg);
cfw.add(ByteCode.GETSTATIC, mainClassName,
getCompiledRegexpName(n, i), "Ljava/lang/Object;");
// Stack: compiledRegExp, scope, cx, proxy, array, proxy, array
cfw.addInvoke(ByteCode.INVOKEINTERFACE,
"org/mozilla/javascript/RegExpProxy",
"wrapRegExp",
"(Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/Object;"
+")Lorg/mozilla/javascript/Scriptable;");
// Stack: wrappedRegExp, array, proxy, array
cfw.addPush(i);
cfw.add(ByteCode.SWAP);
cfw.add(ByteCode.AASTORE);
// Stack: proxy, array
}
// remove proxy
cfw.add(ByteCode.POP);
}
void pushNumberAsObject(ClassFileWriter cfw, double num)
{
if (num == 0.0) {
if (1 / num > 0) {
// +0.0
cfw.add(ByteCode.GETSTATIC,
"org/mozilla/javascript/optimizer/OptRuntime",
"zeroObj", "Ljava/lang/Double;");
} else {
cfw.addPush(num);
addDoubleWrap(cfw);
}
} else if (num == 1.0) {
cfw.add(ByteCode.GETSTATIC,
"org/mozilla/javascript/optimizer/OptRuntime",
"oneObj", "Ljava/lang/Double;");
return;
} else if (num == -1.0) {
cfw.add(ByteCode.GETSTATIC,
"org/mozilla/javascript/optimizer/OptRuntime",
"minusOneObj", "Ljava/lang/Double;");
} else if (num != num) {
cfw.add(ByteCode.GETSTATIC,
"org/mozilla/javascript/ScriptRuntime",
"NaNobj", "Ljava/lang/Double;");
} else if (itsConstantListSize >= 2000) {
// There appears to be a limit in the JVM on either the number
// of static fields in a class or the size of the class
// initializer. Either way, we can't have any more than 2000
// statically init'd constants.
cfw.addPush(num);
addDoubleWrap(cfw);
} else {
int N = itsConstantListSize;
int index = 0;
if (N == 0) {
itsConstantList = new double[64];
} else {
double[] array = itsConstantList;
while (index != N && array[index] != num) {
++index;
}
if (N == array.length) {
array = new double[N * 2];
System.arraycopy(itsConstantList, 0, array, 0, N);
itsConstantList = array;
}
}
if (index == N) {
itsConstantList[N] = num;
itsConstantListSize = N + 1;
}
String constantName = "_k" + index;
String constantType = getStaticConstantWrapperType(num);
cfw.add(ByteCode.GETSTATIC, mainClassName,
constantName, constantType);
}
}
private static void addDoubleWrap(ClassFileWriter cfw)
{
cfw.addInvoke(ByteCode.INVOKESTATIC,
"org/mozilla/javascript/optimizer/OptRuntime",
"wrapDouble", "(D)Ljava/lang/Double;");
}
private static String getStaticConstantWrapperType(double num)
{
int inum = (int)num;
if (inum == num) {
return "Ljava/lang/Integer;";
} else {
return "Ljava/lang/Double;";
}
}
static void pushUndefined(ClassFileWriter cfw)
{
cfw.add(ByteCode.GETSTATIC, "org/mozilla/javascript/Undefined",
"instance", "Ljava/lang/Object;");
}
int getIndex(ScriptNode n)
{
return scriptOrFnIndexes.getExisting(n);
}
static String getDirectTargetFieldName(int i)
{
return "_dt" + i;
}
String getDirectCtorName(ScriptNode n)
{
return "_n" + getIndex(n);
}
String getBodyMethodName(ScriptNode n)
{
return "_c_" + cleanName(n) + "_" + getIndex(n);
}
/**
* Gets a Java-compatible "informative" name for the the ScriptOrFnNode
*/
String cleanName(final ScriptNode n)
{
String result = "";
if (n instanceof FunctionNode) {
Name name = ((FunctionNode) n).getFunctionName();
if (name == null) {
result = "anonymous";
} else {
result = name.getIdentifier();
}
} else {
result = "script";
}
return result;
}
String getBodyMethodSignature(ScriptNode n)
{
StringBuffer sb = new StringBuffer();
sb.append('(');
sb.append(mainClassSignature);
sb.append("Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Lorg/mozilla/javascript/Scriptable;");
if (n.getType() == Token.FUNCTION) {
OptFunctionNode ofn = OptFunctionNode.get(n);
if (ofn.isTargetOfDirectCall()) {
int pCount = ofn.fnode.getParamCount();
for (int i = 0; i != pCount; i++) {
sb.append("Ljava/lang/Object;D");
}
}
}
sb.append("[Ljava/lang/Object;)Ljava/lang/Object;");
return sb.toString();
}
String getFunctionInitMethodName(OptFunctionNode ofn)
{
return "_i"+getIndex(ofn.fnode);
}
String getCompiledRegexpName(ScriptNode n, int regexpIndex)
{
return "_re"+getIndex(n)+"_"+regexpIndex;
}
static RuntimeException badTree()
{
throw new RuntimeException("Bad tree in codegen");
}
void setMainMethodClass(String className)
{
mainMethodClass = className;
}
static final String DEFAULT_MAIN_METHOD_CLASS
= "org.mozilla.javascript.optimizer.OptRuntime";
private static final String SUPER_CLASS_NAME
= "org.mozilla.javascript.NativeFunction";
static final String DIRECT_CALL_PARENT_FIELD = "_dcp";
private static final String ID_FIELD_NAME = "_id";
private static final String REGEXP_INIT_METHOD_NAME = "_reInit";
private static final String REGEXP_INIT_METHOD_SIGNATURE
= "(Lorg/mozilla/javascript/RegExpProxy;"
+"Lorg/mozilla/javascript/Context;"
+")V";
static final String REGEXP_ARRAY_FIELD_NAME = "_re";
static final String REGEXP_ARRAY_FIELD_TYPE = "[Ljava/lang/Object;";
static final String FUNCTION_INIT_SIGNATURE
= "(Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")V";
static final String FUNCTION_CONSTRUCTOR_SIGNATURE
= "(Lorg/mozilla/javascript/Scriptable;"
+"Lorg/mozilla/javascript/Context;I)V";
private static final Object globalLock = new Object();
private static int globalSerialClassCounter;
private CompilerEnvirons compilerEnv;
private ObjArray directCallTargets;
ScriptNode[] scriptOrFnNodes;
private ObjToIntMap scriptOrFnIndexes;
private String mainMethodClass = DEFAULT_MAIN_METHOD_CLASS;
String mainClassName;
String mainClassSignature;
private double[] itsConstantList;
private int itsConstantListSize;
}
class BodyCodegen
{
void generateBodyCode()
{
isGenerator = Codegen.isGenerator(scriptOrFn);
// generate the body of the current function or script object
initBodyGeneration();
if (isGenerator) {
// All functions in the generated bytecode have a unique name. Every
// generator has a unique prefix followed by _gen
String type = "(" +
codegen.mainClassSignature +
"Lorg/mozilla/javascript/Context;" +
"Lorg/mozilla/javascript/Scriptable;" +
"Ljava/lang/Object;" +
"Ljava/lang/Object;I)Ljava/lang/Object;";
cfw.startMethod(codegen.getBodyMethodName(scriptOrFn) + "_gen",
type,
(short)(ClassFileWriter.ACC_STATIC
| ClassFileWriter.ACC_PRIVATE));
} else {
cfw.startMethod(codegen.getBodyMethodName(scriptOrFn),
codegen.getBodyMethodSignature(scriptOrFn),
(short)(ClassFileWriter.ACC_STATIC
| ClassFileWriter.ACC_PRIVATE));
}
generatePrologue();
Node treeTop;
if (fnCurrent != null) {
treeTop = scriptOrFn.getLastChild();
} else {
treeTop = scriptOrFn;
}
generateStatement(treeTop);
generateEpilogue();
cfw.stopMethod((short)(localsMax + 1));
if (isGenerator) {
// generate the user visible method which when invoked will
// return a generator object
generateGenerator();
}
}
// This creates a the user-facing function that returns a NativeGenerator
// object.
private void generateGenerator()
{
cfw.startMethod(codegen.getBodyMethodName(scriptOrFn),
codegen.getBodyMethodSignature(scriptOrFn),
(short)(ClassFileWriter.ACC_STATIC
| ClassFileWriter.ACC_PRIVATE));
initBodyGeneration();
argsLocal = firstFreeLocal++;
localsMax = firstFreeLocal;
// get top level scope
if (fnCurrent != null && !inDirectCallFunction
&& (!compilerEnv.isUseDynamicScope()
|| fnCurrent.fnode.getIgnoreDynamicScope()))
{
// Unless we're either in a direct call or using dynamic scope,
// use the enclosing scope of the function as our variable object.
cfw.addALoad(funObjLocal);
cfw.addInvoke(ByteCode.INVOKEINTERFACE,
"org/mozilla/javascript/Scriptable",
"getParentScope",
"()Lorg/mozilla/javascript/Scriptable;");
cfw.addAStore(variableObjectLocal);
}
// generators are forced to have an activation record
cfw.addALoad(funObjLocal);
cfw.addALoad(variableObjectLocal);
cfw.addALoad(argsLocal);
addScriptRuntimeInvoke("createFunctionActivation",
"(Lorg/mozilla/javascript/NativeFunction;"
+"Lorg/mozilla/javascript/Scriptable;"
+"[Ljava/lang/Object;"
+")Lorg/mozilla/javascript/Scriptable;");
cfw.addAStore(variableObjectLocal);
// create a function object
cfw.add(ByteCode.NEW, codegen.mainClassName);
// Call function constructor
cfw.add(ByteCode.DUP);
cfw.addALoad(variableObjectLocal);
cfw.addALoad(contextLocal); // load 'cx'
cfw.addPush(scriptOrFnIndex);
cfw.addInvoke(ByteCode.INVOKESPECIAL, codegen.mainClassName,
"", Codegen.FUNCTION_CONSTRUCTOR_SIGNATURE);
// Init mainScript field
cfw.add(ByteCode.DUP);
if (isTopLevel) Kit.codeBug(); // Only functions can be generators
cfw.add(ByteCode.ALOAD_0);
cfw.add(ByteCode.GETFIELD,
codegen.mainClassName,
Codegen.DIRECT_CALL_PARENT_FIELD,
codegen.mainClassSignature);
cfw.add(ByteCode.PUTFIELD,
codegen.mainClassName,
Codegen.DIRECT_CALL_PARENT_FIELD,
codegen.mainClassSignature);
generateNestedFunctionInits();
// create the NativeGenerator object that we return
cfw.addALoad(variableObjectLocal);
cfw.addALoad(thisObjLocal);
cfw.addLoadConstant(maxLocals);
cfw.addLoadConstant(maxStack);
addOptRuntimeInvoke("createNativeGenerator",
"(Lorg/mozilla/javascript/NativeFunction;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Lorg/mozilla/javascript/Scriptable;II"
+")Lorg/mozilla/javascript/Scriptable;");
cfw.add(ByteCode.ARETURN);
cfw.stopMethod((short)(localsMax + 1));
}
private void generateNestedFunctionInits()
{
int functionCount = scriptOrFn.getFunctionCount();
for (int i = 0; i != functionCount; i++) {
OptFunctionNode ofn = OptFunctionNode.get(scriptOrFn, i);
if (ofn.fnode.getFunctionType()
== FunctionNode.FUNCTION_STATEMENT)
{
visitFunction(ofn, FunctionNode.FUNCTION_STATEMENT);
}
}
}
private void initBodyGeneration()
{
isTopLevel = (scriptOrFn == codegen.scriptOrFnNodes[0]);
varRegisters = null;
if (scriptOrFn.getType() == Token.FUNCTION) {
fnCurrent = OptFunctionNode.get(scriptOrFn);
hasVarsInRegs = !fnCurrent.fnode.requiresActivation();
if (hasVarsInRegs) {
int n = fnCurrent.fnode.getParamAndVarCount();
if (n != 0) {
varRegisters = new short[n];
}
}
inDirectCallFunction = fnCurrent.isTargetOfDirectCall();
if (inDirectCallFunction && !hasVarsInRegs) Codegen.badTree();
} else {
fnCurrent = null;
hasVarsInRegs = false;
inDirectCallFunction = false;
}
locals = new int[MAX_LOCALS];
funObjLocal = 0;
contextLocal = 1;
variableObjectLocal = 2;
thisObjLocal = 3;
localsMax = (short) 4; // number of parms + "this"
firstFreeLocal = 4;
popvLocal = -1;
argsLocal = -1;
itsZeroArgArray = -1;
itsOneArgArray = -1;
scriptRegexpLocal = -1;
epilogueLabel = -1;
enterAreaStartLabel = -1;
generatorStateLocal = -1;
}
/**
* Generate the prologue for a function or script.
*/
private void generatePrologue()
{
if (inDirectCallFunction) {
int directParameterCount = scriptOrFn.getParamCount();
// 0 is reserved for function Object 'this'
// 1 is reserved for context
// 2 is reserved for parentScope
// 3 is reserved for script 'this'
if (firstFreeLocal != 4) Kit.codeBug();
for (int i = 0; i != directParameterCount; ++i) {
varRegisters[i] = firstFreeLocal;
// 3 is 1 for Object parm and 2 for double parm
firstFreeLocal += 3;
}
if (!fnCurrent.getParameterNumberContext()) {
// make sure that all parameters are objects
itsForcedObjectParameters = true;
for (int i = 0; i != directParameterCount; ++i) {
short reg = varRegisters[i];
cfw.addALoad(reg);
cfw.add(ByteCode.GETSTATIC,
"java/lang/Void",
"TYPE",
"Ljava/lang/Class;");
int isObjectLabel = cfw.acquireLabel();
cfw.add(ByteCode.IF_ACMPNE, isObjectLabel);
cfw.addDLoad(reg + 1);
addDoubleWrap();
cfw.addAStore(reg);
cfw.markLabel(isObjectLabel);
}
}
}
if (fnCurrent != null && !inDirectCallFunction
&& (!compilerEnv.isUseDynamicScope()
|| fnCurrent.fnode.getIgnoreDynamicScope()))
{
// Unless we're either in a direct call or using dynamic scope,
// use the enclosing scope of the function as our variable object.
cfw.addALoad(funObjLocal);
cfw.addInvoke(ByteCode.INVOKEINTERFACE,
"org/mozilla/javascript/Scriptable",
"getParentScope",
"()Lorg/mozilla/javascript/Scriptable;");
cfw.addAStore(variableObjectLocal);
}
// reserve 'args[]'
argsLocal = firstFreeLocal++;
localsMax = firstFreeLocal;
// Generate Generator specific prelude
if (isGenerator) {
// reserve 'args[]'
operationLocal = firstFreeLocal++;
localsMax = firstFreeLocal;
// Local 3 is a reference to a GeneratorState object. The rest
// of codegen expects local 3 to be a reference to the thisObj.
// So move the value in local 3 to generatorStateLocal, and load
// the saved thisObj from the GeneratorState object.
cfw.addALoad(thisObjLocal);
generatorStateLocal = firstFreeLocal++;
localsMax = firstFreeLocal;
cfw.add(ByteCode.CHECKCAST, OptRuntime.GeneratorState.CLASS_NAME);
cfw.add(ByteCode.DUP);
cfw.addAStore(generatorStateLocal);
cfw.add(ByteCode.GETFIELD,
OptRuntime.GeneratorState.CLASS_NAME,
OptRuntime.GeneratorState.thisObj_NAME,
OptRuntime.GeneratorState.thisObj_TYPE);
cfw.addAStore(thisObjLocal);
if (epilogueLabel == -1) {
epilogueLabel = cfw.acquireLabel();
}
List targets = ((FunctionNode)scriptOrFn).getResumptionPoints();
if (targets != null) {
// get resumption point
generateGetGeneratorResumptionPoint();
// generate dispatch table
generatorSwitch = cfw.addTableSwitch(0,
targets.size() + GENERATOR_START);
generateCheckForThrowOrClose(-1, false, GENERATOR_START);
}
}
if (fnCurrent == null) {
// See comments in case Token.REGEXP
if (scriptOrFn.getRegexpCount() != 0) {
scriptRegexpLocal = getNewWordLocal();
codegen.pushRegExpArray(cfw, scriptOrFn, contextLocal,
variableObjectLocal);
cfw.addAStore(scriptRegexpLocal);
}
}
if (compilerEnv.isGenerateObserverCount())
saveCurrentCodeOffset();
if (hasVarsInRegs) {
// No need to create activation. Pad arguments if need be.
int parmCount = scriptOrFn.getParamCount();
if (parmCount > 0 && !inDirectCallFunction) {
// Set up args array
// check length of arguments, pad if need be
cfw.addALoad(argsLocal);
cfw.add(ByteCode.ARRAYLENGTH);
cfw.addPush(parmCount);
int label = cfw.acquireLabel();
cfw.add(ByteCode.IF_ICMPGE, label);
cfw.addALoad(argsLocal);
cfw.addPush(parmCount);
addScriptRuntimeInvoke("padArguments",
"([Ljava/lang/Object;I"
+")[Ljava/lang/Object;");
cfw.addAStore(argsLocal);
cfw.markLabel(label);
}
int paramCount = fnCurrent.fnode.getParamCount();
int varCount = fnCurrent.fnode.getParamAndVarCount();
boolean [] constDeclarations = fnCurrent.fnode.getParamAndVarConst();
// REMIND - only need to initialize the vars that don't get a value
// before the next call and are used in the function
short firstUndefVar = -1;
for (int i = 0; i != varCount; ++i) {
short reg = -1;
if (i < paramCount) {
if (!inDirectCallFunction) {
reg = getNewWordLocal();
cfw.addALoad(argsLocal);
cfw.addPush(i);
cfw.add(ByteCode.AALOAD);
cfw.addAStore(reg);
}
} else if (fnCurrent.isNumberVar(i)) {
reg = getNewWordPairLocal(constDeclarations[i]);
cfw.addPush(0.0);
cfw.addDStore(reg);
} else {
reg = getNewWordLocal(constDeclarations[i]);
if (firstUndefVar == -1) {
Codegen.pushUndefined(cfw);
firstUndefVar = reg;
} else {
cfw.addALoad(firstUndefVar);
}
cfw.addAStore(reg);
}
if (reg >= 0) {
if (constDeclarations[i]) {
cfw.addPush(0);
cfw.addIStore(reg + (fnCurrent.isNumberVar(i) ? 2 : 1));
}
varRegisters[i] = reg;
}
// Add debug table entry if we're generating debug info
if (compilerEnv.isGenerateDebugInfo()) {
String name = fnCurrent.fnode.getParamOrVarName(i);
String type = fnCurrent.isNumberVar(i)
? "D" : "Ljava/lang/Object;";
int startPC = cfw.getCurrentCodeOffset();
if (reg < 0) {
reg = varRegisters[i];
}
cfw.addVariableDescriptor(name, type, startPC, reg);
}
}
// Skip creating activation object.
return;
}
// skip creating activation object for the body of a generator. The
// activation record required by a generator has already been created
// in generateGenerator().
if (isGenerator)
return;
String debugVariableName;
if (fnCurrent != null) {
debugVariableName = "activation";
cfw.addALoad(funObjLocal);
cfw.addALoad(variableObjectLocal);
cfw.addALoad(argsLocal);
addScriptRuntimeInvoke("createFunctionActivation",
"(Lorg/mozilla/javascript/NativeFunction;"
+"Lorg/mozilla/javascript/Scriptable;"
+"[Ljava/lang/Object;"
+")Lorg/mozilla/javascript/Scriptable;");
cfw.addAStore(variableObjectLocal);
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke("enterActivationFunction",
"(Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")V");
} else {
debugVariableName = "global";
cfw.addALoad(funObjLocal);
cfw.addALoad(thisObjLocal);
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
cfw.addPush(0); // false to indicate it is not eval script
addScriptRuntimeInvoke("initScript",
"(Lorg/mozilla/javascript/NativeFunction;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Z"
+")V");
}
enterAreaStartLabel = cfw.acquireLabel();
epilogueLabel = cfw.acquireLabel();
cfw.markLabel(enterAreaStartLabel);
generateNestedFunctionInits();
// default is to generate debug info
if (compilerEnv.isGenerateDebugInfo()) {
cfw.addVariableDescriptor(debugVariableName,
"Lorg/mozilla/javascript/Scriptable;",
cfw.getCurrentCodeOffset(), variableObjectLocal);
}
if (fnCurrent == null) {
// OPT: use dataflow to prove that this assignment is dead
popvLocal = getNewWordLocal();
Codegen.pushUndefined(cfw);
cfw.addAStore(popvLocal);
int linenum = scriptOrFn.getEndLineno();
if (linenum != -1)
cfw.addLineNumberEntry((short)linenum);
} else {
if (fnCurrent.itsContainsCalls0) {
itsZeroArgArray = getNewWordLocal();
cfw.add(ByteCode.GETSTATIC,
"org/mozilla/javascript/ScriptRuntime",
"emptyArgs", "[Ljava/lang/Object;");
cfw.addAStore(itsZeroArgArray);
}
if (fnCurrent.itsContainsCalls1) {
itsOneArgArray = getNewWordLocal();
cfw.addPush(1);
cfw.add(ByteCode.ANEWARRAY, "java/lang/Object");
cfw.addAStore(itsOneArgArray);
}
}
}
private void generateGetGeneratorResumptionPoint()
{
cfw.addALoad(generatorStateLocal);
cfw.add(ByteCode.GETFIELD,
OptRuntime.GeneratorState.CLASS_NAME,
OptRuntime.GeneratorState.resumptionPoint_NAME,
OptRuntime.GeneratorState.resumptionPoint_TYPE);
}
private void generateSetGeneratorResumptionPoint(int nextState)
{
cfw.addALoad(generatorStateLocal);
cfw.addLoadConstant(nextState);
cfw.add(ByteCode.PUTFIELD,
OptRuntime.GeneratorState.CLASS_NAME,
OptRuntime.GeneratorState.resumptionPoint_NAME,
OptRuntime.GeneratorState.resumptionPoint_TYPE);
}
private void generateGetGeneratorStackState()
{
cfw.addALoad(generatorStateLocal);
addOptRuntimeInvoke("getGeneratorStackState",
"(Ljava/lang/Object;)[Ljava/lang/Object;");
}
private void generateEpilogue()
{
if (compilerEnv.isGenerateObserverCount())
addInstructionCount();
if (isGenerator) {
// generate locals initialization
Map liveLocals = ((FunctionNode)scriptOrFn).getLiveLocals();
if (liveLocals != null) {
List nodes = ((FunctionNode)scriptOrFn).getResumptionPoints();
for (int i = 0; i < nodes.size(); i++) {
Node node = nodes.get(i);
int[] live = liveLocals.get(node);
if (live != null) {
cfw.markTableSwitchCase(generatorSwitch,
getNextGeneratorState(node));
generateGetGeneratorLocalsState();
for (int j = 0; j < live.length; j++) {
cfw.add(ByteCode.DUP);
cfw.addLoadConstant(j);
cfw.add(ByteCode.AALOAD);
cfw.addAStore(live[j]);
}
cfw.add(ByteCode.POP);
cfw.add(ByteCode.GOTO, getTargetLabel(node));
}
}
}
// generate dispatch tables for finally
if (finallys != null) {
for (Node n: finallys.keySet()) {
if (n.getType() == Token.FINALLY) {
FinallyReturnPoint ret = finallys.get(n);
// the finally will jump here
cfw.markLabel(ret.tableLabel, (short)1);
// start generating a dispatch table
int startSwitch = cfw.addTableSwitch(0,
ret.jsrPoints.size() - 1);
int c = 0;
cfw.markTableSwitchDefault(startSwitch);
for (int i = 0; i < ret.jsrPoints.size(); i++) {
// generate gotos back to the JSR location
cfw.markTableSwitchCase(startSwitch, c);
cfw.add(ByteCode.GOTO,
ret.jsrPoints.get(i).intValue());
c++;
}
}
}
}
}
if (epilogueLabel != -1) {
cfw.markLabel(epilogueLabel);
}
if (hasVarsInRegs) {
cfw.add(ByteCode.ARETURN);
return;
} else if (isGenerator) {
if (((FunctionNode)scriptOrFn).getResumptionPoints() != null) {
cfw.markTableSwitchDefault(generatorSwitch);
}
// change state for re-entry
generateSetGeneratorResumptionPoint(GENERATOR_TERMINATE);
// throw StopIteration
cfw.addALoad(variableObjectLocal);
addOptRuntimeInvoke("throwStopIteration",
"(Ljava/lang/Object;)V");
Codegen.pushUndefined(cfw);
cfw.add(ByteCode.ARETURN);
} else if (fnCurrent == null) {
cfw.addALoad(popvLocal);
cfw.add(ByteCode.ARETURN);
} else {
generateActivationExit();
cfw.add(ByteCode.ARETURN);
// Generate catch block to catch all and rethrow to call exit code
// under exception propagation as well.
int finallyHandler = cfw.acquireLabel();
cfw.markHandler(finallyHandler);
short exceptionObject = getNewWordLocal();
cfw.addAStore(exceptionObject);
// Duplicate generateActivationExit() in the catch block since it
// takes less space then full-featured ByteCode.JSR/ByteCode.RET
generateActivationExit();
cfw.addALoad(exceptionObject);
releaseWordLocal(exceptionObject);
// rethrow
cfw.add(ByteCode.ATHROW);
// mark the handler
cfw.addExceptionHandler(enterAreaStartLabel, epilogueLabel,
finallyHandler, null); // catch any
}
}
private void generateGetGeneratorLocalsState() {
cfw.addALoad(generatorStateLocal);
addOptRuntimeInvoke("getGeneratorLocalsState",
"(Ljava/lang/Object;)[Ljava/lang/Object;");
}
private void generateActivationExit()
{
if (fnCurrent == null || hasVarsInRegs) throw Kit.codeBug();
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke("exitActivationFunction",
"(Lorg/mozilla/javascript/Context;)V");
}
private void generateStatement(Node node)
{
updateLineNumber(node);
int type = node.getType();
Node child = node.getFirstChild();
switch (type) {
case Token.LOOP:
case Token.LABEL:
case Token.WITH:
case Token.SCRIPT:
case Token.BLOCK:
case Token.EMPTY:
// no-ops.
if (compilerEnv.isGenerateObserverCount()) {
// Need to add instruction count even for no-ops to catch
// cases like while (1) {}
addInstructionCount(1);
}
while (child != null) {
generateStatement(child);
child = child.getNext();
}
break;
case Token.LOCAL_BLOCK: {
int local = getNewWordLocal();
if (isGenerator) {
cfw.add(ByteCode.ACONST_NULL);
cfw.addAStore(local);
}
node.putIntProp(Node.LOCAL_PROP, local);
while (child != null) {
generateStatement(child);
child = child.getNext();
}
releaseWordLocal((short)local);
node.removeProp(Node.LOCAL_PROP);
break;
}
case Token.FUNCTION: {
int fnIndex = node.getExistingIntProp(Node.FUNCTION_PROP);
OptFunctionNode ofn = OptFunctionNode.get(scriptOrFn, fnIndex);
int t = ofn.fnode.getFunctionType();
if (t == FunctionNode.FUNCTION_EXPRESSION_STATEMENT) {
visitFunction(ofn, t);
} else {
if (t != FunctionNode.FUNCTION_STATEMENT) {
throw Codegen.badTree();
}
}
break;
}
case Token.TRY:
visitTryCatchFinally((Jump)node, child);
break;
case Token.CATCH_SCOPE:
{
// nothing stays on the stack on entry into a catch scope
cfw.setStackTop((short) 0);
int local = getLocalBlockRegister(node);
int scopeIndex
= node.getExistingIntProp(Node.CATCH_SCOPE_PROP);
String name = child.getString(); // name of exception
child = child.getNext();
generateExpression(child, node); // load expression object
if (scopeIndex == 0) {
cfw.add(ByteCode.ACONST_NULL);
} else {
// Load previous catch scope object
cfw.addALoad(local);
}
cfw.addPush(name);
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke(
"newCatchScope",
"(Ljava/lang/Throwable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Lorg/mozilla/javascript/Scriptable;");
cfw.addAStore(local);
}
break;
case Token.THROW:
generateExpression(child, node);
if (compilerEnv.isGenerateObserverCount())
addInstructionCount();
generateThrowJavaScriptException();
break;
case Token.RETHROW:
if (compilerEnv.isGenerateObserverCount())
addInstructionCount();
cfw.addALoad(getLocalBlockRegister(node));
cfw.add(ByteCode.ATHROW);
break;
case Token.RETURN_RESULT:
case Token.RETURN:
if (!isGenerator) {
if (child != null) {
generateExpression(child, node);
} else if (type == Token.RETURN) {
Codegen.pushUndefined(cfw);
} else {
if (popvLocal < 0) throw Codegen.badTree();
cfw.addALoad(popvLocal);
}
}
if (compilerEnv.isGenerateObserverCount())
addInstructionCount();
if (epilogueLabel == -1) {
if (!hasVarsInRegs) throw Codegen.badTree();
epilogueLabel = cfw.acquireLabel();
}
cfw.add(ByteCode.GOTO, epilogueLabel);
break;
case Token.SWITCH:
if (compilerEnv.isGenerateObserverCount())
addInstructionCount();
visitSwitch((Jump)node, child);
break;
case Token.ENTERWITH:
generateExpression(child, node);
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke(
"enterWith",
"(Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Lorg/mozilla/javascript/Scriptable;");
cfw.addAStore(variableObjectLocal);
incReferenceWordLocal(variableObjectLocal);
break;
case Token.LEAVEWITH:
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke(
"leaveWith",
"(Lorg/mozilla/javascript/Scriptable;"
+")Lorg/mozilla/javascript/Scriptable;");
cfw.addAStore(variableObjectLocal);
decReferenceWordLocal(variableObjectLocal);
break;
case Token.ENUM_INIT_KEYS:
case Token.ENUM_INIT_VALUES:
case Token.ENUM_INIT_ARRAY:
generateExpression(child, node);
cfw.addALoad(contextLocal);
int enumType = type == Token.ENUM_INIT_KEYS
? ScriptRuntime.ENUMERATE_KEYS :
type == Token.ENUM_INIT_VALUES
? ScriptRuntime.ENUMERATE_VALUES :
ScriptRuntime.ENUMERATE_ARRAY;
cfw.addPush(enumType);
addScriptRuntimeInvoke("enumInit",
"(Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"I"
+")Ljava/lang/Object;");
cfw.addAStore(getLocalBlockRegister(node));
break;
case Token.EXPR_VOID:
if (child.getType() == Token.SETVAR) {
/* special case this so as to avoid unnecessary
load's & pop's */
visitSetVar(child, child.getFirstChild(), false);
}
else if (child.getType() == Token.SETCONSTVAR) {
/* special case this so as to avoid unnecessary
load's & pop's */
visitSetConstVar(child, child.getFirstChild(), false);
}
else if (child.getType() == Token.YIELD) {
generateYieldPoint(child, false);
}
else {
generateExpression(child, node);
if (node.getIntProp(Node.ISNUMBER_PROP, -1) != -1)
cfw.add(ByteCode.POP2);
else
cfw.add(ByteCode.POP);
}
break;
case Token.EXPR_RESULT:
generateExpression(child, node);
if (popvLocal < 0) {
popvLocal = getNewWordLocal();
}
cfw.addAStore(popvLocal);
break;
case Token.TARGET:
{
if (compilerEnv.isGenerateObserverCount())
addInstructionCount();
int label = getTargetLabel(node);
cfw.markLabel(label);
if (compilerEnv.isGenerateObserverCount())
saveCurrentCodeOffset();
}
break;
case Token.JSR:
case Token.GOTO:
case Token.IFEQ:
case Token.IFNE:
if (compilerEnv.isGenerateObserverCount())
addInstructionCount();
visitGoto((Jump)node, type, child);
break;
case Token.FINALLY:
{
if (compilerEnv.isGenerateObserverCount())
saveCurrentCodeOffset();
// there is exactly one value on the stack when enterring
// finally blocks: the return address (or its int encoding)
cfw.setStackTop((short)1);
// Save return address in a new local
int finallyRegister = getNewWordLocal();
if (isGenerator)
generateIntegerWrap();
cfw.addAStore(finallyRegister);
while (child != null) {
generateStatement(child);
child = child.getNext();
}
if (isGenerator) {
cfw.addALoad(finallyRegister);
cfw.add(ByteCode.CHECKCAST, "java/lang/Integer");
generateIntegerUnwrap();
FinallyReturnPoint ret = finallys.get(node);
ret.tableLabel = cfw.acquireLabel();
cfw.add(ByteCode.GOTO, ret.tableLabel);
} else {
cfw.add(ByteCode.RET, finallyRegister);
}
releaseWordLocal((short)finallyRegister);
}
break;
case Token.DEBUGGER:
break;
default:
throw Codegen.badTree();
}
}
private void generateIntegerWrap()
{
cfw.addInvoke(ByteCode.INVOKESTATIC, "java/lang/Integer", "valueOf",
"(I)Ljava/lang/Integer;");
}
private void generateIntegerUnwrap()
{
cfw.addInvoke(ByteCode.INVOKEVIRTUAL, "java/lang/Integer",
"intValue", "()I");
}
private void generateThrowJavaScriptException()
{
cfw.add(ByteCode.NEW,
"org/mozilla/javascript/JavaScriptException");
cfw.add(ByteCode.DUP_X1);
cfw.add(ByteCode.SWAP);
cfw.addPush(scriptOrFn.getSourceName());
cfw.addPush(itsLineNumber);
cfw.addInvoke(
ByteCode.INVOKESPECIAL,
"org/mozilla/javascript/JavaScriptException",
"",
"(Ljava/lang/Object;Ljava/lang/String;I)V");
cfw.add(ByteCode.ATHROW);
}
private int getNextGeneratorState(Node node)
{
int nodeIndex = ((FunctionNode)scriptOrFn).getResumptionPoints()
.indexOf(node);
return nodeIndex + GENERATOR_YIELD_START;
}
private void generateExpression(Node node, Node parent)
{
int type = node.getType();
Node child = node.getFirstChild();
switch (type) {
case Token.USE_STACK:
break;
case Token.FUNCTION:
if (fnCurrent != null || parent.getType() != Token.SCRIPT) {
int fnIndex = node.getExistingIntProp(Node.FUNCTION_PROP);
OptFunctionNode ofn = OptFunctionNode.get(scriptOrFn,
fnIndex);
int t = ofn.fnode.getFunctionType();
if (t != FunctionNode.FUNCTION_EXPRESSION) {
throw Codegen.badTree();
}
visitFunction(ofn, t);
}
break;
case Token.NAME:
{
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
cfw.addPush(node.getString());
addScriptRuntimeInvoke(
"name",
"(Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/String;"
+")Ljava/lang/Object;");
}
break;
case Token.CALL:
case Token.NEW:
{
int specialType = node.getIntProp(Node.SPECIALCALL_PROP,
Node.NON_SPECIALCALL);
if (specialType == Node.NON_SPECIALCALL) {
OptFunctionNode target;
target = (OptFunctionNode)node.getProp(
Node.DIRECTCALL_PROP);
if (target != null) {
visitOptimizedCall(node, target, type, child);
} else if (type == Token.CALL) {
visitStandardCall(node, child);
} else {
visitStandardNew(node, child);
}
} else {
visitSpecialCall(node, type, specialType, child);
}
}
break;
case Token.REF_CALL:
generateFunctionAndThisObj(child, node);
// stack: ... functionObj thisObj
child = child.getNext();
generateCallArgArray(node, child, false);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"callRef",
"(Lorg/mozilla/javascript/Callable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"[Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Lorg/mozilla/javascript/Ref;");
break;
case Token.NUMBER:
{
double num = node.getDouble();
if (node.getIntProp(Node.ISNUMBER_PROP, -1) != -1) {
cfw.addPush(num);
} else {
codegen.pushNumberAsObject(cfw, num);
}
}
break;
case Token.STRING:
cfw.addPush(node.getString());
break;
case Token.THIS:
cfw.addALoad(thisObjLocal);
break;
case Token.THISFN:
cfw.add(ByteCode.ALOAD_0);
break;
case Token.NULL:
cfw.add(ByteCode.ACONST_NULL);
break;
case Token.TRUE:
cfw.add(ByteCode.GETSTATIC, "java/lang/Boolean",
"TRUE", "Ljava/lang/Boolean;");
break;
case Token.FALSE:
cfw.add(ByteCode.GETSTATIC, "java/lang/Boolean",
"FALSE", "Ljava/lang/Boolean;");
break;
case Token.REGEXP:
{
int i = node.getExistingIntProp(Node.REGEXP_PROP);
// Scripts can not use REGEXP_ARRAY_FIELD_NAME since
// it it will make script.exec non-reentrant so they
// store regexp array in a local variable while
// functions always access precomputed
// REGEXP_ARRAY_FIELD_NAME not to consume locals
if (fnCurrent == null) {
cfw.addALoad(scriptRegexpLocal);
} else {
cfw.addALoad(funObjLocal);
cfw.add(ByteCode.GETFIELD, codegen.mainClassName,
Codegen.REGEXP_ARRAY_FIELD_NAME,
Codegen.REGEXP_ARRAY_FIELD_TYPE);
}
cfw.addPush(i);
cfw.add(ByteCode.AALOAD);
}
break;
case Token.COMMA: {
Node next = child.getNext();
while (next != null) {
generateExpression(child, node);
cfw.add(ByteCode.POP);
child = next;
next = next.getNext();
}
generateExpression(child, node);
break;
}
case Token.ENUM_NEXT:
case Token.ENUM_ID: {
int local = getLocalBlockRegister(node);
cfw.addALoad(local);
if (type == Token.ENUM_NEXT) {
addScriptRuntimeInvoke(
"enumNext", "(Ljava/lang/Object;)Ljava/lang/Boolean;");
} else {
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke("enumId",
"(Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
}
break;
}
case Token.ARRAYLIT:
visitArrayLiteral(node, child);
break;
case Token.OBJECTLIT:
visitObjectLiteral(node, child);
break;
case Token.NOT: {
int trueTarget = cfw.acquireLabel();
int falseTarget = cfw.acquireLabel();
int beyond = cfw.acquireLabel();
generateIfJump(child, node, trueTarget, falseTarget);
cfw.markLabel(trueTarget);
cfw.add(ByteCode.GETSTATIC, "java/lang/Boolean",
"FALSE", "Ljava/lang/Boolean;");
cfw.add(ByteCode.GOTO, beyond);
cfw.markLabel(falseTarget);
cfw.add(ByteCode.GETSTATIC, "java/lang/Boolean",
"TRUE", "Ljava/lang/Boolean;");
cfw.markLabel(beyond);
cfw.adjustStackTop(-1);
break;
}
case Token.BITNOT:
generateExpression(child, node);
addScriptRuntimeInvoke("toInt32", "(Ljava/lang/Object;)I");
cfw.addPush(-1); // implement ~a as (a ^ -1)
cfw.add(ByteCode.IXOR);
cfw.add(ByteCode.I2D);
addDoubleWrap();
break;
case Token.VOID:
generateExpression(child, node);
cfw.add(ByteCode.POP);
Codegen.pushUndefined(cfw);
break;
case Token.TYPEOF:
generateExpression(child, node);
addScriptRuntimeInvoke("typeof",
"(Ljava/lang/Object;"
+")Ljava/lang/String;");
break;
case Token.TYPEOFNAME:
visitTypeofname(node);
break;
case Token.INC:
case Token.DEC:
visitIncDec(node);
break;
case Token.OR:
case Token.AND: {
generateExpression(child, node);
cfw.add(ByteCode.DUP);
addScriptRuntimeInvoke("toBoolean",
"(Ljava/lang/Object;)Z");
int falseTarget = cfw.acquireLabel();
if (type == Token.AND)
cfw.add(ByteCode.IFEQ, falseTarget);
else
cfw.add(ByteCode.IFNE, falseTarget);
cfw.add(ByteCode.POP);
generateExpression(child.getNext(), node);
cfw.markLabel(falseTarget);
}
break;
case Token.HOOK : {
Node ifThen = child.getNext();
Node ifElse = ifThen.getNext();
generateExpression(child, node);
addScriptRuntimeInvoke("toBoolean",
"(Ljava/lang/Object;)Z");
int elseTarget = cfw.acquireLabel();
cfw.add(ByteCode.IFEQ, elseTarget);
short stack = cfw.getStackTop();
generateExpression(ifThen, node);
int afterHook = cfw.acquireLabel();
cfw.add(ByteCode.GOTO, afterHook);
cfw.markLabel(elseTarget, stack);
generateExpression(ifElse, node);
cfw.markLabel(afterHook);
}
break;
case Token.ADD: {
generateExpression(child, node);
generateExpression(child.getNext(), node);
switch (node.getIntProp(Node.ISNUMBER_PROP, -1)) {
case Node.BOTH:
cfw.add(ByteCode.DADD);
break;
case Node.LEFT:
addOptRuntimeInvoke("add",
"(DLjava/lang/Object;)Ljava/lang/Object;");
break;
case Node.RIGHT:
addOptRuntimeInvoke("add",
"(Ljava/lang/Object;D)Ljava/lang/Object;");
break;
default:
if (child.getType() == Token.STRING) {
addScriptRuntimeInvoke("add",
"(Ljava/lang/String;"
+"Ljava/lang/Object;"
+")Ljava/lang/String;");
} else if (child.getNext().getType() == Token.STRING) {
addScriptRuntimeInvoke("add",
"(Ljava/lang/Object;"
+"Ljava/lang/String;"
+")Ljava/lang/String;");
} else {
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke("add",
"(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
}
}
}
break;
case Token.MUL:
visitArithmetic(node, ByteCode.DMUL, child, parent);
break;
case Token.SUB:
visitArithmetic(node, ByteCode.DSUB, child, parent);
break;
case Token.DIV:
case Token.MOD:
visitArithmetic(node, type == Token.DIV
? ByteCode.DDIV
: ByteCode.DREM, child, parent);
break;
case Token.BITOR:
case Token.BITXOR:
case Token.BITAND:
case Token.LSH:
case Token.RSH:
case Token.URSH:
visitBitOp(node, type, child);
break;
case Token.POS:
case Token.NEG:
generateExpression(child, node);
addObjectToDouble();
if (type == Token.NEG) {
cfw.add(ByteCode.DNEG);
}
addDoubleWrap();
break;
case Token.TO_DOUBLE:
// cnvt to double (not Double)
generateExpression(child, node);
addObjectToDouble();
break;
case Token.TO_OBJECT: {
// convert from double
int prop = -1;
if (child.getType() == Token.NUMBER) {
prop = child.getIntProp(Node.ISNUMBER_PROP, -1);
}
if (prop != -1) {
child.removeProp(Node.ISNUMBER_PROP);
generateExpression(child, node);
child.putIntProp(Node.ISNUMBER_PROP, prop);
} else {
generateExpression(child, node);
addDoubleWrap();
}
break;
}
case Token.IN:
case Token.INSTANCEOF:
case Token.LE:
case Token.LT:
case Token.GE:
case Token.GT: {
int trueGOTO = cfw.acquireLabel();
int falseGOTO = cfw.acquireLabel();
visitIfJumpRelOp(node, child, trueGOTO, falseGOTO);
addJumpedBooleanWrap(trueGOTO, falseGOTO);
break;
}
case Token.EQ:
case Token.NE:
case Token.SHEQ:
case Token.SHNE: {
int trueGOTO = cfw.acquireLabel();
int falseGOTO = cfw.acquireLabel();
visitIfJumpEqOp(node, child, trueGOTO, falseGOTO);
addJumpedBooleanWrap(trueGOTO, falseGOTO);
break;
}
case Token.GETPROP:
case Token.GETPROPNOWARN:
visitGetProp(node, child);
break;
case Token.GETELEM:
generateExpression(child, node); // object
generateExpression(child.getNext(), node); // id
cfw.addALoad(contextLocal);
if (node.getIntProp(Node.ISNUMBER_PROP, -1) != -1) {
addScriptRuntimeInvoke(
"getObjectIndex",
"(Ljava/lang/Object;D"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
}
else {
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke(
"getObjectElem",
"(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Ljava/lang/Object;");
}
break;
case Token.GET_REF:
generateExpression(child, node); // reference
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"refGet",
"(Lorg/mozilla/javascript/Ref;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
break;
case Token.GETVAR:
visitGetVar(node);
break;
case Token.SETVAR:
visitSetVar(node, child, true);
break;
case Token.SETNAME:
visitSetName(node, child);
break;
case Token.STRICT_SETNAME:
visitStrictSetName(node, child);
break;
case Token.SETCONST:
visitSetConst(node, child);
break;
case Token.SETCONSTVAR:
visitSetConstVar(node, child, true);
break;
case Token.SETPROP:
case Token.SETPROP_OP:
visitSetProp(type, node, child);
break;
case Token.SETELEM:
case Token.SETELEM_OP:
visitSetElem(type, node, child);
break;
case Token.SET_REF:
case Token.SET_REF_OP:
{
generateExpression(child, node);
child = child.getNext();
if (type == Token.SET_REF_OP) {
cfw.add(ByteCode.DUP);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"refGet",
"(Lorg/mozilla/javascript/Ref;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
}
generateExpression(child, node);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"refSet",
"(Lorg/mozilla/javascript/Ref;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
}
break;
case Token.DEL_REF:
generateExpression(child, node);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke("refDel",
"(Lorg/mozilla/javascript/Ref;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
break;
case Token.DELPROP:
generateExpression(child, node);
child = child.getNext();
generateExpression(child, node);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke("delete",
"(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
break;
case Token.BINDNAME:
{
while (child != null) {
generateExpression(child, node);
child = child.getNext();
}
// Generate code for "ScriptRuntime.bind(varObj, "s")"
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
cfw.addPush(node.getString());
addScriptRuntimeInvoke(
"bind",
"(Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/String;"
+")Lorg/mozilla/javascript/Scriptable;");
}
break;
case Token.LOCAL_LOAD:
cfw.addALoad(getLocalBlockRegister(node));
break;
case Token.REF_SPECIAL:
{
String special = (String)node.getProp(Node.NAME_PROP);
generateExpression(child, node);
cfw.addPush(special);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"specialRef",
"(Ljava/lang/Object;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+")Lorg/mozilla/javascript/Ref;");
}
break;
case Token.REF_MEMBER:
case Token.REF_NS_MEMBER:
case Token.REF_NAME:
case Token.REF_NS_NAME:
{
int memberTypeFlags
= node.getIntProp(Node.MEMBER_TYPE_PROP, 0);
// generate possible target, possible namespace and member
do {
generateExpression(child, node);
child = child.getNext();
} while (child != null);
cfw.addALoad(contextLocal);
String methodName, signature;
switch (type) {
case Token.REF_MEMBER:
methodName = "memberRef";
signature = "(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"I"
+")Lorg/mozilla/javascript/Ref;";
break;
case Token.REF_NS_MEMBER:
methodName = "memberRef";
signature = "(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"I"
+")Lorg/mozilla/javascript/Ref;";
break;
case Token.REF_NAME:
methodName = "nameRef";
signature = "(Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"I"
+")Lorg/mozilla/javascript/Ref;";
cfw.addALoad(variableObjectLocal);
break;
case Token.REF_NS_NAME:
methodName = "nameRef";
signature = "(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"I"
+")Lorg/mozilla/javascript/Ref;";
cfw.addALoad(variableObjectLocal);
break;
default:
throw Kit.codeBug();
}
cfw.addPush(memberTypeFlags);
addScriptRuntimeInvoke(methodName, signature);
}
break;
case Token.DOTQUERY:
visitDotQuery(node, child);
break;
case Token.ESCXMLATTR:
generateExpression(child, node);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke("escapeAttributeValue",
"(Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/String;");
break;
case Token.ESCXMLTEXT:
generateExpression(child, node);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke("escapeTextValue",
"(Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/String;");
break;
case Token.DEFAULTNAMESPACE:
generateExpression(child, node);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke("setDefaultNamespace",
"(Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
break;
case Token.YIELD:
generateYieldPoint(node, true);
break;
case Token.WITHEXPR: {
Node enterWith = child;
Node with = enterWith.getNext();
Node leaveWith = with.getNext();
generateStatement(enterWith);
generateExpression(with.getFirstChild(), with);
generateStatement(leaveWith);
break;
}
case Token.ARRAYCOMP: {
Node initStmt = child;
Node expr = child.getNext();
generateStatement(initStmt);
generateExpression(expr, node);
break;
}
default:
throw new RuntimeException("Unexpected node type "+type);
}
}
private void generateYieldPoint(Node node, boolean exprContext) {
// save stack state
int top = cfw.getStackTop();
maxStack = maxStack > top ? maxStack : top;
if (cfw.getStackTop() != 0) {
generateGetGeneratorStackState();
for (int i = 0; i < top; i++) {
cfw.add(ByteCode.DUP_X1);
cfw.add(ByteCode.SWAP);
cfw.addLoadConstant(i);
cfw.add(ByteCode.SWAP);
cfw.add(ByteCode.AASTORE);
}
// pop the array object
cfw.add(ByteCode.POP);
}
// generate the yield argument
Node child = node.getFirstChild();
if (child != null)
generateExpression(child, node);
else
Codegen.pushUndefined(cfw);
// change the resumption state
int nextState = getNextGeneratorState(node);
generateSetGeneratorResumptionPoint(nextState);
boolean hasLocals = generateSaveLocals(node);
cfw.add(ByteCode.ARETURN);
generateCheckForThrowOrClose(getTargetLabel(node),
hasLocals, nextState);
// reconstruct the stack
if (top != 0) {
generateGetGeneratorStackState();
for (int i = 0; i < top; i++) {
cfw.add(ByteCode.DUP);
cfw.addLoadConstant(top - i - 1);
cfw.add(ByteCode.AALOAD);
cfw.add(ByteCode.SWAP);
}
cfw.add(ByteCode.POP);
}
// load return value from yield
if (exprContext) {
cfw.addALoad(argsLocal);
}
}
private void generateCheckForThrowOrClose(int label,
boolean hasLocals,
int nextState) {
int throwLabel = cfw.acquireLabel();
int closeLabel = cfw.acquireLabel();
// throw the user provided object, if the operation is .throw()
cfw.markLabel(throwLabel);
cfw.addALoad(argsLocal);
generateThrowJavaScriptException();
// throw our special internal exception if the generator is being closed
cfw.markLabel(closeLabel);
cfw.addALoad(argsLocal);
cfw.add(ByteCode.CHECKCAST, "java/lang/Throwable");
cfw.add(ByteCode.ATHROW);
// mark the re-entry point
// jump here after initializing the locals
if (label != -1)
cfw.markLabel(label);
if (!hasLocals) {
// jump here directly if there are no locals
cfw.markTableSwitchCase(generatorSwitch, nextState);
}
// see if we need to dispatch for .close() or .throw()
cfw.addILoad(operationLocal);
cfw.addLoadConstant(NativeGenerator.GENERATOR_CLOSE);
cfw.add(ByteCode.IF_ICMPEQ, closeLabel);
cfw.addILoad(operationLocal);
cfw.addLoadConstant(NativeGenerator.GENERATOR_THROW);
cfw.add(ByteCode.IF_ICMPEQ, throwLabel);
}
private void generateIfJump(Node node, Node parent,
int trueLabel, int falseLabel)
{
// System.out.println("gen code for " + node.toString());
int type = node.getType();
Node child = node.getFirstChild();
switch (type) {
case Token.NOT:
generateIfJump(child, node, falseLabel, trueLabel);
break;
case Token.OR:
case Token.AND: {
int interLabel = cfw.acquireLabel();
if (type == Token.AND) {
generateIfJump(child, node, interLabel, falseLabel);
}
else {
generateIfJump(child, node, trueLabel, interLabel);
}
cfw.markLabel(interLabel);
child = child.getNext();
generateIfJump(child, node, trueLabel, falseLabel);
break;
}
case Token.IN:
case Token.INSTANCEOF:
case Token.LE:
case Token.LT:
case Token.GE:
case Token.GT:
visitIfJumpRelOp(node, child, trueLabel, falseLabel);
break;
case Token.EQ:
case Token.NE:
case Token.SHEQ:
case Token.SHNE:
visitIfJumpEqOp(node, child, trueLabel, falseLabel);
break;
default:
// Generate generic code for non-optimized jump
generateExpression(node, parent);
addScriptRuntimeInvoke("toBoolean", "(Ljava/lang/Object;)Z");
cfw.add(ByteCode.IFNE, trueLabel);
cfw.add(ByteCode.GOTO, falseLabel);
}
}
private void visitFunction(OptFunctionNode ofn, int functionType)
{
int fnIndex = codegen.getIndex(ofn.fnode);
cfw.add(ByteCode.NEW, codegen.mainClassName);
// Call function constructor
cfw.add(ByteCode.DUP);
cfw.addALoad(variableObjectLocal);
cfw.addALoad(contextLocal); // load 'cx'
cfw.addPush(fnIndex);
cfw.addInvoke(ByteCode.INVOKESPECIAL, codegen.mainClassName,
"", Codegen.FUNCTION_CONSTRUCTOR_SIGNATURE);
// Init mainScript field;
cfw.add(ByteCode.DUP);
if (isTopLevel) {
cfw.add(ByteCode.ALOAD_0);
} else {
cfw.add(ByteCode.ALOAD_0);
cfw.add(ByteCode.GETFIELD,
codegen.mainClassName,
Codegen.DIRECT_CALL_PARENT_FIELD,
codegen.mainClassSignature);
}
cfw.add(ByteCode.PUTFIELD,
codegen.mainClassName,
Codegen.DIRECT_CALL_PARENT_FIELD,
codegen.mainClassSignature);
int directTargetIndex = ofn.getDirectTargetIndex();
if (directTargetIndex >= 0) {
cfw.add(ByteCode.DUP);
if (isTopLevel) {
cfw.add(ByteCode.ALOAD_0);
} else {
cfw.add(ByteCode.ALOAD_0);
cfw.add(ByteCode.GETFIELD,
codegen.mainClassName,
Codegen.DIRECT_CALL_PARENT_FIELD,
codegen.mainClassSignature);
}
cfw.add(ByteCode.SWAP);
cfw.add(ByteCode.PUTFIELD,
codegen.mainClassName,
Codegen.getDirectTargetFieldName(directTargetIndex),
codegen.mainClassSignature);
}
if (functionType == FunctionNode.FUNCTION_EXPRESSION) {
// Leave closure object on stack and do not pass it to
// initFunction which suppose to connect statements to scope
return;
}
cfw.addPush(functionType);
cfw.addALoad(variableObjectLocal);
cfw.addALoad(contextLocal); // load 'cx'
addOptRuntimeInvoke("initFunction",
"(Lorg/mozilla/javascript/NativeFunction;"
+"I"
+"Lorg/mozilla/javascript/Scriptable;"
+"Lorg/mozilla/javascript/Context;"
+")V");
}
private int getTargetLabel(Node target)
{
int labelId = target.labelId();
if (labelId == -1) {
labelId = cfw.acquireLabel();
target.labelId(labelId);
}
return labelId;
}
private void visitGoto(Jump node, int type, Node child)
{
Node target = node.target;
if (type == Token.IFEQ || type == Token.IFNE) {
if (child == null) throw Codegen.badTree();
int targetLabel = getTargetLabel(target);
int fallThruLabel = cfw.acquireLabel();
if (type == Token.IFEQ)
generateIfJump(child, node, targetLabel, fallThruLabel);
else
generateIfJump(child, node, fallThruLabel, targetLabel);
cfw.markLabel(fallThruLabel);
} else {
if (type == Token.JSR) {
if (isGenerator) {
addGotoWithReturn(target);
} else {
addGoto(target, ByteCode.JSR);
}
} else {
addGoto(target, ByteCode.GOTO);
}
}
}
private void addGotoWithReturn(Node target) {
FinallyReturnPoint ret = finallys.get(target);
cfw.addLoadConstant(ret.jsrPoints.size());
addGoto(target, ByteCode.GOTO);
int retLabel = cfw.acquireLabel();
cfw.markLabel(retLabel);
ret.jsrPoints.add(Integer.valueOf(retLabel));
}
private void visitArrayLiteral(Node node, Node child)
{
int count = 0;
for (Node cursor = child; cursor != null; cursor = cursor.getNext()) {
++count;
}
// load array to store array literal objects
addNewObjectArray(count);
for (int i = 0; i != count; ++i) {
cfw.add(ByteCode.DUP);
cfw.addPush(i);
generateExpression(child, node);
cfw.add(ByteCode.AASTORE);
child = child.getNext();
}
int[] skipIndexes = (int[])node.getProp(Node.SKIP_INDEXES_PROP);
if (skipIndexes == null) {
cfw.add(ByteCode.ACONST_NULL);
cfw.add(ByteCode.ICONST_0);
} else {
cfw.addPush(OptRuntime.encodeIntArray(skipIndexes));
cfw.addPush(skipIndexes.length);
}
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
addOptRuntimeInvoke("newArrayLiteral",
"([Ljava/lang/Object;"
+"Ljava/lang/String;"
+"I"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Lorg/mozilla/javascript/Scriptable;");
}
private void visitObjectLiteral(Node node, Node child)
{
Object[] properties = (Object[])node.getProp(Node.OBJECT_IDS_PROP);
int count = properties.length;
// load array with property ids
addNewObjectArray(count);
for (int i = 0; i != count; ++i) {
cfw.add(ByteCode.DUP);
cfw.addPush(i);
Object id = properties[i];
if (id instanceof String) {
cfw.addPush((String)id);
} else {
cfw.addPush(((Integer)id).intValue());
addScriptRuntimeInvoke("wrapInt", "(I)Ljava/lang/Integer;");
}
cfw.add(ByteCode.AASTORE);
}
// load array with property values
addNewObjectArray(count);
Node child2 = child;
for (int i = 0; i != count; ++i) {
cfw.add(ByteCode.DUP);
cfw.addPush(i);
int childType = child.getType();
if (childType == Token.GET) {
generateExpression(child.getFirstChild(), node);
} else if (childType == Token.SET) {
generateExpression(child.getFirstChild(), node);
} else {
generateExpression(child, node);
}
cfw.add(ByteCode.AASTORE);
child = child.getNext();
}
// load array with getterSetter values
cfw.addPush(count);
cfw.add(ByteCode.NEWARRAY, ByteCode.T_INT);
for (int i = 0; i != count; ++i) {
cfw.add(ByteCode.DUP);
cfw.addPush(i);
int childType = child2.getType();
if (childType == Token.GET) {
cfw.add(ByteCode.ICONST_M1);
} else if (childType == Token.SET) {
cfw.add(ByteCode.ICONST_1);
} else {
cfw.add(ByteCode.ICONST_0);
}
cfw.add(ByteCode.IASTORE);
child2 = child2.getNext();
}
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke("newObjectLiteral",
"([Ljava/lang/Object;"
+"[Ljava/lang/Object;"
+"[I"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Lorg/mozilla/javascript/Scriptable;");
}
private void visitSpecialCall(Node node, int type, int specialType,
Node child)
{
cfw.addALoad(contextLocal);
if (type == Token.NEW) {
generateExpression(child, node);
// stack: ... cx functionObj
} else {
generateFunctionAndThisObj(child, node);
// stack: ... cx functionObj thisObj
}
child = child.getNext();
generateCallArgArray(node, child, false);
String methodName;
String callSignature;
if (type == Token.NEW) {
methodName = "newObjectSpecial";
callSignature = "(Lorg/mozilla/javascript/Context;"
+"Ljava/lang/Object;"
+"[Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"I" // call type
+")Ljava/lang/Object;";
cfw.addALoad(variableObjectLocal);
cfw.addALoad(thisObjLocal);
cfw.addPush(specialType);
} else {
methodName = "callSpecial";
callSignature = "(Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Callable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"[Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"I" // call type
+"Ljava/lang/String;I" // filename, linenumber
+")Ljava/lang/Object;";
cfw.addALoad(variableObjectLocal);
cfw.addALoad(thisObjLocal);
cfw.addPush(specialType);
String sourceName = scriptOrFn.getSourceName();
cfw.addPush(sourceName == null ? "" : sourceName);
cfw.addPush(itsLineNumber);
}
addOptRuntimeInvoke(methodName, callSignature);
}
private void visitStandardCall(Node node, Node child)
{
if (node.getType() != Token.CALL) throw Codegen.badTree();
Node firstArgChild = child.getNext();
int childType = child.getType();
String methodName;
String signature;
if (firstArgChild == null) {
if (childType == Token.NAME) {
// name() call
String name = child.getString();
cfw.addPush(name);
methodName = "callName0";
signature = "(Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Ljava/lang/Object;";
} else if (childType == Token.GETPROP) {
// x.name() call
Node propTarget = child.getFirstChild();
generateExpression(propTarget, node);
Node id = propTarget.getNext();
String property = id.getString();
cfw.addPush(property);
methodName = "callProp0";
signature = "(Ljava/lang/Object;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Ljava/lang/Object;";
} else if (childType == Token.GETPROPNOWARN) {
throw Kit.codeBug();
} else {
generateFunctionAndThisObj(child, node);
methodName = "call0";
signature = "(Lorg/mozilla/javascript/Callable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Ljava/lang/Object;";
}
} else if (childType == Token.NAME) {
// XXX: this optimization is only possible if name
// resolution
// is not affected by arguments evaluation and currently
// there are no checks for it
String name = child.getString();
generateCallArgArray(node, firstArgChild, false);
cfw.addPush(name);
methodName = "callName";
signature = "([Ljava/lang/Object;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Ljava/lang/Object;";
} else {
int argCount = 0;
for (Node arg = firstArgChild; arg != null; arg = arg.getNext()) {
++argCount;
}
generateFunctionAndThisObj(child, node);
// stack: ... functionObj thisObj
if (argCount == 1) {
generateExpression(firstArgChild, node);
methodName = "call1";
signature = "(Lorg/mozilla/javascript/Callable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Ljava/lang/Object;";
} else if (argCount == 2) {
generateExpression(firstArgChild, node);
generateExpression(firstArgChild.getNext(), node);
methodName = "call2";
signature = "(Lorg/mozilla/javascript/Callable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Ljava/lang/Object;";
} else {
generateCallArgArray(node, firstArgChild, false);
methodName = "callN";
signature = "(Lorg/mozilla/javascript/Callable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"[Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Ljava/lang/Object;";
}
}
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
addOptRuntimeInvoke(methodName, signature);
}
private void visitStandardNew(Node node, Node child)
{
if (node.getType() != Token.NEW) throw Codegen.badTree();
Node firstArgChild = child.getNext();
generateExpression(child, node);
// stack: ... functionObj
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
// stack: ... functionObj cx scope
generateCallArgArray(node, firstArgChild, false);
addScriptRuntimeInvoke(
"newObject",
"(Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"[Ljava/lang/Object;"
+")Lorg/mozilla/javascript/Scriptable;");
}
private void visitOptimizedCall(Node node, OptFunctionNode target,
int type, Node child)
{
Node firstArgChild = child.getNext();
short thisObjLocal = 0;
if (type == Token.NEW) {
generateExpression(child, node);
} else {
generateFunctionAndThisObj(child, node);
thisObjLocal = getNewWordLocal();
cfw.addAStore(thisObjLocal);
}
// stack: ... functionObj
int beyond = cfw.acquireLabel();
int directTargetIndex = target.getDirectTargetIndex();
if (isTopLevel) {
cfw.add(ByteCode.ALOAD_0);
} else {
cfw.add(ByteCode.ALOAD_0);
cfw.add(ByteCode.GETFIELD, codegen.mainClassName,
Codegen.DIRECT_CALL_PARENT_FIELD,
codegen.mainClassSignature);
}
cfw.add(ByteCode.GETFIELD, codegen.mainClassName,
Codegen.getDirectTargetFieldName(directTargetIndex),
codegen.mainClassSignature);
cfw.add(ByteCode.DUP2);
// stack: ... functionObj directFunct functionObj directFunct
int regularCall = cfw.acquireLabel();
cfw.add(ByteCode.IF_ACMPNE, regularCall);
// stack: ... functionObj directFunct
short stackHeight = cfw.getStackTop();
cfw.add(ByteCode.SWAP);
cfw.add(ByteCode.POP);
// stack: ... directFunct
if (compilerEnv.isUseDynamicScope()) {
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
} else {
cfw.add(ByteCode.DUP);
// stack: ... directFunct directFunct
cfw.addInvoke(ByteCode.INVOKEINTERFACE,
"org/mozilla/javascript/Scriptable",
"getParentScope",
"()Lorg/mozilla/javascript/Scriptable;");
// stack: ... directFunct scope
cfw.addALoad(contextLocal);
// stack: ... directFunct scope cx
cfw.add(ByteCode.SWAP);
}
// stack: ... directFunc cx scope
if (type == Token.NEW) {
cfw.add(ByteCode.ACONST_NULL);
} else {
cfw.addALoad(thisObjLocal);
}
// stack: ... directFunc cx scope thisObj
/*
Remember that directCall parameters are paired in 1 aReg and 1 dReg
If the argument is an incoming arg, just pass the orginal pair thru.
Else, if the argument is known to be typed 'Number', pass Void.TYPE
in the aReg and the number is the dReg
Else pass the JS object in the aReg and 0.0 in the dReg.
*/
Node argChild = firstArgChild;
while (argChild != null) {
int dcp_register = nodeIsDirectCallParameter(argChild);
if (dcp_register >= 0) {
cfw.addALoad(dcp_register);
cfw.addDLoad(dcp_register + 1);
} else if (argChild.getIntProp(Node.ISNUMBER_PROP, -1)
== Node.BOTH)
{
cfw.add(ByteCode.GETSTATIC,
"java/lang/Void",
"TYPE",
"Ljava/lang/Class;");
generateExpression(argChild, node);
} else {
generateExpression(argChild, node);
cfw.addPush(0.0);
}
argChild = argChild.getNext();
}
cfw.add(ByteCode.GETSTATIC,
"org/mozilla/javascript/ScriptRuntime",
"emptyArgs", "[Ljava/lang/Object;");
cfw.addInvoke(ByteCode.INVOKESTATIC,
codegen.mainClassName,
(type == Token.NEW)
? codegen.getDirectCtorName(target.fnode)
: codegen.getBodyMethodName(target.fnode),
codegen.getBodyMethodSignature(target.fnode));
cfw.add(ByteCode.GOTO, beyond);
cfw.markLabel(regularCall, stackHeight);
// stack: ... functionObj directFunct
cfw.add(ByteCode.POP);
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
// stack: ... functionObj cx scope
if (type != Token.NEW) {
cfw.addALoad(thisObjLocal);
releaseWordLocal(thisObjLocal);
// stack: ... functionObj cx scope thisObj
}
// XXX: this will generate code for the child array the second time,
// so expression code generation better not to alter tree structure...
generateCallArgArray(node, firstArgChild, true);
if (type == Token.NEW) {
addScriptRuntimeInvoke(
"newObject",
"(Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"[Ljava/lang/Object;"
+")Lorg/mozilla/javascript/Scriptable;");
} else {
cfw.addInvoke(ByteCode.INVOKEINTERFACE,
"org/mozilla/javascript/Callable",
"call",
"(Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Lorg/mozilla/javascript/Scriptable;"
+"[Ljava/lang/Object;"
+")Ljava/lang/Object;");
}
cfw.markLabel(beyond);
}
private void generateCallArgArray(Node node, Node argChild, boolean directCall)
{
int argCount = 0;
for (Node child = argChild; child != null; child = child.getNext()) {
++argCount;
}
// load array object to set arguments
if (argCount == 1 && itsOneArgArray >= 0) {
cfw.addALoad(itsOneArgArray);
} else {
addNewObjectArray(argCount);
}
// Copy arguments into it
for (int i = 0; i != argCount; ++i) {
// If we are compiling a generator an argument could be the result
// of a yield. In that case we will have an immediate on the stack
// which we need to avoid
if (!isGenerator) {
cfw.add(ByteCode.DUP);
cfw.addPush(i);
}
if (!directCall) {
generateExpression(argChild, node);
} else {
// If this has also been a directCall sequence, the Number
// flag will have remained set for any parameter so that
// the values could be copied directly into the outgoing
// args. Here we want to force it to be treated as not in
// a Number context, so we set the flag off.
int dcp_register = nodeIsDirectCallParameter(argChild);
if (dcp_register >= 0) {
dcpLoadAsObject(dcp_register);
} else {
generateExpression(argChild, node);
int childNumberFlag
= argChild.getIntProp(Node.ISNUMBER_PROP, -1);
if (childNumberFlag == Node.BOTH) {
addDoubleWrap();
}
}
}
// When compiling generators, any argument to a method may be a
// yield expression. Hence we compile the argument first and then
// load the argument index and assign the value to the args array.
if (isGenerator) {
short tempLocal = getNewWordLocal();
cfw.addAStore(tempLocal);
cfw.add(ByteCode.CHECKCAST, "[Ljava/lang/Object;");
cfw.add(ByteCode.DUP);
cfw.addPush(i);
cfw.addALoad(tempLocal);
releaseWordLocal(tempLocal);
}
cfw.add(ByteCode.AASTORE);
argChild = argChild.getNext();
}
}
private void generateFunctionAndThisObj(Node node, Node parent)
{
// Place on stack (function object, function this) pair
int type = node.getType();
switch (node.getType()) {
case Token.GETPROPNOWARN:
throw Kit.codeBug();
case Token.GETPROP:
case Token.GETELEM: {
Node target = node.getFirstChild();
generateExpression(target, node);
Node id = target.getNext();
if (type == Token.GETPROP) {
String property = id.getString();
cfw.addPush(property);
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke(
"getPropFunctionAndThis",
"(Ljava/lang/Object;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Lorg/mozilla/javascript/Callable;");
} else {
// Optimizer do not optimize this case for now
if (node.getIntProp(Node.ISNUMBER_PROP, -1) != -1)
throw Codegen.badTree();
generateExpression(id, node); // id
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"getElemFunctionAndThis",
"(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Lorg/mozilla/javascript/Callable;");
}
break;
}
case Token.NAME: {
String name = node.getString();
cfw.addPush(name);
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke(
"getNameFunctionAndThis",
"(Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Lorg/mozilla/javascript/Callable;");
break;
}
default: // including GETVAR
generateExpression(node, parent);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"getValueFunctionAndThis",
"(Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Lorg/mozilla/javascript/Callable;");
break;
}
// Get thisObj prepared by get(Name|Prop|Elem|Value)FunctionAndThis
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"lastStoredScriptable",
"(Lorg/mozilla/javascript/Context;"
+")Lorg/mozilla/javascript/Scriptable;");
}
private void updateLineNumber(Node node)
{
itsLineNumber = node.getLineno();
if (itsLineNumber == -1)
return;
cfw.addLineNumberEntry((short)itsLineNumber);
}
private void visitTryCatchFinally(Jump node, Node child)
{
/* Save the variable object, in case there are with statements
* enclosed by the try block and we catch some exception.
* We'll restore it for the catch block so that catch block
* statements get the right scope.
*/
// OPT we only need to do this if there are enclosed WITH
// statements; could statically check and omit this if there aren't any.
// XXX OPT Maybe instead do syntactic transforms to associate
// each 'with' with a try/finally block that does the exitwith.
short savedVariableObject = getNewWordLocal();
cfw.addALoad(variableObjectLocal);
cfw.addAStore(savedVariableObject);
/*
* Generate the code for the tree; most of the work is done in IRFactory
* and NodeTransformer; Codegen just adds the java handlers for the
* javascript catch and finally clauses. */
int startLabel = cfw.acquireLabel();
cfw.markLabel(startLabel, (short)0);
Node catchTarget = node.target;
Node finallyTarget = node.getFinally();
// create a table for the equivalent of JSR returns
if (isGenerator && finallyTarget != null) {
FinallyReturnPoint ret = new FinallyReturnPoint();
if (finallys == null) {
finallys = new HashMap();
}
// add the finally target to hashtable
finallys.put(finallyTarget, ret);
// add the finally node as well to the hash table
finallys.put(finallyTarget.getNext(), ret);
}
while (child != null) {
generateStatement(child);
child = child.getNext();
}
// control flow skips the handlers
int realEnd = cfw.acquireLabel();
cfw.add(ByteCode.GOTO, realEnd);
int exceptionLocal = getLocalBlockRegister(node);
// javascript handler; unwrap exception and GOTO to javascript
// catch area.
if (catchTarget != null) {
// get the label to goto
int catchLabel = catchTarget.labelId();
generateCatchBlock(JAVASCRIPT_EXCEPTION, savedVariableObject,
catchLabel, startLabel, exceptionLocal);
/*
* catch WrappedExceptions, see if they are wrapped
* JavaScriptExceptions. Otherwise, rethrow.
*/
generateCatchBlock(EVALUATOR_EXCEPTION, savedVariableObject,
catchLabel, startLabel, exceptionLocal);
/*
we also need to catch EcmaErrors and feed the
associated error object to the handler
*/
generateCatchBlock(ECMAERROR_EXCEPTION, savedVariableObject,
catchLabel, startLabel, exceptionLocal);
Context cx = Context.getCurrentContext();
if (cx != null &&
cx.hasFeature(Context.FEATURE_ENHANCED_JAVA_ACCESS))
{
generateCatchBlock(THROWABLE_EXCEPTION, savedVariableObject,
catchLabel, startLabel, exceptionLocal);
}
}
// finally handler; catch all exceptions, store to a local; JSR to
// the finally, then re-throw.
if (finallyTarget != null) {
int finallyHandler = cfw.acquireLabel();
cfw.markHandler(finallyHandler);
cfw.addAStore(exceptionLocal);
// reset the variable object local
cfw.addALoad(savedVariableObject);
cfw.addAStore(variableObjectLocal);
// get the label to JSR to
int finallyLabel = finallyTarget.labelId();
if (isGenerator)
addGotoWithReturn(finallyTarget);
else
cfw.add(ByteCode.JSR, finallyLabel);
// rethrow
cfw.addALoad(exceptionLocal);
if (isGenerator)
cfw.add(ByteCode.CHECKCAST, "java/lang/Throwable");
cfw.add(ByteCode.ATHROW);
// mark the handler
cfw.addExceptionHandler(startLabel, finallyLabel,
finallyHandler, null); // catch any
}
releaseWordLocal(savedVariableObject);
cfw.markLabel(realEnd);
}
private static final int JAVASCRIPT_EXCEPTION = 0;
private static final int EVALUATOR_EXCEPTION = 1;
private static final int ECMAERROR_EXCEPTION = 2;
private static final int THROWABLE_EXCEPTION = 3;
private void generateCatchBlock(int exceptionType,
short savedVariableObject,
int catchLabel, int startLabel,
int exceptionLocal)
{
int handler = cfw.acquireLabel();
cfw.markHandler(handler);
// MS JVM gets cranky if the exception object is left on the stack
cfw.addAStore(exceptionLocal);
// reset the variable object local
cfw.addALoad(savedVariableObject);
cfw.addAStore(variableObjectLocal);
String exceptionName;
if (exceptionType == JAVASCRIPT_EXCEPTION) {
exceptionName = "org/mozilla/javascript/JavaScriptException";
} else if (exceptionType == EVALUATOR_EXCEPTION) {
exceptionName = "org/mozilla/javascript/EvaluatorException";
} else if (exceptionType == ECMAERROR_EXCEPTION) {
exceptionName = "org/mozilla/javascript/EcmaError";
} else if (exceptionType == THROWABLE_EXCEPTION) {
exceptionName = "java/lang/Throwable";
} else {
throw Kit.codeBug();
}
// mark the handler
cfw.addExceptionHandler(startLabel, catchLabel, handler,
exceptionName);
cfw.add(ByteCode.GOTO, catchLabel);
}
private boolean generateSaveLocals(Node node)
{
int count = 0;
for (int i = 0; i < firstFreeLocal; i++) {
if (locals[i] != 0)
count++;
}
if (count == 0) {
((FunctionNode)scriptOrFn).addLiveLocals(node, null);
return false;
}
// calculate the max locals
maxLocals = maxLocals > count ? maxLocals : count;
// create a locals list
int[] ls = new int[count];
int s = 0;
for (int i = 0; i < firstFreeLocal; i++) {
if (locals[i] != 0) {
ls[s] = i;
s++;
}
}
// save the locals
((FunctionNode)scriptOrFn).addLiveLocals(node, ls);
// save locals
generateGetGeneratorLocalsState();
for (int i = 0; i < count; i++) {
cfw.add(ByteCode.DUP);
cfw.addLoadConstant(i);
cfw.addALoad(ls[i]);
cfw.add(ByteCode.AASTORE);
}
// pop the array off the stack
cfw.add(ByteCode.POP);
return true;
}
private void visitSwitch(Jump switchNode, Node child)
{
// See comments in IRFactory.createSwitch() for description
// of SWITCH node
generateExpression(child, switchNode);
// save selector value
short selector = getNewWordLocal();
cfw.addAStore(selector);
for (Jump caseNode = (Jump)child.getNext();
caseNode != null;
caseNode = (Jump)caseNode.getNext())
{
if (caseNode.getType() != Token.CASE)
throw Codegen.badTree();
Node test = caseNode.getFirstChild();
generateExpression(test, caseNode);
cfw.addALoad(selector);
addScriptRuntimeInvoke("shallowEq",
"(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+")Z");
addGoto(caseNode.target, ByteCode.IFNE);
}
releaseWordLocal(selector);
}
private void visitTypeofname(Node node)
{
if (hasVarsInRegs) {
int varIndex = fnCurrent.fnode.getIndexForNameNode(node);
if (varIndex >= 0) {
if (fnCurrent.isNumberVar(varIndex)) {
cfw.addPush("number");
} else if (varIsDirectCallParameter(varIndex)) {
int dcp_register = varRegisters[varIndex];
cfw.addALoad(dcp_register);
cfw.add(ByteCode.GETSTATIC, "java/lang/Void", "TYPE",
"Ljava/lang/Class;");
int isNumberLabel = cfw.acquireLabel();
cfw.add(ByteCode.IF_ACMPEQ, isNumberLabel);
short stack = cfw.getStackTop();
cfw.addALoad(dcp_register);
addScriptRuntimeInvoke("typeof",
"(Ljava/lang/Object;"
+")Ljava/lang/String;");
int beyond = cfw.acquireLabel();
cfw.add(ByteCode.GOTO, beyond);
cfw.markLabel(isNumberLabel, stack);
cfw.addPush("number");
cfw.markLabel(beyond);
} else {
cfw.addALoad(varRegisters[varIndex]);
addScriptRuntimeInvoke("typeof",
"(Ljava/lang/Object;"
+")Ljava/lang/String;");
}
return;
}
}
cfw.addALoad(variableObjectLocal);
cfw.addPush(node.getString());
addScriptRuntimeInvoke("typeofName",
"(Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/String;"
+")Ljava/lang/String;");
}
/**
* Save the current code offset. This saved code offset is used to
* compute instruction counts in subsequent calls to
* {@link #addInstructionCount()}.
*/
private void saveCurrentCodeOffset() {
savedCodeOffset = cfw.getCurrentCodeOffset();
}
/**
* Generate calls to ScriptRuntime.addInstructionCount to keep track of
* executed instructions and call observeInstructionCount()
* if a threshold is exceeded.
* Calculates the count from getCurrentCodeOffset - savedCodeOffset
*/
private void addInstructionCount() {
int count = cfw.getCurrentCodeOffset() - savedCodeOffset;
if (count == 0)
return;
addInstructionCount(count);
}
/**
* Generate calls to ScriptRuntime.addInstructionCount to keep track of
* executed instructions and call observeInstructionCount()
* if a threshold is exceeded.
* Takes the count as a parameter - used to add monitoring to loops and
* other blocks that don't have any ops - this allows
* for monitoring/killing of while(true) loops and such.
*/
private void addInstructionCount(int count) {
cfw.addALoad(contextLocal);
cfw.addPush(count);
addScriptRuntimeInvoke("addInstructionCount",
"(Lorg/mozilla/javascript/Context;"
+"I)V");
}
private void visitIncDec(Node node)
{
int incrDecrMask = node.getExistingIntProp(Node.INCRDECR_PROP);
Node child = node.getFirstChild();
switch (child.getType()) {
case Token.GETVAR:
if (!hasVarsInRegs) Kit.codeBug();
if (node.getIntProp(Node.ISNUMBER_PROP, -1) != -1) {
boolean post = ((incrDecrMask & Node.POST_FLAG) != 0);
int varIndex = fnCurrent.getVarIndex(child);
short reg = varRegisters[varIndex];
int offset = varIsDirectCallParameter(varIndex) ? 1 : 0;
cfw.addDLoad(reg + offset);
if (post) {
cfw.add(ByteCode.DUP2);
}
cfw.addPush(1.0);
if ((incrDecrMask & Node.DECR_FLAG) == 0) {
cfw.add(ByteCode.DADD);
} else {
cfw.add(ByteCode.DSUB);
}
if (!post) {
cfw.add(ByteCode.DUP2);
}
cfw.addDStore(reg + offset);
} else {
boolean post = ((incrDecrMask & Node.POST_FLAG) != 0);
int varIndex = fnCurrent.getVarIndex(child);
short reg = varRegisters[varIndex];
cfw.addALoad(reg);
if (post) {
cfw.add(ByteCode.DUP);
}
addObjectToDouble();
cfw.addPush(1.0);
if ((incrDecrMask & Node.DECR_FLAG) == 0) {
cfw.add(ByteCode.DADD);
} else {
cfw.add(ByteCode.DSUB);
}
addDoubleWrap();
if (!post) {
cfw.add(ByteCode.DUP);
}
cfw.addAStore(reg);
break;
}
break;
case Token.NAME:
cfw.addALoad(variableObjectLocal);
cfw.addPush(child.getString()); // push name
cfw.addALoad(contextLocal);
cfw.addPush(incrDecrMask);
addScriptRuntimeInvoke("nameIncrDecr",
"(Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+"I)Ljava/lang/Object;");
break;
case Token.GETPROPNOWARN:
throw Kit.codeBug();
case Token.GETPROP: {
Node getPropChild = child.getFirstChild();
generateExpression(getPropChild, node);
generateExpression(getPropChild.getNext(), node);
cfw.addALoad(contextLocal);
cfw.addPush(incrDecrMask);
addScriptRuntimeInvoke("propIncrDecr",
"(Ljava/lang/Object;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+"I)Ljava/lang/Object;");
break;
}
case Token.GETELEM: {
Node elemChild = child.getFirstChild();
generateExpression(elemChild, node);
generateExpression(elemChild.getNext(), node);
cfw.addALoad(contextLocal);
cfw.addPush(incrDecrMask);
if (elemChild.getNext().getIntProp(Node.ISNUMBER_PROP, -1) != -1) {
addOptRuntimeInvoke("elemIncrDecr",
"(Ljava/lang/Object;"
+"D"
+"Lorg/mozilla/javascript/Context;"
+"I"
+")Ljava/lang/Object;");
} else {
addScriptRuntimeInvoke("elemIncrDecr",
"(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"I"
+")Ljava/lang/Object;");
}
break;
}
case Token.GET_REF: {
Node refChild = child.getFirstChild();
generateExpression(refChild, node);
cfw.addALoad(contextLocal);
cfw.addPush(incrDecrMask);
addScriptRuntimeInvoke(
"refIncrDecr",
"(Lorg/mozilla/javascript/Ref;"
+"Lorg/mozilla/javascript/Context;"
+"I)Ljava/lang/Object;");
break;
}
default:
Codegen.badTree();
}
}
private static boolean isArithmeticNode(Node node)
{
int type = node.getType();
return (type == Token.SUB)
|| (type == Token.MOD)
|| (type == Token.DIV)
|| (type == Token.MUL);
}
private void visitArithmetic(Node node, int opCode, Node child,
Node parent)
{
int childNumberFlag = node.getIntProp(Node.ISNUMBER_PROP, -1);
if (childNumberFlag != -1) {
generateExpression(child, node);
generateExpression(child.getNext(), node);
cfw.add(opCode);
}
else {
boolean childOfArithmetic = isArithmeticNode(parent);
generateExpression(child, node);
if (!isArithmeticNode(child))
addObjectToDouble();
generateExpression(child.getNext(), node);
if (!isArithmeticNode(child.getNext()))
addObjectToDouble();
cfw.add(opCode);
if (!childOfArithmetic) {
addDoubleWrap();
}
}
}
private void visitBitOp(Node node, int type, Node child)
{
int childNumberFlag = node.getIntProp(Node.ISNUMBER_PROP, -1);
generateExpression(child, node);
// special-case URSH; work with the target arg as a long, so
// that we can return a 32-bit unsigned value, and call
// toUint32 instead of toInt32.
if (type == Token.URSH) {
addScriptRuntimeInvoke("toUint32", "(Ljava/lang/Object;)J");
generateExpression(child.getNext(), node);
addScriptRuntimeInvoke("toInt32", "(Ljava/lang/Object;)I");
// Looks like we need to explicitly mask the shift to 5 bits -
// LUSHR takes 6 bits.
cfw.addPush(31);
cfw.add(ByteCode.IAND);
cfw.add(ByteCode.LUSHR);
cfw.add(ByteCode.L2D);
addDoubleWrap();
return;
}
if (childNumberFlag == -1) {
addScriptRuntimeInvoke("toInt32", "(Ljava/lang/Object;)I");
generateExpression(child.getNext(), node);
addScriptRuntimeInvoke("toInt32", "(Ljava/lang/Object;)I");
}
else {
addScriptRuntimeInvoke("toInt32", "(D)I");
generateExpression(child.getNext(), node);
addScriptRuntimeInvoke("toInt32", "(D)I");
}
switch (type) {
case Token.BITOR:
cfw.add(ByteCode.IOR);
break;
case Token.BITXOR:
cfw.add(ByteCode.IXOR);
break;
case Token.BITAND:
cfw.add(ByteCode.IAND);
break;
case Token.RSH:
cfw.add(ByteCode.ISHR);
break;
case Token.LSH:
cfw.add(ByteCode.ISHL);
break;
default:
throw Codegen.badTree();
}
cfw.add(ByteCode.I2D);
if (childNumberFlag == -1) {
addDoubleWrap();
}
}
private int nodeIsDirectCallParameter(Node node)
{
if (node.getType() == Token.GETVAR
&& inDirectCallFunction && !itsForcedObjectParameters)
{
int varIndex = fnCurrent.getVarIndex(node);
if (fnCurrent.isParameter(varIndex)) {
return varRegisters[varIndex];
}
}
return -1;
}
private boolean varIsDirectCallParameter(int varIndex)
{
return fnCurrent.isParameter(varIndex)
&& inDirectCallFunction && !itsForcedObjectParameters;
}
private void genSimpleCompare(int type, int trueGOTO, int falseGOTO)
{
if (trueGOTO == -1) throw Codegen.badTree();
switch (type) {
case Token.LE :
cfw.add(ByteCode.DCMPG);
cfw.add(ByteCode.IFLE, trueGOTO);
break;
case Token.GE :
cfw.add(ByteCode.DCMPL);
cfw.add(ByteCode.IFGE, trueGOTO);
break;
case Token.LT :
cfw.add(ByteCode.DCMPG);
cfw.add(ByteCode.IFLT, trueGOTO);
break;
case Token.GT :
cfw.add(ByteCode.DCMPL);
cfw.add(ByteCode.IFGT, trueGOTO);
break;
default :
throw Codegen.badTree();
}
if (falseGOTO != -1)
cfw.add(ByteCode.GOTO, falseGOTO);
}
private void visitIfJumpRelOp(Node node, Node child,
int trueGOTO, int falseGOTO)
{
if (trueGOTO == -1 || falseGOTO == -1) throw Codegen.badTree();
int type = node.getType();
Node rChild = child.getNext();
if (type == Token.INSTANCEOF || type == Token.IN) {
generateExpression(child, node);
generateExpression(rChild, node);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
(type == Token.INSTANCEOF) ? "instanceOf" : "in",
"(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Z");
cfw.add(ByteCode.IFNE, trueGOTO);
cfw.add(ByteCode.GOTO, falseGOTO);
return;
}
int childNumberFlag = node.getIntProp(Node.ISNUMBER_PROP, -1);
int left_dcp_register = nodeIsDirectCallParameter(child);
int right_dcp_register = nodeIsDirectCallParameter(rChild);
if (childNumberFlag != -1) {
// Force numeric context on both parameters and optimize
// direct call case as Optimizer currently does not handle it
if (childNumberFlag != Node.RIGHT) {
// Left already has number content
generateExpression(child, node);
} else if (left_dcp_register != -1) {
dcpLoadAsNumber(left_dcp_register);
} else {
generateExpression(child, node);
addObjectToDouble();
}
if (childNumberFlag != Node.LEFT) {
// Right already has number content
generateExpression(rChild, node);
} else if (right_dcp_register != -1) {
dcpLoadAsNumber(right_dcp_register);
} else {
generateExpression(rChild, node);
addObjectToDouble();
}
genSimpleCompare(type, trueGOTO, falseGOTO);
} else {
if (left_dcp_register != -1 && right_dcp_register != -1) {
// Generate code to dynamically check for number content
// if both operands are dcp
short stack = cfw.getStackTop();
int leftIsNotNumber = cfw.acquireLabel();
cfw.addALoad(left_dcp_register);
cfw.add(ByteCode.GETSTATIC,
"java/lang/Void",
"TYPE",
"Ljava/lang/Class;");
cfw.add(ByteCode.IF_ACMPNE, leftIsNotNumber);
cfw.addDLoad(left_dcp_register + 1);
dcpLoadAsNumber(right_dcp_register);
genSimpleCompare(type, trueGOTO, falseGOTO);
if (stack != cfw.getStackTop()) throw Codegen.badTree();
cfw.markLabel(leftIsNotNumber);
int rightIsNotNumber = cfw.acquireLabel();
cfw.addALoad(right_dcp_register);
cfw.add(ByteCode.GETSTATIC,
"java/lang/Void",
"TYPE",
"Ljava/lang/Class;");
cfw.add(ByteCode.IF_ACMPNE, rightIsNotNumber);
cfw.addALoad(left_dcp_register);
addObjectToDouble();
cfw.addDLoad(right_dcp_register + 1);
genSimpleCompare(type, trueGOTO, falseGOTO);
if (stack != cfw.getStackTop()) throw Codegen.badTree();
cfw.markLabel(rightIsNotNumber);
// Load both register as objects to call generic cmp_*
cfw.addALoad(left_dcp_register);
cfw.addALoad(right_dcp_register);
} else {
generateExpression(child, node);
generateExpression(rChild, node);
}
if (type == Token.GE || type == Token.GT) {
cfw.add(ByteCode.SWAP);
}
String routine = ((type == Token.LT)
|| (type == Token.GT)) ? "cmp_LT" : "cmp_LE";
addScriptRuntimeInvoke(routine,
"(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+")Z");
cfw.add(ByteCode.IFNE, trueGOTO);
cfw.add(ByteCode.GOTO, falseGOTO);
}
}
private void visitIfJumpEqOp(Node node, Node child,
int trueGOTO, int falseGOTO)
{
if (trueGOTO == -1 || falseGOTO == -1) throw Codegen.badTree();
short stackInitial = cfw.getStackTop();
int type = node.getType();
Node rChild = child.getNext();
// Optimize if one of operands is null
if (child.getType() == Token.NULL || rChild.getType() == Token.NULL) {
// eq is symmetric in this case
if (child.getType() == Token.NULL) {
child = rChild;
}
generateExpression(child, node);
if (type == Token.SHEQ || type == Token.SHNE) {
int testCode = (type == Token.SHEQ)
? ByteCode.IFNULL : ByteCode.IFNONNULL;
cfw.add(testCode, trueGOTO);
} else {
if (type != Token.EQ) {
// swap false/true targets for !=
if (type != Token.NE) throw Codegen.badTree();
int tmp = trueGOTO;
trueGOTO = falseGOTO;
falseGOTO = tmp;
}
cfw.add(ByteCode.DUP);
int undefCheckLabel = cfw.acquireLabel();
cfw.add(ByteCode.IFNONNULL, undefCheckLabel);
short stack = cfw.getStackTop();
cfw.add(ByteCode.POP);
cfw.add(ByteCode.GOTO, trueGOTO);
cfw.markLabel(undefCheckLabel, stack);
Codegen.pushUndefined(cfw);
cfw.add(ByteCode.IF_ACMPEQ, trueGOTO);
}
cfw.add(ByteCode.GOTO, falseGOTO);
} else {
int child_dcp_register = nodeIsDirectCallParameter(child);
if (child_dcp_register != -1
&& rChild.getType() == Token.TO_OBJECT)
{
Node convertChild = rChild.getFirstChild();
if (convertChild.getType() == Token.NUMBER) {
cfw.addALoad(child_dcp_register);
cfw.add(ByteCode.GETSTATIC,
"java/lang/Void",
"TYPE",
"Ljava/lang/Class;");
int notNumbersLabel = cfw.acquireLabel();
cfw.add(ByteCode.IF_ACMPNE, notNumbersLabel);
cfw.addDLoad(child_dcp_register + 1);
cfw.addPush(convertChild.getDouble());
cfw.add(ByteCode.DCMPL);
if (type == Token.EQ)
cfw.add(ByteCode.IFEQ, trueGOTO);
else
cfw.add(ByteCode.IFNE, trueGOTO);
cfw.add(ByteCode.GOTO, falseGOTO);
cfw.markLabel(notNumbersLabel);
// fall thru into generic handling
}
}
generateExpression(child, node);
generateExpression(rChild, node);
String name;
int testCode;
switch (type) {
case Token.EQ:
name = "eq";
testCode = ByteCode.IFNE;
break;
case Token.NE:
name = "eq";
testCode = ByteCode.IFEQ;
break;
case Token.SHEQ:
name = "shallowEq";
testCode = ByteCode.IFNE;
break;
case Token.SHNE:
name = "shallowEq";
testCode = ByteCode.IFEQ;
break;
default:
throw Codegen.badTree();
}
addScriptRuntimeInvoke(name,
"(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+")Z");
cfw.add(testCode, trueGOTO);
cfw.add(ByteCode.GOTO, falseGOTO);
}
if (stackInitial != cfw.getStackTop()) throw Codegen.badTree();
}
private void visitSetName(Node node, Node child)
{
String name = node.getFirstChild().getString();
while (child != null) {
generateExpression(child, node);
child = child.getNext();
}
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
cfw.addPush(name);
addScriptRuntimeInvoke(
"setName",
"(Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/String;"
+")Ljava/lang/Object;");
}
private void visitStrictSetName(Node node, Node child)
{
String name = node.getFirstChild().getString();
while (child != null) {
generateExpression(child, node);
child = child.getNext();
}
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
cfw.addPush(name);
addScriptRuntimeInvoke(
"strictSetName",
"(Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/String;"
+")Ljava/lang/Object;");
}
private void visitSetConst(Node node, Node child)
{
String name = node.getFirstChild().getString();
while (child != null) {
generateExpression(child, node);
child = child.getNext();
}
cfw.addALoad(contextLocal);
cfw.addPush(name);
addScriptRuntimeInvoke(
"setConst",
"(Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+"Ljava/lang/String;"
+")Ljava/lang/Object;");
}
private void visitGetVar(Node node)
{
if (!hasVarsInRegs) Kit.codeBug();
int varIndex = fnCurrent.getVarIndex(node);
short reg = varRegisters[varIndex];
if (varIsDirectCallParameter(varIndex)) {
// Remember that here the isNumber flag means that we
// want to use the incoming parameter in a Number
// context, so test the object type and convert the
// value as necessary.
if (node.getIntProp(Node.ISNUMBER_PROP, -1) != -1) {
dcpLoadAsNumber(reg);
} else {
dcpLoadAsObject(reg);
}
} else if (fnCurrent.isNumberVar(varIndex)) {
cfw.addDLoad(reg);
} else {
cfw.addALoad(reg);
}
}
private void visitSetVar(Node node, Node child, boolean needValue)
{
if (!hasVarsInRegs) Kit.codeBug();
int varIndex = fnCurrent.getVarIndex(node);
generateExpression(child.getNext(), node);
boolean isNumber = (node.getIntProp(Node.ISNUMBER_PROP, -1) != -1);
short reg = varRegisters[varIndex];
boolean [] constDeclarations = fnCurrent.fnode.getParamAndVarConst();
if (constDeclarations[varIndex]) {
if (!needValue) {
if (isNumber)
cfw.add(ByteCode.POP2);
else
cfw.add(ByteCode.POP);
}
}
else if (varIsDirectCallParameter(varIndex)) {
if (isNumber) {
if (needValue) cfw.add(ByteCode.DUP2);
cfw.addALoad(reg);
cfw.add(ByteCode.GETSTATIC,
"java/lang/Void",
"TYPE",
"Ljava/lang/Class;");
int isNumberLabel = cfw.acquireLabel();
int beyond = cfw.acquireLabel();
cfw.add(ByteCode.IF_ACMPEQ, isNumberLabel);
short stack = cfw.getStackTop();
addDoubleWrap();
cfw.addAStore(reg);
cfw.add(ByteCode.GOTO, beyond);
cfw.markLabel(isNumberLabel, stack);
cfw.addDStore(reg + 1);
cfw.markLabel(beyond);
}
else {
if (needValue) cfw.add(ByteCode.DUP);
cfw.addAStore(reg);
}
} else {
boolean isNumberVar = fnCurrent.isNumberVar(varIndex);
if (isNumber) {
if (isNumberVar) {
cfw.addDStore(reg);
if (needValue) cfw.addDLoad(reg);
} else {
if (needValue) cfw.add(ByteCode.DUP2);
// Cannot save number in variable since !isNumberVar,
// so convert to object
addDoubleWrap();
cfw.addAStore(reg);
}
} else {
if (isNumberVar) Kit.codeBug();
cfw.addAStore(reg);
if (needValue) cfw.addALoad(reg);
}
}
}
private void visitSetConstVar(Node node, Node child, boolean needValue)
{
if (!hasVarsInRegs) Kit.codeBug();
int varIndex = fnCurrent.getVarIndex(node);
generateExpression(child.getNext(), node);
boolean isNumber = (node.getIntProp(Node.ISNUMBER_PROP, -1) != -1);
short reg = varRegisters[varIndex];
int beyond = cfw.acquireLabel();
int noAssign = cfw.acquireLabel();
if (isNumber) {
cfw.addILoad(reg + 2);
cfw.add(ByteCode.IFNE, noAssign);
short stack = cfw.getStackTop();
cfw.addPush(1);
cfw.addIStore(reg + 2);
cfw.addDStore(reg);
if (needValue) {
cfw.addDLoad(reg);
cfw.markLabel(noAssign, stack);
} else {
cfw.add(ByteCode.GOTO, beyond);
cfw.markLabel(noAssign, stack);
cfw.add(ByteCode.POP2);
}
}
else {
cfw.addILoad(reg + 1);
cfw.add(ByteCode.IFNE, noAssign);
short stack = cfw.getStackTop();
cfw.addPush(1);
cfw.addIStore(reg + 1);
cfw.addAStore(reg);
if (needValue) {
cfw.addALoad(reg);
cfw.markLabel(noAssign, stack);
} else {
cfw.add(ByteCode.GOTO, beyond);
cfw.markLabel(noAssign, stack);
cfw.add(ByteCode.POP);
}
}
cfw.markLabel(beyond);
}
private void visitGetProp(Node node, Node child)
{
generateExpression(child, node); // object
Node nameChild = child.getNext();
generateExpression(nameChild, node); // the name
if (node.getType() == Token.GETPROPNOWARN) {
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"getObjectPropNoWarn",
"(Ljava/lang/Object;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
return;
}
/*
for 'this.foo' we call getObjectProp(Scriptable...) which can
skip some casting overhead.
*/
int childType = child.getType();
if (childType == Token.THIS && nameChild.getType() == Token.STRING) {
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"getObjectProp",
"(Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
} else {
cfw.addALoad(contextLocal);
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke(
"getObjectProp",
"(Ljava/lang/Object;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Ljava/lang/Object;");
}
}
private void visitSetProp(int type, Node node, Node child)
{
Node objectChild = child;
generateExpression(child, node);
child = child.getNext();
if (type == Token.SETPROP_OP) {
cfw.add(ByteCode.DUP);
}
Node nameChild = child;
generateExpression(child, node);
child = child.getNext();
if (type == Token.SETPROP_OP) {
// stack: ... object object name -> ... object name object name
cfw.add(ByteCode.DUP_X1);
//for 'this.foo += ...' we call thisGet which can skip some
//casting overhead.
if (objectChild.getType() == Token.THIS
&& nameChild.getType() == Token.STRING)
{
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"getObjectProp",
"(Lorg/mozilla/javascript/Scriptable;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
} else {
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"getObjectProp",
"(Ljava/lang/Object;"
+"Ljava/lang/String;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
}
}
generateExpression(child, node);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"setObjectProp",
"(Ljava/lang/Object;"
+"Ljava/lang/String;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
}
private void visitSetElem(int type, Node node, Node child)
{
generateExpression(child, node);
child = child.getNext();
if (type == Token.SETELEM_OP) {
cfw.add(ByteCode.DUP);
}
generateExpression(child, node);
child = child.getNext();
boolean indexIsNumber = (node.getIntProp(Node.ISNUMBER_PROP, -1) != -1);
if (type == Token.SETELEM_OP) {
if (indexIsNumber) {
// stack: ... object object number
// -> ... object number object number
cfw.add(ByteCode.DUP2_X1);
cfw.addALoad(contextLocal);
addOptRuntimeInvoke(
"getObjectIndex",
"(Ljava/lang/Object;D"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
} else {
// stack: ... object object indexObject
// -> ... object indexObject object indexObject
cfw.add(ByteCode.DUP_X1);
cfw.addALoad(contextLocal);
addScriptRuntimeInvoke(
"getObjectElem",
"(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
}
}
generateExpression(child, node);
cfw.addALoad(contextLocal);
if (indexIsNumber) {
addScriptRuntimeInvoke(
"setObjectIndex",
"(Ljava/lang/Object;"
+"D"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
} else {
addScriptRuntimeInvoke(
"setObjectElem",
"(Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Context;"
+")Ljava/lang/Object;");
}
}
private void visitDotQuery(Node node, Node child)
{
updateLineNumber(node);
generateExpression(child, node);
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke("enterDotQuery",
"(Ljava/lang/Object;"
+"Lorg/mozilla/javascript/Scriptable;"
+")Lorg/mozilla/javascript/Scriptable;");
cfw.addAStore(variableObjectLocal);
// add push null/pop with label in between to simplify code for loop
// continue when it is necessary to pop the null result from
// updateDotQuery
cfw.add(ByteCode.ACONST_NULL);
int queryLoopStart = cfw.acquireLabel();
cfw.markLabel(queryLoopStart); // loop continue jumps here
cfw.add(ByteCode.POP);
generateExpression(child.getNext(), node);
addScriptRuntimeInvoke("toBoolean", "(Ljava/lang/Object;)Z");
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke("updateDotQuery",
"(Z"
+"Lorg/mozilla/javascript/Scriptable;"
+")Ljava/lang/Object;");
cfw.add(ByteCode.DUP);
cfw.add(ByteCode.IFNULL, queryLoopStart);
// stack: ... non_null_result_of_updateDotQuery
cfw.addALoad(variableObjectLocal);
addScriptRuntimeInvoke("leaveDotQuery",
"(Lorg/mozilla/javascript/Scriptable;"
+")Lorg/mozilla/javascript/Scriptable;");
cfw.addAStore(variableObjectLocal);
}
private int getLocalBlockRegister(Node node)
{
Node localBlock = (Node)node.getProp(Node.LOCAL_BLOCK_PROP);
int localSlot = localBlock.getExistingIntProp(Node.LOCAL_PROP);
return localSlot;
}
private void dcpLoadAsNumber(int dcp_register)
{
cfw.addALoad(dcp_register);
cfw.add(ByteCode.GETSTATIC,
"java/lang/Void",
"TYPE",
"Ljava/lang/Class;");
int isNumberLabel = cfw.acquireLabel();
cfw.add(ByteCode.IF_ACMPEQ, isNumberLabel);
short stack = cfw.getStackTop();
cfw.addALoad(dcp_register);
addObjectToDouble();
int beyond = cfw.acquireLabel();
cfw.add(ByteCode.GOTO, beyond);
cfw.markLabel(isNumberLabel, stack);
cfw.addDLoad(dcp_register + 1);
cfw.markLabel(beyond);
}
private void dcpLoadAsObject(int dcp_register)
{
cfw.addALoad(dcp_register);
cfw.add(ByteCode.GETSTATIC,
"java/lang/Void",
"TYPE",
"Ljava/lang/Class;");
int isNumberLabel = cfw.acquireLabel();
cfw.add(ByteCode.IF_ACMPEQ, isNumberLabel);
short stack = cfw.getStackTop();
cfw.addALoad(dcp_register);
int beyond = cfw.acquireLabel();
cfw.add(ByteCode.GOTO, beyond);
cfw.markLabel(isNumberLabel, stack);
cfw.addDLoad(dcp_register + 1);
addDoubleWrap();
cfw.markLabel(beyond);
}
private void addGoto(Node target, int jumpcode)
{
int targetLabel = getTargetLabel(target);
cfw.add(jumpcode, targetLabel);
}
private void addObjectToDouble()
{
addScriptRuntimeInvoke("toNumber", "(Ljava/lang/Object;)D");
}
private void addNewObjectArray(int size)
{
if (size == 0) {
if (itsZeroArgArray >= 0) {
cfw.addALoad(itsZeroArgArray);
} else {
cfw.add(ByteCode.GETSTATIC,
"org/mozilla/javascript/ScriptRuntime",
"emptyArgs", "[Ljava/lang/Object;");
}
} else {
cfw.addPush(size);
cfw.add(ByteCode.ANEWARRAY, "java/lang/Object");
}
}
private void addScriptRuntimeInvoke(String methodName,
String methodSignature)
{
cfw.addInvoke(ByteCode.INVOKESTATIC,
"org.mozilla.javascript.ScriptRuntime",
methodName,
methodSignature);
}
private void addOptRuntimeInvoke(String methodName,
String methodSignature)
{
cfw.addInvoke(ByteCode.INVOKESTATIC,
"org/mozilla/javascript/optimizer/OptRuntime",
methodName,
methodSignature);
}
private void addJumpedBooleanWrap(int trueLabel, int falseLabel)
{
cfw.markLabel(falseLabel);
int skip = cfw.acquireLabel();
cfw.add(ByteCode.GETSTATIC, "java/lang/Boolean",
"FALSE", "Ljava/lang/Boolean;");
cfw.add(ByteCode.GOTO, skip);
cfw.markLabel(trueLabel);
cfw.add(ByteCode.GETSTATIC, "java/lang/Boolean",
"TRUE", "Ljava/lang/Boolean;");
cfw.markLabel(skip);
cfw.adjustStackTop(-1); // only have 1 of true/false
}
private void addDoubleWrap()
{
addOptRuntimeInvoke("wrapDouble", "(D)Ljava/lang/Double;");
}
/**
* Const locals use an extra slot to hold the has-been-assigned-once flag at
* runtime.
* @param isConst true iff the variable is const
* @return the register for the word pair (double/long)
*/
private short getNewWordPairLocal(boolean isConst)
{
short result = getConsecutiveSlots(2, isConst);
if (result < (MAX_LOCALS - 1)) {
locals[result] = 1;
locals[result + 1] = 1;
if (isConst)
locals[result + 2] = 1;
if (result == firstFreeLocal) {
for (int i = firstFreeLocal + 2; i < MAX_LOCALS; i++) {
if (locals[i] == 0) {
firstFreeLocal = (short) i;
if (localsMax < firstFreeLocal)
localsMax = firstFreeLocal;
return result;
}
}
}
else {
return result;
}
}
throw Context.reportRuntimeError("Program too complex " +
"(out of locals)");
}
private short getNewWordLocal(boolean isConst)
{
short result = getConsecutiveSlots(1, isConst);
if (result < (MAX_LOCALS - 1)) {
locals[result] = 1;
if (isConst)
locals[result + 1] = 1;
if (result == firstFreeLocal) {
for (int i = firstFreeLocal + 2; i < MAX_LOCALS; i++) {
if (locals[i] == 0) {
firstFreeLocal = (short) i;
if (localsMax < firstFreeLocal)
localsMax = firstFreeLocal;
return result;
}
}
}
else {
return result;
}
}
throw Context.reportRuntimeError("Program too complex " +
"(out of locals)");
}
private short getNewWordLocal()
{
short result = firstFreeLocal;
locals[result] = 1;
for (int i = firstFreeLocal + 1; i < MAX_LOCALS; i++) {
if (locals[i] == 0) {
firstFreeLocal = (short) i;
if (localsMax < firstFreeLocal)
localsMax = firstFreeLocal;
return result;
}
}
throw Context.reportRuntimeError("Program too complex " +
"(out of locals)");
}
private short getConsecutiveSlots(int count, boolean isConst) {
if (isConst)
count++;
short result = firstFreeLocal;
while (true) {
if (result >= (MAX_LOCALS - 1))
break;
int i;
for (i = 0; i < count; i++)
if (locals[result + i] != 0)
break;
if (i >= count)
break;
result++;
}
return result;
}
// This is a valid call only for a local that is allocated by default.
private void incReferenceWordLocal(short local)
{
locals[local]++;
}
// This is a valid call only for a local that is allocated by default.
private void decReferenceWordLocal(short local)
{
locals[local]--;
}
private void releaseWordLocal(short local)
{
if (local < firstFreeLocal)
firstFreeLocal = local;
locals[local] = 0;
}
static final int GENERATOR_TERMINATE = -1;
static final int GENERATOR_START = 0;
static final int GENERATOR_YIELD_START = 1;
ClassFileWriter cfw;
Codegen codegen;
CompilerEnvirons compilerEnv;
ScriptNode scriptOrFn;
public int scriptOrFnIndex;
private int savedCodeOffset;
private OptFunctionNode fnCurrent;
private boolean isTopLevel;
private static final int MAX_LOCALS = 256;
private int[] locals;
private short firstFreeLocal;
private short localsMax;
private int itsLineNumber;
private boolean hasVarsInRegs;
private short[] varRegisters;
private boolean inDirectCallFunction;
private boolean itsForcedObjectParameters;
private int enterAreaStartLabel;
private int epilogueLabel;
// special known locals. If you add a new local here, be sure
// to initialize it to -1 in initBodyGeneration
private short variableObjectLocal;
private short popvLocal;
private short contextLocal;
private short argsLocal;
private short operationLocal;
private short thisObjLocal;
private short funObjLocal;
private short itsZeroArgArray;
private short itsOneArgArray;
private short scriptRegexpLocal;
private short generatorStateLocal;
private boolean isGenerator;
private int generatorSwitch;
private int maxLocals = 0;
private int maxStack = 0;
private Map finallys;
static class FinallyReturnPoint {
public List jsrPoints = new ArrayList();
public int tableLabel = 0;
}
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/optimizer/DataFlowBitSet.java 0000644 0001750 0001750 00000007705 10776622373 030450 0 ustar cavedon cavedon /* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
* Roger Lawrence
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript.optimizer;
class DataFlowBitSet {
private int itsBits[];
private int itsSize;
DataFlowBitSet(int size)
{
itsSize = size;
itsBits = new int[(size + 31) >> 5];
}
void set(int n)
{
if (!(0 <= n && n < itsSize)) badIndex(n);
itsBits[n >> 5] |= 1 << (n & 31);
}
boolean test(int n)
{
if (!(0 <= n && n < itsSize)) badIndex(n);
return ((itsBits[n >> 5] & (1 << (n & 31))) != 0);
}
void not()
{
int bitsLength = itsBits.length;
for (int i = 0; i < bitsLength; i++)
itsBits[i] = ~itsBits[i];
}
void clear(int n)
{
if (!(0 <= n && n < itsSize)) badIndex(n);
itsBits[n >> 5] &= ~(1 << (n & 31));
}
void clear()
{
int bitsLength = itsBits.length;
for (int i = 0; i < bitsLength; i++)
itsBits[i] = 0;
}
void or(DataFlowBitSet b)
{
int bitsLength = itsBits.length;
for (int i = 0; i < bitsLength; i++)
itsBits[i] |= b.itsBits[i];
}
@Override
public String toString()
{
StringBuffer sb = new StringBuffer();
sb.append("DataFlowBitSet, size = ");
sb.append(itsSize);
sb.append('\n');
int bitsLength = itsBits.length;
for (int i = 0; i < bitsLength; i++) {
sb.append(Integer.toHexString(itsBits[i]));
sb.append(' ');
}
return sb.toString();
}
boolean df(DataFlowBitSet in, DataFlowBitSet gen, DataFlowBitSet notKill)
{
int bitsLength = itsBits.length;
boolean changed = false;
for (int i = 0; i < bitsLength; i++) {
int oldBits = itsBits[i];
itsBits[i] = (in.itsBits[i] | gen.itsBits[i]) & notKill.itsBits[i];
changed |= (oldBits != itsBits[i]);
}
return changed;
}
boolean df2(DataFlowBitSet in, DataFlowBitSet gen, DataFlowBitSet notKill)
{
int bitsLength = itsBits.length;
boolean changed = false;
for (int i = 0; i < bitsLength; i++) {
int oldBits = itsBits[i];
itsBits[i] = (in.itsBits[i] & notKill.itsBits[i]) | gen.itsBits[i];
changed |= (oldBits != itsBits[i]);
}
return changed;
}
private void badIndex(int n)
{
throw new RuntimeException("DataFlowBitSet bad index " + n);
}
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/optimizer/OptFunctionNode.java 0000644 0001750 0001750 00000010621 11222455466 030673 0 ustar cavedon cavedon /* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
* Bob Jervis
* Roger Lawrence
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript.optimizer;
import org.mozilla.javascript.*;
import org.mozilla.javascript.ast.FunctionNode;
import org.mozilla.javascript.ast.ScriptNode;
final class OptFunctionNode
{
OptFunctionNode(FunctionNode fnode)
{
this.fnode = fnode;
fnode.setCompilerData(this);
}
static OptFunctionNode get(ScriptNode scriptOrFn, int i)
{
FunctionNode fnode = scriptOrFn.getFunctionNode(i);
return (OptFunctionNode)fnode.getCompilerData();
}
static OptFunctionNode get(ScriptNode scriptOrFn)
{
return (OptFunctionNode)scriptOrFn.getCompilerData();
}
boolean isTargetOfDirectCall()
{
return directTargetIndex >= 0;
}
int getDirectTargetIndex()
{
return directTargetIndex;
}
void setDirectTargetIndex(int directTargetIndex)
{
// One time action
if (directTargetIndex < 0 || this.directTargetIndex >= 0)
Kit.codeBug();
this.directTargetIndex = directTargetIndex;
}
void setParameterNumberContext(boolean b)
{
itsParameterNumberContext = b;
}
boolean getParameterNumberContext()
{
return itsParameterNumberContext;
}
int getVarCount()
{
return fnode.getParamAndVarCount();
}
boolean isParameter(int varIndex)
{
return varIndex < fnode.getParamCount();
}
boolean isNumberVar(int varIndex)
{
varIndex -= fnode.getParamCount();
if (varIndex >= 0 && numberVarFlags != null) {
return numberVarFlags[varIndex];
}
return false;
}
void setIsNumberVar(int varIndex)
{
varIndex -= fnode.getParamCount();
// Can only be used with non-parameters
if (varIndex < 0) Kit.codeBug();
if (numberVarFlags == null) {
int size = fnode.getParamAndVarCount() - fnode.getParamCount();
numberVarFlags = new boolean[size];
}
numberVarFlags[varIndex] = true;
}
int getVarIndex(Node n)
{
int index = n.getIntProp(Node.VARIABLE_PROP, -1);
if (index == -1) {
Node node;
int type = n.getType();
if (type == Token.GETVAR) {
node = n;
} else if (type == Token.SETVAR ||
type == Token.SETCONSTVAR) {
node = n.getFirstChild();
} else {
throw Kit.codeBug();
}
index = fnode.getIndexForNameNode(node);
if (index < 0) throw Kit.codeBug();
n.putIntProp(Node.VARIABLE_PROP, index);
}
return index;
}
FunctionNode fnode;
private boolean[] numberVarFlags;
private int directTargetIndex = -1;
private boolean itsParameterNumberContext;
boolean itsContainsCalls0;
boolean itsContainsCalls1;
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/optimizer/Block.java 0000644 0001750 0001750 00000053356 11222455466 026663 0 ustar cavedon cavedon /* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
* Igor Bukanov
* Roger Lawrence
* Cameron McCormack
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript.optimizer;
import org.mozilla.javascript.*;
import org.mozilla.javascript.ast.Jump;
import java.util.HashMap;
import java.util.Map;
import java.io.PrintWriter;
import java.io.StringWriter;
class Block
{
private static class FatBlock
{
private static Block[] reduceToArray(ObjToIntMap map)
{
Block[] result = null;
if (!map.isEmpty()) {
result = new Block[map.size()];
int i = 0;
ObjToIntMap.Iterator iter = map.newIterator();
for (iter.start(); !iter.done(); iter.next()) {
FatBlock fb = (FatBlock)(iter.getKey());
result[i++] = fb.realBlock;
}
}
return result;
}
void addSuccessor(FatBlock b) { successors.put(b, 0); }
void addPredecessor(FatBlock b) { predecessors.put(b, 0); }
Block[] getSuccessors() { return reduceToArray(successors); }
Block[] getPredecessors() { return reduceToArray(predecessors); }
// all the Blocks that come immediately after this
private ObjToIntMap successors = new ObjToIntMap();
// all the Blocks that come immediately before this
private ObjToIntMap predecessors = new ObjToIntMap();
Block realBlock;
}
Block(int startNodeIndex, int endNodeIndex)
{
itsStartNodeIndex = startNodeIndex;
itsEndNodeIndex = endNodeIndex;
}
static void runFlowAnalyzes(OptFunctionNode fn, Node[] statementNodes)
{
int paramCount = fn.fnode.getParamCount();
int varCount = fn.fnode.getParamAndVarCount();
int[] varTypes = new int[varCount];
// If the variable is a parameter, it could have any type.
for (int i = 0; i != paramCount; ++i) {
varTypes[i] = Optimizer.AnyType;
}
// If the variable is from a "var" statement, its typeEvent will be set
// when we see the setVar node.
for (int i = paramCount; i != varCount; ++i) {
varTypes[i] = Optimizer.NoType;
}
Block[] theBlocks = buildBlocks(statementNodes);
if (DEBUG) {
++debug_blockCount;
System.out.println("-------------------"+fn.fnode.getFunctionName()+" "+debug_blockCount+"--------");
System.out.println(toString(theBlocks, statementNodes));
}
reachingDefDataFlow(fn, statementNodes, theBlocks, varTypes);
typeFlow(fn, statementNodes, theBlocks, varTypes);
if (DEBUG) {
for (int i = 0; i < theBlocks.length; i++) {
System.out.println("For block " + theBlocks[i].itsBlockID);
theBlocks[i].printLiveOnEntrySet(fn);
}
System.out.println("Variable Table, size = " + varCount);
for (int i = 0; i != varCount; i++) {
System.out.println("["+i+"] type: "+varTypes[i]);
}
}
for (int i = paramCount; i != varCount; i++) {
if (varTypes[i] == Optimizer.NumberType) {
fn.setIsNumberVar(i);
}
}
}
private static Block[] buildBlocks(Node[] statementNodes)
{
// a mapping from each target node to the block it begins
Map theTargetBlocks = new HashMap();
ObjArray theBlocks = new ObjArray();
// there's a block that starts at index 0
int beginNodeIndex = 0;
for (int i = 0; i < statementNodes.length; i++) {
switch (statementNodes[i].getType()) {
case Token.TARGET :
{
if (i != beginNodeIndex) {
FatBlock fb = newFatBlock(beginNodeIndex, i - 1);
if (statementNodes[beginNodeIndex].getType()
== Token.TARGET)
theTargetBlocks.put(statementNodes[beginNodeIndex], fb);
theBlocks.add(fb);
// start the next block at this node
beginNodeIndex = i;
}
}
break;
case Token.IFNE :
case Token.IFEQ :
case Token.GOTO :
{
FatBlock fb = newFatBlock(beginNodeIndex, i);
if (statementNodes[beginNodeIndex].getType()
== Token.TARGET)
theTargetBlocks.put(statementNodes[beginNodeIndex], fb);
theBlocks.add(fb);
// start the next block at the next node
beginNodeIndex = i + 1;
}
break;
}
}
if (beginNodeIndex != statementNodes.length) {
FatBlock fb = newFatBlock(beginNodeIndex, statementNodes.length - 1);
if (statementNodes[beginNodeIndex].getType() == Token.TARGET)
theTargetBlocks.put(statementNodes[beginNodeIndex], fb);
theBlocks.add(fb);
}
// build successor and predecessor links
for (int i = 0; i < theBlocks.size(); i++) {
FatBlock fb = (FatBlock)(theBlocks.get(i));
Node blockEndNode = statementNodes[fb.realBlock.itsEndNodeIndex];
int blockEndNodeType = blockEndNode.getType();
if ((blockEndNodeType != Token.GOTO)
&& (i < (theBlocks.size() - 1))) {
FatBlock fallThruTarget = (FatBlock)(theBlocks.get(i + 1));
fb.addSuccessor(fallThruTarget);
fallThruTarget.addPredecessor(fb);
}
if ( (blockEndNodeType == Token.IFNE)
|| (blockEndNodeType == Token.IFEQ)
|| (blockEndNodeType == Token.GOTO) ) {
Node target = ((Jump)blockEndNode).target;
FatBlock branchTargetBlock = theTargetBlocks.get(target);
target.putProp(Node.TARGETBLOCK_PROP,
branchTargetBlock.realBlock);
fb.addSuccessor(branchTargetBlock);
branchTargetBlock.addPredecessor(fb);
}
}
Block[] result = new Block[theBlocks.size()];
for (int i = 0; i < theBlocks.size(); i++) {
FatBlock fb = (FatBlock)(theBlocks.get(i));
Block b = fb.realBlock;
b.itsSuccessors = fb.getSuccessors();
b.itsPredecessors = fb.getPredecessors();
b.itsBlockID = i;
result[i] = b;
}
return result;
}
private static FatBlock newFatBlock(int startNodeIndex, int endNodeIndex)
{
FatBlock fb = new FatBlock();
fb.realBlock = new Block(startNodeIndex, endNodeIndex);
return fb;
}
private static String toString(Block[] blockList, Node[] statementNodes)
{
if (!DEBUG) return null;
StringWriter sw = new StringWriter();
PrintWriter pw = new PrintWriter(sw);
pw.println(blockList.length + " Blocks");
for (int i = 0; i < blockList.length; i++) {
Block b = blockList[i];
pw.println("#" + b.itsBlockID);
pw.println("from " + b.itsStartNodeIndex
+ " "
+ statementNodes[b.itsStartNodeIndex].toString());
pw.println("thru " + b.itsEndNodeIndex
+ " "
+ statementNodes[b.itsEndNodeIndex].toString());
pw.print("Predecessors ");
if (b.itsPredecessors != null) {
for (int j = 0; j < b.itsPredecessors.length; j++)
pw.print(b.itsPredecessors[j].itsBlockID + " ");
pw.println();
}
else
pw.println("none");
pw.print("Successors ");
if (b.itsSuccessors != null) {
for (int j = 0; j < b.itsSuccessors.length; j++)
pw.print(b.itsSuccessors[j].itsBlockID + " ");
pw.println();
}
else
pw.println("none");
}
return sw.toString();
}
private static void reachingDefDataFlow(OptFunctionNode fn, Node[] statementNodes, Block theBlocks[], int[] varTypes)
{
/*
initialize the liveOnEntry and liveOnExit sets, then discover the variables
that are def'd by each function, and those that are used before being def'd
(hence liveOnEntry)
*/
for (int i = 0; i < theBlocks.length; i++) {
theBlocks[i].initLiveOnEntrySets(fn, statementNodes);
}
/*
this visits every block starting at the last, re-adding the predecessors of
any block whose inputs change as a result of the dataflow.
REMIND, better would be to visit in CFG postorder
*/
boolean visit[] = new boolean[theBlocks.length];
boolean doneOnce[] = new boolean[theBlocks.length];
int vIndex = theBlocks.length - 1;
boolean needRescan = false;
visit[vIndex] = true;
while (true) {
if (visit[vIndex] || !doneOnce[vIndex]) {
doneOnce[vIndex] = true;
visit[vIndex] = false;
if (theBlocks[vIndex].doReachedUseDataFlow()) {
Block pred[] = theBlocks[vIndex].itsPredecessors;
if (pred != null) {
for (int i = 0; i < pred.length; i++) {
int index = pred[i].itsBlockID;
visit[index] = true;
needRescan |= (index > vIndex);
}
}
}
}
if (vIndex == 0) {
if (needRescan) {
vIndex = theBlocks.length - 1;
needRescan = false;
}
else
break;
}
else
vIndex--;
}
/*
if any variable is live on entry to block 0, we have to mark it as
not jRegable - since it means that someone is trying to access the
'undefined'-ness of that variable.
*/
theBlocks[0].markAnyTypeVariables(varTypes);
}
private static void typeFlow(OptFunctionNode fn, Node[] statementNodes, Block theBlocks[], int[] varTypes)
{
boolean visit[] = new boolean[theBlocks.length];
boolean doneOnce[] = new boolean[theBlocks.length];
int vIndex = 0;
boolean needRescan = false;
visit[vIndex] = true;
while (true) {
if (visit[vIndex] || !doneOnce[vIndex]) {
doneOnce[vIndex] = true;
visit[vIndex] = false;
if (theBlocks[vIndex].doTypeFlow(fn, statementNodes, varTypes))
{
Block succ[] = theBlocks[vIndex].itsSuccessors;
if (succ != null) {
for (int i = 0; i < succ.length; i++) {
int index = succ[i].itsBlockID;
visit[index] = true;
needRescan |= (index < vIndex);
}
}
}
}
if (vIndex == (theBlocks.length - 1)) {
if (needRescan) {
vIndex = 0;
needRescan = false;
}
else
break;
}
else
vIndex++;
}
}
private static boolean assignType(int[] varTypes, int index, int type)
{
return type != (varTypes[index] |= type);
}
private void markAnyTypeVariables(int[] varTypes)
{
for (int i = 0; i != varTypes.length; i++) {
if (itsLiveOnEntrySet.test(i)) {
assignType(varTypes, i, Optimizer.AnyType);
}
}
}
/*
We're tracking uses and defs - in order to
build the def set and to identify the last use
nodes.
The itsNotDefSet is built reversed then flipped later.
*/
private void lookForVariableAccess(OptFunctionNode fn, Node n)
{
switch (n.getType()) {
case Token.DEC :
case Token.INC :
{
Node child = n.getFirstChild();
if (child.getType() == Token.GETVAR) {
int varIndex = fn.getVarIndex(child);
if (!itsNotDefSet.test(varIndex))
itsUseBeforeDefSet.set(varIndex);
itsNotDefSet.set(varIndex);
}
}
break;
case Token.SETVAR :
{
Node lhs = n.getFirstChild();
Node rhs = lhs.getNext();
lookForVariableAccess(fn, rhs);
itsNotDefSet.set(fn.getVarIndex(n));
}
break;
case Token.GETVAR :
{
int varIndex = fn.getVarIndex(n);
if (!itsNotDefSet.test(varIndex))
itsUseBeforeDefSet.set(varIndex);
}
break;
default :
Node child = n.getFirstChild();
while (child != null) {
lookForVariableAccess(fn, child);
child = child.getNext();
}
break;
}
}
/*
build the live on entry/exit sets.
Then walk the trees looking for defs/uses of variables
and build the def and useBeforeDef sets.
*/
private void initLiveOnEntrySets(OptFunctionNode fn, Node[] statementNodes)
{
int listLength = fn.getVarCount();
itsUseBeforeDefSet = new DataFlowBitSet(listLength);
itsNotDefSet = new DataFlowBitSet(listLength);
itsLiveOnEntrySet = new DataFlowBitSet(listLength);
itsLiveOnExitSet = new DataFlowBitSet(listLength);
for (int i = itsStartNodeIndex; i <= itsEndNodeIndex; i++) {
Node n = statementNodes[i];
lookForVariableAccess(fn, n);
}
itsNotDefSet.not(); // truth in advertising
}
/*
the liveOnEntry of each successor is the liveOnExit for this block.
The liveOnEntry for this block is -
liveOnEntry = liveOnExit - defsInThisBlock + useBeforeDefsInThisBlock
*/
private boolean doReachedUseDataFlow()
{
itsLiveOnExitSet.clear();
if (itsSuccessors != null)
for (int i = 0; i < itsSuccessors.length; i++)
itsLiveOnExitSet.or(itsSuccessors[i].itsLiveOnEntrySet);
return itsLiveOnEntrySet.df2(itsLiveOnExitSet,
itsUseBeforeDefSet, itsNotDefSet);
}
/*
the type of an expression is relatively unknown. Cases we can be sure
about are -
Literals,
Arithmetic operations - always return a Number
*/
private static int findExpressionType(OptFunctionNode fn, Node n,
int[] varTypes)
{
switch (n.getType()) {
case Token.NUMBER:
return Optimizer.NumberType;
case Token.CALL:
case Token.NEW:
case Token.REF_CALL:
return Optimizer.AnyType;
case Token.GETELEM:
return Optimizer.AnyType;
case Token.GETVAR:
return varTypes[fn.getVarIndex(n)];
case Token.INC:
case Token.DEC:
case Token.MUL:
case Token.DIV:
case Token.MOD:
case Token.BITOR:
case Token.BITXOR:
case Token.BITAND:
case Token.LSH:
case Token.RSH:
case Token.URSH:
case Token.SUB:
case Token.POS:
case Token.NEG:
return Optimizer.NumberType;
case Token.ARRAYLIT:
case Token.OBJECTLIT:
return Optimizer.AnyType; // XXX: actually, we know it's not
// number, but no type yet for that
case Token.ADD: {
// if the lhs & rhs are known to be numbers, we can be sure that's
// the result, otherwise it could be a string.
Node child = n.getFirstChild();
int lType = findExpressionType(fn, child, varTypes);
int rType = findExpressionType(fn, child.getNext(), varTypes);
return lType | rType; // we're not distinguishing strings yet
}
}
Node child = n.getFirstChild();
if (child == null) {
return Optimizer.AnyType;
} else {
int result = Optimizer.NoType;
while (child != null) {
result |= findExpressionType(fn, child, varTypes);
child = child.getNext();
}
return result;
}
}
private static boolean findDefPoints(OptFunctionNode fn, Node n,
int[] varTypes)
{
boolean result = false;
Node child = n.getFirstChild();
switch (n.getType()) {
default :
while (child != null) {
result |= findDefPoints(fn, child, varTypes);
child = child.getNext();
}
break;
case Token.DEC :
case Token.INC :
if (child.getType() == Token.GETVAR) {
// theVar is a Number now
int i = fn.getVarIndex(child);
result |= assignType(varTypes, i, Optimizer.NumberType);
}
break;
case Token.SETPROP :
case Token.SETPROP_OP :
if (child.getType() == Token.GETVAR) {
int i = fn.getVarIndex(child);
assignType(varTypes, i, Optimizer.AnyType);
}
while (child != null) {
result |= findDefPoints(fn, child, varTypes);
child = child.getNext();
}
break;
case Token.SETVAR : {
Node rValue = child.getNext();
int theType = findExpressionType(fn, rValue, varTypes);
int i = fn.getVarIndex(n);
result |= assignType(varTypes, i, theType);
break;
}
}
return result;
}
private boolean doTypeFlow(OptFunctionNode fn, Node[] statementNodes,
int[] varTypes)
{
boolean changed = false;
for (int i = itsStartNodeIndex; i <= itsEndNodeIndex; i++) {
Node n = statementNodes[i];
if (n != null)
changed |= findDefPoints(fn, n, varTypes);
}
return changed;
}
private void printLiveOnEntrySet(OptFunctionNode fn)
{
if (DEBUG) {
for (int i = 0; i < fn.getVarCount(); i++) {
String name = fn.fnode.getParamOrVarName(i);
if (itsUseBeforeDefSet.test(i))
System.out.println(name + " is used before def'd");
if (itsNotDefSet.test(i))
System.out.println(name + " is not def'd");
if (itsLiveOnEntrySet.test(i))
System.out.println(name + " is live on entry");
if (itsLiveOnExitSet.test(i))
System.out.println(name + " is live on exit");
}
}
}
// all the Blocks that come immediately after this
private Block[] itsSuccessors;
// all the Blocks that come immediately before this
private Block[] itsPredecessors;
private int itsStartNodeIndex; // the Node at the start of the block
private int itsEndNodeIndex; // the Node at the end of the block
private int itsBlockID; // a unique index for each block
// reaching def bit sets -
private DataFlowBitSet itsLiveOnEntrySet;
private DataFlowBitSet itsLiveOnExitSet;
private DataFlowBitSet itsUseBeforeDefSet;
private DataFlowBitSet itsNotDefSet;
static final boolean DEBUG = false;
private static int debug_blockCount;
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/Token.java 0000644 0001750 0001750 00000044207 11321335670 024654 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Roger Lawrence
* Mike McCabe
* Igor Bukanov
* Bob Jervis
* Milen Nankov
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript;
/**
* This class implements the JavaScript scanner.
*
* It is based on the C source files jsscan.c and jsscan.h
* in the jsref package.
*
* @see org.mozilla.javascript.Parser
*
* @author Mike McCabe
* @author Brendan Eich
*/
public class Token
{
public static enum CommentType {
LINE, BLOCK_COMMENT, JSDOC, HTML
}
// debug flags
public static final boolean printTrees = false;
static final boolean printICode = false;
static final boolean printNames = printTrees || printICode;
/**
* Token types. These values correspond to JSTokenType values in
* jsscan.c.
*/
public final static int
// start enum
ERROR = -1, // well-known as the only code < EOF
EOF = 0, // end of file token - (not EOF_CHAR)
EOL = 1, // end of line
// Interpreter reuses the following as bytecodes
FIRST_BYTECODE_TOKEN = 2,
ENTERWITH = 2,
LEAVEWITH = 3,
RETURN = 4,
GOTO = 5,
IFEQ = 6,
IFNE = 7,
SETNAME = 8,
BITOR = 9,
BITXOR = 10,
BITAND = 11,
EQ = 12,
NE = 13,
LT = 14,
LE = 15,
GT = 16,
GE = 17,
LSH = 18,
RSH = 19,
URSH = 20,
ADD = 21,
SUB = 22,
MUL = 23,
DIV = 24,
MOD = 25,
NOT = 26,
BITNOT = 27,
POS = 28,
NEG = 29,
NEW = 30,
DELPROP = 31,
TYPEOF = 32,
GETPROP = 33,
GETPROPNOWARN = 34,
SETPROP = 35,
GETELEM = 36,
SETELEM = 37,
CALL = 38,
NAME = 39,
NUMBER = 40,
STRING = 41,
NULL = 42,
THIS = 43,
FALSE = 44,
TRUE = 45,
SHEQ = 46, // shallow equality (===)
SHNE = 47, // shallow inequality (!==)
REGEXP = 48,
BINDNAME = 49,
THROW = 50,
RETHROW = 51, // rethrow caught exception: catch (e if ) use it
IN = 52,
INSTANCEOF = 53,
LOCAL_LOAD = 54,
GETVAR = 55,
SETVAR = 56,
CATCH_SCOPE = 57,
ENUM_INIT_KEYS = 58,
ENUM_INIT_VALUES = 59,
ENUM_INIT_ARRAY= 60,
ENUM_NEXT = 61,
ENUM_ID = 62,
THISFN = 63,
RETURN_RESULT = 64, // to return previously stored return result
ARRAYLIT = 65, // array literal
OBJECTLIT = 66, // object literal
GET_REF = 67, // *reference
SET_REF = 68, // *reference = something
DEL_REF = 69, // delete reference
REF_CALL = 70, // f(args) = something or f(args)++
REF_SPECIAL = 71, // reference for special properties like __proto
YIELD = 72, // JS 1.7 yield pseudo keyword
STRICT_SETNAME = 73,
// For XML support:
DEFAULTNAMESPACE = 74, // default xml namespace =
ESCXMLATTR = 75,
ESCXMLTEXT = 76,
REF_MEMBER = 77, // Reference for x.@y, x..y etc.
REF_NS_MEMBER = 78, // Reference for x.ns::y, x..ns::y etc.
REF_NAME = 79, // Reference for @y, @[y] etc.
REF_NS_NAME = 80; // Reference for ns::y, @ns::y@[y] etc.
// End of interpreter bytecodes
public final static int
LAST_BYTECODE_TOKEN = REF_NS_NAME,
TRY = 81,
SEMI = 82, // semicolon
LB = 83, // left and right brackets
RB = 84,
LC = 85, // left and right curlies (braces)
RC = 86,
LP = 87, // left and right parentheses
RP = 88,
COMMA = 89, // comma operator
ASSIGN = 90, // simple assignment (=)
ASSIGN_BITOR = 91, // |=
ASSIGN_BITXOR = 92, // ^=
ASSIGN_BITAND = 93, // |=
ASSIGN_LSH = 94, // <<=
ASSIGN_RSH = 95, // >>=
ASSIGN_URSH = 96, // >>>=
ASSIGN_ADD = 97, // +=
ASSIGN_SUB = 98, // -=
ASSIGN_MUL = 99, // *=
ASSIGN_DIV = 100, // /=
ASSIGN_MOD = 101; // %=
public final static int
FIRST_ASSIGN = ASSIGN,
LAST_ASSIGN = ASSIGN_MOD,
HOOK = 102, // conditional (?:)
COLON = 103,
OR = 104, // logical or (||)
AND = 105, // logical and (&&)
INC = 106, // increment/decrement (++ --)
DEC = 107,
DOT = 108, // member operator (.)
FUNCTION = 109, // function keyword
EXPORT = 110, // export keyword
IMPORT = 111, // import keyword
IF = 112, // if keyword
ELSE = 113, // else keyword
SWITCH = 114, // switch keyword
CASE = 115, // case keyword
DEFAULT = 116, // default keyword
WHILE = 117, // while keyword
DO = 118, // do keyword
FOR = 119, // for keyword
BREAK = 120, // break keyword
CONTINUE = 121, // continue keyword
VAR = 122, // var keyword
WITH = 123, // with keyword
CATCH = 124, // catch keyword
FINALLY = 125, // finally keyword
VOID = 126, // void keyword
RESERVED = 127, // reserved keywords
EMPTY = 128,
/* types used for the parse tree - these never get returned
* by the scanner.
*/
BLOCK = 129, // statement block
LABEL = 130, // label
TARGET = 131,
LOOP = 132,
EXPR_VOID = 133, // expression statement in functions
EXPR_RESULT = 134, // expression statement in scripts
JSR = 135,
SCRIPT = 136, // top-level node for entire script
TYPEOFNAME = 137, // for typeof(simple-name)
USE_STACK = 138,
SETPROP_OP = 139, // x.y op= something
SETELEM_OP = 140, // x[y] op= something
LOCAL_BLOCK = 141,
SET_REF_OP = 142, // *reference op= something
// For XML support:
DOTDOT = 143, // member operator (..)
COLONCOLON = 144, // namespace::name
XML = 145, // XML type
DOTQUERY = 146, // .() -- e.g., x.emps.emp.(name == "terry")
XMLATTR = 147, // @
XMLEND = 148,
// Optimizer-only-tokens
TO_OBJECT = 149,
TO_DOUBLE = 150,
GET = 151, // JS 1.5 get pseudo keyword
SET = 152, // JS 1.5 set pseudo keyword
LET = 153, // JS 1.7 let pseudo keyword
CONST = 154,
SETCONST = 155,
SETCONSTVAR = 156,
ARRAYCOMP = 157, // array comprehension
LETEXPR = 158,
WITHEXPR = 159,
DEBUGGER = 160,
COMMENT = 161,
LAST_TOKEN = 162;
/**
* Returns a name for the token. If Rhino is compiled with certain
* hardcoded debugging flags in this file, it calls {@code #typeToName};
* otherwise it returns a string whose value is the token number.
*/
public static String name(int token)
{
if (!printNames) {
return String.valueOf(token);
}
return typeToName(token);
}
/**
* Always returns a human-readable string for the token name.
* For instance, {@link #FINALLY} has the name "FINALLY".
* @param token the token code
* @return the actual name for the token code
*/
public static String typeToName(int token) {
switch (token) {
case ERROR: return "ERROR";
case EOF: return "EOF";
case EOL: return "EOL";
case ENTERWITH: return "ENTERWITH";
case LEAVEWITH: return "LEAVEWITH";
case RETURN: return "RETURN";
case GOTO: return "GOTO";
case IFEQ: return "IFEQ";
case IFNE: return "IFNE";
case SETNAME: return "SETNAME";
case BITOR: return "BITOR";
case BITXOR: return "BITXOR";
case BITAND: return "BITAND";
case EQ: return "EQ";
case NE: return "NE";
case LT: return "LT";
case LE: return "LE";
case GT: return "GT";
case GE: return "GE";
case LSH: return "LSH";
case RSH: return "RSH";
case URSH: return "URSH";
case ADD: return "ADD";
case SUB: return "SUB";
case MUL: return "MUL";
case DIV: return "DIV";
case MOD: return "MOD";
case NOT: return "NOT";
case BITNOT: return "BITNOT";
case POS: return "POS";
case NEG: return "NEG";
case NEW: return "NEW";
case DELPROP: return "DELPROP";
case TYPEOF: return "TYPEOF";
case GETPROP: return "GETPROP";
case GETPROPNOWARN: return "GETPROPNOWARN";
case SETPROP: return "SETPROP";
case GETELEM: return "GETELEM";
case SETELEM: return "SETELEM";
case CALL: return "CALL";
case NAME: return "NAME";
case NUMBER: return "NUMBER";
case STRING: return "STRING";
case NULL: return "NULL";
case THIS: return "THIS";
case FALSE: return "FALSE";
case TRUE: return "TRUE";
case SHEQ: return "SHEQ";
case SHNE: return "SHNE";
case REGEXP: return "REGEXP";
case BINDNAME: return "BINDNAME";
case THROW: return "THROW";
case RETHROW: return "RETHROW";
case IN: return "IN";
case INSTANCEOF: return "INSTANCEOF";
case LOCAL_LOAD: return "LOCAL_LOAD";
case GETVAR: return "GETVAR";
case SETVAR: return "SETVAR";
case CATCH_SCOPE: return "CATCH_SCOPE";
case ENUM_INIT_KEYS: return "ENUM_INIT_KEYS";
case ENUM_INIT_VALUES:return "ENUM_INIT_VALUES";
case ENUM_INIT_ARRAY: return "ENUM_INIT_ARRAY";
case ENUM_NEXT: return "ENUM_NEXT";
case ENUM_ID: return "ENUM_ID";
case THISFN: return "THISFN";
case RETURN_RESULT: return "RETURN_RESULT";
case ARRAYLIT: return "ARRAYLIT";
case OBJECTLIT: return "OBJECTLIT";
case GET_REF: return "GET_REF";
case SET_REF: return "SET_REF";
case DEL_REF: return "DEL_REF";
case REF_CALL: return "REF_CALL";
case REF_SPECIAL: return "REF_SPECIAL";
case DEFAULTNAMESPACE:return "DEFAULTNAMESPACE";
case ESCXMLTEXT: return "ESCXMLTEXT";
case ESCXMLATTR: return "ESCXMLATTR";
case REF_MEMBER: return "REF_MEMBER";
case REF_NS_MEMBER: return "REF_NS_MEMBER";
case REF_NAME: return "REF_NAME";
case REF_NS_NAME: return "REF_NS_NAME";
case TRY: return "TRY";
case SEMI: return "SEMI";
case LB: return "LB";
case RB: return "RB";
case LC: return "LC";
case RC: return "RC";
case LP: return "LP";
case RP: return "RP";
case COMMA: return "COMMA";
case ASSIGN: return "ASSIGN";
case ASSIGN_BITOR: return "ASSIGN_BITOR";
case ASSIGN_BITXOR: return "ASSIGN_BITXOR";
case ASSIGN_BITAND: return "ASSIGN_BITAND";
case ASSIGN_LSH: return "ASSIGN_LSH";
case ASSIGN_RSH: return "ASSIGN_RSH";
case ASSIGN_URSH: return "ASSIGN_URSH";
case ASSIGN_ADD: return "ASSIGN_ADD";
case ASSIGN_SUB: return "ASSIGN_SUB";
case ASSIGN_MUL: return "ASSIGN_MUL";
case ASSIGN_DIV: return "ASSIGN_DIV";
case ASSIGN_MOD: return "ASSIGN_MOD";
case HOOK: return "HOOK";
case COLON: return "COLON";
case OR: return "OR";
case AND: return "AND";
case INC: return "INC";
case DEC: return "DEC";
case DOT: return "DOT";
case FUNCTION: return "FUNCTION";
case EXPORT: return "EXPORT";
case IMPORT: return "IMPORT";
case IF: return "IF";
case ELSE: return "ELSE";
case SWITCH: return "SWITCH";
case CASE: return "CASE";
case DEFAULT: return "DEFAULT";
case WHILE: return "WHILE";
case DO: return "DO";
case FOR: return "FOR";
case BREAK: return "BREAK";
case CONTINUE: return "CONTINUE";
case VAR: return "VAR";
case WITH: return "WITH";
case CATCH: return "CATCH";
case FINALLY: return "FINALLY";
case VOID: return "VOID";
case RESERVED: return "RESERVED";
case EMPTY: return "EMPTY";
case BLOCK: return "BLOCK";
case LABEL: return "LABEL";
case TARGET: return "TARGET";
case LOOP: return "LOOP";
case EXPR_VOID: return "EXPR_VOID";
case EXPR_RESULT: return "EXPR_RESULT";
case JSR: return "JSR";
case SCRIPT: return "SCRIPT";
case TYPEOFNAME: return "TYPEOFNAME";
case USE_STACK: return "USE_STACK";
case SETPROP_OP: return "SETPROP_OP";
case SETELEM_OP: return "SETELEM_OP";
case LOCAL_BLOCK: return "LOCAL_BLOCK";
case SET_REF_OP: return "SET_REF_OP";
case DOTDOT: return "DOTDOT";
case COLONCOLON: return "COLONCOLON";
case XML: return "XML";
case DOTQUERY: return "DOTQUERY";
case XMLATTR: return "XMLATTR";
case XMLEND: return "XMLEND";
case TO_OBJECT: return "TO_OBJECT";
case TO_DOUBLE: return "TO_DOUBLE";
case GET: return "GET";
case SET: return "SET";
case LET: return "LET";
case YIELD: return "YIELD";
case CONST: return "CONST";
case SETCONST: return "SETCONST";
case ARRAYCOMP: return "ARRAYCOMP";
case WITHEXPR: return "WITHEXPR";
case LETEXPR: return "LETEXPR";
case DEBUGGER: return "DEBUGGER";
case COMMENT: return "COMMENT";
}
// Token without name
throw new IllegalStateException(String.valueOf(token));
}
/**
* Return true if the passed code is a valid Token constant.
* @param code a potential token code
* @return true if it's a known token
*/
public static boolean isValidToken(int code) {
return code >= ERROR
&& code <= LAST_TOKEN;
}
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/RefCallable.java 0000644 0001750 0001750 00000004517 10776622373 025744 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Igor Bukanov, igor@mir2.org
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript;
/**
* Object that can allows assignments to the result of function calls.
*/
public interface RefCallable extends Callable
{
/**
* Perform function call in reference context.
* The args array reference should not be stored in any object that is
* can be GC-reachable after this method returns. If this is necessary,
* for example, to implement {@link Ref} methods, then store args.clone(),
* not args array itself.
*
* @param cx the current Context for this thread
* @param thisObj the JavaScript this object
* @param args the array of arguments
*/
public Ref refCall(Context cx, Scriptable thisObj, Object[] args);
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/Function.java 0000644 0001750 0001750 00000006240 10776622373 025370 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-1999
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
// API class
package org.mozilla.javascript;
/**
* This is interface that all functions in JavaScript must implement.
* The interface provides for calling functions and constructors.
*
* @see org.mozilla.javascript.Scriptable
* @author Norris Boyd
*/
public interface Function extends Scriptable, Callable
{
/**
* Call the function.
*
* Note that the array of arguments is not guaranteed to have
* length greater than 0.
*
* @param cx the current Context for this thread
* @param scope the scope to execute the function relative to. This is
* set to the value returned by getParentScope() except
* when the function is called from a closure.
* @param thisObj the JavaScript this object
* @param args the array of arguments
* @return the result of the call
*/
public Object call(Context cx, Scriptable scope, Scriptable thisObj,
Object[] args);
/**
* Call the function as a constructor.
*
* This method is invoked by the runtime in order to satisfy a use
* of the JavaScript new operator. This method is
* expected to create a new object and return it.
*
* @param cx the current Context for this thread
* @param scope an enclosing scope of the caller except
* when the function is called from a closure.
* @param args the array of arguments
* @return the allocated object
*/
public Scriptable construct(Context cx, Scriptable scope, Object[] args);
}
htmlunit-core-js-2.8/rhino/src/org/mozilla/javascript/LazilyLoadedCtor.java 0000644 0001750 0001750 00000013151 11222455466 027001 0 ustar cavedon cavedon /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Rhino code, released
* May 6, 1999.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1997-2000
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Norris Boyd
* Igor Bukanov
*
* Alternatively, the contents of this file may be used under the terms of
* the GNU General Public License Version 2 or later (the "GPL"), in which
* case the provisions of the GPL are applicable instead of those above. If
* you wish to allow use of your version of this file only under the terms of
* the GPL and not to allow others to use your version of this file under the
* MPL, indicate your decision by deleting the provisions above and replacing
* them with the notice and other provisions required by the GPL. If you do
* not delete the provisions above, a recipient may use your version of this
* file under either the MPL or the GPL.
*
* ***** END LICENSE BLOCK ***** */
package org.mozilla.javascript;
import java.lang.reflect.*;
import java.security.AccessController;
import java.security.PrivilegedAction;
/**
* Avoid loading classes unless they are used.
*
*
This improves startup time and average memory usage.
*/
public final class LazilyLoadedCtor implements java.io.Serializable {
private static final long serialVersionUID = 1L;
private static final int STATE_BEFORE_INIT = 0;
private static final int STATE_INITIALIZING = 1;
private static final int STATE_WITH_VALUE = 2;
private final ScriptableObject scope;
private final String propertyName;
private final String className;
private final boolean sealed;
private final boolean privileged;
private Object initializedValue;
private int state;
public LazilyLoadedCtor(ScriptableObject scope, String propertyName,
String className, boolean sealed)
{
this(scope, propertyName, className, sealed, false);
}
LazilyLoadedCtor(ScriptableObject scope, String propertyName,
String className, boolean sealed, boolean privileged)
{
this.scope = scope;
this.propertyName = propertyName;
this.className = className;
this.sealed = sealed;
this.privileged = privileged;
this.state = STATE_BEFORE_INIT;
scope.addLazilyInitializedValue(propertyName, 0, this,
ScriptableObject.DONTENUM);
}
void init()
{
synchronized (this) {
if (state == STATE_INITIALIZING)
throw new IllegalStateException(
"Recursive initialization for "+propertyName);
if (state == STATE_BEFORE_INIT) {
state = STATE_INITIALIZING;
// Set value now to have something to set in finally block if
// buildValue throws.
Object value = Scriptable.NOT_FOUND;
try {
value = buildValue();
} finally {
initializedValue = value;
state = STATE_WITH_VALUE;
}
}
}
}
Object getValue()
{
if (state != STATE_WITH_VALUE)
throw new IllegalStateException(propertyName);
return initializedValue;
}
private Object buildValue()
{
if(privileged)
{
return AccessController.doPrivileged(new PrivilegedAction