tag | line | file | source code |
p | 21 | fs/block_dev.c | register char * p; |
p | 34 | fs/block_dev.c | p = offset + bh->b_data; |
p | 40 | fs/block_dev.c | *(p++) = get_fs_byte(buf++); |
p | 54 | fs/block_dev.c | register char * p; |
p | 63 | fs/block_dev.c | p = offset + bh->b_data; |
p | 69 | fs/block_dev.c | put_fs_byte(*(p++),buf++); |
p | 123 | fs/exec.c | static unsigned long * create_tables(char * p,int argc,int envc) |
p | 128 | fs/exec.c | sp = (unsigned long *) (0xfffffffc & (unsigned long) p); |
p | 137 | fs/exec.c | put_fs_long((unsigned long) p,argv++); |
p | 138 | fs/exec.c | while (get_fs_byte(p++)) /* nothing */ ; |
p | 142 | fs/exec.c | put_fs_long((unsigned long) p,envp++); |
p | 143 | fs/exec.c | while (get_fs_byte(p++)) /* nothing */ ; |
p | 182 | fs/exec.c | unsigned long p, int from_kmem) |
p | 188 | fs/exec.c | if (!p) |
p | 205 | fs/exec.c | if (p-len < 0) { /* this shouldn't happen - 128kB */ |
p | 210 | fs/exec.c | --p; --tmp; --len; |
p | 212 | fs/exec.c | offset = p % PAGE_SIZE; |
p | 215 | fs/exec.c | if (!(pag = (char *) page[p/PAGE_SIZE]) && |
p | 216 | fs/exec.c | !(pag = (char *) page[p/PAGE_SIZE] = |
p | 228 | fs/exec.c | return p; |
p | 271 | fs/exec.c | unsigned long p=PAGE_SIZE*MAX_ARG_PAGES-4; |
p | 342 | fs/exec.c | p = copy_strings(envc, envp, page, p, 0); |
p | 343 | fs/exec.c | p = copy_strings(--argc, argv+1, page, p, 0); |
p | 353 | fs/exec.c | p = copy_strings(1, &filename, page, p, 1); |
p | 356 | fs/exec.c | p = copy_strings(1, &i_arg, page, p, 2); |
p | 359 | fs/exec.c | p = copy_strings(1, &i_name, page, p, 2); |
p | 361 | fs/exec.c | if (!p) { |
p | 391 | fs/exec.c | p = copy_strings(envc,envp,page,p,0); |
p | 392 | fs/exec.c | p = copy_strings(argc,argv,page,p,0); |
p | 393 | fs/exec.c | if (!p) { |
p | 412 | fs/exec.c | p += change_ldt(ex.a_text,page)-MAX_ARG_PAGES*PAGE_SIZE; |
p | 413 | fs/exec.c | p = (unsigned long) create_tables((char *)p,argc,envc); |
p | 417 | fs/exec.c | current->start_stack = p & 0xfffff000; |
p | 428 | fs/exec.c | eip[3] = p; /* stack pointer */ |
p | 35 | fs/file_dev.c | char * p = nr + bh->b_data; |
p | 37 | fs/file_dev.c | put_fs_byte(*(p++),buf++); |
p | 53 | fs/file_dev.c | char * p; |
p | 70 | fs/file_dev.c | p = c + bh->b_data; |
p | 81 | fs/file_dev.c | *(p++) = get_fs_byte(buf++); |
p | 244 | fs/super.c | struct super_block * p; |
p | 255 | fs/super.c | for(p = &super_block[0] ; p < &super_block[NR_SUPER] ; p++) { |
p | 256 | fs/super.c | p->s_dev = 0; |
p | 257 | fs/super.c | p->s_lock = 0; |
p | 258 | fs/super.c | p->s_wait = NULL; |
p | 260 | fs/super.c | if (!(p=read_super(ROOT_DEV))) |
p | 265 | fs/super.c | p->s_isup = p->s_imount = mi; |
p | 269 | fs/super.c | i=p->s_nzones; |
p | 271 | fs/super.c | if (!set_bit(i&8191,p->s_zmap[i>>13]->b_data)) |
p | 273 | fs/super.c | printk("%d/%d free blocks\n\r",free,p->s_nzones); |
p | 275 | fs/super.c | i=p->s_ninodes+1; |
p | 277 | fs/super.c | if (!set_bit(i&8191,p->s_imap[i>>13]->b_data)) |
p | 279 | fs/super.c | printk("%d/%d free inodes\n\r",free,p->s_ninodes); |
p | 14 | fs/truncate.c | unsigned short * p; |
p | 20 | fs/truncate.c | p = (unsigned short *) bh->b_data; |
p | 21 | fs/truncate.c | for (i=0;i<512;i++,p++) |
p | 22 | fs/truncate.c | if (*p) |
p | 23 | fs/truncate.c | free_block(dev,*p); |
p | 32 | fs/truncate.c | unsigned short * p; |
p | 38 | fs/truncate.c | p = (unsigned short *) bh->b_data; |
p | 39 | fs/truncate.c | for (i=0;i<512;i++,p++) |
p | 40 | fs/truncate.c | if (*p) |
p | 41 | fs/truncate.c | free_ind(dev,*p); |
p | 144 | include/linux/sched.h | extern void sleep_on(struct task_struct ** p); |
p | 145 | include/linux/sched.h | extern void interruptible_sleep_on(struct task_struct ** p); |
p | 146 | include/linux/sched.h | extern void wake_up(struct task_struct ** p); |
p | 62 | kernel/blk_drv/hd.c | struct partition *p; |
p | 99 | kernel/blk_drv/hd.c | p = 0x1BE + (void *)bh->b_data; |
p | 100 | kernel/blk_drv/hd.c | for (i=1;i<5;i++,p++) { |
p | 101 | kernel/blk_drv/hd.c | hd[i+5*drive].start_sect = p->start_sect; |
p | 102 | kernel/blk_drv/hd.c | hd[i+5*drive].nr_sects = p->nr_sects; |
p | 263 | kernel/chr_drv/console.c | char * p = RESPONSE; |
p | 266 | kernel/chr_drv/console.c | while (*p) { |
p | 267 | kernel/chr_drv/console.c | PUTCH(*p,tty->read_q); |
p | 268 | kernel/chr_drv/console.c | p++; |
p | 278 | kernel/chr_drv/console.c | unsigned short * p = (unsigned short *) pos; |
p | 281 | kernel/chr_drv/console.c | tmp=*p; |
p | 282 | kernel/chr_drv/console.c | *p=old; |
p | 284 | kernel/chr_drv/console.c | p++; |
p | 304 | kernel/chr_drv/console.c | unsigned short * p = (unsigned short *) pos; |
p | 310 | kernel/chr_drv/console.c | *p = *(p+1); |
p | 311 | kernel/chr_drv/console.c | p++; |
p | 313 | kernel/chr_drv/console.c | *p=0x0720; |
p | 19 | kernel/exit.c | void release(struct task_struct * p) |
p | 23 | kernel/exit.c | if (!p) |
p | 26 | kernel/exit.c | if (task[i]==p) { |
p | 28 | kernel/exit.c | free_page((long)p); |
p | 35 | kernel/exit.c | static inline int send_sig(long sig,struct task_struct * p,int priv) |
p | 37 | kernel/exit.c | if (!p || sig<1 || sig>32) |
p | 39 | kernel/exit.c | if (priv || (current->euid==p->euid) || suser()) |
p | 40 | kernel/exit.c | p->signal |= (1<<(sig-1)); |
p | 48 | kernel/exit.c | struct task_struct **p = NR_TASKS + task; |
p | 50 | kernel/exit.c | while (--p > &FIRST_TASK) { |
p | 51 | kernel/exit.c | if (*p && (*p)->session == current->session) |
p | 52 | kernel/exit.c | (*p)->signal |= 1<<(SIGHUP-1); |
p | 62 | kernel/exit.c | struct task_struct **p = NR_TASKS + task; |
p | 65 | kernel/exit.c | if (!pid) while (--p > &FIRST_TASK) { |
p | 66 | kernel/exit.c | if (*p && (*p)->pgrp == current->pid) |
p | 67 | kernel/exit.c | if (err=send_sig(sig,*p,1)) |
p | 69 | kernel/exit.c | } else if (pid>0) while (--p > &FIRST_TASK) { |
p | 70 | kernel/exit.c | if (*p && (*p)->pid == pid) |
p | 71 | kernel/exit.c | if (err=send_sig(sig,*p,0)) |
p | 73 | kernel/exit.c | } else if (pid == -1) while (--p > &FIRST_TASK) |
p | 74 | kernel/exit.c | if (err = send_sig(sig,*p,0)) |
p | 76 | kernel/exit.c | else while (--p > &FIRST_TASK) |
p | 77 | kernel/exit.c | if (*p && (*p)->pgrp == -pid) |
p | 78 | kernel/exit.c | if (err = send_sig(sig,*p,0)) |
p | 137 | kernel/exit.c | struct task_struct ** p; |
p | 142 | kernel/exit.c | for(p = &LAST_TASK ; p > &FIRST_TASK ; --p) { |
p | 143 | kernel/exit.c | if (!*p || *p == current) |
p | 145 | kernel/exit.c | if ((*p)->father != current->pid) |
p | 148 | kernel/exit.c | if ((*p)->pid != pid) |
p | 151 | kernel/exit.c | if ((*p)->pgrp != current->pgrp) |
p | 154 | kernel/exit.c | if ((*p)->pgrp != -pid) |
p | 157 | kernel/exit.c | switch ((*p)->state) { |
p | 162 | kernel/exit.c | return (*p)->pid; |
p | 164 | kernel/exit.c | current->cutime += (*p)->utime; |
p | 165 | kernel/exit.c | current->cstime += (*p)->stime; |
p | 166 | kernel/exit.c | flag = (*p)->pid; |
p | 167 | kernel/exit.c | put_fs_long((*p)->exit_code,stat_addr); |
p | 168 | kernel/exit.c | release(*p); |
p | 39 | kernel/fork.c | int copy_mem(int nr,struct task_struct * p) |
p | 53 | kernel/fork.c | set_base(p->ldt[1],new_code_base); |
p | 54 | kernel/fork.c | set_base(p->ldt[2],new_data_base); |
p | 72 | kernel/fork.c | struct task_struct *p; |
p | 76 | kernel/fork.c | p = (struct task_struct *) get_free_page(); |
p | 77 | kernel/fork.c | if (!p) |
p | 79 | kernel/fork.c | *p = *current; /* NOTE! this doesn't copy the supervisor stack */ |
p | 80 | kernel/fork.c | p->state = TASK_RUNNING; |
p | 81 | kernel/fork.c | p->pid = last_pid; |
p | 82 | kernel/fork.c | p->father = current->pid; |
p | 83 | kernel/fork.c | p->counter = p->priority; |
p | 84 | kernel/fork.c | p->signal = 0; |
p | 85 | kernel/fork.c | p->alarm = 0; |
p | 86 | kernel/fork.c | p->leader = 0; /* process leadership doesn't inherit */ |
p | 87 | kernel/fork.c | p->utime = p->stime = 0; |
p | 88 | kernel/fork.c | p->cutime = p->cstime = 0; |
p | 89 | kernel/fork.c | p->start_time = jiffies; |
p | 90 | kernel/fork.c | p->tss.back_link = 0; |
p | 91 | kernel/fork.c | p->tss.esp0 = PAGE_SIZE + (long) p; |
p | 92 | kernel/fork.c | p->tss.ss0 = 0x10; |
p | 93 | kernel/fork.c | p->tss.eip = eip; |
p | 94 | kernel/fork.c | p->tss.eflags = eflags; |
p | 95 | kernel/fork.c | p->tss.eax = 0; |
p | 96 | kernel/fork.c | p->tss.ecx = ecx; |
p | 97 | kernel/fork.c | p->tss.edx = edx; |
p | 98 | kernel/fork.c | p->tss.ebx = ebx; |
p | 99 | kernel/fork.c | p->tss.esp = esp; |
p | 100 | kernel/fork.c | p->tss.ebp = ebp; |
p | 101 | kernel/fork.c | p->tss.esi = esi; |
p | 102 | kernel/fork.c | p->tss.edi = edi; |
p | 103 | kernel/fork.c | p->tss.es = es & 0xffff; |
p | 104 | kernel/fork.c | p->tss.cs = cs & 0xffff; |
p | 105 | kernel/fork.c | p->tss.ss = ss & 0xffff; |
p | 106 | kernel/fork.c | p->tss.ds = ds & 0xffff; |
p | 107 | kernel/fork.c | p->tss.fs = fs & 0xffff; |
p | 108 | kernel/fork.c | p->tss.gs = gs & 0xffff; |
p | 109 | kernel/fork.c | p->tss.ldt = _LDT(nr); |
p | 110 | kernel/fork.c | p->tss.trace_bitmap = 0x80000000; |
p | 112 | kernel/fork.c | __asm__("fnsave %0"::"m" (p->tss.i387)); |
p | 113 | kernel/fork.c | if (copy_mem(nr,p)) { |
p | 114 | kernel/fork.c | free_page((long) p); |
p | 118 | kernel/fork.c | if (f=p->filp[i]) |
p | 124 | kernel/fork.c | set_tss_desc(gdt+(nr<<1)+FIRST_TSS_ENTRY,&(p->tss)); |
p | 125 | kernel/fork.c | set_ldt_desc(gdt+(nr<<1)+FIRST_LDT_ENTRY,&(p->ldt)); |
p | 126 | kernel/fork.c | task[nr] = p; /* do this last, just in case */ |
p | 26 | kernel/sched.c | void show_task(int nr,struct task_struct * p) |
p | 28 | kernel/sched.c | printk("%d: pid=%d, state=%d, ",nr,p->pid,p->state); |
p | 29 | kernel/sched.c | printk("eip=%04x:%08x\n\r",p->tss.cs&0xffff,p->tss.eip); |
p | 101 | kernel/sched.c | struct task_struct ** p; |
p | 105 | kernel/sched.c | for(p = &LAST_TASK ; p > &FIRST_TASK ; --p) |
p | 106 | kernel/sched.c | if (*p) { |
p | 107 | kernel/sched.c | if ((*p)->alarm && (*p)->alarm < jiffies) { |
p | 108 | kernel/sched.c | (*p)->signal |= (1<<(SIGALRM-1)); |
p | 109 | kernel/sched.c | (*p)->alarm = 0; |
p | 111 | kernel/sched.c | if (((*p)->signal & ~(_BLOCKABLE & (*p)->blocked)) && |
p | 112 | kernel/sched.c | (*p)->state==TASK_INTERRUPTIBLE) |
p | 113 | kernel/sched.c | (*p)->state=TASK_RUNNING; |
p | 122 | kernel/sched.c | p = &task[NR_TASKS]; |
p | 124 | kernel/sched.c | if (!*--p) |
p | 126 | kernel/sched.c | if ((*p)->state == TASK_RUNNING && (*p)->counter > c) |
p | 127 | kernel/sched.c | c = (*p)->counter, next = i; |
p | 130 | kernel/sched.c | for(p = &LAST_TASK ; p > &FIRST_TASK ; --p) |
p | 131 | kernel/sched.c | if (*p) |
p | 132 | kernel/sched.c | (*p)->counter = ((*p)->counter >> 1) + |
p | 133 | kernel/sched.c | (*p)->priority; |
p | 145 | kernel/sched.c | void sleep_on(struct task_struct **p) |
p | 149 | kernel/sched.c | if (!p) |
p | 153 | kernel/sched.c | tmp = *p; |
p | 154 | kernel/sched.c | *p = current; |
p | 161 | kernel/sched.c | void interruptible_sleep_on(struct task_struct **p) |
p | 165 | kernel/sched.c | if (!p) |
p | 169 | kernel/sched.c | tmp=*p; |
p | 170 | kernel/sched.c | *p=current; |
p | 173 | kernel/sched.c | if (*p && *p != current) { |
p | 174 | kernel/sched.c | (**p).state=0; |
p | 177 | kernel/sched.c | *p=NULL; |
p | 182 | kernel/sched.c | void wake_up(struct task_struct **p) |
p | 184 | kernel/sched.c | if (p && *p) { |
p | 185 | kernel/sched.c | (**p).state=0; |
p | 186 | kernel/sched.c | *p=NULL; |
p | 286 | kernel/sched.c | struct timer_list * p; |
p | 294 | kernel/sched.c | for (p = timer_list ; p < timer_list + TIME_REQUESTS ; p++) |
p | 295 | kernel/sched.c | if (!p->fn) |
p | 297 | kernel/sched.c | if (p >= timer_list + TIME_REQUESTS) |
p | 299 | kernel/sched.c | p->fn = fn; |
p | 300 | kernel/sched.c | p->jiffies = jiffies; |
p | 301 | kernel/sched.c | p->next = next_timer; |
p | 302 | kernel/sched.c | next_timer = p; |
p | 303 | kernel/sched.c | while (p->next && p->next->jiffies < p->jiffies) { |
p | 304 | kernel/sched.c | p->jiffies -= p->next->jiffies; |
p | 305 | kernel/sched.c | fn = p->fn; |
p | 306 | kernel/sched.c | p->fn = p->next->fn; |
p | 307 | kernel/sched.c | p->next->fn = fn; |
p | 308 | kernel/sched.c | jiffies = p->jiffies; |
p | 309 | kernel/sched.c | p->jiffies = p->next->jiffies; |
p | 310 | kernel/sched.c | p->next->jiffies = jiffies; |
p | 311 | kernel/sched.c | p = p->next; |
p | 392 | kernel/sched.c | struct desc_struct * p; |
p | 398 | kernel/sched.c | p = gdt+2+FIRST_TSS_ENTRY; |
p | 401 | kernel/sched.c | p->a=p->b=0; |
p | 402 | kernel/sched.c | p++; |
p | 403 | kernel/sched.c | p->a=p->b=0; |
p | 404 | kernel/sched.c | p++; |