tag | line | file | source code |
p | 24 | fs/block_dev.c | register char * p; |
p | 44 | fs/block_dev.c | p = offset + bh->b_data; |
p | 49 | fs/block_dev.c | memcpy_fromfs(p,buf,chars); |
p | 50 | fs/block_dev.c | p += chars; |
p | 68 | fs/block_dev.c | register char * p; |
p | 84 | fs/block_dev.c | p = offset + bh->b_data; |
p | 89 | fs/block_dev.c | memcpy_tofs(buf,p,chars); |
p | 90 | fs/block_dev.c | p += chars; |
p | 534 | fs/buffer.c | struct buffer_head * tmp, * p; |
p | 548 | fs/buffer.c | p = tmp; |
p | 551 | fs/buffer.c | remove_from_queues(p); |
p | 552 | fs/buffer.c | put_unused_buffer_head(p); |
p | 222 | fs/exec.c | static unsigned long * create_tables(char * p,int argc,int envc) |
p | 227 | fs/exec.c | sp = (unsigned long *) (0xfffffffc & (unsigned long) p); |
p | 236 | fs/exec.c | put_fs_long((unsigned long) p,argv++); |
p | 237 | fs/exec.c | while (get_fs_byte(p++)) /* nothing */ ; |
p | 241 | fs/exec.c | put_fs_long((unsigned long) p,envp++); |
p | 242 | fs/exec.c | while (get_fs_byte(p++)) /* nothing */ ; |
p | 281 | fs/exec.c | unsigned long p, int from_kmem) |
p | 287 | fs/exec.c | if (!p) |
p | 304 | fs/exec.c | if (p < len) { /* this shouldn't happen - 128kB */ |
p | 309 | fs/exec.c | --p; --tmp; --len; |
p | 311 | fs/exec.c | offset = p % PAGE_SIZE; |
p | 314 | fs/exec.c | if (!(pag = (char *) page[p/PAGE_SIZE]) && |
p | 315 | fs/exec.c | !(pag = (char *) page[p/PAGE_SIZE] = |
p | 327 | fs/exec.c | return p; |
p | 401 | fs/exec.c | unsigned long p=PAGE_SIZE*MAX_ARG_PAGES-4; |
p | 495 | fs/exec.c | p = copy_strings(envc, envp, page, p, 0); |
p | 496 | fs/exec.c | p = copy_strings(--argc, argv+1, page, p, 0); |
p | 506 | fs/exec.c | p = copy_strings(1, &filename, page, p, 1); |
p | 509 | fs/exec.c | p = copy_strings(1, &i_arg, page, p, 2); |
p | 512 | fs/exec.c | p = copy_strings(1, &i_name, page, p, 2); |
p | 514 | fs/exec.c | if (!p) { |
p | 545 | fs/exec.c | p = copy_strings(envc,envp,page,p,0); |
p | 546 | fs/exec.c | p = copy_strings(argc,argv,page,p,0); |
p | 547 | fs/exec.c | if (!p) { |
p | 590 | fs/exec.c | p += change_ldt(ex.a_text,page); |
p | 591 | fs/exec.c | p -= LIBRARY_SIZE + MAX_ARG_PAGES*PAGE_SIZE; |
p | 592 | fs/exec.c | p = (unsigned long) create_tables((char *)p,argc,envc); |
p | 596 | fs/exec.c | current->start_stack = p; |
p | 597 | fs/exec.c | current->rss = (LIBRARY_OFFSET - p + PAGE_SIZE-1) / PAGE_SIZE; |
p | 603 | fs/exec.c | eip[3] = p; /* stack pointer */ |
p | 165 | fs/ext/file.c | char * p; |
p | 202 | fs/ext/file.c | p = (pos % BLOCK_SIZE) + bh->b_data; |
p | 209 | fs/ext/file.c | memcpy_fromfs(p,buf,c); |
p | 52 | fs/ext/truncate.c | static int trunc_indirect(struct inode * inode, int offset, unsigned long * p) |
p | 60 | fs/ext/truncate.c | if (*p) |
p | 61 | fs/ext/truncate.c | bh = bread(inode->i_dev, *p, BLOCK_SIZE); |
p | 84 | fs/ext/truncate.c | if (ext_free_block(inode->i_dev,*p)) |
p | 85 | fs/ext/truncate.c | *p = 0; |
p | 90 | fs/ext/truncate.c | static int trunc_dindirect(struct inode * inode, int offset, unsigned long * p) |
p | 98 | fs/ext/truncate.c | if (*p) |
p | 99 | fs/ext/truncate.c | bh = bread(inode->i_dev, *p, BLOCK_SIZE); |
p | 120 | fs/ext/truncate.c | if (ext_free_block(inode->i_dev,*p)) |
p | 121 | fs/ext/truncate.c | *p = 0; |
p | 165 | fs/minix/file.c | char * p; |
p | 202 | fs/minix/file.c | p = (pos % BLOCK_SIZE) + bh->b_data; |
p | 209 | fs/minix/file.c | memcpy_fromfs(p,buf,c); |
p | 46 | fs/minix/truncate.c | static int trunc_indirect(struct inode * inode, int offset, unsigned short * p) |
p | 54 | fs/minix/truncate.c | if (*p) |
p | 55 | fs/minix/truncate.c | bh = bread(inode->i_dev, *p, BLOCK_SIZE); |
p | 78 | fs/minix/truncate.c | if (minix_free_block(inode->i_dev,*p)) |
p | 79 | fs/minix/truncate.c | *p = 0; |
p | 202 | fs/namei.c | struct task_struct ** p; |
p | 263 | fs/namei.c | for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) { |
p | 264 | fs/namei.c | if (!*p) |
p | 266 | fs/namei.c | if (inode == (*p)->executable) { |
p | 270 | fs/namei.c | for (i=0; i < (*p)->numlibraries; i++) |
p | 271 | fs/namei.c | if (inode == (*p)->libraries[i].library) { |
p | 35 | fs/select.c | static void free_wait(select_table * p) |
p | 37 | fs/select.c | struct select_table_entry * entry = p->entry + p->nr; |
p | 39 | fs/select.c | while (p->nr > 0) { |
p | 40 | fs/select.c | p->nr--; |
p | 310 | fs/super.c | struct super_block * p; |
p | 321 | fs/super.c | for(p = &super_block[0] ; p < &super_block[NR_SUPER] ; p++) { |
p | 322 | fs/super.c | p->s_dev = 0; |
p | 323 | fs/super.c | p->s_blocksize = 0; |
p | 324 | fs/super.c | p->s_lock = 0; |
p | 325 | fs/super.c | p->s_wait = NULL; |
p | 326 | fs/super.c | p->s_mounted = p->s_covered = NULL; |
p | 329 | fs/super.c | p = read_super(ROOT_DEV,fs_type->name,0,NULL); |
p | 330 | fs/super.c | if (p) { |
p | 331 | fs/super.c | mi = p->s_mounted; |
p | 333 | fs/super.c | p->s_covered = mi; |
p | 334 | fs/super.c | p->s_flags = 0; |
p | 229 | include/linux/sched.h | extern void sleep_on(struct wait_queue ** p); |
p | 230 | include/linux/sched.h | extern void interruptible_sleep_on(struct wait_queue ** p); |
p | 231 | include/linux/sched.h | extern void wake_up(struct wait_queue ** p); |
p | 232 | include/linux/sched.h | extern void wake_one_task(struct task_struct * p); |
p | 234 | include/linux/sched.h | extern int send_sig(long sig,struct task_struct * p,int priv); |
p | 309 | include/linux/sched.h | extern inline void add_wait_queue(struct wait_queue ** p, struct wait_queue * wait) |
p | 315 | include/linux/sched.h | wait->next = *p; |
p | 318 | include/linux/sched.h | if ((tmp = tmp->next)->next == *p) |
p | 320 | include/linux/sched.h | *p = tmp->next = wait; |
p | 324 | include/linux/sched.h | extern inline void remove_wait_queue(struct wait_queue ** p, struct wait_queue * wait) |
p | 330 | include/linux/sched.h | if (*p == wait) |
p | 331 | include/linux/sched.h | if ((*p = wait->next) == wait) |
p | 332 | include/linux/sched.h | *p = NULL; |
p | 342 | include/linux/sched.h | extern inline void select_wait(struct wait_queue ** wait_address, select_table * p) |
p | 344 | include/linux/sched.h | struct select_table_entry * entry = p->entry + p->nr; |
p | 351 | include/linux/sched.h | p->nr++; |
p | 378 | include/linux/sched.h | #define REMOVE_LINKS(p) \ |
p | 379 | include/linux/sched.h | if ((p)->p_osptr) \ |
p | 380 | include/linux/sched.h | (p)->p_osptr->p_ysptr = (p)->p_ysptr; \ |
p | 381 | include/linux/sched.h | if ((p)->p_ysptr) \ |
p | 382 | include/linux/sched.h | (p)->p_ysptr->p_osptr = (p)->p_osptr; \ |
p | 384 | include/linux/sched.h | (p)->p_pptr->p_cptr = (p)->p_osptr |
p | 386 | include/linux/sched.h | #define SET_LINKS(p) \ |
p | 387 | include/linux/sched.h | (p)->p_ysptr = NULL; \ |
p | 388 | include/linux/sched.h | if ((p)->p_osptr = (p)->p_pptr->p_cptr) \ |
p | 389 | include/linux/sched.h | (p)->p_osptr->p_ysptr = p; \ |
p | 390 | include/linux/sched.h | (p)->p_pptr->p_cptr = p |
p | 35 | kernel/blk_drv/genhd.c | struct partition *p; |
p | 56 | kernel/blk_drv/genhd.c | p = 0x1BE + (void *)bh->b_data; |
p | 61 | kernel/blk_drv/genhd.c | if (p->sys_ind == EXTENDED_PARTITION || |
p | 62 | kernel/blk_drv/genhd.c | !(hd->part[current_minor].nr_sects = p->nr_sects)) |
p | 64 | kernel/blk_drv/genhd.c | hd->part[current_minor].start_sect = this_sector + p->start_sect; |
p | 71 | kernel/blk_drv/genhd.c | p++; |
p | 79 | kernel/blk_drv/genhd.c | if (p->sys_ind != EXTENDED_PARTITION || |
p | 80 | kernel/blk_drv/genhd.c | !(hd->part[current_minor].nr_sects = p->nr_sects)) |
p | 82 | kernel/blk_drv/genhd.c | hd->part[current_minor].start_sect = first_sector + p->start_sect; |
p | 83 | kernel/blk_drv/genhd.c | this_sector = first_sector + p->start_sect; |
p | 97 | kernel/blk_drv/genhd.c | struct partition *p; |
p | 109 | kernel/blk_drv/genhd.c | p = 0x1BE + (void *)bh->b_data; |
p | 110 | kernel/blk_drv/genhd.c | for (i=1 ; i<=4 ; minor++,i++,p++) { |
p | 111 | kernel/blk_drv/genhd.c | if (!(hd->part[minor].nr_sects = p->nr_sects)) |
p | 113 | kernel/blk_drv/genhd.c | hd->part[minor].start_sect = first_sector + p->start_sect; |
p | 119 | kernel/blk_drv/genhd.c | if (p->sys_ind == EXTENDED_PARTITION) { |
p | 127 | kernel/blk_drv/genhd.c | p = 0x1BE + (void *)bh->b_data; |
p | 129 | kernel/blk_drv/genhd.c | p--; |
p | 132 | kernel/blk_drv/genhd.c | if (!(p->start_sect && p->nr_sects)) |
p | 134 | kernel/blk_drv/genhd.c | hd->part[current_minor].start_sect = p->start_sect; |
p | 135 | kernel/blk_drv/genhd.c | hd->part[current_minor].nr_sects = p->nr_sects; |
p | 175 | kernel/blk_drv/genhd.c | struct gendisk *p; |
p | 182 | kernel/blk_drv/genhd.c | for (p = gendisk_head ; p ; p=p->next) { |
p | 183 | kernel/blk_drv/genhd.c | setup_dev(p); |
p | 184 | kernel/blk_drv/genhd.c | nr += p->nr_real; |
p | 84 | kernel/blk_drv/scsi/7000fasst.h | #define any2scsi(up, p) \ |
p | 85 | kernel/blk_drv/scsi/7000fasst.h | (up)[0] = (((long)(p)) >> 16); \ |
p | 86 | kernel/blk_drv/scsi/7000fasst.h | (up)[1] = ((long)(p)) >> 8; \ |
p | 87 | kernel/blk_drv/scsi/7000fasst.h | (up)[2] = ((long)(p)); |
p | 91 | kernel/blk_drv/scsi/7000fasst.h | #define xany2scsi(up, p) \ |
p | 92 | kernel/blk_drv/scsi/7000fasst.h | (up)[0] = ((long)(p)) >> 24; \ |
p | 93 | kernel/blk_drv/scsi/7000fasst.h | (up)[1] = ((long)(p)) >> 16; \ |
p | 94 | kernel/blk_drv/scsi/7000fasst.h | (up)[2] = ((long)(p)) >> 8; \ |
p | 95 | kernel/blk_drv/scsi/7000fasst.h | (up)[3] = ((long)(p)); |
p | 84 | kernel/blk_drv/scsi/aha1542.h | #define any2scsi(up, p) \ |
p | 85 | kernel/blk_drv/scsi/aha1542.h | (up)[0] = (((unsigned long)(p)) >> 16) ; \ |
p | 86 | kernel/blk_drv/scsi/aha1542.h | (up)[1] = (((unsigned long)(p)) >> 8); \ |
p | 87 | kernel/blk_drv/scsi/aha1542.h | (up)[2] = ((unsigned long)(p)); |
p | 91 | kernel/blk_drv/scsi/aha1542.h | #define xany2scsi(up, p) \ |
p | 92 | kernel/blk_drv/scsi/aha1542.h | (up)[0] = ((long)(p)) >> 24; \ |
p | 93 | kernel/blk_drv/scsi/aha1542.h | (up)[1] = ((long)(p)) >> 16; \ |
p | 94 | kernel/blk_drv/scsi/aha1542.h | (up)[2] = ((long)(p)) >> 8; \ |
p | 95 | kernel/blk_drv/scsi/aha1542.h | (up)[3] = ((long)(p)); |
p | 239 | kernel/blk_drv/scsi/scsi.c | char *p; |
p | 242 | kernel/blk_drv/scsi/scsi.c | for (p = str; (p < (str + 8)) && (*p != ' '); ++p); |
p | 243 | kernel/blk_drv/scsi/scsi.c | *p++ = ' '; |
p | 244 | kernel/blk_drv/scsi/scsi.c | memcpy((void *) p, (void *) &scsi_result[16], 16); |
p | 245 | kernel/blk_drv/scsi/scsi.c | for (; *p != ' '; ++p); |
p | 246 | kernel/blk_drv/scsi/scsi.c | *p = 0; |
p | 262 | kernel/blk_drv/scsi/scsi.c | ,host_nr , dev, lun, p); |
p | 605 | kernel/chr_drv/console.c | static void respond_string(char * p, int currcons, struct tty_struct * tty) |
p | 607 | kernel/chr_drv/console.c | while (*p) { |
p | 608 | kernel/chr_drv/console.c | put_tty_queue(*p,tty->read_q); |
p | 609 | kernel/chr_drv/console.c | p++; |
p | 651 | kernel/chr_drv/console.c | unsigned char *p; |
p | 654 | kernel/chr_drv/console.c | for (p = (unsigned char *)origin+1; p < (unsigned char *)scr_end; p+=2) |
p | 655 | kernel/chr_drv/console.c | *p = (*p & 0x88) | (((*p >> 4) | (*p << 4)) & 0x77); |
p | 657 | kernel/chr_drv/console.c | for (p = (unsigned char *)origin+1; p < (unsigned char *)scr_end; p+=2) |
p | 658 | kernel/chr_drv/console.c | *p ^= *p & 0x07 == 1 ? 0x70 : 0x77; |
p | 737 | kernel/chr_drv/console.c | unsigned short * p = (unsigned short *) pos; |
p | 740 | kernel/chr_drv/console.c | tmp = *p; |
p | 741 | kernel/chr_drv/console.c | *p = old; |
p | 743 | kernel/chr_drv/console.c | p++; |
p | 757 | kernel/chr_drv/console.c | unsigned short * p = (unsigned short *) pos; |
p | 760 | kernel/chr_drv/console.c | *p = *(p+1); |
p | 761 | kernel/chr_drv/console.c | p++; |
p | 763 | kernel/chr_drv/console.c | *p = video_erase_char; |
p | 111 | kernel/chr_drv/mem.c | unsigned long p = file->f_pos; |
p | 115 | kernel/chr_drv/mem.c | if (p >= high_memory) |
p | 117 | kernel/chr_drv/mem.c | if (count > high_memory - p) |
p | 118 | kernel/chr_drv/mem.c | count = high_memory - p; |
p | 119 | kernel/chr_drv/mem.c | memcpy_tofs(buf,(void *) p,count); |
p | 126 | kernel/chr_drv/mem.c | unsigned long p = file->f_pos; |
p | 130 | kernel/chr_drv/mem.c | if (p >= high_memory) |
p | 132 | kernel/chr_drv/mem.c | if (count > high_memory - p) |
p | 133 | kernel/chr_drv/mem.c | count = high_memory - p; |
p | 134 | kernel/chr_drv/mem.c | memcpy_fromfs((void *) p,buf,count); |
p | 91 | kernel/chr_drv/tty_ioctl.c | struct task_struct **p; |
p | 97 | kernel/chr_drv/tty_ioctl.c | for (p = &FIRST_TASK ; p <= &LAST_TASK ; p++, n++) |
p | 98 | kernel/chr_drv/tty_ioctl.c | if (*p) |
p | 100 | kernel/chr_drv/tty_ioctl.c | c = (char *)(*p); |
p | 21 | kernel/exit.c | int send_sig(long sig,struct task_struct * p,int priv) |
p | 23 | kernel/exit.c | if (!p || (sig < 0) || (sig > 32)) |
p | 25 | kernel/exit.c | if (!priv && ((sig != SIGCONT) || (current->session != p->session)) && |
p | 26 | kernel/exit.c | (current->euid != p->euid) && (current->uid != p->uid) && !suser()) |
p | 31 | kernel/exit.c | if (p->state == TASK_STOPPED) |
p | 32 | kernel/exit.c | p->state = TASK_RUNNING; |
p | 33 | kernel/exit.c | p->exit_code = 0; |
p | 34 | kernel/exit.c | p->signal &= ~( (1<<(SIGSTOP-1)) | (1<<(SIGTSTP-1)) | |
p | 39 | kernel/exit.c | p->signal &= ~(1<<(SIGCONT-1)); |
p | 41 | kernel/exit.c | p->signal |= (1<<(sig-1)); |
p | 42 | kernel/exit.c | if (p->flags & PF_PTRACED) { |
p | 44 | kernel/exit.c | p->exit_code = sig; |
p | 47 | kernel/exit.c | if (p->p_pptr != NULL && p->p_pptr->state == TASK_INTERRUPTIBLE) |
p | 48 | kernel/exit.c | p->p_pptr->state = TASK_RUNNING; |
p | 51 | kernel/exit.c | if (p->state == TASK_INTERRUPTIBLE || p->state == TASK_RUNNING) |
p | 52 | kernel/exit.c | p->state = TASK_STOPPED; |
p | 57 | kernel/exit.c | void release(struct task_struct * p) |
p | 61 | kernel/exit.c | if (!p) |
p | 63 | kernel/exit.c | if (p == current) { |
p | 68 | kernel/exit.c | if (task[i] == p) { |
p | 70 | kernel/exit.c | REMOVE_LINKS(p); |
p | 71 | kernel/exit.c | free_page((long) p); |
p | 82 | kernel/exit.c | int bad_task_ptr(struct task_struct *p) |
p | 86 | kernel/exit.c | if (!p) |
p | 89 | kernel/exit.c | if (task[i] == p) |
p | 173 | kernel/exit.c | struct task_struct **p; |
p | 177 | kernel/exit.c | for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) { |
p | 178 | kernel/exit.c | if (!*p || (*p)->session <= 0) |
p | 180 | kernel/exit.c | if ((*p)->pgrp == pgrp) |
p | 181 | kernel/exit.c | return (*p)->session; |
p | 182 | kernel/exit.c | if ((*p)->pid == pgrp) |
p | 183 | kernel/exit.c | fallback = (*p)->session; |
p | 190 | kernel/exit.c | struct task_struct **p; |
p | 196 | kernel/exit.c | for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) |
p | 197 | kernel/exit.c | if (*p && (*p)->pgrp == pgrp) { |
p | 198 | kernel/exit.c | if (sig && (err = send_sig(sig,*p,priv))) |
p | 208 | kernel/exit.c | struct task_struct **p; |
p | 212 | kernel/exit.c | for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) |
p | 213 | kernel/exit.c | if (*p && (*p)->pid == pid) |
p | 214 | kernel/exit.c | return(sig ? send_sig(sig,*p,priv) : 0); |
p | 224 | kernel/exit.c | struct task_struct **p = NR_TASKS + task; |
p | 230 | kernel/exit.c | while (--p > &FIRST_TASK) |
p | 231 | kernel/exit.c | if (*p && (*p)->pid > 1 && *p != current) { |
p | 233 | kernel/exit.c | if ((err = send_sig(sig,*p,0)) != -EPERM) |
p | 254 | kernel/exit.c | struct task_struct **p; |
p | 256 | kernel/exit.c | for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) { |
p | 257 | kernel/exit.c | if (!(*p) || |
p | 258 | kernel/exit.c | ((*p)->pgrp != pgrp) || |
p | 259 | kernel/exit.c | ((*p)->state == TASK_ZOMBIE) || |
p | 260 | kernel/exit.c | ((*p)->p_pptr->pid == 1)) |
p | 262 | kernel/exit.c | if (((*p)->p_pptr->pgrp != pgrp) && |
p | 263 | kernel/exit.c | ((*p)->p_pptr->session == (*p)->session)) |
p | 271 | kernel/exit.c | struct task_struct ** p; |
p | 273 | kernel/exit.c | for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) { |
p | 274 | kernel/exit.c | if (!*p || (*p)->pgrp != pgrp) |
p | 276 | kernel/exit.c | if ((*p)->state == TASK_STOPPED) |
p | 284 | kernel/exit.c | struct task_struct ** p; |
p | 286 | kernel/exit.c | for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) |
p | 287 | kernel/exit.c | if (*p && (*p)->p_opptr == father) |
p | 289 | kernel/exit.c | (*p)->p_opptr = task[1]; |
p | 291 | kernel/exit.c | (*p)->p_opptr = task[0]; |
p | 296 | kernel/exit.c | struct task_struct *p; |
p | 346 | kernel/exit.c | while (p = current->p_cptr) { |
p | 347 | kernel/exit.c | current->p_cptr = p->p_osptr; |
p | 348 | kernel/exit.c | p->p_ysptr = NULL; |
p | 349 | kernel/exit.c | p->flags &= ~PF_PTRACED; |
p | 351 | kernel/exit.c | p->p_pptr = task[1]; |
p | 353 | kernel/exit.c | p->p_pptr = task[0]; |
p | 354 | kernel/exit.c | p->p_osptr = p->p_pptr->p_cptr; |
p | 355 | kernel/exit.c | p->p_osptr->p_ysptr = p; |
p | 356 | kernel/exit.c | p->p_pptr->p_cptr = p; |
p | 357 | kernel/exit.c | if (p->state == TASK_ZOMBIE) |
p | 358 | kernel/exit.c | send_sig(SIGCHLD,p->p_pptr,1); |
p | 365 | kernel/exit.c | if ((p->pgrp != current->pgrp) && |
p | 366 | kernel/exit.c | (p->session == current->session) && |
p | 367 | kernel/exit.c | is_orphaned_pgrp(p->pgrp) && |
p | 368 | kernel/exit.c | has_stopped_jobs(p->pgrp)) { |
p | 369 | kernel/exit.c | kill_pg(p->pgrp,SIGHUP,1); |
p | 370 | kernel/exit.c | kill_pg(p->pgrp,SIGCONT,1); |
p | 374 | kernel/exit.c | struct task_struct **p; |
p | 384 | kernel/exit.c | for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) |
p | 385 | kernel/exit.c | if (*p && (*p)->session == current->session) |
p | 386 | kernel/exit.c | (*p)->tty = -1; |
p | 418 | kernel/exit.c | struct task_struct *p; |
p | 426 | kernel/exit.c | for (p = current->p_cptr ; p ; p = p->p_osptr) { |
p | 428 | kernel/exit.c | if (p->pid != pid) |
p | 431 | kernel/exit.c | if (p->pgrp != current->pgrp) |
p | 434 | kernel/exit.c | if (p->pgrp != -pid) |
p | 437 | kernel/exit.c | switch (p->state) { |
p | 439 | kernel/exit.c | if (!p->exit_code) |
p | 441 | kernel/exit.c | if (!(options & WUNTRACED) && !(p->flags & PF_PTRACED)) |
p | 444 | kernel/exit.c | put_fs_long((p->exit_code << 8) | 0x7f, |
p | 446 | kernel/exit.c | p->exit_code = 0; |
p | 447 | kernel/exit.c | return p->pid; |
p | 449 | kernel/exit.c | current->cutime += p->utime + p->cutime; |
p | 450 | kernel/exit.c | current->cstime += p->stime + p->cstime; |
p | 451 | kernel/exit.c | current->cmin_flt += p->min_flt + p->cmin_flt; |
p | 452 | kernel/exit.c | current->cmaj_flt += p->maj_flt + p->cmaj_flt; |
p | 453 | kernel/exit.c | flag = p->pid; |
p | 455 | kernel/exit.c | put_fs_long(p->exit_code, stat_addr); |
p | 456 | kernel/exit.c | if (p->p_opptr != p->p_pptr) { |
p | 457 | kernel/exit.c | REMOVE_LINKS(p); |
p | 458 | kernel/exit.c | p->p_pptr = p->p_opptr; |
p | 459 | kernel/exit.c | SET_LINKS(p); |
p | 460 | kernel/exit.c | send_sig(SIGCHLD,p->p_pptr,1); |
p | 462 | kernel/exit.c | release(p); |
p | 42 | kernel/fork.c | int copy_mem(int nr,struct task_struct * p) |
p | 60 | kernel/fork.c | p->start_code = new_code_base; |
p | 61 | kernel/fork.c | set_base(p->ldt[1],new_code_base); |
p | 62 | kernel/fork.c | set_base(p->ldt[2],new_data_base); |
p | 111 | kernel/fork.c | struct task_struct *p; |
p | 115 | kernel/fork.c | p = (struct task_struct *) get_free_page(GFP_KERNEL); |
p | 116 | kernel/fork.c | if (!p) |
p | 120 | kernel/fork.c | free_page((unsigned long) p); |
p | 123 | kernel/fork.c | task[nr] = p; |
p | 124 | kernel/fork.c | *p = *current; /* NOTE! this doesn't copy the supervisor stack */ |
p | 125 | kernel/fork.c | p->wait.task = p; |
p | 126 | kernel/fork.c | p->wait.next = NULL; |
p | 127 | kernel/fork.c | p->state = TASK_UNINTERRUPTIBLE; |
p | 128 | kernel/fork.c | p->flags &= ~PF_PTRACED; |
p | 129 | kernel/fork.c | p->pid = last_pid; |
p | 130 | kernel/fork.c | if (p->pid > 1) |
p | 131 | kernel/fork.c | p->swappable = 1; |
p | 132 | kernel/fork.c | p->p_pptr = p->p_opptr = current; |
p | 133 | kernel/fork.c | p->p_cptr = NULL; |
p | 134 | kernel/fork.c | SET_LINKS(p); |
p | 135 | kernel/fork.c | p->counter = p->priority; |
p | 136 | kernel/fork.c | p->signal = 0; |
p | 137 | kernel/fork.c | p->it_real_value = p->it_virt_value = p->it_prof_value = 0; |
p | 138 | kernel/fork.c | p->it_real_incr = p->it_virt_incr = p->it_prof_incr = 0; |
p | 139 | kernel/fork.c | p->leader = 0; /* process leadership doesn't inherit */ |
p | 140 | kernel/fork.c | p->utime = p->stime = 0; |
p | 141 | kernel/fork.c | p->cutime = p->cstime = 0; |
p | 142 | kernel/fork.c | p->min_flt = p->maj_flt = 0; |
p | 143 | kernel/fork.c | p->cmin_flt = p->cmaj_flt = 0; |
p | 144 | kernel/fork.c | p->start_time = jiffies; |
p | 145 | kernel/fork.c | p->tss.back_link = 0; |
p | 146 | kernel/fork.c | p->tss.esp0 = PAGE_SIZE + (long) p; |
p | 147 | kernel/fork.c | p->tss.ss0 = 0x10; |
p | 148 | kernel/fork.c | p->tss.eip = eip; |
p | 149 | kernel/fork.c | p->tss.eflags = eflags & 0xffffcfff; /* iopl is always 0 for a new process */ |
p | 150 | kernel/fork.c | p->tss.eax = 0; |
p | 151 | kernel/fork.c | p->tss.ecx = ecx; |
p | 152 | kernel/fork.c | p->tss.edx = edx; |
p | 153 | kernel/fork.c | p->tss.ebx = ebx; |
p | 154 | kernel/fork.c | p->tss.esp = esp; |
p | 155 | kernel/fork.c | p->tss.ebp = ebp; |
p | 156 | kernel/fork.c | p->tss.esi = esi; |
p | 157 | kernel/fork.c | p->tss.edi = edi; |
p | 158 | kernel/fork.c | p->tss.es = es & 0xffff; |
p | 159 | kernel/fork.c | p->tss.cs = cs & 0xffff; |
p | 160 | kernel/fork.c | p->tss.ss = ss & 0xffff; |
p | 161 | kernel/fork.c | p->tss.ds = ds & 0xffff; |
p | 162 | kernel/fork.c | p->tss.fs = fs & 0xffff; |
p | 163 | kernel/fork.c | p->tss.gs = gs & 0xffff; |
p | 164 | kernel/fork.c | p->tss.ldt = _LDT(nr); |
p | 165 | kernel/fork.c | p->tss.trace_bitmap = offsetof(struct tss_struct,io_bitmap) << 16; |
p | 167 | kernel/fork.c | p->tss.io_bitmap[i] = ~0; |
p | 169 | kernel/fork.c | __asm__("clts ; fnsave %0 ; frstor %0"::"m" (p->tss.i387)); |
p | 170 | kernel/fork.c | if (copy_mem(nr,p)) { |
p | 172 | kernel/fork.c | REMOVE_LINKS(p); |
p | 173 | kernel/fork.c | free_page((long) p); |
p | 177 | kernel/fork.c | if (f=p->filp[i]) |
p | 188 | kernel/fork.c | set_tss_desc(gdt+(nr<<1)+FIRST_TSS_ENTRY,&(p->tss)); |
p | 189 | kernel/fork.c | set_ldt_desc(gdt+(nr<<1)+FIRST_LDT_ENTRY,&(p->ldt)); |
p | 190 | kernel/fork.c | p->state = TASK_RUNNING; /* do this last, just in case */ |
p | 191 | kernel/fork.c | return p->pid; |
p | 86 | kernel/printk.c | char * p; |
p | 92 | kernel/printk.c | p = (char *) log_page + (4095 & (log_start+log_size)); |
p | 93 | kernel/printk.c | *p = buf[j]; |
p | 35 | kernel/sched.c | static void show_task(int nr,struct task_struct * p) |
p | 39 | kernel/sched.c | printk("%d: pid=%d, state=%d, father=%d, child=%d, ",(p == current)?-nr:nr,p->pid, |
p | 40 | kernel/sched.c | p->state, p->p_pptr->pid, p->p_cptr ? p->p_cptr->pid : -1); |
p | 42 | kernel/sched.c | while (i<j && !((char *)(p+1))[i]) |
p | 45 | kernel/sched.c | printk(" PC=%08X.", *(1019 + (unsigned long *) p)); |
p | 46 | kernel/sched.c | if (p->p_ysptr || p->p_osptr) |
p | 48 | kernel/sched.c | p->p_ysptr ? p->p_ysptr->pid : -1, |
p | 49 | kernel/sched.c | p->p_osptr ? p->p_osptr->pid : -1); |
p | 130 | kernel/sched.c | struct task_struct ** p; |
p | 135 | kernel/sched.c | for(p = &LAST_TASK ; p > &FIRST_TASK ; --p) |
p | 136 | kernel/sched.c | if (*p) { |
p | 137 | kernel/sched.c | if ((*p)->timeout && (*p)->timeout < jiffies) |
p | 138 | kernel/sched.c | if ((*p)->state == TASK_INTERRUPTIBLE) { |
p | 139 | kernel/sched.c | (*p)->timeout = 0; |
p | 140 | kernel/sched.c | wake_one_task(*p); |
p | 142 | kernel/sched.c | if (((*p)->signal & ~(*p)->blocked) && |
p | 143 | kernel/sched.c | (*p)->state==TASK_INTERRUPTIBLE) |
p | 144 | kernel/sched.c | wake_one_task(*p); |
p | 153 | kernel/sched.c | p = &task[NR_TASKS]; |
p | 155 | kernel/sched.c | if (!*--p) |
p | 157 | kernel/sched.c | if ((*p)->state == TASK_RUNNING && (*p)->counter > c) |
p | 158 | kernel/sched.c | c = (*p)->counter, next = i; |
p | 161 | kernel/sched.c | for(p = &LAST_TASK ; p > &FIRST_TASK ; --p) |
p | 162 | kernel/sched.c | if (*p) |
p | 163 | kernel/sched.c | (*p)->counter = ((*p)->counter >> 1) + |
p | 164 | kernel/sched.c | (*p)->priority; |
p | 185 | kernel/sched.c | void wake_one_task(struct task_struct * p) |
p | 187 | kernel/sched.c | p->state = TASK_RUNNING; |
p | 188 | kernel/sched.c | if (p->counter > current->counter) |
p | 199 | kernel/sched.c | struct task_struct * p; |
p | 208 | kernel/sched.c | if (p = tmp->task) { |
p | 209 | kernel/sched.c | if (p->state == TASK_ZOMBIE) |
p | 211 | kernel/sched.c | else if (p->state != TASK_STOPPED) { |
p | 212 | kernel/sched.c | p->state = TASK_RUNNING; |
p | 213 | kernel/sched.c | if (p->counter > current->counter) |
p | 222 | kernel/sched.c | static inline void __sleep_on(struct wait_queue **p, int state) |
p | 226 | kernel/sched.c | if (!p) |
p | 234 | kernel/sched.c | add_wait_queue(p,¤t->wait); |
p | 237 | kernel/sched.c | remove_wait_queue(p,¤t->wait); |
p | 241 | kernel/sched.c | void interruptible_sleep_on(struct wait_queue **p) |
p | 243 | kernel/sched.c | __sleep_on(p,TASK_INTERRUPTIBLE); |
p | 246 | kernel/sched.c | void sleep_on(struct wait_queue **p) |
p | 248 | kernel/sched.c | __sleep_on(p,TASK_UNINTERRUPTIBLE); |
p | 323 | kernel/sched.c | struct timer_list * p; |
p | 331 | kernel/sched.c | for (p = timer_list ; p < timer_list + TIME_REQUESTS ; p++) |
p | 332 | kernel/sched.c | if (!p->fn) |
p | 334 | kernel/sched.c | if (p >= timer_list + TIME_REQUESTS) |
p | 336 | kernel/sched.c | p->fn = fn; |
p | 337 | kernel/sched.c | p->jiffies = jiffies; |
p | 338 | kernel/sched.c | p->next = next_timer; |
p | 339 | kernel/sched.c | next_timer = p; |
p | 340 | kernel/sched.c | while (p->next && p->next->jiffies < p->jiffies) { |
p | 341 | kernel/sched.c | p->jiffies -= p->next->jiffies; |
p | 342 | kernel/sched.c | fn = p->fn; |
p | 343 | kernel/sched.c | p->fn = p->next->fn; |
p | 344 | kernel/sched.c | p->next->fn = fn; |
p | 345 | kernel/sched.c | jiffies = p->jiffies; |
p | 346 | kernel/sched.c | p->jiffies = p->next->jiffies; |
p | 347 | kernel/sched.c | p->next->jiffies = jiffies; |
p | 348 | kernel/sched.c | p = p->next; |
p | 370 | kernel/sched.c | struct task_struct **p; |
p | 372 | kernel/sched.c | for(p = &LAST_TASK; p > &FIRST_TASK; --p) |
p | 373 | kernel/sched.c | if (*p && ((*p)->state == TASK_RUNNING || |
p | 374 | kernel/sched.c | (*p)->state == TASK_UNINTERRUPTIBLE)) |
p | 511 | kernel/sched.c | struct desc_struct * p; |
p | 518 | kernel/sched.c | p = gdt+2+FIRST_TSS_ENTRY; |
p | 521 | kernel/sched.c | p->a=p->b=0; |
p | 522 | kernel/sched.c | p++; |
p | 523 | kernel/sched.c | p->a=p->b=0; |
p | 524 | kernel/sched.c | p++; |
p | 35 | kernel/sys.c | static int proc_sel(struct task_struct *p, int which, int who) |
p | 39 | kernel/sys.c | if (!who && p == current) |
p | 41 | kernel/sys.c | return(p->pid == who); |
p | 45 | kernel/sys.c | return(p->pgrp == who); |
p | 49 | kernel/sys.c | return(p->uid == who); |
p | 56 | kernel/sys.c | struct task_struct **p; |
p | 66 | kernel/sys.c | for(p = &LAST_TASK; p > &FIRST_TASK; --p) { |
p | 67 | kernel/sys.c | if (!*p || !proc_sel(*p, which, who)) |
p | 69 | kernel/sys.c | if ((*p)->uid != current->euid && |
p | 70 | kernel/sys.c | (*p)->uid != current->uid && !suser()) { |
p | 76 | kernel/sys.c | if (priority > (*p)->priority && !suser()) |
p | 79 | kernel/sys.c | (*p)->priority = priority; |
p | 86 | kernel/sys.c | struct task_struct **p; |
p | 92 | kernel/sys.c | for(p = &LAST_TASK; p > &FIRST_TASK; --p) { |
p | 93 | kernel/sys.c | if (!*p || !proc_sel(*p, which, who)) |
p | 95 | kernel/sys.c | if ((*p)->priority > max_prio) |
p | 96 | kernel/sys.c | max_prio = (*p)->priority; |
p | 554 | mm/memory.c | static int try_to_share(unsigned long address, struct task_struct * p) |
p | 563 | mm/memory.c | from_page += ((p->start_code>>20) & 0xffc); |
p | 610 | mm/memory.c | struct task_struct ** p; |
p | 615 | mm/memory.c | for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) { |
p | 616 | mm/memory.c | if (!*p) |
p | 618 | mm/memory.c | if (current == *p) |
p | 621 | mm/memory.c | if (inode != (*p)->executable) |
p | 624 | mm/memory.c | for (i=0; i < (*p)->numlibraries; i++) |
p | 625 | mm/memory.c | if (inode == (*p)->libraries[i].library) |
p | 627 | mm/memory.c | if (i >= (*p)->numlibraries) |
p | 630 | mm/memory.c | if (try_to_share(address,*p)) |
p | 639 | mm/memory.c | static unsigned long get_empty_pgtable(unsigned long * p) |
p | 644 | mm/memory.c | if (1 & *p) { |
p | 646 | mm/memory.c | return *p; |
p | 648 | mm/memory.c | if (*p) { |
p | 650 | mm/memory.c | *p = 0; |
p | 653 | mm/memory.c | *p = page | 7; |
p | 654 | mm/memory.c | return *p; |
p | 659 | mm/memory.c | *p = BAD_PAGETABLE | 7; |
p | 199 | mm/swap.c | struct task_struct * p; |
p | 206 | mm/swap.c | if (!(p = task[dir_entry >> 4])) { |
p | 232 | mm/swap.c | if (p->swappable && try_to_swap_out(page_entry + (unsigned long *) pg_table)) { |
p | 233 | mm/swap.c | p->rss--; |