Mercurial > hg > truffle
view graal/com.oracle.graal.api.code/src/com/oracle/graal/api/code/RegisterSaveLayout.java @ 11839:0e2cceed1caf
Temporarily move encodeDeoptActionAndReason to MetaAccessProvider
Add AbstractDeoptimizeNode.getActionAndReason
author | Gilles Duboscq <duboscq@ssw.jku.at> |
---|---|
date | Mon, 30 Sep 2013 16:09:40 +0200 |
parents | 47e7933283f1 |
children | 0e0c24424d14 |
line wrap: on
line source
/* * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.oracle.graal.api.code; import java.util.*; /** * A map from registers to frame slots. This can be used to describe where callee saved registers * are saved in a callee's frame. */ public class RegisterSaveLayout { /** * Keys. */ private Register[] registers; /** * Slot indexes relative to stack pointer. */ private int[] slots; /** * Creates a map from registers to frame slots. * * @param registers the keys in the map * @param slots frame slot index for each register in {@code registers} */ public RegisterSaveLayout(Register[] registers, int[] slots) { assert registers.length == slots.length; this.registers = registers; this.slots = slots; assert registersToSlots(false).size() == registers.length : "non-unique registers"; assert new HashSet<>(registersToSlots(false).values()).size() == slots.length : "non-unqiue slots"; } /** * Gets this layout information as a {@link Map} from registers to slots. */ public Map<Register, Integer> registersToSlots(boolean sorted) { Map<Register, Integer> result; if (sorted) { result = new TreeMap<>(); } else { result = new HashMap<>(); } for (int i = 0; i < registers.length; i++) { result.put(registers[i], slots[i]); } return result; } /** * Gets this layout information as a {@link Map} from slots to registers. */ public Map<Integer, Register> slotsToRegisters(boolean sorted) { Map<Integer, Register> result; if (sorted) { result = new TreeMap<>(); } else { result = new HashMap<>(); } for (int i = 0; i < registers.length; i++) { result.put(slots[i], registers[i]); } return result; } @Override public String toString() { return registersToSlots(true).toString(); } }