Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | #ifndef _LINUX_SCHED_H |
| 2 | #define _LINUX_SCHED_H |
| 3 | |
| 4 | #include <asm/param.h> /* for HZ */ |
| 5 | |
| 6 | #include <linux/config.h> |
| 7 | #include <linux/capability.h> |
| 8 | #include <linux/threads.h> |
| 9 | #include <linux/kernel.h> |
| 10 | #include <linux/types.h> |
| 11 | #include <linux/timex.h> |
| 12 | #include <linux/jiffies.h> |
| 13 | #include <linux/rbtree.h> |
| 14 | #include <linux/thread_info.h> |
| 15 | #include <linux/cpumask.h> |
| 16 | #include <linux/errno.h> |
| 17 | #include <linux/nodemask.h> |
| 18 | |
| 19 | #include <asm/system.h> |
| 20 | #include <asm/semaphore.h> |
| 21 | #include <asm/page.h> |
| 22 | #include <asm/ptrace.h> |
| 23 | #include <asm/mmu.h> |
| 24 | #include <asm/cputime.h> |
| 25 | |
| 26 | #include <linux/smp.h> |
| 27 | #include <linux/sem.h> |
| 28 | #include <linux/signal.h> |
| 29 | #include <linux/securebits.h> |
| 30 | #include <linux/fs_struct.h> |
| 31 | #include <linux/compiler.h> |
| 32 | #include <linux/completion.h> |
| 33 | #include <linux/pid.h> |
| 34 | #include <linux/percpu.h> |
| 35 | #include <linux/topology.h> |
| 36 | #include <linux/seccomp.h> |
| 37 | |
| 38 | struct exec_domain; |
| 39 | |
| 40 | /* |
| 41 | * cloning flags: |
| 42 | */ |
| 43 | #define CSIGNAL 0x000000ff /* signal mask to be sent at exit */ |
| 44 | #define CLONE_VM 0x00000100 /* set if VM shared between processes */ |
| 45 | #define CLONE_FS 0x00000200 /* set if fs info shared between processes */ |
| 46 | #define CLONE_FILES 0x00000400 /* set if open files shared between processes */ |
| 47 | #define CLONE_SIGHAND 0x00000800 /* set if signal handlers and blocked signals shared */ |
| 48 | #define CLONE_PTRACE 0x00002000 /* set if we want to let tracing continue on the child too */ |
| 49 | #define CLONE_VFORK 0x00004000 /* set if the parent wants the child to wake it up on mm_release */ |
| 50 | #define CLONE_PARENT 0x00008000 /* set if we want to have the same parent as the cloner */ |
| 51 | #define CLONE_THREAD 0x00010000 /* Same thread group? */ |
| 52 | #define CLONE_NEWNS 0x00020000 /* New namespace group? */ |
| 53 | #define CLONE_SYSVSEM 0x00040000 /* share system V SEM_UNDO semantics */ |
| 54 | #define CLONE_SETTLS 0x00080000 /* create a new TLS for the child */ |
| 55 | #define CLONE_PARENT_SETTID 0x00100000 /* set the TID in the parent */ |
| 56 | #define CLONE_CHILD_CLEARTID 0x00200000 /* clear the TID in the child */ |
| 57 | #define CLONE_DETACHED 0x00400000 /* Unused, ignored */ |
| 58 | #define CLONE_UNTRACED 0x00800000 /* set if the tracing process can't force CLONE_PTRACE on this clone */ |
| 59 | #define CLONE_CHILD_SETTID 0x01000000 /* set the TID in the child */ |
| 60 | #define CLONE_STOPPED 0x02000000 /* Start in stopped state */ |
| 61 | |
| 62 | /* |
| 63 | * List of flags we want to share for kernel threads, |
| 64 | * if only because they are not used by them anyway. |
| 65 | */ |
| 66 | #define CLONE_KERNEL (CLONE_FS | CLONE_FILES | CLONE_SIGHAND) |
| 67 | |
| 68 | /* |
| 69 | * These are the constant used to fake the fixed-point load-average |
| 70 | * counting. Some notes: |
| 71 | * - 11 bit fractions expand to 22 bits by the multiplies: this gives |
| 72 | * a load-average precision of 10 bits integer + 11 bits fractional |
| 73 | * - if you want to count load-averages more often, you need more |
| 74 | * precision, or rounding will get you. With 2-second counting freq, |
| 75 | * the EXP_n values would be 1981, 2034 and 2043 if still using only |
| 76 | * 11 bit fractions. |
| 77 | */ |
| 78 | extern unsigned long avenrun[]; /* Load averages */ |
| 79 | |
| 80 | #define FSHIFT 11 /* nr of bits of precision */ |
| 81 | #define FIXED_1 (1<<FSHIFT) /* 1.0 as fixed-point */ |
| 82 | #define LOAD_FREQ (5*HZ) /* 5 sec intervals */ |
| 83 | #define EXP_1 1884 /* 1/exp(5sec/1min) as fixed-point */ |
| 84 | #define EXP_5 2014 /* 1/exp(5sec/5min) */ |
| 85 | #define EXP_15 2037 /* 1/exp(5sec/15min) */ |
| 86 | |
| 87 | #define CALC_LOAD(load,exp,n) \ |
| 88 | load *= exp; \ |
| 89 | load += n*(FIXED_1-exp); \ |
| 90 | load >>= FSHIFT; |
| 91 | |
| 92 | extern unsigned long total_forks; |
| 93 | extern int nr_threads; |
| 94 | extern int last_pid; |
| 95 | DECLARE_PER_CPU(unsigned long, process_counts); |
| 96 | extern int nr_processes(void); |
| 97 | extern unsigned long nr_running(void); |
| 98 | extern unsigned long nr_uninterruptible(void); |
| 99 | extern unsigned long nr_iowait(void); |
| 100 | |
| 101 | #include <linux/time.h> |
| 102 | #include <linux/param.h> |
| 103 | #include <linux/resource.h> |
| 104 | #include <linux/timer.h> |
| 105 | |
| 106 | #include <asm/processor.h> |
| 107 | |
| 108 | #define TASK_RUNNING 0 |
| 109 | #define TASK_INTERRUPTIBLE 1 |
| 110 | #define TASK_UNINTERRUPTIBLE 2 |
| 111 | #define TASK_STOPPED 4 |
| 112 | #define TASK_TRACED 8 |
| 113 | #define EXIT_ZOMBIE 16 |
| 114 | #define EXIT_DEAD 32 |
| 115 | |
| 116 | #define __set_task_state(tsk, state_value) \ |
| 117 | do { (tsk)->state = (state_value); } while (0) |
| 118 | #define set_task_state(tsk, state_value) \ |
| 119 | set_mb((tsk)->state, (state_value)) |
| 120 | |
| 121 | #define __set_current_state(state_value) \ |
| 122 | do { current->state = (state_value); } while (0) |
| 123 | #define set_current_state(state_value) \ |
| 124 | set_mb(current->state, (state_value)) |
| 125 | |
| 126 | /* Task command name length */ |
| 127 | #define TASK_COMM_LEN 16 |
| 128 | |
| 129 | /* |
| 130 | * Scheduling policies |
| 131 | */ |
| 132 | #define SCHED_NORMAL 0 |
| 133 | #define SCHED_FIFO 1 |
| 134 | #define SCHED_RR 2 |
| 135 | |
| 136 | struct sched_param { |
| 137 | int sched_priority; |
| 138 | }; |
| 139 | |
| 140 | #ifdef __KERNEL__ |
| 141 | |
| 142 | #include <linux/spinlock.h> |
| 143 | |
| 144 | /* |
| 145 | * This serializes "schedule()" and also protects |
| 146 | * the run-queue from deletions/modifications (but |
| 147 | * _adding_ to the beginning of the run-queue has |
| 148 | * a separate lock). |
| 149 | */ |
| 150 | extern rwlock_t tasklist_lock; |
| 151 | extern spinlock_t mmlist_lock; |
| 152 | |
| 153 | typedef struct task_struct task_t; |
| 154 | |
| 155 | extern void sched_init(void); |
| 156 | extern void sched_init_smp(void); |
| 157 | extern void init_idle(task_t *idle, int cpu); |
| 158 | |
| 159 | extern cpumask_t nohz_cpu_mask; |
| 160 | |
| 161 | extern void show_state(void); |
| 162 | extern void show_regs(struct pt_regs *); |
| 163 | |
| 164 | /* |
| 165 | * TASK is a pointer to the task whose backtrace we want to see (or NULL for current |
| 166 | * task), SP is the stack pointer of the first frame that should be shown in the back |
| 167 | * trace (or NULL if the entire call-chain of the task should be shown). |
| 168 | */ |
| 169 | extern void show_stack(struct task_struct *task, unsigned long *sp); |
| 170 | |
| 171 | void io_schedule(void); |
| 172 | long io_schedule_timeout(long timeout); |
| 173 | |
| 174 | extern void cpu_init (void); |
| 175 | extern void trap_init(void); |
| 176 | extern void update_process_times(int user); |
| 177 | extern void scheduler_tick(void); |
| 178 | |
| 179 | /* Attach to any functions which should be ignored in wchan output. */ |
| 180 | #define __sched __attribute__((__section__(".sched.text"))) |
| 181 | /* Is this address in the __sched functions? */ |
| 182 | extern int in_sched_functions(unsigned long addr); |
| 183 | |
| 184 | #define MAX_SCHEDULE_TIMEOUT LONG_MAX |
| 185 | extern signed long FASTCALL(schedule_timeout(signed long timeout)); |
| 186 | asmlinkage void schedule(void); |
| 187 | |
| 188 | struct namespace; |
| 189 | |
| 190 | /* Maximum number of active map areas.. This is a random (large) number */ |
| 191 | #define DEFAULT_MAX_MAP_COUNT 65536 |
| 192 | |
| 193 | extern int sysctl_max_map_count; |
| 194 | |
| 195 | #include <linux/aio.h> |
| 196 | |
| 197 | extern unsigned long |
| 198 | arch_get_unmapped_area(struct file *, unsigned long, unsigned long, |
| 199 | unsigned long, unsigned long); |
| 200 | extern unsigned long |
| 201 | arch_get_unmapped_area_topdown(struct file *filp, unsigned long addr, |
| 202 | unsigned long len, unsigned long pgoff, |
| 203 | unsigned long flags); |
Wolfgang Wander | 1363c3c | 2005-06-21 17:14:49 -0700 | [diff] [blame] | 204 | extern void arch_unmap_area(struct mm_struct *, unsigned long); |
| 205 | extern void arch_unmap_area_topdown(struct mm_struct *, unsigned long); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 206 | |
| 207 | #define set_mm_counter(mm, member, value) (mm)->_##member = (value) |
| 208 | #define get_mm_counter(mm, member) ((mm)->_##member) |
| 209 | #define add_mm_counter(mm, member, value) (mm)->_##member += (value) |
| 210 | #define inc_mm_counter(mm, member) (mm)->_##member++ |
| 211 | #define dec_mm_counter(mm, member) (mm)->_##member-- |
| 212 | typedef unsigned long mm_counter_t; |
| 213 | |
| 214 | struct mm_struct { |
| 215 | struct vm_area_struct * mmap; /* list of VMAs */ |
| 216 | struct rb_root mm_rb; |
| 217 | struct vm_area_struct * mmap_cache; /* last find_vma result */ |
| 218 | unsigned long (*get_unmapped_area) (struct file *filp, |
| 219 | unsigned long addr, unsigned long len, |
| 220 | unsigned long pgoff, unsigned long flags); |
Wolfgang Wander | 1363c3c | 2005-06-21 17:14:49 -0700 | [diff] [blame] | 221 | void (*unmap_area) (struct mm_struct *mm, unsigned long addr); |
| 222 | unsigned long mmap_base; /* base of mmap area */ |
| 223 | unsigned long cached_hole_size; /* if non-zero, the largest hole below free_area_cache */ |
| 224 | unsigned long free_area_cache; /* first hole of size cached_hole_size or larger */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 225 | pgd_t * pgd; |
| 226 | atomic_t mm_users; /* How many users with user space? */ |
| 227 | atomic_t mm_count; /* How many references to "struct mm_struct" (users count as 1) */ |
| 228 | int map_count; /* number of VMAs */ |
| 229 | struct rw_semaphore mmap_sem; |
| 230 | spinlock_t page_table_lock; /* Protects page tables and some counters */ |
| 231 | |
| 232 | struct list_head mmlist; /* List of maybe swapped mm's. These are globally strung |
| 233 | * together off init_mm.mmlist, and are protected |
| 234 | * by mmlist_lock |
| 235 | */ |
| 236 | |
| 237 | unsigned long start_code, end_code, start_data, end_data; |
| 238 | unsigned long start_brk, brk, start_stack; |
| 239 | unsigned long arg_start, arg_end, env_start, env_end; |
| 240 | unsigned long total_vm, locked_vm, shared_vm; |
| 241 | unsigned long exec_vm, stack_vm, reserved_vm, def_flags, nr_ptes; |
| 242 | |
| 243 | /* Special counters protected by the page_table_lock */ |
| 244 | mm_counter_t _rss; |
| 245 | mm_counter_t _anon_rss; |
| 246 | |
| 247 | unsigned long saved_auxv[42]; /* for /proc/PID/auxv */ |
| 248 | |
Alan Cox | d6e7114 | 2005-06-23 00:09:43 -0700 | [diff] [blame] | 249 | unsigned dumpable:2; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 250 | cpumask_t cpu_vm_mask; |
| 251 | |
| 252 | /* Architecture-specific MM context */ |
| 253 | mm_context_t context; |
| 254 | |
| 255 | /* Token based thrashing protection. */ |
| 256 | unsigned long swap_token_time; |
| 257 | char recent_pagein; |
| 258 | |
| 259 | /* coredumping support */ |
| 260 | int core_waiters; |
| 261 | struct completion *core_startup_done, core_done; |
| 262 | |
| 263 | /* aio bits */ |
| 264 | rwlock_t ioctx_list_lock; |
| 265 | struct kioctx *ioctx_list; |
| 266 | |
| 267 | struct kioctx default_kioctx; |
| 268 | |
| 269 | unsigned long hiwater_rss; /* High-water RSS usage */ |
| 270 | unsigned long hiwater_vm; /* High-water virtual memory usage */ |
| 271 | }; |
| 272 | |
| 273 | struct sighand_struct { |
| 274 | atomic_t count; |
| 275 | struct k_sigaction action[_NSIG]; |
| 276 | spinlock_t siglock; |
| 277 | }; |
| 278 | |
| 279 | /* |
| 280 | * NOTE! "signal_struct" does not have it's own |
| 281 | * locking, because a shared signal_struct always |
| 282 | * implies a shared sighand_struct, so locking |
| 283 | * sighand_struct is always a proper superset of |
| 284 | * the locking of signal_struct. |
| 285 | */ |
| 286 | struct signal_struct { |
| 287 | atomic_t count; |
| 288 | atomic_t live; |
| 289 | |
| 290 | wait_queue_head_t wait_chldexit; /* for wait4() */ |
| 291 | |
| 292 | /* current thread group signal load-balancing target: */ |
| 293 | task_t *curr_target; |
| 294 | |
| 295 | /* shared signal handling: */ |
| 296 | struct sigpending shared_pending; |
| 297 | |
| 298 | /* thread group exit support */ |
| 299 | int group_exit_code; |
| 300 | /* overloaded: |
| 301 | * - notify group_exit_task when ->count is equal to notify_count |
| 302 | * - everyone except group_exit_task is stopped during signal delivery |
| 303 | * of fatal signals, group_exit_task processes the signal. |
| 304 | */ |
| 305 | struct task_struct *group_exit_task; |
| 306 | int notify_count; |
| 307 | |
| 308 | /* thread group stop support, overloads group_exit_code too */ |
| 309 | int group_stop_count; |
| 310 | unsigned int flags; /* see SIGNAL_* flags below */ |
| 311 | |
| 312 | /* POSIX.1b Interval Timers */ |
| 313 | struct list_head posix_timers; |
| 314 | |
| 315 | /* ITIMER_REAL timer for the process */ |
| 316 | struct timer_list real_timer; |
| 317 | unsigned long it_real_value, it_real_incr; |
| 318 | |
| 319 | /* ITIMER_PROF and ITIMER_VIRTUAL timers for the process */ |
| 320 | cputime_t it_prof_expires, it_virt_expires; |
| 321 | cputime_t it_prof_incr, it_virt_incr; |
| 322 | |
| 323 | /* job control IDs */ |
| 324 | pid_t pgrp; |
| 325 | pid_t tty_old_pgrp; |
| 326 | pid_t session; |
| 327 | /* boolean value for session group leader */ |
| 328 | int leader; |
| 329 | |
| 330 | struct tty_struct *tty; /* NULL if no tty */ |
| 331 | |
| 332 | /* |
| 333 | * Cumulative resource counters for dead threads in the group, |
| 334 | * and for reaped dead child processes forked by this group. |
| 335 | * Live threads maintain their own counters and add to these |
| 336 | * in __exit_signal, except for the group leader. |
| 337 | */ |
| 338 | cputime_t utime, stime, cutime, cstime; |
| 339 | unsigned long nvcsw, nivcsw, cnvcsw, cnivcsw; |
| 340 | unsigned long min_flt, maj_flt, cmin_flt, cmaj_flt; |
| 341 | |
| 342 | /* |
| 343 | * Cumulative ns of scheduled CPU time for dead threads in the |
| 344 | * group, not including a zombie group leader. (This only differs |
| 345 | * from jiffies_to_ns(utime + stime) if sched_clock uses something |
| 346 | * other than jiffies.) |
| 347 | */ |
| 348 | unsigned long long sched_time; |
| 349 | |
| 350 | /* |
| 351 | * We don't bother to synchronize most readers of this at all, |
| 352 | * because there is no reader checking a limit that actually needs |
| 353 | * to get both rlim_cur and rlim_max atomically, and either one |
| 354 | * alone is a single word that can safely be read normally. |
| 355 | * getrlimit/setrlimit use task_lock(current->group_leader) to |
| 356 | * protect this instead of the siglock, because they really |
| 357 | * have no need to disable irqs. |
| 358 | */ |
| 359 | struct rlimit rlim[RLIM_NLIMITS]; |
| 360 | |
| 361 | struct list_head cpu_timers[3]; |
| 362 | |
| 363 | /* keep the process-shared keyrings here so that they do the right |
| 364 | * thing in threads created with CLONE_THREAD */ |
| 365 | #ifdef CONFIG_KEYS |
| 366 | struct key *session_keyring; /* keyring inherited over fork */ |
| 367 | struct key *process_keyring; /* keyring private to this process */ |
| 368 | #endif |
| 369 | }; |
| 370 | |
| 371 | /* |
| 372 | * Bits in flags field of signal_struct. |
| 373 | */ |
| 374 | #define SIGNAL_STOP_STOPPED 0x00000001 /* job control stop in effect */ |
| 375 | #define SIGNAL_STOP_DEQUEUED 0x00000002 /* stop signal dequeued */ |
| 376 | #define SIGNAL_STOP_CONTINUED 0x00000004 /* SIGCONT since WCONTINUED reap */ |
| 377 | #define SIGNAL_GROUP_EXIT 0x00000008 /* group exit in progress */ |
| 378 | |
| 379 | |
| 380 | /* |
| 381 | * Priority of a process goes from 0..MAX_PRIO-1, valid RT |
| 382 | * priority is 0..MAX_RT_PRIO-1, and SCHED_NORMAL tasks are |
| 383 | * in the range MAX_RT_PRIO..MAX_PRIO-1. Priority values |
| 384 | * are inverted: lower p->prio value means higher priority. |
| 385 | * |
| 386 | * The MAX_USER_RT_PRIO value allows the actual maximum |
| 387 | * RT priority to be separate from the value exported to |
| 388 | * user-space. This allows kernel threads to set their |
| 389 | * priority to a value higher than any user task. Note: |
| 390 | * MAX_RT_PRIO must not be smaller than MAX_USER_RT_PRIO. |
| 391 | */ |
| 392 | |
| 393 | #define MAX_USER_RT_PRIO 100 |
| 394 | #define MAX_RT_PRIO MAX_USER_RT_PRIO |
| 395 | |
| 396 | #define MAX_PRIO (MAX_RT_PRIO + 40) |
| 397 | |
| 398 | #define rt_task(p) (unlikely((p)->prio < MAX_RT_PRIO)) |
| 399 | |
| 400 | /* |
| 401 | * Some day this will be a full-fledged user tracking system.. |
| 402 | */ |
| 403 | struct user_struct { |
| 404 | atomic_t __count; /* reference count */ |
| 405 | atomic_t processes; /* How many processes does this user have? */ |
| 406 | atomic_t files; /* How many open files does this user have? */ |
| 407 | atomic_t sigpending; /* How many pending signals does this user have? */ |
| 408 | /* protected by mq_lock */ |
| 409 | unsigned long mq_bytes; /* How many bytes can be allocated to mqueue? */ |
| 410 | unsigned long locked_shm; /* How many pages of mlocked shm ? */ |
| 411 | |
| 412 | #ifdef CONFIG_KEYS |
| 413 | struct key *uid_keyring; /* UID specific keyring */ |
| 414 | struct key *session_keyring; /* UID's default session keyring */ |
| 415 | #endif |
| 416 | |
| 417 | /* Hash table maintenance information */ |
| 418 | struct list_head uidhash_list; |
| 419 | uid_t uid; |
| 420 | }; |
| 421 | |
| 422 | extern struct user_struct *find_user(uid_t); |
| 423 | |
| 424 | extern struct user_struct root_user; |
| 425 | #define INIT_USER (&root_user) |
| 426 | |
| 427 | typedef struct prio_array prio_array_t; |
| 428 | struct backing_dev_info; |
| 429 | struct reclaim_state; |
| 430 | |
| 431 | #ifdef CONFIG_SCHEDSTATS |
| 432 | struct sched_info { |
| 433 | /* cumulative counters */ |
| 434 | unsigned long cpu_time, /* time spent on the cpu */ |
| 435 | run_delay, /* time spent waiting on a runqueue */ |
| 436 | pcnt; /* # of timeslices run on this cpu */ |
| 437 | |
| 438 | /* timestamps */ |
| 439 | unsigned long last_arrival, /* when we last ran on a cpu */ |
| 440 | last_queued; /* when we were last queued to run */ |
| 441 | }; |
| 442 | |
| 443 | extern struct file_operations proc_schedstat_operations; |
| 444 | #endif |
| 445 | |
| 446 | enum idle_type |
| 447 | { |
| 448 | SCHED_IDLE, |
| 449 | NOT_IDLE, |
| 450 | NEWLY_IDLE, |
| 451 | MAX_IDLE_TYPES |
| 452 | }; |
| 453 | |
| 454 | /* |
| 455 | * sched-domains (multiprocessor balancing) declarations: |
| 456 | */ |
| 457 | #ifdef CONFIG_SMP |
| 458 | #define SCHED_LOAD_SCALE 128UL /* increase resolution of load */ |
| 459 | |
| 460 | #define SD_LOAD_BALANCE 1 /* Do load balancing on this domain. */ |
| 461 | #define SD_BALANCE_NEWIDLE 2 /* Balance when about to become idle */ |
| 462 | #define SD_BALANCE_EXEC 4 /* Balance on exec */ |
Nick Piggin | 147cbb4 | 2005-06-25 14:57:19 -0700 | [diff] [blame] | 463 | #define SD_BALANCE_FORK 8 /* Balance on fork, clone */ |
| 464 | #define SD_WAKE_IDLE 16 /* Wake to idle CPU on task wakeup */ |
| 465 | #define SD_WAKE_AFFINE 32 /* Wake task to waking CPU */ |
| 466 | #define SD_WAKE_BALANCE 64 /* Perform balancing at task wakeup */ |
| 467 | #define SD_SHARE_CPUPOWER 128 /* Domain members share cpu power */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 468 | |
| 469 | struct sched_group { |
| 470 | struct sched_group *next; /* Must be a circular list */ |
| 471 | cpumask_t cpumask; |
| 472 | |
| 473 | /* |
| 474 | * CPU power of this group, SCHED_LOAD_SCALE being max power for a |
| 475 | * single CPU. This is read only (except for setup, hotplug CPU). |
| 476 | */ |
| 477 | unsigned long cpu_power; |
| 478 | }; |
| 479 | |
| 480 | struct sched_domain { |
| 481 | /* These fields must be setup */ |
| 482 | struct sched_domain *parent; /* top domain must be null terminated */ |
| 483 | struct sched_group *groups; /* the balancing groups of the domain */ |
| 484 | cpumask_t span; /* span of all CPUs in this domain */ |
| 485 | unsigned long min_interval; /* Minimum balance interval ms */ |
| 486 | unsigned long max_interval; /* Maximum balance interval ms */ |
| 487 | unsigned int busy_factor; /* less balancing by factor if busy */ |
| 488 | unsigned int imbalance_pct; /* No balance until over watermark */ |
| 489 | unsigned long long cache_hot_time; /* Task considered cache hot (ns) */ |
| 490 | unsigned int cache_nice_tries; /* Leave cache hot tasks for # tries */ |
| 491 | unsigned int per_cpu_gain; /* CPU % gained by adding domain cpus */ |
Nick Piggin | 7897986 | 2005-06-25 14:57:13 -0700 | [diff] [blame] | 492 | unsigned int busy_idx; |
| 493 | unsigned int idle_idx; |
| 494 | unsigned int newidle_idx; |
| 495 | unsigned int wake_idx; |
Nick Piggin | 147cbb4 | 2005-06-25 14:57:19 -0700 | [diff] [blame] | 496 | unsigned int forkexec_idx; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 497 | int flags; /* See SD_* */ |
| 498 | |
| 499 | /* Runtime fields. */ |
| 500 | unsigned long last_balance; /* init to jiffies. units in jiffies */ |
| 501 | unsigned int balance_interval; /* initialise to 1. units in ms. */ |
| 502 | unsigned int nr_balance_failed; /* initialise to 0 */ |
| 503 | |
| 504 | #ifdef CONFIG_SCHEDSTATS |
| 505 | /* load_balance() stats */ |
| 506 | unsigned long lb_cnt[MAX_IDLE_TYPES]; |
| 507 | unsigned long lb_failed[MAX_IDLE_TYPES]; |
| 508 | unsigned long lb_balanced[MAX_IDLE_TYPES]; |
| 509 | unsigned long lb_imbalance[MAX_IDLE_TYPES]; |
| 510 | unsigned long lb_gained[MAX_IDLE_TYPES]; |
| 511 | unsigned long lb_hot_gained[MAX_IDLE_TYPES]; |
| 512 | unsigned long lb_nobusyg[MAX_IDLE_TYPES]; |
| 513 | unsigned long lb_nobusyq[MAX_IDLE_TYPES]; |
| 514 | |
| 515 | /* Active load balancing */ |
| 516 | unsigned long alb_cnt; |
| 517 | unsigned long alb_failed; |
| 518 | unsigned long alb_pushed; |
| 519 | |
Nick Piggin | 68767a0 | 2005-06-25 14:57:20 -0700 | [diff] [blame^] | 520 | /* SD_BALANCE_EXEC stats */ |
| 521 | unsigned long sbe_cnt; |
| 522 | unsigned long sbe_balanced; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 523 | unsigned long sbe_pushed; |
| 524 | |
Nick Piggin | 68767a0 | 2005-06-25 14:57:20 -0700 | [diff] [blame^] | 525 | /* SD_BALANCE_FORK stats */ |
| 526 | unsigned long sbf_cnt; |
| 527 | unsigned long sbf_balanced; |
| 528 | unsigned long sbf_pushed; |
| 529 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 530 | /* try_to_wake_up() stats */ |
| 531 | unsigned long ttwu_wake_remote; |
| 532 | unsigned long ttwu_move_affine; |
| 533 | unsigned long ttwu_move_balance; |
| 534 | #endif |
| 535 | }; |
| 536 | |
| 537 | #ifdef ARCH_HAS_SCHED_DOMAIN |
| 538 | /* Useful helpers that arch setup code may use. Defined in kernel/sched.c */ |
| 539 | extern cpumask_t cpu_isolated_map; |
| 540 | extern void init_sched_build_groups(struct sched_group groups[], |
| 541 | cpumask_t span, int (*group_fn)(int cpu)); |
| 542 | extern void cpu_attach_domain(struct sched_domain *sd, int cpu); |
| 543 | #endif /* ARCH_HAS_SCHED_DOMAIN */ |
| 544 | #endif /* CONFIG_SMP */ |
| 545 | |
| 546 | |
| 547 | struct io_context; /* See blkdev.h */ |
| 548 | void exit_io_context(void); |
| 549 | struct cpuset; |
| 550 | |
| 551 | #define NGROUPS_SMALL 32 |
| 552 | #define NGROUPS_PER_BLOCK ((int)(PAGE_SIZE / sizeof(gid_t))) |
| 553 | struct group_info { |
| 554 | int ngroups; |
| 555 | atomic_t usage; |
| 556 | gid_t small_block[NGROUPS_SMALL]; |
| 557 | int nblocks; |
| 558 | gid_t *blocks[0]; |
| 559 | }; |
| 560 | |
| 561 | /* |
| 562 | * get_group_info() must be called with the owning task locked (via task_lock()) |
| 563 | * when task != current. The reason being that the vast majority of callers are |
| 564 | * looking at current->group_info, which can not be changed except by the |
| 565 | * current task. Changing current->group_info requires the task lock, too. |
| 566 | */ |
| 567 | #define get_group_info(group_info) do { \ |
| 568 | atomic_inc(&(group_info)->usage); \ |
| 569 | } while (0) |
| 570 | |
| 571 | #define put_group_info(group_info) do { \ |
| 572 | if (atomic_dec_and_test(&(group_info)->usage)) \ |
| 573 | groups_free(group_info); \ |
| 574 | } while (0) |
| 575 | |
David Howells | 3e30148 | 2005-06-23 22:00:56 -0700 | [diff] [blame] | 576 | extern struct group_info *groups_alloc(int gidsetsize); |
| 577 | extern void groups_free(struct group_info *group_info); |
| 578 | extern int set_current_groups(struct group_info *group_info); |
| 579 | extern int groups_search(struct group_info *group_info, gid_t grp); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 580 | /* access the groups "array" with this macro */ |
| 581 | #define GROUP_AT(gi, i) \ |
| 582 | ((gi)->blocks[(i)/NGROUPS_PER_BLOCK][(i)%NGROUPS_PER_BLOCK]) |
| 583 | |
| 584 | |
| 585 | struct audit_context; /* See audit.c */ |
| 586 | struct mempolicy; |
| 587 | |
| 588 | struct task_struct { |
| 589 | volatile long state; /* -1 unrunnable, 0 runnable, >0 stopped */ |
| 590 | struct thread_info *thread_info; |
| 591 | atomic_t usage; |
| 592 | unsigned long flags; /* per process flags, defined below */ |
| 593 | unsigned long ptrace; |
| 594 | |
Paolo 'Blaisorblade' Giarrusso | 3677209 | 2005-05-05 16:16:12 -0700 | [diff] [blame] | 595 | int lock_depth; /* BKL lock depth */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 596 | |
| 597 | int prio, static_prio; |
| 598 | struct list_head run_list; |
| 599 | prio_array_t *array; |
| 600 | |
| 601 | unsigned long sleep_avg; |
| 602 | unsigned long long timestamp, last_ran; |
| 603 | unsigned long long sched_time; /* sched_clock time spent running */ |
| 604 | int activated; |
| 605 | |
| 606 | unsigned long policy; |
| 607 | cpumask_t cpus_allowed; |
| 608 | unsigned int time_slice, first_time_slice; |
| 609 | |
| 610 | #ifdef CONFIG_SCHEDSTATS |
| 611 | struct sched_info sched_info; |
| 612 | #endif |
| 613 | |
| 614 | struct list_head tasks; |
| 615 | /* |
| 616 | * ptrace_list/ptrace_children forms the list of my children |
| 617 | * that were stolen by a ptracer. |
| 618 | */ |
| 619 | struct list_head ptrace_children; |
| 620 | struct list_head ptrace_list; |
| 621 | |
| 622 | struct mm_struct *mm, *active_mm; |
| 623 | |
| 624 | /* task state */ |
| 625 | struct linux_binfmt *binfmt; |
| 626 | long exit_state; |
| 627 | int exit_code, exit_signal; |
| 628 | int pdeath_signal; /* The signal sent when the parent dies */ |
| 629 | /* ??? */ |
| 630 | unsigned long personality; |
| 631 | unsigned did_exec:1; |
| 632 | pid_t pid; |
| 633 | pid_t tgid; |
| 634 | /* |
| 635 | * pointers to (original) parent process, youngest child, younger sibling, |
| 636 | * older sibling, respectively. (p->father can be replaced with |
| 637 | * p->parent->pid) |
| 638 | */ |
| 639 | struct task_struct *real_parent; /* real parent process (when being debugged) */ |
| 640 | struct task_struct *parent; /* parent process */ |
| 641 | /* |
| 642 | * children/sibling forms the list of my children plus the |
| 643 | * tasks I'm ptracing. |
| 644 | */ |
| 645 | struct list_head children; /* list of my children */ |
| 646 | struct list_head sibling; /* linkage in my parent's children list */ |
| 647 | struct task_struct *group_leader; /* threadgroup leader */ |
| 648 | |
| 649 | /* PID/PID hash table linkage. */ |
| 650 | struct pid pids[PIDTYPE_MAX]; |
| 651 | |
| 652 | struct completion *vfork_done; /* for vfork() */ |
| 653 | int __user *set_child_tid; /* CLONE_CHILD_SETTID */ |
| 654 | int __user *clear_child_tid; /* CLONE_CHILD_CLEARTID */ |
| 655 | |
| 656 | unsigned long rt_priority; |
| 657 | cputime_t utime, stime; |
| 658 | unsigned long nvcsw, nivcsw; /* context switch counts */ |
| 659 | struct timespec start_time; |
| 660 | /* mm fault and swap info: this can arguably be seen as either mm-specific or thread-specific */ |
| 661 | unsigned long min_flt, maj_flt; |
| 662 | |
| 663 | cputime_t it_prof_expires, it_virt_expires; |
| 664 | unsigned long long it_sched_expires; |
| 665 | struct list_head cpu_timers[3]; |
| 666 | |
| 667 | /* process credentials */ |
| 668 | uid_t uid,euid,suid,fsuid; |
| 669 | gid_t gid,egid,sgid,fsgid; |
| 670 | struct group_info *group_info; |
| 671 | kernel_cap_t cap_effective, cap_inheritable, cap_permitted; |
| 672 | unsigned keep_capabilities:1; |
| 673 | struct user_struct *user; |
| 674 | #ifdef CONFIG_KEYS |
| 675 | struct key *thread_keyring; /* keyring private to this thread */ |
David Howells | 3e30148 | 2005-06-23 22:00:56 -0700 | [diff] [blame] | 676 | unsigned char jit_keyring; /* default keyring to attach requested keys to */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 677 | #endif |
| 678 | int oomkilladj; /* OOM kill score adjustment (bit shift). */ |
Paolo 'Blaisorblade' Giarrusso | 3677209 | 2005-05-05 16:16:12 -0700 | [diff] [blame] | 679 | char comm[TASK_COMM_LEN]; /* executable name excluding path |
| 680 | - access with [gs]et_task_comm (which lock |
| 681 | it with task_lock()) |
| 682 | - initialized normally by flush_old_exec */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 683 | /* file system info */ |
| 684 | int link_count, total_link_count; |
| 685 | /* ipc stuff */ |
| 686 | struct sysv_sem sysvsem; |
| 687 | /* CPU-specific state of this task */ |
| 688 | struct thread_struct thread; |
| 689 | /* filesystem information */ |
| 690 | struct fs_struct *fs; |
| 691 | /* open file information */ |
| 692 | struct files_struct *files; |
| 693 | /* namespace */ |
| 694 | struct namespace *namespace; |
| 695 | /* signal handlers */ |
| 696 | struct signal_struct *signal; |
| 697 | struct sighand_struct *sighand; |
| 698 | |
| 699 | sigset_t blocked, real_blocked; |
| 700 | struct sigpending pending; |
| 701 | |
| 702 | unsigned long sas_ss_sp; |
| 703 | size_t sas_ss_size; |
| 704 | int (*notifier)(void *priv); |
| 705 | void *notifier_data; |
| 706 | sigset_t *notifier_mask; |
| 707 | |
| 708 | void *security; |
| 709 | struct audit_context *audit_context; |
| 710 | seccomp_t seccomp; |
| 711 | |
| 712 | /* Thread group tracking */ |
| 713 | u32 parent_exec_id; |
| 714 | u32 self_exec_id; |
| 715 | /* Protection of (de-)allocation: mm, files, fs, tty, keyrings */ |
| 716 | spinlock_t alloc_lock; |
| 717 | /* Protection of proc_dentry: nesting proc_lock, dcache_lock, write_lock_irq(&tasklist_lock); */ |
| 718 | spinlock_t proc_lock; |
| 719 | /* context-switch lock */ |
| 720 | spinlock_t switch_lock; |
| 721 | |
| 722 | /* journalling filesystem info */ |
| 723 | void *journal_info; |
| 724 | |
| 725 | /* VM state */ |
| 726 | struct reclaim_state *reclaim_state; |
| 727 | |
| 728 | struct dentry *proc_dentry; |
| 729 | struct backing_dev_info *backing_dev_info; |
| 730 | |
| 731 | struct io_context *io_context; |
| 732 | |
| 733 | unsigned long ptrace_message; |
| 734 | siginfo_t *last_siginfo; /* For ptrace use. */ |
| 735 | /* |
| 736 | * current io wait handle: wait queue entry to use for io waits |
| 737 | * If this thread is processing aio, this points at the waitqueue |
| 738 | * inside the currently handled kiocb. It may be NULL (i.e. default |
| 739 | * to a stack based synchronous wait) if its doing sync IO. |
| 740 | */ |
| 741 | wait_queue_t *io_wait; |
| 742 | /* i/o counters(bytes read/written, #syscalls */ |
| 743 | u64 rchar, wchar, syscr, syscw; |
| 744 | #if defined(CONFIG_BSD_PROCESS_ACCT) |
| 745 | u64 acct_rss_mem1; /* accumulated rss usage */ |
| 746 | u64 acct_vm_mem1; /* accumulated virtual memory usage */ |
| 747 | clock_t acct_stimexpd; /* clock_t-converted stime since last update */ |
| 748 | #endif |
| 749 | #ifdef CONFIG_NUMA |
| 750 | struct mempolicy *mempolicy; |
| 751 | short il_next; |
| 752 | #endif |
| 753 | #ifdef CONFIG_CPUSETS |
| 754 | struct cpuset *cpuset; |
| 755 | nodemask_t mems_allowed; |
| 756 | int cpuset_mems_generation; |
| 757 | #endif |
| 758 | }; |
| 759 | |
| 760 | static inline pid_t process_group(struct task_struct *tsk) |
| 761 | { |
| 762 | return tsk->signal->pgrp; |
| 763 | } |
| 764 | |
| 765 | /** |
| 766 | * pid_alive - check that a task structure is not stale |
| 767 | * @p: Task structure to be checked. |
| 768 | * |
| 769 | * Test if a process is not yet dead (at most zombie state) |
| 770 | * If pid_alive fails, then pointers within the task structure |
| 771 | * can be stale and must not be dereferenced. |
| 772 | */ |
| 773 | static inline int pid_alive(struct task_struct *p) |
| 774 | { |
| 775 | return p->pids[PIDTYPE_PID].nr != 0; |
| 776 | } |
| 777 | |
| 778 | extern void free_task(struct task_struct *tsk); |
| 779 | extern void __put_task_struct(struct task_struct *tsk); |
| 780 | #define get_task_struct(tsk) do { atomic_inc(&(tsk)->usage); } while(0) |
| 781 | #define put_task_struct(tsk) \ |
| 782 | do { if (atomic_dec_and_test(&(tsk)->usage)) __put_task_struct(tsk); } while(0) |
| 783 | |
| 784 | /* |
| 785 | * Per process flags |
| 786 | */ |
| 787 | #define PF_ALIGNWARN 0x00000001 /* Print alignment warning msgs */ |
| 788 | /* Not implemented yet, only for 486*/ |
| 789 | #define PF_STARTING 0x00000002 /* being created */ |
| 790 | #define PF_EXITING 0x00000004 /* getting shut down */ |
| 791 | #define PF_DEAD 0x00000008 /* Dead */ |
| 792 | #define PF_FORKNOEXEC 0x00000040 /* forked but didn't exec */ |
| 793 | #define PF_SUPERPRIV 0x00000100 /* used super-user privileges */ |
| 794 | #define PF_DUMPCORE 0x00000200 /* dumped core */ |
| 795 | #define PF_SIGNALED 0x00000400 /* killed by a signal */ |
| 796 | #define PF_MEMALLOC 0x00000800 /* Allocating memory */ |
| 797 | #define PF_FLUSHER 0x00001000 /* responsible for disk writeback */ |
| 798 | #define PF_USED_MATH 0x00002000 /* if unset the fpu must be initialized before use */ |
| 799 | #define PF_FREEZE 0x00004000 /* this task is being frozen for suspend now */ |
| 800 | #define PF_NOFREEZE 0x00008000 /* this thread should not be frozen */ |
| 801 | #define PF_FROZEN 0x00010000 /* frozen for system suspend */ |
| 802 | #define PF_FSTRANS 0x00020000 /* inside a filesystem transaction */ |
| 803 | #define PF_KSWAPD 0x00040000 /* I am kswapd */ |
| 804 | #define PF_SWAPOFF 0x00080000 /* I am in swapoff */ |
| 805 | #define PF_LESS_THROTTLE 0x00100000 /* Throttle me less: I clean memory */ |
| 806 | #define PF_SYNCWRITE 0x00200000 /* I am doing a sync write */ |
| 807 | #define PF_BORROWED_MM 0x00400000 /* I am a kthread doing use_mm */ |
| 808 | #define PF_RANDOMIZE 0x00800000 /* randomize virtual address space */ |
| 809 | |
| 810 | /* |
| 811 | * Only the _current_ task can read/write to tsk->flags, but other |
| 812 | * tasks can access tsk->flags in readonly mode for example |
| 813 | * with tsk_used_math (like during threaded core dumping). |
| 814 | * There is however an exception to this rule during ptrace |
| 815 | * or during fork: the ptracer task is allowed to write to the |
| 816 | * child->flags of its traced child (same goes for fork, the parent |
| 817 | * can write to the child->flags), because we're guaranteed the |
| 818 | * child is not running and in turn not changing child->flags |
| 819 | * at the same time the parent does it. |
| 820 | */ |
| 821 | #define clear_stopped_child_used_math(child) do { (child)->flags &= ~PF_USED_MATH; } while (0) |
| 822 | #define set_stopped_child_used_math(child) do { (child)->flags |= PF_USED_MATH; } while (0) |
| 823 | #define clear_used_math() clear_stopped_child_used_math(current) |
| 824 | #define set_used_math() set_stopped_child_used_math(current) |
| 825 | #define conditional_stopped_child_used_math(condition, child) \ |
| 826 | do { (child)->flags &= ~PF_USED_MATH, (child)->flags |= (condition) ? PF_USED_MATH : 0; } while (0) |
| 827 | #define conditional_used_math(condition) \ |
| 828 | conditional_stopped_child_used_math(condition, current) |
| 829 | #define copy_to_stopped_child_used_math(child) \ |
| 830 | do { (child)->flags &= ~PF_USED_MATH, (child)->flags |= current->flags & PF_USED_MATH; } while (0) |
| 831 | /* NOTE: this will return 0 or PF_USED_MATH, it will never return 1 */ |
| 832 | #define tsk_used_math(p) ((p)->flags & PF_USED_MATH) |
| 833 | #define used_math() tsk_used_math(current) |
| 834 | |
| 835 | #ifdef CONFIG_SMP |
| 836 | extern int set_cpus_allowed(task_t *p, cpumask_t new_mask); |
| 837 | #else |
| 838 | static inline int set_cpus_allowed(task_t *p, cpumask_t new_mask) |
| 839 | { |
| 840 | if (!cpus_intersects(new_mask, cpu_online_map)) |
| 841 | return -EINVAL; |
| 842 | return 0; |
| 843 | } |
| 844 | #endif |
| 845 | |
| 846 | extern unsigned long long sched_clock(void); |
| 847 | extern unsigned long long current_sched_time(const task_t *current_task); |
| 848 | |
| 849 | /* sched_exec is called by processes performing an exec */ |
| 850 | #ifdef CONFIG_SMP |
| 851 | extern void sched_exec(void); |
| 852 | #else |
| 853 | #define sched_exec() {} |
| 854 | #endif |
| 855 | |
| 856 | #ifdef CONFIG_HOTPLUG_CPU |
| 857 | extern void idle_task_exit(void); |
| 858 | #else |
| 859 | static inline void idle_task_exit(void) {} |
| 860 | #endif |
| 861 | |
| 862 | extern void sched_idle_next(void); |
| 863 | extern void set_user_nice(task_t *p, long nice); |
| 864 | extern int task_prio(const task_t *p); |
| 865 | extern int task_nice(const task_t *p); |
Matt Mackall | e43379f | 2005-05-01 08:59:00 -0700 | [diff] [blame] | 866 | extern int can_nice(const task_t *p, const int nice); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 867 | extern int task_curr(const task_t *p); |
| 868 | extern int idle_cpu(int cpu); |
| 869 | extern int sched_setscheduler(struct task_struct *, int, struct sched_param *); |
| 870 | extern task_t *idle_task(int cpu); |
| 871 | |
| 872 | void yield(void); |
| 873 | |
| 874 | /* |
| 875 | * The default (Linux) execution domain. |
| 876 | */ |
| 877 | extern struct exec_domain default_exec_domain; |
| 878 | |
| 879 | union thread_union { |
| 880 | struct thread_info thread_info; |
| 881 | unsigned long stack[THREAD_SIZE/sizeof(long)]; |
| 882 | }; |
| 883 | |
| 884 | #ifndef __HAVE_ARCH_KSTACK_END |
| 885 | static inline int kstack_end(void *addr) |
| 886 | { |
| 887 | /* Reliable end of stack detection: |
| 888 | * Some APM bios versions misalign the stack |
| 889 | */ |
| 890 | return !(((unsigned long)addr+sizeof(void*)-1) & (THREAD_SIZE-sizeof(void*))); |
| 891 | } |
| 892 | #endif |
| 893 | |
| 894 | extern union thread_union init_thread_union; |
| 895 | extern struct task_struct init_task; |
| 896 | |
| 897 | extern struct mm_struct init_mm; |
| 898 | |
| 899 | #define find_task_by_pid(nr) find_task_by_pid_type(PIDTYPE_PID, nr) |
| 900 | extern struct task_struct *find_task_by_pid_type(int type, int pid); |
| 901 | extern void set_special_pids(pid_t session, pid_t pgrp); |
| 902 | extern void __set_special_pids(pid_t session, pid_t pgrp); |
| 903 | |
| 904 | /* per-UID process charging. */ |
| 905 | extern struct user_struct * alloc_uid(uid_t); |
| 906 | static inline struct user_struct *get_uid(struct user_struct *u) |
| 907 | { |
| 908 | atomic_inc(&u->__count); |
| 909 | return u; |
| 910 | } |
| 911 | extern void free_uid(struct user_struct *); |
| 912 | extern void switch_uid(struct user_struct *); |
| 913 | |
| 914 | #include <asm/current.h> |
| 915 | |
| 916 | extern void do_timer(struct pt_regs *); |
| 917 | |
| 918 | extern int FASTCALL(wake_up_state(struct task_struct * tsk, unsigned int state)); |
| 919 | extern int FASTCALL(wake_up_process(struct task_struct * tsk)); |
| 920 | extern void FASTCALL(wake_up_new_task(struct task_struct * tsk, |
| 921 | unsigned long clone_flags)); |
| 922 | #ifdef CONFIG_SMP |
| 923 | extern void kick_process(struct task_struct *tsk); |
| 924 | #else |
| 925 | static inline void kick_process(struct task_struct *tsk) { } |
| 926 | #endif |
| 927 | extern void FASTCALL(sched_fork(task_t * p)); |
| 928 | extern void FASTCALL(sched_exit(task_t * p)); |
| 929 | |
| 930 | extern int in_group_p(gid_t); |
| 931 | extern int in_egroup_p(gid_t); |
| 932 | |
| 933 | extern void proc_caches_init(void); |
| 934 | extern void flush_signals(struct task_struct *); |
| 935 | extern void flush_signal_handlers(struct task_struct *, int force_default); |
| 936 | extern int dequeue_signal(struct task_struct *tsk, sigset_t *mask, siginfo_t *info); |
| 937 | |
| 938 | static inline int dequeue_signal_lock(struct task_struct *tsk, sigset_t *mask, siginfo_t *info) |
| 939 | { |
| 940 | unsigned long flags; |
| 941 | int ret; |
| 942 | |
| 943 | spin_lock_irqsave(&tsk->sighand->siglock, flags); |
| 944 | ret = dequeue_signal(tsk, mask, info); |
| 945 | spin_unlock_irqrestore(&tsk->sighand->siglock, flags); |
| 946 | |
| 947 | return ret; |
| 948 | } |
| 949 | |
| 950 | extern void block_all_signals(int (*notifier)(void *priv), void *priv, |
| 951 | sigset_t *mask); |
| 952 | extern void unblock_all_signals(void); |
| 953 | extern void release_task(struct task_struct * p); |
| 954 | extern int send_sig_info(int, struct siginfo *, struct task_struct *); |
| 955 | extern int send_group_sig_info(int, struct siginfo *, struct task_struct *); |
| 956 | extern int force_sigsegv(int, struct task_struct *); |
| 957 | extern int force_sig_info(int, struct siginfo *, struct task_struct *); |
| 958 | extern int __kill_pg_info(int sig, struct siginfo *info, pid_t pgrp); |
| 959 | extern int kill_pg_info(int, struct siginfo *, pid_t); |
| 960 | extern int kill_proc_info(int, struct siginfo *, pid_t); |
| 961 | extern void do_notify_parent(struct task_struct *, int); |
| 962 | extern void force_sig(int, struct task_struct *); |
| 963 | extern void force_sig_specific(int, struct task_struct *); |
| 964 | extern int send_sig(int, struct task_struct *, int); |
| 965 | extern void zap_other_threads(struct task_struct *p); |
| 966 | extern int kill_pg(pid_t, int, int); |
| 967 | extern int kill_sl(pid_t, int, int); |
| 968 | extern int kill_proc(pid_t, int, int); |
| 969 | extern struct sigqueue *sigqueue_alloc(void); |
| 970 | extern void sigqueue_free(struct sigqueue *); |
| 971 | extern int send_sigqueue(int, struct sigqueue *, struct task_struct *); |
| 972 | extern int send_group_sigqueue(int, struct sigqueue *, struct task_struct *); |
| 973 | extern int do_sigaction(int, const struct k_sigaction *, struct k_sigaction *); |
| 974 | extern int do_sigaltstack(const stack_t __user *, stack_t __user *, unsigned long); |
| 975 | |
| 976 | /* These can be the second arg to send_sig_info/send_group_sig_info. */ |
| 977 | #define SEND_SIG_NOINFO ((struct siginfo *) 0) |
| 978 | #define SEND_SIG_PRIV ((struct siginfo *) 1) |
| 979 | #define SEND_SIG_FORCED ((struct siginfo *) 2) |
| 980 | |
| 981 | /* True if we are on the alternate signal stack. */ |
| 982 | |
| 983 | static inline int on_sig_stack(unsigned long sp) |
| 984 | { |
| 985 | return (sp - current->sas_ss_sp < current->sas_ss_size); |
| 986 | } |
| 987 | |
| 988 | static inline int sas_ss_flags(unsigned long sp) |
| 989 | { |
| 990 | return (current->sas_ss_size == 0 ? SS_DISABLE |
| 991 | : on_sig_stack(sp) ? SS_ONSTACK : 0); |
| 992 | } |
| 993 | |
| 994 | |
| 995 | #ifdef CONFIG_SECURITY |
| 996 | /* code is in security.c */ |
| 997 | extern int capable(int cap); |
| 998 | #else |
| 999 | static inline int capable(int cap) |
| 1000 | { |
| 1001 | if (cap_raised(current->cap_effective, cap)) { |
| 1002 | current->flags |= PF_SUPERPRIV; |
| 1003 | return 1; |
| 1004 | } |
| 1005 | return 0; |
| 1006 | } |
| 1007 | #endif |
| 1008 | |
| 1009 | /* |
| 1010 | * Routines for handling mm_structs |
| 1011 | */ |
| 1012 | extern struct mm_struct * mm_alloc(void); |
| 1013 | |
| 1014 | /* mmdrop drops the mm and the page tables */ |
| 1015 | extern void FASTCALL(__mmdrop(struct mm_struct *)); |
| 1016 | static inline void mmdrop(struct mm_struct * mm) |
| 1017 | { |
| 1018 | if (atomic_dec_and_test(&mm->mm_count)) |
| 1019 | __mmdrop(mm); |
| 1020 | } |
| 1021 | |
| 1022 | /* mmput gets rid of the mappings and all user-space */ |
| 1023 | extern void mmput(struct mm_struct *); |
| 1024 | /* Grab a reference to a task's mm, if it is not already going away */ |
| 1025 | extern struct mm_struct *get_task_mm(struct task_struct *task); |
| 1026 | /* Remove the current tasks stale references to the old mm_struct */ |
| 1027 | extern void mm_release(struct task_struct *, struct mm_struct *); |
| 1028 | |
| 1029 | extern int copy_thread(int, unsigned long, unsigned long, unsigned long, struct task_struct *, struct pt_regs *); |
| 1030 | extern void flush_thread(void); |
| 1031 | extern void exit_thread(void); |
| 1032 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1033 | extern void exit_files(struct task_struct *); |
| 1034 | extern void exit_signal(struct task_struct *); |
| 1035 | extern void __exit_signal(struct task_struct *); |
| 1036 | extern void exit_sighand(struct task_struct *); |
| 1037 | extern void __exit_sighand(struct task_struct *); |
| 1038 | extern void exit_itimers(struct signal_struct *); |
| 1039 | |
| 1040 | extern NORET_TYPE void do_group_exit(int); |
| 1041 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1042 | extern void daemonize(const char *, ...); |
| 1043 | extern int allow_signal(int); |
| 1044 | extern int disallow_signal(int); |
| 1045 | extern task_t *child_reaper; |
| 1046 | |
| 1047 | extern int do_execve(char *, char __user * __user *, char __user * __user *, struct pt_regs *); |
| 1048 | extern long do_fork(unsigned long, unsigned long, struct pt_regs *, unsigned long, int __user *, int __user *); |
| 1049 | task_t *fork_idle(int); |
| 1050 | |
| 1051 | extern void set_task_comm(struct task_struct *tsk, char *from); |
| 1052 | extern void get_task_comm(char *to, struct task_struct *tsk); |
| 1053 | |
| 1054 | #ifdef CONFIG_SMP |
| 1055 | extern void wait_task_inactive(task_t * p); |
| 1056 | #else |
| 1057 | #define wait_task_inactive(p) do { } while (0) |
| 1058 | #endif |
| 1059 | |
| 1060 | #define remove_parent(p) list_del_init(&(p)->sibling) |
| 1061 | #define add_parent(p, parent) list_add_tail(&(p)->sibling,&(parent)->children) |
| 1062 | |
| 1063 | #define REMOVE_LINKS(p) do { \ |
| 1064 | if (thread_group_leader(p)) \ |
| 1065 | list_del_init(&(p)->tasks); \ |
| 1066 | remove_parent(p); \ |
| 1067 | } while (0) |
| 1068 | |
| 1069 | #define SET_LINKS(p) do { \ |
| 1070 | if (thread_group_leader(p)) \ |
| 1071 | list_add_tail(&(p)->tasks,&init_task.tasks); \ |
| 1072 | add_parent(p, (p)->parent); \ |
| 1073 | } while (0) |
| 1074 | |
| 1075 | #define next_task(p) list_entry((p)->tasks.next, struct task_struct, tasks) |
| 1076 | #define prev_task(p) list_entry((p)->tasks.prev, struct task_struct, tasks) |
| 1077 | |
| 1078 | #define for_each_process(p) \ |
| 1079 | for (p = &init_task ; (p = next_task(p)) != &init_task ; ) |
| 1080 | |
| 1081 | /* |
| 1082 | * Careful: do_each_thread/while_each_thread is a double loop so |
| 1083 | * 'break' will not work as expected - use goto instead. |
| 1084 | */ |
| 1085 | #define do_each_thread(g, t) \ |
| 1086 | for (g = t = &init_task ; (g = t = next_task(g)) != &init_task ; ) do |
| 1087 | |
| 1088 | #define while_each_thread(g, t) \ |
| 1089 | while ((t = next_thread(t)) != g) |
| 1090 | |
| 1091 | extern task_t * FASTCALL(next_thread(const task_t *p)); |
| 1092 | |
| 1093 | #define thread_group_leader(p) (p->pid == p->tgid) |
| 1094 | |
| 1095 | static inline int thread_group_empty(task_t *p) |
| 1096 | { |
| 1097 | return list_empty(&p->pids[PIDTYPE_TGID].pid_list); |
| 1098 | } |
| 1099 | |
| 1100 | #define delay_group_leader(p) \ |
| 1101 | (thread_group_leader(p) && !thread_group_empty(p)) |
| 1102 | |
| 1103 | extern void unhash_process(struct task_struct *p); |
| 1104 | |
| 1105 | /* |
| 1106 | * Protects ->fs, ->files, ->mm, ->ptrace, ->group_info, ->comm, keyring |
| 1107 | * subscriptions and synchronises with wait4(). Also used in procfs. |
| 1108 | * |
| 1109 | * Nests both inside and outside of read_lock(&tasklist_lock). |
| 1110 | * It must not be nested with write_lock_irq(&tasklist_lock), |
| 1111 | * neither inside nor outside. |
| 1112 | */ |
| 1113 | static inline void task_lock(struct task_struct *p) |
| 1114 | { |
| 1115 | spin_lock(&p->alloc_lock); |
| 1116 | } |
| 1117 | |
| 1118 | static inline void task_unlock(struct task_struct *p) |
| 1119 | { |
| 1120 | spin_unlock(&p->alloc_lock); |
| 1121 | } |
| 1122 | |
| 1123 | /* set thread flags in other task's structures |
| 1124 | * - see asm/thread_info.h for TIF_xxxx flags available |
| 1125 | */ |
| 1126 | static inline void set_tsk_thread_flag(struct task_struct *tsk, int flag) |
| 1127 | { |
| 1128 | set_ti_thread_flag(tsk->thread_info,flag); |
| 1129 | } |
| 1130 | |
| 1131 | static inline void clear_tsk_thread_flag(struct task_struct *tsk, int flag) |
| 1132 | { |
| 1133 | clear_ti_thread_flag(tsk->thread_info,flag); |
| 1134 | } |
| 1135 | |
| 1136 | static inline int test_and_set_tsk_thread_flag(struct task_struct *tsk, int flag) |
| 1137 | { |
| 1138 | return test_and_set_ti_thread_flag(tsk->thread_info,flag); |
| 1139 | } |
| 1140 | |
| 1141 | static inline int test_and_clear_tsk_thread_flag(struct task_struct *tsk, int flag) |
| 1142 | { |
| 1143 | return test_and_clear_ti_thread_flag(tsk->thread_info,flag); |
| 1144 | } |
| 1145 | |
| 1146 | static inline int test_tsk_thread_flag(struct task_struct *tsk, int flag) |
| 1147 | { |
| 1148 | return test_ti_thread_flag(tsk->thread_info,flag); |
| 1149 | } |
| 1150 | |
| 1151 | static inline void set_tsk_need_resched(struct task_struct *tsk) |
| 1152 | { |
| 1153 | set_tsk_thread_flag(tsk,TIF_NEED_RESCHED); |
| 1154 | } |
| 1155 | |
| 1156 | static inline void clear_tsk_need_resched(struct task_struct *tsk) |
| 1157 | { |
| 1158 | clear_tsk_thread_flag(tsk,TIF_NEED_RESCHED); |
| 1159 | } |
| 1160 | |
| 1161 | static inline int signal_pending(struct task_struct *p) |
| 1162 | { |
| 1163 | return unlikely(test_tsk_thread_flag(p,TIF_SIGPENDING)); |
| 1164 | } |
| 1165 | |
| 1166 | static inline int need_resched(void) |
| 1167 | { |
| 1168 | return unlikely(test_thread_flag(TIF_NEED_RESCHED)); |
| 1169 | } |
| 1170 | |
| 1171 | /* |
| 1172 | * cond_resched() and cond_resched_lock(): latency reduction via |
| 1173 | * explicit rescheduling in places that are safe. The return |
| 1174 | * value indicates whether a reschedule was done in fact. |
| 1175 | * cond_resched_lock() will drop the spinlock before scheduling, |
| 1176 | * cond_resched_softirq() will enable bhs before scheduling. |
| 1177 | */ |
| 1178 | extern int cond_resched(void); |
| 1179 | extern int cond_resched_lock(spinlock_t * lock); |
| 1180 | extern int cond_resched_softirq(void); |
| 1181 | |
| 1182 | /* |
| 1183 | * Does a critical section need to be broken due to another |
| 1184 | * task waiting?: |
| 1185 | */ |
| 1186 | #if defined(CONFIG_PREEMPT) && defined(CONFIG_SMP) |
| 1187 | # define need_lockbreak(lock) ((lock)->break_lock) |
| 1188 | #else |
| 1189 | # define need_lockbreak(lock) 0 |
| 1190 | #endif |
| 1191 | |
| 1192 | /* |
| 1193 | * Does a critical section need to be broken due to another |
| 1194 | * task waiting or preemption being signalled: |
| 1195 | */ |
| 1196 | static inline int lock_need_resched(spinlock_t *lock) |
| 1197 | { |
| 1198 | if (need_lockbreak(lock) || need_resched()) |
| 1199 | return 1; |
| 1200 | return 0; |
| 1201 | } |
| 1202 | |
| 1203 | /* Reevaluate whether the task has signals pending delivery. |
| 1204 | This is required every time the blocked sigset_t changes. |
| 1205 | callers must hold sighand->siglock. */ |
| 1206 | |
| 1207 | extern FASTCALL(void recalc_sigpending_tsk(struct task_struct *t)); |
| 1208 | extern void recalc_sigpending(void); |
| 1209 | |
| 1210 | extern void signal_wake_up(struct task_struct *t, int resume_stopped); |
| 1211 | |
| 1212 | /* |
| 1213 | * Wrappers for p->thread_info->cpu access. No-op on UP. |
| 1214 | */ |
| 1215 | #ifdef CONFIG_SMP |
| 1216 | |
| 1217 | static inline unsigned int task_cpu(const struct task_struct *p) |
| 1218 | { |
| 1219 | return p->thread_info->cpu; |
| 1220 | } |
| 1221 | |
| 1222 | static inline void set_task_cpu(struct task_struct *p, unsigned int cpu) |
| 1223 | { |
| 1224 | p->thread_info->cpu = cpu; |
| 1225 | } |
| 1226 | |
| 1227 | #else |
| 1228 | |
| 1229 | static inline unsigned int task_cpu(const struct task_struct *p) |
| 1230 | { |
| 1231 | return 0; |
| 1232 | } |
| 1233 | |
| 1234 | static inline void set_task_cpu(struct task_struct *p, unsigned int cpu) |
| 1235 | { |
| 1236 | } |
| 1237 | |
| 1238 | #endif /* CONFIG_SMP */ |
| 1239 | |
| 1240 | #ifdef HAVE_ARCH_PICK_MMAP_LAYOUT |
| 1241 | extern void arch_pick_mmap_layout(struct mm_struct *mm); |
| 1242 | #else |
| 1243 | static inline void arch_pick_mmap_layout(struct mm_struct *mm) |
| 1244 | { |
| 1245 | mm->mmap_base = TASK_UNMAPPED_BASE; |
| 1246 | mm->get_unmapped_area = arch_get_unmapped_area; |
| 1247 | mm->unmap_area = arch_unmap_area; |
| 1248 | } |
| 1249 | #endif |
| 1250 | |
| 1251 | extern long sched_setaffinity(pid_t pid, cpumask_t new_mask); |
| 1252 | extern long sched_getaffinity(pid_t pid, cpumask_t *mask); |
| 1253 | |
| 1254 | #ifdef CONFIG_MAGIC_SYSRQ |
| 1255 | |
| 1256 | extern void normalize_rt_tasks(void); |
| 1257 | |
| 1258 | #endif |
| 1259 | |
| 1260 | /* try_to_freeze |
| 1261 | * |
| 1262 | * Checks whether we need to enter the refrigerator |
| 1263 | * and returns 1 if we did so. |
| 1264 | */ |
| 1265 | #ifdef CONFIG_PM |
| 1266 | extern void refrigerator(unsigned long); |
| 1267 | extern int freeze_processes(void); |
| 1268 | extern void thaw_processes(void); |
| 1269 | |
| 1270 | static inline int try_to_freeze(unsigned long refrigerator_flags) |
| 1271 | { |
| 1272 | if (unlikely(current->flags & PF_FREEZE)) { |
| 1273 | refrigerator(refrigerator_flags); |
| 1274 | return 1; |
| 1275 | } else |
| 1276 | return 0; |
| 1277 | } |
| 1278 | #else |
| 1279 | static inline void refrigerator(unsigned long flag) {} |
| 1280 | static inline int freeze_processes(void) { BUG(); return 0; } |
| 1281 | static inline void thaw_processes(void) {} |
| 1282 | |
| 1283 | static inline int try_to_freeze(unsigned long refrigerator_flags) |
| 1284 | { |
| 1285 | return 0; |
| 1286 | } |
| 1287 | #endif /* CONFIG_PM */ |
| 1288 | #endif /* __KERNEL__ */ |
| 1289 | |
| 1290 | #endif |