File: ForwardDataFlowAnalysisBase.cs

package info (click to toggle)
mono-reference-assemblies 3.12.1%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 604,240 kB
  • ctags: 625,505
  • sloc: cs: 3,967,741; xml: 2,793,081; ansic: 418,042; java: 60,435; sh: 14,833; makefile: 11,576; sql: 7,956; perl: 1,467; cpp: 1,446; yacc: 1,203; python: 598; asm: 422; sed: 16; php: 1
file content (153 lines) | stat: -rw-r--r-- 4,411 bytes parent folder | download | duplicates (10)
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
// 
// ForwardDataFlowAnalysisBase.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.Collections.Generic;
using Mono.CodeContracts.Static.ControlFlow;
using Mono.CodeContracts.Static.DataStructures;

namespace Mono.CodeContracts.Static.DataFlowAnalysis {
	abstract class ForwardDataFlowAnalysisBase<AState> : DataFlowAnalysisBase<AState> {
		private readonly Dictionary<APC, AState> post_state = new Dictionary<APC, AState> ();

		protected ForwardDataFlowAnalysisBase (ICFG cfg) : base (cfg)
		{
		}

		public bool GetPreState (APC pc, out AState state)
		{
			bool noInfo;
			state = GetPreState (pc, default(AState), out noInfo);
			return !noInfo;
		}

		public AState GetPreStateWithDefault (APC apc, AState ifMissing)
		{
			bool noInfo;
			AState preState = GetPreState (apc, default(AState), out noInfo);
			return noInfo ? ifMissing : preState;
		}

		private AState GetPreState (APC apc, AState ifMissing, out bool noInfo)
		{
			Sequence<APC> rest = null;
			APC tmp = apc;
			APC singlePredecessor;
			AState state;
			bool weHaveState;
			while (!(weHaveState = this.JoinState.TryGetValue (tmp, out state)) &&
			       !RequiresJoining (tmp) && this.CFG.HasSinglePredecessor (tmp, out singlePredecessor)) {
				tmp = singlePredecessor;

				rest = rest.Cons (tmp);
			}

			if (!weHaveState) {
				noInfo = true;
				return ifMissing;
			}

			bool listWasNotEmpty = rest != null;
			while (rest != null) {
				if (IsBottom (rest.Head, state)) {
					noInfo = false;
					return state;
				}
				state = MutableVersion (state, rest.Head);
				state = Transfer (rest.Head, state);
				if (IsBottom (rest.Head, state)) {
					noInfo = false;
					return state;
				}

				rest = rest.Tail;
				if (rest != null)
					this.JoinState.Add (rest.Head, ImmutableVersion (state, rest.Head));
			}

			if (listWasNotEmpty)
				this.JoinState.Add (apc, ImmutableVersion (state, apc));

			noInfo = false;
			return state;
		}

		public bool GetPostState (APC apc, out AState result)
		{
			if (this.post_state.TryGetValue (apc, out result))
				return true;

			APC singleSuccessor;
			if (apc.Block.Count <= apc.Index)
				return GetPreState (apc, out result);

			if (this.CFG.HasSingleSuccessor (apc, out singleSuccessor) && !RequiresJoining (singleSuccessor))
				return GetPreState (singleSuccessor, out result);

			AState ifFound;
			if (!GetPreState (apc, out ifFound))
				return false;

			result = MutableVersion (ifFound, apc);
			result = Transfer (apc, result);

			this.post_state.Add (apc, result);
			return true;
		}

		public void Run (AState startState)
		{
			Initialize (this.CFG.Entry, startState);
			ComputeFixPoint ();
		}

		protected override int WorkingListComparer (APC a, APC b)
		{
			return b.Block.ReversePostOrderIndex - a.Block.ReversePostOrderIndex;
		}

		protected override bool RequiresJoining (APC pc)
		{
			return this.CFG.IsJoinPoint (pc);
		}

		protected override bool HasSingleSuccessor (APC pc, out APC next)
		{
			return this.CFG.HasSingleSuccessor (pc, out next);
		}

		protected override IEnumerable<APC> Successors (APC pc)
		{
			return this.CFG.Successors (pc);
		}

		protected override bool IsBackEdge (APC from, APC to)
		{
		    return CFG.IsForwardBackEdge (from, to);
		}
	}
}