From a091071d55aaaeeb49eeaff120895cdf5cce047c Mon Sep 17 00:00:00 2001
From: Luc Lagarde <mlaga97@gmail.com>
Date: Sat, 31 Mar 2018 17:50:51 -0500
Subject: [PATCH] Implement RAM corruption effect

---
 .../net/simon987/server/assembly/Memory.java  | 27 +++++++++++++++++++
 1 file changed, 27 insertions(+)

diff --git a/Server/src/main/java/net/simon987/server/assembly/Memory.java b/Server/src/main/java/net/simon987/server/assembly/Memory.java
index 7e9881d..557a799 100755
--- a/Server/src/main/java/net/simon987/server/assembly/Memory.java
+++ b/Server/src/main/java/net/simon987/server/assembly/Memory.java
@@ -13,6 +13,7 @@ import java.nio.ByteBuffer;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Base64;
+import java.util.Random;
 import java.util.zip.Deflater;
 import java.util.zip.DeflaterOutputStream;
 import java.util.zip.Inflater;
@@ -87,6 +88,32 @@ public class Memory implements Target, MongoSerialisable {
         words[address] = (char) value;
     }
 
+    /**
+     * Configurably corrupt memory
+     * 
+     * @param blockSize Block size (in words) in which to randomly flip one bit
+     */
+     public void corrupt(int blockSize) {
+         Random rand = new Random();
+
+         // Increment offset by blockSize
+         for (int offset = 0; offset < words.length; offset += blockSize) {
+
+             // Calculate address to corrupt by adding a random value between 0 to (blocksize-1) to offset
+             int address = rand.nextInt(blockSize) + offset;
+
+             // Checking here avoids having a protected area at the end of the address space
+             if(address < words.length) {
+
+                 // Calculate bitmask by left-shifting 1 by a random value between 0 and 15
+                 int bitmask = 1 << rand.nextInt(16);
+
+                 // Flip the bit with XOR	
+                 words[address] ^= bitmask;
+             }
+         }
+    }
+
     /**
      * Fill the memory with 0s
      */