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: releng/8.3/sys/arm/include/param.h 198728 2009-10-31 18:54:26Z alc $
39 */
40
41 /*
42 * Machine dependent constants for StrongARM
43 */
44
45 /*
46 * Round p (pointer or byte index) up to a correctly-aligned value
47 * for all data types (int, long, ...). The result is unsigned int
48 * and must be cast to any desired pointer type.
49 */
50 #ifndef _ALIGNBYTES
51 #define _ALIGNBYTES (sizeof(int) - 1)
52 #endif
53 #ifndef _ALIGN
54 #define _ALIGN(p) (((unsigned)(p) + _ALIGNBYTES) & ~_ALIGNBYTES)
55 #endif
56
57 #define STACKALIGNBYTES (8 - 1)
58 #define STACKALIGN(p) ((u_int)(p) & ~STACKALIGNBYTES)
59
60 #ifndef _NO_NAMESPACE_POLLUTION
61
62 #define __PCI_REROUTE_INTERRUPT
63
64 #ifndef _MACHINE_PARAM_H_
65 #define _MACHINE_PARAM_H_
66
67 #ifndef MACHINE
68 #define MACHINE "arm"
69 #endif
70 #ifndef MACHINE_ARCH
71 #define MACHINE_ARCH "arm"
72 #endif
73 #define MID_MACHINE MID_ARM6
74
75 #if defined(SMP) || defined(KLD_MODULE)
76 #define MAXCPU 2
77 #else
78 #define MAXCPU 1
79 #endif /* SMP || KLD_MODULE */
80
81 #define ALIGNBYTES _ALIGNBYTES
82 #define ALIGN(p) _ALIGN(p)
83 /*
84 * ALIGNED_POINTER is a boolean macro that checks whether an address
85 * is valid to fetch data elements of type t from on this architecture.
86 * This does not reflect the optimal alignment, just the possibility
87 * (within reasonable limits).
88 */
89 #define ALIGNED_POINTER(p, t) ((((unsigned)(p)) & (sizeof(t)-1)) == 0)
90
91 /*
92 * CACHE_LINE_SIZE is the compile-time maximum cache line size for an
93 * architecture. It should be used with appropriate caution.
94 */
95 #define CACHE_LINE_SHIFT 6
96 #define CACHE_LINE_SIZE (1 << CACHE_LINE_SHIFT)
97
98 #define PAGE_SHIFT 12
99 #define PAGE_SIZE (1 << PAGE_SHIFT) /* Page size */
100 #define PAGE_MASK (PAGE_SIZE - 1)
101 #define NPTEPG (PAGE_SIZE/(sizeof (pt_entry_t)))
102
103 #define PDR_SHIFT 20 /* log2(NBPDR) */
104 #define NBPDR (1 << PDR_SHIFT)
105 #define NPDEPG (1 << (32 - PDR_SHIFT))
106
107 #define MAXPAGESIZES 1 /* maximum number of supported page sizes */
108
109 #ifndef KSTACK_PAGES
110 #define KSTACK_PAGES 2
111 #endif /* !KSTACK_PAGES */
112
113 #ifndef FPCONTEXTSIZE
114 #define FPCONTEXTSIZE (0x100)
115 #endif
116
117 #ifndef KSTACK_GUARD_PAGES
118 #define KSTACK_GUARD_PAGES 1
119 #endif /* !KSTACK_GUARD_PAGES */
120
121 #define USPACE_SVC_STACK_TOP KSTACK_PAGES * PAGE_SIZE
122 #define USPACE_SVC_STACK_BOTTOM (USPACE_SVC_STACK_TOP - 0x1000)
123 #define USPACE_UNDEF_STACK_TOP (USPACE_SVC_STACK_BOTTOM - 0x10)
124 #define USPACE_UNDEF_STACK_BOTTOM (FPCONTEXTSIZE + 10)
125 /*
126 * Mach derived conversion macros
127 */
128 #define trunc_page(x) ((x) & ~PAGE_MASK)
129 #define round_page(x) (((x) + PAGE_MASK) & ~PAGE_MASK)
130 #define trunc_4mpage(x) ((unsigned)(x) & ~PDRMASK)
131 #define round_4mpage(x) ((((unsigned)(x)) + PDRMASK) & ~PDRMASK)
132
133 #define atop(x) ((unsigned)(x) >> PAGE_SHIFT)
134 #define ptoa(x) ((unsigned)(x) << PAGE_SHIFT)
135
136 #define arm32_btop(x) ((unsigned)(x) >> PAGE_SHIFT)
137 #define arm32_ptob(x) ((unsigned)(x) << PAGE_SHIFT)
138
139 #define pgtok(x) ((x) * (PAGE_SIZE / 1024))
140
141 #endif /* !_MACHINE_PARAM_H_ */
142 #endif /* !_NO_NAMESPACE_POLLUTION */
Cache object: 3d795a7ba14314ec5658f3a593bb3b7c
|