projects / soc.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
history | raw | HEAD
radixmmu.py: remove redunant code
[soc.git] / src / soc / decoder / isa / radixmmu.py
1 # SPDX-License-Identifier: LGPLv3+
2 # Copyright (C) 2020, 2021 Luke Kenneth Casson Leighton <lkcl@lkcl.net>
3 # Copyright (C) 2021 Tobias Platen
4 # Funded by NLnet http://nlnet.nl
5 """core of the python-based POWER9 simulator
6
7 this is part of a cycle-accurate POWER9 simulator. its primary purpose is
8 not speed, it is for both learning and educational purposes, as well as
9 a method of verifying the HDL.
10
11 related bugs:
12
13 * https://bugs.libre-soc.org/show_bug.cgi?id=604
14 """
15
16 from nmigen.back.pysim import Settle
17 from copy import copy
18 from soc.decoder.selectable_int import (FieldSelectableInt, SelectableInt,
19 selectconcat)
20 from soc.decoder.helpers import exts, gtu, ltu, undefined
21 from soc.decoder.isa.mem import Mem
22 from soc.consts import MSRb # big-endian (PowerISA versions)
23
24 import math
25 import sys
26 import unittest
27
28 # very quick, TODO move to SelectableInt utils later
29 def genmask(shift, size):
30 res = SelectableInt(0, size)
31 for i in range(size):
32 if i < shift:
33 res[size-1-i] = SelectableInt(1, 1)
34 return res
35
36 # NOTE: POWER 3.0B annotation order! see p4 1.3.2
37 # MSB is indexed **LOWEST** (sigh)
38 # from gem5 radixwalk.hh
39 # Bitfield<63> valid; 64 - (63 + 1) = 0
40 # Bitfield<62> leaf; 64 - (62 + 1) = 1
41
42 def rpte_valid(r):
43 return bool(r[0])
44
45 def rpte_leaf(r):
46 return bool(r[1])
47
48 ## Shift address bits 61--12 right by 0--47 bits and
49 ## supply the least significant 16 bits of the result.
50 def addrshift(addr,shift):
51 x = addr.value >> shift.value
52 return SelectableInt(x,16)
53
54 def NLB(x):
55 """
56 Next Level Base
57 right shifted by 8
58 """
59 return x[4:55]
60
61 def NLS(x):
62 """
63 Next Level Size
64 NLS >= 5
65 """
66 return x[59:63]
67
68 """
69 Get Root Page
70
71 //Accessing 2nd double word of partition table (pate1)
72 //Ref: Power ISA Manual v3.0B, Book-III, section 5.7.6.1
73 // PTCR Layout
74 // ====================================================
75 // -----------------------------------------------
76 // | /// | PATB | /// | PATS |
77 // -----------------------------------------------
78 // 0 4 51 52 58 59 63
79 // PATB[4:51] holds the base address of the Partition Table,
80 // right shifted by 12 bits.
81 // This is because the address of the Partition base is
82 // 4k aligned. Hence, the lower 12bits, which are always
83 // 0 are ommitted from the PTCR.
84 //
85 // Thus, The Partition Table Base is obtained by (PATB << 12)
86 //
87 // PATS represents the partition table size right-shifted by 12 bits.
88 // The minimal size of the partition table is 4k.
89 // Thus partition table size = (1 << PATS + 12).
90 //
91 // Partition Table
92 // ====================================================
93 // 0 PATE0 63 PATE1 127
94 // |----------------------|----------------------|
95 // | | |
96 // |----------------------|----------------------|
97 // | | |
98 // |----------------------|----------------------|
99 // | | | <-- effLPID
100 // |----------------------|----------------------|
101 // .
102 // .
103 // .
104 // |----------------------|----------------------|
105 // | | |
106 // |----------------------|----------------------|
107 //
108 // The effective LPID forms the index into the Partition Table.
109 //
110 // Each entry in the partition table contains 2 double words, PATE0, PATE1,
111 // corresponding to that partition.
112 //
113 // In case of Radix, The structure of PATE0 and PATE1 is as follows.
114 //
115 // PATE0 Layout
116 // -----------------------------------------------
117 // |1|RTS1|/| RPDB | RTS2 | RPDS |
118 // -----------------------------------------------
119 // 0 1 2 3 4 55 56 58 59 63
120 //
121 // HR[0] : For Radix Page table, first bit should be 1.
122 // RTS1[1:2] : Gives one fragment of the Radix treesize
123 // RTS2[56:58] : Gives the second fragment of the Radix Tree size.
124 // RTS = (RTS1 << 3 + RTS2) + 31.
125 //
126 // RPDB[4:55] = Root Page Directory Base.
127 // RPDS = Logarithm of Root Page Directory Size right shifted by 3.
128 // Thus, Root page directory size = 1 << (RPDS + 3).
129 // Note: RPDS >= 5.
130 //
131 // PATE1 Layout
132 // -----------------------------------------------
133 // |///| PRTB | // | PRTS |
134 // -----------------------------------------------
135 // 0 3 4 51 52 58 59 63
136 //
137 // PRTB[4:51] = Process Table Base. This is aligned to size.
138 // PRTS[59: 63] = Process Table Size right shifted by 12.
139 // Minimal size of the process table is 4k.
140 // Process Table Size = (1 << PRTS + 12).
141 // Note: PRTS <= 24.
142 //
143 // Computing the size aligned Process Table Base:
144 // table_base = (PRTB & ~((1 << PRTS) - 1)) << 12
145 // Thus, the lower 12+PRTS bits of table_base will
146 // be zero.
147
148
149 //Ref: Power ISA Manual v3.0B, Book-III, section 5.7.6.2
150 //
151 // Process Table
152 // ==========================
153 // 0 PRTE0 63 PRTE1 127
154 // |----------------------|----------------------|
155 // | | |
156 // |----------------------|----------------------|
157 // | | |
158 // |----------------------|----------------------|
159 // | | | <-- effPID
160 // |----------------------|----------------------|
161 // .
162 // .
163 // .
164 // |----------------------|----------------------|
165 // | | |
166 // |----------------------|----------------------|
167 //
168 // The effective Process id (PID) forms the index into the Process Table.
169 //
170 // Each entry in the partition table contains 2 double words, PRTE0, PRTE1,
171 // corresponding to that process
172 //
173 // In case of Radix, The structure of PRTE0 and PRTE1 is as follows.
174 //
175 // PRTE0 Layout
176 // -----------------------------------------------
177 // |/|RTS1|/| RPDB | RTS2 | RPDS |
178 // -----------------------------------------------
179 // 0 1 2 3 4 55 56 58 59 63
180 //
181 // RTS1[1:2] : Gives one fragment of the Radix treesize
182 // RTS2[56:58] : Gives the second fragment of the Radix Tree size.
183 // RTS = (RTS1 << 3 + RTS2) << 31,
184 // since minimal Radix Tree size is 4G.
185 //
186 // RPDB = Root Page Directory Base.
187 // RPDS = Root Page Directory Size right shifted by 3.
188 // Thus, Root page directory size = RPDS << 3.
189 // Note: RPDS >= 5.
190 //
191 // PRTE1 Layout
192 // -----------------------------------------------
193 // | /// |
194 // -----------------------------------------------
195 // 0 63
196 // All bits are reserved.
197
198
199 """
200
201 testmem = {
202
203 0x10000: # PARTITION_TABLE_2 (not implemented yet)
204 # PATB_GR=1 PRTB=0x1000 PRTS=0xb
205 0x800000000100000b,
206
207 0x30000: # RADIX_ROOT_PTE
208 # V = 1 L = 0 NLB = 0x400 NLS = 9
209 0x8000000000040009,
210 0x40000: # RADIX_SECOND_LEVEL
211 # V = 1 L = 1 SW = 0 RPN = 0
212 # R = 1 C = 1 ATT = 0 EAA 0x7
213 0xc000000000000187,
214
215 0x1000000: # PROCESS_TABLE_3
216 # RTS1 = 0x2 RPDB = 0x300 RTS2 = 0x5 RPDS = 13
217 0x40000000000300ad,
218 }
219
220 # this one has a 2nd level RADIX with a RPN of 0x5000
221 testmem2 = {
222
223 0x10000: # PARTITION_TABLE_2 (not implemented yet)
224 # PATB_GR=1 PRTB=0x1000 PRTS=0xb
225 0x800000000100000b,
226
227 0x30000: # RADIX_ROOT_PTE
228 # V = 1 L = 0 NLB = 0x400 NLS = 9
229 0x8000000000040009,
230 0x40000: # RADIX_SECOND_LEVEL
231 # V = 1 L = 1 SW = 0 RPN = 0x5000
232 # R = 1 C = 1 ATT = 0 EAA 0x7
233 0xc000000005000187,
234
235 0x1000000: # PROCESS_TABLE_3
236 # RTS1 = 0x2 RPDB = 0x300 RTS2 = 0x5 RPDS = 13
237 0x40000000000300ad,
238 }
239
240
241 testresult = """
242 prtbl = 1000000
243 DCACHE GET 1000000 PROCESS_TABLE_3
244 DCACHE GET 30000 RADIX_ROOT_PTE V = 1 L = 0
245 DCACHE GET 40000 RADIX_SECOND_LEVEL V = 1 L = 1
246 DCACHE GET 10000 PARTITION_TABLE_2
247 translated done 1 err 0 badtree 0 addr 40000 pte 0
248 """
249
250 # see qemu/target/ppc/mmu-radix64.c for reference
251 class RADIX:
252 def __init__(self, mem, caller):
253 self.mem = mem
254 self.caller = caller
255 if caller is not None:
256 self.dsisr = self.caller.spr["DSISR"]
257 self.dar = self.caller.spr["DAR"]
258 self.pidr = self.caller.spr["PIDR"]
259 self.prtbl = self.caller.spr["PRTBL"]
260 self.msr = self.caller.msr
261
262 # cached page table stuff
263 self.pgtbl0 = 0
264 self.pt0_valid = False
265 self.pgtbl3 = 0
266 self.pt3_valid = False
267
268 def __call__(self, addr, sz):
269 val = self.ld(addr.value, sz, swap=False)
270 print("RADIX memread", addr, sz, val)
271 return SelectableInt(val, sz*8)
272
273 def ld(self, address, width=8, swap=True, check_in_mem=False,
274 instr_fetch=False):
275 print("RADIX: ld from addr 0x%x width %d" % (address, width))
276
277 priv = ~(self.msr(MSR_PR).value) # problem-state ==> privileged
278 if instr_fetch:
279 mode = 'EXECUTE'
280 else:
281 mode = 'LOAD'
282 addr = SelectableInt(address, 64)
283 (shift, mbits, pgbase) = self._decode_prte(addr)
284 #shift = SelectableInt(0, 32)
285
286 pte = self._walk_tree(addr, pgbase, mode, mbits, shift, priv)
287
288 # use pte to load from phys address
289 return self.mem.ld(pte.value, width, swap, check_in_mem)
290
291 # XXX set SPRs on error
292
293 # TODO implement
294 def st(self, address, v, width=8, swap=True):
295 print("RADIX: st to addr 0x%x width %d data %x" % (address, width, v))
296
297 priv = ~(self.msr(MSR_PR).value) # problem-state ==> privileged
298 mode = 'STORE'
299 addr = SelectableInt(address, 64)
300 (shift, mbits, pgbase) = self._decode_prte(addr)
301 pte = self._walk_tree(addr, pgbase, mode, mbits, shift, priv)
302
303 # use pte to store at phys address
304 return self.mem.st(pte.value, v, width, swap)
305
306 # XXX set SPRs on error
307
308 def memassign(self, addr, sz, val):
309 print("memassign", addr, sz, val)
310 self.st(addr.value, val.value, sz, swap=False)
311
312 def _next_level(self, addr, entry_width, swap, check_in_mem):
313 # implement read access to mmu mem here
314
315 # DO NOT perform byte-swapping: load 8 bytes (that's the entry size)
316 value = self.mem.ld(addr.value, 8, False, check_in_mem)
317 assert(value is not None, "address lookup %x not found" % addr.value)
318
319 print("addr", hex(addr.value))
320 data = SelectableInt(value, 64) # convert to SelectableInt
321 print("value", hex(value))
322 # index += 1
323 return data;
324
325 def _walk_tree(self, addr, pgbase, mode, mbits, shift, priv=1):
326 """walk tree
327
328 // vaddr 64 Bit
329 // vaddr |-----------------------------------------------------|
330 // | Unused | Used |
331 // |-----------|-----------------------------------------|
332 // | 0000000 | usefulBits = X bits (typically 52) |
333 // |-----------|-----------------------------------------|
334 // | |<--Cursize---->| |
335 // | | Index | |
336 // | | into Page | |
337 // | | Directory | |
338 // |-----------------------------------------------------|
339 // | |
340 // V |
341 // PDE |---------------------------| |
342 // |V|L|//| NLB |///|NLS| |
343 // |---------------------------| |
344 // PDE = Page Directory Entry |
345 // [0] = V = Valid Bit |
346 // [1] = L = Leaf bit. If 0, then |
347 // [4:55] = NLB = Next Level Base |
348 // right shifted by 8 |
349 // [59:63] = NLS = Next Level Size |
350 // | NLS >= 5 |
351 // | V
352 // | |--------------------------|
353 // | | usfulBits = X-Cursize |
354 // | |--------------------------|
355 // |---------------------><--NLS-->| |
356 // | Index | |
357 // | into | |
358 // | PDE | |
359 // |--------------------------|
360 // |
361 // If the next PDE obtained by |
362 // (NLB << 8 + 8 * index) is a |
363 // nonleaf, then repeat the above. |
364 // |
365 // If the next PDE is a leaf, |
366 // then Leaf PDE structure is as |
367 // follows |
368 // |
369 // |
370 // Leaf PDE |
371 // |------------------------------| |----------------|
372 // |V|L|sw|//|RPN|sw|R|C|/|ATT|EAA| | usefulBits |
373 // |------------------------------| |----------------|
374 // [0] = V = Valid Bit |
375 // [1] = L = Leaf Bit = 1 if leaf |
376 // PDE |
377 // [2] = Sw = Sw bit 0. |
378 // [7:51] = RPN = Real Page Number, V
379 // real_page = RPN << 12 -------------> Logical OR
380 // [52:54] = Sw Bits 1:3 |
381 // [55] = R = Reference |
382 // [56] = C = Change V
383 // [58:59] = Att = Physical Address
384 // 0b00 = Normal Memory
385 // 0b01 = SAO
386 // 0b10 = Non Idenmpotent
387 // 0b11 = Tolerant I/O
388 // [60:63] = Encoded Access
389 // Authority
390 //
391 """
392 # get sprs
393 print("_walk_tree")
394 pidr = self.caller.spr["PIDR"]
395 prtbl = self.caller.spr["PRTBL"]
396 print(pidr)
397 print(prtbl)
398 p = addr[55:63]
399 print("last 8 bits ----------")
400 print
401
402 # get address of root entry
403 shift = selectconcat(SelectableInt(0,1), prtbl[58:63]) # TODO verify
404 addr_next = self._get_prtable_addr(shift, prtbl, addr, pidr)
405 print("starting with prtable, addr_next",addr_next)
406
407 assert(addr_next.bits == 64)
408 assert(addr_next.value == 0x1000000) #TODO
409
410 addr_next = SelectableInt(0x30000,64) # radix root for testing
411
412 # walk tree starts on prtbl
413 while True:
414 print("nextlevel----------------------------")
415 # read an entry
416 swap = False
417 check_in_mem = False
418 entry_width = 8
419
420 data = self._next_level(addr_next, entry_width, swap, check_in_mem)
421 valid = rpte_valid(data)
422 leaf = rpte_leaf(data)
423
424 print(" valid, leaf", valid, leaf)
425 if not valid:
426 return "invalid" # TODO: return error
427 if leaf:
428 print ("is leaf, checking perms")
429 ok = self._check_perms(data, priv, mode)
430 if ok == True: # data was ok, found phys address, return it?
431 paddr = self._get_pte(addrsh, addr, data)
432 print (" phys addr", hex(paddr.value))
433 return paddr
434 return ok # return the error code
435 else:
436 newlookup = self._new_lookup(data, mbits, shift)
437 if newlookup == 'badtree':
438 return newlookup
439 shift, mask, pgbase = newlookup
440 print (" next level", shift, mask, pgbase)
441 shift = SelectableInt(shift.value,16) #THIS is wrong !!!
442 print("calling _get_pgtable_addr")
443 print(mask) #SelectableInt(value=0x9, bits=4)
444 print(pgbase) #SelectableInt(value=0x40000, bits=56)
445 print(shift) #SelectableInt(value=0x4, bits=16) #FIXME
446 pgbase = SelectableInt(pgbase.value, 64)
447 addrsh = addrshift(addr,shift)
448 addr_next = self._get_pgtable_addr(mask, pgbase, addrsh)
449 print("addr_next",addr_next)
450 print("addrsh",addrsh)
451
452 def _new_lookup(self, data, mbits, shift):
453 """
454 mbits := unsigned('0' & data(4 downto 0));
455 if mbits < 5 or mbits > 16 or mbits > r.shift then
456 v.state := RADIX_FINISH;
457 v.badtree := '1'; -- throw error
458 else
459 v.shift := v.shift - mbits;
460 v.mask_size := mbits(4 downto 0);
461 v.pgbase := data(55 downto 8) & x"00"; NLB?
462 v.state := RADIX_LOOKUP; --> next level
463 end if;
464 """
465 mbits = data[59:64]
466 print("mbits=", mbits)
467 if mbits < 5 or mbits > 16: #fixme compare with r.shift
468 print("badtree")
469 return "badtree"
470 # reduce shift (has to be done at same bitwidth)
471 shift = shift - selectconcat(SelectableInt(0, 1), mbits)
472 mask_size = mbits[1:5] # get 4 LSBs
473 pgbase = selectconcat(data[8:56], SelectableInt(0, 8)) # shift up 8
474 return shift, mask_size, pgbase
475
476 def _decode_prte(self, data):
477 """PRTE0 Layout
478 -----------------------------------------------
479 |/|RTS1|/| RPDB | RTS2 | RPDS |
480 -----------------------------------------------
481 0 1 2 3 4 55 56 58 59 63
482 """
483 # note that SelectableInt does big-endian! so the indices
484 # below *directly* match the spec, unlike microwatt which
485 # has to turn them around (to LE)
486 zero = SelectableInt(0, 1)
487 rts = selectconcat(zero,
488 data[56:59], # RTS2
489 data[1:3], # RTS1
490 )
491 masksize = data[59:64] # RPDS
492 mbits = selectconcat(zero, masksize)
493 pgbase = selectconcat(data[8:56], # part of RPDB
494 SelectableInt(0, 16),)
495
496 return (rts, mbits, pgbase)
497
498 def _segment_check(self, addr, mbits, shift):
499 """checks segment valid
500 mbits := '0' & r.mask_size;
501 v.shift := r.shift + (31 - 12) - mbits;
502 nonzero := or(r.addr(61 downto 31) and not finalmask(30 downto 0));
503 if r.addr(63) /= r.addr(62) or nonzero = '1' then
504 v.state := RADIX_FINISH;
505 v.segerror := '1';
506 elsif mbits < 5 or mbits > 16 or mbits > (r.shift + (31 - 12)) then
507 v.state := RADIX_FINISH;
508 v.badtree := '1';
509 else
510 v.state := RADIX_LOOKUP;
511 """
512 # note that SelectableInt does big-endian! so the indices
513 # below *directly* match the spec, unlike microwatt which
514 # has to turn them around (to LE)
515 mask = genmask(shift, 44)
516 nonzero = addr[2:33] & mask[13:44] # mask 31 LSBs (BE numbered 13:44)
517 print ("RADIX _segment_check nonzero", bin(nonzero.value))
518 print ("RADIX _segment_check addr[0-1]", addr[0].value, addr[1].value)
519 if addr[0] != addr[1] or nonzero != 0:
520 return "segerror"
521 limit = shift + (31 - 12)
522 if mbits < 5 or mbits > 16 or mbits > limit:
523 return "badtree"
524 new_shift = shift + (31 - 12) - mbits
525 return new_shift
526
527 def _check_perms(self, data, priv, mode):
528 """check page permissions
529 // Leaf PDE |
530 // |------------------------------| |----------------|
531 // |V|L|sw|//|RPN|sw|R|C|/|ATT|EAA| | usefulBits |
532 // |------------------------------| |----------------|
533 // [0] = V = Valid Bit |
534 // [1] = L = Leaf Bit = 1 if leaf |
535 // PDE |
536 // [2] = Sw = Sw bit 0. |
537 // [7:51] = RPN = Real Page Number, V
538 // real_page = RPN << 12 -------------> Logical OR
539 // [52:54] = Sw Bits 1:3 |
540 // [55] = R = Reference |
541 // [56] = C = Change V
542 // [58:59] = Att = Physical Address
543 // 0b00 = Normal Memory
544 // 0b01 = SAO
545 // 0b10 = Non Idenmpotent
546 // 0b11 = Tolerant I/O
547 // [60:63] = Encoded Access
548 // Authority
549 //
550 -- test leaf bit
551 -- check permissions and RC bits
552 perm_ok := '0';
553 if r.priv = '1' or data(3) = '0' then
554 if r.iside = '0' then
555 perm_ok := data(1) or (data(2) and not r.store);
556 else
557 -- no IAMR, so no KUEP support for now
558 -- deny execute permission if cache inhibited
559 perm_ok := data(0) and not data(5);
560 end if;
561 end if;
562 rc_ok := data(8) and (data(7) or not r.store);
563 if perm_ok = '1' and rc_ok = '1' then
564 v.state := RADIX_LOAD_TLB;
565 else
566 v.state := RADIX_FINISH;
567 v.perm_err := not perm_ok;
568 -- permission error takes precedence over RC error
569 v.rc_error := perm_ok;
570 end if;
571 """
572 # decode mode into something that matches microwatt equivalent code
573 instr_fetch, store = 0, 0
574 if mode == 'STORE':
575 store = 1
576 if mode == 'EXECUTE':
577 inst_fetch = 1
578
579 # check permissions and RC bits
580 perm_ok = 0
581 if priv == 1 or data[60] == 0:
582 if instr_fetch == 0:
583 perm_ok = data[62] | (data[61] & (store == 0))
584 # no IAMR, so no KUEP support for now
585 # deny execute permission if cache inhibited
586 perm_ok = data[63] & ~data[58]
587 rc_ok = data[55] & (data[56] | (store == 0))
588 if perm_ok == 1 and rc_ok == 1:
589 return True
590
591 return "perm_err" if perm_ok == 0 else "rc_err"
592
593 def _get_prtable_addr(self, shift, prtbl, addr, pid):
594 """
595 if r.addr(63) = '1' then
596 effpid := x"00000000";
597 else
598 effpid := r.pid;
599 end if;
600 x"00" & r.prtbl(55 downto 36) &
601 ((r.prtbl(35 downto 12) and not finalmask(23 downto 0)) or
602 (effpid(31 downto 8) and finalmask(23 downto 0))) &
603 effpid(7 downto 0) & "0000";
604 """
605 print ("_get_prtable_addr", shift, prtbl, addr, pid)
606 finalmask = genmask(shift, 44)
607 finalmask24 = finalmask[20:44]
608 if addr[0].value == 1:
609 effpid = SelectableInt(0, 32)
610 else:
611 effpid = pid #self.pid # TODO, check on this
612 zero8 = SelectableInt(0, 8)
613 zero4 = SelectableInt(0, 4)
614 res = selectconcat(zero8,
615 prtbl[8:28], #
616 (prtbl[28:52] & ~finalmask24) | #
617 (effpid[0:24] & finalmask24), #
618 effpid[24:32],
619 zero4
620 )
621 return res
622
623 def _get_pgtable_addr(self, mask_size, pgbase, addrsh):
624 """
625 x"00" & r.pgbase(55 downto 19) &
626 ((r.pgbase(18 downto 3) and not mask) or (addrsh and mask)) &
627 "000";
628 """
629 mask16 = genmask(mask_size+5, 16)
630 zero8 = SelectableInt(0, 8)
631 zero3 = SelectableInt(0, 3)
632 res = selectconcat(zero8,
633 pgbase[8:45], #
634 (pgbase[45:61] & ~mask16) | #
635 (addrsh & mask16), #
636 zero3
637 )
638 return res
639
640 def _get_pte(self, shift, addr, pde):
641 """
642 x"00" &
643 ((r.pde(55 downto 12) and not finalmask) or
644 (r.addr(55 downto 12) and finalmask))
645 & r.pde(11 downto 0);
646 """
647 shift.value = 12
648 finalmask = genmask(shift, 44)
649 zero8 = SelectableInt(0, 8)
650 rpn = pde[8:52] # RPN = Real Page Number
651 abits = addr[8:52] # non-masked address bits
652 print(" get_pte RPN", hex(rpn.value))
653 print(" abits", hex(abits.value))
654 print(" shift", shift.value)
655 print(" finalmask", bin(finalmask.value))
656 res = selectconcat(zero8,
657 (rpn & ~finalmask) | #
658 (abits & finalmask), #
659 addr[52:64],
660 )
661 return res
662
663 class TestRadixMMU(unittest.TestCase):
664
665 def test_genmask(self):
666 shift = SelectableInt(5, 6)
667 mask = genmask(shift, 43)
668 print (" mask", bin(mask.value))
669
670 self.assertEqual(mask.value, 0b11111, "mask should be 5 1s")
671
672 def test_get_pgtable_addr(self):
673
674 mem = None
675 caller = None
676 dut = RADIX(mem, caller)
677
678 mask_size=4
679 pgbase = SelectableInt(0,64)
680 addrsh = SelectableInt(0,16)
681 ret = dut._get_pgtable_addr(mask_size, pgbase, addrsh)
682 print("ret=", ret)
683 self.assertEqual(ret, 0, "pgtbl_addr should be 0")
684
685 def test_walk_tree_1(self):
686
687 # test address as in
688 # https://github.com/power-gem5/gem5/blob/gem5-experimental/src/arch/power/radix_walk_example.txt#L65
689 testaddr = 0x1000
690 expected = 0x1000
691
692 # starting prtbl
693 prtbl = 0x1000000
694
695 # set up dummy minimal ISACaller
696 spr = {'DSISR': SelectableInt(0, 64),
697 'DAR': SelectableInt(0, 64),
698 'PIDR': SelectableInt(0, 64),
699 'PRTBL': SelectableInt(prtbl, 64)
700 }
701 # set problem state == 0 (other unit tests, set to 1)
702 msr = SelectableInt(0, 64)
703 msr[MSRb.PR] = 0
704 class ISACaller: pass
705 caller = ISACaller()
706 caller.spr = spr
707 caller.msr = msr
708
709 shift = SelectableInt(5, 6)
710 mask = genmask(shift, 43)
711 print (" mask", bin(mask.value))
712
713 mem = Mem(row_bytes=8, initial_mem=testmem)
714 mem = RADIX(mem, caller)
715 # -----------------------------------------------
716 # |/|RTS1|/| RPDB | RTS2 | RPDS |
717 # -----------------------------------------------
718 # |0|1 2|3|4 55|56 58|59 63|
719 data = SelectableInt(0, 64)
720 data[1:3] = 0b01
721 data[56:59] = 0b11
722 data[59:64] = 0b01101 # mask
723 data[55] = 1
724 (rts, mbits, pgbase) = mem._decode_prte(data)
725 print (" rts", bin(rts.value), rts.bits)
726 print (" mbits", bin(mbits.value), mbits.bits)
727 print (" pgbase", hex(pgbase.value), pgbase.bits)
728 addr = SelectableInt(0x1000, 64)
729 check = mem._segment_check(addr, mbits, shift)
730 print (" segment check", check)
731
732 print("walking tree")
733 addr = SelectableInt(testaddr,64)
734 # pgbase = None
735 mode = None
736 #mbits = None
737 shift = rts
738 result = mem._walk_tree(addr, pgbase, mode, mbits, shift)
739 print(" walking tree result", result)
740 print("should be", testresult)
741 self.assertEqual(result.value, expected,
742 "expected 0x%x got 0x%x" % (expected,
743 result.value))
744
745
746 def test_walk_tree_2(self):
747
748 # test address slightly different
749 testaddr = 0x1101
750 expected = 0x5001101
751
752 # starting prtbl
753 prtbl = 0x1000000
754
755 # set up dummy minimal ISACaller
756 spr = {'DSISR': SelectableInt(0, 64),
757 'DAR': SelectableInt(0, 64),
758 'PIDR': SelectableInt(0, 64),
759 'PRTBL': SelectableInt(prtbl, 64)
760 }
761 # set problem state == 0 (other unit tests, set to 1)
762 msr = SelectableInt(0, 64)
763 msr[MSRb.PR] = 0
764 class ISACaller: pass
765 caller = ISACaller()
766 caller.spr = spr
767 caller.msr = msr
768
769 shift = SelectableInt(5, 6)
770 mask = genmask(shift, 43)
771 print (" mask", bin(mask.value))
772
773 mem = Mem(row_bytes=8, initial_mem=testmem2)
774 mem = RADIX(mem, caller)
775 # -----------------------------------------------
776 # |/|RTS1|/| RPDB | RTS2 | RPDS |
777 # -----------------------------------------------
778 # |0|1 2|3|4 55|56 58|59 63|
779 data = SelectableInt(0, 64)
780 data[1:3] = 0b01
781 data[56:59] = 0b11
782 data[59:64] = 0b01101 # mask
783 data[55] = 1
784 (rts, mbits, pgbase) = mem._decode_prte(data)
785 print (" rts", bin(rts.value), rts.bits)
786 print (" mbits", bin(mbits.value), mbits.bits)
787 print (" pgbase", hex(pgbase.value), pgbase.bits)
788 addr = SelectableInt(0x1000, 64)
789 check = mem._segment_check(addr, mbits, shift)
790 print (" segment check", check)
791
792 print("walking tree")
793 addr = SelectableInt(testaddr,64)
794 # pgbase = None
795 mode = None
796 #mbits = None
797 shift = rts
798 result = mem._walk_tree(addr, pgbase, mode, mbits, shift)
799 print(" walking tree result", result)
800 print("should be", testresult)
801 self.assertEqual(result.value, expected,
802 "expected 0x%x got 0x%x" % (expected,
803 result.value))
804
805
806 if __name__ == '__main__':
807 unittest.main()