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 jdk.test.lib.jittester.visitors.Visitor;
  27 
  28 public class If extends IRNode {
  29     public enum IfPart {
  30         CONDITION,
  31         THEN,
  32         ELSE,
  33     };
  34 
  35     public If(IRNode condition, IRNode thenBlock, IRNode elseBlock, int level) {
  36         this.level = level;
  37         resizeUpChildren(IfPart.values().length);
  38         setChild(IfPart.CONDITION.ordinal(), condition);
  39         setChild(IfPart.THEN.ordinal(), thenBlock);
  40         setChild(IfPart.ELSE.ordinal(), elseBlock);
  41     }
  42 
  43     @Override
  44     public long complexity() {
  45         IRNode condition = getChild(IfPart.CONDITION.ordinal());
  46         IRNode thenBlock=  getChild(IfPart.THEN.ordinal());
  47         IRNode elseBlock = getChild(IfPart.ELSE.ordinal());
  48         return (condition != null ? condition.complexity() : 0)
  49             + Math.max(thenBlock != null ? thenBlock.complexity() : 0,
  50             elseBlock != null ? elseBlock.complexity() : 0);
  51 
  52     }
  53 
  54     @Override
  55     public long countDepth() {
  56         return Long.max(level, super.countDepth());
  57     }
  58 
  59     @Override
  60     public<T> T accept(Visitor<T> v) {
  61         return v.visit(this);
  62     }
  63 }