Linux kernel mirror (for testing)
git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
tjh.dev
kernel
os
linux
1/*
2 * include/asm-parisc/processor.h
3 *
4 * Copyright (C) 1994 Linus Torvalds
5 * Copyright (C) 2001 Grant Grundler
6 */
7
8#ifndef __ASM_PARISC_PROCESSOR_H
9#define __ASM_PARISC_PROCESSOR_H
10
11#ifndef __ASSEMBLY__
12#include <linux/config.h>
13#include <linux/threads.h>
14#include <linux/spinlock_types.h>
15
16#include <asm/hardware.h>
17#include <asm/page.h>
18#include <asm/pdc.h>
19#include <asm/ptrace.h>
20#include <asm/types.h>
21#include <asm/system.h>
22#endif /* __ASSEMBLY__ */
23
24#define KERNEL_STACK_SIZE (4*PAGE_SIZE)
25
26/*
27 * Default implementation of macro that returns current
28 * instruction pointer ("program counter").
29 */
30
31/* We cannot use MFIA as it was added for PA2.0 - prumpf
32
33 At one point there were no "0f/0b" type local symbols in gas for
34 PA-RISC. This is no longer true, but this still seems like the
35 nicest way to implement this. */
36
37#define current_text_addr() ({ void *pc; __asm__("\n\tblr 0,%0\n\tnop":"=r" (pc)); pc; })
38
39#define TASK_SIZE (current->thread.task_size)
40#define TASK_UNMAPPED_BASE (current->thread.map_base)
41
42#define DEFAULT_TASK_SIZE32 (0xFFF00000UL)
43#define DEFAULT_MAP_BASE32 (0x40000000UL)
44
45#ifdef __LP64__
46#define DEFAULT_TASK_SIZE (MAX_ADDRESS-0xf000000)
47#define DEFAULT_MAP_BASE (0x200000000UL)
48#else
49#define DEFAULT_TASK_SIZE DEFAULT_TASK_SIZE32
50#define DEFAULT_MAP_BASE DEFAULT_MAP_BASE32
51#endif
52
53#ifndef __ASSEMBLY__
54
55/*
56 * Data detected about CPUs at boot time which is the same for all CPU's.
57 * HP boxes are SMP - ie identical processors.
58 *
59 * FIXME: some CPU rev info may be processor specific...
60 */
61struct system_cpuinfo_parisc {
62 unsigned int cpu_count;
63 unsigned int cpu_hz;
64 unsigned int hversion;
65 unsigned int sversion;
66 enum cpu_type cpu_type;
67
68 struct {
69 struct pdc_model model;
70 unsigned long versions;
71 unsigned long cpuid;
72 unsigned long capabilities;
73 char sys_model_name[81]; /* PDC-ROM returnes this model name */
74 } pdc;
75
76 char *cpu_name; /* e.g. "PA7300LC (PCX-L2)" */
77 char *family_name; /* e.g. "1.1e" */
78};
79
80
81/* Per CPU data structure - ie varies per CPU. */
82struct cpuinfo_parisc {
83 unsigned long it_value; /* Interval Timer at last timer Intr */
84 unsigned long it_delta; /* Interval delta (tic_10ms / HZ * 100) */
85 unsigned long irq_count; /* number of IRQ's since boot */
86 unsigned long irq_max_cr16; /* longest time to handle a single IRQ */
87 unsigned long cpuid; /* aka slot_number or set to NO_PROC_ID */
88 unsigned long hpa; /* Host Physical address */
89 unsigned long txn_addr; /* MMIO addr of EIR or id_eid */
90#ifdef CONFIG_SMP
91 spinlock_t lock; /* synchronization for ipi's */
92 unsigned long pending_ipi; /* bitmap of type ipi_message_type */
93 unsigned long ipi_count; /* number ipi Interrupts */
94#endif
95 unsigned long bh_count; /* number of times bh was invoked */
96 unsigned long prof_counter; /* per CPU profiling support */
97 unsigned long prof_multiplier; /* per CPU profiling support */
98 unsigned long fp_rev;
99 unsigned long fp_model;
100 unsigned int state;
101 struct parisc_device *dev;
102 unsigned long loops_per_jiffy;
103};
104
105extern struct system_cpuinfo_parisc boot_cpu_data;
106extern struct cpuinfo_parisc cpu_data[NR_CPUS];
107#define current_cpu_data cpu_data[smp_processor_id()]
108
109#define CPU_HVERSION ((boot_cpu_data.hversion >> 4) & 0x0FFF)
110
111typedef struct {
112 int seg;
113} mm_segment_t;
114
115#define ARCH_MIN_TASKALIGN 8
116
117struct thread_struct {
118 struct pt_regs regs;
119 unsigned long task_size;
120 unsigned long map_base;
121 unsigned long flags;
122};
123
124/* Thread struct flags. */
125#define PARISC_UAC_NOPRINT (1UL << 0) /* see prctl and unaligned.c */
126#define PARISC_UAC_SIGBUS (1UL << 1)
127#define PARISC_KERNEL_DEATH (1UL << 31) /* see die_if_kernel()... */
128
129#define PARISC_UAC_SHIFT 0
130#define PARISC_UAC_MASK (PARISC_UAC_NOPRINT|PARISC_UAC_SIGBUS)
131
132#define SET_UNALIGN_CTL(task,value) \
133 ({ \
134 (task)->thread.flags = (((task)->thread.flags & ~PARISC_UAC_MASK) \
135 | (((value) << PARISC_UAC_SHIFT) & \
136 PARISC_UAC_MASK)); \
137 0; \
138 })
139
140#define GET_UNALIGN_CTL(task,addr) \
141 ({ \
142 put_user(((task)->thread.flags & PARISC_UAC_MASK) \
143 >> PARISC_UAC_SHIFT, (int __user *) (addr)); \
144 })
145
146#define INIT_THREAD { \
147 .regs = { .gr = { 0, }, \
148 .fr = { 0, }, \
149 .sr = { 0, }, \
150 .iasq = { 0, }, \
151 .iaoq = { 0, }, \
152 .cr27 = 0, \
153 }, \
154 .task_size = DEFAULT_TASK_SIZE, \
155 .map_base = DEFAULT_MAP_BASE, \
156 .flags = 0 \
157 }
158
159/*
160 * Return saved PC of a blocked thread. This is used by ps mostly.
161 */
162
163unsigned long thread_saved_pc(struct task_struct *t);
164void show_trace(struct task_struct *task, unsigned long *stack);
165
166/*
167 * Start user thread in another space.
168 *
169 * Note that we set both the iaoq and r31 to the new pc. When
170 * the kernel initially calls execve it will return through an
171 * rfi path that will use the values in the iaoq. The execve
172 * syscall path will return through the gateway page, and
173 * that uses r31 to branch to.
174 *
175 * For ELF we clear r23, because the dynamic linker uses it to pass
176 * the address of the finalizer function.
177 *
178 * We also initialize sr3 to an illegal value (illegal for our
179 * implementation, not for the architecture).
180 */
181typedef unsigned int elf_caddr_t;
182
183#define start_thread_som(regs, new_pc, new_sp) do { \
184 unsigned long *sp = (unsigned long *)new_sp; \
185 __u32 spaceid = (__u32)current->mm->context; \
186 unsigned long pc = (unsigned long)new_pc; \
187 /* offset pc for priv. level */ \
188 pc |= 3; \
189 \
190 set_fs(USER_DS); \
191 regs->iasq[0] = spaceid; \
192 regs->iasq[1] = spaceid; \
193 regs->iaoq[0] = pc; \
194 regs->iaoq[1] = pc + 4; \
195 regs->sr[2] = LINUX_GATEWAY_SPACE; \
196 regs->sr[3] = 0xffff; \
197 regs->sr[4] = spaceid; \
198 regs->sr[5] = spaceid; \
199 regs->sr[6] = spaceid; \
200 regs->sr[7] = spaceid; \
201 regs->gr[ 0] = USER_PSW; \
202 regs->gr[30] = ((new_sp)+63)&~63; \
203 regs->gr[31] = pc; \
204 \
205 get_user(regs->gr[26],&sp[0]); \
206 get_user(regs->gr[25],&sp[-1]); \
207 get_user(regs->gr[24],&sp[-2]); \
208 get_user(regs->gr[23],&sp[-3]); \
209} while(0)
210
211/* The ELF abi wants things done a "wee bit" differently than
212 * som does. Supporting this behavior here avoids
213 * having our own version of create_elf_tables.
214 *
215 * Oh, and yes, that is not a typo, we are really passing argc in r25
216 * and argv in r24 (rather than r26 and r25). This is because that's
217 * where __libc_start_main wants them.
218 *
219 * Duplicated from dl-machine.h for the benefit of readers:
220 *
221 * Our initial stack layout is rather different from everyone else's
222 * due to the unique PA-RISC ABI. As far as I know it looks like
223 * this:
224
225 ----------------------------------- (user startup code creates this frame)
226 | 32 bytes of magic |
227 |---------------------------------|
228 | 32 bytes argument/sp save area |
229 |---------------------------------| (bprm->p)
230 | ELF auxiliary info |
231 | (up to 28 words) |
232 |---------------------------------|
233 | NULL |
234 |---------------------------------|
235 | Environment pointers |
236 |---------------------------------|
237 | NULL |
238 |---------------------------------|
239 | Argument pointers |
240 |---------------------------------| <- argv
241 | argc (1 word) |
242 |---------------------------------| <- bprm->exec (HACK!)
243 | N bytes of slack |
244 |---------------------------------|
245 | filename passed to execve |
246 |---------------------------------| (mm->env_end)
247 | env strings |
248 |---------------------------------| (mm->env_start, mm->arg_end)
249 | arg strings |
250 |---------------------------------|
251 | additional faked arg strings if |
252 | we're invoked via binfmt_script |
253 |---------------------------------| (mm->arg_start)
254 stack base is at TASK_SIZE - rlim_max.
255
256on downward growing arches, it looks like this:
257 stack base at TASK_SIZE
258 | filename passed to execve
259 | env strings
260 | arg strings
261 | faked arg strings
262 | slack
263 | ELF
264 | envps
265 | argvs
266 | argc
267
268 * The pleasant part of this is that if we need to skip arguments we
269 * can just decrement argc and move argv, because the stack pointer
270 * is utterly unrelated to the location of the environment and
271 * argument vectors.
272 *
273 * Note that the S/390 people took the easy way out and hacked their
274 * GCC to make the stack grow downwards.
275 *
276 * Final Note: For entry from syscall, the W (wide) bit of the PSW
277 * is stuffed into the lowest bit of the user sp (%r30), so we fill
278 * it in here from the current->personality
279 */
280
281#ifdef __LP64__
282#define USER_WIDE_MODE (personality(current->personality) == PER_LINUX)
283#else
284#define USER_WIDE_MODE 0
285#endif
286
287#define start_thread(regs, new_pc, new_sp) do { \
288 elf_addr_t *sp = (elf_addr_t *)new_sp; \
289 __u32 spaceid = (__u32)current->mm->context; \
290 elf_addr_t pc = (elf_addr_t)new_pc | 3; \
291 elf_caddr_t *argv = (elf_caddr_t *)bprm->exec + 1; \
292 \
293 set_fs(USER_DS); \
294 regs->iasq[0] = spaceid; \
295 regs->iasq[1] = spaceid; \
296 regs->iaoq[0] = pc; \
297 regs->iaoq[1] = pc + 4; \
298 regs->sr[2] = LINUX_GATEWAY_SPACE; \
299 regs->sr[3] = 0xffff; \
300 regs->sr[4] = spaceid; \
301 regs->sr[5] = spaceid; \
302 regs->sr[6] = spaceid; \
303 regs->sr[7] = spaceid; \
304 regs->gr[ 0] = USER_PSW | (USER_WIDE_MODE ? PSW_W : 0); \
305 regs->fr[ 0] = 0LL; \
306 regs->fr[ 1] = 0LL; \
307 regs->fr[ 2] = 0LL; \
308 regs->fr[ 3] = 0LL; \
309 regs->gr[30] = (((unsigned long)sp + 63) &~ 63) | (USER_WIDE_MODE ? 1 : 0); \
310 regs->gr[31] = pc; \
311 \
312 get_user(regs->gr[25], (argv - 1)); \
313 regs->gr[24] = (long) argv; \
314 regs->gr[23] = 0; \
315} while(0)
316
317struct task_struct;
318struct mm_struct;
319
320/* Free all resources held by a thread. */
321extern void release_thread(struct task_struct *);
322extern int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags);
323
324/* Prepare to copy thread state - unlazy all lazy status */
325#define prepare_to_copy(tsk) do { } while (0)
326
327extern void map_hpux_gateway_page(struct task_struct *tsk, struct mm_struct *mm);
328
329extern unsigned long get_wchan(struct task_struct *p);
330
331#define KSTK_EIP(tsk) ((tsk)->thread.regs.iaoq[0])
332#define KSTK_ESP(tsk) ((tsk)->thread.regs.gr[30])
333
334
335/*
336 * PA 2.0 defines data prefetch instructions on page 6-11 of the Kane book.
337 * In addition, many implementations do hardware prefetching of both
338 * instructions and data.
339 *
340 * PA7300LC (page 14-4 of the ERS) also implements prefetching by a load
341 * to gr0 but not in a way that Linux can use. If the load would cause an
342 * interruption (eg due to prefetching 0), it is suppressed on PA2.0
343 * processors, but not on 7300LC.
344 */
345#ifdef CONFIG_PREFETCH
346#define ARCH_HAS_PREFETCH
347#define ARCH_HAS_PREFETCHW
348
349extern inline void prefetch(const void *addr)
350{
351 __asm__("ldw 0(%0), %%r0" : : "r" (addr));
352}
353
354extern inline void prefetchw(const void *addr)
355{
356 __asm__("ldd 0(%0), %%r0" : : "r" (addr));
357}
358#endif
359
360#define cpu_relax() barrier()
361
362#endif /* __ASSEMBLY__ */
363
364#endif /* __ASM_PARISC_PROCESSOR_H */