mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
457 lines
12 KiB
C++
457 lines
12 KiB
C++
/* -*- Mode: C++; c-basic-offset: 4; indent-tabs-mode: nil; tab-width: 4 -*- */
|
|
/* vi: set ts=4 sw=4 expandtab: (add to ~/.vimrc: set modeline modelines=5) */
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
*
|
|
* The contents of this file are subject to the Mozilla Public License Version 1.1 (the
|
|
* "License"); you may not use this file except in compliance with the License. You may obtain
|
|
* a copy of the License at http://www.mozilla.org/MPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS IS" basis, WITHOUT
|
|
* WARRANTY OF ANY KIND, either express or implied. See the License for the specific
|
|
* language governing rights and limitations under the License.
|
|
*
|
|
* The Original Code is [Open Source Virtual Machine.]
|
|
*
|
|
* The Initial Developer of the Original Code is Adobe System Incorporated. Portions created
|
|
* by the Initial Developer are Copyright (C)[ 2004-2006 ] Adobe Systems Incorporated. All Rights
|
|
* Reserved.
|
|
*
|
|
* Contributor(s): Adobe AS3 Team
|
|
* Andreas Gal <gal@mozilla.com>
|
|
* Asko Tontti <atontti@cc.hut.fi>
|
|
*
|
|
* 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 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 avm_h___
|
|
#define avm_h___
|
|
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#include <ctype.h>
|
|
#include <stdlib.h>
|
|
|
|
#if defined(AVMPLUS_UNIX) || defined(AVMPLUS_OS2)
|
|
#include <unistd.h>
|
|
#include <sys/mman.h>
|
|
#endif
|
|
|
|
#include "jstypes.h"
|
|
#include "jsstdint.h"
|
|
|
|
#if !defined(AVMPLUS_LITTLE_ENDIAN) && !defined(AVMPLUS_BIG_ENDIAN)
|
|
#ifdef IS_BIG_ENDIAN
|
|
#define AVMPLUS_BIG_ENDIAN
|
|
#else
|
|
#define AVMPLUS_LITTLE_ENDIAN
|
|
#endif
|
|
#endif
|
|
|
|
#define FASTCALL JS_FASTCALL
|
|
|
|
#if defined(JS_NO_FASTCALL)
|
|
#define NJ_NO_FASTCALL
|
|
#if defined(AVMPLUS_IA32)
|
|
#define SIMULATE_FASTCALL(lr, state_ptr, frag_ptr, func_addr) \
|
|
asm volatile( \
|
|
"call *%%esi" \
|
|
: "=a" (lr) \
|
|
: "c" (state_ptr), "d" (frag_ptr), "S" (func_addr) \
|
|
: "memory", "cc" \
|
|
);
|
|
#endif /* defined(AVMPLUS_IA32) */
|
|
#endif /* defined(JS_NO_FASTCALL) */
|
|
|
|
#ifdef WIN32
|
|
#include <windows.h>
|
|
#elif defined(AVMPLUS_OS2)
|
|
#define INCL_DOSMEMMGR
|
|
#include <os2.h>
|
|
#endif
|
|
|
|
#if defined(DEBUG) || defined(MOZ_NO_VARADIC_MACROS)
|
|
#if !defined _DEBUG
|
|
#define _DEBUG
|
|
#endif
|
|
#define NJ_VERBOSE 1
|
|
#define NJ_PROFILE 1
|
|
#include <stdarg.h>
|
|
#endif
|
|
|
|
#ifdef _DEBUG
|
|
void NanoAssertFail();
|
|
#endif
|
|
|
|
#define AvmAssert(x) assert(x)
|
|
#define AvmAssertMsg(x, y)
|
|
#define AvmDebugLog(x) printf x
|
|
|
|
#if defined(AVMPLUS_IA32)
|
|
#if defined(_MSC_VER)
|
|
__declspec(naked) static inline __int64 rdtsc()
|
|
{
|
|
__asm
|
|
{
|
|
rdtsc;
|
|
ret;
|
|
}
|
|
}
|
|
#elif defined(SOLARIS)
|
|
static inline unsigned long long rdtsc(void)
|
|
{
|
|
unsigned long long int x;
|
|
asm volatile (".byte 0x0f, 0x31" : "=A" (x));
|
|
return x;
|
|
}
|
|
#elif defined(__i386__)
|
|
static __inline__ unsigned long long rdtsc(void)
|
|
{
|
|
unsigned long long int x;
|
|
__asm__ volatile (".byte 0x0f, 0x31" : "=A" (x));
|
|
return x;
|
|
}
|
|
#endif /* compilers */
|
|
|
|
#elif defined(__x86_64__)
|
|
|
|
static __inline__ uint64_t rdtsc(void)
|
|
{
|
|
unsigned hi, lo;
|
|
__asm__ __volatile__ ("rdtsc" : "=a"(lo), "=d"(hi));
|
|
return ( (uint64_t)lo)|( ((uint64_t)hi)<<32 );
|
|
}
|
|
|
|
#elif defined(__powerpc__)
|
|
|
|
typedef unsigned long long int unsigned long long;
|
|
|
|
static __inline__ unsigned long long rdtsc(void)
|
|
{
|
|
unsigned long long int result=0;
|
|
unsigned long int upper, lower,tmp;
|
|
__asm__ volatile(
|
|
"0: \n"
|
|
"\tmftbu %0 \n"
|
|
"\tmftb %1 \n"
|
|
"\tmftbu %2 \n"
|
|
"\tcmpw %2,%0 \n"
|
|
"\tbne 0b \n"
|
|
: "=r"(upper),"=r"(lower),"=r"(tmp)
|
|
);
|
|
result = upper;
|
|
result = result<<32;
|
|
result = result|lower;
|
|
|
|
return(result);
|
|
}
|
|
|
|
#endif /* architecture */
|
|
|
|
struct JSContext;
|
|
|
|
#ifdef PERFM
|
|
# define PERFM_NVPROF(n,v) _nvprof(n,v)
|
|
# define PERFM_NTPROF(n) _ntprof(n)
|
|
# define PERFM_TPROF_END() _tprof_end()
|
|
#else
|
|
# define PERFM_NVPROF(n,v)
|
|
# define PERFM_NTPROF(n)
|
|
# define PERFM_TPROF_END()
|
|
#endif
|
|
|
|
#define VMPI_strlen strlen
|
|
#define VMPI_strcat strcat
|
|
#define VMPI_strncat strncat
|
|
#define VMPI_strcpy strcpy
|
|
#define VMPI_sprintf sprintf
|
|
#define VMPI_memset memset
|
|
#define VMPI_isdigit isdigit
|
|
#define VMPI_getDate()
|
|
|
|
extern void VMPI_setPageProtection(void *address,
|
|
size_t size,
|
|
bool executableFlag,
|
|
bool writeableFlag);
|
|
|
|
namespace avmplus {
|
|
|
|
typedef int FunctionID;
|
|
|
|
extern void AvmLog(char const *msg, ...);
|
|
|
|
class Config
|
|
{
|
|
public:
|
|
Config() {
|
|
memset(this, 0, sizeof(Config));
|
|
#ifdef DEBUG
|
|
verbose = false;
|
|
verbose_addrs = 1;
|
|
verbose_exits = 1;
|
|
verbose_live = 1;
|
|
show_stats = 1;
|
|
#endif
|
|
}
|
|
|
|
uint32_t tree_opt:1;
|
|
uint32_t quiet_opt:1;
|
|
uint32_t verbose:1;
|
|
uint32_t verbose_addrs:1;
|
|
uint32_t verbose_live:1;
|
|
uint32_t verbose_exits:1;
|
|
uint32_t show_stats:1;
|
|
|
|
#if defined (AVMPLUS_IA32)
|
|
// Whether or not we can use SSE2 instructions and conditional moves.
|
|
bool sse2;
|
|
bool use_cmov;
|
|
#endif
|
|
|
|
#if defined (AVMPLUS_ARM)
|
|
// Whether or not to generate VFP instructions.
|
|
# if defined (NJ_FORCE_SOFTFLOAT)
|
|
static const bool vfp = false;
|
|
# else
|
|
bool vfp;
|
|
# endif
|
|
|
|
// The ARM architecture version.
|
|
# if defined (NJ_FORCE_ARM_ARCH_VERSION)
|
|
static const unsigned int arch = NJ_FORCE_ARM_ARCH_VERSION;
|
|
# else
|
|
unsigned int arch;
|
|
# endif
|
|
|
|
// Support for Thumb, even if it isn't used by nanojit. This is used to
|
|
// determine whether or not to generate interworking branches.
|
|
# if defined (NJ_FORCE_NO_ARM_THUMB)
|
|
static const bool thumb = false;
|
|
# else
|
|
bool thumb;
|
|
# endif
|
|
|
|
// Support for Thumb2, even if it isn't used by nanojit. This is used to
|
|
// determine whether or not to use some of the ARMv6T2 instructions.
|
|
# if defined (NJ_FORCE_NO_ARM_THUMB2)
|
|
static const bool thumb2 = false;
|
|
# else
|
|
bool thumb2;
|
|
# endif
|
|
|
|
#endif
|
|
|
|
#if defined (NJ_FORCE_SOFTFLOAT)
|
|
static const bool soft_float = true;
|
|
#else
|
|
bool soft_float;
|
|
#endif
|
|
};
|
|
|
|
static const int kstrconst_emptyString = 0;
|
|
|
|
class AvmInterpreter
|
|
{
|
|
class Labels {
|
|
public:
|
|
const char* format(const void* ip)
|
|
{
|
|
static char buf[33];
|
|
sprintf(buf, "%p", ip);
|
|
return buf;
|
|
}
|
|
};
|
|
|
|
Labels _labels;
|
|
public:
|
|
Labels* labels;
|
|
|
|
AvmInterpreter()
|
|
{
|
|
labels = &_labels;
|
|
}
|
|
|
|
};
|
|
|
|
class AvmConsole
|
|
{
|
|
public:
|
|
AvmConsole& operator<<(const char* s)
|
|
{
|
|
fprintf(stdout, "%s", s);
|
|
return *this;
|
|
}
|
|
};
|
|
|
|
class AvmCore
|
|
{
|
|
public:
|
|
AvmInterpreter interp;
|
|
AvmConsole console;
|
|
|
|
static Config config;
|
|
|
|
#ifdef AVMPLUS_IA32
|
|
static inline bool
|
|
use_sse2()
|
|
{
|
|
return config.sse2;
|
|
}
|
|
#endif
|
|
|
|
static inline bool
|
|
use_cmov()
|
|
{
|
|
#ifdef AVMPLUS_IA32
|
|
return config.use_cmov;
|
|
#else
|
|
return true;
|
|
#endif
|
|
}
|
|
|
|
static inline bool
|
|
quiet_opt()
|
|
{
|
|
return config.quiet_opt;
|
|
}
|
|
|
|
static inline bool
|
|
verbose()
|
|
{
|
|
return config.verbose;
|
|
}
|
|
|
|
};
|
|
|
|
/**
|
|
* Bit vectors are an efficent method of keeping True/False information
|
|
* on a set of items or conditions. Class BitSet provides functions
|
|
* to manipulate individual bits in the vector.
|
|
*
|
|
* Since most vectors are rather small an array of longs is used by
|
|
* default to house the value of the bits. If more bits are needed
|
|
* then an array is allocated dynamically outside of this object.
|
|
*
|
|
* This object is not optimized for a fixed sized bit vector
|
|
* it instead allows for dynamically growing the bit vector.
|
|
*/
|
|
class BitSet
|
|
{
|
|
public:
|
|
enum { kUnit = 8*sizeof(long),
|
|
kDefaultCapacity = 4 };
|
|
|
|
BitSet()
|
|
{
|
|
capacity = kDefaultCapacity;
|
|
reset();
|
|
}
|
|
|
|
~BitSet()
|
|
{
|
|
if (capacity > kDefaultCapacity)
|
|
free(bits.ptr);
|
|
}
|
|
|
|
void reset()
|
|
{
|
|
if (capacity > kDefaultCapacity)
|
|
for(int i=0; i<capacity; i++)
|
|
bits.ptr[i] = 0;
|
|
else
|
|
for(int i=0; i<capacity; i++)
|
|
bits.ar[i] = 0;
|
|
}
|
|
|
|
void set(int bitNbr)
|
|
{
|
|
int index = bitNbr / kUnit;
|
|
int bit = bitNbr % kUnit;
|
|
if (index >= capacity)
|
|
grow(index+1);
|
|
|
|
if (capacity > kDefaultCapacity)
|
|
bits.ptr[index] |= (1<<bit);
|
|
else
|
|
bits.ar[index] |= (1<<bit);
|
|
}
|
|
|
|
void clear(int bitNbr)
|
|
{
|
|
int index = bitNbr / kUnit;
|
|
int bit = bitNbr % kUnit;
|
|
if (index < capacity)
|
|
{
|
|
if (capacity > kDefaultCapacity)
|
|
bits.ptr[index] &= ~(1<<bit);
|
|
else
|
|
bits.ar[index] &= ~(1<<bit);
|
|
}
|
|
}
|
|
|
|
bool get(int bitNbr) const
|
|
{
|
|
int index = bitNbr / kUnit;
|
|
int bit = bitNbr % kUnit;
|
|
bool value = false;
|
|
if (index < capacity)
|
|
{
|
|
if (capacity > kDefaultCapacity)
|
|
value = ( bits.ptr[index] & (1<<bit) ) ? true : false;
|
|
else
|
|
value = ( bits.ar[index] & (1<<bit) ) ? true : false;
|
|
}
|
|
return value;
|
|
}
|
|
|
|
private:
|
|
// Grow the array until at least newCapacity big
|
|
void grow(int newCapacity)
|
|
{
|
|
// create vector that is 2x bigger than requested
|
|
newCapacity *= 2;
|
|
//MEMTAG("BitVector::Grow - long[]");
|
|
long* newBits = (long*)calloc(1, newCapacity * sizeof(long));
|
|
//memset(newBits, 0, newCapacity * sizeof(long));
|
|
|
|
// copy the old one
|
|
if (capacity > kDefaultCapacity)
|
|
for(int i=0; i<capacity; i++)
|
|
newBits[i] = bits.ptr[i];
|
|
else
|
|
for(int i=0; i<capacity; i++)
|
|
newBits[i] = bits.ar[i];
|
|
|
|
// in with the new out with the old
|
|
if (capacity > kDefaultCapacity)
|
|
free(bits.ptr);
|
|
|
|
bits.ptr = newBits;
|
|
capacity = newCapacity;
|
|
}
|
|
|
|
// by default we use the array, but if the vector
|
|
// size grows beyond kDefaultCapacity we allocate
|
|
// space dynamically.
|
|
int capacity;
|
|
union
|
|
{
|
|
long ar[kDefaultCapacity];
|
|
long* ptr;
|
|
}
|
|
bits;
|
|
};
|
|
}
|
|
|
|
#endif
|