mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
b2dcc26c38
--HG-- extra : convert_revision : 51a78a175b1074c933323e0bf24d6f64b5c6c35d
181 lines
6.3 KiB
C++
181 lines
6.3 KiB
C++
/* -*- Mode: C++; c-basic-offset: 4; indent-tabs-mode: nil; tab-width: 4 -*- */
|
|
/* vi: set ts=4 sw=4 expandtab: (add to ~/.vimrc: set modeline modelines=5) */
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
*
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
* the License. You may obtain a copy of the License at
|
|
* http://www.mozilla.org/MPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
* for the specific language governing rights and limitations under the
|
|
* License.
|
|
*
|
|
* The Original Code is [Open Source Virtual Machine].
|
|
*
|
|
* The Initial Developer of the Original Code is
|
|
* Adobe System Incorporated.
|
|
* Portions created by the Initial Developer are Copyright (C) 2004-2007
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
* Adobe AS3 Team
|
|
*
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
* the provisions above, a recipient may use your version of this file under
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
*
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
|
|
#ifndef __nanojit_RegAlloc__
|
|
#define __nanojit_RegAlloc__
|
|
|
|
|
|
namespace nanojit
|
|
{
|
|
class RegAlloc
|
|
{
|
|
public:
|
|
RegAlloc()
|
|
{
|
|
clear();
|
|
}
|
|
|
|
void clear()
|
|
{
|
|
VMPI_memset(this, 0, sizeof(*this));
|
|
}
|
|
|
|
bool isFree(Register r) const
|
|
{
|
|
NanoAssert(r != deprecated_UnknownReg);
|
|
return (free & rmask(r)) != 0;
|
|
}
|
|
|
|
void addFree(Register r)
|
|
{
|
|
NanoAssert(!isFree(r));
|
|
free |= rmask(r);
|
|
}
|
|
|
|
void removeFree(Register r)
|
|
{
|
|
NanoAssert(isFree(r));
|
|
free &= ~rmask(r);
|
|
}
|
|
|
|
void addActive(Register r, LIns* v)
|
|
{
|
|
// Count++;
|
|
NanoAssert(v);
|
|
NanoAssert(r != deprecated_UnknownReg);
|
|
NanoAssert(active[r] == NULL);
|
|
active[r] = v;
|
|
useActive(r);
|
|
}
|
|
|
|
void useActive(Register r)
|
|
{
|
|
NanoAssert(r != deprecated_UnknownReg);
|
|
NanoAssert(active[r] != NULL);
|
|
usepri[r] = priority++;
|
|
}
|
|
|
|
void removeActive(Register r)
|
|
{
|
|
//registerReleaseCount++;
|
|
NanoAssert(r != deprecated_UnknownReg);
|
|
NanoAssert(active[r] != NULL);
|
|
|
|
// remove the given register from the active list
|
|
active[r] = NULL;
|
|
}
|
|
|
|
void retire(Register r)
|
|
{
|
|
NanoAssert(r != deprecated_UnknownReg);
|
|
NanoAssert(active[r] != NULL);
|
|
active[r] = NULL;
|
|
free |= rmask(r);
|
|
}
|
|
|
|
int32_t getPriority(Register r) {
|
|
NanoAssert(r != deprecated_UnknownReg && active[r]);
|
|
return usepri[r];
|
|
}
|
|
|
|
LIns* getActive(Register r) const {
|
|
NanoAssert(r != deprecated_UnknownReg);
|
|
return active[r];
|
|
}
|
|
|
|
debug_only( uint32_t countActive(); )
|
|
debug_only( bool isConsistent(Register r, LIns* v) const; )
|
|
debug_only( RegisterMask managed; ) // the registers managed by the register allocator
|
|
|
|
// Some basics:
|
|
//
|
|
// - 'active' indicates which registers are active at a particular
|
|
// point, and for each active register, which instruction
|
|
// defines the value it holds. At the start of register
|
|
// allocation no registers are active.
|
|
//
|
|
// - 'free' indicates which registers are free at a particular point
|
|
// and thus available for use. At the start of register
|
|
// allocation most registers are free; those that are not
|
|
// aren't available for general use, e.g. the stack pointer and
|
|
// frame pointer registers.
|
|
//
|
|
// - 'managed' is exactly this list of initially free registers,
|
|
// ie. the registers managed by the register allocator.
|
|
//
|
|
// - Each LIns has a "reservation" which includes a register value,
|
|
// 'reg'. Combined with 'active', this provides a two-way
|
|
// mapping between registers and LIR instructions.
|
|
//
|
|
// - Invariant 1: each register must be in exactly one of the
|
|
// following states at all times: unmanaged, free, or active.
|
|
// In terms of the relevant fields:
|
|
//
|
|
// * A register in 'managed' must be in 'active' or 'free' but
|
|
// not both.
|
|
//
|
|
// * A register not in 'managed' must be in neither 'active' nor
|
|
// 'free'.
|
|
//
|
|
// - Invariant 2: the two-way mapping between active registers and
|
|
// their defining instructions must always hold in both
|
|
// directions and be unambiguous. More specifically:
|
|
//
|
|
// * An LIns can appear at most once in 'active'.
|
|
//
|
|
// * An LIns named by 'active[R]' must have an in-use
|
|
// reservation that names R.
|
|
//
|
|
// * And vice versa: an LIns with an in-use reservation that
|
|
// names R must be named by 'active[R]'.
|
|
//
|
|
// * If an LIns's reservation names 'deprecated_UnknownReg' then LIns
|
|
// should not be in 'active'.
|
|
//
|
|
LIns* active[LastReg + 1]; // active[r] = LIns that defines r
|
|
int32_t usepri[LastReg + 1]; // used priority. lower = more likely to spill.
|
|
RegisterMask free;
|
|
int32_t priority;
|
|
|
|
DECLARE_PLATFORM_REGALLOC()
|
|
};
|
|
}
|
|
#endif // __nanojit_RegAlloc__
|