view clojure/com/aurellem/gb/util.clj @ 288:eec3e69500d9

Made hxc-pokenames and hxc-items return keywords instead of strings by default; added hxc-pokenames-raw and hxc-items-raw for the string version.
author Dylan Holmes <ocsenave@gmail.com>
date Thu, 29 Mar 2012 13:31:31 -0500
parents 69184558fcf3
children 1de6aada1cb7
line wrap: on
line source
1 (ns com.aurellem.gb.util
2 (:use (com.aurellem.gb gb-driver vbm constants))
3 (:import java.io.File)
4 (:import [com.aurellem.gb.gb_driver SaveState]))
6 (defn A [state]
7 (bit-shift-right (bit-and 0x0000FF00 (AF state)) 8))
9 (defn B [state]
10 (bit-shift-right (bit-and 0x0000FF00 (BC state)) 8))
12 (defn D [state]
13 (bit-shift-right (bit-and 0x0000FF00 (DE state)) 8))
15 (defn H [state]
16 (bit-shift-right (bit-and 0x0000FF00 (HL state)) 8))
18 (defn C [state]
19 (bit-and 0xFF (BC state)))
20 (defn F [state]
21 (bit-and 0xFF (AF state)))
22 (defn E [state]
23 (bit-and 0xFF (DE state)))
24 (defn L [state]
25 (bit-and 0xFF (HL state)))
27 (defn binary-str [num]
28 (format "%08d"
29 (Integer/parseInt
30 (Integer/toBinaryString num) 10)))
32 (defn bit-list
33 "List the bits of n in order of decreasing significance."
34 [n]
35 ((fn this [coll n]
36 (if (zero? n) coll
37 (recur
38 (conj coll (rem n 2))
39 (int (/ n 2)))))
40 [] n))
43 (defn low-high
44 [low high]
45 (+ low (* 256 high)))
48 (defn format-name
49 "Convert the string of alphabetic/space characters into a keyword by
50 replacing spaces with hyphens and converting to lowercase."
51 [s]
52 (if (nil? s) nil
53 (keyword (.toLowerCase
54 (apply str
55 (map #(if (= % \space) "-" %) s))))))
58 ;; used to decode item prices
60 (defn decode-bcd
61 "Take a sequence of binary-coded digits (in written order) and return the number they represent."
62 [digits]
63 ((fn self [coll]
64 (if (empty? coll) 0
65 (+ (first coll) (* 100 (self (rest coll))))))
66 (map
67 #(+ (* 10 (int (/ % 16)))
68 (rem % 16))
69 (reverse digits))))
74 (defn view-register [state name reg-fn]
75 (println (format "%s: %s" name
76 (binary-str (reg-fn state))))
77 state)
79 (defn view-memory
80 ([^SaveState state mem]
81 (let [val (aget (memory state) mem)]
82 (println (format "0x%04X = %s 0x%02X %d" mem
83 (binary-str val) val val)))
84 state)
85 ([mem]
86 (view-memory @current-state mem)))
88 (defn print-listing
89 ([^SaveState state begin end]
90 (dorun (map
91 (fn [opcode line]
92 (println (format "0x%04X: 0x%02X %s %d"
93 line
94 opcode (binary-str opcode)
95 opcode)))
96 (subvec (vec (memory state)) begin end)
97 (range begin end)))
98 state)
99 ([begin end]
100 (print-listing @current-state begin end)))
102 (defn print-pc
103 ([^SaveState state]
104 (println (format "PC: 0x%04X" (PC state)))
105 state)
106 ([] (print-pc @current-state)))
108 (defn print-op
109 ([^SaveState state]
110 (println (format "OP: 0x%02X" (aget (memory state) (PC state))))
111 state)
112 ([] (print-op @current-state)))
114 (defn d-tick
115 ([state]
116 (-> state print-pc print-op tick)))
118 (defn print-interrupt
119 [^SaveState state]
120 (println (format "IE: %d" (IE state)))
121 state)
123 (defn set-memory
124 ([state location value]
125 (set-state! state)
126 (let [mem (memory state)]
127 (aset mem location value)
128 (write-memory! mem)
129 (update-state)))
130 ([location value]
131 (set-memory @current-state location value)))
133 (defn set-memory-range
134 ([state start values]
135 (set-state! state)
136 (let [mem (memory state)]
138 (dorun (map (fn [index val]
139 (aset mem index val))
140 (range start
141 (+ start (count values))) values))
142 (write-memory! mem)
143 (update-state)))
144 ([start values]
145 (set-memory-range
146 @current-state start values)))
148 (defn common-differences [& seqs]
149 (let [backbone (range (count (first seqs)))]
150 (filter
151 (comp (partial apply distinct?) second)
152 (zipmap backbone
153 (apply (partial map list) seqs)))))
155 (defn temporal-compare [& states]
156 (apply common-differences
157 (map (comp vec memory)
158 states)))
160 (defn mid-game []
161 (read-state "mid-game"))
165 (defn disect-bytes-2
166 "return a vector consiting of the last 16 bytes of the
167 integer expressed as two 8 bit numbers (inside an integer)
168 in the form [high-bits low-bits]."
169 [num]
170 [(bit-shift-right
171 (bit-and num 0xFF00) 8)
172 (bit-and num 0xFF)])
174 (defn disect-bytes-3
175 "same as disect-bytes-2 except that it assumes the input is a
176 24 bit number and returns [high-bits medium-bits low-bits]"
177 [num]
178 (vec
179 (concat
180 [(bit-shift-right (bit-and num 0xFF0000) 16)]
181 (disect-bytes-2 num))))
183 (defn glue-bytes
184 "Given two or three 8-bit numbers inside 32-bit integers,
185 combine them into the integer number that they together
186 represent."
187 ([h l]
188 (+ l (bit-shift-left h 8)))
190 ([h m l]
191 (+ (glue-bytes m l)
192 (bit-shift-left h 16))))
194 (def cartography
195 (File. user-home
196 "proj/vba-clojure/clojure/com/aurellem/exp/cartography"))
200 (defn print-D-memory
201 ([^SaveState state]
203 (let [descriptions
204 (clojure.string/split-lines
205 (slurp cartography))]
206 (dorun
207 (map
208 (fn [line data desc]
209 (printf "%04X %02X%s\n"
210 line data (apply str
211 (drop 20 desc))))
212 (range pokemon-record-begin
213 (inc D-memory-end))
215 (subvec (vec (memory state))
216 pokemon-record-begin
217 (inc D-memory-end))
218 descriptions))))
219 ([] (print-D-memory @current-state)))