//
// Copyright 2001 Ximian, Inc (http://www.ximian.com)
// Copyright 2003-2009 Novell, Inc
+// Copyright 2011 Xamarin Inc
//
using System;
using System.IO;
using System.Text;
-using System.Reflection;
-using System.Reflection.Emit;
-using System.Globalization;
using System.Collections.Generic;
namespace Mono.CSharp {
return System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode (obj);
}
}
-
- class Tuple<T1, T2> : IEquatable<Tuple<T1, T2>>
+#if !NET_4_0 && !MONODROID
+ public class Tuple<T1, T2> : IEquatable<Tuple<T1, T2>>
{
public Tuple (T1 item1, T2 item2)
{
#endregion
}
+ public class Tuple<T1, T2, T3> : IEquatable<Tuple<T1, T2, T3>>
+ {
+ public Tuple (T1 item1, T2 item2, T3 item3)
+ {
+ Item1 = item1;
+ Item2 = item2;
+ Item3 = item3;
+ }
+
+ public T1 Item1 { get; private set; }
+ public T2 Item2 { get; private set; }
+ public T3 Item3 { get; private set; }
+
+ public override int GetHashCode ()
+ {
+ return Item1.GetHashCode () ^ Item2.GetHashCode () ^ Item3.GetHashCode ();
+ }
+
+ #region IEquatable<Tuple<T1,T2>> Members
+
+ public bool Equals (Tuple<T1, T2, T3> other)
+ {
+ return EqualityComparer<T1>.Default.Equals (Item1, other.Item1) &&
+ EqualityComparer<T2>.Default.Equals (Item2, other.Item2) &&
+ EqualityComparer<T3>.Default.Equals (Item3, other.Item3);
+ }
+
+ #endregion
+ }
+
static class Tuple
{
public static Tuple<T1, T2> Create<T1, T2> (T1 item1, T2 item2)
{
return new Tuple<T1, T2> (item1, item2);
}
+
+ public static Tuple<T1, T2, T3> Create<T1, T2, T3> (T1 item1, T2 item2, T3 item3)
+ {
+ return new Tuple<T1, T2, T3> (item1, item2, item3);
+ }
+ }
+#endif
+
+ static class ArrayComparer
+ {
+ public static bool IsEqual<T> (T[] array1, T[] array2)
+ {
+ if (array1 == null || array2 == null)
+ return array1 == array2;
+
+ var eq = EqualityComparer<T>.Default;
+
+ for (int i = 0; i < array1.Length; ++i) {
+ if (!eq.Equals (array1[i], array2[i])) {
+ return false;
+ }
+ }
+
+ return true;
+ }
}
/// <summary>
/// </summary>
public class SeekableStreamReader : IDisposable
{
- const int buffer_read_length_spans = 3;
-
- TextReader reader;
+ public const int DefaultReadAheadSize =
+#if FULL_AST
+ 65536 / 2; // Large buffer because of ReadChars of large literal string
+#else
+ 4096 / 2;
+#endif
+
+ StreamReader reader;
Stream stream;
- static char[] buffer;
- int average_read_length;
+ char[] buffer;
+ int read_ahead_length; // the length of read buffer
int buffer_start; // in chars
- int char_count; // count buffer[] valid characters
+ int char_count; // count of filled characters in buffer[]
int pos; // index into buffer[]
- public SeekableStreamReader (Stream stream, Encoding encoding)
+ public SeekableStreamReader (Stream stream, Encoding encoding, char[] sharedBuffer = null)
{
this.stream = stream;
+ this.buffer = sharedBuffer;
- const int default_average_read_length = 1024;
- InitializeStream (default_average_read_length);
+ InitializeStream (DefaultReadAheadSize);
reader = new StreamReader (stream, encoding, true);
}
void InitializeStream (int read_length_inc)
{
- average_read_length += read_length_inc;
+ read_ahead_length += read_length_inc;
+
+ int required_buffer_size = read_ahead_length * 2;
- 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];
- stream.Position = 0;
+ stream.Position = 0;
buffer_start = char_count = pos = 0;
}
/// a correlation between them.
/// </remarks>
public int Position {
- get { return buffer_start + pos; }
+ get {
+ return buffer_start + pos;
+ }
set {
- // 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);
+ //
+ // 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;
}
}
- private bool ReadBuffer ()
+ bool ReadBuffer ()
{
int slack = buffer.Length - char_count;
- 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;
+
+ //
+ // 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; // slack == average_read_length
+ 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 ()
{
if ((pos >= char_count) && !ReadBuffer ())
}
}
- 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;
- }
- }
- }
-
public class UnixUtils {
[System.Runtime.InteropServices.DllImport ("libc", EntryPoint="isatty")]
extern static int _isatty (int fd);
}
}
}
+
+ struct TypeNameParser
+ {
+ internal static string Escape(string name)
+ {
+ if (name == null) {
+ return null;
+ }
+ StringBuilder sb = null;
+ for (int pos = 0; pos < name.Length; pos++) {
+ char c = name[pos];
+ switch (c) {
+ case '\\':
+ case '+':
+ case ',':
+ case '[':
+ case ']':
+ case '*':
+ case '&':
+ if (sb == null) {
+ sb = new StringBuilder(name, 0, pos, name.Length + 3);
+ }
+ sb.Append("\\").Append(c);
+ break;
+ default:
+ if (sb != null) {
+ sb.Append(c);
+ }
+ break;
+ }
+ }
+ return sb != null ? sb.ToString() : name;
+ }
+ }
}
projects / mono.git / blobdiff