File: CPU.cs

package info (click to toggle)
bearssl 0.6%2Bdfsg.1-4
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 4,484 kB
  • sloc: ansic: 49,044; cs: 3,473; sh: 524; makefile: 40
file content (181 lines) | stat: -rw-r--r-- 4,302 bytes parent folder | download | duplicates (3)
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
/*
 * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
 *
 * 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;

/*
 * Execution of code during compilation is done in a virtual CPU
 * incarnated by this class, that contains the relevant registers.
 *
 * Accesses to the data on the stack are mapped to accesses to an
 * internal array, with no explicit control on boundaries. Since the
 * internal array may be larger than the actual stack contents,
 * nonsensical accesses may still "work" to some extent. The whole
 * thing won't derail beyond the CLR VM, though.
 */

class CPU {

	/*
	 * Next instruction to execute is in ipBuf[ipOff].
	 */
	internal Opcode[] ipBuf;
	internal int ipOff;

	/*
	 * stackBuf and stackPtr implement the data stack. The system
	 * stack uses frames; 'rsp' points to the current top frame.
	 */
	TValue[] stackBuf;
	int stackPtr;
	Frame rsp;

	internal CPU()
	{
		stackBuf = new TValue[16];
		stackPtr = -1;
		rsp = null;
	}

	/*
	 * Enter a function, reserving space for 'numLocals' local variables.
	 */
	internal void Enter(Opcode[] code, int numLocals)
	{
		Frame f = new Frame(rsp, numLocals);
		rsp = f;
		f.savedIpBuf = ipBuf;
		f.savedIpOff = ipOff;
		ipBuf = code;
		ipOff = 0;
	}

	/*
	 * Exit the current function.
	 */
	internal void Exit()
	{
		ipBuf = rsp.savedIpBuf;
		ipOff = rsp.savedIpOff;
		rsp = rsp.upper;
	}

	/*
	 * Get the current stack depth (number of elements).
	 */
	internal int Depth {
		get {
			return stackPtr + 1;
		}
	}

	/*
	 * Pop a value from the stack.
	 */
	internal TValue Pop()
	{
		return stackBuf[stackPtr --];
	}

	/*
	 * Push a value on the stack.
	 */
	internal void Push(TValue v)
	{
		int len = stackBuf.Length;
		if (++ stackPtr == len) {
			TValue[] nbuf = new TValue[len << 1];
			Array.Copy(stackBuf, 0, nbuf, 0, len);
			stackBuf = nbuf;
		}
		stackBuf[stackPtr] = v;
	}

	/*
	 * Look at the value at depth 'depth' (0 is top of stack). The
	 * stack is unchanged.
	 */
	internal TValue Peek(int depth)
	{
		return stackBuf[stackPtr - depth];
	}

	/*
	 * Rotate the stack at depth 'depth': the value at that depth
	 * is moved to the top of stack.
	 */
	internal void Rot(int depth)
	{
		TValue v = stackBuf[stackPtr - depth];
		Array.Copy(stackBuf, stackPtr - (depth - 1),
			stackBuf, stackPtr - depth, depth);
		stackBuf[stackPtr] = v;
	}

	/*
	 * Inverse-rotate the stack at depth 'depth': the value at the
	 * top of stack is moved to that depth.
	 */
	internal void NRot(int depth)
	{
		TValue v = stackBuf[stackPtr];
		Array.Copy(stackBuf, stackPtr - depth,
			stackBuf, stackPtr - (depth - 1), depth);
		stackBuf[stackPtr - depth] = v;
	}

	/*
	 * Get the current contents of the local variable 'num'.
	 */
	internal TValue GetLocal(int num)
	{
		return rsp.locals[num];
	}

	/*
	 * Set the contents of the local variable 'num'.
	 */
	internal void PutLocal(int num, TValue v)
	{
		rsp.locals[num] = v;
	}

	/*
	 * The system stack really is a linked list of Frame instances.
	 */
	class Frame {

		internal Frame upper;
		internal Opcode[] savedIpBuf;
		internal int savedIpOff;
		internal TValue[] locals;

		internal Frame(Frame upper, int numLocals)
		{
			this.upper = upper;
			locals = new TValue[numLocals];
		}
	}
}