about summary refs log tree commit diff stats
path: root/052kernel-string-equal.subx
diff options
context:
space:
mode:
authorKartik Agaram <vc@akkartik.com>2020-03-07 17:32:39 -0800
committerKartik Agaram <vc@akkartik.com>2020-03-07 17:40:45 -0800
commit3cf03158599472b1f6713192d9fa2b120f9f209b (patch)
tree4982565ff8b289847c1c263f4d9aeb3c2360b98b /052kernel-string-equal.subx
parent9ee4b34e068550462d440ebc522c7e8ad0c0f2e6 (diff)
downloadmu-3cf03158599472b1f6713192d9fa2b120f9f209b.tar.gz
6094 - new 'compute-offset' instruction
If indexing into a type with power-of-2-sized elements we can access them
in one instruction:

  x/reg1: (addr int) <- index A/reg2: (addr array int), idx/reg3: int

This translates to a single instruction because x86 instructions support
an addressing mode with left-shifts.

For non-powers-of-2, however, we need a multiply. To keep things type-safe,
it is performed like this:

  x/reg1: (offset T) <- compute-offset A: (addr array T), idx: int
  y/reg2: (addr T) <- index A, x

An offset is just an int that is guaranteed to be a multiple of size-of(T).
Offsets can only be used in index instructions, and the types will eventually
be required to line up.

In the process, I have to expand Input-size because mu.subx is growing
big.
Diffstat (limited to '052kernel-string-equal.subx')
0 files changed, 0 insertions, 0 deletions
'#n128'>128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279