001/*
002 * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved.
003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
004 *
005 * This code is free software; you can redistribute it and/or modify it
006 * under the terms of the GNU General Public License version 2 only, as
007 * published by the Free Software Foundation.
008 *
009 * This code is distributed in the hope that it will be useful, but WITHOUT
010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
011 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
012 * version 2 for more details (a copy is included in the LICENSE file that
013 * accompanied this code).
014 *
015 * You should have received a copy of the GNU General Public License version
016 * 2 along with this work; if not, write to the Free Software Foundation,
017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
018 *
019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
020 * or visit www.oracle.com if you need additional information or have any
021 * questions.
022 */
023package com.oracle.graal.truffle;
024
025import com.oracle.truffle.api.*;
026import com.oracle.truffle.api.frame.*;
027import com.oracle.truffle.api.nodes.*;
028
029/**
030 * Temporary node for legacy loop count reporting support as it was most likely done in other
031 * implementations.
032 */
033public final class OptimizedLoopNode extends LoopNode {
034
035    @Child private RepeatingNode repeatingNode;
036
037    public OptimizedLoopNode(RepeatingNode repeatingNode) {
038        this.repeatingNode = repeatingNode;
039    }
040
041    @Override
042    public RepeatingNode getRepeatingNode() {
043        return repeatingNode;
044    }
045
046    @Override
047    public void executeLoop(VirtualFrame frame) {
048        int loopCount = 0;
049        try {
050            while (repeatingNode.executeRepeating(frame)) {
051                if (CompilerDirectives.inInterpreter()) {
052                    loopCount++;
053                }
054            }
055        } finally {
056            if (CompilerDirectives.inInterpreter()) {
057                getRootNode().reportLoopCount(loopCount);
058            }
059        }
060    }
061
062}