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