1 /*-
2 * Copyright (c) 2001 Jake Burkholder.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 */
26
27 #ifndef _MACHINE_STACK_H_
28 #define _MACHINE_STACK_H_
29
30 #define INKERNEL(va) \
31 ((va) >= VM_MIN_KERNEL_ADDRESS && (va) <= VM_MAX_KERNEL_ADDRESS)
32
33 struct unwind_state {
34 uintptr_t fp;
35 uintptr_t pc;
36 };
37
38 bool unwind_frame(struct thread *, struct unwind_state *);
39
40 #ifdef _SYS_PROC_H_
41
42 #include <machine/pcb.h>
43
44 #define GET_STACK_USAGE(total, used) do { \
45 struct thread *td = curthread; \
46 (total) = td->td_kstack_pages * PAGE_SIZE - sizeof(struct pcb); \
47 (used) = td->td_kstack + (total) - (vm_offset_t)&td; \
48 } while (0)
49
50 static __inline bool
kstack_contains(struct thread * td,vm_offset_t va,size_t len)51 kstack_contains(struct thread *td, vm_offset_t va, size_t len)
52 {
53 return (va >= td->td_kstack && va + len >= va &&
54 va + len <= td->td_kstack + td->td_kstack_pages * PAGE_SIZE -
55 sizeof(struct pcb));
56 }
57 #endif /* _SYS_PROC_H_ */
58
59 #endif /* !_MACHINE_STACK_H_ */
60