1 /* 2 * Copyright (c) 2005, 2015, 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 24 package jdk.test.lib.jittester; 25 26 import java.util.List; 27 import jdk.test.lib.jittester.visitors.Visitor; 28 29 public class Switch extends IRNode { 30 private final int caseBlockIdx; 31 Switch(int level, List<IRNode> chldrn, int caseBlockIdx)32 public Switch(int level, List<IRNode> chldrn, int caseBlockIdx) { 33 super(chldrn.get(caseBlockIdx).getResultType()); 34 this.level = level; 35 addChildren(chldrn); 36 this.caseBlockIdx = caseBlockIdx; 37 } 38 39 @Override complexity()40 public long complexity() { 41 IRNode switchExp = getChild(0); 42 long complexity = switchExp != null ? switchExp.complexity() : 0; 43 for (int i = caseBlockIdx; i < getChildren().size(); ++i) { 44 complexity += getChild(i).complexity(); 45 } 46 return complexity; 47 } 48 49 @Override countDepth()50 public long countDepth() { 51 return Long.max(level, super.countDepth()); 52 } 53 54 @Override accept(Visitor<T> v)55 public<T> T accept(Visitor<T> v) { 56 return v.visit(this); 57 } 58 getCaseBlockIndex()59 public int getCaseBlockIndex() { 60 return caseBlockIdx; 61 } 62 } 63