Home | History | Annotate | Line # | Download | only in prekern
pdir.h revision 1.3
      1  1.3  maxv /*	$NetBSD: pdir.h,v 1.3 2017/11/17 07:07:52 maxv Exp $	*/
      2  1.1  maxv 
      3  1.1  maxv /*
      4  1.1  maxv  * Copyright (c) 2017 The NetBSD Foundation, Inc. All rights reserved.
      5  1.1  maxv  *
      6  1.1  maxv  * This code is derived from software contributed to The NetBSD Foundation
      7  1.1  maxv  * by Maxime Villard.
      8  1.1  maxv  *
      9  1.1  maxv  * Redistribution and use in source and binary forms, with or without
     10  1.1  maxv  * modification, are permitted provided that the following conditions
     11  1.1  maxv  * are met:
     12  1.1  maxv  * 1. Redistributions of source code must retain the above copyright
     13  1.1  maxv  *    notice, this list of conditions and the following disclaimer.
     14  1.1  maxv  * 2. Redistributions in binary form must reproduce the above copyright
     15  1.1  maxv  *    notice, this list of conditions and the following disclaimer in the
     16  1.1  maxv  *    documentation and/or other materials provided with the distribution.
     17  1.1  maxv  *
     18  1.1  maxv  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     19  1.1  maxv  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     20  1.1  maxv  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     21  1.1  maxv  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     22  1.1  maxv  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     23  1.1  maxv  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     24  1.1  maxv  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     25  1.1  maxv  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     26  1.1  maxv  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     27  1.1  maxv  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     28  1.1  maxv  * POSSIBILITY OF SUCH DAMAGE.
     29  1.1  maxv  */
     30  1.1  maxv 
     31  1.3  maxv #define PREKERNBASE	0x0
     32  1.1  maxv #define PREKERNTEXTOFF	(PREKERNBASE + 0x100000)
     33  1.1  maxv 
     34  1.1  maxv #define L4_SLOT_PREKERN	0 /* pl4_i(PREKERNBASE) */
     35  1.3  maxv #define L4_SLOT_PTE	255
     36  1.1  maxv 
     37  1.1  maxv #define PDIR_SLOT_KERN	L4_SLOT_PREKERN
     38  1.1  maxv #define PDIR_SLOT_PTE	L4_SLOT_PTE
     39  1.1  maxv 
     40  1.1  maxv #define PTE_BASE	((pt_entry_t *)(L4_SLOT_PTE * NBPD_L4))
     41  1.1  maxv 
     42  1.1  maxv #define L1_BASE	PTE_BASE
     43  1.1  maxv #define L2_BASE	((pd_entry_t *)((char *)L1_BASE + L4_SLOT_PTE * NBPD_L3))
     44  1.1  maxv #define L3_BASE	((pd_entry_t *)((char *)L2_BASE + L4_SLOT_PTE * NBPD_L2))
     45  1.1  maxv #define L4_BASE	((pd_entry_t *)((char *)L3_BASE + L4_SLOT_PTE * NBPD_L1))
     46  1.1  maxv 
     47  1.1  maxv #define NKL4_KIMG_ENTRIES	1
     48  1.1  maxv #define NKL3_KIMG_ENTRIES	1
     49  1.1  maxv #define NKL2_KIMG_ENTRIES	32
     50  1.1  maxv 
     51  1.1  maxv /*
     52  1.1  maxv  * Now we define various constants for playing with virtual addresses.
     53  1.1  maxv  */
     54  1.1  maxv #define L1_SHIFT	12
     55  1.1  maxv #define L2_SHIFT	21
     56  1.1  maxv #define L3_SHIFT	30
     57  1.1  maxv #define L4_SHIFT	39
     58  1.1  maxv #define NBPD_L1		(1UL << L1_SHIFT) /* # bytes mapped by L1 ent (4K) */
     59  1.1  maxv #define NBPD_L2		(1UL << L2_SHIFT) /* # bytes mapped by L2 ent (2MB) */
     60  1.1  maxv #define NBPD_L3		(1UL << L3_SHIFT) /* # bytes mapped by L3 ent (1G) */
     61  1.1  maxv #define NBPD_L4		(1UL << L4_SHIFT) /* # bytes mapped by L4 ent (512G) */
     62  1.1  maxv 
     63  1.1  maxv #define L4_MASK		0x0000ff8000000000
     64  1.1  maxv #define L3_MASK		0x0000007fc0000000
     65  1.1  maxv #define L2_MASK		0x000000003fe00000
     66  1.1  maxv #define L1_MASK		0x00000000001ff000
     67  1.1  maxv 
     68  1.1  maxv #define L4_FRAME	L4_MASK
     69  1.1  maxv #define L3_FRAME	(L4_FRAME|L3_MASK)
     70  1.1  maxv #define L2_FRAME	(L3_FRAME|L2_MASK)
     71  1.1  maxv #define L1_FRAME	(L2_FRAME|L1_MASK)
     72  1.1  maxv 
     73  1.1  maxv /*
     74  1.1  maxv  * Mask to get rid of the sign-extended part of addresses.
     75  1.1  maxv  */
     76  1.1  maxv #define VA_SIGN_MASK		0xffff000000000000
     77  1.1  maxv #define VA_SIGN_NEG(va)		((va) | VA_SIGN_MASK)
     78  1.1  maxv /* XXXfvdl this one's not right */
     79  1.1  maxv #define VA_SIGN_POS(va)		((va) & ~VA_SIGN_MASK)
     80  1.1  maxv 
     81  1.1  maxv /*
     82  1.1  maxv  * pl*_i: generate index into pde/pte arrays in virtual space
     83  1.1  maxv  *
     84  1.1  maxv  * pl_i(va, X) == plX_i(va) <= pl_i_roundup(va, X)
     85  1.1  maxv  */
     86  1.1  maxv #define pl1_i(VA)	(((VA_SIGN_POS(VA)) & L1_FRAME) >> L1_SHIFT)
     87  1.1  maxv #define pl2_i(VA)	(((VA_SIGN_POS(VA)) & L2_FRAME) >> L2_SHIFT)
     88  1.1  maxv #define pl3_i(VA)	(((VA_SIGN_POS(VA)) & L3_FRAME) >> L3_SHIFT)
     89  1.1  maxv #define pl4_i(VA)	(((VA_SIGN_POS(VA)) & L4_FRAME) >> L4_SHIFT)
     90  1.1  maxv 
     91