File: EnsuresBlock.cs

package info (click to toggle)
mono 6.8.0.105%2Bdfsg-3.3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,284,512 kB
  • sloc: cs: 11,172,132; xml: 2,850,069; ansic: 671,653; cpp: 122,091; perl: 59,366; javascript: 30,841; asm: 22,168; makefile: 20,093; sh: 15,020; python: 4,827; pascal: 925; sql: 859; sed: 16; php: 1
file content (215 lines) | stat: -rw-r--r-- 7,061 bytes parent folder | download | duplicates (9)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
// 
// EnsuresBlock.cs
// 
// Authors:
// 	Alexander Chebaturkin (chebaturkin@gmail.com)
// 
// Copyright (C) 2011 Alexander Chebaturkin
// 
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
// 
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//  
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
// 

using System;
using System.Collections.Generic;
using Mono.CodeContracts.Static.AST;
using Mono.CodeContracts.Static.AST.Visitors;
using Mono.CodeContracts.Static.ControlFlow.Subroutines;
using Mono.CodeContracts.Static.DataStructures;

namespace Mono.CodeContracts.Static.ControlFlow.Blocks {
	class EnsuresBlock<Label> : BlockWithLabels<Label> {
		private const uint Mask = 0xC0000000u;
		private const uint BeginOldMask = 0x80000000u;
		private const uint EndOldMask = 0x40000000u;

		private List<uint> overridingLabels;

		public EnsuresBlock (SubroutineBase<Label> subroutine, ref int idGen)
			: base (subroutine, ref idGen)
		{
		}

		private new EnsuresSubroutine<Label> Subroutine
		{
			get { return (EnsuresSubroutine<Label>) base.Subroutine; }
		}

		public override int Count
		{
			get
			{
				if (this.overridingLabels != null)
					return this.overridingLabels.Count;
				return base.Count;
			}
		}

		public bool UsesOverriding
		{
			get { return this.overridingLabels != null; }
		}

		public override bool TryGetLabel (int index, out Label label)
		{
			int originalOffset;
			if (IsOriginal (index, out originalOffset))
				return base.TryGetLabel (originalOffset, out label);
			label = default(Label);
			return false;
		}

		public Result OriginalForwardDecode<Data, Result, Visitor> (int index, Visitor visitor, Data data)
			where Visitor : IAggregateVisitor<Label, Data, Result>
		{
			Label label;
			if (base.TryGetLabel (index, out label))
				return Subroutine.CodeProvider.Decode<Visitor, Data, Result> (label, visitor, data);

			throw new InvalidOperationException ("should not happen");
		}

		public override Result ForwardDecode<Data, Result, Visitor> (APC pc, Visitor visitor, Data data)
		{
			Label label;
			if (TryGetLabel (pc.Index, out label))
				return base.ForwardDecode<Data, Result, Visitor> (pc, visitor, data);

			int endOldIndex;
			if (IsBeginOld (pc.Index, out endOldIndex)) {
				CFGBlock block = Subroutine.InferredBeginEndBijection (pc);
				return visitor.BeginOld (pc, new APC (block, endOldIndex, pc.SubroutineContext), data);
			}

			int beginOldIndex;
			if (IsEndOld (pc.Index, out beginOldIndex)) {
				TypeNode endOldType;
				CFGBlock block = Subroutine.InferredBeginEndBijection (pc, out endOldType);
				return visitor.EndOld (pc, new APC (block, beginOldIndex, pc.SubroutineContext), endOldType, Dummy.Value, Dummy.Value, data);
			}

			return visitor.Nop (pc, data);
		}

		private bool IsEndOld (int index, out int beginOldIndex)
		{
			if (this.overridingLabels != null && index < this.overridingLabels.Count && (this.overridingLabels [index] & EndOldMask) != 0) {
				beginOldIndex = (int) (this.overridingLabels [index] & (EndOldMask - 1));
				return true;
			}

			beginOldIndex = 0;
			return false;
		}

		private bool IsBeginOld (int index, out int endOldIndex)
		{
			if (this.overridingLabels != null && index < this.overridingLabels.Count && (this.overridingLabels [index] & BeginOldMask) != 0) {
				endOldIndex = (int) (this.overridingLabels [index] & (EndOldMask - 1));
				return true;
			}

			endOldIndex = 0;
			return false;
		}

		private bool IsOriginal (int index, out int originalOffset)
		{
			if (this.overridingLabels == null) {
				originalOffset = index;
				return true;
			}
			if (index < this.overridingLabels.Count && (this.overridingLabels [index] & Mask) == 0) {
				originalOffset = (int) (this.overridingLabels [index] & (EndOldMask - 1));
				return true;
			}

			originalOffset = 0;
			return false;
		}

		public void StartOverridingLabels ()
		{
			this.overridingLabels = new List<uint> ();
		}

		public void BeginOld (int index)
		{
			if (this.overridingLabels == null) {
				StartOverridingLabels ();
				for (int i = 0; i < index; ++i)
					this.overridingLabels.Add ((uint) i);
			}
			this.overridingLabels.Add (BeginOldMask);
		}

		public void AddInstruction (int index)
		{
			this.overridingLabels.Add ((uint) index);
		}

		public void EndOld (int index, TypeNode nextEndOldType)
		{
			AddInstruction (index);
			EndOldWithoutInstruction (nextEndOldType);
		}

		public void EndOldWithoutInstruction (TypeNode nextEndOldType)
		{
			int endOldIndex = this.overridingLabels.Count;
			CFGBlock beginBlock;
			this.overridingLabels.Add ((uint) (EndOldMask | PatchPriorBeginOld (this, endOldIndex, out beginBlock)));
			Subroutine.AddInferredOldMap (this.Index, endOldIndex, beginBlock, nextEndOldType);
		}

		private int PatchPriorBeginOld (CFGBlock endBlock, int endOldIndex, out CFGBlock beginBlock)
		{
			for (int i = this == endBlock ? endOldIndex - 2 : Count - 1; i >= 0; i--) {
				int endOldI;
				if (IsBeginOld (i, out endOldI)) {
					this.overridingLabels [i] = BeginOldMask | (uint)endOldIndex;
					beginBlock = this;
					Subroutine.AddInferredOldMap (this.Index, i, endBlock, default(TypeNode));
					return i;
				}
			}

			IEnumerator<CFGBlock> enumerator = Subroutine.PredecessorBlocks (this).GetEnumerator ();
			if (!enumerator.MoveNext ())
				throw new InvalidOperationException ("missing begin_old");
			int result = PatchPriorBeginOld (endBlock, endOldIndex, enumerator.Current, out beginBlock);
			enumerator.MoveNext ();
			return result;
		}

		private int PatchPriorBeginOld (CFGBlock endBlock, int endOldIndex, CFGBlock current, out CFGBlock beginBlock)
		{
			var ensuresBlock = current as EnsuresBlock<Label>;
			if (ensuresBlock != null)
				return ensuresBlock.PatchPriorBeginOld (endBlock, endOldIndex, out beginBlock);
			IEnumerator<CFGBlock> enumerator = current.Subroutine.PredecessorBlocks (current).GetEnumerator ();
			if (!enumerator.MoveNext ())
				throw new InvalidOperationException ("missing begin_old");

			int result = PatchPriorBeginOld (endBlock, endOldIndex, enumerator.Current, out beginBlock);
			enumerator.MoveNext ();
			return result;
		}
	}
}