1e5acd89cSAndrew Turner /*-
2e5acd89cSAndrew Turner * Copyright (c) 2001 Jake Burkholder.
3e5acd89cSAndrew Turner * All rights reserved.
4e5acd89cSAndrew Turner *
5e5acd89cSAndrew Turner * Redistribution and use in source and binary forms, with or without
6e5acd89cSAndrew Turner * modification, are permitted provided that the following conditions
7e5acd89cSAndrew Turner * are met:
8e5acd89cSAndrew Turner * 1. Redistributions of source code must retain the above copyright
9e5acd89cSAndrew Turner * notice, this list of conditions and the following disclaimer.
10e5acd89cSAndrew Turner * 2. Redistributions in binary form must reproduce the above copyright
11e5acd89cSAndrew Turner * notice, this list of conditions and the following disclaimer in the
12e5acd89cSAndrew Turner * documentation and/or other materials provided with the distribution.
13e5acd89cSAndrew Turner *
14e5acd89cSAndrew Turner * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15e5acd89cSAndrew Turner * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16e5acd89cSAndrew Turner * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17e5acd89cSAndrew Turner * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18e5acd89cSAndrew Turner * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19e5acd89cSAndrew Turner * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20e5acd89cSAndrew Turner * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21e5acd89cSAndrew Turner * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22e5acd89cSAndrew Turner * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23e5acd89cSAndrew Turner * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24e5acd89cSAndrew Turner * SUCH DAMAGE.
25e5acd89cSAndrew Turner */
26e5acd89cSAndrew Turner
27e5acd89cSAndrew Turner #ifndef _MACHINE_STACK_H_
28e5acd89cSAndrew Turner #define _MACHINE_STACK_H_
29e5acd89cSAndrew Turner
30e5acd89cSAndrew Turner #define INKERNEL(va) \
31e5acd89cSAndrew Turner ((va) >= VM_MIN_KERNEL_ADDRESS && (va) <= VM_MAX_KERNEL_ADDRESS)
32e5acd89cSAndrew Turner
333f66bd50SRuslan Bukin struct unwind_state {
344d16f941SJohn Baldwin uintptr_t fp;
354d16f941SJohn Baldwin uintptr_t pc;
363f66bd50SRuslan Bukin };
373f66bd50SRuslan Bukin
38ae953968SJohn Baldwin bool unwind_frame(struct thread *, struct unwind_state *);
393f66bd50SRuslan Bukin
402555f175SKonstantin Belousov #ifdef _SYS_PROC_H_
412555f175SKonstantin Belousov
422555f175SKonstantin Belousov #include <machine/pcb.h>
432555f175SKonstantin Belousov
442555f175SKonstantin Belousov #define GET_STACK_USAGE(total, used) do { \
452555f175SKonstantin Belousov struct thread *td = curthread; \
462555f175SKonstantin Belousov (total) = td->td_kstack_pages * PAGE_SIZE - sizeof(struct pcb); \
472555f175SKonstantin Belousov (used) = td->td_kstack + (total) - (vm_offset_t)&td; \
482555f175SKonstantin Belousov } while (0)
492555f175SKonstantin Belousov
502555f175SKonstantin Belousov static __inline bool
kstack_contains(struct thread * td,vm_offset_t va,size_t len)512555f175SKonstantin Belousov kstack_contains(struct thread *td, vm_offset_t va, size_t len)
522555f175SKonstantin Belousov {
532555f175SKonstantin Belousov return (va >= td->td_kstack && va + len >= va &&
5483a49712SKonstantin Belousov va + len <= td->td_kstack + td->td_kstack_pages * PAGE_SIZE -
5583a49712SKonstantin Belousov sizeof(struct pcb));
562555f175SKonstantin Belousov }
572555f175SKonstantin Belousov #endif /* _SYS_PROC_H_ */
582555f175SKonstantin Belousov
59e5acd89cSAndrew Turner #endif /* !_MACHINE_STACK_H_ */
60