/*
 * Copyright (c) 2010, 2020, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * The Universal Permissive License (UPL), Version 1.0
 *
 * Subject to the condition set forth below, permission is hereby granted to any
 * person obtaining a copy of this software, associated documentation and/or
 * data (collectively the "Software"), free of charge and under any and all
 * copyright rights in the Software, and any and all patent rights owned or
 * freely licensable by each licensor hereunder covering either (i) the
 * unmodified Software as contributed to or provided by such licensor, or (ii)
 * the Larger Works (as defined below), to deal in both
 *
 * (a) the Software, and
 *
 * (b) any piece of software and/or hardware listed in the lrgrwrks.txt file if
 * one is included with the Software each a "Larger Work" to which the Software
 * is contributed by such licensors),
 *
 * without restriction, including without limitation the rights to copy, create
 * derivative works of, display, perform, and distribute the Software and make,
 * use, sell, offer for sale, import, export, have made, and have sold the
 * Software and the Larger Work(s), and to sublicense the foregoing rights on
 * either these or other terms.
 *
 * This license is subject to the following condition:
 *
 * The above copyright notice and either this complete permission notice or at a
 * minimum a reference to the UPL must be included in all copies or substantial
 * portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

package com.oracle.js.parser.ir;

import com.oracle.js.parser.ir.visitor.NodeVisitor;
import com.oracle.js.parser.ir.visitor.TranslatorNodeVisitor;

IR representation for a while statement. This is the superclass of all loop nodes
/** * IR representation for a while statement. This is the superclass of all loop nodes */
public final class WhileNode extends LoopNode {
is this a do while node ?
/** is this a do while node ? */
private final boolean isDoWhile;
Constructor
Params:
  • lineNumber – line number
  • token – token
  • finish – finish
  • isDoWhile – is this a do while loop?
  • test – test expression
  • body – body of the while loop
/** * Constructor * * @param lineNumber line number * @param token token * @param finish finish * @param isDoWhile is this a do while loop? * @param test test expression * @param body body of the while loop */
public WhileNode(final int lineNumber, final long token, final int finish, final boolean isDoWhile, final JoinPredecessorExpression test, final Block body) { super(lineNumber, token, finish, body, test, false); this.isDoWhile = isDoWhile; }
Internal copy constructor
Params:
  • whileNode – while node
  • test – Test expression
  • body – body of the while loop
  • controlFlowEscapes – control flow escapes?
/** * Internal copy constructor * * @param whileNode while node * @param test Test expression * @param body body of the while loop * @param controlFlowEscapes control flow escapes? */
private WhileNode(final WhileNode whileNode, final JoinPredecessorExpression test, final Block body, final boolean controlFlowEscapes) { super(whileNode, test, body, controlFlowEscapes); this.isDoWhile = whileNode.isDoWhile; } @Override public boolean hasGoto() { return test == null; } @Override public Node accept(final LexicalContext lc, final NodeVisitor<? extends LexicalContext> visitor) { if (visitor.enterWhileNode(this)) { //@formatter:off if (isDoWhile()) { return visitor.leaveWhileNode( setBody(lc, (Block) body.accept(visitor)). setTest(lc, (JoinPredecessorExpression) test.accept(visitor))); } return visitor.leaveWhileNode( setTest(lc, (JoinPredecessorExpression) test.accept(visitor)). setBody(lc, (Block) body.accept(visitor))); //@formatter:on } return this; } @Override public <R> R accept(LexicalContext lc, TranslatorNodeVisitor<? extends LexicalContext, R> visitor) { return visitor.enterWhileNode(this); } @Override public WhileNode setTest(final LexicalContext lc, final JoinPredecessorExpression test) { if (this.test == test) { return this; } return Node.replaceInLexicalContext(lc, this, new WhileNode(this, test, body, controlFlowEscapes)); } @Override public Block getBody() { return body; } @Override public WhileNode setBody(final LexicalContext lc, final Block body) { if (this.body == body) { return this; } return Node.replaceInLexicalContext(lc, this, new WhileNode(this, test, body, controlFlowEscapes)); } @Override public WhileNode setControlFlowEscapes(final LexicalContext lc, final boolean controlFlowEscapes) { if (this.controlFlowEscapes == controlFlowEscapes) { return this; } return Node.replaceInLexicalContext(lc, this, new WhileNode(this, test, body, controlFlowEscapes)); }
Check if this is a do while loop or a normal while loop
Returns:true if do while
/** * Check if this is a do while loop or a normal while loop * * @return true if do while */
public boolean isDoWhile() { return isDoWhile; } @Override public void toString(final StringBuilder sb, final boolean printType) { sb.append("while ("); test.toString(sb, printType); sb.append(')'); } @Override public boolean mustEnter() { if (isDoWhile()) { return true; } return test == null; } @Override public boolean hasPerIterationScope() { return false; } }