cpu.h revision 69003 
1/*-
2 * Copyright (c) 1990 The Regents of the University of California.
3 * All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * William Jolitz.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 *    notice, this list of conditions and the following disclaimer in the
15 *    documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 *    must display the following acknowledgement:
18 *	This product includes software developed by the University of
19 *	California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 *    may be used to endorse or promote products derived from this software
22 *    without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 *
36 *	from: @(#)cpu.h	5.4 (Berkeley) 5/9/91
37 * $FreeBSD: head/sys/amd64/include/cpu.h 69003 2000-11-21 19:55:21Z markm $
38 */
39
40#ifndef _MACHINE_CPU_H_
41#define	_MACHINE_CPU_H_
42
43/*
44 * Definitions unique to i386 cpu support.
45 */
46#include <machine/psl.h>
47#include <machine/frame.h>
48#include <machine/segments.h>
49#include <machine/globals.h>
50#include <machine/md_var.h>
51#include <machine/specialreg.h>
52
53/*
54 * definitions of cpu-dependent requirements
55 * referenced in generic code
56 */
57#undef	COPY_SIGCODE		/* don't copy sigcode above user stack in exec */
58
59#define	cpu_exec(p)	/* nothing */
60#define cpu_swapin(p)	/* nothing */
61#define cpu_setstack(p, ap)		((p)->p_md.md_regs[SP] = (ap))
62
63#define	CLKF_USERMODE(framep) \
64	((ISPL((framep)->cf_cs) == SEL_UPL) || (framep->cf_eflags & PSL_VM))
65
66#define CLKF_INTR(framep)	(intr_nesting_level >= 2)
67#define	CLKF_PC(framep)		((framep)->cf_eip)
68
69/*
70 * astpending bits
71 */
72#define	AST_PENDING	0x00000001
73#define	AST_RESCHED	0x00000002
74
75/*
76 * Preempt the current process if in interrupt from user mode,
77 * or after the current trap/syscall if in system mode.
78 *
79 * XXX: if astpending is later changed to an |= here due to more flags being
80 * added, we will have an atomicy problem.  The type of atomicy we need is
81 * a non-locked orl.
82 */
83#define	need_resched() do {						\
84	PCPU_SET(astpending, AST_RESCHED|AST_PENDING);			\
85} while (0)
86#define	resched_wanted()	(astpending & AST_RESCHED)
87
88/*
89 * Arrange to handle pending profiling ticks before returning to user mode.
90 *
91 * XXX this is now poorly named and implemented.  It used to handle only a
92 * single tick and the P_OWEUPC flag served as a counter.  Now there is a
93 * counter in the proc table and flag isn't really necessary.
94 */
95#define	need_proftick(p) \
96	do { (p)->p_flag |= P_OWEUPC; aston(); } while (0)
97
98/*
99 * Notify the current process (p) that it has a signal pending,
100 * process as soon as possible.
101 *
102 * XXX: aston() really needs to be an atomic (not locked, but an orl),
103 * in case need_resched() is set by an interrupt.  But with astpending a
104 * per-cpu variable this is not trivial to do efficiently.  For now we blow
105 * it off (asynchronous need_resched() conflicts are not critical).
106 */
107#define	signotify(p)	aston()
108#define	aston() do {							\
109	PCPU_SET(astpending, astpending | AST_PENDING);			\
110} while (0)
111#define astoff()
112
113/*
114 * CTL_MACHDEP definitions.
115 */
116#define CPU_CONSDEV		1	/* dev_t: console terminal device */
117#define	CPU_ADJKERNTZ		2	/* int:	timezone offset	(seconds) */
118#define	CPU_DISRTCSET		3	/* int: disable resettodr() call */
119#define CPU_BOOTINFO		4	/* struct: bootinfo */
120#define	CPU_WALLCLOCK		5	/* int:	indicates wall CMOS clock */
121#define	CPU_MAXID		6	/* number of valid machdep ids */
122
123#define CTL_MACHDEP_NAMES { \
124	{ 0, 0 }, \
125	{ "console_device", CTLTYPE_STRUCT }, \
126	{ "adjkerntz", CTLTYPE_INT }, \
127	{ "disable_rtc_set", CTLTYPE_INT }, \
128	{ "bootinfo", CTLTYPE_STRUCT }, \
129	{ "wall_cmos_clock", CTLTYPE_INT }, \
130}
131
132#ifdef _KERNEL
133extern char	btext[];
134extern char	etext[];
135
136void	fork_trampoline __P((void));
137void	fork_return __P((struct proc *, struct trapframe));
138
139/*
140 * Return contents of in-cpu fast counter as a sort of "bogo-time"
141 * for non-critical timing.
142 */
143static __inline u_int64_t
144get_cyclecount(void)
145{
146#if defined(I386_CPU) || defined(I486_CPU)
147	struct timespec tv;
148
149	if ((cpu_feature & CPUID_TSC) == 0) {
150		nanotime(&tv);
151		return (tv.tv_sec * (u_int64_t)1000000000 + tv.tv_nsec);
152	}
153#endif
154	return (rdtsc());
155}
156
157#endif
158
159#endif /* !_MACHINE_CPU_H_ */
160