//
// 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);
- Type [] Types { get; }
- int Count { get; }
- bool HasParams { get; }
- string ParameterName (int pos);
- string ParameterDesc (int pos);
- Parameter.Modifier ParameterModifier (int pos);
- string GetSignatureForError ();
- }
-
- public class ReflectionParameters : ParameterData {
- ParameterInfo [] pi;
- Type [] types;
- 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 (pi.Length == 0) {
- types = TypeManager.NoTypes;
- } else {
- types = new Type [pi.Length];
- for (int i = 0; i < pi.Length; i++)
- types [i] = pi [i].ParameterType;
- }
-
- 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 string GetSignatureForError ()
+ private ReferenceEquality ()
{
- StringBuilder sb = new StringBuilder ("(");
- for (int i = 0; i < pi.Length; ++i) {
- if (i != 0)
- sb.Append (", ");
- sb.Append (ParameterDesc (i));
- }
- if (is_varargs) {
- if (pi.Length > 0)
- sb.Append (", ");
- sb.Append ("__arglist");
- }
- sb.Append (')');
- return sb.ToString ();
}
- public Type ParameterType (int pos)
+ public bool Equals (T x, T y)
{
- 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;
- }
+ return ReferenceEquals (x, y);
}
- public string ParameterName (int pos)
+ public int GetHashCode (T obj)
{
- 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 System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode (obj);
}
+ }
- public string ParameterDesc (int pos)
+ class Tuple<T1, T2> : IEquatable<Tuple<T1, T2>>
+ {
+ public Tuple (T1 item1, T2 item2)
{
- 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).Replace ("&", ""));
-
- return sb.ToString ();
-
+ Item1 = item1;
+ Item2 = item2;
}
- public Parameter.Modifier ParameterModifier (int pos)
+ public T1 Item1 { get; private set; }
+ public T2 Item2 { get; private set; }
+
+ public override int GetHashCode ()
{
- 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|ParameterAttributes.In)) == ParameterAttributes.Out)
- return Parameter.Modifier.OUT;
- else
- return Parameter.Modifier.REF;
- }
-
- return Parameter.Modifier.NONE;
+ return Item1.GetHashCode () ^ Item2.GetHashCode ();
}
- public int Count {
- get {
- return is_varargs ? pi.Length + 1 : pi.Length;
- }
- }
+ #region IEquatable<Tuple<T1,T2>> Members
- public bool HasParams {
- get {
- return this.last_arg_is_params;
- }
+ public bool Equals (Tuple<T1, T2> other)
+ {
+ return EqualityComparer<T1>.Default.Equals (Item1, other.Item1) &&
+ EqualityComparer<T2>.Default.Equals (Item2, other.Item2);
}
- public Type[] Types {
- get {
- return types;
- }
- }
-
+ #endregion
}
- 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 Tuple
+ {
+ public static Tuple<T1, T2> Create<T1, T2> (T1 item1, T2 item2)
{
- comparer = PtrComparer.Instance;
+ return new Tuple<T1, T2> (item1, item2);
}
}
- /*
- * Hashtable whose keys are character arrays with the same length
- */
- class CharArrayHashtable : Hashtable {
- sealed class ArrComparer : IComparer {
- private int len;
+ public class Accessors {
+ public Accessor get_or_add;
+ public Accessor set_or_remove;
- 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;
- }
- }
+ // was 'set' declared before 'get'? was 'remove' declared before 'add'?
+ public bool declared_in_reverse;
- private int len;
-
- protected override int GetHash (Object key)
+ public Accessors (Accessor get_or_add, Accessor set_or_remove)
{
- 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);
- }
- }
-
- struct Pair {
- public object First;
- public object Second;
-
- public Pair (object f, object s)
- {
- First = f;
- Second = s;
+ this.get_or_add = get_or_add;
+ this.set_or_remove = set_or_remove;
}
}
/// <summary>
- /// This is a wrapper around StreamReader which is seekable backwards
- /// within a window of around 2048 chars.
+ /// 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
+ public class SeekableStreamReader : IDisposable
{
- public SeekableStreamReader (StreamReader reader)
+ const int buffer_read_length_spans = 3;
+
+ TextReader reader;
+ Stream stream;
+
+ static char[] buffer;
+ int average_read_length;
+ int buffer_start; // in chars
+ int char_count; // count buffer[] valid characters
+ int pos; // index into buffer[]
+
+ public SeekableStreamReader (Stream stream, Encoding encoding)
{
- this.reader = reader;
- this.buffer = new char [AverageReadLength * 3];
+ this.stream = stream;
- // Let the StreamWriter autodetect the encoder
- reader.Peek ();
+ const int default_average_read_length = 1024;
+ InitializeStream (default_average_read_length);
+ reader = new StreamReader (stream, encoding, true);
}
- public SeekableStreamReader (Stream stream, Encoding encoding)
- : this (new StreamReader (stream, encoding, true))
- { }
+ public void Dispose ()
+ {
+ // Needed to release stream reader buffers
+ reader.Dispose ();
+ }
- StreamReader reader;
+ void InitializeStream (int read_length_inc)
+ {
+ average_read_length += read_length_inc;
- private const int AverageReadLength = 1024;
+ int required_buffer_size = average_read_length * buffer_read_length_spans;
+ if (buffer == null || buffer.Length < required_buffer_size)
+ buffer = new char [required_buffer_size];
- char[] buffer;
- int buffer_start; // in chars
- int char_count; // count buffer[] valid characters
- int pos; // index into buffer[]
+ stream.Position = 0;
+ buffer_start = char_count = pos = 0;
+ }
/// <remarks>
/// This value corresponds to the current position in a stream of characters.
get { return buffer_start + pos; }
set {
- if (value < buffer_start || value > buffer_start + char_count)
- throw new InternalErrorException ("can't seek that far back: " + (pos - value));
+ // If the lookahead was too small, re-read from the beginning. Increase the buffer size while we're at it
+ if (value < buffer_start)
+ InitializeStream (average_read_length / 2);
+
+ while (value > buffer_start + char_count) {
+ pos = char_count;
+ if (!ReadBuffer ())
+ throw new InternalErrorException ("Seek beyond end of file: " + (buffer_start + char_count - value));
+ }
+
pos = value - buffer_start;
}
}
private bool ReadBuffer ()
{
int slack = buffer.Length - char_count;
- if (slack <= AverageReadLength / 2) {
- // shift the buffer to make room for AverageReadLength number of characters
- int shift = AverageReadLength - slack;
+ if (slack <= average_read_length / 2) {
+ // shift the buffer to make room for average_read_length number of characters
+ int shift = average_read_length - slack;
Array.Copy (buffer, shift, buffer, 0, char_count - shift);
pos -= shift;
char_count -= shift;
buffer_start += shift;
- slack += shift; // slack == AverageReadLength
+ slack += shift; // slack == average_read_length
}
- int chars_read = reader.Read (buffer, char_count, slack);
- char_count += chars_read;
+ char_count += reader.Read (buffer, char_count, slack);
return pos < char_count;
}
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;
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;
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;
}
}
}
+
+ public class UnixUtils {
+ [System.Runtime.InteropServices.DllImport ("libc", EntryPoint="isatty")]
+ extern static int _isatty (int fd);
+
+ public static bool isatty (int fd)
+ {
+ try {
+ return _isatty (fd) == 1;
+ } catch {
+ return false;
+ }
+ }
+ }
+
+ /// <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)
+ {
+ if (base_text == null)
+ throw new ArgumentNullException ("base_text");
+ this.base_text = base_text;
+
+ result = res;
+ Array.Sort (result);
+ }
+
+ public string [] Result {
+ get {
+ return result;
+ }
+ }
+
+ public string BaseText {
+ get {
+ return base_text;
+ }
+ }
+ }
}
projects / mono.git / blobdiff