1 /* 2 * Copyright (c) 2016, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 package org.graalvm.compiler.hotspot.sparc; 24 25 import org.graalvm.compiler.graph.Node; 26 import org.graalvm.compiler.hotspot.nodes.HotSpotNodeCostProvider; 27 import org.graalvm.compiler.hotspot.nodes.JumpToExceptionHandlerNode; 28 import org.graalvm.compiler.nodeinfo.NodeCycles; 29 import org.graalvm.compiler.nodeinfo.NodeSize; 30 import org.graalvm.compiler.nodes.ReturnNode; 31 32 public class SPARCHotSpotNodeCostProvider extends HotSpotNodeCostProvider { 33 34 @Override 35 public NodeCycles cycles(Node n) { 36 if (n instanceof ReturnNode) { 37 return NodeCycles.CYCLES_6; 38 } else if (n instanceof JumpToExceptionHandlerNode) { 39 // restore caller window 40 return NodeCycles.CYCLES_3; 41 } 42 return super.cycles(n); 43 } 44 45 @Override 46 public NodeSize size(Node n) { 47 if (n instanceof ReturnNode) { 48 return NodeSize.SIZE_4; 49 } else if (n instanceof JumpToExceptionHandlerNode) { 50 // restore caller window 51 return NodeSize.SIZE_3; 52 } 53 return super.size(n); 54 } 55 }