//
// support.cs: Support routines to work around the fact that System.Reflection.Emit
// can not introspect types that are being constructed
//
// Author:
// Miguel de Icaza (miguel@ximian.com)
//
// (C) 2001 Ximian, Inc (http://www.ximian.com)
//
using System;
using System.IO;
using System.Text;
using System.Reflection;
using System.Collections;
using System.Reflection.Emit;
using System.Globalization;
namespace Mono.CSharp {
public interface ParameterData {
Type ParameterType (int pos);
int Count { get; }
string ParameterName (int pos);
string ParameterDesc (int pos);
Parameter.Modifier ParameterModifier (int pos);
}
public class ReflectionParameters : ParameterData {
ParameterInfo [] pi;
bool last_arg_is_params = false;
public ReflectionParameters (ParameterInfo [] pi)
{
object [] attrs;
this.pi = pi;
int count = pi.Length-1;
if (count >= 0) {
attrs = pi [count].GetCustomAttributes (TypeManager.param_array_type, true);
if (attrs == null)
return;
if (attrs.Length == 0)
return;
last_arg_is_params = true;
}
}
public Type ParameterType (int pos)
{
if (last_arg_is_params && pos >= pi.Length - 1)
return pi [pi.Length - 1].ParameterType;
else {
Type t = pi [pos].ParameterType;
return t;
}
}
public string ParameterName (int pos)
{
if (last_arg_is_params && pos >= pi.Length - 1)
return pi [pi.Length - 1].Name;
else
return pi [pos].Name;
}
public string ParameterDesc (int pos)
{
StringBuilder sb = new StringBuilder ();
if (pi [pos].IsIn)
sb.Append ("in ");
Type partype = ParameterType (pos);
if (partype.IsByRef){
partype = TypeManager.GetElementType (partype);
if (pi [pos].IsOut)
sb.Append ("out ");
else
sb.Append ("ref ");
}
if (pos >= pi.Length - 1 && last_arg_is_params)
sb.Append ("params ");
sb.Append (TypeManager.CSharpName (partype));
return sb.ToString ();
}
public Parameter.Modifier ParameterModifier (int pos)
{
int len = pi.Length;
if (pos >= len - 1)
if (last_arg_is_params)
return Parameter.Modifier.PARAMS;
Type t = pi [pos].ParameterType;
if (t.IsByRef){
if ((pi [pos].Attributes & ParameterAttributes.Out) != 0)
return Parameter.Modifier.ISBYREF | Parameter.Modifier.OUT;
else
return Parameter.Modifier.ISBYREF | Parameter.Modifier.REF;
}
return Parameter.Modifier.NONE;
}
public int Count {
get {
return pi.Length;
}
}
}
public class InternalParameters : ParameterData {
Type [] param_types;
public readonly Parameters Parameters;
public InternalParameters (Type [] param_types, Parameters parameters)
{
this.param_types = param_types;
this.Parameters = parameters;
}
public InternalParameters (DeclSpace ds, Parameters parameters)
: this (parameters.GetParameterInfo (ds), parameters)
{
}
public int Count {
get {
if (param_types == null)
return 0;
return param_types.Length;
}
}
Parameter GetParameter (int pos)
{
Parameter [] fixed_pars = Parameters.FixedParameters;
if (fixed_pars != null){
int len = fixed_pars.Length;
if (pos < len)
return Parameters.FixedParameters [pos];
}
return Parameters.ArrayParameter;
}
public Type ParameterType (int pos)
{
if (param_types == null)
return null;
return GetParameter (pos).ExternalType ();
}
public string ParameterName (int pos)
{
return GetParameter (pos).Name;
}
public string ParameterDesc (int pos)
{
string tmp = String.Empty;
Parameter p = GetParameter (pos);
//
// We need to and for REF/OUT, because if either is set the
// extra flag ISBYREF will be set as well
//
if ((p.ModFlags & Parameter.Modifier.REF) != 0)
tmp = "ref ";
else if ((p.ModFlags & Parameter.Modifier.OUT) != 0)
tmp = "out ";
else if (p.ModFlags == Parameter.Modifier.PARAMS)
tmp = "params ";
Type t = ParameterType (pos);
return tmp + TypeManager.CSharpName (t);
}
public Parameter.Modifier ParameterModifier (int pos)
{
Parameter.Modifier mod = GetParameter (pos).ModFlags;
if ((mod & (Parameter.Modifier.REF | Parameter.Modifier.OUT)) != 0)
mod |= Parameter.Modifier.ISBYREF;
return mod;
}
}
class PtrHashtable : Hashtable {
sealed class PtrComparer : IComparer {
private PtrComparer () {}
public static PtrComparer Instance = new PtrComparer ();
public int Compare (object x, object y)
{
if (x == y)
return 0;
else
return 1;
}
}
public PtrHashtable ()
{
comparer = PtrComparer.Instance;
}
}
/*
* Hashtable whose keys are character arrays with the same length
*/
class CharArrayHashtable : Hashtable {
sealed class ArrComparer : IComparer {
private int len;
public ArrComparer (int len) {
this.len = len;
}
public int Compare (object x, object y)
{
char[] a = (char[])x;
char[] b = (char[])y;
for (int i = 0; i < len; ++i)
if (a [i] != b [i])
return 1;
return 0;
}
}
private int len;
protected override int GetHash (Object key)
{
char[] arr = (char[])key;
int h = 0;
for (int i = 0; i < len; ++i)
h = (h << 5) - h + arr [i];
return h;
}
public CharArrayHashtable (int len)
{
this.len = len;
comparer = new ArrComparer (len);
}
}
//
// Compares member infos based on their name and
// also allows one argument to be a string
//
class MemberInfoCompare : IComparer {
public int Compare (object a, object b)
{
if (a == null || b == null){
Console.WriteLine ("Invalid information passed");
throw new Exception ();
}
if (a is string)
return String.Compare ((string) a, ((MemberInfo)b).Name, false, CultureInfo.InvariantCulture);
if (b is string)
return String.Compare (((MemberInfo)a).Name, (string) b, false, CultureInfo.InvariantCulture);
return String.Compare (((MemberInfo)a).Name, ((MemberInfo)b).Name, false, CultureInfo.InvariantCulture);
}
}
struct Pair {
public object First;
public object Second;
public Pair (object f, object s)
{
First = f;
Second = s;
}
}
///
/// This is a wrapper around StreamReader which is seekable.
///
public class SeekableStreamReader
{
public SeekableStreamReader (StreamReader reader)
{
this.reader = reader;
this.buffer = new char [DefaultCacheSize];
}
public SeekableStreamReader (Stream stream, Encoding encoding, bool detect_encoding_from_bytemarks)
: this (new StreamReader (stream, encoding, detect_encoding_from_bytemarks))
{ }
StreamReader reader;
private const int DefaultCacheSize = 1024;
char[] buffer;
int buffer_start;
int buffer_size;
int pos;
///
/// The difference to the StreamReader's BaseStream.Position is that this one is reliable; ie. it
// always reports the correct position and if it's modified, it also takes care of the buffered data.
///
public int Position {
get {
return buffer_start + pos;
}
set {
// This one is easy: we're modifying the position within our current
// buffer.
if ((value >= buffer_start) && (value < buffer_start + buffer_size)) {
pos = value - buffer_start;
return;
}
// Ok, now we need to seek.
reader.DiscardBufferedData ();
reader.BaseStream.Position = buffer_start = value;
buffer_size = pos = 0;
}
}
private bool ReadBuffer ()
{
pos = 0;
buffer_start += buffer_size;
buffer_size = reader.Read (buffer, 0, buffer.Length);
return buffer_size > 0;
}
public int Peek ()
{
if ((pos >= buffer_size) && !ReadBuffer ())
return -1;
return buffer [pos];
}
public int Read ()
{
if ((pos >= buffer_size) && !ReadBuffer ())
return -1;
return buffer [pos++];
}
}
public class DoubleHash {
const int DEFAULT_INITIAL_BUCKETS = 100;
public DoubleHash () : this (DEFAULT_INITIAL_BUCKETS) {}
public DoubleHash (int size)
{
count = size;
buckets = new Entry [size];
}
int count;
Entry [] buckets;
int size = 0;
class Entry {
public object key1;
public object key2;
public int hash;
public object value;
public Entry next;
public Entry (object key1, object key2, int hash, object value, Entry next)
{
this.key1 = key1;
this.key2 = key2;
this.hash = hash;
this.next = next;
this.value = value;
}
}
public bool Lookup (object a, object b, out object res)
{
int h = (a.GetHashCode () ^ b.GetHashCode ()) & 0x7FFFFFFF;
for (Entry e = buckets [h % count]; e != null; e = e.next) {
if (e.hash == h && e.key1.Equals (a) && e.key2.Equals (b)) {
res = e.value;
return true;
}
}
res = null;
return false;
}
public void Insert (object a, object b, object value)
{
// Is it an existing one?
int h = (a.GetHashCode () ^ b.GetHashCode ()) & 0x7FFFFFFF;
for (Entry e = buckets [h % count]; e != null; e = e.next) {
if (e.hash == h && e.key1.Equals (a) && e.key2.Equals (b))
e.value = value;
}
int bucket = h % count;
buckets [bucket] = new Entry (a, b, h, value, buckets [bucket]);
// Grow whenever we double in size
if (size++ == count) {
count <<= 1;
count ++;
Entry [] newBuckets = new Entry [count];
foreach (Entry root in buckets) {
Entry e = root;
while (e != null) {
int newLoc = e.hash % count;
Entry n = e.next;
e.next = newBuckets [newLoc];
newBuckets [newLoc] = e;
e = n;
}
}
buckets = newBuckets;
}
}
}
}