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