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.core.common.alloc; 24 25 import java.util.ArrayList; 26 27 import org.graalvm.compiler.core.common.alloc.TraceBuilderResult.TrivialTracePredicate; 28 import org.graalvm.compiler.core.common.cfg.AbstractBlockBase; 29 30 /** 31 * Builds traces consisting of a single basic block. 32 */ 33 public final class SingleBlockTraceBuilder { 34 35 public static TraceBuilderResult computeTraces(AbstractBlockBase<?> startBlock, AbstractBlockBase<?>[] blocks, TrivialTracePredicate pred) { 36 return build(startBlock, blocks, pred); 37 } 38 39 private static TraceBuilderResult build(AbstractBlockBase<?> startBlock, AbstractBlockBase<?>[] blocks, TrivialTracePredicate pred) { 40 Trace[] blockToTrace = new Trace[blocks.length]; 41 ArrayList<Trace> traces = new ArrayList<>(blocks.length); 42 43 for (AbstractBlockBase<?> block : blocks) { 44 Trace trace = new Trace(new AbstractBlockBase<?>[]{block}); 45 blockToTrace[block.getId()] = trace; 46 block.setLinearScanNumber(0); 47 trace.setId(traces.size()); 48 traces.add(trace); 49 } 50 51 assert traces.get(0).getBlocks()[0].equals(startBlock) : "The first traces always contains the start block"; 52 return TraceBuilderResult.create(blocks, traces, blockToTrace, pred); 53 } 54 55 }