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 >= 6
56#define	_V6_SUFFIX "v6"
57#else
58#define	_V6_SUFFIX ""
59#endif
60
61#ifdef __ARM_BIG_ENDIAN
62#define	_EB_SUFFIX "eb"
63#else
64#define	_EB_SUFFIX ""
65#endif
66
67#ifndef MACHINE
68#define	MACHINE		"arm"
69#endif
70#ifndef MACHINE_ARCH
71#define	MACHINE_ARCH	"arm" _V6_SUFFIX _EB_SUFFIX
72#endif
73
74#if defined(SMP) || defined(KLD_MODULE)
75#ifndef MAXCPU
76#define	MAXCPU		4
77#endif
78#else
79#define	MAXCPU		1
80#endif /* SMP || KLD_MODULE */
81
82#ifndef MAXMEMDOM
83#define	MAXMEMDOM	1
84#endif
85
86#define	ALIGNBYTES	_ALIGNBYTES
87#define	ALIGN(p)	_ALIGN(p)
88/*
89 * ALIGNED_POINTER is a boolean macro that checks whether an address
90 * is valid to fetch data elements of type t from on this architecture.
91 * This does not reflect the optimal alignment, just the possibility
92 * (within reasonable limits).
93 *
94 * armv4 and v5 require alignment to the type's size.  armv6 requires 8-byte
95 * alignment for the ldrd/strd instructions, but otherwise follows armv7 rules.
96 * armv7 requires that an 8-byte type be aligned to at least a 4-byte boundary;
97 * access to smaller types can be unaligned, except that the compiler may
98 * optimize access to adjacent uint32_t values into a single load/store-multiple
99 * instruction which requires 4-byte alignment, so we must provide the most-
100 * pessimistic answer possible even on armv7.
101 */
102#define	ALIGNED_POINTER(p, t)	((((unsigned)(p)) & (sizeof(t)-1)) == 0)
103
104/*
105 * CACHE_LINE_SIZE is the compile-time maximum cache line size for an
106 * architecture.  It should be used with appropriate caution.
107 */
108#define	CACHE_LINE_SHIFT	6
109#define	CACHE_LINE_SIZE		(1 << CACHE_LINE_SHIFT)
110
111#define	PAGE_SHIFT	12
112#define	PAGE_SIZE	(1 << PAGE_SHIFT)	/* Page size */
113#define	PAGE_MASK	(PAGE_SIZE - 1)
114
115#define PDR_SHIFT	20 /* log2(NBPDR) */
116#define NBPDR		(1 << PDR_SHIFT)
117#define PDRMASK		(NBPDR - 1)
118#define NPDEPG          (1 << (32 - PDR_SHIFT))
119
120#define	MAXPAGESIZES	2		/* maximum number of supported page sizes */
121
122#ifndef KSTACK_PAGES
123#define KSTACK_PAGES    2
124#endif /* !KSTACK_PAGES */
125
126#ifndef FPCONTEXTSIZE
127#define FPCONTEXTSIZE	(0x100)
128#endif
129
130#ifndef KSTACK_GUARD_PAGES
131#define KSTACK_GUARD_PAGES	1
132#endif /* !KSTACK_GUARD_PAGES */
133
134#define USPACE_SVC_STACK_TOP		(kstack_pages * PAGE_SIZE)
135
136/*
137 * Mach derived conversion macros
138 */
139#define	trunc_page(x)		((x) & ~PAGE_MASK)
140#define	round_page(x)		(((x) + PAGE_MASK) & ~PAGE_MASK)
141#define	trunc_1mpage(x)		((unsigned)(x) & ~PDRMASK)
142#define	round_1mpage(x)		((((unsigned)(x)) + PDRMASK) & ~PDRMASK)
143
144#define	atop(x)			((unsigned)(x) >> PAGE_SHIFT)
145#define	ptoa(x)			((unsigned)(x) << PAGE_SHIFT)
146
147#define	arm32_btop(x)		((unsigned)(x) >> PAGE_SHIFT)
148#define	arm32_ptob(x)		((unsigned)(x) << PAGE_SHIFT)
149
150#define	pgtok(x)		((x) * (PAGE_SIZE / 1024))
151
152#endif /* !_ARM_INCLUDE_PARAM_H_ */
153