New canvas based display.

EhBASIC/basic-v6502.asm

@@ -420,7 +420,7 @@ LAB_SKFE		= LAB_STAK+$FE
 LAB_SKFF		= LAB_STAK+$FF
 					; flushed stack address
 
-ccflag		= $1200	; BASIC CTRL-C flag, 00 = enabled, 01 = dis
+ccflag		= $0200	; BASIC CTRL-C flag, 00 = enabled, 01 = dis
 ccbyte		= ccflag+1	; BASIC CTRL-C byte
 ccnull		= ccbyte+1	; BASIC CTRL-C byte timeout
 
@@ -437,13 +437,13 @@ Ibuffs		= IRQ_vec+$14
 					; start of input buffer after IRQ/NMI code
 Ibuffe		= Ibuffs+$47; end of input buffer
 
-Ram_base		= $1300	; start of user RAM (set as needed, should be page aligned)
+Ram_base		= $0300	; start of user RAM (set as needed, should be page aligned)
-Ram_top		= $B700	; end of user RAM+1 (set as needed, should be page aligned)
+Ram_top		= $C700	; end of user RAM+1 (set as needed, should be page aligned)
 
 ; This start can be changed to suit your system
 
-	.dsb	($B700-*),0		; pad to new PC with zeros
+	.dsb	($C700-*),0		; pad to new PC with zeros
-	*=	$B700
+	*=	$C700
 
 ; BASIC cold start entry point
 
@@ -498,6 +498,12 @@ TabLoop
 	STA	g_step		; save it
 	LDX	#des_sk		; descriptor stack start
 	STX	next_s		; set descriptor stack pointer
+	
+	; Memory Hack.  Don't ask us the size.  Just do it.
+	LDA	#$00		; get temporary integer low byte
+	LDY	#$C7		; get temporary integer high byte
+	JMP LAB_2DB6
+	
 	JSR	LAB_CRLF		; print CR/LF
 	LDA	#<LAB_MSZM		; point to memory size message (low addr)
 	LDY	#>LAB_MSZM		; point to memory size message (high addr)
@@ -544,8 +550,8 @@ LAB_2DAA
 					; (no range check)
 
 LAB_2DB6
-	LDA	Itempl		; get temporary integer low byte
+;	LDA	Itempl		; get temporary integer low byte
-	LDY	Itemph		; get temporary integer high byte
+;	LDY	Itemph		; get temporary integer high byte
 	CPY	#<Ram_base+1	; compare with start of RAM+$100 high byte
 	BCC	LAB_GMEM		; if too small go try again
 
@@ -8701,8 +8707,8 @@ NMI_vec	= IRQ_vec+$0A	; NMI code vector
 ; and wait for the user to select [C]old or [W]arm start. nothing else
 ; fits in less than 128 bytes
 
-	.dsb	($FF00-*),0		; pad to new PC with zeros
+;	.dsb	($EF80-*),0		; pad to new PC with zeros
-	*=	$FF00			; (Was $FF80) pretend this is in a 1/8K ROM
+;	*=	$EF80			; (Was $FF80) pretend this is in a 1/8K ROM
 
 ; reset vector points here
 
@@ -8723,45 +8729,45 @@ LAB_stlp
 ; now do the signon message, Y = $00 here
 
 LAB_signon
-	LDA	LAB_mess,Y		; get byte from sign on message
+;	LDA	LAB_mess,Y		; get byte from sign on message
-	BEQ	LAB_nokey		; exit loop if done
+;	BEQ	LAB_nokey		; exit loop if done
 
-	JSR	V_OUTP		; output character
+;	JSR	V_OUTP		; output character
-	INY				; increment index
+;	INY				; increment index
-	BNE	LAB_signon		; loop, branch always
+;	BNE	LAB_signon		; loop, branch always
 
-LAB_nokey
+;LAB_nokey
-	JSR	V_INPT		; call scan input device
+;	JSR	V_INPT		; call scan input device
-	BCC	LAB_nokey		; loop if no key
+;	BCC	LAB_nokey		; loop if no key
 
-	AND	#$DF			; mask xx0x xxxx, ensure upper case
+;	AND	#$DF			; mask xx0x xxxx, ensure upper case
-	CMP	#'W'			; compare with [W]arm start
+;	CMP	#'W'			; compare with [W]arm start
-	BEQ	LAB_dowarm		; branch if [W]arm start
+;	BEQ	LAB_dowarm		; branch if [W]arm start
 
-	CMP	#'C'			; compare with [C]old start
+;	CMP	#'C'			; compare with [C]old start
-	BNE	RES_vec		; loop if not [C]old start
+;	BNE	RES_vec		; loop if not [C]old start
 
 	JMP	LAB_COLD		; do EhBASIC cold start
 
-LAB_dowarm
+;LAB_dowarm
-	JMP	LAB_WARM		; do EhBASIC warm start
+;	JMP	LAB_WARM		; do EhBASIC warm start
 
 ; byte out
 
 ByteOut
-	STA	$efa0		; save byte to data port
+	STA	$ffa0		; save byte to data port
-	LDA	$07		; write to screen command
+	LDA	#7		; write to screen command
-	STA	$efa1		; save command to command port
+	STA	$ffa1		; save command to command port
 	RTS
 
 ; byte in
 
 ByteIn
-	LDA	$efa2			; get byte from keyboard
+	LDA	$fff6			; get byte from keyboard
 	BEQ	LAB_nobyw		; branch if no byte waiting
 	PHA
-	LDA	0
+	LDA	#0
-	STA	$efa2
+	STA	$fff6
 	PLA
 
 	SEC				; flag byte received
@@ -8805,8 +8811,8 @@ NMI_CODE
 
 END_CODE
 
-LAB_mess
+;LAB_mess
-	.byte	$0D,$0A,"6502 EhBASIC [C]old/[W]arm ?",$00
+;	.byte	$0D,$0A,"6502 EhBASIC [C]old/[W]arm ?",$00
 					; sign on string
 
 ; system vectors

EhBASIC/build.sh

@@ -2,6 +2,6 @@
 
 BASE=basic-v6502
 
-../../xa-2.3.5/xa -M -e $BASE.error.txt -l $BASE.label.txt -o $BASE.out $BASE.asm
+../xa-2.3.5/xa -M -e $BASE.error.txt -l $BASE.label.txt -o $BASE.out $BASE.asm
-../../vm/65b2js/Debug/65b2js $BASE.out > $BASE.js
+../65b2js $BASE.out > $BASE.js
-cp $BASE.js ../../vm/Virtual\ Computer/software/.
+cp $BASE.js ../vm/software/.

vm/README.txt

@@ -36,22 +36,21 @@ Notes:
 
 Memory Map:
 
-  MM_IRQ_VECTOR         = 0xfffe
+  MM_IRQ_VECTOR         = 0xfffe;
-  MM_RESET_VECTOR       = 0xfffc
+  MM_RESET_VECTOR       = 0xfffc;
-  MM_NMI_VECTOR         = 0xfffa
+  MM_NMI_VECTOR         = 0xfffa;
-  MM_ROM_END            = 0xfff9
+  MM_CLOCK              = 0xfff9;
-  MM_ROM_START          = 0xf000
+  MM_PRNG               = 0xfff8;
-  MM_CLOCK              = 0xefa5
+  MM_KEYBOARD_META      = 0xfff7;
-  MM_PRNG               = 0xefa4
+  MM_KEYBOARD_CHARACTER = 0xfff6;
-  MM_KEYBOARD_META      = 0xefa3
+  MM_DISPLAY_COMMAND    = 0xffa1;
-  MM_KEYBOARD_CHARACTER = 0xefa2
+  MM_DISPLAY_DATA       = 0xffa0;
-  MM_DISPLAY_COMMAND    = 0xefa1
+  MM_DISPLAY_ADAPTER    = 0xf000;
-  MM_DISPLAY_DATA       = 0xefa0
+  MM_HEAP_END           = 0xefff;
-  MM_DISPLAY_ADAPTER    = 0xe000
+  MM_HEAP_START         = 0x0200;
-  MM_HEAP_END           = 0xdfff
+  MM_STACK              = 0x0100;
-  MM_CODE_START         = 0x0200
+  MM_ZERO_PAGE          = 0x0000;
-  MM_STACK              = 0x0100
+
-  MM_ZERO_PAGE          = 0x0000
 
 Display Adapter:
 
@@ -131,7 +130,20 @@ simple timing operations and not actual "wall clock" time keeping.
 
 Code Start:
 
-By default, when the CPU starts, anything located at MM_CODE_START will be
+By default, when the CPU starts, it begins executing the code pointed to
-executed.  If you wish to relocate your code, either place a JMP at this
+by the reset vector.  This address must be filled in before calling cpu.reset.
-address or in "machine.js" change the default PC value in the call to
+
-"cpu.attach()".
+---
+
+NOTES:
+
+Abstraction with util.js is poor.  Same with memory map.
+Video display sucks.
+- Needs real graphics.
+- Needs to parse special symbols in strings to clear screen, set colors, move cursor, bell, etc.
+Save / Load machine snapshots.
+Sound.
+Networking?
+128k?
+
+640x400

vm/computer/clock.js

@@ -22,21 +22,24 @@ function clock() {
 
 	// --- Private variables.
 
-	// Memory location for PRNG value.
+	// Memory location for clock value.
 	var MEMORY            = null;
 	var MEMORY_START      = 0;
 	var CLOCK_ADDRESS     = 0;
 
 	// Clock values.
-	var MILLISECONDS = 0;
+	var MILLISECONDS  = 0;
-	var CLOCK        = 0;
+	var CLOCK         = 0;
+	var CLOCK_RUNNING = true;
 
 	
 	// --- Private methods.
 	
 	var clockTick = function() {
-		MEMORY.writeByte(CLOCK_ADDRESS, CLOCK++);
+		if (CLOCK_RUNNING) {
-		if (CLOCK > 255) CLOCK = 0;
+			MEMORY.writeByte(CLOCK_ADDRESS, CLOCK++);
+			if (CLOCK > 255) CLOCK = 0;
+		}
 		setTimeout(function(){
 			clockTick();
 		}, MILLISECONDS);
@@ -53,5 +56,31 @@ function clock() {
 		MILLISECONDS  = newMilliseconds;
 		clockTick();
 	};
+
+	// Deserialize clock state.
+	this.deserialize = function(state) {
+		CLOCK = state.C;
+		CLOCK_RUNNING = state.R;
+	};
 	
+	// Pause the clock.
+	this.pause = function() {
+		console.log("Pausing Clock.");
+		CLOCK_RUNNING = false;
+	};
+
+	// Start the clock.
+	this.run = function() {
+		console.log("Starting Clock.");
+		CLOCK_RUNNING = true;
+	};
+	
+	// Serialize clock state.
+	this.serialize = function() {
+		var state = {
+			C: CLOCK,
+			R: CLOCK_RUNNING
+		};
+		return state;
+	};
 }

vm/computer/keyboard.js

@@ -1,17 +1,17 @@
 /*
- * 	6502 Based Virtual Computer
+ * 6502 Based Virtual Computer
  *	Copyright (C) 2011  Scott C. Duensing <scott@jaegertech.com>
- *	
+ *
  *	This program is free software; you can redistribute it and/or modify
  *	it under the terms of the GNU General Public License as published by
  *	the Free Software Foundation; either version 2 of the License, or
  *	(at your option) any later version.
- *	
+ *
  *	This program is distributed in the hope that it will be useful,
  *	but WITHOUT ANY WARRANTY; without even the implied warranty of
  *	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  *	GNU General Public License for more details.
- *	
+ *
  *	You should have received a copy of the GNU General Public License along
  *	with this program; if not, write to the Free Software Foundation, Inc.,
  *	51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
@@ -19,9 +19,9 @@
 
 // Our keyboard object.
 function keyboard() {
-	
+
 	// OMFGWTFBBQ - http://unixpapa.com/js/key.html
-	
+
 	// --- Private variables.
 
 	// Memory location for keyboard status.
@@ -29,54 +29,7 @@ function keyboard() {
 	var MEMORY_START      = 0;
 	var CHARACTER_ADDRESS = 0;
 	var META_ADDRESS      = 0;
-	
+	var RUNNING           = false;
-	// Keymaps.  Swiped from http://jonathan.tang.name/code/js_keycode
-	var KEY_MAP         = {};
-	var SHIFTED_SYMBOLS = {
-		58: 59,     // : -> ;
-		43: 61,     // = -> +
-		60: 44,     // < -> ,
-		95: 45,     // _ -> -
-		62: 46,     // > -> .
-		63: 47,     // ? -> /
-		96: 192,    // ` -> ~
-		124: 92,    // | -> \
-		39: 222,    // ' -> 222
-		34: 222,    // " -> 222
-		33: 49,     // ! -> 1
-		64: 50,     // @ -> 2
-		35: 51,     // # -> 3
-		36: 52,     // $ -> 4
-		37: 53,     // % -> 5
-		94: 54,     // ^ -> 6
-		38: 55,     // & -> 7
-		42: 56,     // * -> 8
-		40: 57,     // ( -> 9
-		41: 58,     // ) -> 0
-		123: 91,    // { -> [
-		125: 93     // } -> ]
-	};
-	var GECKO_IE_KEYMAP = {
-		186: 59, // ;: in IE
-		187: 61, // =+ in IE
-		188: 44, // ,<
-		109: 95, // -_ in Mozilla
-		107: 61, // =+ in Mozilla
-		189: 95, // -_ in IE
-		190: 62, // .>
-		191: 47, // /?
-		192: 126, // `~
-		219: 91, // {[
-		220: 92, // \|
-		221: 93 // }]
-	};
-	var OPERA_KEYMAP = {};
-	
-	// Browser detection taken from quirksmode.org
-	var IS_WINDOWS   = navigator.platform.indexOf('Win') != -1;
-	var IS_OPERA     = window.opera && window.opera.version() < '9.5';
-	var IS_KONQUEROR = navigator.vendor && navigator.vendor.indexOf('KDE') != -1;
-	var IS_ICAB      = navigator.vendor && navigator.vendor.indexOf('iCab') != -1;
 
 
 	// --- Public methods.
@@ -87,65 +40,67 @@ function keyboard() {
 		MEMORY_START = newStartPosition;
 		CHARACTER_ADDRESS = MEMORY_START;
 		META_ADDRESS      = MEMORY_START + 1;
-		// Determine key map.  
+	};
-		if (IS_OPERA && IS_WINDOWS) {
+
-			KEY_MAP = OPERA_KEYMAP;
+	// Keyboard handler for use with Meteor.
-		} else if (IS_OPERA || IS_KONQUEROR || IS_ICAB) {
+	this.handleEvent = function(event) {
-			var unshift = [33, 64, 35, 36, 37, 94, 38, 42, 40, 41, 
+		// Process the key press.
-			               58, 43, 60, 95, 62, 63, 124, 34];
+		var code = event.which || window.event.keyCode;
-			KEY_MAP = OPERA_KEYMAP;
+		var k = {
-			for (var i = 0; i < unshift.length; ++i) {
+			code:  code,
-				KEY_MAP[unshift[i]] = SHIFTED_SYMBOLS[unshift[i]];
+			shift: event.shiftKey,
-			}
+			alt:   event.altKey,
-		} else {
+			ctrl:  event.ctrlKey
-			// IE and Gecko are close enough that we can use the same map for both,
+		};
-			// and the rest of the world (eg. Opera 9.50) seems to be standardizing
+		var processIt = false;
-			// on them
+		if (event.type == "keydown") {
-			KEY_MAP = GECKO_IE_KEYMAP;
+			if ((code == 8) ||
+				(code ==  9) ||
+				(code == 27))
+					processIt = true;
 		}
-		if (IS_KONQUEROR) {
+		if (event.type == "keypress") {
-			KEY_MAP[0] = 45;
+			processIt = true;
-			KEY_MAP[127] = 46;
-			KEY_MAP[45] = 95;
 		}
-		// Hook browser for keydown events.
+		//console.log(code + " " + event.type + " " + processIt);
-		document.onkeydown = function(e){
+		if (processIt) {
-	        e = e || window.event;
-			// Process the key press.
-			var code = e.which || e.keyCode;
-			var k = {
-				code:  KEY_MAP[code] || code,
-				shift: e.shiftKey,
-				alt:   e.altKey,
-				ctrl:  e.ctrlKey
-			};
-			// Un-funk the input.
-			if (k.shift) {
-				// Fix shifted characters.
-				var oldC = "1234567890,/=[]\\';";
-				var newC = "!@#$%^&*()<?+{}|\":";
-				var x = oldC.indexOf(String.fromCharCode(k.code));
-				if (x >= 0) k.code = newC.charCodeAt(x);
-				if (k.code == 222) k.code = 34;  // "
-			} else {
-				// Fix unshifted characters.
-				var oldC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ~_>";
-				var newC = "abcdefghijklmnopqrstuvwxyz`-.";
-				var x = oldC.indexOf(String.fromCharCode(k.code));
-				if (x >= 0) k.code = newC.charCodeAt(x);
-				if (k.code == 222) k.code = 39;  // '
-			}
 			// Write meta first.  Then we can process on the character being written.
 			MEMORY.writeByte(META_ADDRESS, (k.alt * 4) + (k.ctrl * 2) + k.shift);
 			// Ignore "naked" meta keys in the character address.
 			if ((k.code != 16) && (k.code != 17) && (k.code != 18) && (k.code != 145) && (k.code != 146)) {
 				MEMORY.writeByte(CHARACTER_ADDRESS, k.code);
 			}
-		};
+		}
+		return !processIt;
+	};
+
+	// Deserialize keyboard state.
+	this.deserialize = function(state) {
+		RUNNING = state.R;
 	};
 
 	// Fetch how much RAM the current settings will require.
 	this.getMemoryNeeded = function() {
 		return 2; // Complicated, huh?
 	};
+
+	// Pause the keyboard.
+	this.pause = function() {
+		console.log("Pausing Keyboard.");
+		RUNNING = false;
+	};
+
+	// Start the keyboard.
+	this.run = function() {
+		console.log("Starting Keyboard.");
+		RUNNING = true;
+	};
+
+	// Serialize keyboard state.
+	this.serialize = function() {
+		var state = {
+			R: RUNNING
+		};
+		return state;
+	};
 }

vm/computer/prng.js

@@ -22,6 +22,9 @@ function prng() {
 
 	// --- Private variables.
 
+	var MAX               = Math.pow(2, 32);
+	var SEED              = Math.round(Math.random() * MAX);
+
 	// Memory location for PRNG value.
 	var MEMORY            = null;
 	var MEMORY_START      = 0;
@@ -32,13 +35,31 @@ function prng() {
 
 	// Attach PRNG to DOM.
 	this.attach = function(newMemory, newStartPosition) {
+		// We create our own PRN to ensure recreatability between sessions and browsers.
+		// http://weblog.bocoup.com/random-numbers/   https://gist.github.com/Protonk/5367430
 		MEMORY       = newMemory;
 		MEMORY_START = newStartPosition;
 		PRNG_ADDRESS = MEMORY_START;
+		LAST_RANDOM  = Math.random();
 		MEMORY.addReadCallback(PRNG_ADDRESS, PRNG_ADDRESS, null, function(address, value, data){
-			// On read, change the random value.
+			// On read, change the random value.  Based on WebKit2's invertible mapping generator.
-			MEMORY.writeByte(address, Math.floor(Math.random() * 256));
+			SEED += (SEED * SEED) | 5;
+			var value = (SEED >>> 32) / MAX;
+			MEMORY.writeByte(address, Math.floor(value * 256));
 		});
 	};
 	
+	// Deserialize PRNG state.
+	this.deserialize = function(state) {
+		SEED = state.S;
+	};
+
+	// Serialize PRNG state.
+	this.serialize = function() {
+		var state = {
+			S: SEED
+		};
+		return state;
+	};
+
 }

vm/computer/ram.js

@@ -1,17 +1,17 @@
 /*
  * 	6502 Based Virtual Computer
  *	Copyright (C) 2011  Scott C. Duensing <scott@jaegertech.com>
- *	
+ *
  *	This program is free software; you can redistribute it and/or modify
  *	it under the terms of the GNU General Public License as published by
  *	the Free Software Foundation; either version 2 of the License, or
  *	(at your option) any later version.
- *	
+ *
  *	This program is distributed in the hope that it will be useful,
  *	but WITHOUT ANY WARRANTY; without even the implied warranty of
  *	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  *	GNU General Public License for more details.
- *	
+ *
  *	You should have received a copy of the GNU General Public License along
  *	with this program; if not, write to the Free Software Foundation, Inc.,
  *	51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
@@ -19,17 +19,17 @@
 
 // Memory
 function ram(newSize) {
-	
+
 	// --- Private Types.
-	
+
 	function T_EVENT() {
 		this.callback     = null;
 		this.startAddress = 0;
 		this.endAddress   = 0;
 		this.anyData      = null;
 	};
-	
+
-	
+
 	// --- Private variables.
 
 	var MEMORY                 = new Array(newSize);
@@ -37,8 +37,27 @@ function ram(newSize) {
 	var READ_EVENTS            = new Array();
 	var EVENTS_ENABLED         = true;
 	var EVENTS_ENABLED_COUNTER = 0;
-	
+	var CANVAS_HEIGHT          = 0;
-	
+	var CANVAS_WIDTH           = 0;
+	var CANVAS_DATA            = null;
+	var CANVAS_CONTEXT         = null;
+
+
+	// --- Private methods.
+
+	var drawByte = function(location, value) {
+		var index = (MEMORY.length - location) * 4;
+		CANVAS_DATA.data[index]     = value;
+		CANVAS_DATA.data[index + 1] = value;
+		CANVAS_DATA.data[index + 2] = value;
+		CANVAS_DATA.data[index + 3] = 255;
+	}
+
+	var updateCanvas = function() {
+		CANVAS_CONTEXT.putImageData(CANVAS_DATA, 0, 0);
+	}
+
+
 	// --- Public methods.
 
 	// Add callback for memory read event.
@@ -62,13 +81,38 @@ function ram(newSize) {
 		WRITE_EVENTS.push(event);
 		console.log("Write event " + WRITE_EVENTS.length + " added from 0x" + newStart.toString(16) + " to 0x" + newEnd.toString(16));
 	};
-	
+
+	// Optionally attach to a div for visual display of memory contents.
+	this.attach = function(divId) {
+		//***TODO*** Assumes 64k
+		CANVAS_HEIGHT = 256;
+		CANVAS_WIDTH  = 256;
+		var canvas = document.createElement('canvas');
+		canvas.id     = "MemoryDisplay";
+		canvas.width  = CANVAS_WIDTH;
+		canvas.height = CANVAS_HEIGHT;
+		CANVAS_CONTEXT = canvas.getContext("2d");
+		document.getElementById(divId).appendChild(canvas);
+		CANVAS_DATA = CANVAS_CONTEXT.getImageData(0, 0, CANVAS_WIDTH, CANVAS_HEIGHT);
+		window.setInterval(updateCanvas.bind(this), 500);
+	};
+
 	// Are we performing callbacks?
 	this.callbacksEnabled = function(trueFalse) {
 		EVENTS_ENABLED_COUNTER += (trueFalse ? -1 : 1);
 		EVENTS_ENABLED = (EVENTS_ENABLED_COUNTER == 0);
 	};
-	
+
+	// Deserialize RAM state.
+	this.deserialize = function(state) {
+		for (var x=0; x<MEMORY.length; x++) {
+			MEMORY[x] = state.RAM[x];
+			if (CANVAS_DATA != null) {
+				drawByte(x, MEMORY[x] & 0xff);
+			}
+		}
+	};
+
 	// See how much RAM we have.
 	this.getSize = function() {
 		return MEMORY.length;
@@ -80,31 +124,49 @@ function ram(newSize) {
 			if ((READ_EVENTS.length > 0) && (EVENTS_ENABLED)) {
 				for (var x=0; x<READ_EVENTS.length; x++) {
 					var event = READ_EVENTS[x];
-					if ((address >= event.startAddress) && (address <= event.endAddress))
+					if ((address >= event.startAddress) && (address <= event.endAddress)) {
 						event.callback(address, MEMORY[address] & 0xff, event.anyData);
+					}
 				}
 			}
 			return MEMORY[address] & 0xff;
 		}
 	};
-	
+
+	// Read a word and return it.
+	this.readWord = function(address) {
+		return (this.readByte(address) + (this.readByte(address + 1) << 8));
+	};
+
 	// Remove registered events.
 	this.removeEvents = function() {
 		READ_EVENTS  = new Array();
 		WRITE_EVENTS = new Array();
 	};
-	
+
 	// Set all the memory to zero.  Does NOT fire events.
 	this.reset = function() {
 		for (var x=0; x<MEMORY.length; x++) {
 			MEMORY[x] = 0;
+			drawByte(x, 0, 0, 0);
 		}
 	};
 
+	// Serialize RAM state.
+	this.serialize = function() {
+		var state = {
+			RAM: MEMORY
+		};
+		return state;
+	};
+
 	// Write a byte.
 	this.writeByte = function(address, value) {
 		if ((address < MEMORY.length) && (address >= 0)) {
 			MEMORY[address] = value & 0xff;
+			if (CANVAS_DATA != null) {
+				drawByte(address, value & 0xff);
+			}
 			if ((WRITE_EVENTS.length > 0)  && (EVENTS_ENABLED)) {
 				for (var x=0; x<WRITE_EVENTS.length; x++) {
 					var event = WRITE_EVENTS[x];

vm/computer/textDisplay.js

@@ -44,7 +44,7 @@ function textDisplay() {
 	
 	// Default character cell size.
 	var CELL_WIDTH  = 8;
-	var CELL_HEIGHT = 12;
+	var CELL_HEIGHT = 16;
 	
 	// Default display size.
 	var WIDTH  = 80;
@@ -211,14 +211,22 @@ function textDisplay() {
 					else
 						offset = ((offset + 1) / 2) - 1; // Color.
 				}
-				var y = Math.floor(offset / monitor.getWidth());
+				var y = Math.floor(offset / self.getWidth());
-				var x = offset - y * monitor.getWidth();
+				var x = offset - y * self.getWidth();
-				monitor.refresh(x, y);
+				self.refresh(x, y);
 			}
 			MEMORY.callbacksEnabled(true);
 		});
 	};
 	
+	// Deserialize display state.
+	this.deserialize = function(state) {
+		DDATA_LSB = state.D;
+		IS_COLOR = state.C;
+		COLOR_VALUE = state.A;
+		moveCursor(state.X, state.Y);
+	};
+
 	// Refresh a single character cell.
 	this.refresh = function(x, y) {
 		// These are good old PC DOS colors.
@@ -290,6 +298,18 @@ function textDisplay() {
 		return IS_COLOR;
 	};
 	
+	// Serialize display state.
+	this.serialize = function() {
+		var state = {
+			X: CURSOR_X,
+			Y: CURSOR_Y,
+			C: IS_COLOR,
+			A: COLOR_VALUE,
+			D: DATA_LSB
+		};
+		return state;
+	};
+
 	// Set the current cell height.
 	this.setCellHeight = function(newCellHeight) {
 		CELL_HEIGHT = newCellHeight;

vm/computer/textDisplayCanvas.js

@@ -0,0 +1,348 @@
+/*
+ * 	6502 Based Virtual Computer
+ *	Copyright (C) 2015  Scott C. Duensing <scott@jaegertech.com>
+ *
+ *	This program is free software; you can redistribute it and/or modify
+ *	it under the terms of the GNU General Public License as published by
+ *	the Free Software Foundation; either version 2 of the License, or
+ *	(at your option) any later version.
+ *
+ *	This program is distributed in the hope that it will be useful,
+ *	but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *	GNU General Public License for more details.
+ *
+ *	You should have received a copy of the GNU General Public License along
+ *	with this program; if not, write to the Free Software Foundation, Inc.,
+ *	51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+ */
+
+// Our display adapter object.
+function textDisplayCanvas() {
+
+	// This display adapter can render text in 16 foreground colors
+	// on 16 background colors.  A simple "BIOS" is available by
+	// writing command data into the byte directly following the
+	// display memory and then the command into the byte after that.
+	// You may also write directly to display RAM.
+
+	// Font texture is 144x256 pixels.
+	// Characters are 9x16
+
+
+	// --- Private variables.
+
+	var self = this;
+
+	// Memory Information.
+	var MEMORY               = null;
+	var MEMORY_START         = 0;
+	var DATA_BYTE            = 0;
+	var DATA_LSB             = 0;
+	var DATA_BYTE_ADDRESS    = 0;
+	var COMMAND_BYTE_ADDRESS = 0;
+
+	// Font atlas size.
+	var ATLAS_WIDTH = 16;
+
+	// Character cell size.
+	var CELL_WIDTH  =  9;
+	var CELL_HEIGHT = 16;
+
+	// Default display size.
+	var WIDTH  = 80;
+	var HEIGHT = 25;
+
+	// Is this a color display?
+	var IS_COLOR = true;
+
+	// These are good old PC DOS colors.
+	//		black, dark red, dark green, brown,
+	//		dark blue, dark magenta, dark cyan, gray
+	//		dim gray, red, green, yellow,
+	//		blue, magenta, cyan, white
+	var COLOR_HEX = ["#000000", "#8B0000", "#006400", "#8B8B00",
+							"#00008B", "#8B008B", "#008B8B", "#808080",
+							"#696969", "#FF0000", "#00FF00", "#FFFF00",
+							"#0000FF", "#FF00FF", "#00FFFF", "#FFFFFF"];
+	var COLOR_RGB = new Array();
+
+	// Cursor position, blink state, and ASCII symbol.
+	var CURSOR_X = 0;
+	var CURSOR_Y = 0;
+	var CURSOR_B = false;
+	var CURSOR_C = 177;
+
+	// Current color attribute.  Boring white on black. (LSN=FG, MSN=BG)
+	var COLOR_VALUE = 7;
+
+	// The actual DOM canvases.
+	var CANVAS         = null;
+	var CANVAS_CONTEXT = null;
+	var FONT           = null;
+	var FONT_CONTEXT   = null;
+
+
+	// --- Private methods.
+
+	var blinkCursor = function() {
+		// Change cursor state first so it is correct for the rest of the code.
+		CURSOR_B = !CURSOR_B;
+		if (CURSOR_B) {
+			renderCell(CURSOR_X, CURSOR_Y, CURSOR_C, 15, 0, true);
+		} else {
+			self.refresh(CURSOR_X, CURSOR_Y);
+		}
+	};
+
+	// Clear the screen to the current color attributes.
+	var clearDisplay = function() {
+		var byte = MEMORY_START;
+		for (var y=0; y<HEIGHT; y++) {
+			for (var x=0; x<WIDTH; x++) {
+				MEMORY.writeByte(byte++, 32); // [SPACE] in ASCII.
+				if (IS_COLOR) {
+					MEMORY.writeByte(byte++, COLOR_VALUE);
+				}
+			}
+		}
+		moveCursor(0, 0);
+		var MSN = (COLOR_VALUE & 0xf0) >> 4;
+		CANVAS_CONTEXT.fillStyle = COLOR_HEX[MSN];
+		CANVAS_CONTEXT.fillRect(0, 0, CANVAS.width, CANVAS.height);
+	};
+
+	// Move the cursor to a new location.
+	var moveCursor = function(x, y) {
+		// Be sure old character cell has been restored if the cursor is currently visible.
+		if (CURSOR_B) self.refresh(CURSOR_X, CURSOR_Y);
+		// Move it.
+		CURSOR_X = x;
+		CURSOR_Y = y;
+	};
+
+	// Draw one character to the display & update cursor position.
+	var drawCharacter = function(c) {
+		var color = (IS_COLOR ? 2 : 1);
+		var byte = MEMORY_START + (CURSOR_Y * WIDTH + CURSOR_X) * color;
+		var x = CURSOR_X;
+		var y = CURSOR_Y;
+		if (c == 8) {
+			// Backspace
+			if (x > 0)
+				x--;
+		} else if (c == 9) {
+			// TAB
+			x = (x + 8) & ~7;
+		} else if (c == 10) {
+			// Line Feed
+			y++;
+		} else if (c == 13) {
+			// Carriage Return
+			x = 0;
+		} else {
+			// Other characters.
+			MEMORY.writeByte(byte++, c);
+			if (IS_COLOR) MEMORY.writeByte(byte++, COLOR_VALUE);
+			self.refresh(x, y);
+			x++;
+		}
+		// Line wrap?
+		if (x >= WIDTH - 1) {
+			x = 0;
+			y++;
+		}
+		// Scroll required?
+		var didScroll = false;
+		while (y >= HEIGHT) {
+			didScroll = true;
+			byte = MEMORY_START;
+			for (var i=0; i<(HEIGHT - 1) * WIDTH; i++) {
+				MEMORY.writeByte(byte, MEMORY.readByte(byte + WIDTH * color));
+				byte++;
+				if (IS_COLOR) {
+					MEMORY.writeByte(byte, MEMORY.readByte(byte + WIDTH * color));
+					byte++;
+				}
+			}
+			for (var i=0; i<WIDTH; i++) {
+				MEMORY.writeByte(byte++, 32);
+				if (IS_COLOR) MEMORY.writeByte(byte++, COLOR_VALUE);
+			}
+			y--;
+		}
+		// Update display if we scrolled.
+		if (didScroll) {
+			var display = CANVAS_CONTEXT.getImageData(0, CELL_HEIGHT, CANVAS.width, CANVAS.height - CELL_HEIGHT);
+			CANVAS_CONTEXT.putImageData(display, 0, 0);
+			var MSN = (COLOR_VALUE & 0xf0) >> 4;
+			CANVAS_CONTEXT.fillStyle = COLOR_HEX[MSN];
+			CANVAS_CONTEXT.fillRect(0, CANVAS.height - CELL_HEIGHT, CANVAS.width, CELL_HEIGHT);
+		}
+		// Reposition cursor.
+		moveCursor(x, y);
+	};
+
+	// Draw a zero-terminated string to the display & update cursor position.
+	var drawString = function(address) {
+		var byte = address;
+		do {
+			var c = MEMORY.readByte(byte++);
+			if (c != 0) drawCharacter(c);
+		} while (c != 0);
+	};
+
+	// Finish attaching this display to the VM.
+	var finishAttaching = function(newMemory, newStartPosition, divId) {
+		MEMORY       = newMemory;
+		MEMORY_START = newStartPosition;
+		// Pre-convert our hex colors to RGB values.
+		for (c=0; c<COLOR_HEX.length; ++c) {
+			COLOR_RGB.push(util.hexToRgb(COLOR_HEX[c]));
+		}
+		// Create canvas and context for display.
+		CANVAS = document.createElement('canvas');
+		CANVAS.height = CELL_HEIGHT * HEIGHT;
+		CANVAS.width = CELL_WIDTH * WIDTH;
+		CANVAS.style = 'border: 1px solid black';
+		CANVAS_CONTEXT = CANVAS.getContext('2d');
+		document.getElementById(divId).appendChild(CANVAS);
+		var byte = MEMORY_START + HEIGHT * WIDTH * (IS_COLOR ? 2 : 1);
+		DATA_BYTE_ADDRESS = byte++;
+		COMMAND_BYTE_ADDRESS = byte++;
+		clearDisplay();
+		// Set up memory mapped hardware ports.
+		MEMORY.addWriteCallback(MEMORY_START, MEMORY_START + self.getMemoryNeeded() - 1, null, function(address, value, data){
+			MEMORY.callbacksEnabled(false);
+			var offset = address - MEMORY_START;
+			// Is this a write to one of the command ports or direct to video memory?
+			if (address >= DATA_BYTE_ADDRESS) {
+				// Command byte?
+				if (address == COMMAND_BYTE_ADDRESS) {
+					if (value == 0) DATA_LSB = DATA_BYTE;
+					if (value == 1) clearDisplay();
+					if (value == 2) moveCursor(DATA_BYTE, CURSOR_Y);
+					if (value == 3) moveCursor(CURSOR_X, DATA_BYTE);
+					if (value == 4) MEMORY.writeByte(DATA_BYTE_ADDRESS, CURSOR_X);
+					if (value == 5) MEMORY.writeByte(DATA_BYTE_ADDRESS, CURSOR_Y);
+					if (value == 6) COLOR_VALUE = DATA_BYTE;
+					if (value == 7) drawCharacter(DATA_BYTE);
+					if (value == 8) drawString((DATA_BYTE << 8) + DATA_LSB);
+				} else {
+					// Data byte.
+					DATA_BYTE = value;
+				}
+			} else {
+				if (IS_COLOR) {
+					// Is this the character byte or the color byte?
+					if (offset % 2 == 0)
+						offset = offset / 2; // Character.
+					else
+						offset = ((offset + 1) / 2) - 1; // Color.
+				}
+				var y = Math.floor(offset / WIDTH);
+				var x = offset - y * WIDTH;
+				self.refresh(x, y);
+			}
+			MEMORY.callbacksEnabled(true);
+		});
+	};
+
+	var renderCell = function(x, y, c, f, b, t) {
+		// Find pixel offset in display canvas.
+		var cx = x * CELL_WIDTH;
+		var cy = y * CELL_HEIGHT;
+		// Locate this character in the font atlas.
+		var ax = (c % ATLAS_WIDTH) * CELL_WIDTH;
+		var ay = Math.floor(c / ATLAS_WIDTH) * CELL_HEIGHT;
+		// Render character.
+		var cell = CANVAS_CONTEXT.getImageData(cx, cy, CELL_WIDTH, CELL_HEIGHT);
+		var pixelColor = null;
+		for (rx=0; rx<CELL_WIDTH; rx++) {
+			for (ry=0; ry<CELL_HEIGHT; ry++) {
+				var pixel = (FONT_CONTEXT.getImageData(ax + rx, ay + ry, 1, 1).data[0] != 0);
+				// If we've requested transparent backgrounds, skip drawing them.
+				if (pixel || !t) {
+					pixelColor = (pixel ? COLOR_RGB[f] : COLOR_RGB[b]);
+					var index = (rx + ry * cell.width) * 4;
+					cell.data[index    ] = pixelColor.r;
+					cell.data[index + 1] = pixelColor.g;
+					cell.data[index + 2] = pixelColor.b;
+					cell.data[index + 3] = 255;
+				}
+			}
+		}
+		CANVAS_CONTEXT.putImageData(cell, cx, cy);
+		//if (t) console.log("Rendered " + c + " at " + x + ", " + y);
+	}
+
+
+	// --- Public methods.
+
+	// Begin attaching this display to the VM.
+	this.attach = function(newMemory, newStartPosition, divId) {
+		// Create hidden canvas and load our font bitmap into it.
+		var fontImage = new Image();
+		fontImage.onload = function() {
+			FONT = document.createElement('canvas');
+			FONT.width = fontImage.width;
+			FONT.height = fontImage.height;
+			FONT_CONTEXT = FONT.getContext('2d');
+			FONT_CONTEXT.drawImage(fontImage, 0, 0);
+			// After the font loads, finish attaching to the computer.
+			finishAttaching(newMemory, newStartPosition, divId);
+			window.setInterval(blinkCursor.bind(self), 250);
+			//FONT.style = 'visibility: false';
+			//document.getElementById(divId).appendChild(FONT);
+		}
+		fontImage.src = 'VGAFont.png';
+	}
+
+	// Deserialize display state.
+	this.deserialize = function(state) {
+		DDATA_LSB = state.D;
+		IS_COLOR = state.C;
+		COLOR_VALUE = state.A;
+		moveCursor(state.X, state.Y);
+		for (x=0; x<WIDTH; x++)
+			for (y=0; y<HEIGHT; y++)
+				self.refresh(x, y);
+	};
+
+	// Refresh a single character cell.
+	this.refresh = function(x, y) {
+		var byte = MEMORY_START + (y * WIDTH + x) * (IS_COLOR ? 2 : 1);
+		// Assume B&W display for now.
+		var foreground = 7;
+		var background = 0;
+		// Get the character code we are going to render.
+		var c = MEMORY.readByte(byte);
+		// If we're using a color display, get the color byte.
+		if (IS_COLOR) {
+			// LSN=FG, MSN=BG
+			var value = MEMORY.readByte(byte + 1);
+			var LSN = value & 0x0f;
+			var MSN = (value & 0xf0) >> 4;
+			foreground = LSN;
+			background = MSN;
+		}
+		renderCell(x, y, c, foreground, background, false);
+	};
+
+	// Fetch how much RAM the current settings will require.
+	this.getMemoryNeeded = function() {
+		return WIDTH * HEIGHT * (IS_COLOR ? 2 : 1) + 2;
+	};
+
+	// Serialize display state.
+	this.serialize = function() {
+		var state = {
+			X: CURSOR_X,
+			Y: CURSOR_Y,
+			C: IS_COLOR,
+			A: COLOR_VALUE,
+			D: DATA_LSB
+		};
+		return state;
+	};
+}

vm/lzwCompress.README.md

@@ -0,0 +1,29 @@
+[lzwCompress.js] (http://floydpink.github.com/lzwCompress.js/ "Compress/Decompress your JS artifacts")
+==============
+
+Lossless LZW compression/decompression implemented in JavaScript for strings/JSON/JS objects. 
+
+### Usage:
+
+```javascript
+// To compress anything from within JS
+var compressed = lzwCompress.pack(humongousObj);
+
+// And to decompress it
+var original = lzwCompress.unpack(compressed);
+```
+
+Does LZW compression and JSON key optimization and makes JSON (or any javascript object) smaller for local storage, to ship up to the server etc.
+
+
+
+#### The MIT License (MIT)
+
+##### Copyright (c) 2012 Haridas Pachuveetil
+--------------------------------------
+
+<sup>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:</sup>
+
+<sup>The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.</sup>
+
+<sup>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.</sup>

vm/lzwCompress.js

@@ -0,0 +1,205 @@
+var lzwCompress = function (Array, JSON, undefined) {
+    var _self = {},
+        _lzwLoggingEnabled = false,
+        _lzwLog = function (message) {
+            try {
+                console.log('lzwCompress: '
+                    + (new Date()).toISOString() + ' : ' +
+                    (typeof(message) === 'object'
+                        ? JSON.stringify(message)
+                        : message));
+            } catch (e) {
+            }
+        };
+
+    // KeyOptimize
+    // http://stackoverflow.com/questions/4433402/replace-keys-json-in-javascript
+    (function (self, Array, JSON) {
+        "use strict";
+
+        // http://stackoverflow.com/questions/1988349/array-push-if-does-not-exist
+        Array.prototype.inArray = function (comparer) {
+            for (var i = 0; i < this.length; i++) {
+                if (comparer(this[i])) return true;
+            }
+            return false;
+        };
+        Array.prototype.pushNew = function (element, comparer) {
+            if (!this.inArray(comparer)) {
+                this.push(element);
+            }
+        };
+
+        var _keys = [],
+            _extractKeys = function (obj) {
+                if (typeof obj === 'object') {
+                    for (var key in obj) {
+                        if (!Array.isArray(obj)) {
+                            _keys.pushNew(key, function (e) {
+                                return e === key;
+                            });
+                        }
+                        _extractKeys(obj[key]);
+                    }
+                }
+            },
+            _encode = function (obj) {
+                if (typeof obj !== 'object') return obj;
+                for (var prop in obj) {
+                    if (!Array.isArray(obj)) {
+                        if (obj.hasOwnProperty(prop)) {
+                            obj[_keys.indexOf(prop)] = _encode(obj[prop]);
+                            delete obj[prop];
+                        }
+                    } else {
+                        obj[prop] = _encode(obj[prop]);
+                    }
+                }
+                return obj;
+            },
+            _decode = function (obj) {
+                if (typeof obj !== 'object') return obj;
+                for (var prop in obj) {
+                    if (!Array.isArray(obj)) {
+                        if (obj.hasOwnProperty(prop)) {
+                            obj[_keys[prop]] = _decode(obj[prop]);
+                            delete obj[prop];
+                        }
+                    } else {
+                        obj[prop] = _decode(obj[prop]);
+                    }
+                }
+                return obj;
+            },
+            compress = function (json) {
+                _keys = [];
+                var jsonObj = JSON.parse(json);
+                _extractKeys(jsonObj);
+                _lzwLoggingEnabled && _lzwLog('keys length : ' + _keys.length);
+                _lzwLoggingEnabled && _lzwLog('keys        : ' + _keys);
+                return JSON.stringify({ __k:_keys, __v:_encode(jsonObj) });
+            },
+            decompress = function (minifiedJson) {
+                var obj = minifiedJson;
+                if (typeof(obj) !== 'object') obj = JSON.parse(minifiedJson);
+                if (typeof(obj) !== 'object') return minifiedJson;
+                if (!obj.hasOwnProperty('__k')) return JSON.stringify(obj);
+                _keys = obj.__k;
+                return _decode(obj.__v);
+            };
+
+        self.KeyOptimize = {
+            pack:compress,
+            unpack:decompress
+        };
+    }(_self, Array, JSON));
+
+    // LZWCompress
+    // http://stackoverflow.com/a/2252533/218882
+    // http://rosettacode.org/wiki/LZW_compression#JavaScript
+    (function (self, Array) {
+        "use strict";
+        var compress = function (uncompressed) {
+                if (typeof(uncompressed) !== 'string') return uncompressed;
+                var i,
+                    dictionary = {},
+                    c,
+                    wc,
+                    w = "",
+                    result = [],
+                    dictSize = 256;
+                for (i = 0; i < 256; i += 1) {
+                    dictionary[String.fromCharCode(i)] = i;
+                }
+                for (i = 0; i < uncompressed.length; i += 1) {
+                    c = uncompressed.charAt(i);
+                    wc = w + c;
+                    if (dictionary[wc]) {
+                        w = wc;
+                    } else {
+                        if (dictionary[w] === undefined) return uncompressed;
+                        result.push(dictionary[w]);
+                        dictionary[wc] = dictSize++;
+                        w = String(c);
+                    }
+                }
+                if (w !== "") {
+                    result.push(dictionary[w]);
+                }
+                return result;
+            },
+            decompress = function (compressed) {
+                if (!Array.isArray(compressed)) return compressed;
+                var i,
+                    dictionary = [],
+                    w,
+                    result,
+                    k,
+                    entry = "",
+                    dictSize = 256;
+                for (i = 0; i < 256; i += 1) {
+                    dictionary[i] = String.fromCharCode(i);
+                }
+                w = String.fromCharCode(compressed[0]);
+                result = w;
+                for (i = 1; i < compressed.length; i += 1) {
+                    k = compressed[i];
+                    if (dictionary[k]) {
+                        entry = dictionary[k];
+                    } else {
+                        if (k === dictSize) {
+                            entry = w + w.charAt(0);
+                        } else {
+                            return null;
+                        }
+                    }
+                    result += entry;
+                    dictionary[dictSize++] = w + entry.charAt(0);
+                    w = entry;
+                }
+                return result;
+            };
+
+        self.LZWCompress = {
+            pack:compress,
+            unpack:decompress
+        };
+    }(_self, Array));
+
+    var _compress = function (obj) {
+            _lzwLoggingEnabled && _lzwLog('original (uncompressed) : ' + obj);
+            if (!obj || obj === true || obj instanceof Date) return obj;
+            var result = obj;
+            if (typeof obj === 'object') {
+                result = _self.KeyOptimize.pack(JSON.stringify(obj));
+                _lzwLoggingEnabled && _lzwLog('key optimized: ' + result);
+            }
+            var packedObj = _self.LZWCompress.pack(result);
+            _lzwLoggingEnabled && _lzwLog('packed   (compressed)   : ' + packedObj);
+            return packedObj;
+        },
+        _decompress = function (compressedObj) {
+            _lzwLoggingEnabled && _lzwLog('original (compressed)   : ' + compressedObj);
+            if (!compressedObj || compressedObj === true || compressedObj instanceof Date) return compressedObj;
+            var result = _self.LZWCompress.unpack(compressedObj);
+            try {
+                result = JSON.parse(result);
+            } catch (e) {
+                _lzwLoggingEnabled && _lzwLog('unpacked (uncompressed) : ' + result);
+                return result;
+            }
+            result = _self.KeyOptimize.unpack(result);
+            _lzwLoggingEnabled && _lzwLog('unpacked (uncompressed) : ' + result);
+            return result;
+        },
+        _enableLogging = function (enable) {
+            _lzwLoggingEnabled = enable;
+        };
+
+    return {
+        pack:_compress,
+        unpack:_decompress,
+        enableLogging:_enableLogging
+    };
+
+}(Array, JSON);

vm/machine.html

@@ -18,21 +18,50 @@
 -->
 <html>
 	<head>
+		<!--
 		<script src="https://getfirebug.com/firebug-lite.js" type="text/javascript" language="javascript"></script>
 		<script src="ConsoleDummy.js" type="text/javascript" language="javascript"></script>
+		 -->
 		<title>Virtual Computer Test</title>
 		<script src="computer/ram.js" type="text/javascript" language="javascript"></script>
 		<script src="computer/cpu6502.js" type="text/javascript" language="javascript"></script>
-		<script src="computer/textDisplay.js" type="text/javascript" language="javascript"></script>
+		<script src="computer/textDisplayCanvas.js" type="text/javascript" language="javascript"></script>
 		<script src="computer/keyboard.js" type="text/javascript" language="javascript"></script>
 		<script src="computer/prng.js" type="text/javascript" language="javascript"></script>
 		<script src="computer/clock.js" type="text/javascript" language="javascript"></script>
-		<!--
+		<!-- script src="software/basic-v6502.js" type="text/javascript" language="javascript"></script -->
-		<script src="software/basic.js" type="text/javascript" language="javascript"></script>
+		<!-- script src="software/6502_functional_test.js" type="text/javascript" language="javascript"></script -->
-		-->
+		<script src="software/krusader-v6502.js" type="text/javascript" language="javascript"></script>
+		<script src="lzwCompress.js" type="text/javascript" language="javascript"></script>
+		<script src="utils.js" type="text/javascript" language="javascript"></script>
 	</head>
 	<body>
-		<div id="display"></div>
+		<table border="0" cellspacing="5" style="margin-left:auto; margin-right:auto;">
+			<tr>
+				<td colspan="2">
+					<div id="display"></div>
+				</td>
+				<td valign="top" align="center">
+					<p>Memory X-Ray</p>
+					<div id="memory" style="border:1px solid black;"></div>
+				</td>
+			</tr><tr>
+				<td>
+					<input type="button" value="Save Snapshot" onclick="javascript:util.saveSnapshot();">
+					<input type="button" value="Load Snapshot" onclick="javascript:util.loadSnapshot();">
+				</td>
+				<td>
+					<input type="button" id="PauseButton" value="Pause Computer" onclick="javascript:util.toggleCPU('PauseButton');">
+				</td>
+				<td align="right">
+					<input type="button" value="Load Paste Box Contents" onclick="javascript:util.loadPasteBox('PasteBox');">
+				</td>
+			</tr><tr>
+				<td colspan="3" align="center">
+					<textarea id="PasteBox" cols="125" rows="10"></textarea>
+				</td>
+			</tr>
+		</table>
 		<script src="machine.js" type="text/javascript" language="javascript"></script>
 	</body>
 </html>

vm/machine.js

@@ -21,37 +21,37 @@
 
 // Declare components of our computer.
 console.log("Creating components.");
-var memory = new ram(64 * 1024);
+var computer = {
-var cpu = new cpu6502();
+	memory:		new ram(64 * 1024),
-var monitor = new textDisplay();
+	cpu:		new cpu6502(),
-var keys = new keyboard();
+	monitor:	new textDisplayCanvas(),
-var random = new prng();
+	keys:		new keyboard(),
-var timer = new clock();
+	random:		new prng(),
+	timer:		new clock()
+};
 console.log("Creating components - success!");
 
+
 // Memory Map (64k):
-var MM_ZERO_PAGE          = 0x0000;
-var MM_STACK              = 0x0100;
-var MM_CODE_START         = 0x0200;
-var MM_HEAP_END           = 0xdfff;
-var MM_DISPLAY_ADAPTER    = 0xe000;
-var MM_DISPLAY_DATA       = MM_DISPLAY_ADAPTER + monitor.getMemoryNeeded() - 2;
-var MM_DISPLAY_COMMAND    = MM_DISPLAY_DATA + 1;
-var MM_KEYBOARD_CHARACTER = MM_DISPLAY_COMMAND + 1;
-var MM_KEYBOARD_META      = MM_KEYBOARD_CHARACTER + 1;
-var MM_PRNG               = MM_KEYBOARD_META + 1;
-var MM_CLOCK              = MM_PRNG + 1;
-var MM_ROM_START          = 0xf000;
-var MM_ROM_END            = 0xfff9;
-var MM_NMI_VECTOR         = 0xfffa;
-var MM_RESET_VECTOR       = 0xfffc;
 var MM_IRQ_VECTOR         = 0xfffe;
+var MM_RESET_VECTOR       = 0xfffc;
+var MM_NMI_VECTOR         = 0xfffa;
+var MM_CLOCK              = 0xfff9;
+var MM_PRNG               = 0xfff8;
+var MM_KEYBOARD_META      = 0xfff7;
+var MM_KEYBOARD_CHARACTER = 0xfff6;
+var MM_DISPLAY_COMMAND    = 0xffa1;
+var MM_DISPLAY_DATA       = 0xffa0;
+var MM_DISPLAY_ADAPTER    = 0xf000;
+var MM_HEAP_END           = 0xefff;
+var MM_HEAP_START         = 0x0200;
+var MM_STACK              = 0x0100;
+var MM_ZERO_PAGE          = 0x0000;
+
 
 console.log("MM_IRQ_VECTOR         = 0x" + MM_IRQ_VECTOR.toString(16));
 console.log("MM_RESET_VECTOR       = 0x" + MM_RESET_VECTOR.toString(16));
 console.log("MM_NMI_VECTOR         = 0x" + MM_NMI_VECTOR.toString(16));
-console.log("MM_ROM_END            = 0x" + MM_ROM_END.toString(16));
-console.log("MM_ROM_START          = 0x" + MM_ROM_START.toString(16));
 console.log("MM_CLOCK              = 0x" + MM_CLOCK.toString(16));
 console.log("MM_PRNG               = 0x" + MM_PRNG.toString(16));
 console.log("MM_KEYBOARD_META      = 0x" + MM_KEYBOARD_META.toString(16));
@@ -60,42 +60,45 @@ console.log("MM_DISPLAY_COMMAND    = 0x" + MM_DISPLAY_COMMAND.toString(16));
 console.log("MM_DISPLAY_DATA       = 0x" + MM_DISPLAY_DATA.toString(16));
 console.log("MM_DISPLAY_ADAPTER    = 0x" + MM_DISPLAY_ADAPTER.toString(16));
 console.log("MM_HEAP_END           = 0x" + MM_HEAP_END.toString(16));
-console.log("MM_CODE_START         = 0x" + MM_CODE_START.toString(16));
+console.log("MM_HEAP_START         = 0x" + MM_HEAP_START.toString(16));
 console.log("MM_STACK              = 0x" + MM_STACK.toString(16));
 console.log("MM_ZERO_PAGE          = 0x" + MM_ZERO_PAGE.toString(16));
 
 // Configure components & connect them together.
-cpu.attach(memory, MM_CODE_START, function(event){
+computer.memory.attach("memory");
+computer.cpu.attach(computer.memory, function(event){
 	// We don't care about events just yet.
-	var message = "Event " + event + " @ 0x" + cpu.getPC().toString(16) + " = " + memory.readByte(cpu.getPC()).toString(16);
+	var message = "Event " + event + " @ 0x" + computer.cpu.getPC().toString(16) + " = " + computer.memory.readByte(computer.cpu.getPC()).toString(16);
 	console.log(message);
-	alert(message);
+	//alert(message);
 });
-monitor.attach(memory, MM_DISPLAY_ADAPTER, "display");
+computer.monitor.attach(computer.memory, MM_DISPLAY_ADAPTER, "display");
-keys.attach(memory, MM_KEYBOARD_CHARACTER);
+computer.keys.attach(computer.memory, MM_KEYBOARD_CHARACTER);
-random.attach(memory, MM_PRNG);
+computer.random.attach(computer.memory, MM_PRNG);
-timer.attach(memory, MM_CLOCK, 0x100);
+computer.timer.attach(computer.memory, MM_CLOCK, 0x100);
 
 // Power on!
-memory.reset();
+computer.memory.reset();
-cpu.reset();
-
-// Make it do something!
-var HELLO_WORLD =  [0xA2, 0x00, 0xBD, 0x14, 0x02, 0xF0, 0x0B, 0x8D, 0xA0, 0xEF, 0xA9, 0x07,
-                    0x8D, 0xA1, 0xEF, 0xE8, 0xD0, 0xF0, 0x00, 0x00, 0x48, 0x65, 0x6C, 
-                    0x6C, 0x6F, 0x2C, 0x20, 0x77, 0x6F, 0x72, 0x6C, 0x64, 0x21, 0x00];
-
-for (var x=0; x<HELLO_WORLD.length; x++) {
-	memory.writeByte(MM_CODE_START + x, HELLO_WORLD[x]);
-}
-console.log("Code loaded.");
 
 /*
-// Load EhBASIC into RAM at 0xD000.
+// Make it do something!
-for (var x=0; x<PROGRAM.length; x++) {
+var HELLO_WORLD =  [0xA2, 0x00, 0xBD, 0x14, 0x02, 0xF0, 0x0B, 0x8D, 0xA0, 0xFF, 0xA9, 0x07,
-	memory.writeByte(0xD000 + x, PROGRAM[x]);
+                    0x8D, 0xA1, 0xFF, 0xE8, 0xD0, 0xF0, 0x00, 0x00, 0x48, 0x65, 0x6C, 
-}
+                    0x6C, 0x6F, 0x2C, 0x20, 0x77, 0x6F, 0x72, 0x6C, 0x64, 0x21, 0x00];
-console.log("Code loaded.");
+
+for (var x=0; x<HELLO_WORLD.length; x++) memory.writeByte(MM_HEAP_START + x, HELLO_WORLD[x]);
+memory.writeByte(MM_RESET_VECTOR, MM_HEAP_START & 0x00FF);
+memory.writeByte(MM_RESET_VECTOR + 1, (MM_HEAP_START & 0xFF00) >> 8);
 */
 
-cpu.run();
+// Load test into RAM.  Set PC to 0x1000 to run.
+//for (var x=0; x<PROGRAM.length; x++) memory.writeByte(x + 0xa, PROGRAM[x]);
+
+// Load EhBASIC into RAM.
+for (var x=0; x<PROGRAM.length; x++) computer.memory.writeByte(x, PROGRAM[x]);
+
+console.log("Code loaded.");
+
+computer.cpu.reset();
+//cpu.setPC(0x1000);
+computer.cpu.run();

vm/software/6502_functional_tests/license.txt

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.

vm/software/65b2js/65b2js.c

@@ -0,0 +1,42 @@
+/*
+ * 65b2js.c
+ *
+ *  Created on: May 19, 2011
+ *      Author: Scott Duensing
+ */
+
+#include <stdio.h>
+
+int main(int argc, char *argv[]) {
+	if (argc != 2) {
+		printf("usage: %s filename\n", argv[0]);
+		return 1;
+	} else {
+		FILE *file = fopen(argv[1], "r");
+		if (file == 0) {
+			printf("Could not open file\n");
+			return 2;
+		} else {
+			int c;
+			int count = 0;
+			int first = 1;
+			printf("var PROGRAM = [\n");
+			while ((c = fgetc(file)) != EOF) {
+				if (first == 1)
+					first = 0;
+				else
+					printf(", ");
+				if (++count > 15) {
+					printf("\n");
+					count = 0;
+				}
+				printf("0x%02x", c);
+			}
+			if (count != 0)
+				printf("\n");
+			printf("];\n");
+			fclose(file);
+		}
+	}
+	return 0;
+}

vm/software/EhBASIC/build.sh

@@ -0,0 +1,7 @@
+#!/bin/bash
+
+BASE=basic-v6502
+
+../xa-2.3.5/xa -M -e $BASE.error.txt -l $BASE.label.txt -o $BASE.out $BASE.asm
+../65b2js $BASE.out > $BASE.js
+cp $BASE.js ../vm/software/.

vm/software/EhBASIC/original/min_mon.asm

@@ -0,0 +1,134 @@
+
+; minimal monitor for EhBASIC and 6502 simulator V1.05
+
+; To run EhBASIC on the simulator load and assemble [F7] this file, start the simulator
+; running [F6] then start the code with the RESET [CTRL][SHIFT]R. Just selecting RUN
+; will do nothing, you'll still have to do a reset to run the code.
+
+	.include "basic.asm"
+
+; put the IRQ and MNI code in RAM so that it can be changed
+
+IRQ_vec	= VEC_SV+2		; IRQ code vector
+NMI_vec	= IRQ_vec+$0A	; NMI code vector
+
+; setup for the 6502 simulator environment
+
+IO_AREA	= $F000		; set I/O area for this monitor
+
+ACIAsimwr	= IO_AREA+$01	; simulated ACIA write port
+ACIAsimrd	= IO_AREA+$04	; simulated ACIA read port
+
+; now the code. all this does is set up the vectors and interrupt code
+; and wait for the user to select [C]old or [W]arm start. nothing else
+; fits in less than 128 bytes
+
+	*=	$FF80			; pretend this is in a 1/8K ROM
+
+; reset vector points here
+
+RES_vec
+	CLD				; clear decimal mode
+	LDX	#$FF			; empty stack
+	TXS				; set the stack
+
+; set up vectors and interrupt code, copy them to page 2
+
+	LDY	#END_CODE-LAB_vec	; set index/count
+LAB_stlp
+	LDA	LAB_vec-1,Y		; get byte from interrupt code
+	STA	VEC_IN-1,Y		; save to RAM
+	DEY				; decrement index/count
+	BNE	LAB_stlp		; loop if more to do
+
+; now do the signon message, Y = $00 here
+
+LAB_signon
+	LDA	LAB_mess,Y		; get byte from sign on message
+	BEQ	LAB_nokey		; exit loop if done
+
+	JSR	V_OUTP		; output character
+	INY				; increment index
+	BNE	LAB_signon		; loop, branch always
+
+LAB_nokey
+	JSR	V_INPT		; call scan input device
+	BCC	LAB_nokey		; loop if no key
+
+	AND	#$DF			; mask xx0x xxxx, ensure upper case
+	CMP	#'W'			; compare with [W]arm start
+	BEQ	LAB_dowarm		; branch if [W]arm start
+
+	CMP	#'C'			; compare with [C]old start
+	BNE	RES_vec		; loop if not [C]old start
+
+	JMP	LAB_COLD		; do EhBASIC cold start
+
+LAB_dowarm
+	JMP	LAB_WARM		; do EhBASIC warm start
+
+; byte out to simulated ACIA
+
+ACIAout
+	STA	ACIAsimwr		; save byte to simulated ACIA
+	RTS
+
+; byte in from simulated ACIA
+
+ACIAin
+	LDA	ACIAsimrd		; get byte from simulated ACIA
+	BEQ	LAB_nobyw		; branch if no byte waiting
+
+	SEC				; flag byte received
+	RTS
+
+LAB_nobyw
+	CLC				; flag no byte received
+no_load				; empty load vector for EhBASIC
+no_save				; empty save vector for EhBASIC
+	RTS
+
+; vector tables
+
+LAB_vec
+	.word	ACIAin		; byte in from simulated ACIA
+	.word	ACIAout		; byte out to simulated ACIA
+	.word	no_load		; null load vector for EhBASIC
+	.word	no_save		; null save vector for EhBASIC
+
+; EhBASIC IRQ support
+
+IRQ_CODE
+	PHA				; save A
+	LDA	IrqBase		; get the IRQ flag byte
+	LSR				; shift the set b7 to b6, and on down ...
+	ORA	IrqBase		; OR the original back in
+	STA	IrqBase		; save the new IRQ flag byte
+	PLA				; restore A
+	RTI
+
+; EhBASIC NMI support
+
+NMI_CODE
+	PHA				; save A
+	LDA	NmiBase		; get the NMI flag byte
+	LSR				; shift the set b7 to b6, and on down ...
+	ORA	NmiBase		; OR the original back in
+	STA	NmiBase		; save the new NMI flag byte
+	PLA				; restore A
+	RTI
+
+END_CODE
+
+LAB_mess
+	.byte	$0D,$0A,"6502 EhBASIC [C]old/[W]arm ?",$00
+					; sign on string
+
+; system vectors
+
+	*=	$FFFA
+
+	.word	NMI_vec		; NMI vector
+	.word	RES_vec		; RESET vector
+	.word	IRQ_vec		; IRQ vector
+

vm/software/EhBASIC/original/readme.txt

@@ -0,0 +1,26 @@
+
+ Enhanced BASIC is a BASIC interpreter for the 6502 family microprocessors. It
+ is constructed to be quick and powerful and easily ported between 6502 systems.
+ It requires few resources to run and includes instructions to facilitate easy
+ low level handling of hardware devices. It also retains most of the powerful
+ high level instructions from similar BASICs.
+
+ EhBASIC is free but not copyright free. For non commercial use there is only one
+ restriction, any derivative work should include, in any binary image distributed,
+ the string "Derived from EhBASIC" and in any distribution that includes human
+ readable files a file that includes the above string in a human readable form
+ e.g. not as a comment in an HTML file.
+
+ For commercial use please contact me,  Lee Davison, at leeedavison@googlemail.com
+ for conditions.
+
+ For more information on EhBASIC, other versions of EhBASIC and other projects
+ please visit my site at ..
+
+	 http://members.multimania.co.uk/leeedavison/index.html
+
+
+ P.S. c't magazin, henceforth refered to as "those thieving german bastards", are
+ prohibited from using this or any version of EhBASIC for any of their projects
+ or products. The excuse "we don't charge people for it" doesn't wash, it adds
+ value to your product so you owe me.

vm/software/hello.asm

@@ -5,8 +5,8 @@
 
 			processor 6502
 
-ddata		equ		$efa0		; Display data address.
+ddata		equ		$ffa0		; Display data address.
-dcommand	equ		$efa1		; Display command address.
+dcommand	equ		$ffa1		; Display command address.
 
 			org		$200		; Code start.
 			

vm/utils.js

@@ -0,0 +1,62 @@
+/*
+ * 6502 Based Virtual Computer
+ *	Copyright © 2011  Scott C. Duensing <scott@jaegertech.com>
+ *
+ *	This program is free software; you can redistribute it and/or modify
+ *	it under the terms of the GNU General Public License as published by
+ *	the Free Software Foundation; either version 2 of the License, or
+ *	(at your option) any later version.
+ *
+ *	This program is distributed in the hope that it will be useful,
+ *	but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *	GNU General Public License for more details.
+ *
+ *	You should have received a copy of the GNU General Public License along
+ *	with this program; if not, write to the Free Software Foundation, Inc.,
+ *	51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+ */
+
+
+// Pretend we're a singleton.
+var util = new utils();
+
+
+function utils() {
+
+	GLOBAL_DATA = {};
+
+	// --- Public methods.
+
+	this.hexToRgb = function(hex) {
+	    // Expand shorthand form (e.g. "03F") to full form (e.g. "0033FF")
+	    var shorthandRegex = /^#?([a-f\d])([a-f\d])([a-f\d])$/i;
+	    hex = hex.replace(shorthandRegex, function(m, r, g, b) {
+	        return r + r + g + g + b + b;
+	    });
+	    var result = /^#?([a-f\d]{2})([a-f\d]{2})([a-f\d]{2})$/i.exec(hex);
+	    return result ? {
+	        r: parseInt(result[1], 16),
+	        g: parseInt(result[2], 16),
+	        b: parseInt(result[3], 16)
+	    } : null;
+		// alert( hexToRgb("#0033ff").g ); // "51";
+	};
+
+	this.loadPasteBox = function(controlId) {
+		var t = document.getElementById(controlId).value;
+		GLOBAL_DATA.pasteData = t;
+		GLOBAL_DATA.pastePos = 0;
+		GLOBAL_DATA.pasteTimer = window.setInterval(function() {
+			if (computer.memory.readByte(MM_KEYBOARD_CHARACTER) === 0) {
+				var char = GLOBAL_DATA.pasteData.charCodeAt(GLOBAL_DATA.pastePos++);
+				if (char == 10) char = 13;
+				computer.memory.writeByte(MM_KEYBOARD_CHARACTER, char);
+			}
+			if (GLOBAL_DATA.pastePos == GLOBAL_DATA.pasteData.length) {
+				window.clearInterval(GLOBAL_DATA.pasteTimer);
+			}
+		}, 3);
+	};
+
+}