1 /*- 2 * Copyright (c) 2001 David E. O'Brien 3 * Copyright (c) 1990 The Regents of the University of California. 4 * All rights reserved. 5 * 6 * This code is derived from software contributed to Berkeley by 7 * William Jolitz. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 3. All advertising materials mentioning features or use of this software 18 * must display the following acknowledgement: 19 * This product includes software developed by the University of 20 * California, Berkeley and its contributors. 21 * 4. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 * 37 * from: @(#)param.h 5.8 (Berkeley) 6/28/91 38 * $FreeBSD$ 39 */ 40 41 #ifndef _ARM_INCLUDE_PARAM_H_ 42 #define _ARM_INCLUDE_PARAM_H_ 43 44 /* 45 * Machine dependent constants for StrongARM 46 */ 47 48 #include <machine/_align.h> 49 50 #define STACKALIGNBYTES (8 - 1) 51 #define STACKALIGN(p) ((u_int)(p) & ~STACKALIGNBYTES) 52 53 #define __PCI_REROUTE_INTERRUPT 54 55 #if __ARM_ARCH >= 7 56 #define _V_SUFFIX "v7" 57 #elif __ARM_ARCH >= 6 58 #define _V_SUFFIX "v6" 59 #else 60 #define _V_SUFFIX "" 61 #endif 62 63 #ifdef __ARM_BIG_ENDIAN 64 #define _EB_SUFFIX "eb" 65 #else 66 #define _EB_SUFFIX "" 67 #endif 68 69 #ifndef MACHINE 70 #define MACHINE "arm" 71 #endif 72 #ifndef MACHINE_ARCH 73 #define MACHINE_ARCH "arm" _V_SUFFIX _EB_SUFFIX 74 #endif 75 76 #if defined(SMP) || defined(KLD_MODULE) 77 #ifndef MAXCPU 78 #define MAXCPU 4 79 #endif 80 #else 81 #define MAXCPU 1 82 #endif /* SMP || KLD_MODULE */ 83 84 #ifndef MAXMEMDOM 85 #define MAXMEMDOM 1 86 #endif 87 88 #define ALIGNBYTES _ALIGNBYTES 89 #define ALIGN(p) _ALIGN(p) 90 /* 91 * ALIGNED_POINTER is a boolean macro that checks whether an address 92 * is valid to fetch data elements of type t from on this architecture. 93 * This does not reflect the optimal alignment, just the possibility 94 * (within reasonable limits). 95 * 96 * armv4 and v5 require alignment to the type's size. armv6 requires 8-byte 97 * alignment for the ldrd/strd instructions, but otherwise follows armv7 rules. 98 * armv7 requires that an 8-byte type be aligned to at least a 4-byte boundary; 99 * access to smaller types can be unaligned, except that the compiler may 100 * optimize access to adjacent uint32_t values into a single load/store-multiple 101 * instruction which requires 4-byte alignment, so we must provide the most- 102 * pessimistic answer possible even on armv7. 103 */ 104 #define ALIGNED_POINTER(p, t) ((((unsigned)(p)) & (sizeof(t)-1)) == 0) 105 106 /* 107 * CACHE_LINE_SIZE is the compile-time maximum cache line size for an 108 * architecture. It should be used with appropriate caution. 109 */ 110 #define CACHE_LINE_SHIFT 6 111 #define CACHE_LINE_SIZE (1 << CACHE_LINE_SHIFT) 112 113 #define PAGE_SHIFT 12 114 #define PAGE_SIZE (1 << PAGE_SHIFT) /* Page size */ 115 #define PAGE_MASK (PAGE_SIZE - 1) 116 117 #define PDR_SHIFT 20 /* log2(NBPDR) */ 118 #define NBPDR (1 << PDR_SHIFT) 119 #define PDRMASK (NBPDR - 1) 120 #define NPDEPG (1 << (32 - PDR_SHIFT)) 121 122 #define MAXPAGESIZES 2 /* maximum number of supported page sizes */ 123 124 #ifndef KSTACK_PAGES 125 #define KSTACK_PAGES 2 126 #endif /* !KSTACK_PAGES */ 127 128 #ifndef FPCONTEXTSIZE 129 #define FPCONTEXTSIZE (0x100) 130 #endif 131 132 #ifndef KSTACK_GUARD_PAGES 133 #define KSTACK_GUARD_PAGES 1 134 #endif /* !KSTACK_GUARD_PAGES */ 135 136 #define USPACE_SVC_STACK_TOP (kstack_pages * PAGE_SIZE) 137 138 /* 139 * Mach derived conversion macros 140 */ 141 #define trunc_page(x) ((x) & ~PAGE_MASK) 142 #define round_page(x) (((x) + PAGE_MASK) & ~PAGE_MASK) 143 #define trunc_1mpage(x) ((unsigned)(x) & ~PDRMASK) 144 #define round_1mpage(x) ((((unsigned)(x)) + PDRMASK) & ~PDRMASK) 145 146 #define atop(x) ((unsigned)(x) >> PAGE_SHIFT) 147 #define ptoa(x) ((unsigned)(x) << PAGE_SHIFT) 148 149 #define arm32_btop(x) ((unsigned)(x) >> PAGE_SHIFT) 150 #define arm32_ptob(x) ((unsigned)(x) << PAGE_SHIFT) 151 152 #define pgtok(x) ((x) * (PAGE_SIZE / 1024)) 153 154 #endif /* !_ARM_INCLUDE_PARAM_H_ */ 155