| 1 |
2 |
alfik |
/*
|
| 2 |
|
|
* Copyright (c) 2014, Aleksander Osman
|
| 3 |
|
|
* All rights reserved.
|
| 4 |
|
|
*
|
| 5 |
|
|
* Redistribution and use in source and binary forms, with or without
|
| 6 |
|
|
* modification, are permitted provided that the following conditions are met:
|
| 7 |
|
|
*
|
| 8 |
|
|
* * Redistributions of source code must retain the above copyright notice, this
|
| 9 |
|
|
* list of conditions and the following disclaimer.
|
| 10 |
|
|
*
|
| 11 |
|
|
* * Redistributions in binary form must reproduce the above copyright notice,
|
| 12 |
|
|
* this list of conditions and the following disclaimer in the documentation
|
| 13 |
|
|
* and/or other materials provided with the distribution.
|
| 14 |
|
|
*
|
| 15 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 16 |
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 17 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
| 18 |
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
| 19 |
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 20 |
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
| 21 |
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
| 22 |
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
| 23 |
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 24 |
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 25 |
|
|
*/
|
| 26 |
|
|
|
| 27 |
|
|
package ao486.test.layers;
|
| 28 |
|
|
|
| 29 |
|
|
import java.util.HashMap;
|
| 30 |
|
|
import java.util.LinkedList;
|
| 31 |
|
|
import java.util.Random;
|
| 32 |
|
|
|
| 33 |
|
|
public class MemoryPatchLayer extends Layer {
|
| 34 |
|
|
public MemoryPatchLayer(Random random, LinkedList<Pair<Long, Long>> prohibited_list, int address, int ...values) {
|
| 35 |
|
|
this.random = random;
|
| 36 |
|
|
|
| 37 |
|
|
long addr = norm(address);
|
| 38 |
|
|
long addr_orig = addr;
|
| 39 |
|
|
for(int val : values) {
|
| 40 |
|
|
map.put(addr, (byte)val);
|
| 41 |
|
|
addr++;
|
| 42 |
|
|
}
|
| 43 |
|
|
prohibited_list.add(new Pair<>(addr_orig, addr_orig+values.length-1));
|
| 44 |
|
|
}
|
| 45 |
|
|
public boolean is_memory_not_random(long address) { return map.containsKey(address); }
|
| 46 |
|
|
|
| 47 |
|
|
public Byte get_memory(long address) {
|
| 48 |
|
|
return (map.containsKey(address) == false)? null : map.get(address);
|
| 49 |
|
|
}
|
| 50 |
|
|
HashMap<Long, Byte> map = new HashMap<>();
|
| 51 |
|
|
}
|
