2005-01-05 21:58:49 +00:00
|
|
|
/*-
|
2017-11-18 14:26:50 +00:00
|
|
|
* SPDX-License-Identifier: BSD-4-Clause
|
|
|
|
|
*
|
2004-05-14 11:46:45 +00:00
|
|
|
* Copyright (c) 1991 Regents of the University of California.
|
|
|
|
|
* All rights reserved.
|
|
|
|
|
*
|
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
|
* are met:
|
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
|
* without specific prior written permission.
|
|
|
|
|
*
|
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
|
*
|
|
|
|
|
* from: @(#)proc.h 7.1 (Berkeley) 5/15/91
|
|
|
|
|
* from: FreeBSD: src/sys/i386/include/proc.h,v 1.11 2001/06/29
|
|
|
|
|
* $FreeBSD$
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef _MACHINE_PROC_H_
|
|
|
|
|
#define _MACHINE_PROC_H_
|
|
|
|
|
|
|
|
|
|
struct mdthread {
|
Divorce critical sections from spinlocks. Critical sections as denoted by
critical_enter() and critical_exit() are now solely a mechanism for
deferring kernel preemptions. They no longer have any affect on
interrupts. This means that standalone critical sections are now very
cheap as they are simply unlocked integer increments and decrements for the
common case.
Spin mutexes now use a separate KPI implemented in MD code: spinlock_enter()
and spinlock_exit(). This KPI is responsible for providing whatever MD
guarantees are needed to ensure that a thread holding a spin lock won't
be preempted by any other code that will try to lock the same lock. For
now all archs continue to block interrupts in a "spinlock section" as they
did formerly in all critical sections. Note that I've also taken this
opportunity to push a few things into MD code rather than MI. For example,
critical_fork_exit() no longer exists. Instead, MD code ensures that new
threads have the correct state when they are created. Also, we no longer
try to fixup the idlethreads for APs in MI code. Instead, each arch sets
the initial curthread and adjusts the state of the idle thread it borrows
in order to perform the initial context switch.
This change is largely a big NOP, but the cleaner separation it provides
will allow for more efficient alternative locking schemes in other parts
of the kernel (bare critical sections rather than per-CPU spin mutexes
for per-CPU data for example).
Reviewed by: grehan, cognet, arch@, others
Tested on: i386, alpha, sparc64, powerpc, arm, possibly more
2005-04-04 21:53:56 +00:00
|
|
|
int md_spinlock_count; /* (k) */
|
|
|
|
|
register_t md_saved_cspr; /* (k) */
|
2015-01-03 22:33:18 +00:00
|
|
|
register_t md_spurflt_addr; /* (k) Spurious page fault address. */
|
2005-01-10 22:43:16 +00:00
|
|
|
int md_ptrace_instr;
|
|
|
|
|
int md_ptrace_addr;
|
2015-11-02 16:56:34 +00:00
|
|
|
int md_ptrace_instr_alt;
|
|
|
|
|
int md_ptrace_addr_alt;
|
2004-05-14 11:46:45 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct mdproc {
|
2021-11-03 19:53:48 +00:00
|
|
|
long md_dummy;
|
2004-05-14 11:46:45 +00:00
|
|
|
};
|
|
|
|
|
|
2013-01-17 09:52:35 +00:00
|
|
|
#define KINFO_PROC_SIZE 816
|
2010-04-24 12:49:52 +00:00
|
|
|
|
2021-11-25 16:01:11 +00:00
|
|
|
#ifdef _KERNEL
|
|
|
|
|
#include <machine/pcb.h>
|
|
|
|
|
|
|
|
|
|
/* Get the current kernel thread stack usage. */
|
|
|
|
|
#define GET_STACK_USAGE(total, used) do { \
|
|
|
|
|
struct thread *td = curthread; \
|
|
|
|
|
(total) = td->td_kstack_pages * PAGE_SIZE - sizeof(struct pcb); \
|
|
|
|
|
(used) = td->td_kstack + (total) - (vm_offset_t)&td; \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
|
#endif /* _KERNEL */
|
2004-05-14 11:46:45 +00:00
|
|
|
#endif /* !_MACHINE_PROC_H_ */
|
