//
// Author:
// Miguel de Icaza (miguel@ximian.com)
+// Marek Safar (marek.safar@gmail.com)
//
-// (C) 2001 Ximian, Inc (http://www.ximian.com)
+// Copyright 2001 Ximian, Inc (http://www.ximian.com)
+// Copyright 2003-2009 Novell, Inc
//
using System;
using System.IO;
using System.Text;
-using System.Reflection;
-using System.Collections;
-using System.Reflection.Emit;
-using System.Globalization;
+using System.Collections.Generic;
namespace Mono.CSharp {
- public interface ParameterData {
- Type ParameterType (int pos);
- int Count { get; }
- bool HasParams { 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;
- bool is_varargs = false;
-
- public ReflectionParameters (MethodBase mb)
- {
- object [] attrs;
-
- ParameterInfo [] pi = mb.GetParameters ();
- is_varargs = (mb.CallingConvention & CallingConventions.VarArgs) != 0;
-
- 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;
+ sealed class ReferenceEquality<T> : IEqualityComparer<T> where T : class
+ {
+ public static readonly IEqualityComparer<T> Default = new ReferenceEquality<T> ();
- last_arg_is_params = true;
- }
- }
-
- public Type ParameterType (int pos)
+ private ReferenceEquality ()
{
- if (last_arg_is_params && pos >= pi.Length - 1)
- return pi [pi.Length - 1].ParameterType;
- else if (is_varargs && pos >= pi.Length)
- return TypeManager.runtime_argument_handle_type;
- else {
- Type t = pi [pos].ParameterType;
-
- return t;
- }
}
- public string ParameterName (int pos)
+ public bool Equals (T x, T y)
{
- if (last_arg_is_params && pos >= pi.Length - 1)
- return pi [pi.Length - 1].Name;
- else if (is_varargs && pos >= pi.Length)
- return "__arglist";
- else
- return pi [pos].Name;
+ return ReferenceEquals (x, y);
}
- public string ParameterDesc (int pos)
+ public int GetHashCode (T obj)
{
- if (is_varargs && pos >= pi.Length)
- return "";
-
- 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 ();
-
+ return System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode (obj);
}
+ }
- public Parameter.Modifier ParameterModifier (int pos)
+ public class Tuple<T1, T2> : IEquatable<Tuple<T1, T2>>
+ {
+ public Tuple (T1 item1, T2 item2)
{
- if (last_arg_is_params && pos >= pi.Length - 1)
- return Parameter.Modifier.PARAMS;
- else if (is_varargs && pos >= pi.Length)
- return Parameter.Modifier.ARGLIST;
-
- 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;
+ Item1 = item1;
+ Item2 = item2;
}
- public int Count {
- get {
- return is_varargs ? pi.Length + 1 : pi.Length;
- }
- }
+ public T1 Item1 { get; private set; }
+ public T2 Item2 { get; private set; }
- public bool HasParams {
- get {
- return this.last_arg_is_params;
- }
+ public override int GetHashCode ()
+ {
+ return Item1.GetHashCode () ^ Item2.GetHashCode ();
}
-
- }
- public class InternalParameters : ParameterData {
- Type [] param_types;
- bool has_varargs;
- int count;
+ #region IEquatable<Tuple<T1,T2>> Members
- public readonly Parameters Parameters;
-
- public InternalParameters (Type [] param_types, Parameters parameters)
+ public bool Equals (Tuple<T1, T2> other)
{
- this.param_types = param_types;
- this.Parameters = parameters;
-
- has_varargs = parameters.HasArglist;
-
- if (param_types == null)
- count = 0;
- else
- count = param_types.Length;
+ return EqualityComparer<T1>.Default.Equals (Item1, other.Item1) &&
+ EqualityComparer<T2>.Default.Equals (Item2, other.Item2);
}
- public int Count {
- get {
- return has_varargs ? count + 1 : count;
- }
- }
-
- public bool HasParams {
- get {
- return Parameters.ArrayParameter != null;
- }
- }
+ #endregion
+ }
- Parameter GetParameter (int pos)
+ public class Tuple<T1, T2, T3> : IEquatable<Tuple<T1, T2, T3>>
+ {
+ public Tuple (T1 item1, T2 item2, T3 item3)
{
- Parameter [] fixed_pars = Parameters.FixedParameters;
- if (fixed_pars != null){
- int len = fixed_pars.Length;
- if (pos < len)
- return Parameters.FixedParameters [pos];
- }
-
- return Parameters.ArrayParameter;
+ Item1 = item1;
+ Item2 = item2;
+ Item3 = item3;
}
- public Type ParameterType (int pos)
- {
- if (has_varargs && pos >= count)
- return TypeManager.runtime_argument_handle_type;
-
- if (param_types == null)
- return null;
+ public T1 Item1 { get; private set; }
+ public T2 Item2 { get; private set; }
+ public T3 Item3 { get; private set; }
- return GetParameter (pos).ExternalType ();
+ public override int GetHashCode ()
+ {
+ return Item1.GetHashCode () ^ Item2.GetHashCode () ^ Item3.GetHashCode ();
}
+ #region IEquatable<Tuple<T1,T2>> Members
- public string ParameterName (int pos)
+ public bool Equals (Tuple<T1, T2, T3> other)
{
- if (has_varargs && pos >= count)
- return "__arglist";
-
- return GetParameter (pos).Name;
+ return EqualityComparer<T1>.Default.Equals (Item1, other.Item1) &&
+ EqualityComparer<T2>.Default.Equals (Item2, other.Item2) &&
+ EqualityComparer<T3>.Default.Equals (Item3, other.Item3);
}
- public string ParameterDesc (int pos)
- {
- if (has_varargs && pos >= count)
- return "__arglist";
-
- Type t = ParameterType (pos);
- return ModifierDesc (pos) + " " + TypeManager.CSharpName (t);
- }
+ #endregion
+ }
- public string ModifierDesc (int pos)
+ static class Tuple
+ {
+ public static Tuple<T1, T2> Create<T1, T2> (T1 item1, T2 item2)
{
- 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)
- return "ref";
- if ((p.ModFlags & Parameter.Modifier.OUT) != 0)
- return "out";
- if (p.ModFlags == Parameter.Modifier.PARAMS)
- return "params";
-
- return "";
+ return new Tuple<T1, T2> (item1, item2);
}
- public Parameter.Modifier ParameterModifier (int pos)
+ public static Tuple<T1, T2, T3> Create<T1, T2, T3> (T1 item1, T2 item2, T3 item3)
{
- if (has_varargs && pos >= count)
- return Parameter.Modifier.ARGLIST;
-
- Parameter.Modifier mod = GetParameter (pos).ModFlags;
-
- if ((mod & (Parameter.Modifier.REF | Parameter.Modifier.OUT)) != 0)
- mod |= Parameter.Modifier.ISBYREF;
-
- return mod;
+ return new Tuple<T1, T2, T3> (item1, item2, item3);
}
-
}
- 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 ()
+ static class ArrayComparer
+ {
+ public static bool IsEqual<T> (T[] array1, T[] array2)
{
- comparer = PtrComparer.Instance;
- }
- }
+ if (array1 == null || array2 == null)
+ return array1 == array2;
- /*
- * Hashtable whose keys are character arrays with the same length
- */
- class CharArrayHashtable : Hashtable {
- sealed class ArrComparer : IComparer {
- private int len;
+ var eq = EqualityComparer<T>.Default;
- public ArrComparer (int len) {
- this.len = len;
+ for (int i = 0; i < array1.Length; ++i) {
+ if (!eq.Equals (array1[i], array2[i])) {
+ return false;
+ }
}
- 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;
- }
+ return true;
}
+ }
- 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];
+ /// <summary>
+ /// This is an arbitrarily seekable StreamReader wrapper.
+ ///
+ /// It uses a self-tuning buffer to cache the seekable data,
+ /// but if the seek is too far, it may read the underly
+ /// stream all over from the beginning.
+ /// </summary>
+ public class SeekableStreamReader : IDisposable
+ {
+ StreamReader reader;
+ Stream stream;
- return h;
- }
+ static char[] buffer;
+ int read_ahead_length; // the length of read buffer
+ int buffer_start; // in chars
+ int char_count; // count of filled characters in buffer[]
+ int pos; // index into buffer[]
- public CharArrayHashtable (int len)
+ public SeekableStreamReader (Stream stream, Encoding encoding)
{
- this.len = len;
- comparer = new ArrComparer (len);
- }
- }
+ this.stream = stream;
- struct Pair {
- public object First;
- public object Second;
-
- public Pair (object f, object s)
- {
- First = f;
- Second = s;
+ const int default_read_ahead = 2048;
+ InitializeStream (default_read_ahead);
+ reader = new StreamReader (stream, encoding, true);
}
- }
- /// <summary>
- /// This is a wrapper around StreamReader which is seekable.
- /// </summary>
- public class SeekableStreamReader
- {
- public SeekableStreamReader (StreamReader reader)
+ public void Dispose ()
{
- this.reader = reader;
- this.buffer = new char [DefaultCacheSize];
-
- // Compute the preamble size
-
- // Let the StreamWriter autodetect the encoder
- reader.Peek ();
-
- reader.BaseStream.Position = 0;
- Encoding enc = reader.CurrentEncoding;
- // First of all, get at least a char
-
- byte[] auxb = new byte [50];
- int num_bytes = 0;
- int num_chars = 0;
- int br = 0;
- do {
- br = reader.BaseStream.Read (auxb, num_bytes, auxb.Length - num_bytes);
- num_bytes += br;
- num_chars = enc.GetCharCount (auxb, 0, num_bytes);
- }
- while (num_chars == 0 && br > 0);
-
- if (num_chars != 0)
- {
- // Now, check which bytes at the beginning have no effect in the
- // char count
-
- int p = 0;
- while (enc.GetCharCount (auxb, p, num_bytes-p) >= num_chars)
- p++;
-
- preamble_size = p - 1;
- reader.BaseStream.Position = 0;
- reader.DiscardBufferedData ();
-
- buffer_start = preamble_size;
- }
+ // Needed to release stream reader buffers
+ reader.Dispose ();
}
- public SeekableStreamReader (Stream stream, Encoding encoding, bool detect_encoding_from_bytemarks)
- : this (new StreamReader (stream, encoding, detect_encoding_from_bytemarks))
- { }
+ void InitializeStream (int read_length_inc)
+ {
+ read_ahead_length += read_length_inc;
- StreamReader reader;
+ int required_buffer_size = read_ahead_length * 2;
- private const int DefaultCacheSize = 1024;
+ if (buffer == null || buffer.Length < required_buffer_size)
+ buffer = new char [required_buffer_size];
- char[] buffer;
- int buffer_start; // in bytes
- int buffer_size; // in bytes
- int char_count; // count buffer[] valid characters
- int pos; // index into buffer[]
- int preamble_size;
+ stream.Position = 0;
+ buffer_start = char_count = pos = 0;
+ }
/// <remarks>
- /// 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.
+ /// This value corresponds to the current position in a stream of characters.
+ /// The StreamReader hides its manipulation of the underlying byte stream and all
+ /// character set/decoding issues. Thus, we cannot use this position to guess at
+ /// the corresponding position in the underlying byte stream even though there is
+ /// a correlation between them.
/// </remarks>
public int Position {
get {
- return buffer_start + reader.CurrentEncoding.GetByteCount (buffer, 0, pos);
+ 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)) {
- int byte_offset = value - buffer_start;
-
- // pos is an index into a char
- // buffer so it might be
- // greater than the buffer
- // length now, if the buffer
- // contains multibyte chars
- pos = byte_offset;
-
- // encoded characters can take
- // more than 1 byte length.
- while ((pos > buffer.Length) ||
- reader.CurrentEncoding.GetByteCount (buffer, 0, pos) > byte_offset) {
- pos--;
- }
-
- return;
+ //
+ // If the lookahead was too small, re-read from the beginning. Increase the buffer size while we're at it
+ // This should never happen until we are parsing some weird source code
+ //
+ if (value < buffer_start) {
+ InitializeStream (read_ahead_length);
+
+ //
+ // Discard buffer data after underlying stream changed position
+ // Cannot use handy reader.DiscardBufferedData () because it for
+ // some strange reason resets encoding as well
+ //
+ reader = new StreamReader (stream, reader.CurrentEncoding, true);
+ }
+
+ while (value > buffer_start + char_count) {
+ pos = char_count;
+ if (!ReadBuffer ())
+ throw new InternalErrorException ("Seek beyond end of file: " + (buffer_start + char_count - value));
}
-
- if (value == 0) // Skip preamble
- value = preamble_size;
-
- // Ok, now we need to seek.
- reader.DiscardBufferedData ();
- reader.BaseStream.Position = buffer_start = value;
- char_count = buffer_size = pos = 0;
+
+ pos = value - buffer_start;
}
}
- private bool ReadBuffer ()
+ bool ReadBuffer ()
{
- pos = 0;
- buffer_start += buffer_size;
- char_count = reader.Read (buffer, 0, buffer.Length);
- buffer_size = reader.CurrentEncoding.GetByteCount (buffer, 0, char_count);
- return buffer_size > 0;
+ int slack = buffer.Length - char_count;
+
+ //
+ // read_ahead_length is only half of the buffer to deal with
+ // reads ahead and moves back without re-reading whole buffer
+ //
+ if (slack <= read_ahead_length) {
+ //
+ // shift the buffer to make room for read_ahead_length number of characters
+ //
+ int shift = read_ahead_length - slack;
+ Array.Copy (buffer, shift, buffer, 0, char_count - shift);
+
+ // Update all counters
+ pos -= shift;
+ char_count -= shift;
+ buffer_start += shift;
+ slack += shift;
+ }
+
+ char_count += reader.Read (buffer, char_count, slack);
+
+ return pos < char_count;
+ }
+
+ public char[] ReadChars (int fromPosition, int toPosition)
+ {
+ char[] chars = new char[toPosition - fromPosition];
+ if (buffer_start <= fromPosition && toPosition <= buffer_start + buffer.Length) {
+ Array.Copy (buffer, fromPosition - buffer_start, chars, 0, chars.Length);
+ } else {
+ throw new NotImplementedException ();
+ }
+
+ return chars;
}
public int Peek ()
}
}
- public class DoubleHash {
- const int DEFAULT_INITIAL_BUCKETS = 100;
-
- public DoubleHash () : this (DEFAULT_INITIAL_BUCKETS) {}
-
- public DoubleHash (int size)
+ public class UnixUtils {
+ [System.Runtime.InteropServices.DllImport ("libc", EntryPoint="isatty")]
+ extern static int _isatty (int fd);
+
+ public static bool isatty (int fd)
{
- 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;
+ try {
+ return _isatty (fd) == 1;
+ } catch {
+ return false;
}
}
+ }
- public bool Lookup (object a, object b, out object res)
+ /// <summary>
+ /// An exception used to terminate the compiler resolution phase and provide completions
+ /// </summary>
+ /// <remarks>
+ /// This is thrown when we want to return the completions or
+ /// terminate the completion process by AST nodes used in
+ /// the completion process.
+ /// </remarks>
+ public class CompletionResult : Exception {
+ string [] result;
+ string base_text;
+
+ public CompletionResult (string base_text, string [] 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;
+ if (base_text == null)
+ throw new ArgumentNullException ("base_text");
+ this.base_text = base_text;
+
+ result = res;
+ Array.Sort (result);
}
- 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;
+ public string [] Result {
+ get {
+ return result;
}
-
- 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;
+ public string BaseText {
+ get {
+ return base_text;
}
}
}
projects / mono.git / blobdiff