1/*- 2 * SPDX-License-Identifier: BSD-4-Clause 3 * 4 * Copyright (c) 2001 David E. O'Brien 5 * Copyright (c) 1990 The Regents of the University of California. 6 * All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * William Jolitz. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the University of 22 * California, Berkeley and its contributors. 23 * 4. Neither the name of the University nor the names of its contributors 24 * may be used to endorse or promote products derived from this software 25 * without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 37 * SUCH DAMAGE. 38 * 39 * from: @(#)param.h 5.8 (Berkeley) 6/28/91 40 * $FreeBSD$ 41 */ 42 43#ifndef _POWERPC_INCLUDE_PARAM_H_ 44#define _POWERPC_INCLUDE_PARAM_H_ 45 46/* 47 * Machine dependent constants for PowerPC 48 */ 49 50#include <machine/_align.h> 51 52/* Needed to display interrupts on OFW PCI */ 53#define __PCI_REROUTE_INTERRUPT 54 55#ifndef MACHINE 56#define MACHINE "powerpc" 57#endif 58#ifndef MACHINE_ARCH 59#ifdef __powerpc64__ 60#if defined(__LITTLE_ENDIAN__) 61#define MACHINE_ARCH "powerpc64le" 62#else 63#define MACHINE_ARCH "powerpc64" 64#endif 65#else 66#ifdef __SPE__ 67#define MACHINE_ARCH "powerpcspe" 68#else 69#define MACHINE_ARCH "powerpc" 70#endif 71#endif 72#endif 73#define MID_MACHINE MID_POWERPC 74#ifdef __powerpc64__ 75#ifndef MACHINE_ARCH32 76#define MACHINE_ARCH32 "powerpc" 77#endif 78#endif 79 80#ifdef SMP 81#ifndef MAXCPU 82#define MAXCPU 256 83#endif 84#else 85#define MAXCPU 1 86#endif 87 88#ifndef MAXMEMDOM 89#define MAXMEMDOM 8 90#endif 91 92#define ALIGNBYTES _ALIGNBYTES 93#define ALIGN(p) _ALIGN(p) 94/* 95 * ALIGNED_POINTER is a boolean macro that checks whether an address 96 * is valid to fetch data elements of type t from on this architecture. 97 * This does not reflect the optimal alignment, just the possibility 98 * (within reasonable limits). 99 */ 100#define ALIGNED_POINTER(p, t) ((((uintptr_t)(p)) & (sizeof (t) - 1)) == 0) 101 102/* 103 * CACHE_LINE_SIZE is the compile-time maximum cache line size for an 104 * architecture. It should be used with appropriate caution. 105 */ 106#define CACHE_LINE_SHIFT 7 107#define CACHE_LINE_SIZE (1 << CACHE_LINE_SHIFT) 108 109#define PAGE_SHIFT 12 110#define PAGE_SIZE (1 << PAGE_SHIFT) /* Page size */ 111#define PAGE_MASK (PAGE_SIZE - 1) 112#define NPTEPG (PAGE_SIZE/(sizeof (pt_entry_t))) 113#define NPDEPG (PAGE_SIZE/(sizeof (pt_entry_t))) 114 115#define L1_PAGE_SIZE_SHIFT 39 116#define L1_PAGE_SIZE (1UL<<L1_PAGE_SIZE_SHIFT) 117#define L1_PAGE_MASK (L1_PAGE_SIZE-1) 118 119#define L2_PAGE_SIZE_SHIFT 30 120#define L2_PAGE_SIZE (1UL<<L2_PAGE_SIZE_SHIFT) 121#define L2_PAGE_MASK (L2_PAGE_SIZE-1) 122 123#define L3_PAGE_SIZE_SHIFT 21 124#define L3_PAGE_SIZE (1UL<<L3_PAGE_SIZE_SHIFT) 125#define L3_PAGE_MASK (L3_PAGE_SIZE-1) 126 127#define MAXPAGESIZES 3 /* maximum number of supported page sizes */ 128 129#define RELOCATABLE_KERNEL 1 /* kernel may relocate during startup */ 130 131#ifndef KSTACK_PAGES 132#ifdef __powerpc64__ 133#define KSTACK_PAGES 12 /* includes pcb */ 134#else 135#define KSTACK_PAGES 4 /* includes pcb */ 136#endif 137#endif 138#define KSTACK_GUARD_PAGES 1 /* pages of kstack guard; 0 disables */ 139#define USPACE (kstack_pages * PAGE_SIZE) /* total size of pcb */ 140 141#define COPYFAULT 0x1 142#define FUSUFAULT 0x2 143 144/* 145 * Mach derived conversion macros 146 */ 147#define trunc_page(x) ((x) & ~(PAGE_MASK)) 148#define round_page(x) (((x) + PAGE_MASK) & ~PAGE_MASK) 149#define trunc_2mpage(x) ((unsigned long)(x) & ~L3_PAGE_MASK) 150#define round_2mpage(x) ((((unsigned long)(x)) + L3_PAGE_MASK) & ~L3_PAGE_MASK) 151#define trunc_1gpage(x) ((unsigned long)(x) & ~L2_PAGE_MASK) 152 153#define atop(x) ((x) >> PAGE_SHIFT) 154#define ptoa(x) ((x) << PAGE_SHIFT) 155 156#define powerpc_btop(x) ((x) >> PAGE_SHIFT) 157#define powerpc_ptob(x) ((x) << PAGE_SHIFT) 158 159#define pgtok(x) ((x) * (PAGE_SIZE / 1024UL)) 160 161#define btoc(x) ((vm_offset_t)(((x)+PAGE_MASK)>>PAGE_SHIFT)) 162 163#endif /* !_POWERPC_INCLUDE_PARAM_H_ */ 164