public LoadableCache(LoadableValue loadable_value, Type type, NameInfo name_info, bool must_unbox)
{
Value = loadable_value;
PossibleTypes = type;
NameInfo = name_info;
Types = AstTypeableNode.ClrTypeFromType(type);
NeedsUnbox = must_unbox;
}
internal System.Type[] GetIntrinsicRealTypes(AstNode node)
{
if (Intrinsics.ContainsKey(node))
{
return(AstTypeableNode.ClrTypeFromType(Intrinsics[node].Item1));
}
else if (Parent != null)
{
return(Parent.GetIntrinsicRealTypes(node));
}
throw new InvalidOperationException("There is no intrinsic type for the node requested. This a compiler bug.");
}
public override string CheckValidNarrowing(LookupCache next, LookupCache current)
{
if (current.Has(Source))
{
var parent_value = current[Source];
var union_type = AstTypeableNode.TypeFromClrType(parent_value.BackingType);
if ((union_type & Mask) == 0)
{
return(String.Format("Value for “{0}” must be to {1}, but it is {2}.", Name, Mask, union_type));
}
else
{
next[this] = parent_value;
return(null);
}
}
else
{
return(null);
}
}
internal void IntrinsicDispatch(Generator generator, AstNode node, LoadableValue original, LoadableValue source_reference, Generator.ParameterisedBlock <LoadableValue> block)
{
var intrinsic = Intrinsics[node];
if (!intrinsic.Item2)
{
block(original);
return;
}
var types = AstTypeableNode.ClrTypeFromType(intrinsic.Item1);
foreach (var type in types)
{
var next_label = generator.Builder.DefineLabel();
original.Load(generator);
generator.Builder.Emit(OpCodes.Isinst, type);
generator.Builder.Emit(OpCodes.Brfalse, next_label);
var builder = generator.Builder;
block(new AutoUnboxValue(original, type));
generator.Builder = builder;
generator.Builder.MarkLabel(next_label);
}
generator.EmitTypeError(source_reference, String.Format("Expected type {0} for {1}, but got {2}.", String.Join(" or ", from t in types select Stringish.NameForType(t)), node.PrettyName, "{0}"), original);
}
internal void GenerateLookupCache(Generator generator, IEnumerable <Tuple <RestrictableType, Generator.ParameterisedBlock <Generator.ParameterisedBlock <LoadableValue> > > > specials, LookupCache current, LoadableValue source_reference, LoadableValue context, LoadableValue self_frame, Block block)
{
generator.DebugPosition(this);
var lookup_results = new List <LoadableCache>();
if (specials != null)
{
var child_context = generator.MakeField("anon_ctxt", typeof(Context));
var child_frame = generator.MakeField("anon_frame", typeof(MutableFrame));
generator.Builder.Emit(OpCodes.Ldarg_0);
generator.LoadTaskMaster();
source_reference.Load(generator);
context.Load(generator);
self_frame.Load(generator);
generator.Builder.Emit(OpCodes.Newobj, typeof(MutableFrame).GetConstructors()[0]);
generator.Builder.Emit(OpCodes.Stfld, child_frame.Field);
generator.Builder.Emit(OpCodes.Ldarg_0);
child_frame.Load(generator.Builder);
context.Load(generator.Builder);
generator.Builder.Emit(OpCodes.Call, typeof(Context).GetMethod("Prepend", new[] { typeof(Frame), typeof(Context) }));
generator.Builder.Emit(OpCodes.Stfld, child_context.Field);
// Promote the context with the specials to proper status
context = child_context;
foreach (var entry in specials)
{
var next = generator.DefineState();
var field = generator.MakeField("special$" + entry.Item1.Name, typeof(object));
// The types that we might allow are a superset of the ones we
// might actually see. So, build a set of the ones we see.
Type known_types = 0;
entry.Item2(result => {
child_frame.Load(generator.Builder);
generator.Builder.Emit(OpCodes.Ldstr, entry.Item1.Name);
generator.LoadReboxed(result, typeof(object));
generator.Builder.Emit(OpCodes.Call, typeof(MutableFrame).GetMethod("Set", new[] { typeof(string), typeof(object) }));
generator.CopyField(result, field);
generator.JumpToState(next);
known_types |= AstTypeableNode.TypeFromClrType(result.BackingType);
});
generator.MarkState(next);
lookup_results.Add(new LoadableCache(field, entry.Item1.RestrictedType & known_types, entry.Item1, entry.Item1.MustUnbox));
}
}
var base_lookup_cache = new LookupCache(current);
var all_children = new List <NameInfo>();
foreach (var info in Children.Values)
{
if (info == null)
{
continue;
}
info.AddAll(all_children);
}
if (current != null)
{
string narrow_error = null;
foreach (var info in all_children)
{
var current_narrow_error = info.CheckValidNarrowing(base_lookup_cache, current);
if (narrow_error != null && current_narrow_error != null)
{
narrow_error = String.Format("{0}\n{1}", narrow_error, current_narrow_error);
}
else
{
narrow_error = narrow_error ?? current_narrow_error;
}
}
if (narrow_error != null)
{
generator.LoadTaskMaster();
source_reference.Load(generator);
generator.Builder.Emit(OpCodes.Ldstr, narrow_error);
generator.Builder.Emit(OpCodes.Callvirt, typeof(TaskMaster).GetMethod("ReportOtherError", new[] { typeof(SourceReference), typeof(string) }));
generator.Builder.Emit(OpCodes.Ldc_I4_0);
generator.Builder.Emit(OpCodes.Ret);
return;
}
}
var load_count = all_children.Sum(info => info.NeedsLoad(current) ? 1 : 0);
if (load_count > 0)
{
generator.StartInterlock(load_count);
lookup_results.AddRange(from info in all_children where info.NeedsLoad(current) select info.Load(generator, source_reference, context));
var state = generator.DefineState();
generator.SetState(state);
generator.DecrementInterlock(generator.Builder);
var end_label = generator.Builder.DefineLabel();
generator.Builder.Emit(OpCodes.Brfalse, end_label);
generator.Builder.Emit(OpCodes.Ldc_I4_0);
generator.Builder.Emit(OpCodes.Ret);
generator.Builder.MarkLabel(end_label);
generator.JumpToState(state);
generator.MarkState(state);
}
foreach (var lookup_result in lookup_results.Where(x => x.DirectCopy))
{
base_lookup_cache[lookup_result.NameInfo] = lookup_result.Value;
}
foreach (var lookup_result in lookup_results.Where(x => x.SinglyTyped && !x.DirectCopy))
{
base_lookup_cache[lookup_result.NameInfo] = new AutoUnboxValue(lookup_result.Value, lookup_result.Types[0]);
var label = generator.Builder.DefineLabel();
lookup_result.Value.Load(generator);
generator.Builder.Emit(OpCodes.Isinst, lookup_result.Types[0]);
generator.Builder.Emit(OpCodes.Brtrue, label);
generator.EmitTypeError(source_reference, String.Format("Expected type {0} for “{1}”, but got {2}.", Stringish.NameForType(lookup_result.Types[0]), lookup_result.NameInfo.Name, "{0}"), lookup_result.Value);
generator.Builder.MarkLabel(label);
}
var permutable_caches = lookup_results.Where(x => !x.SinglyTyped && !x.DirectCopy).ToArray();
var old_paths = generator.Paths;
generator.Paths = permutable_caches.Aggregate(old_paths, (acc, c) => acc * c.Types.Length);
if (generator.Paths > 200 && !combinatorial_explosion)
{
Console.Error.WriteLine("{0}:{1}:{2}-{3}:{4}: There are {5} type-derived flows in the generated code. This will be slow to compile.", FileName, StartRow, StartColumn, EndRow, EndColumn, generator.Paths);
combinatorial_explosion = true;
}
GenerateLookupPermutation(generator, context, base_lookup_cache, 0, permutable_caches, source_reference, block);
generator.Paths = old_paths;
}