Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2000, 2001, 2002 Jeff Dike (jdike@karaya.com) |
| 3 | * Copyright 2003 PathScale, Inc. |
| 4 | * Licensed under the GPL |
| 5 | */ |
| 6 | |
| 7 | #include "linux/config.h" |
| 8 | #include "linux/kernel.h" |
| 9 | #include "linux/sched.h" |
| 10 | #include "linux/interrupt.h" |
| 11 | #include "linux/mm.h" |
| 12 | #include "linux/slab.h" |
| 13 | #include "linux/utsname.h" |
| 14 | #include "linux/fs.h" |
| 15 | #include "linux/utime.h" |
| 16 | #include "linux/smp_lock.h" |
| 17 | #include "linux/module.h" |
| 18 | #include "linux/init.h" |
| 19 | #include "linux/capability.h" |
| 20 | #include "linux/vmalloc.h" |
| 21 | #include "linux/spinlock.h" |
| 22 | #include "linux/proc_fs.h" |
| 23 | #include "linux/ptrace.h" |
| 24 | #include "linux/random.h" |
| 25 | #include "asm/unistd.h" |
| 26 | #include "asm/mman.h" |
| 27 | #include "asm/segment.h" |
| 28 | #include "asm/stat.h" |
| 29 | #include "asm/pgtable.h" |
| 30 | #include "asm/processor.h" |
| 31 | #include "asm/tlbflush.h" |
| 32 | #include "asm/uaccess.h" |
| 33 | #include "asm/user.h" |
| 34 | #include "user_util.h" |
| 35 | #include "kern_util.h" |
| 36 | #include "kern.h" |
| 37 | #include "signal_kern.h" |
| 38 | #include "signal_user.h" |
| 39 | #include "init.h" |
| 40 | #include "irq_user.h" |
| 41 | #include "mem_user.h" |
| 42 | #include "time_user.h" |
| 43 | #include "tlb.h" |
| 44 | #include "frame_kern.h" |
| 45 | #include "sigcontext.h" |
| 46 | #include "2_5compat.h" |
| 47 | #include "os.h" |
| 48 | #include "mode.h" |
| 49 | #include "mode_kern.h" |
| 50 | #include "choose-mode.h" |
| 51 | |
| 52 | /* This is a per-cpu array. A processor only modifies its entry and it only |
| 53 | * cares about its entry, so it's OK if another processor is modifying its |
| 54 | * entry. |
| 55 | */ |
| 56 | struct cpu_task cpu_tasks[NR_CPUS] = { [0 ... NR_CPUS - 1] = { -1, NULL } }; |
| 57 | |
| 58 | struct task_struct *get_task(int pid, int require) |
| 59 | { |
| 60 | struct task_struct *ret; |
| 61 | |
| 62 | read_lock(&tasklist_lock); |
| 63 | ret = find_task_by_pid(pid); |
| 64 | read_unlock(&tasklist_lock); |
| 65 | |
| 66 | if(require && (ret == NULL)) panic("get_task couldn't find a task\n"); |
| 67 | return(ret); |
| 68 | } |
| 69 | |
| 70 | int external_pid(void *t) |
| 71 | { |
| 72 | struct task_struct *task = t ? t : current; |
| 73 | |
| 74 | return(CHOOSE_MODE_PROC(external_pid_tt, external_pid_skas, task)); |
| 75 | } |
| 76 | |
| 77 | int pid_to_processor_id(int pid) |
| 78 | { |
| 79 | int i; |
| 80 | |
| 81 | for(i = 0; i < ncpus; i++){ |
| 82 | if(cpu_tasks[i].pid == pid) return(i); |
| 83 | } |
| 84 | return(-1); |
| 85 | } |
| 86 | |
| 87 | void free_stack(unsigned long stack, int order) |
| 88 | { |
| 89 | free_pages(stack, order); |
| 90 | } |
| 91 | |
| 92 | unsigned long alloc_stack(int order, int atomic) |
| 93 | { |
| 94 | unsigned long page; |
| 95 | int flags = GFP_KERNEL; |
| 96 | |
| 97 | if(atomic) flags |= GFP_ATOMIC; |
| 98 | page = __get_free_pages(flags, order); |
| 99 | if(page == 0) |
| 100 | return(0); |
| 101 | stack_protections(page); |
| 102 | return(page); |
| 103 | } |
| 104 | |
| 105 | int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags) |
| 106 | { |
| 107 | int pid; |
| 108 | |
| 109 | current->thread.request.u.thread.proc = fn; |
| 110 | current->thread.request.u.thread.arg = arg; |
| 111 | pid = do_fork(CLONE_VM | CLONE_UNTRACED | flags, 0, NULL, 0, NULL, |
| 112 | NULL); |
| 113 | if(pid < 0) |
| 114 | panic("do_fork failed in kernel_thread, errno = %d", pid); |
| 115 | return(pid); |
| 116 | } |
| 117 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 118 | void set_current(void *t) |
| 119 | { |
| 120 | struct task_struct *task = t; |
| 121 | |
| 122 | cpu_tasks[task->thread_info->cpu] = ((struct cpu_task) |
| 123 | { external_pid(task), task }); |
| 124 | } |
| 125 | |
| 126 | void *_switch_to(void *prev, void *next, void *last) |
| 127 | { |
| 128 | return(CHOOSE_MODE(switch_to_tt(prev, next), |
| 129 | switch_to_skas(prev, next))); |
| 130 | } |
| 131 | |
| 132 | void interrupt_end(void) |
| 133 | { |
| 134 | if(need_resched()) schedule(); |
| 135 | if(test_tsk_thread_flag(current, TIF_SIGPENDING)) do_signal(); |
| 136 | } |
| 137 | |
| 138 | void release_thread(struct task_struct *task) |
| 139 | { |
| 140 | CHOOSE_MODE(release_thread_tt(task), release_thread_skas(task)); |
| 141 | } |
| 142 | |
| 143 | void exit_thread(void) |
| 144 | { |
| 145 | CHOOSE_MODE(exit_thread_tt(), exit_thread_skas()); |
| 146 | unprotect_stack((unsigned long) current_thread); |
| 147 | } |
| 148 | |
| 149 | void *get_current(void) |
| 150 | { |
| 151 | return(current); |
| 152 | } |
| 153 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 154 | int copy_thread(int nr, unsigned long clone_flags, unsigned long sp, |
| 155 | unsigned long stack_top, struct task_struct * p, |
| 156 | struct pt_regs *regs) |
| 157 | { |
| 158 | p->thread = (struct thread_struct) INIT_THREAD; |
| 159 | return(CHOOSE_MODE_PROC(copy_thread_tt, copy_thread_skas, nr, |
| 160 | clone_flags, sp, stack_top, p, regs)); |
| 161 | } |
| 162 | |
| 163 | void initial_thread_cb(void (*proc)(void *), void *arg) |
| 164 | { |
| 165 | int save_kmalloc_ok = kmalloc_ok; |
| 166 | |
| 167 | kmalloc_ok = 0; |
| 168 | CHOOSE_MODE_PROC(initial_thread_cb_tt, initial_thread_cb_skas, proc, |
| 169 | arg); |
| 170 | kmalloc_ok = save_kmalloc_ok; |
| 171 | } |
| 172 | |
| 173 | unsigned long stack_sp(unsigned long page) |
| 174 | { |
| 175 | return(page + PAGE_SIZE - sizeof(void *)); |
| 176 | } |
| 177 | |
| 178 | int current_pid(void) |
| 179 | { |
| 180 | return(current->pid); |
| 181 | } |
| 182 | |
| 183 | void default_idle(void) |
| 184 | { |
| 185 | uml_idle_timer(); |
| 186 | |
| 187 | atomic_inc(&init_mm.mm_count); |
| 188 | current->mm = &init_mm; |
| 189 | current->active_mm = &init_mm; |
| 190 | |
| 191 | while(1){ |
| 192 | /* endless idle loop with no priority at all */ |
| 193 | SET_PRI(current); |
| 194 | |
| 195 | /* |
| 196 | * although we are an idle CPU, we do not want to |
| 197 | * get into the scheduler unnecessarily. |
| 198 | */ |
| 199 | if(need_resched()) |
| 200 | schedule(); |
| 201 | |
| 202 | idle_sleep(10); |
| 203 | } |
| 204 | } |
| 205 | |
| 206 | void cpu_idle(void) |
| 207 | { |
| 208 | CHOOSE_MODE(init_idle_tt(), init_idle_skas()); |
| 209 | } |
| 210 | |
| 211 | int page_size(void) |
| 212 | { |
| 213 | return(PAGE_SIZE); |
| 214 | } |
| 215 | |
| 216 | unsigned long page_mask(void) |
| 217 | { |
| 218 | return(PAGE_MASK); |
| 219 | } |
| 220 | |
| 221 | void *um_virt_to_phys(struct task_struct *task, unsigned long addr, |
| 222 | pte_t *pte_out) |
| 223 | { |
| 224 | pgd_t *pgd; |
| 225 | pud_t *pud; |
| 226 | pmd_t *pmd; |
| 227 | pte_t *pte; |
| 228 | |
| 229 | if(task->mm == NULL) |
| 230 | return(ERR_PTR(-EINVAL)); |
| 231 | pgd = pgd_offset(task->mm, addr); |
| 232 | if(!pgd_present(*pgd)) |
| 233 | return(ERR_PTR(-EINVAL)); |
| 234 | |
| 235 | pud = pud_offset(pgd, addr); |
| 236 | if(!pud_present(*pud)) |
| 237 | return(ERR_PTR(-EINVAL)); |
| 238 | |
| 239 | pmd = pmd_offset(pud, addr); |
| 240 | if(!pmd_present(*pmd)) |
| 241 | return(ERR_PTR(-EINVAL)); |
| 242 | |
| 243 | pte = pte_offset_kernel(pmd, addr); |
| 244 | if(!pte_present(*pte)) |
| 245 | return(ERR_PTR(-EINVAL)); |
| 246 | |
| 247 | if(pte_out != NULL) |
| 248 | *pte_out = *pte; |
| 249 | return((void *) (pte_val(*pte) & PAGE_MASK) + (addr & ~PAGE_MASK)); |
| 250 | } |
| 251 | |
| 252 | char *current_cmd(void) |
| 253 | { |
| 254 | #if defined(CONFIG_SMP) || defined(CONFIG_HIGHMEM) |
| 255 | return("(Unknown)"); |
| 256 | #else |
| 257 | void *addr = um_virt_to_phys(current, current->mm->arg_start, NULL); |
| 258 | return IS_ERR(addr) ? "(Unknown)": __va((unsigned long) addr); |
| 259 | #endif |
| 260 | } |
| 261 | |
| 262 | void force_sigbus(void) |
| 263 | { |
| 264 | printk(KERN_ERR "Killing pid %d because of a lack of memory\n", |
| 265 | current->pid); |
| 266 | lock_kernel(); |
| 267 | sigaddset(¤t->pending.signal, SIGBUS); |
| 268 | recalc_sigpending(); |
| 269 | current->flags |= PF_SIGNALED; |
| 270 | do_exit(SIGBUS | 0x80); |
| 271 | } |
| 272 | |
| 273 | void dump_thread(struct pt_regs *regs, struct user *u) |
| 274 | { |
| 275 | } |
| 276 | |
| 277 | void enable_hlt(void) |
| 278 | { |
| 279 | panic("enable_hlt"); |
| 280 | } |
| 281 | |
| 282 | EXPORT_SYMBOL(enable_hlt); |
| 283 | |
| 284 | void disable_hlt(void) |
| 285 | { |
| 286 | panic("disable_hlt"); |
| 287 | } |
| 288 | |
| 289 | EXPORT_SYMBOL(disable_hlt); |
| 290 | |
| 291 | void *um_kmalloc(int size) |
| 292 | { |
| 293 | return(kmalloc(size, GFP_KERNEL)); |
| 294 | } |
| 295 | |
| 296 | void *um_kmalloc_atomic(int size) |
| 297 | { |
| 298 | return(kmalloc(size, GFP_ATOMIC)); |
| 299 | } |
| 300 | |
| 301 | void *um_vmalloc(int size) |
| 302 | { |
| 303 | return(vmalloc(size)); |
| 304 | } |
| 305 | |
| 306 | unsigned long get_fault_addr(void) |
| 307 | { |
| 308 | return((unsigned long) current->thread.fault_addr); |
| 309 | } |
| 310 | |
| 311 | EXPORT_SYMBOL(get_fault_addr); |
| 312 | |
| 313 | void not_implemented(void) |
| 314 | { |
| 315 | printk(KERN_DEBUG "Something isn't implemented in here\n"); |
| 316 | } |
| 317 | |
| 318 | EXPORT_SYMBOL(not_implemented); |
| 319 | |
| 320 | int user_context(unsigned long sp) |
| 321 | { |
| 322 | unsigned long stack; |
| 323 | |
| 324 | stack = sp & (PAGE_MASK << CONFIG_KERNEL_STACK_ORDER); |
| 325 | return(stack != (unsigned long) current_thread); |
| 326 | } |
| 327 | |
| 328 | extern void remove_umid_dir(void); |
| 329 | |
| 330 | __uml_exitcall(remove_umid_dir); |
| 331 | |
| 332 | extern exitcall_t __uml_exitcall_begin, __uml_exitcall_end; |
| 333 | |
| 334 | void do_uml_exitcalls(void) |
| 335 | { |
| 336 | exitcall_t *call; |
| 337 | |
| 338 | call = &__uml_exitcall_end; |
| 339 | while (--call >= &__uml_exitcall_begin) |
| 340 | (*call)(); |
| 341 | } |
| 342 | |
| 343 | char *uml_strdup(char *string) |
| 344 | { |
| 345 | char *new; |
| 346 | |
| 347 | new = kmalloc(strlen(string) + 1, GFP_KERNEL); |
| 348 | if(new == NULL) return(NULL); |
| 349 | strcpy(new, string); |
| 350 | return(new); |
| 351 | } |
| 352 | |
| 353 | void *get_init_task(void) |
| 354 | { |
| 355 | return(&init_thread_union.thread_info.task); |
| 356 | } |
| 357 | |
| 358 | int copy_to_user_proc(void __user *to, void *from, int size) |
| 359 | { |
| 360 | return(copy_to_user(to, from, size)); |
| 361 | } |
| 362 | |
| 363 | int copy_from_user_proc(void *to, void __user *from, int size) |
| 364 | { |
| 365 | return(copy_from_user(to, from, size)); |
| 366 | } |
| 367 | |
| 368 | int clear_user_proc(void __user *buf, int size) |
| 369 | { |
| 370 | return(clear_user(buf, size)); |
| 371 | } |
| 372 | |
| 373 | int strlen_user_proc(char __user *str) |
| 374 | { |
| 375 | return(strlen_user(str)); |
| 376 | } |
| 377 | |
| 378 | int smp_sigio_handler(void) |
| 379 | { |
| 380 | #ifdef CONFIG_SMP |
| 381 | int cpu = current_thread->cpu; |
| 382 | IPI_handler(cpu); |
| 383 | if(cpu != 0) |
| 384 | return(1); |
| 385 | #endif |
| 386 | return(0); |
| 387 | } |
| 388 | |
| 389 | int um_in_interrupt(void) |
| 390 | { |
| 391 | return(in_interrupt()); |
| 392 | } |
| 393 | |
| 394 | int cpu(void) |
| 395 | { |
| 396 | return(current_thread->cpu); |
| 397 | } |
| 398 | |
| 399 | static atomic_t using_sysemu = ATOMIC_INIT(0); |
| 400 | int sysemu_supported; |
| 401 | |
| 402 | void set_using_sysemu(int value) |
| 403 | { |
| 404 | if (value > sysemu_supported) |
| 405 | return; |
| 406 | atomic_set(&using_sysemu, value); |
| 407 | } |
| 408 | |
| 409 | int get_using_sysemu(void) |
| 410 | { |
| 411 | return atomic_read(&using_sysemu); |
| 412 | } |
| 413 | |
| 414 | static int proc_read_sysemu(char *buf, char **start, off_t offset, int size,int *eof, void *data) |
| 415 | { |
| 416 | if (snprintf(buf, size, "%d\n", get_using_sysemu()) < size) /*No overflow*/ |
| 417 | *eof = 1; |
| 418 | |
| 419 | return strlen(buf); |
| 420 | } |
| 421 | |
| 422 | static int proc_write_sysemu(struct file *file,const char *buf, unsigned long count,void *data) |
| 423 | { |
| 424 | char tmp[2]; |
| 425 | |
| 426 | if (copy_from_user(tmp, buf, 1)) |
| 427 | return -EFAULT; |
| 428 | |
| 429 | if (tmp[0] >= '0' && tmp[0] <= '2') |
| 430 | set_using_sysemu(tmp[0] - '0'); |
| 431 | return count; /*We use the first char, but pretend to write everything*/ |
| 432 | } |
| 433 | |
| 434 | int __init make_proc_sysemu(void) |
| 435 | { |
| 436 | struct proc_dir_entry *ent; |
| 437 | if (!sysemu_supported) |
| 438 | return 0; |
| 439 | |
| 440 | ent = create_proc_entry("sysemu", 0600, &proc_root); |
| 441 | |
| 442 | if (ent == NULL) |
| 443 | { |
| 444 | printk("Failed to register /proc/sysemu\n"); |
| 445 | return(0); |
| 446 | } |
| 447 | |
| 448 | ent->read_proc = proc_read_sysemu; |
| 449 | ent->write_proc = proc_write_sysemu; |
| 450 | |
| 451 | return 0; |
| 452 | } |
| 453 | |
| 454 | late_initcall(make_proc_sysemu); |
| 455 | |
| 456 | int singlestepping(void * t) |
| 457 | { |
| 458 | struct task_struct *task = t ? t : current; |
| 459 | |
| 460 | if ( ! (task->ptrace & PT_DTRACE) ) |
| 461 | return(0); |
| 462 | |
| 463 | if (task->thread.singlestep_syscall) |
| 464 | return(1); |
| 465 | |
| 466 | return 2; |
| 467 | } |
| 468 | |
| 469 | unsigned long arch_align_stack(unsigned long sp) |
| 470 | { |
| 471 | if (randomize_va_space) |
| 472 | sp -= get_random_int() % 8192; |
| 473 | return sp & ~0xf; |
| 474 | } |
| 475 | |
| 476 | |
| 477 | /* |
| 478 | * Overrides for Emacs so that we follow Linus's tabbing style. |
| 479 | * Emacs will notice this stuff at the end of the file and automatically |
| 480 | * adjust the settings for this buffer only. This must remain at the end |
| 481 | * of the file. |
| 482 | * --------------------------------------------------------------------------- |
| 483 | * Local variables: |
| 484 | * c-file-style: "linux" |
| 485 | * End: |
| 486 | */ |