2009-06-23 14:51:15 -07:00
|
|
|
/* -*- Mode: C++; c-basic-offset: 4; indent-tabs-mode: nil; tab-width: 4 -*- */
|
2009-07-10 12:58:34 -07:00
|
|
|
/* vi: set ts=4 sw=4 expandtab: (add to ~/.vimrc: set modeline modelines=5) */
|
2008-06-18 21:11:15 -07:00
|
|
|
/* ***** 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_LIR__
|
|
|
|
#define __nanojit_LIR__
|
|
|
|
|
|
|
|
namespace nanojit
|
|
|
|
{
|
2009-12-17 13:24:39 -08:00
|
|
|
enum LOpcode
|
|
|
|
#if defined(_MSC_VER) && _MSC_VER >= 1400
|
|
|
|
#pragma warning(disable:4480) // nonstandard extension used: specifying underlying type for enum
|
|
|
|
: unsigned
|
|
|
|
#endif
|
|
|
|
{
|
2010-02-28 17:02:01 -08:00
|
|
|
#define OP___(op, number, repKind, retType, isCse) \
|
2009-12-17 13:24:39 -08:00
|
|
|
LIR_##op = (number),
|
|
|
|
#include "LIRopcode.tbl"
|
|
|
|
LIR_sentinel,
|
2010-02-11 17:30:16 -08:00
|
|
|
#undef OP___
|
2009-12-17 13:24:39 -08:00
|
|
|
|
|
|
|
#ifdef NANOJIT_64BIT
|
|
|
|
# define PTR_SIZE(a,b) b
|
|
|
|
#else
|
|
|
|
# define PTR_SIZE(a,b) a
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// pointer op aliases
|
|
|
|
LIR_ldp = PTR_SIZE(LIR_ld, LIR_ldq),
|
|
|
|
LIR_stpi = PTR_SIZE(LIR_sti, LIR_stqi),
|
|
|
|
LIR_piadd = PTR_SIZE(LIR_add, LIR_qiadd),
|
|
|
|
LIR_piand = PTR_SIZE(LIR_and, LIR_qiand),
|
|
|
|
LIR_pilsh = PTR_SIZE(LIR_lsh, LIR_qilsh),
|
|
|
|
LIR_pirsh = PTR_SIZE(LIR_rsh, LIR_qirsh),
|
|
|
|
LIR_pursh = PTR_SIZE(LIR_ush, LIR_qursh),
|
|
|
|
LIR_pcmov = PTR_SIZE(LIR_cmov, LIR_qcmov),
|
|
|
|
LIR_pior = PTR_SIZE(LIR_or, LIR_qior),
|
|
|
|
LIR_pxor = PTR_SIZE(LIR_xor, LIR_qxor),
|
|
|
|
LIR_addp = PTR_SIZE(LIR_iaddp, LIR_qaddp),
|
|
|
|
LIR_peq = PTR_SIZE(LIR_eq, LIR_qeq),
|
|
|
|
LIR_plt = PTR_SIZE(LIR_lt, LIR_qlt),
|
|
|
|
LIR_pgt = PTR_SIZE(LIR_gt, LIR_qgt),
|
|
|
|
LIR_ple = PTR_SIZE(LIR_le, LIR_qle),
|
|
|
|
LIR_pge = PTR_SIZE(LIR_ge, LIR_qge),
|
|
|
|
LIR_pult = PTR_SIZE(LIR_ult, LIR_qult),
|
|
|
|
LIR_pugt = PTR_SIZE(LIR_ugt, LIR_qugt),
|
|
|
|
LIR_pule = PTR_SIZE(LIR_ule, LIR_qule),
|
|
|
|
LIR_puge = PTR_SIZE(LIR_uge, LIR_quge),
|
|
|
|
LIR_alloc = PTR_SIZE(LIR_ialloc, LIR_qalloc),
|
|
|
|
LIR_pcall = PTR_SIZE(LIR_icall, LIR_qcall),
|
2010-01-27 13:45:29 -08:00
|
|
|
LIR_param = PTR_SIZE(LIR_iparam, LIR_qparam),
|
|
|
|
LIR_plive = PTR_SIZE(LIR_live, LIR_qlive),
|
|
|
|
LIR_pret = PTR_SIZE(LIR_ret, LIR_qret)
|
2009-12-17 13:24:39 -08:00
|
|
|
};
|
|
|
|
|
2010-02-28 17:02:01 -08:00
|
|
|
// 32-bit integer comparisons must be contiguous, as must 64-bit integer
|
|
|
|
// comparisons and 64-bit float comparisons.
|
|
|
|
NanoStaticAssert(LIR_eq + 1 == LIR_lt &&
|
|
|
|
LIR_eq + 2 == LIR_gt &&
|
|
|
|
LIR_eq + 3 == LIR_le &&
|
|
|
|
LIR_eq + 4 == LIR_ge &&
|
|
|
|
LIR_eq + 5 == LIR_ult &&
|
|
|
|
LIR_eq + 6 == LIR_ugt &&
|
|
|
|
LIR_eq + 7 == LIR_ule &&
|
|
|
|
LIR_eq + 8 == LIR_uge);
|
|
|
|
#ifdef NANOJIT_64BIT
|
|
|
|
NanoStaticAssert(LIR_qeq + 1 == LIR_qlt &&
|
|
|
|
LIR_qeq + 2 == LIR_qgt &&
|
|
|
|
LIR_qeq + 3 == LIR_qle &&
|
|
|
|
LIR_qeq + 4 == LIR_qge &&
|
|
|
|
LIR_qeq + 5 == LIR_qult &&
|
|
|
|
LIR_qeq + 6 == LIR_qugt &&
|
|
|
|
LIR_qeq + 7 == LIR_qule &&
|
|
|
|
LIR_qeq + 8 == LIR_quge);
|
|
|
|
#endif
|
|
|
|
NanoStaticAssert(LIR_feq + 1 == LIR_flt &&
|
|
|
|
LIR_feq + 2 == LIR_fgt &&
|
|
|
|
LIR_feq + 3 == LIR_fle &&
|
|
|
|
LIR_feq + 4 == LIR_fge);
|
|
|
|
|
|
|
|
// Various opcodes must be changeable to their opposite with op^1
|
|
|
|
// (although we use invertXyz() when possible, ie. outside static
|
|
|
|
// assertions).
|
|
|
|
NanoStaticAssert((LIR_jt^1) == LIR_jf && (LIR_jf^1) == LIR_jt);
|
|
|
|
|
|
|
|
NanoStaticAssert((LIR_xt^1) == LIR_xf && (LIR_xf^1) == LIR_xt);
|
|
|
|
|
|
|
|
NanoStaticAssert((LIR_lt^1) == LIR_gt && (LIR_gt^1) == LIR_lt);
|
|
|
|
NanoStaticAssert((LIR_le^1) == LIR_ge && (LIR_ge^1) == LIR_le);
|
|
|
|
NanoStaticAssert((LIR_ult^1) == LIR_ugt && (LIR_ugt^1) == LIR_ult);
|
|
|
|
NanoStaticAssert((LIR_ule^1) == LIR_uge && (LIR_uge^1) == LIR_ule);
|
|
|
|
|
|
|
|
#ifdef NANOJIT_64BIT
|
|
|
|
NanoStaticAssert((LIR_qlt^1) == LIR_qgt && (LIR_qgt^1) == LIR_qlt);
|
|
|
|
NanoStaticAssert((LIR_qle^1) == LIR_qge && (LIR_qge^1) == LIR_qle);
|
|
|
|
NanoStaticAssert((LIR_qult^1) == LIR_qugt && (LIR_qugt^1) == LIR_qult);
|
|
|
|
NanoStaticAssert((LIR_qule^1) == LIR_quge && (LIR_quge^1) == LIR_qule);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
NanoStaticAssert((LIR_flt^1) == LIR_fgt && (LIR_fgt^1) == LIR_flt);
|
|
|
|
NanoStaticAssert((LIR_fle^1) == LIR_fge && (LIR_fge^1) == LIR_fle);
|
|
|
|
|
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
struct GuardRecord;
|
2008-06-18 21:11:15 -07:00
|
|
|
struct SideExit;
|
2008-10-13 13:29:18 -07:00
|
|
|
|
|
|
|
enum AbiKind {
|
|
|
|
ABI_FASTCALL,
|
|
|
|
ABI_THISCALL,
|
2009-07-10 12:58:34 -07:00
|
|
|
ABI_STDCALL,
|
2008-10-13 13:29:18 -07:00
|
|
|
ABI_CDECL
|
|
|
|
};
|
|
|
|
|
2010-02-14 22:24:21 -08:00
|
|
|
enum ArgSize {
|
|
|
|
ARGSIZE_NONE = 0,
|
|
|
|
ARGSIZE_F = 1, // double (64bit)
|
|
|
|
ARGSIZE_I = 2, // int32_t
|
2010-02-11 17:30:16 -08:00
|
|
|
#ifdef NANOJIT_64BIT
|
2010-02-14 22:24:21 -08:00
|
|
|
ARGSIZE_Q = 3, // uint64_t
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2010-02-14 22:24:21 -08:00
|
|
|
ARGSIZE_U = 6, // uint32_t
|
|
|
|
ARGSIZE_MASK_ANY = 7,
|
|
|
|
ARGSIZE_MASK_INT = 2,
|
|
|
|
ARGSIZE_SHIFT = 3,
|
2009-07-29 17:44:34 -07:00
|
|
|
|
|
|
|
// aliases
|
2010-02-14 22:24:21 -08:00
|
|
|
ARGSIZE_P = PTR_SIZE(ARGSIZE_I, ARGSIZE_Q), // pointer
|
|
|
|
ARGSIZE_LO = ARGSIZE_I, // int32_t
|
|
|
|
ARGSIZE_B = ARGSIZE_I, // bool
|
|
|
|
ARGSIZE_V = ARGSIZE_NONE // void
|
2008-10-13 13:29:18 -07:00
|
|
|
};
|
|
|
|
|
2009-08-02 15:54:02 -07:00
|
|
|
enum IndirectCall {
|
|
|
|
CALL_INDIRECT = 0
|
|
|
|
};
|
|
|
|
|
2010-03-01 17:43:20 -08:00
|
|
|
//-----------------------------------------------------------------------
|
|
|
|
// Aliasing
|
|
|
|
// --------
|
|
|
|
// *Aliasing* occurs when a single memory location can be accessed through
|
|
|
|
// multiple names. For example, consider this code:
|
|
|
|
//
|
|
|
|
// ld a[0]
|
|
|
|
// sti b[0]
|
|
|
|
// ld a[0]
|
|
|
|
//
|
|
|
|
// In general, it's possible that a[0] and b[0] may refer to the same
|
|
|
|
// memory location. This means, for example, that you cannot safely
|
|
|
|
// perform CSE on the two loads. However, if you know that 'a' cannot be
|
|
|
|
// an alias of 'b' (ie. the two loads do not alias with the store) then
|
|
|
|
// you can safely perform CSE.
|
|
|
|
//
|
|
|
|
// Access regions
|
|
|
|
// --------------
|
|
|
|
// Doing alias analysis precisely is difficult. But it turns out that
|
|
|
|
// keeping track of aliasing at a very coarse level is enough to help with
|
|
|
|
// many optimisations. So we conceptually divide the memory that is
|
|
|
|
// accessible from LIR into a small number of "access regions". An access
|
|
|
|
// region may be non-contiguous. No two access regions can overlap. The
|
|
|
|
// union of all access regions covers all memory accessible from LIR.
|
|
|
|
//
|
|
|
|
// In general a (static) load or store may be executed more than once, and
|
|
|
|
// thus may access multiple regions; however, in practice almost all
|
|
|
|
// loads and stores will obviously access only a single region. A
|
|
|
|
// function called from LIR may load and/or store multiple access regions
|
|
|
|
// (even if executed only once).
|
|
|
|
//
|
|
|
|
// If two loads/stores/calls are known to not access the same region(s),
|
|
|
|
// then they do not alias.
|
|
|
|
//
|
|
|
|
// The access regions used are as follows:
|
|
|
|
//
|
|
|
|
// - READONLY: all memory that is read-only, ie. never stored to.
|
|
|
|
// A load from a READONLY region will never alias with any stores.
|
|
|
|
//
|
|
|
|
// - STACK: the stack. Stack loads/stores can usually be easily
|
|
|
|
// identified because they use SP as the stack pointer.
|
|
|
|
//
|
|
|
|
// - OTHER: all other regions of memory.
|
|
|
|
//
|
|
|
|
// It makes sense to add new access regions when doing so will help with
|
|
|
|
// one or more optimisations.
|
|
|
|
//
|
|
|
|
// One subtlety is that the meanings of the access region markings only
|
|
|
|
// apply to the LIR fragment that they are in. For example, if a memory
|
|
|
|
// location M is read-only in a particular LIR fragment, all loads
|
|
|
|
// involving M in that fragment can be safely marked READONLY, even if M
|
|
|
|
// is modified elsewhere. This is safe because the a LIR fragment is the
|
|
|
|
// unit of analysis in which the markings are used. In other words alias
|
|
|
|
// region markings are only used for intra-fragment optimisations.
|
|
|
|
//
|
|
|
|
// Access region sets and instruction markings
|
|
|
|
// -------------------------------------------
|
|
|
|
// The LIR generator must mark each load/store with an "access region
|
|
|
|
// set", which is a set of one or more access regions. This indicates
|
|
|
|
// which parts of LIR-accessible memory the load/store may touch.
|
|
|
|
//
|
|
|
|
// The LIR generator must also mark each function called from LIR with an
|
|
|
|
// access region set for memory stored to by the function. (We could also
|
|
|
|
// have a marking for memory loads, but there's no need at the moment.)
|
|
|
|
// These markings apply to the function itself, not the call site (ie.
|
|
|
|
// they're not context-sensitive).
|
|
|
|
//
|
|
|
|
// These load/store/call markings MUST BE ACCURATE -- if they are wrong
|
|
|
|
// then invalid optimisations might occur that change the meaning of the
|
|
|
|
// code. However, they can safely be imprecise (ie. conservative), in the
|
|
|
|
// following ways:
|
|
|
|
//
|
|
|
|
// - A load that accesses a READONLY region can be safely marked instead
|
|
|
|
// as loading from OTHER. In other words, it's safe to underestimate
|
|
|
|
// the size of the READONLY region. (This would also apply to the load
|
|
|
|
// set of a function, if we recorded that.)
|
|
|
|
//
|
|
|
|
// - A load/store can safely be marked as accessing regions that it
|
|
|
|
// doesn't, so long as the regions it does access are also included (one
|
|
|
|
// exception: marking a store with READONLY is nonsense and will cause
|
|
|
|
// assertions).
|
|
|
|
//
|
|
|
|
// In other words, a load/store can be marked with an access region set
|
|
|
|
// that is a superset of its actual access region set. Taking this to
|
|
|
|
// its logical conclusion, any load can be safely marked with LOAD_ANY and
|
|
|
|
// any store can be safely marked with with STORE_ANY (and the latter is
|
|
|
|
// true for the store set of a function.)
|
|
|
|
//
|
|
|
|
// Such imprecision is safe but may reduce optimisation opportunities.
|
|
|
|
//-----------------------------------------------------------------------
|
|
|
|
|
|
|
|
// An access region set is represented as a bitset. Nb: this restricts us
|
|
|
|
// to at most eight alias regions for the moment.
|
|
|
|
typedef uint8_t AccSet;
|
|
|
|
|
|
|
|
// The access regions. Note that because of the bitset representation
|
|
|
|
// these constants are also valid (singleton) AccSet values. If you add
|
|
|
|
// new ones please update ACC_ALL_WRITABLE and LirNameMap::formatAccSet().
|
|
|
|
//
|
|
|
|
static const AccSet ACC_READONLY = 1 << 0; // 0000_0001b
|
|
|
|
static const AccSet ACC_STACK = 1 << 1; // 0000_0010b
|
|
|
|
static const AccSet ACC_OTHER = 1 << 2; // 0000_0100b
|
|
|
|
|
|
|
|
// Some common (non-singleton) access region sets. ACC_NONE does not make
|
|
|
|
// sense for loads or stores (which must access at least one region), it
|
|
|
|
// only makes sense for calls.
|
|
|
|
//
|
|
|
|
// A convention that's worth using: use ACC_LOAD_ANY/ACC_STORE_ANY for
|
|
|
|
// cases that you're unsure about or haven't considered carefully. Use
|
|
|
|
// ACC_ALL/ACC_ALL_WRITABLE for cases that you have considered carefully.
|
|
|
|
// That way it's easy to tell which ones have been considered and which
|
|
|
|
// haven't.
|
|
|
|
static const AccSet ACC_NONE = 0x0;
|
|
|
|
static const AccSet ACC_ALL_WRITABLE = ACC_STACK | ACC_OTHER;
|
|
|
|
static const AccSet ACC_ALL = ACC_READONLY | ACC_ALL_WRITABLE;
|
|
|
|
static const AccSet ACC_LOAD_ANY = ACC_ALL; // synonym
|
|
|
|
static const AccSet ACC_STORE_ANY = ACC_ALL_WRITABLE; // synonym
|
|
|
|
|
|
|
|
|
2008-10-13 13:29:18 -07:00
|
|
|
struct CallInfo
|
2009-07-10 12:58:34 -07:00
|
|
|
{
|
2009-07-29 17:44:34 -07:00
|
|
|
uintptr_t _address;
|
2010-02-14 22:24:21 -08:00
|
|
|
uint32_t _argtypes:27; // 9 3-bit fields indicating arg type, by ARGSIZE above (including ret type): a1 a2 a3 a4 a5 ret
|
2008-10-13 13:29:18 -07:00
|
|
|
AbiKind _abi:3;
|
2010-03-01 17:43:20 -08:00
|
|
|
uint8_t _isPure:1; // _isPure=1 means no side-effects, result only depends on args
|
|
|
|
AccSet _storeAccSet; // access regions stored by the function
|
2009-07-10 12:58:34 -07:00
|
|
|
verbose_only ( const char* _name; )
|
|
|
|
|
2010-02-14 22:24:21 -08:00
|
|
|
uint32_t _count_args(uint32_t mask) const;
|
|
|
|
// Nb: uses right-to-left order, eg. sizes[0] is the size of the right-most arg.
|
|
|
|
uint32_t get_sizes(ArgSize* sizes) const;
|
2008-10-13 13:29:18 -07:00
|
|
|
|
2010-02-14 22:24:21 -08:00
|
|
|
inline ArgSize returnType() const {
|
|
|
|
return ArgSize(_argtypes & ARGSIZE_MASK_ANY);
|
2010-01-13 14:40:35 -08:00
|
|
|
}
|
|
|
|
|
2010-02-14 22:24:21 -08:00
|
|
|
// Note that this indexes arguments *backwards*, that is to
|
|
|
|
// get the Nth arg, you have to ask for index (numargs - N).
|
|
|
|
// See mozilla bug 525815 for fixing this.
|
|
|
|
inline ArgSize argType(uint32_t arg) const {
|
|
|
|
return ArgSize((_argtypes >> (ARGSIZE_SHIFT * (arg+1))) & ARGSIZE_MASK_ANY);
|
2010-02-14 16:01:04 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
inline bool isIndirect() const {
|
|
|
|
return _address < 256;
|
2008-10-13 13:29:18 -07:00
|
|
|
}
|
2010-02-14 22:24:21 -08:00
|
|
|
inline uint32_t count_args() const {
|
|
|
|
return _count_args(ARGSIZE_MASK_ANY);
|
|
|
|
}
|
|
|
|
inline uint32_t count_iargs() const {
|
|
|
|
return _count_args(ARGSIZE_MASK_INT);
|
|
|
|
}
|
|
|
|
// fargs = args - iargs
|
2009-07-10 12:58:34 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Record for extra data used to compile switches as jump tables.
|
|
|
|
*/
|
|
|
|
struct SwitchInfo
|
|
|
|
{
|
|
|
|
NIns** table; // Jump table; a jump address is NIns*
|
|
|
|
uint32_t count; // Number of table entries
|
|
|
|
// Index value at last execution of the switch. The index value
|
|
|
|
// is the offset into the jump table. Thus it is computed as
|
|
|
|
// (switch expression) - (lowest case value).
|
|
|
|
uint32_t index;
|
|
|
|
};
|
2009-02-11 17:40:27 -08:00
|
|
|
|
2010-02-28 17:02:01 -08:00
|
|
|
// Array holding the 'isCse' field from LIRopcode.tbl.
|
|
|
|
extern const int8_t isCses[]; // cannot be uint8_t, some values are negative
|
|
|
|
|
2009-05-17 22:38:00 -07:00
|
|
|
inline bool isCseOpcode(LOpcode op) {
|
2010-02-28 17:02:01 -08:00
|
|
|
NanoAssert(isCses[op] != -1); // see LIRopcode.tbl to understand this
|
|
|
|
return isCses[op] == 1;
|
2008-10-13 13:29:18 -07:00
|
|
|
}
|
2009-05-17 22:38:00 -07:00
|
|
|
inline bool isRetOpcode(LOpcode op) {
|
2010-02-11 17:30:16 -08:00
|
|
|
return
|
|
|
|
#if defined NANOJIT_64BIT
|
|
|
|
op == LIR_qret ||
|
|
|
|
#endif
|
|
|
|
op == LIR_ret || op == LIR_fret;
|
|
|
|
}
|
|
|
|
inline bool isCmovOpcode(LOpcode op) {
|
|
|
|
return
|
|
|
|
#if defined NANOJIT_64BIT
|
|
|
|
op == LIR_qcmov ||
|
|
|
|
#endif
|
|
|
|
op == LIR_cmov;
|
|
|
|
}
|
2010-02-28 17:02:01 -08:00
|
|
|
inline bool isICmpOpcode(LOpcode op) {
|
|
|
|
return LIR_eq <= op && op <= LIR_uge;
|
|
|
|
}
|
|
|
|
inline bool isSICmpOpcode(LOpcode op) {
|
|
|
|
return LIR_eq <= op && op <= LIR_ge;
|
|
|
|
}
|
|
|
|
inline bool isUICmpOpcode(LOpcode op) {
|
|
|
|
return LIR_eq == op || (LIR_ult <= op && op <= LIR_uge);
|
|
|
|
}
|
|
|
|
#ifdef NANOJIT_64BIT
|
|
|
|
inline bool isQCmpOpcode(LOpcode op) {
|
|
|
|
return LIR_qeq <= op && op <= LIR_quge;
|
|
|
|
}
|
|
|
|
inline bool isSQCmpOpcode(LOpcode op) {
|
|
|
|
return LIR_qeq <= op && op <= LIR_qge;
|
|
|
|
}
|
|
|
|
inline bool isUQCmpOpcode(LOpcode op) {
|
|
|
|
return LIR_qeq == op || (LIR_qult <= op && op <= LIR_quge);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
inline bool isFCmpOpcode(LOpcode op) {
|
|
|
|
return LIR_feq <= op && op <= LIR_fge;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline LOpcode invertCondJmpOpcode(LOpcode op) {
|
|
|
|
NanoAssert(op == LIR_jt || op == LIR_jf);
|
|
|
|
return LOpcode(op ^ 1);
|
|
|
|
}
|
|
|
|
inline LOpcode invertCondGuardOpcode(LOpcode op) {
|
|
|
|
NanoAssert(op == LIR_xt || op == LIR_xf);
|
|
|
|
return LOpcode(op ^ 1);
|
|
|
|
}
|
|
|
|
inline LOpcode invertICmpOpcode(LOpcode op) {
|
|
|
|
NanoAssert(isICmpOpcode(op));
|
|
|
|
return LOpcode(op ^ 1);
|
|
|
|
}
|
|
|
|
#ifdef NANOJIT_64BIT
|
|
|
|
inline LOpcode invertQCmpOpcode(LOpcode op) {
|
|
|
|
NanoAssert(isQCmpOpcode(op));
|
|
|
|
return LOpcode(op ^ 1);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
inline LOpcode invertFCmpOpcode(LOpcode op) {
|
|
|
|
NanoAssert(isFCmpOpcode(op));
|
|
|
|
return LOpcode(op ^ 1);
|
|
|
|
}
|
|
|
|
|
2010-02-11 17:30:16 -08:00
|
|
|
inline LOpcode getCallOpcode(const CallInfo* ci) {
|
|
|
|
LOpcode op = LIR_pcall;
|
|
|
|
switch (ci->returnType()) {
|
2010-02-14 22:24:21 -08:00
|
|
|
case ARGSIZE_NONE: op = LIR_pcall; break;
|
|
|
|
case ARGSIZE_I:
|
|
|
|
case ARGSIZE_U: op = LIR_icall; break;
|
|
|
|
case ARGSIZE_F: op = LIR_fcall; break;
|
2010-02-11 17:30:16 -08:00
|
|
|
#ifdef NANOJIT_64BIT
|
2010-02-14 22:24:21 -08:00
|
|
|
case ARGSIZE_Q: op = LIR_qcall; break;
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2010-02-14 22:24:21 -08:00
|
|
|
default: NanoAssert(0); break;
|
2010-02-11 17:30:16 -08:00
|
|
|
}
|
|
|
|
return op;
|
2008-10-13 13:29:18 -07:00
|
|
|
}
|
2010-02-11 17:30:16 -08:00
|
|
|
|
2009-12-09 15:49:15 -08:00
|
|
|
LOpcode f64arith_to_i32arith(LOpcode op);
|
2010-02-11 17:30:16 -08:00
|
|
|
#ifdef NANOJIT_64BIT
|
2009-12-09 15:49:15 -08:00
|
|
|
LOpcode i32cmp_to_i64cmp(LOpcode op);
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2009-12-09 15:49:15 -08:00
|
|
|
// Array holding the 'repKind' field from LIRopcode.tbl.
|
2009-09-09 21:02:59 -07:00
|
|
|
extern const uint8_t repKinds[];
|
|
|
|
|
2010-02-11 17:30:16 -08:00
|
|
|
enum LTy {
|
|
|
|
LTy_Void, // no value/no type
|
|
|
|
LTy_I32, // 32-bit integer
|
|
|
|
#ifdef NANOJIT_64BIT
|
|
|
|
LTy_I64, // 64-bit integer
|
|
|
|
#endif
|
|
|
|
LTy_F64, // 64-bit float
|
2010-01-21 15:10:59 -08:00
|
|
|
|
|
|
|
LTy_Ptr = PTR_SIZE(LTy_I32, LTy_I64) // word-sized integer
|
2009-12-09 15:49:15 -08:00
|
|
|
};
|
|
|
|
|
|
|
|
// Array holding the 'retType' field from LIRopcode.tbl.
|
|
|
|
extern const LTy retTypes[];
|
|
|
|
|
2010-01-24 15:39:36 -08:00
|
|
|
inline RegisterMask rmask(Register r)
|
|
|
|
{
|
|
|
|
return RegisterMask(1) << r;
|
|
|
|
}
|
|
|
|
|
2009-06-30 21:18:55 -07:00
|
|
|
//-----------------------------------------------------------------------
|
|
|
|
// Low-level instructions. This is a bit complicated, because we have a
|
|
|
|
// variable-width representation to minimise space usage.
|
|
|
|
//
|
|
|
|
// - Instruction size is always an integral multiple of word size.
|
|
|
|
//
|
|
|
|
// - Every instruction has at least one word, holding the opcode and the
|
|
|
|
// reservation info. That word is in class LIns.
|
|
|
|
//
|
|
|
|
// - Beyond that, most instructions have 1, 2 or 3 extra words. These
|
|
|
|
// extra words are in classes LInsOp1, LInsOp2, etc (collectively called
|
2009-09-08 16:18:41 -07:00
|
|
|
// "LInsXYZ" in what follows). Each LInsXYZ class also contains an LIns,
|
|
|
|
// accessible by the 'ins' member, which holds the LIns data.
|
2009-06-30 21:18:55 -07:00
|
|
|
//
|
|
|
|
// - LIR is written forward, but read backwards. When reading backwards,
|
|
|
|
// in order to find the opcode, it must be in a predictable place in the
|
|
|
|
// LInsXYZ isn't affected by instruction width. Therefore, the LIns
|
|
|
|
// word (which contains the opcode) is always the *last* word in an
|
|
|
|
// instruction.
|
|
|
|
//
|
|
|
|
// - Each instruction is created by casting pre-allocated bytes from a
|
|
|
|
// LirBuffer to the LInsXYZ type. Therefore there are no constructors
|
|
|
|
// for LIns or LInsXYZ.
|
|
|
|
//
|
|
|
|
// - The standard handle for an instruction is a LIns*. This actually
|
|
|
|
// points to the LIns word, ie. to the final word in the instruction.
|
|
|
|
// This is a bit odd, but it allows the instruction's opcode to be
|
|
|
|
// easily accessed. Once you've looked at the opcode and know what kind
|
|
|
|
// of instruction it is, if you want to access any of the other words,
|
|
|
|
// you need to use toLInsXYZ(), which takes the LIns* and gives you an
|
|
|
|
// LInsXYZ*, ie. the pointer to the actual start of the instruction's
|
|
|
|
// bytes. From there you can access the instruction-specific extra
|
|
|
|
// words.
|
|
|
|
//
|
|
|
|
// - However, from outside class LIns, LInsXYZ isn't visible, nor is
|
|
|
|
// toLInsXYZ() -- from outside LIns, all LIR instructions are handled
|
|
|
|
// via LIns pointers and get/set methods are used for all LIns/LInsXYZ
|
|
|
|
// accesses. In fact, all data members in LInsXYZ are private and can
|
|
|
|
// only be accessed by LIns, which is a friend class. The only thing
|
|
|
|
// anyone outside LIns can do with a LInsXYZ is call getLIns().
|
|
|
|
//
|
|
|
|
// - An example Op2 instruction and the likely pointers to it (each line
|
|
|
|
// represents a word, and pointers to a line point to the start of the
|
|
|
|
// word on that line):
|
|
|
|
//
|
|
|
|
// [ oprnd_2 <-- LInsOp2* insOp2 == toLInsOp2(ins)
|
|
|
|
// oprnd_1
|
|
|
|
// opcode + resv ] <-- LIns* ins
|
|
|
|
//
|
2009-12-21 12:05:48 -08:00
|
|
|
// - LIR_skip instructions are used to link code chunks. If the first
|
2009-11-12 21:18:40 -08:00
|
|
|
// instruction on a chunk isn't a LIR_start, it will be a skip, and the
|
2009-12-21 12:05:48 -08:00
|
|
|
// skip's operand will point to the last LIns on the preceding chunk.
|
2009-06-30 21:18:55 -07:00
|
|
|
// LInsSk has the same layout as LInsOp1, but we represent it as a
|
|
|
|
// different class because there are some places where we treat
|
|
|
|
// skips specially and so having it separate seems like a good idea.
|
|
|
|
//
|
|
|
|
// - Various things about the size and layout of LIns and LInsXYZ are
|
|
|
|
// statically checked in staticSanityCheck(). In particular, this is
|
|
|
|
// worthwhile because there's nothing that guarantees that all the
|
|
|
|
// LInsXYZ classes have a size that is a multiple of word size (but in
|
|
|
|
// practice all sane compilers use a layout that results in this). We
|
|
|
|
// also check that every LInsXYZ is word-aligned in
|
|
|
|
// LirBuffer::makeRoom(); this seems sensible to avoid potential
|
2009-11-12 21:18:40 -08:00
|
|
|
// slowdowns due to misalignment. It relies on chunks themselves being
|
2009-06-30 21:18:55 -07:00
|
|
|
// word-aligned, which is extremely likely.
|
|
|
|
//
|
|
|
|
// - There is an enum, LInsRepKind, with one member for each of the
|
|
|
|
// LInsXYZ kinds. Each opcode is categorised with its LInsRepKind value
|
|
|
|
// in LIRopcode.tbl, and this is used in various places.
|
|
|
|
//-----------------------------------------------------------------------
|
|
|
|
|
|
|
|
enum LInsRepKind {
|
|
|
|
// LRK_XYZ corresponds to class LInsXYZ.
|
|
|
|
LRK_Op0,
|
|
|
|
LRK_Op1,
|
|
|
|
LRK_Op2,
|
2009-07-21 17:28:25 -07:00
|
|
|
LRK_Op3,
|
2009-07-06 16:26:12 -07:00
|
|
|
LRK_Ld,
|
2009-06-30 21:18:55 -07:00
|
|
|
LRK_Sti,
|
|
|
|
LRK_Sk,
|
|
|
|
LRK_C,
|
|
|
|
LRK_P,
|
|
|
|
LRK_I,
|
2009-12-09 15:49:15 -08:00
|
|
|
LRK_N64,
|
2009-11-11 11:38:12 -08:00
|
|
|
LRK_Jtbl,
|
2009-06-30 21:18:55 -07:00
|
|
|
LRK_None // this one is used for unused opcode numbers
|
|
|
|
};
|
2009-06-30 18:13:22 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
class LInsOp0;
|
|
|
|
class LInsOp1;
|
|
|
|
class LInsOp2;
|
|
|
|
class LInsOp3;
|
|
|
|
class LInsLd;
|
|
|
|
class LInsSti;
|
|
|
|
class LInsSk;
|
|
|
|
class LInsC;
|
|
|
|
class LInsP;
|
|
|
|
class LInsI;
|
2009-12-09 15:49:15 -08:00
|
|
|
class LInsN64;
|
2009-11-11 11:38:12 -08:00
|
|
|
class LInsJtbl;
|
2009-09-08 16:18:41 -07:00
|
|
|
|
|
|
|
class LIns
|
|
|
|
{
|
|
|
|
private:
|
2010-01-24 15:39:36 -08:00
|
|
|
// LastWord: fields shared by all LIns kinds. The .inReg, .reg,
|
|
|
|
// .inAr and .arIndex fields form a "reservation" that is used
|
|
|
|
// temporarily during assembly to record information relating to
|
|
|
|
// register allocation. See class RegAlloc for more details.
|
|
|
|
//
|
|
|
|
// Note: all combinations of .inReg/.inAr are possible, ie. 0/0, 0/1,
|
|
|
|
// 1/0, 1/1.
|
2009-11-24 23:00:23 -08:00
|
|
|
struct LastWord {
|
2010-01-24 15:39:36 -08:00
|
|
|
uint32_t inReg:1; // if 1, 'reg' is active
|
|
|
|
Register reg:7;
|
|
|
|
uint32_t inAr:1; // if 1, 'arIndex' is active
|
|
|
|
uint32_t arIndex:15; // index into stack frame; displ is -4*arIndex
|
2009-11-24 23:00:23 -08:00
|
|
|
|
|
|
|
LOpcode opcode:8; // instruction's opcode
|
|
|
|
};
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
union {
|
2009-11-24 23:00:23 -08:00
|
|
|
LastWord lastWord;
|
|
|
|
// Force sizeof(LIns)==8 and 8-byte alignment on 64-bit machines.
|
|
|
|
// This is necessary because sizeof(LastWord)==4 and we want all
|
2009-09-08 16:18:41 -07:00
|
|
|
// instances of LIns to be pointer-aligned.
|
|
|
|
void* dummy;
|
|
|
|
};
|
|
|
|
|
|
|
|
// LIns-to-LInsXYZ converters.
|
|
|
|
inline LInsOp0* toLInsOp0() const;
|
|
|
|
inline LInsOp1* toLInsOp1() const;
|
|
|
|
inline LInsOp2* toLInsOp2() const;
|
|
|
|
inline LInsOp3* toLInsOp3() const;
|
|
|
|
inline LInsLd* toLInsLd() const;
|
|
|
|
inline LInsSti* toLInsSti() const;
|
|
|
|
inline LInsSk* toLInsSk() const;
|
|
|
|
inline LInsC* toLInsC() const;
|
|
|
|
inline LInsP* toLInsP() const;
|
|
|
|
inline LInsI* toLInsI() const;
|
2009-12-09 15:49:15 -08:00
|
|
|
inline LInsN64* toLInsN64() const;
|
2009-11-11 11:38:12 -08:00
|
|
|
inline LInsJtbl*toLInsJtbl()const;
|
2009-09-08 16:18:41 -07:00
|
|
|
|
|
|
|
void staticSanityCheck();
|
|
|
|
|
|
|
|
public:
|
|
|
|
// LIns initializers.
|
|
|
|
inline void initLInsOp0(LOpcode opcode);
|
|
|
|
inline void initLInsOp1(LOpcode opcode, LIns* oprnd1);
|
|
|
|
inline void initLInsOp2(LOpcode opcode, LIns* oprnd1, LIns* oprnd2);
|
|
|
|
inline void initLInsOp3(LOpcode opcode, LIns* oprnd1, LIns* oprnd2, LIns* oprnd3);
|
2010-03-01 17:43:20 -08:00
|
|
|
inline void initLInsLd(LOpcode opcode, LIns* val, int32_t d, AccSet accSet);
|
|
|
|
inline void initLInsSti(LOpcode opcode, LIns* val, LIns* base, int32_t d, AccSet accSet);
|
2009-09-08 16:18:41 -07:00
|
|
|
inline void initLInsSk(LIns* prevLIns);
|
2009-11-09 19:12:18 -08:00
|
|
|
// Nb: args[] must be allocated and initialised before being passed in;
|
|
|
|
// initLInsC() just copies the pointer into the LInsC.
|
|
|
|
inline void initLInsC(LOpcode opcode, LIns** args, const CallInfo* ci);
|
2009-09-08 16:18:41 -07:00
|
|
|
inline void initLInsP(int32_t arg, int32_t kind);
|
|
|
|
inline void initLInsI(LOpcode opcode, int32_t imm32);
|
2009-12-09 15:49:15 -08:00
|
|
|
inline void initLInsN64(LOpcode opcode, int64_t imm64);
|
2009-11-11 11:38:12 -08:00
|
|
|
inline void initLInsJtbl(LIns* index, uint32_t size, LIns** table);
|
2009-09-08 16:18:41 -07:00
|
|
|
|
|
|
|
LOpcode opcode() const { return lastWord.opcode; }
|
|
|
|
|
2010-01-24 15:39:36 -08:00
|
|
|
// XXX: old reservation manipulating functions. See bug 538924.
|
|
|
|
// Replacement strategy:
|
|
|
|
// - deprecated_markAsClear() --> clearReg() and/or clearArIndex()
|
|
|
|
// - deprecated_hasKnownReg() --> isInReg()
|
|
|
|
// - deprecated_getReg() --> getReg() after checking isInReg()
|
|
|
|
//
|
|
|
|
void deprecated_markAsClear() {
|
|
|
|
lastWord.inReg = 0;
|
|
|
|
lastWord.inAr = 0;
|
|
|
|
}
|
|
|
|
bool deprecated_hasKnownReg() {
|
|
|
|
NanoAssert(isUsed());
|
|
|
|
return isInReg();
|
2009-09-09 18:00:18 -07:00
|
|
|
}
|
2010-01-24 15:39:36 -08:00
|
|
|
Register deprecated_getReg() {
|
|
|
|
NanoAssert(isUsed());
|
|
|
|
return ( isInReg() ? lastWord.reg : deprecated_UnknownReg );
|
|
|
|
}
|
|
|
|
uint32_t deprecated_getArIndex() {
|
|
|
|
NanoAssert(isUsed());
|
|
|
|
return ( isInAr() ? lastWord.arIndex : 0 );
|
2009-09-09 18:00:18 -07:00
|
|
|
}
|
2010-01-24 15:39:36 -08:00
|
|
|
|
|
|
|
// Reservation manipulation.
|
2009-09-09 18:00:18 -07:00
|
|
|
bool isUsed() {
|
2010-01-24 15:39:36 -08:00
|
|
|
return isInReg() || isInAr();
|
2009-09-09 18:00:18 -07:00
|
|
|
}
|
2010-01-24 15:39:36 -08:00
|
|
|
bool isInReg() {
|
|
|
|
return lastWord.inReg;
|
|
|
|
}
|
|
|
|
bool isInRegMask(RegisterMask allow) {
|
|
|
|
return isInReg() && (rmask(getReg()) & allow);
|
2009-09-09 18:00:18 -07:00
|
|
|
}
|
|
|
|
Register getReg() {
|
2010-01-24 15:39:36 -08:00
|
|
|
NanoAssert(isInReg());
|
2009-09-09 18:00:18 -07:00
|
|
|
return lastWord.reg;
|
|
|
|
}
|
|
|
|
void setReg(Register r) {
|
2010-01-24 15:39:36 -08:00
|
|
|
lastWord.inReg = 1;
|
2009-09-09 18:00:18 -07:00
|
|
|
lastWord.reg = r;
|
|
|
|
}
|
2010-01-24 15:39:36 -08:00
|
|
|
void clearReg() {
|
|
|
|
lastWord.inReg = 0;
|
|
|
|
}
|
|
|
|
bool isInAr() {
|
|
|
|
return lastWord.inAr;
|
|
|
|
}
|
2009-09-09 18:00:18 -07:00
|
|
|
uint32_t getArIndex() {
|
2010-01-24 15:39:36 -08:00
|
|
|
NanoAssert(isInAr());
|
2009-09-09 18:00:18 -07:00
|
|
|
return lastWord.arIndex;
|
|
|
|
}
|
|
|
|
void setArIndex(uint32_t arIndex) {
|
2010-01-24 15:39:36 -08:00
|
|
|
lastWord.inAr = 1;
|
2009-09-09 18:00:18 -07:00
|
|
|
lastWord.arIndex = arIndex;
|
|
|
|
}
|
2010-01-24 15:39:36 -08:00
|
|
|
void clearArIndex() {
|
|
|
|
lastWord.inAr = 0;
|
2009-09-09 18:00:18 -07:00
|
|
|
}
|
2009-09-08 16:18:41 -07:00
|
|
|
|
2009-09-09 18:00:18 -07:00
|
|
|
// For various instruction kinds.
|
2009-09-08 16:18:41 -07:00
|
|
|
inline LIns* oprnd1() const;
|
|
|
|
inline LIns* oprnd2() const;
|
|
|
|
inline LIns* oprnd3() const;
|
|
|
|
|
|
|
|
// For branches.
|
|
|
|
inline LIns* getTarget() const;
|
|
|
|
inline void setTarget(LIns* label);
|
|
|
|
|
|
|
|
// For guards.
|
|
|
|
inline GuardRecord* record() const;
|
|
|
|
|
2010-03-01 17:43:20 -08:00
|
|
|
// For loads/stores.
|
2009-09-08 16:18:41 -07:00
|
|
|
inline int32_t disp() const;
|
2010-03-05 14:14:31 -08:00
|
|
|
inline AccSet accSet() const;
|
2009-09-08 16:18:41 -07:00
|
|
|
|
|
|
|
// For LInsSk.
|
|
|
|
inline LIns* prevLIns() const;
|
|
|
|
|
|
|
|
// For LInsP.
|
|
|
|
inline uint8_t paramArg() const;
|
|
|
|
inline uint8_t paramKind() const;
|
|
|
|
|
|
|
|
// For LInsI.
|
|
|
|
inline int32_t imm32() const;
|
|
|
|
|
2009-12-09 15:49:15 -08:00
|
|
|
// For LInsN64.
|
2009-09-08 16:18:41 -07:00
|
|
|
inline int32_t imm64_0() const;
|
|
|
|
inline int32_t imm64_1() const;
|
|
|
|
inline uint64_t imm64() const;
|
|
|
|
inline double imm64f() const;
|
|
|
|
|
|
|
|
// For LIR_alloc.
|
|
|
|
inline int32_t size() const;
|
|
|
|
inline void setSize(int32_t nbytes);
|
|
|
|
|
|
|
|
// For LInsC.
|
2010-01-21 15:10:59 -08:00
|
|
|
inline LIns* arg(uint32_t i) const; // right-to-left-order: arg(0) is rightmost
|
2009-09-08 16:18:41 -07:00
|
|
|
inline uint32_t argc() const;
|
|
|
|
inline LIns* callArgN(uint32_t n) const;
|
|
|
|
inline const CallInfo* callInfo() const;
|
|
|
|
|
2009-11-11 11:38:12 -08:00
|
|
|
// For LIR_jtbl
|
|
|
|
inline uint32_t getTableSize() const;
|
|
|
|
inline LIns* getTarget(uint32_t index) const;
|
|
|
|
inline void setTarget(uint32_t index, LIns* label) const;
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
// isLInsXYZ() returns true if the instruction has the LInsXYZ form.
|
|
|
|
// Note that there is some overlap with other predicates, eg.
|
|
|
|
// isStore()==isLInsSti(), isCall()==isLInsC(), but that's ok; these
|
2009-09-09 21:02:59 -07:00
|
|
|
// ones are used mostly to check that opcodes are appropriate for
|
2009-09-08 16:18:41 -07:00
|
|
|
// instruction layouts, the others are used for non-debugging
|
|
|
|
// purposes.
|
2009-09-09 21:02:59 -07:00
|
|
|
bool isLInsOp0() const {
|
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
|
|
|
return LRK_Op0 == repKinds[opcode()];
|
|
|
|
}
|
|
|
|
bool isLInsOp1() const {
|
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
|
|
|
return LRK_Op1 == repKinds[opcode()];
|
|
|
|
}
|
|
|
|
bool isLInsOp2() const {
|
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
|
|
|
return LRK_Op2 == repKinds[opcode()];
|
|
|
|
}
|
|
|
|
bool isLInsOp3() const {
|
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
|
|
|
return LRK_Op3 == repKinds[opcode()];
|
|
|
|
}
|
|
|
|
bool isLInsLd() const {
|
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
|
|
|
return LRK_Ld == repKinds[opcode()];
|
|
|
|
}
|
|
|
|
bool isLInsSti() const {
|
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
|
|
|
return LRK_Sti == repKinds[opcode()];
|
|
|
|
}
|
|
|
|
bool isLInsSk() const {
|
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
|
|
|
return LRK_Sk == repKinds[opcode()];
|
|
|
|
}
|
|
|
|
bool isLInsC() const {
|
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
|
|
|
return LRK_C == repKinds[opcode()];
|
|
|
|
}
|
|
|
|
bool isLInsP() const {
|
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
|
|
|
return LRK_P == repKinds[opcode()];
|
|
|
|
}
|
|
|
|
bool isLInsI() const {
|
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
|
|
|
return LRK_I == repKinds[opcode()];
|
|
|
|
}
|
2009-12-09 15:49:15 -08:00
|
|
|
bool isLInsN64() const {
|
2009-09-09 21:02:59 -07:00
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
2009-12-09 15:49:15 -08:00
|
|
|
return LRK_N64 == repKinds[opcode()];
|
2009-09-09 21:02:59 -07:00
|
|
|
}
|
2009-11-11 11:38:12 -08:00
|
|
|
bool isLInsJtbl() const {
|
|
|
|
NanoAssert(LRK_None != repKinds[opcode()]);
|
|
|
|
return LRK_Jtbl == repKinds[opcode()];
|
|
|
|
}
|
2009-09-09 21:02:59 -07:00
|
|
|
|
|
|
|
// LIns predicates.
|
2010-02-28 17:02:01 -08:00
|
|
|
bool isop(LOpcode o) const {
|
|
|
|
return opcode() == o;
|
2009-09-09 21:02:59 -07:00
|
|
|
}
|
|
|
|
bool isRet() const {
|
|
|
|
return isRetOpcode(opcode());
|
|
|
|
}
|
2010-02-11 17:30:16 -08:00
|
|
|
bool isLive() const {
|
2010-02-28 17:02:01 -08:00
|
|
|
return isop(LIR_live) ||
|
2010-02-11 17:30:16 -08:00
|
|
|
#if defined NANOJIT_64BIT
|
2010-02-28 17:02:01 -08:00
|
|
|
isop(LIR_qlive) ||
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2010-02-28 17:02:01 -08:00
|
|
|
isop(LIR_flive);
|
2009-09-09 21:02:59 -07:00
|
|
|
}
|
|
|
|
bool isCmp() const {
|
|
|
|
LOpcode op = opcode();
|
2010-02-28 17:02:01 -08:00
|
|
|
return isICmpOpcode(op) ||
|
2010-02-11 17:30:16 -08:00
|
|
|
#if defined NANOJIT_64BIT
|
2010-02-28 17:02:01 -08:00
|
|
|
isQCmpOpcode(op) ||
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2010-02-28 17:02:01 -08:00
|
|
|
isFCmpOpcode(op);
|
2009-09-09 21:02:59 -07:00
|
|
|
}
|
2009-09-08 16:18:41 -07:00
|
|
|
bool isCall() const {
|
2010-02-28 17:02:01 -08:00
|
|
|
return isop(LIR_icall) ||
|
2010-02-11 17:30:16 -08:00
|
|
|
#if defined NANOJIT_64BIT
|
2010-02-28 17:02:01 -08:00
|
|
|
isop(LIR_qcall) ||
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2010-02-28 17:02:01 -08:00
|
|
|
isop(LIR_fcall);
|
2010-02-11 17:30:16 -08:00
|
|
|
}
|
|
|
|
bool isCmov() const {
|
|
|
|
return isCmovOpcode(opcode());
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
|
|
|
bool isStore() const {
|
2009-12-01 16:50:03 -08:00
|
|
|
return isLInsSti();
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
|
|
|
bool isLoad() const {
|
2009-12-01 16:50:03 -08:00
|
|
|
return isLInsLd();
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
|
|
|
bool isGuard() const {
|
2009-12-09 15:49:15 -08:00
|
|
|
return isop(LIR_x) || isop(LIR_xf) || isop(LIR_xt) ||
|
2010-02-18 20:04:55 -08:00
|
|
|
isop(LIR_xbarrier) || isop(LIR_xtbl) ||
|
|
|
|
isop(LIR_addxov) || isop(LIR_subxov) || isop(LIR_mulxov);
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
|
|
|
// True if the instruction is a 32-bit or smaller constant integer.
|
2009-09-09 21:02:59 -07:00
|
|
|
bool isconst() const {
|
2009-12-09 15:49:15 -08:00
|
|
|
return isop(LIR_int);
|
2009-09-09 21:02:59 -07:00
|
|
|
}
|
2009-09-08 16:18:41 -07:00
|
|
|
// True if the instruction is a 32-bit or smaller constant integer and
|
|
|
|
// has the value val when treated as a 32-bit signed integer.
|
2009-09-09 21:02:59 -07:00
|
|
|
bool isconstval(int32_t val) const {
|
|
|
|
return isconst() && imm32()==val;
|
|
|
|
}
|
2009-09-08 16:18:41 -07:00
|
|
|
// True if the instruction is a constant quad value.
|
2009-09-09 21:02:59 -07:00
|
|
|
bool isconstq() const {
|
2010-02-11 17:30:16 -08:00
|
|
|
return
|
|
|
|
#ifdef NANOJIT_64BIT
|
|
|
|
isop(LIR_quad) ||
|
|
|
|
#endif
|
|
|
|
isop(LIR_float);
|
2009-09-09 21:02:59 -07:00
|
|
|
}
|
2009-09-08 16:18:41 -07:00
|
|
|
// True if the instruction is a constant pointer value.
|
2009-09-09 21:24:57 -07:00
|
|
|
bool isconstp() const
|
2009-09-09 21:02:59 -07:00
|
|
|
{
|
|
|
|
#ifdef NANOJIT_64BIT
|
|
|
|
return isconstq();
|
|
|
|
#else
|
|
|
|
return isconst();
|
|
|
|
#endif
|
|
|
|
}
|
2009-09-08 16:18:41 -07:00
|
|
|
// True if the instruction is a constant float value.
|
2009-09-09 21:02:59 -07:00
|
|
|
bool isconstf() const {
|
2009-12-09 15:49:15 -08:00
|
|
|
return isop(LIR_float);
|
2009-09-09 21:02:59 -07:00
|
|
|
}
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
bool isBranch() const {
|
2009-11-11 11:38:12 -08:00
|
|
|
return isop(LIR_jt) || isop(LIR_jf) || isop(LIR_j) || isop(LIR_jtbl);
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
|
|
|
|
2010-01-21 15:10:59 -08:00
|
|
|
LTy retType() const {
|
|
|
|
return retTypes[opcode()];
|
|
|
|
}
|
2010-01-10 20:51:49 -08:00
|
|
|
bool isVoid() const {
|
2010-01-21 15:10:59 -08:00
|
|
|
return retType() == LTy_Void;
|
2010-01-10 20:51:49 -08:00
|
|
|
}
|
|
|
|
bool isI32() const {
|
2010-01-21 15:10:59 -08:00
|
|
|
return retType() == LTy_I32;
|
2010-01-10 20:51:49 -08:00
|
|
|
}
|
2010-02-11 17:30:16 -08:00
|
|
|
#ifdef NANOJIT_64BIT
|
2010-01-10 20:51:49 -08:00
|
|
|
bool isI64() const {
|
2010-01-21 15:10:59 -08:00
|
|
|
return retType() == LTy_I64;
|
2010-01-10 20:51:49 -08:00
|
|
|
}
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2010-01-10 20:51:49 -08:00
|
|
|
bool isF64() const {
|
2010-01-21 15:10:59 -08:00
|
|
|
return retType() == LTy_F64;
|
2010-01-10 20:51:49 -08:00
|
|
|
}
|
2010-02-11 17:30:16 -08:00
|
|
|
bool isN64() const {
|
|
|
|
return
|
|
|
|
#ifdef NANOJIT_64BIT
|
|
|
|
isI64() ||
|
|
|
|
#endif
|
|
|
|
isF64();
|
|
|
|
}
|
2010-01-10 20:51:49 -08:00
|
|
|
bool isPtr() const {
|
|
|
|
#ifdef NANOJIT_64BIT
|
|
|
|
return isI64();
|
2009-09-08 16:18:41 -07:00
|
|
|
#else
|
2010-01-10 20:51:49 -08:00
|
|
|
return isI32();
|
2009-09-08 16:18:41 -07:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return true if removal of 'ins' from a LIR fragment could
|
|
|
|
// possibly change the behaviour of that fragment, even if any
|
|
|
|
// value computed by 'ins' is not used later in the fragment.
|
2009-12-09 15:49:15 -08:00
|
|
|
// In other words, can 'ins' possibly alter control flow or memory?
|
2009-09-08 16:18:41 -07:00
|
|
|
// Note, this assumes that loads will never fault and hence cannot
|
|
|
|
// affect the control flow.
|
|
|
|
bool isStmt() {
|
2010-01-04 15:46:34 -08:00
|
|
|
NanoAssert(!isop(LIR_start) && !isop(LIR_skip));
|
2010-02-28 17:02:01 -08:00
|
|
|
// All instructions with Void retType are statements, as are calls
|
2010-03-01 17:43:20 -08:00
|
|
|
// to impure functions.
|
2010-01-04 15:46:34 -08:00
|
|
|
if (isCall())
|
2010-03-01 17:43:20 -08:00
|
|
|
return !callInfo()->_isPure;
|
2010-01-04 15:46:34 -08:00
|
|
|
else
|
2010-01-10 20:51:49 -08:00
|
|
|
return isVoid();
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
inline void* constvalp() const
|
|
|
|
{
|
|
|
|
#ifdef NANOJIT_64BIT
|
|
|
|
return (void*)imm64();
|
|
|
|
#else
|
|
|
|
return (void*)imm32();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
typedef LIns* LInsp;
|
|
|
|
typedef SeqBuilder<LIns*> InsList;
|
2010-01-07 16:41:42 -08:00
|
|
|
typedef SeqBuilder<char*> StringList;
|
2009-09-08 16:18:41 -07:00
|
|
|
|
2009-08-04 08:33:14 -07:00
|
|
|
|
2009-06-30 21:18:55 -07:00
|
|
|
// 0-operand form. Used for LIR_start and LIR_label.
|
|
|
|
class LInsOp0
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
2009-06-30 18:13:22 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns ins;
|
2009-06-30 18:13:22 -07:00
|
|
|
|
2009-06-30 21:18:55 -07:00
|
|
|
public:
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* getLIns() { return &ins; };
|
2009-06-30 21:18:55 -07:00
|
|
|
};
|
2009-06-30 18:13:22 -07:00
|
|
|
|
2010-02-18 20:04:55 -08:00
|
|
|
// 1-operand form. Used for LIR_ret, unary arithmetic/logic ops, etc.
|
2009-06-30 21:18:55 -07:00
|
|
|
class LInsOp1
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
2009-06-30 18:13:22 -07:00
|
|
|
|
2009-06-30 21:18:55 -07:00
|
|
|
LIns* oprnd_1;
|
2009-06-30 18:13:22 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns ins;
|
2009-06-30 18:13:22 -07:00
|
|
|
|
2009-06-30 21:18:55 -07:00
|
|
|
public:
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* getLIns() { return &ins; };
|
2009-06-30 21:18:55 -07:00
|
|
|
};
|
2009-06-30 18:13:22 -07:00
|
|
|
|
2009-06-30 21:18:55 -07:00
|
|
|
// 2-operand form. Used for loads, guards, branches, comparisons, binary
|
|
|
|
// arithmetic/logic ops, etc.
|
|
|
|
class LInsOp2
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
2009-06-30 18:13:22 -07:00
|
|
|
|
2009-06-30 21:18:55 -07:00
|
|
|
LIns* oprnd_2;
|
|
|
|
|
|
|
|
LIns* oprnd_1;
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns ins;
|
2009-06-30 21:18:55 -07:00
|
|
|
|
|
|
|
public:
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* getLIns() { return &ins; };
|
2009-06-30 21:18:55 -07:00
|
|
|
};
|
|
|
|
|
2010-02-18 20:04:55 -08:00
|
|
|
// 3-operand form. Used for conditional moves and xov guards.
|
2009-07-21 17:28:25 -07:00
|
|
|
class LInsOp3
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
|
|
|
|
|
|
|
LIns* oprnd_3;
|
|
|
|
|
|
|
|
LIns* oprnd_2;
|
|
|
|
|
|
|
|
LIns* oprnd_1;
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns ins;
|
2009-07-21 17:28:25 -07:00
|
|
|
|
|
|
|
public:
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* getLIns() { return &ins; };
|
2009-07-21 17:28:25 -07:00
|
|
|
};
|
|
|
|
|
2009-07-06 16:26:12 -07:00
|
|
|
// Used for all loads.
|
|
|
|
class LInsLd
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
|
|
|
|
2010-03-01 17:43:20 -08:00
|
|
|
// Nb: the LIR writer pipeline handles things if a displacement
|
|
|
|
// exceeds 16 bits. This is rare, but does happen occasionally. We
|
|
|
|
// could go to 24 bits but then it would happen so rarely that the
|
|
|
|
// handler code would be difficult to test and thus untrustworthy.
|
|
|
|
int16_t disp;
|
|
|
|
AccSet accSet;
|
2009-07-06 16:26:12 -07:00
|
|
|
|
|
|
|
LIns* oprnd_1;
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns ins;
|
2009-07-06 16:26:12 -07:00
|
|
|
|
|
|
|
public:
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* getLIns() { return &ins; };
|
2009-07-06 16:26:12 -07:00
|
|
|
};
|
|
|
|
|
2009-06-30 21:18:55 -07:00
|
|
|
// Used for LIR_sti and LIR_stqi.
|
|
|
|
class LInsSti
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
|
|
|
|
2010-03-01 17:43:20 -08:00
|
|
|
int16_t disp;
|
|
|
|
AccSet accSet;
|
2009-06-30 21:18:55 -07:00
|
|
|
|
|
|
|
LIns* oprnd_2;
|
|
|
|
|
|
|
|
LIns* oprnd_1;
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns ins;
|
2009-06-30 21:18:55 -07:00
|
|
|
|
|
|
|
public:
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* getLIns() { return &ins; };
|
2009-06-30 21:18:55 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
// Used for LIR_skip.
|
|
|
|
class LInsSk
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
|
|
|
|
|
|
|
LIns* prevLIns;
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns ins;
|
2009-06-30 21:18:55 -07:00
|
|
|
|
|
|
|
public:
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* getLIns() { return &ins; };
|
2009-06-30 21:18:55 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
// Used for all variants of LIR_call.
|
|
|
|
class LInsC
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
|
|
|
|
2009-11-09 19:12:18 -08:00
|
|
|
// Arguments in reverse order, just like insCall() (ie. args[0] holds
|
|
|
|
// the rightmost arg). The array should be allocated by the same
|
|
|
|
// allocator as the LIR buffers, because it has the same lifetime.
|
|
|
|
LIns** args;
|
2009-06-30 21:18:55 -07:00
|
|
|
|
|
|
|
const CallInfo* ci;
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns ins;
|
2009-06-30 21:18:55 -07:00
|
|
|
|
|
|
|
public:
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* getLIns() { return &ins; };
|
2009-06-30 21:18:55 -07:00
|
|
|
};
|
|
|
|
|
2010-01-21 15:10:59 -08:00
|
|
|
// Used for LIR_iparam, LIR_qparam.
|
2009-06-30 21:18:55 -07:00
|
|
|
class LInsP
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
|
|
|
|
|
|
|
uintptr_t arg:8;
|
|
|
|
uintptr_t kind:8;
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns ins;
|
2009-06-30 21:18:55 -07:00
|
|
|
|
|
|
|
public:
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* getLIns() { return &ins; };
|
2009-06-30 21:18:55 -07:00
|
|
|
};
|
|
|
|
|
2010-02-11 17:30:16 -08:00
|
|
|
// Used for LIR_int and LIR_alloc.
|
2009-06-30 21:18:55 -07:00
|
|
|
class LInsI
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
|
|
|
|
|
|
|
int32_t imm32;
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns ins;
|
2009-06-30 21:18:55 -07:00
|
|
|
|
|
|
|
public:
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* getLIns() { return &ins; };
|
2009-06-30 21:18:55 -07:00
|
|
|
};
|
|
|
|
|
2009-12-09 15:49:15 -08:00
|
|
|
// Used for LIR_quad and LIR_float.
|
|
|
|
class LInsN64
|
2009-06-30 21:18:55 -07:00
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
|
|
|
|
|
|
|
int32_t imm64_0;
|
|
|
|
|
|
|
|
int32_t imm64_1;
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns ins;
|
2009-06-30 21:18:55 -07:00
|
|
|
|
|
|
|
public:
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* getLIns() { return &ins; };
|
2009-06-30 21:18:55 -07:00
|
|
|
};
|
|
|
|
|
2010-01-21 15:10:59 -08:00
|
|
|
// Used for LIR_jtbl. 'oprnd_1' must be a uint32_t index in
|
2009-11-11 11:38:12 -08:00
|
|
|
// the range 0 <= index < size; no range check is performed.
|
2010-01-21 15:10:59 -08:00
|
|
|
// 'table' is an array of labels.
|
2009-11-11 11:38:12 -08:00
|
|
|
class LInsJtbl
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
friend class LIns;
|
|
|
|
|
|
|
|
uint32_t size; // number of entries in table
|
|
|
|
LIns** table; // pointer to table[size] with same lifetime as this LInsJtbl
|
|
|
|
LIns* oprnd_1; // uint32_t index expression
|
|
|
|
|
|
|
|
LIns ins;
|
|
|
|
|
|
|
|
public:
|
|
|
|
LIns* getLIns() { return &ins; }
|
|
|
|
};
|
|
|
|
|
2010-02-11 17:30:16 -08:00
|
|
|
// Used only as a placeholder for OP___ macros for unused opcodes in
|
2009-06-30 21:18:55 -07:00
|
|
|
// LIRopcode.tbl.
|
|
|
|
class LInsNone
|
|
|
|
{
|
|
|
|
};
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LInsOp0* LIns::toLInsOp0() const { return (LInsOp0*)( uintptr_t(this+1) - sizeof(LInsOp0) ); }
|
|
|
|
LInsOp1* LIns::toLInsOp1() const { return (LInsOp1*)( uintptr_t(this+1) - sizeof(LInsOp1) ); }
|
|
|
|
LInsOp2* LIns::toLInsOp2() const { return (LInsOp2*)( uintptr_t(this+1) - sizeof(LInsOp2) ); }
|
|
|
|
LInsOp3* LIns::toLInsOp3() const { return (LInsOp3*)( uintptr_t(this+1) - sizeof(LInsOp3) ); }
|
|
|
|
LInsLd* LIns::toLInsLd() const { return (LInsLd* )( uintptr_t(this+1) - sizeof(LInsLd ) ); }
|
|
|
|
LInsSti* LIns::toLInsSti() const { return (LInsSti*)( uintptr_t(this+1) - sizeof(LInsSti) ); }
|
|
|
|
LInsSk* LIns::toLInsSk() const { return (LInsSk* )( uintptr_t(this+1) - sizeof(LInsSk ) ); }
|
|
|
|
LInsC* LIns::toLInsC() const { return (LInsC* )( uintptr_t(this+1) - sizeof(LInsC ) ); }
|
|
|
|
LInsP* LIns::toLInsP() const { return (LInsP* )( uintptr_t(this+1) - sizeof(LInsP ) ); }
|
|
|
|
LInsI* LIns::toLInsI() const { return (LInsI* )( uintptr_t(this+1) - sizeof(LInsI ) ); }
|
2009-12-09 15:49:15 -08:00
|
|
|
LInsN64* LIns::toLInsN64() const { return (LInsN64*)( uintptr_t(this+1) - sizeof(LInsN64) ); }
|
2009-11-11 11:38:12 -08:00
|
|
|
LInsJtbl*LIns::toLInsJtbl()const { return (LInsJtbl*)(uintptr_t(this+1) - sizeof(LInsJtbl)); }
|
2009-09-08 16:18:41 -07:00
|
|
|
|
|
|
|
void LIns::initLInsOp0(LOpcode opcode) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-09-08 16:18:41 -07:00
|
|
|
lastWord.opcode = opcode;
|
|
|
|
NanoAssert(isLInsOp0());
|
|
|
|
}
|
|
|
|
void LIns::initLInsOp1(LOpcode opcode, LIns* oprnd1) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-09-08 16:18:41 -07:00
|
|
|
lastWord.opcode = opcode;
|
|
|
|
toLInsOp1()->oprnd_1 = oprnd1;
|
|
|
|
NanoAssert(isLInsOp1());
|
|
|
|
}
|
|
|
|
void LIns::initLInsOp2(LOpcode opcode, LIns* oprnd1, LIns* oprnd2) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-09-08 16:18:41 -07:00
|
|
|
lastWord.opcode = opcode;
|
|
|
|
toLInsOp2()->oprnd_1 = oprnd1;
|
|
|
|
toLInsOp2()->oprnd_2 = oprnd2;
|
|
|
|
NanoAssert(isLInsOp2());
|
|
|
|
}
|
|
|
|
void LIns::initLInsOp3(LOpcode opcode, LIns* oprnd1, LIns* oprnd2, LIns* oprnd3) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-09-08 16:18:41 -07:00
|
|
|
lastWord.opcode = opcode;
|
|
|
|
toLInsOp3()->oprnd_1 = oprnd1;
|
|
|
|
toLInsOp3()->oprnd_2 = oprnd2;
|
|
|
|
toLInsOp3()->oprnd_3 = oprnd3;
|
|
|
|
NanoAssert(isLInsOp3());
|
|
|
|
}
|
2010-03-01 17:43:20 -08:00
|
|
|
void LIns::initLInsLd(LOpcode opcode, LIns* val, int32_t d, AccSet accSet) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-09-08 16:18:41 -07:00
|
|
|
lastWord.opcode = opcode;
|
|
|
|
toLInsLd()->oprnd_1 = val;
|
2010-03-04 22:44:28 -08:00
|
|
|
NanoAssert(d == int16_t(d));
|
|
|
|
toLInsLd()->disp = int16_t(d);
|
2010-03-01 17:43:20 -08:00
|
|
|
toLInsLd()->accSet = accSet;
|
2009-09-08 16:18:41 -07:00
|
|
|
NanoAssert(isLInsLd());
|
|
|
|
}
|
2010-03-01 17:43:20 -08:00
|
|
|
void LIns::initLInsSti(LOpcode opcode, LIns* val, LIns* base, int32_t d, AccSet accSet) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-09-08 16:18:41 -07:00
|
|
|
lastWord.opcode = opcode;
|
|
|
|
toLInsSti()->oprnd_1 = val;
|
|
|
|
toLInsSti()->oprnd_2 = base;
|
2010-03-04 22:44:28 -08:00
|
|
|
NanoAssert(d == int16_t(d));
|
|
|
|
toLInsSti()->disp = int16_t(d);
|
2010-03-01 17:43:20 -08:00
|
|
|
toLInsSti()->accSet = accSet;
|
2009-09-08 16:18:41 -07:00
|
|
|
NanoAssert(isLInsSti());
|
|
|
|
}
|
|
|
|
void LIns::initLInsSk(LIns* prevLIns) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-09-08 16:18:41 -07:00
|
|
|
lastWord.opcode = LIR_skip;
|
|
|
|
toLInsSk()->prevLIns = prevLIns;
|
|
|
|
NanoAssert(isLInsSk());
|
|
|
|
}
|
2009-11-09 19:12:18 -08:00
|
|
|
void LIns::initLInsC(LOpcode opcode, LIns** args, const CallInfo* ci) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-09-08 16:18:41 -07:00
|
|
|
lastWord.opcode = opcode;
|
2009-11-09 19:12:18 -08:00
|
|
|
toLInsC()->args = args;
|
2009-09-08 16:18:41 -07:00
|
|
|
toLInsC()->ci = ci;
|
|
|
|
NanoAssert(isLInsC());
|
|
|
|
}
|
|
|
|
void LIns::initLInsP(int32_t arg, int32_t kind) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-09-08 16:18:41 -07:00
|
|
|
lastWord.opcode = LIR_param;
|
|
|
|
NanoAssert(isU8(arg) && isU8(kind));
|
|
|
|
toLInsP()->arg = arg;
|
|
|
|
toLInsP()->kind = kind;
|
|
|
|
NanoAssert(isLInsP());
|
|
|
|
}
|
|
|
|
void LIns::initLInsI(LOpcode opcode, int32_t imm32) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-09-08 16:18:41 -07:00
|
|
|
lastWord.opcode = opcode;
|
|
|
|
toLInsI()->imm32 = imm32;
|
|
|
|
NanoAssert(isLInsI());
|
|
|
|
}
|
2009-12-09 15:49:15 -08:00
|
|
|
void LIns::initLInsN64(LOpcode opcode, int64_t imm64) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-09-08 16:18:41 -07:00
|
|
|
lastWord.opcode = opcode;
|
2009-12-09 15:49:15 -08:00
|
|
|
toLInsN64()->imm64_0 = int32_t(imm64);
|
|
|
|
toLInsN64()->imm64_1 = int32_t(imm64 >> 32);
|
|
|
|
NanoAssert(isLInsN64());
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
2009-11-11 11:38:12 -08:00
|
|
|
void LIns::initLInsJtbl(LIns* index, uint32_t size, LIns** table) {
|
2010-01-24 15:39:36 -08:00
|
|
|
clearReg();
|
|
|
|
clearArIndex();
|
2009-11-11 11:38:12 -08:00
|
|
|
lastWord.opcode = LIR_jtbl;
|
|
|
|
toLInsJtbl()->oprnd_1 = index;
|
|
|
|
toLInsJtbl()->table = table;
|
|
|
|
toLInsJtbl()->size = size;
|
|
|
|
NanoAssert(isLInsJtbl());
|
|
|
|
}
|
2009-05-17 23:15:24 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* LIns::oprnd1() const {
|
2009-11-11 11:38:12 -08:00
|
|
|
NanoAssert(isLInsOp1() || isLInsOp2() || isLInsOp3() || isLInsLd() || isLInsSti() || isLInsJtbl());
|
2009-09-08 16:18:41 -07:00
|
|
|
return toLInsOp2()->oprnd_1;
|
|
|
|
}
|
|
|
|
LIns* LIns::oprnd2() const {
|
|
|
|
NanoAssert(isLInsOp2() || isLInsOp3() || isLInsSti());
|
|
|
|
return toLInsOp2()->oprnd_2;
|
|
|
|
}
|
|
|
|
LIns* LIns::oprnd3() const {
|
|
|
|
NanoAssert(isLInsOp3());
|
|
|
|
return toLInsOp3()->oprnd_3;
|
|
|
|
}
|
2009-06-30 21:18:55 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* LIns::getTarget() const {
|
2009-11-11 11:38:12 -08:00
|
|
|
NanoAssert(isBranch() && !isop(LIR_jtbl));
|
2009-09-08 16:18:41 -07:00
|
|
|
return oprnd2();
|
|
|
|
}
|
2008-10-08 15:08:33 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
void LIns::setTarget(LIns* label) {
|
|
|
|
NanoAssert(label && label->isop(LIR_label));
|
2009-11-11 11:38:12 -08:00
|
|
|
NanoAssert(isBranch() && !isop(LIR_jtbl));
|
2009-09-08 16:18:41 -07:00
|
|
|
toLInsOp2()->oprnd_2 = label;
|
|
|
|
}
|
2009-05-09 11:38:34 -07:00
|
|
|
|
2009-11-11 11:38:12 -08:00
|
|
|
LIns* LIns::getTarget(uint32_t index) const {
|
|
|
|
NanoAssert(isop(LIR_jtbl));
|
|
|
|
NanoAssert(index < toLInsJtbl()->size);
|
|
|
|
return toLInsJtbl()->table[index];
|
|
|
|
}
|
|
|
|
|
|
|
|
void LIns::setTarget(uint32_t index, LIns* label) const {
|
|
|
|
NanoAssert(label && label->isop(LIR_label));
|
|
|
|
NanoAssert(isop(LIR_jtbl));
|
|
|
|
NanoAssert(index < toLInsJtbl()->size);
|
|
|
|
toLInsJtbl()->table[index] = label;
|
|
|
|
}
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
GuardRecord *LIns::record() const {
|
|
|
|
NanoAssert(isGuard());
|
2010-02-18 20:04:55 -08:00
|
|
|
switch (opcode()) {
|
|
|
|
case LIR_x:
|
|
|
|
case LIR_xt:
|
|
|
|
case LIR_xf:
|
|
|
|
case LIR_xtbl:
|
|
|
|
case LIR_xbarrier:
|
|
|
|
return (GuardRecord*)oprnd2();
|
|
|
|
|
|
|
|
case LIR_addxov:
|
|
|
|
case LIR_subxov:
|
|
|
|
case LIR_mulxov:
|
|
|
|
return (GuardRecord*)oprnd3();
|
|
|
|
|
|
|
|
default:
|
|
|
|
NanoAssert(0);
|
|
|
|
return NULL;
|
|
|
|
}
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
2009-06-30 21:18:55 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
int32_t LIns::disp() const {
|
|
|
|
if (isLInsSti()) {
|
|
|
|
return toLInsSti()->disp;
|
|
|
|
} else {
|
|
|
|
NanoAssert(isLInsLd());
|
|
|
|
return toLInsLd()->disp;
|
2008-10-13 13:29:18 -07:00
|
|
|
}
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2010-03-05 14:14:31 -08:00
|
|
|
AccSet LIns::accSet() const {
|
2010-03-01 17:43:20 -08:00
|
|
|
if (isLInsSti()) {
|
|
|
|
return toLInsSti()->accSet;
|
|
|
|
} else {
|
|
|
|
NanoAssert(isLInsLd());
|
|
|
|
return toLInsLd()->accSet;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* LIns::prevLIns() const {
|
|
|
|
NanoAssert(isLInsSk());
|
|
|
|
return toLInsSk()->prevLIns;
|
|
|
|
}
|
2009-07-10 12:58:34 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
inline uint8_t LIns::paramArg() const { NanoAssert(isop(LIR_param)); return toLInsP()->arg; }
|
|
|
|
inline uint8_t LIns::paramKind() const { NanoAssert(isop(LIR_param)); return toLInsP()->kind; }
|
2009-07-10 12:58:34 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
inline int32_t LIns::imm32() const { NanoAssert(isconst()); return toLInsI()->imm32; }
|
2009-07-14 02:22:41 -07:00
|
|
|
|
2009-12-09 15:49:15 -08:00
|
|
|
inline int32_t LIns::imm64_0() const { NanoAssert(isconstq()); return toLInsN64()->imm64_0; }
|
|
|
|
inline int32_t LIns::imm64_1() const { NanoAssert(isconstq()); return toLInsN64()->imm64_1; }
|
2009-09-08 16:18:41 -07:00
|
|
|
uint64_t LIns::imm64() const {
|
|
|
|
NanoAssert(isconstq());
|
2009-12-09 15:49:15 -08:00
|
|
|
return (uint64_t(toLInsN64()->imm64_1) << 32) | uint32_t(toLInsN64()->imm64_0);
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
|
|
|
double LIns::imm64f() const {
|
|
|
|
union {
|
|
|
|
double f;
|
|
|
|
uint64_t q;
|
|
|
|
} u;
|
|
|
|
u.q = imm64();
|
|
|
|
return u.f;
|
|
|
|
}
|
2009-08-27 17:52:46 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
int32_t LIns::size() const {
|
|
|
|
NanoAssert(isop(LIR_alloc));
|
|
|
|
return toLInsI()->imm32 << 2;
|
|
|
|
}
|
2009-07-13 11:50:42 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
void LIns::setSize(int32_t nbytes) {
|
|
|
|
NanoAssert(isop(LIR_alloc));
|
|
|
|
NanoAssert(nbytes > 0);
|
|
|
|
toLInsI()->imm32 = (nbytes+3)>>2; // # of required 32bit words
|
|
|
|
}
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2009-11-09 19:12:18 -08:00
|
|
|
// Index args in reverse order, i.e. arg(0) returns the rightmost arg.
|
2009-09-08 16:18:41 -07:00
|
|
|
// Nb: this must be kept in sync with insCall().
|
|
|
|
LIns* LIns::arg(uint32_t i) const
|
|
|
|
{
|
|
|
|
NanoAssert(isCall());
|
2009-11-09 19:12:18 -08:00
|
|
|
NanoAssert(i < callInfo()->count_args());
|
|
|
|
return toLInsC()->args[i]; // args[] is in right-to-left order as well
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
2008-07-16 14:21:31 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
uint32_t LIns::argc() const {
|
2009-11-09 19:12:18 -08:00
|
|
|
return callInfo()->count_args();
|
2009-09-08 16:18:41 -07:00
|
|
|
}
|
2009-06-30 21:18:55 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
LIns* LIns::callArgN(uint32_t n) const
|
|
|
|
{
|
|
|
|
return arg(argc()-n-1);
|
|
|
|
}
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2009-09-08 16:18:41 -07:00
|
|
|
const CallInfo* LIns::callInfo() const
|
|
|
|
{
|
|
|
|
NanoAssert(isCall());
|
|
|
|
return toLInsC()->ci;
|
2009-08-30 00:11:12 -07:00
|
|
|
}
|
|
|
|
|
2009-11-11 11:38:12 -08:00
|
|
|
uint32_t LIns::getTableSize() const
|
|
|
|
{
|
|
|
|
NanoAssert(isLInsJtbl());
|
|
|
|
return toLInsJtbl()->size;
|
|
|
|
}
|
|
|
|
|
2009-09-10 16:29:36 -07:00
|
|
|
class LirWriter
|
2009-07-10 12:58:34 -07:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
LirWriter *out;
|
|
|
|
|
|
|
|
LirWriter(LirWriter* out)
|
|
|
|
: out(out) {}
|
2009-09-10 16:29:36 -07:00
|
|
|
virtual ~LirWriter() {}
|
2009-07-10 12:58:34 -07:00
|
|
|
|
|
|
|
virtual LInsp ins0(LOpcode v) {
|
|
|
|
return out->ins0(v);
|
|
|
|
}
|
|
|
|
virtual LInsp ins1(LOpcode v, LIns* a) {
|
|
|
|
return out->ins1(v, a);
|
|
|
|
}
|
|
|
|
virtual LInsp ins2(LOpcode v, LIns* a, LIns* b) {
|
|
|
|
return out->ins2(v, a, b);
|
|
|
|
}
|
2009-07-21 17:28:25 -07:00
|
|
|
virtual LInsp ins3(LOpcode v, LIns* a, LIns* b, LIns* c) {
|
|
|
|
return out->ins3(v, a, b, c);
|
|
|
|
}
|
2009-09-22 16:06:52 -07:00
|
|
|
virtual LInsp insGuard(LOpcode v, LIns *c, GuardRecord *gr) {
|
|
|
|
return out->insGuard(v, c, gr);
|
2009-07-10 12:58:34 -07:00
|
|
|
}
|
2010-02-18 20:04:55 -08:00
|
|
|
virtual LInsp insGuardXov(LOpcode v, LIns *a, LIns* b, GuardRecord *gr) {
|
|
|
|
return out->insGuardXov(v, a, b, gr);
|
|
|
|
}
|
2009-07-10 12:58:34 -07:00
|
|
|
virtual LInsp insBranch(LOpcode v, LInsp condition, LInsp to) {
|
|
|
|
return out->insBranch(v, condition, to);
|
|
|
|
}
|
2008-10-13 13:29:18 -07:00
|
|
|
// arg: 0=first, 1=second, ...
|
|
|
|
// kind: 0=arg 1=saved-reg
|
2009-07-10 12:58:34 -07:00
|
|
|
virtual LInsp insParam(int32_t arg, int32_t kind) {
|
|
|
|
return out->insParam(arg, kind);
|
|
|
|
}
|
|
|
|
virtual LInsp insImm(int32_t imm) {
|
|
|
|
return out->insImm(imm);
|
|
|
|
}
|
2010-02-11 17:30:16 -08:00
|
|
|
#ifdef NANOJIT_64BIT
|
2009-07-10 12:58:34 -07:00
|
|
|
virtual LInsp insImmq(uint64_t imm) {
|
|
|
|
return out->insImmq(imm);
|
|
|
|
}
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2009-09-01 14:26:24 -07:00
|
|
|
virtual LInsp insImmf(double d) {
|
|
|
|
return out->insImmf(d);
|
|
|
|
}
|
2010-03-01 17:43:20 -08:00
|
|
|
virtual LInsp insLoad(LOpcode op, LIns* base, int32_t d, AccSet accSet) {
|
|
|
|
return out->insLoad(op, base, d, accSet);
|
2009-07-10 12:58:34 -07:00
|
|
|
}
|
2010-03-01 17:43:20 -08:00
|
|
|
virtual LInsp insStore(LOpcode op, LIns* value, LIns* base, int32_t d, AccSet accSet) {
|
|
|
|
return out->insStore(op, value, base, d, accSet);
|
2009-07-10 12:58:34 -07:00
|
|
|
}
|
2009-11-09 19:12:18 -08:00
|
|
|
// args[] is in reverse order, ie. args[0] holds the rightmost arg.
|
2009-07-10 12:58:34 -07:00
|
|
|
virtual LInsp insCall(const CallInfo *call, LInsp args[]) {
|
|
|
|
return out->insCall(call, args);
|
|
|
|
}
|
|
|
|
virtual LInsp insAlloc(int32_t size) {
|
2009-07-21 12:14:33 -07:00
|
|
|
NanoAssert(size != 0);
|
2009-07-10 12:58:34 -07:00
|
|
|
return out->insAlloc(size);
|
|
|
|
}
|
2009-11-11 11:38:12 -08:00
|
|
|
virtual LInsp insJtbl(LIns* index, uint32_t size) {
|
|
|
|
return out->insJtbl(index, size);
|
|
|
|
}
|
2009-07-10 12:58:34 -07:00
|
|
|
|
|
|
|
// convenience functions
|
|
|
|
|
|
|
|
// Inserts a conditional to execute and branches to execute if
|
|
|
|
// the condition is true and false respectively.
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* ins_choose(LIns* cond, LIns* iftrue, LIns* iffalse, bool use_cmov);
|
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
// Inserts an integer comparison to 0
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* ins_eq0(LIns* oprnd1);
|
|
|
|
|
2009-09-09 11:15:48 -07:00
|
|
|
// Inserts a pointer comparison to 0
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* ins_peq0(LIns* oprnd1);
|
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
// Inserts a binary operation where the second operand is an
|
|
|
|
// integer immediate.
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* ins2i(LOpcode op, LIns *oprnd1, int32_t);
|
|
|
|
|
2010-02-11 17:30:16 -08:00
|
|
|
#if NJ_SOFTFLOAT_SUPPORTED
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* qjoin(LInsp lo, LInsp hi);
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* insImmPtr(const void *ptr);
|
|
|
|
LIns* insImmWord(intptr_t ptr);
|
|
|
|
|
2009-09-09 11:15:48 -07:00
|
|
|
// Sign or zero extend integers to native integers. On 32-bit this is a no-op.
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* ins_i2p(LIns* intIns);
|
|
|
|
LIns* ins_u2p(LIns* uintIns);
|
|
|
|
|
|
|
|
// Chooses LIR_sti or LIR_stqi based on size of value.
|
|
|
|
LIns* insStorei(LIns* value, LIns* base, int32_t d, AccSet accSet);
|
|
|
|
|
|
|
|
// Insert a load/store with the most pessimistic region access info, which is always safe.
|
|
|
|
LIns* insLoad(LOpcode op, LIns* base, int32_t d) {
|
|
|
|
return insLoad(op, base, d, ACC_LOAD_ANY);
|
|
|
|
}
|
|
|
|
LIns* insStore(LOpcode op, LIns* value, LIns* base, int32_t d) {
|
|
|
|
return insStore(op, value, base, d, ACC_STORE_ANY);
|
|
|
|
}
|
|
|
|
LIns* insStorei(LIns* value, LIns* base, int32_t d) {
|
|
|
|
return insStorei(value, base, d, ACC_STORE_ANY);
|
|
|
|
}
|
2009-07-10 12:58:34 -07:00
|
|
|
};
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2009-05-21 18:44:37 -07:00
|
|
|
|
2008-06-18 21:11:15 -07:00
|
|
|
#ifdef NJ_VERBOSE
|
2009-07-10 12:58:34 -07:00
|
|
|
extern const char* lirNames[];
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
/**
|
|
|
|
* map address ranges to meaningful names.
|
|
|
|
*/
|
2009-08-04 10:56:48 -07:00
|
|
|
class LabelMap
|
2008-06-18 21:11:15 -07:00
|
|
|
{
|
2009-07-15 16:50:01 -07:00
|
|
|
Allocator& allocator;
|
2009-07-15 09:34:17 -07:00
|
|
|
class Entry
|
2009-07-10 12:58:34 -07:00
|
|
|
{
|
|
|
|
public:
|
2009-09-29 16:36:37 -07:00
|
|
|
Entry(int) : name(0), size(0), align(0) {}
|
2009-07-15 09:34:17 -07:00
|
|
|
Entry(char *n, size_t s, size_t a) : name(n),size(s),align(a) {}
|
|
|
|
char* name;
|
2009-07-10 12:58:34 -07:00
|
|
|
size_t size:29, align:3;
|
|
|
|
};
|
2009-08-04 10:56:48 -07:00
|
|
|
TreeMap<const void*, Entry*> names;
|
|
|
|
LogControl *logc;
|
2009-11-11 11:38:12 -08:00
|
|
|
char buf[5000], *end;
|
2008-06-18 21:11:15 -07:00
|
|
|
void formatAddr(const void *p, char *buf);
|
|
|
|
public:
|
2009-08-04 10:56:48 -07:00
|
|
|
LabelMap(Allocator& allocator, LogControl* logc);
|
2008-06-18 21:11:15 -07:00
|
|
|
void add(const void *p, size_t size, size_t align, const char *name);
|
2009-07-10 12:58:34 -07:00
|
|
|
const char *dup(const char *);
|
|
|
|
const char *format(const void *p);
|
2008-06-18 21:11:15 -07:00
|
|
|
};
|
|
|
|
|
2009-08-04 11:18:38 -07:00
|
|
|
class LirNameMap
|
2009-07-10 12:58:34 -07:00
|
|
|
{
|
2009-08-04 08:33:14 -07:00
|
|
|
Allocator& alloc;
|
2009-07-15 16:50:01 -07:00
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
template <class Key>
|
2009-08-04 11:18:38 -07:00
|
|
|
class CountMap: public HashMap<Key, int> {
|
2009-07-10 12:58:34 -07:00
|
|
|
public:
|
2009-08-04 11:18:38 -07:00
|
|
|
CountMap(Allocator& alloc) : HashMap<Key, int>(alloc) {}
|
2009-07-10 12:58:34 -07:00
|
|
|
int add(Key k) {
|
|
|
|
int c = 1;
|
|
|
|
if (containsKey(k)) {
|
|
|
|
c = 1+get(k);
|
|
|
|
}
|
|
|
|
put(k,c);
|
|
|
|
return c;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
CountMap<int> lircounts;
|
|
|
|
CountMap<const CallInfo *> funccounts;
|
|
|
|
|
2009-07-15 09:34:17 -07:00
|
|
|
class Entry
|
2009-07-10 12:58:34 -07:00
|
|
|
{
|
|
|
|
public:
|
2009-09-29 16:36:37 -07:00
|
|
|
Entry(int) : name(0) {}
|
2009-07-15 09:34:17 -07:00
|
|
|
Entry(char* n) : name(n) {}
|
|
|
|
char* name;
|
2009-07-10 12:58:34 -07:00
|
|
|
};
|
2009-08-04 11:18:38 -07:00
|
|
|
HashMap<LInsp, Entry*> names;
|
2009-07-10 12:58:34 -07:00
|
|
|
void formatImm(int32_t c, char *buf);
|
2009-12-16 18:50:07 -08:00
|
|
|
void formatImmq(uint64_t c, char *buf);
|
2009-07-10 12:58:34 -07:00
|
|
|
|
2009-12-04 11:58:42 -08:00
|
|
|
public:
|
|
|
|
LabelMap *labels;
|
2009-08-04 11:18:38 -07:00
|
|
|
LirNameMap(Allocator& alloc, LabelMap *lm)
|
2009-08-04 08:33:14 -07:00
|
|
|
: alloc(alloc),
|
2009-08-04 11:18:38 -07:00
|
|
|
lircounts(alloc),
|
|
|
|
funccounts(alloc),
|
|
|
|
names(alloc),
|
|
|
|
labels(lm)
|
2009-07-10 12:58:34 -07:00
|
|
|
{}
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
void addName(LInsp i, const char *s);
|
|
|
|
void copyName(LInsp i, const char *s, int suffix);
|
2010-03-01 17:43:20 -08:00
|
|
|
char* formatAccSet(LInsp ins, bool isLoad, char* buf);
|
2008-06-18 21:11:15 -07:00
|
|
|
const char *formatRef(LIns *ref);
|
2009-07-10 12:58:34 -07:00
|
|
|
const char *formatIns(LInsp i);
|
|
|
|
void formatGuard(LInsp i, char *buf);
|
2010-02-18 20:04:55 -08:00
|
|
|
void formatGuardXov(LInsp i, char *buf);
|
2009-07-10 12:58:34 -07:00
|
|
|
};
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2008-07-08 17:09:53 -07:00
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
class VerboseWriter : public LirWriter
|
|
|
|
{
|
|
|
|
InsList code;
|
2009-08-04 11:18:38 -07:00
|
|
|
LirNameMap* names;
|
2009-07-10 12:58:34 -07:00
|
|
|
LogControl* logc;
|
2010-01-07 16:41:42 -08:00
|
|
|
const char* const prefix;
|
|
|
|
bool const always_flush;
|
2008-06-30 15:33:41 -07:00
|
|
|
public:
|
2009-08-04 10:11:53 -07:00
|
|
|
VerboseWriter(Allocator& alloc, LirWriter *out,
|
2010-01-07 16:41:42 -08:00
|
|
|
LirNameMap* names, LogControl* logc, const char* prefix = "", bool always_flush = false)
|
|
|
|
: LirWriter(out), code(alloc), names(names), logc(logc), prefix(prefix), always_flush(always_flush)
|
2009-07-10 12:58:34 -07:00
|
|
|
{}
|
2008-06-30 15:33:41 -07:00
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
LInsp add(LInsp i) {
|
2010-01-07 16:41:42 -08:00
|
|
|
if (i) {
|
2008-12-10 17:25:46 -08:00
|
|
|
code.add(i);
|
2010-01-07 16:41:42 -08:00
|
|
|
if (always_flush)
|
|
|
|
flush();
|
|
|
|
}
|
2009-07-10 12:58:34 -07:00
|
|
|
return i;
|
|
|
|
}
|
2008-06-30 15:33:41 -07:00
|
|
|
|
2008-10-13 13:29:18 -07:00
|
|
|
LInsp add_flush(LInsp i) {
|
2009-07-10 12:58:34 -07:00
|
|
|
if ((i = add(i)) != 0)
|
2008-10-13 13:29:18 -07:00
|
|
|
flush();
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
void flush()
|
|
|
|
{
|
2009-08-04 10:11:53 -07:00
|
|
|
if (!code.isEmpty()) {
|
|
|
|
int32_t count = 0;
|
|
|
|
for (Seq<LIns*>* p = code.get(); p != NULL; p = p->tail) {
|
2010-01-07 16:41:42 -08:00
|
|
|
logc->printf("%s %s\n",prefix,names->formatIns(p->head));
|
2009-08-04 10:11:53 -07:00
|
|
|
count++;
|
|
|
|
}
|
2009-07-10 12:58:34 -07:00
|
|
|
code.clear();
|
2009-08-04 10:11:53 -07:00
|
|
|
if (count > 1)
|
2009-07-10 12:58:34 -07:00
|
|
|
logc->printf("\n");
|
2008-10-13 13:29:18 -07:00
|
|
|
}
|
2009-07-10 12:58:34 -07:00
|
|
|
}
|
2008-06-30 15:33:41 -07:00
|
|
|
|
2009-09-22 16:06:52 -07:00
|
|
|
LIns* insGuard(LOpcode op, LInsp cond, GuardRecord *gr) {
|
|
|
|
return add_flush(out->insGuard(op,cond,gr));
|
2009-07-10 12:58:34 -07:00
|
|
|
}
|
2008-10-13 13:29:18 -07:00
|
|
|
|
2010-02-18 20:04:55 -08:00
|
|
|
LIns* insGuardXov(LOpcode op, LInsp a, LInsp b, GuardRecord *gr) {
|
|
|
|
return add_flush(out->insGuardXov(op,a,b,gr));
|
|
|
|
}
|
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
LIns* insBranch(LOpcode v, LInsp condition, LInsp to) {
|
|
|
|
return add_flush(out->insBranch(v, condition, to));
|
|
|
|
}
|
2008-06-30 15:33:41 -07:00
|
|
|
|
2009-11-11 11:38:12 -08:00
|
|
|
LIns* insJtbl(LIns* index, uint32_t size) {
|
|
|
|
return add_flush(out->insJtbl(index, size));
|
|
|
|
}
|
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
LIns* ins0(LOpcode v) {
|
2008-10-13 13:29:18 -07:00
|
|
|
if (v == LIR_label || v == LIR_start) {
|
|
|
|
flush();
|
|
|
|
}
|
2009-07-10 12:58:34 -07:00
|
|
|
return add(out->ins0(v));
|
|
|
|
}
|
2008-06-30 15:33:41 -07:00
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
LIns* ins1(LOpcode v, LInsp a) {
|
2009-05-17 22:38:00 -07:00
|
|
|
return isRetOpcode(v) ? add_flush(out->ins1(v, a)) : add(out->ins1(v, a));
|
2009-07-10 12:58:34 -07:00
|
|
|
}
|
|
|
|
LIns* ins2(LOpcode v, LInsp a, LInsp b) {
|
2009-07-21 17:28:25 -07:00
|
|
|
return add(out->ins2(v, a, b));
|
|
|
|
}
|
|
|
|
LIns* ins3(LOpcode v, LInsp a, LInsp b, LInsp c) {
|
|
|
|
return add(out->ins3(v, a, b, c));
|
2009-07-10 12:58:34 -07:00
|
|
|
}
|
|
|
|
LIns* insCall(const CallInfo *call, LInsp args[]) {
|
|
|
|
return add_flush(out->insCall(call, args));
|
|
|
|
}
|
|
|
|
LIns* insParam(int32_t i, int32_t kind) {
|
|
|
|
return add(out->insParam(i, kind));
|
|
|
|
}
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* insLoad(LOpcode v, LInsp base, int32_t disp, AccSet accSet) {
|
|
|
|
return add(out->insLoad(v, base, disp, accSet));
|
2009-07-10 12:58:34 -07:00
|
|
|
}
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* insStore(LOpcode op, LInsp v, LInsp b, int32_t d, AccSet accSet) {
|
|
|
|
return add(out->insStore(op, v, b, d, accSet));
|
2009-07-10 12:58:34 -07:00
|
|
|
}
|
2008-10-13 13:29:18 -07:00
|
|
|
LIns* insAlloc(int32_t size) {
|
|
|
|
return add(out->insAlloc(size));
|
|
|
|
}
|
2008-11-17 00:05:29 -08:00
|
|
|
LIns* insImm(int32_t imm) {
|
|
|
|
return add(out->insImm(imm));
|
|
|
|
}
|
2010-02-11 17:30:16 -08:00
|
|
|
#ifdef NANOJIT_64BIT
|
2008-11-17 00:05:29 -08:00
|
|
|
LIns* insImmq(uint64_t imm) {
|
|
|
|
return add(out->insImmq(imm));
|
|
|
|
}
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2009-09-01 14:26:24 -07:00
|
|
|
LIns* insImmf(double d) {
|
|
|
|
return add(out->insImmf(d));
|
|
|
|
}
|
2008-06-30 15:33:41 -07:00
|
|
|
};
|
|
|
|
|
2008-06-18 21:11:15 -07:00
|
|
|
#endif
|
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
class ExprFilter: public LirWriter
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
ExprFilter(LirWriter *out) : LirWriter(out) {}
|
|
|
|
LIns* ins1(LOpcode v, LIns* a);
|
|
|
|
LIns* ins2(LOpcode v, LIns* a, LIns* b);
|
2009-07-21 17:28:25 -07:00
|
|
|
LIns* ins3(LOpcode v, LIns* a, LIns* b, LIns* c);
|
2009-09-22 16:06:52 -07:00
|
|
|
LIns* insGuard(LOpcode, LIns *cond, GuardRecord *);
|
2010-02-18 20:04:55 -08:00
|
|
|
LIns* insGuardXov(LOpcode, LIns* a, LIns* b, GuardRecord *);
|
2008-10-13 13:29:18 -07:00
|
|
|
LIns* insBranch(LOpcode, LIns *cond, LIns *target);
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* insLoad(LOpcode op, LInsp base, int32_t off, AccSet accSet);
|
2009-07-10 12:58:34 -07:00
|
|
|
};
|
|
|
|
|
2009-11-04 14:40:33 -08:00
|
|
|
enum LInsHashKind {
|
|
|
|
// We divide instruction kinds into groups for the use of LInsHashSet.
|
|
|
|
// LIns0 isn't present because we don't need to record any 0-ary
|
|
|
|
// instructions.
|
|
|
|
LInsImm = 0,
|
2010-02-11 17:30:16 -08:00
|
|
|
LInsImmq = 1, // only occurs on 64-bit platforms
|
2009-11-04 14:40:33 -08:00
|
|
|
LInsImmf = 2,
|
|
|
|
LIns1 = 3,
|
|
|
|
LIns2 = 4,
|
|
|
|
LIns3 = 5,
|
|
|
|
LInsLoad = 6,
|
|
|
|
LInsCall = 7,
|
|
|
|
|
|
|
|
LInsFirst = 0,
|
2009-12-22 16:09:19 -08:00
|
|
|
LInsLast = 7,
|
|
|
|
// need a value after "last" to outsmart compilers that will insist last+1 is impossible
|
|
|
|
LInsInvalid = 8
|
2009-11-04 14:40:33 -08:00
|
|
|
};
|
|
|
|
#define nextKind(kind) LInsHashKind(kind+1)
|
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
// @todo, this could be replaced by a generic HashMap or HashSet, if we had one
|
|
|
|
class LInsHashSet
|
|
|
|
{
|
2009-11-04 14:40:33 -08:00
|
|
|
// Must be a power of 2.
|
|
|
|
// Don't start too small, or we'll waste time growing and rehashing.
|
|
|
|
// Don't start too large, will waste memory.
|
|
|
|
static const uint32_t kInitialCap[LInsLast + 1];
|
|
|
|
|
|
|
|
// There is one list for each instruction kind. This lets us size the
|
|
|
|
// lists appropriately (some instructions are more common than others).
|
|
|
|
// It also lets us have kind-specific find/add/grow functions, which
|
|
|
|
// are faster than generic versions.
|
|
|
|
LInsp *m_list[LInsLast + 1];
|
|
|
|
uint32_t m_cap[LInsLast + 1];
|
|
|
|
uint32_t m_used[LInsLast + 1];
|
|
|
|
typedef uint32_t (LInsHashSet::*find_t)(LInsp);
|
|
|
|
find_t m_find[LInsLast + 1];
|
2009-08-06 06:41:07 -07:00
|
|
|
Allocator& alloc;
|
2009-07-10 12:58:34 -07:00
|
|
|
|
2009-11-04 14:40:33 -08:00
|
|
|
static uint32_t hashImm(int32_t);
|
2010-02-11 17:30:16 -08:00
|
|
|
static uint32_t hashImmq(uint64_t); // not NANOJIT_64BIT only used by findImmf()
|
2009-08-30 00:11:12 -07:00
|
|
|
static uint32_t hash1(LOpcode v, LInsp);
|
|
|
|
static uint32_t hash2(LOpcode v, LInsp, LInsp);
|
|
|
|
static uint32_t hash3(LOpcode v, LInsp, LInsp, LInsp);
|
|
|
|
static uint32_t hashLoad(LOpcode v, LInsp, int32_t);
|
2009-11-04 14:40:33 -08:00
|
|
|
static uint32_t hashCall(const CallInfo *call, uint32_t argc, LInsp args[]);
|
|
|
|
|
|
|
|
// These private versions are used after an LIns has been created;
|
|
|
|
// they are used for rehashing after growing.
|
|
|
|
uint32_t findImm(LInsp ins);
|
2010-02-11 17:30:16 -08:00
|
|
|
#ifdef NANOJIT_64BIT
|
2009-11-04 14:40:33 -08:00
|
|
|
uint32_t findImmq(LInsp ins);
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2009-11-04 14:40:33 -08:00
|
|
|
uint32_t findImmf(LInsp ins);
|
|
|
|
uint32_t find1(LInsp ins);
|
|
|
|
uint32_t find2(LInsp ins);
|
|
|
|
uint32_t find3(LInsp ins);
|
|
|
|
uint32_t findLoad(LInsp ins);
|
|
|
|
uint32_t findCall(LInsp ins);
|
|
|
|
|
|
|
|
void grow(LInsHashKind kind);
|
|
|
|
|
|
|
|
public:
|
|
|
|
// kInitialCaps[i] holds the initial size for m_list[i].
|
|
|
|
LInsHashSet(Allocator&, uint32_t kInitialCaps[]);
|
|
|
|
|
|
|
|
// These public versions are used before an LIns has been created.
|
|
|
|
LInsp findImm(int32_t a, uint32_t &k);
|
2010-02-11 17:30:16 -08:00
|
|
|
#ifdef NANOJIT_64BIT
|
2009-11-04 14:40:33 -08:00
|
|
|
LInsp findImmq(uint64_t a, uint32_t &k);
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2009-12-20 17:41:22 -08:00
|
|
|
LInsp findImmf(uint64_t d, uint32_t &k);
|
2009-11-04 14:40:33 -08:00
|
|
|
LInsp find1(LOpcode v, LInsp a, uint32_t &k);
|
|
|
|
LInsp find2(LOpcode v, LInsp a, LInsp b, uint32_t &k);
|
|
|
|
LInsp find3(LOpcode v, LInsp a, LInsp b, LInsp c, uint32_t &k);
|
|
|
|
LInsp findLoad(LOpcode v, LInsp a, int32_t b, uint32_t &k);
|
|
|
|
LInsp findCall(const CallInfo *call, uint32_t argc, LInsp args[], uint32_t &k);
|
|
|
|
|
|
|
|
// 'k' is the index found by findXYZ().
|
|
|
|
LInsp add(LInsHashKind kind, LInsp ins, uint32_t k);
|
|
|
|
|
|
|
|
void clear();
|
2009-07-10 12:58:34 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
class CseFilter: public LirWriter
|
|
|
|
{
|
2009-11-04 14:40:33 -08:00
|
|
|
private:
|
|
|
|
LInsHashSet* exprs;
|
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
public:
|
2009-08-06 06:41:07 -07:00
|
|
|
CseFilter(LirWriter *out, Allocator&);
|
2009-11-04 14:40:33 -08:00
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
LIns* insImm(int32_t imm);
|
2010-02-11 17:30:16 -08:00
|
|
|
#ifdef NANOJIT_64BIT
|
2009-07-10 12:58:34 -07:00
|
|
|
LIns* insImmq(uint64_t q);
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2009-09-01 14:26:24 -07:00
|
|
|
LIns* insImmf(double d);
|
2009-07-10 12:58:34 -07:00
|
|
|
LIns* ins0(LOpcode v);
|
|
|
|
LIns* ins1(LOpcode v, LInsp);
|
|
|
|
LIns* ins2(LOpcode v, LInsp, LInsp);
|
2009-07-21 17:28:25 -07:00
|
|
|
LIns* ins3(LOpcode v, LInsp, LInsp, LInsp);
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* insLoad(LOpcode op, LInsp cond, int32_t d, AccSet accSet);
|
2009-07-10 12:58:34 -07:00
|
|
|
LIns* insCall(const CallInfo *call, LInsp args[]);
|
2009-09-22 16:06:52 -07:00
|
|
|
LIns* insGuard(LOpcode op, LInsp cond, GuardRecord *gr);
|
2010-02-18 20:04:55 -08:00
|
|
|
LIns* insGuardXov(LOpcode op, LInsp a, LInsp b, GuardRecord *gr);
|
2009-07-10 12:58:34 -07:00
|
|
|
};
|
|
|
|
|
2009-08-04 12:03:34 -07:00
|
|
|
class LirBuffer
|
2009-07-10 12:58:34 -07:00
|
|
|
{
|
|
|
|
public:
|
2009-08-06 06:41:07 -07:00
|
|
|
LirBuffer(Allocator& alloc);
|
2009-07-10 12:58:34 -07:00
|
|
|
void clear();
|
2009-06-16 14:01:31 -07:00
|
|
|
uintptr_t makeRoom(size_t szB); // make room for an instruction
|
2009-07-10 12:58:34 -07:00
|
|
|
|
|
|
|
debug_only (void validate() const;)
|
2009-08-04 11:18:38 -07:00
|
|
|
verbose_only(LirNameMap* names;)
|
2009-07-10 12:58:34 -07:00
|
|
|
|
2009-06-16 14:01:31 -07:00
|
|
|
int32_t insCount();
|
|
|
|
size_t byteCount();
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
// stats
|
|
|
|
struct
|
|
|
|
{
|
|
|
|
uint32_t lir; // # instructions
|
|
|
|
}
|
|
|
|
_stats;
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2008-10-13 13:29:18 -07:00
|
|
|
AbiKind abi;
|
2008-07-16 14:21:31 -07:00
|
|
|
LInsp state,param1,sp,rp;
|
2008-10-31 16:48:14 -07:00
|
|
|
LInsp savedRegs[NumSavedRegs];
|
2008-10-13 13:29:18 -07:00
|
|
|
|
2009-09-29 16:36:37 -07:00
|
|
|
protected:
|
|
|
|
friend class LirBufWriter;
|
|
|
|
|
2009-11-12 21:18:40 -08:00
|
|
|
/** Each chunk is just a raw area of LIns instances, with no header
|
|
|
|
and no more than 8-byte alignment. The chunk size is somewhat arbitrary. */
|
2009-07-15 16:50:01 -07:00
|
|
|
static const size_t CHUNK_SZB = 8000;
|
|
|
|
|
2009-11-12 21:18:40 -08:00
|
|
|
/** Get CHUNK_SZB more memory for LIR instructions. */
|
2009-07-15 16:50:01 -07:00
|
|
|
void chunkAlloc();
|
|
|
|
void moveToNewChunk(uintptr_t addrOfLastLInsOnCurrentChunk);
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2009-07-15 16:50:01 -07:00
|
|
|
Allocator& _allocator;
|
|
|
|
uintptr_t _unused; // next unused instruction slot in the current LIR chunk
|
|
|
|
uintptr_t _limit; // one past the last usable byte of the current LIR chunk
|
|
|
|
size_t _bytesAllocated;
|
2009-07-10 12:58:34 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
class LirBufWriter : public LirWriter
|
|
|
|
{
|
2010-01-26 10:37:38 -08:00
|
|
|
LirBuffer* _buf; // underlying buffer housing the instructions
|
2010-02-15 17:56:41 -08:00
|
|
|
const Config& _config;
|
2009-07-10 12:58:34 -07:00
|
|
|
|
|
|
|
public:
|
2010-02-15 17:56:41 -08:00
|
|
|
LirBufWriter(LirBuffer* buf, const Config& config)
|
2010-01-26 10:37:38 -08:00
|
|
|
: LirWriter(0), _buf(buf), _config(config) {
|
2009-07-10 12:58:34 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
// LirWriter interface
|
2010-03-01 17:43:20 -08:00
|
|
|
LInsp insLoad(LOpcode op, LInsp base, int32_t disp, AccSet accSet);
|
|
|
|
LInsp insStore(LOpcode op, LInsp o1, LInsp o2, int32_t disp, AccSet accSet);
|
2009-11-12 21:18:40 -08:00
|
|
|
LInsp ins0(LOpcode op);
|
|
|
|
LInsp ins1(LOpcode op, LInsp o1);
|
|
|
|
LInsp ins2(LOpcode op, LInsp o1, LInsp o2);
|
|
|
|
LInsp ins3(LOpcode op, LInsp o1, LInsp o2, LInsp o3);
|
|
|
|
LInsp insParam(int32_t i, int32_t kind);
|
|
|
|
LInsp insImm(int32_t imm);
|
2010-02-11 17:30:16 -08:00
|
|
|
#ifdef NANOJIT_64BIT
|
2009-11-12 21:18:40 -08:00
|
|
|
LInsp insImmq(uint64_t imm);
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2009-11-12 21:18:40 -08:00
|
|
|
LInsp insImmf(double d);
|
|
|
|
LInsp insCall(const CallInfo *call, LInsp args[]);
|
|
|
|
LInsp insGuard(LOpcode op, LInsp cond, GuardRecord *gr);
|
2010-02-18 20:04:55 -08:00
|
|
|
LInsp insGuardXov(LOpcode op, LInsp a, LInsp b, GuardRecord *gr);
|
2009-11-12 21:18:40 -08:00
|
|
|
LInsp insBranch(LOpcode v, LInsp condition, LInsp to);
|
|
|
|
LInsp insAlloc(int32_t size);
|
|
|
|
LInsp insJtbl(LIns* index, uint32_t size);
|
2009-07-10 12:58:34 -07:00
|
|
|
};
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
class LirFilter
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
LirFilter *in;
|
|
|
|
LirFilter(LirFilter *in) : in(in) {}
|
2008-12-10 17:25:46 -08:00
|
|
|
virtual ~LirFilter(){}
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
virtual LInsp read() {
|
|
|
|
return in->read();
|
|
|
|
}
|
|
|
|
virtual LInsp pos() {
|
|
|
|
return in->pos();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// concrete
|
|
|
|
class LirReader : public LirFilter
|
|
|
|
{
|
2009-11-12 14:26:26 -08:00
|
|
|
LInsp _i; // next instruction to be read; invariant: is never a skip
|
2009-07-10 12:58:34 -07:00
|
|
|
|
|
|
|
public:
|
2009-11-12 14:26:26 -08:00
|
|
|
LirReader(LInsp i) : LirFilter(0), _i(i)
|
|
|
|
{
|
|
|
|
// The last instruction for a fragment shouldn't be a skip.
|
|
|
|
// (Actually, if the last *inserted* instruction exactly fills up
|
|
|
|
// a chunk, a new chunk will be created, and thus the last *written*
|
|
|
|
// instruction will be a skip -- the one needed for the
|
|
|
|
// cross-chunk link. But the last *inserted* instruction is what
|
|
|
|
// is recorded and used to initialise each LirReader, and that is
|
|
|
|
// what is seen here, and therefore this assertion holds.)
|
|
|
|
NanoAssert(i && !i->isop(LIR_skip));
|
2009-08-06 06:41:07 -07:00
|
|
|
}
|
2009-07-10 12:58:34 -07:00
|
|
|
virtual ~LirReader() {}
|
|
|
|
|
2009-11-12 14:26:26 -08:00
|
|
|
// Returns next instruction and advances to the prior instruction.
|
|
|
|
// Invariant: never returns a skip.
|
2009-12-21 12:05:48 -08:00
|
|
|
LInsp read();
|
2009-11-12 14:26:26 -08:00
|
|
|
|
|
|
|
// Returns next instruction. Invariant: never returns a skip.
|
2009-07-10 12:58:34 -07:00
|
|
|
LInsp pos() {
|
|
|
|
return _i;
|
|
|
|
}
|
|
|
|
};
|
2008-06-18 21:11:15 -07:00
|
|
|
|
2010-01-14 15:05:44 -08:00
|
|
|
verbose_only(void live(LirFilter* in, Allocator& alloc, Fragment* frag, LogControl*);)
|
2009-07-10 12:58:34 -07:00
|
|
|
|
2010-03-11 14:59:45 -08:00
|
|
|
// WARNING: StackFilter assumes that all stack entries are eight bytes.
|
|
|
|
// Some of its optimisations aren't valid if that isn't true. See
|
|
|
|
// StackFilter::read() for more details.
|
2009-07-10 12:58:34 -07:00
|
|
|
class StackFilter: public LirFilter
|
|
|
|
{
|
|
|
|
LInsp sp;
|
2010-03-11 14:59:45 -08:00
|
|
|
BitSet stk;
|
|
|
|
int top;
|
|
|
|
int getTop(LInsp br);
|
2009-09-08 18:48:30 -07:00
|
|
|
|
2009-07-10 12:58:34 -07:00
|
|
|
public:
|
2010-03-11 14:59:45 -08:00
|
|
|
StackFilter(LirFilter *in, Allocator& alloc, LInsp sp);
|
2009-07-10 12:58:34 -07:00
|
|
|
LInsp read();
|
|
|
|
};
|
|
|
|
|
2008-10-13 13:29:18 -07:00
|
|
|
// eliminate redundant loads by watching for stores & mutator calls
|
|
|
|
class LoadFilter: public LirWriter
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
LInsp sp, rp;
|
2009-11-04 14:40:33 -08:00
|
|
|
LInsHashSet* exprs;
|
2009-08-04 08:33:14 -07:00
|
|
|
|
2008-10-13 13:29:18 -07:00
|
|
|
void clear(LInsp p);
|
2009-11-04 14:40:33 -08:00
|
|
|
|
2008-10-13 13:29:18 -07:00
|
|
|
public:
|
2009-08-06 06:41:07 -07:00
|
|
|
LoadFilter(LirWriter *out, Allocator& alloc)
|
2009-11-04 14:40:33 -08:00
|
|
|
: LirWriter(out), sp(NULL), rp(NULL)
|
2009-12-21 12:05:48 -08:00
|
|
|
{
|
2009-11-04 14:40:33 -08:00
|
|
|
uint32_t kInitialCaps[LInsLast + 1];
|
|
|
|
kInitialCaps[LInsImm] = 1;
|
|
|
|
kInitialCaps[LInsImmq] = 1;
|
|
|
|
kInitialCaps[LInsImmf] = 1;
|
|
|
|
kInitialCaps[LIns1] = 1;
|
|
|
|
kInitialCaps[LIns2] = 1;
|
|
|
|
kInitialCaps[LIns3] = 1;
|
|
|
|
kInitialCaps[LInsLoad] = 64;
|
|
|
|
kInitialCaps[LInsCall] = 1;
|
|
|
|
exprs = new (alloc) LInsHashSet(alloc, kInitialCaps);
|
|
|
|
}
|
2008-10-13 13:29:18 -07:00
|
|
|
|
|
|
|
LInsp ins0(LOpcode);
|
2010-03-01 17:43:20 -08:00
|
|
|
LInsp insLoad(LOpcode op, LInsp base, int32_t disp, AccSet accSet);
|
|
|
|
LInsp insStore(LOpcode op, LInsp value, LInsp base, int32_t disp, AccSet accSet);
|
2008-10-13 13:29:18 -07:00
|
|
|
LInsp insCall(const CallInfo *call, LInsp args[]);
|
2009-07-10 12:58:34 -07:00
|
|
|
};
|
2009-09-04 17:56:22 -07:00
|
|
|
|
2010-02-07 13:35:35 -08:00
|
|
|
struct SoftFloatOps
|
|
|
|
{
|
|
|
|
const CallInfo* opmap[LIR_sentinel];
|
|
|
|
SoftFloatOps();
|
|
|
|
};
|
|
|
|
|
|
|
|
extern const SoftFloatOps softFloatOps;
|
|
|
|
|
|
|
|
// Replaces fpu ops with function calls, for platforms lacking float
|
|
|
|
// hardware (eg. some ARM machines).
|
|
|
|
class SoftFloatFilter: public LirWriter
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
static const CallInfo* opmap[LIR_sentinel];
|
|
|
|
|
|
|
|
SoftFloatFilter(LirWriter *out);
|
|
|
|
LIns *split(LIns *a);
|
|
|
|
LIns *split(const CallInfo *call, LInsp args[]);
|
|
|
|
LIns *fcall1(const CallInfo *call, LIns *a);
|
|
|
|
LIns *fcall2(const CallInfo *call, LIns *a, LIns *b);
|
|
|
|
LIns *fcmp(const CallInfo *call, LIns *a, LIns *b);
|
|
|
|
LIns *ins1(LOpcode op, LIns *a);
|
|
|
|
LIns *ins2(LOpcode op, LIns *a, LIns *b);
|
|
|
|
LIns *insCall(const CallInfo *ci, LInsp args[]);
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2009-09-04 17:56:22 -07:00
|
|
|
#ifdef DEBUG
|
2010-01-21 15:10:59 -08:00
|
|
|
// This class does thorough checking of LIR. It checks *implicit* LIR
|
|
|
|
// instructions, ie. LIR instructions specified via arguments -- to
|
|
|
|
// methods like insLoad() -- that have not yet been converted into
|
|
|
|
// *explicit* LIns objects in a LirBuffer. The reason for this is that if
|
|
|
|
// we wait until the LIR instructions are explicit, they will have gone
|
|
|
|
// through the entire writer pipeline and been optimised. By checking
|
|
|
|
// implicit LIR instructions we can check the LIR code at the start of the
|
|
|
|
// writer pipeline, exactly as it is generated by the compiler front-end.
|
|
|
|
//
|
|
|
|
// A general note about the errors produced by this class: for
|
|
|
|
// TraceMonkey, they won't include special names for instructions that
|
|
|
|
// have them unless TMFLAGS is specified.
|
|
|
|
class ValidateWriter : public LirWriter
|
2009-09-04 17:56:22 -07:00
|
|
|
{
|
2010-01-21 15:10:59 -08:00
|
|
|
private:
|
|
|
|
const char* _whereInPipeline;
|
|
|
|
|
|
|
|
const char* type2string(LTy type);
|
|
|
|
void typeCheckArgs(LOpcode op, int nArgs, LTy formals[], LIns* args[]);
|
|
|
|
void errorStructureShouldBe(LOpcode op, const char* argDesc, int argN, LIns* arg,
|
|
|
|
const char* shouldBeDesc);
|
2010-03-01 17:43:20 -08:00
|
|
|
void errorAccSetShould(const char* what, AccSet accSet, const char* shouldDesc);
|
2010-01-21 15:10:59 -08:00
|
|
|
void checkLInsHasOpcode(LOpcode op, int argN, LIns* ins, LOpcode op2);
|
|
|
|
void checkLInsIsACondOrConst(LOpcode op, int argN, LIns* ins);
|
|
|
|
void checkLInsIsNull(LOpcode op, int argN, LIns* ins);
|
|
|
|
|
2009-09-04 17:56:22 -07:00
|
|
|
public:
|
2010-01-21 15:10:59 -08:00
|
|
|
ValidateWriter(LirWriter* out, const char* stageName);
|
2010-03-01 17:43:20 -08:00
|
|
|
LIns* insLoad(LOpcode op, LIns* base, int32_t d, AccSet accSet);
|
|
|
|
LIns* insStore(LOpcode op, LIns* value, LIns* base, int32_t d, AccSet accSet);
|
2010-01-21 15:10:59 -08:00
|
|
|
LIns* ins0(LOpcode v);
|
|
|
|
LIns* ins1(LOpcode v, LIns* a);
|
|
|
|
LIns* ins2(LOpcode v, LIns* a, LIns* b);
|
|
|
|
LIns* ins3(LOpcode v, LIns* a, LIns* b, LIns* c);
|
|
|
|
LIns* insParam(int32_t arg, int32_t kind);
|
|
|
|
LIns* insImm(int32_t imm);
|
2010-02-11 17:30:16 -08:00
|
|
|
#ifdef NANOJIT_64BIT
|
2010-01-21 15:10:59 -08:00
|
|
|
LIns* insImmq(uint64_t imm);
|
2010-02-11 17:30:16 -08:00
|
|
|
#endif
|
2010-01-21 15:10:59 -08:00
|
|
|
LIns* insImmf(double d);
|
|
|
|
LIns* insCall(const CallInfo *call, LIns* args[]);
|
|
|
|
LIns* insGuard(LOpcode v, LIns *c, GuardRecord *gr);
|
2010-02-18 20:04:55 -08:00
|
|
|
LIns* insGuardXov(LOpcode v, LIns* a, LIns* b, GuardRecord* gr);
|
2010-01-21 15:10:59 -08:00
|
|
|
LIns* insBranch(LOpcode v, LIns* condition, LIns* to);
|
|
|
|
LIns* insAlloc(int32_t size);
|
|
|
|
LIns* insJtbl(LIns* index, uint32_t size);
|
|
|
|
};
|
|
|
|
|
|
|
|
// This just checks things that aren't possible to check in
|
|
|
|
// ValidateWriter, eg. whether all branch targets are set and are labels.
|
|
|
|
class ValidateReader: public LirFilter {
|
2009-09-04 17:56:22 -07:00
|
|
|
public:
|
2010-01-21 15:10:59 -08:00
|
|
|
ValidateReader(LirFilter* in);
|
|
|
|
LIns* read();
|
2009-09-04 17:56:22 -07:00
|
|
|
};
|
|
|
|
#endif
|
2010-01-07 16:41:42 -08:00
|
|
|
|
|
|
|
#ifdef NJ_VERBOSE
|
|
|
|
/* A listing filter for LIR, going through backwards. It merely
|
|
|
|
passes its input to its output, but notes it down too. When
|
|
|
|
finish() is called, prints out what went through. Is intended to be
|
|
|
|
used to print arbitrary intermediate transformation stages of
|
|
|
|
LIR. */
|
|
|
|
class ReverseLister : public LirFilter
|
|
|
|
{
|
|
|
|
Allocator& _alloc;
|
|
|
|
LirNameMap* _names;
|
|
|
|
const char* _title;
|
|
|
|
StringList _strs;
|
|
|
|
LogControl* _logc;
|
|
|
|
public:
|
|
|
|
ReverseLister(LirFilter* in, Allocator& alloc,
|
|
|
|
LirNameMap* names, LogControl* logc, const char* title)
|
|
|
|
: LirFilter(in)
|
|
|
|
, _alloc(alloc)
|
|
|
|
, _names(names)
|
|
|
|
, _title(title)
|
|
|
|
, _strs(alloc)
|
|
|
|
, _logc(logc)
|
|
|
|
{ }
|
|
|
|
|
|
|
|
void finish();
|
|
|
|
LInsp read();
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
2008-06-18 21:11:15 -07:00
|
|
|
}
|
|
|
|
#endif // __nanojit_LIR__
|