tag	line	file	source code
p	239	drivers/block/blk.h	struct task_struct * p;
p	270	drivers/block/blk.h	if ((p = req->waiting) != NULL) {
p	272	drivers/block/blk.h	p->state = TASK_RUNNING;
p	273	drivers/block/blk.h	if (p->counter > current->counter)
p	39	drivers/block/genhd.c	struct partition *p;
p	58	drivers/block/genhd.c	p = (struct partition *) (0x1BE + bh->b_data);
p	63	drivers/block/genhd.c	if (p->sys_ind == EXTENDED_PARTITION ||
p	64	drivers/block/genhd.c	!(hd->part[current_minor].nr_sects = p->nr_sects))
p	66	drivers/block/genhd.c	hd->part[current_minor].start_sect = this_sector + p->start_sect;
p	71	drivers/block/genhd.c	p++;
p	79	drivers/block/genhd.c	if (p->sys_ind != EXTENDED_PARTITION ||
p	80	drivers/block/genhd.c	!(hd->part[current_minor].nr_sects = p->nr_sects))
p	82	drivers/block/genhd.c	hd->part[current_minor].start_sect = first_sector + p->start_sect;
p	83	drivers/block/genhd.c	this_sector = first_sector + p->start_sect;
p	98	drivers/block/genhd.c	struct partition *p;
p	113	drivers/block/genhd.c	p = (struct partition *) (0x1BE + bh->b_data);
p	114	drivers/block/genhd.c	for (i=1 ; i<=4 ; minor++,i++,p++) {
p	115	drivers/block/genhd.c	if (!(hd->part[minor].nr_sects = p->nr_sects))
p	117	drivers/block/genhd.c	hd->part[minor].start_sect = first_sector + p->start_sect;
p	121	drivers/block/genhd.c	if (p->sys_ind == EXTENDED_PARTITION) {
p	131	drivers/block/genhd.c	p = (struct partition *) (0x1BE + bh->b_data);
p	133	drivers/block/genhd.c	p--;
p	136	drivers/block/genhd.c	if (!(p->start_sect && p->nr_sects))
p	138	drivers/block/genhd.c	hd->part[current_minor].start_sect = p->start_sect;
p	139	drivers/block/genhd.c	hd->part[current_minor].nr_sects = p->nr_sects;
p	200	drivers/block/genhd.c	struct gendisk *p;
p	207	drivers/block/genhd.c	for (p = gendisk_head ; p ; p=p->next) {
p	208	drivers/block/genhd.c	setup_dev(p);
p	209	drivers/block/genhd.c	nr += p->nr_real;
p	84	drivers/block/mcd.c	static void bin2bcd(unsigned char *p);
p	896	drivers/block/mcd.c	bin2bcd(unsigned char *p)
p	900	drivers/block/mcd.c	u = *p % 10;
p	901	drivers/block/mcd.c	t = *p / 10;
p	902	drivers/block/mcd.c	*p = u | (t << 4);
p	666	drivers/char/console.c	static void respond_string(char * p, int currcons, struct tty_struct * tty)
p	668	drivers/char/console.c	while (*p) {
p	669	drivers/char/console.c	put_tty_queue(*p, &tty->read_q);
p	670	drivers/char/console.c	p++;
p	712	drivers/char/console.c	unsigned char *p;
p	715	drivers/char/console.c	for (p = (unsigned char *)origin+1; p < (unsigned char *)scr_end; p+=2)
p	716	drivers/char/console.c	*p = (*p & 0x88) | (((*p >> 4) | (*p << 4)) & 0x77);
p	718	drivers/char/console.c	for (p = (unsigned char *)origin+1; p < (unsigned char *)scr_end; p+=2)
p	719	drivers/char/console.c	*p ^= *p & 0x07 == 1 ? 0x70 : 0x77;
p	807	drivers/char/console.c	unsigned short * p = (unsigned short *) pos;
p	810	drivers/char/console.c	tmp = *p;
p	811	drivers/char/console.c	*p = old;
p	813	drivers/char/console.c	p++;
p	827	drivers/char/console.c	unsigned short * p = (unsigned short *) pos;
p	830	drivers/char/console.c	*p = *(p+1);
p	831	drivers/char/console.c	p++;
p	833	drivers/char/console.c	*p = video_erase_char;
p	1564	drivers/char/console.c	unsigned char *p, *p1, *p2;
p	1570	drivers/char/console.c	p = p1;
p	1572	drivers/char/console.c	p2 = p;
p	1574	drivers/char/console.c	for (p = p1; p <= p2; p += 2)
p	1575	drivers/char/console.c	*p = (*p & 0x88) | ((*p << 4) & 0x70) | ((*p >> 4) & 0x07);
p	1582	drivers/char/console.c	static inline int atedge(const int p)
p	1584	drivers/char/console.c	return (!(p % video_size_row) || !((p + 2) % video_size_row));
p	38	drivers/char/mem.c	unsigned long p = file->f_pos;
p	43	drivers/char/mem.c	if (p >= high_memory)
p	45	drivers/char/mem.c	if (count > high_memory - p)
p	46	drivers/char/mem.c	count = high_memory - p;
p	48	drivers/char/mem.c	while (p < PAGE_SIZE && count > 0) {
p	51	drivers/char/mem.c	p++;
p	55	drivers/char/mem.c	memcpy_tofs(buf,(void *) p,count);
p	63	drivers/char/mem.c	unsigned long p = file->f_pos;
p	68	drivers/char/mem.c	if (p >= high_memory)
p	70	drivers/char/mem.c	if (count > high_memory - p)
p	71	drivers/char/mem.c	count = high_memory - p;
p	73	drivers/char/mem.c	while (p < PAGE_SIZE && count > 0) {
p	76	drivers/char/mem.c	p++;
p	80	drivers/char/mem.c	memcpy_fromfs((void *) p,buf,count);
p	140	drivers/char/tty_io.c	unsigned char  *p = bufp;
p	151	drivers/char/tty_io.c	*p++ =  tty->read_q.buf[tail++];
p	249	drivers/char/tty_io.c	struct task_struct **p;
p	273	drivers/char/tty_io.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	274	drivers/char/tty_io.c	if ((*p) && (*p)->tty == tty->line)
p	275	drivers/char/tty_io.c	(*p)->tty = -1;
p	1193	drivers/char/tty_io.c	struct task_struct **p;
p	1245	drivers/char/tty_io.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	1246	drivers/char/tty_io.c	if ((*p) && (*p)->tty == tty->line)
p	1247	drivers/char/tty_io.c	(*p)->tty = -1;
p	1456	drivers/char/tty_io.c	struct task_struct **p;
p	1464	drivers/char/tty_io.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	1465	drivers/char/tty_io.c	if (!(*p))
p	1467	drivers/char/tty_io.c	if (((*p)->tty == line) ||
p	1468	drivers/char/tty_io.c	((session > 0) && ((*p)->session == session)))
p	1469	drivers/char/tty_io.c	send_sig(SIGKILL, *p, 1);
p	1472	drivers/char/tty_io.c	filp = (*p)->filp[i];
p	1475	drivers/char/tty_io.c	send_sig(SIGKILL, *p, 1);
p	1503	drivers/char/tty_io.c	char *p;
p	1517	drivers/char/tty_io.c	p = bufp;
p	1520	drivers/char/tty_io.c	tty->write_q.buf[head++] = *p++;
p	1527	drivers/char/tty_io.c	tty->write_data_ptr = (unsigned char *) p;
p	1548	drivers/char/tty_io.c	unsigned char * p;
p	1565	drivers/char/tty_io.c	p = tty->write_data_ptr;
p	1568	drivers/char/tty_io.c	tty->write_q.buf[head++] = *p++;
p	1573	drivers/char/tty_io.c	tty->write_data_ptr = p;
p	114	drivers/char/tty_ioctl.c	struct task_struct **p;
p	121	drivers/char/tty_ioctl.c	for (p = &FIRST_TASK ; p <= &LAST_TASK ; p++, n++)
p	122	drivers/char/tty_ioctl.c	if (*p)
p	124	drivers/char/tty_ioctl.c	c = (char *)(*p);
p	275	drivers/char/vt.c	char *p;
p	284	drivers/char/vt.c	for (p = func_table[i]; *p; p++)
p	285	drivers/char/vt.c	put_fs_byte(*p, q++);
p	296	drivers/char/vt.c	u_char *p;
p	305	drivers/char/vt.c	for (p = a->kb_string; get_fs_byte(p); p++)
p	322	drivers/char/vt.c	for (p = a->kb_string, q = func_table[i]; ; p++, q++)
p	323	drivers/char/vt.c	if (!(*q = get_fs_byte(p)))
p	415	drivers/net/slip.c	unsigned char *bp, *p;
p	432	drivers/net/slip.c	p = icp;
p	434	drivers/net/slip.c	len = slhc_compress(sl->slcomp, p, len, sl->cbuff, &p, 1);
p	451	drivers/net/slip.c	c = *p++;
p	472	drivers/net/slip.c	count=slip_esc6(p, (unsigned char *)sl->xbuff,len);
p	474	drivers/net/slip.c	count=slip_esc(p, (unsigned char *)sl->xbuff,len);
p	656	drivers/net/slip.c	unsigned char *p;
p	675	drivers/net/slip.c	p = (unsigned char *) kmalloc(l + 4, GFP_KERNEL);
p	676	drivers/net/slip.c	if (p == NULL) {
p	682	drivers/net/slip.c	sl->dev->mem_start  = (unsigned long) p;
p	685	drivers/net/slip.c	p = (unsigned char *) kmalloc(l + 4, GFP_KERNEL);
p	686	drivers/net/slip.c	if (p == NULL) {
p	690	drivers/net/slip.c	sl->dev->rmem_start  = (unsigned long) p;
p	702	drivers/net/slip.c	p = (unsigned char *) kmalloc(l + 4, GFP_KERNEL);
p	703	drivers/net/slip.c	if (p == NULL) {
p	708	drivers/net/slip.c	sl->cbuff    = p;
p	760	drivers/net/slip.c	unsigned char *p;
p	780	drivers/net/slip.c	p = buff;
p	783	drivers/net/slip.c	c = *p++;
p	1252	drivers/scsi/NCR5380.c	register unsigned char p = *phase, tmp;
p	1263	drivers/scsi/NCR5380.c	NCR5380_write(TARGET_COMMAND_REG, PHASE_SR_TO_TCR(p));
p	1277	drivers/scsi/NCR5380.c	if ((tmp & PHASE_MASK) != p) {
p	1286	drivers/scsi/NCR5380.c	if (!(p & SR_IO))
p	1300	drivers/scsi/NCR5380.c	if (!(p & SR_IO)) {
p	1301	drivers/scsi/NCR5380.c	if (!((p & SR_MSG) && c > 1)) {
p	1331	drivers/scsi/NCR5380.c	if (!(p == PHASE_MSGOUT && c > 1))
p	1349	drivers/scsi/NCR5380.c	if (!c || (*phase == p))
p	1380	drivers/scsi/NCR5380.c	register unsigned char p = *phase;
p	1388	drivers/scsi/NCR5380.c	if (p & SR_IO)
p	1395	drivers/scsi/NCR5380.c	if ((tmp = (NCR5380_read(STATUS_REG) & PHASE_MASK)) != p) {
p	1400	drivers/scsi/NCR5380.c	NCR5380_write(TARGET_COMMAND_REG, PHASE_SR_TO_TCR(p));
p	1417	drivers/scsi/NCR5380.c	if (p & SR_IO)
p	1427	drivers/scsi/NCR5380.c	foo = ((p & SR_IO) ? NCR5380_pread(instance, d, c) :
p	90	drivers/scsi/aha1542.h	#define any2scsi(up, p)        \
p	91	drivers/scsi/aha1542.h	(up)[0] = (((unsigned long)(p)) >> 16)  ;  \
p	92	drivers/scsi/aha1542.h	(up)[1] = (((unsigned long)(p)) >> 8);    \
p	93	drivers/scsi/aha1542.h	(up)[2] = ((unsigned long)(p));
p	97	drivers/scsi/aha1542.h	#define xany2scsi(up, p)  \
p	98	drivers/scsi/aha1542.h	(up)[0] = ((long)(p)) >> 24;  \
p	99	drivers/scsi/aha1542.h	(up)[1] = ((long)(p)) >> 16;  \
p	100	drivers/scsi/aha1542.h	(up)[2] = ((long)(p)) >> 8;  \
p	101	drivers/scsi/aha1542.h	(up)[3] = ((long)(p));
p	89	drivers/scsi/aha1740.h	#define any2scsi(up, p)        \
p	90	drivers/scsi/aha1740.h	(up)[0] = (((unsigned long)(p)) >> 16)  ;  \
p	91	drivers/scsi/aha1740.h	(up)[1] = (((unsigned long)(p)) >> 8);    \
p	92	drivers/scsi/aha1740.h	(up)[2] = ((unsigned long)(p));
p	96	drivers/scsi/aha1740.h	#define xany2scsi(up, p)  \
p	97	drivers/scsi/aha1740.h	(up)[0] = ((long)(p)) >> 24;  \
p	98	drivers/scsi/aha1740.h	(up)[1] = ((long)(p)) >> 16;  \
p	99	drivers/scsi/aha1740.h	(up)[2] = ((long)(p)) >> 8;  \
p	100	drivers/scsi/aha1740.h	(up)[3] = ((long)(p));
p	454	drivers/scsi/scsi.h	struct task_struct * p;
p	486	drivers/scsi/scsi.h	if ((p = req->waiting) != NULL) {
p	488	drivers/scsi/scsi.h	p->state = TASK_RUNNING;
p	489	drivers/scsi/scsi.h	if (p->counter > current->counter)
p	140	drivers/scsi/scsi_debug.c	struct partition * p;
p	239	drivers/scsi/scsi_debug.c	p = (struct partition* ) (buff + 0x1be);
p	242	drivers/scsi/scsi_debug.c	p->start_sect = starts[npart];
p	243	drivers/scsi/scsi_debug.c	p->nr_sects = starts[npart+1] - starts [npart];
p	244	drivers/scsi/scsi_debug.c	p->sys_ind = 0x81;  /* Linux partition */
p	245	drivers/scsi/scsi_debug.c	p++;
p	76	drivers/scsi/scsi_ioctl.c	struct task_struct * p;
p	81	drivers/scsi/scsi_ioctl.c	if ((p = req->waiting) != NULL) {
p	83	drivers/scsi/scsi_ioctl.c	p->state = TASK_RUNNING;
p	84	drivers/scsi/scsi_ioctl.c	if (p->counter > current->counter)
p	651	drivers/scsi/sd.c	struct task_struct * p;
p	656	drivers/scsi/sd.c	if ((p = req->waiting) != NULL) {
p	658	drivers/scsi/sd.c	p->state = TASK_RUNNING;
p	659	drivers/scsi/sd.c	if (p->counter > current->counter)
p	629	drivers/scsi/sr.c	struct task_struct * p;
p	634	drivers/scsi/sr.c	if ((p = req->waiting) != NULL) {
p	636	drivers/scsi/sr.c	p->state = TASK_RUNNING;
p	637	drivers/scsi/sr.c	if (p->counter > current->counter)
p	24	drivers/scsi/sr_ioctl.c	struct task_struct * p;
p	29	drivers/scsi/sr_ioctl.c	if ((p = req->waiting) != NULL) {
p	31	drivers/scsi/sr_ioctl.c	p->state = TASK_RUNNING;
p	32	drivers/scsi/sr_ioctl.c	if (p->counter > current->counter)
p	841	drivers/scsi/ultrastor.c	unsigned char p = inb(port0 + i);
p	842	drivers/scsi/ultrastor.c	out[28 + i * 3] = "0123456789abcdef"[p >> 4];
p	843	drivers/scsi/ultrastor.c	out[29 + i * 3] = "0123456789abcdef"[p & 15];
p	107	drivers/scsi/wd7000.h	#define any2scsi(up, p)      \
p	108	drivers/scsi/wd7000.h	(up)[0] = (((long)(p)) >> 16);  \
p	109	drivers/scsi/wd7000.h	(up)[1] = ((long)(p)) >> 8;    \
p	110	drivers/scsi/wd7000.h	(up)[2] = ((long)(p));
p	114	drivers/scsi/wd7000.h	#define xany2scsi(up, p)  \
p	115	drivers/scsi/wd7000.h	(up)[0] = ((long)(p)) >> 24;  \
p	116	drivers/scsi/wd7000.h	(up)[1] = ((long)(p)) >> 16;  \
p	117	drivers/scsi/wd7000.h	(up)[2] = ((long)(p)) >> 8;  \
p	118	drivers/scsi/wd7000.h	(up)[3] = ((long)(p));
p	127	drivers/sound/audio.c	int             c, p, l;
p	133	drivers/sound/audio.c	p = 0;
p	169	drivers/sound/audio.c	COPY_FROM_USER (&wr_dma_buf[dev][wr_buff_ptr[dev]], buf, p, l);
p	173	drivers/sound/audio.c	wr_dma_buf[dev], wr_buff_ptr[dev], buf, p, l);
p	188	drivers/sound/audio.c	p += l;
p	207	drivers/sound/audio.c	int             c, p, l;
p	213	drivers/sound/audio.c	p = 0;
p	248	drivers/sound/audio.c	COPY_TO_USER (buf, p, dmabuf, l);
p	252	drivers/sound/audio.c	p += l;
p	106	drivers/sound/dmabuf.c	unsigned long   i, p, n;
p	157	drivers/sound/dmabuf.c	p = 0;
p	159	drivers/sound/dmabuf.c	while ((p + bsz) <= sound_buffsizes[dev])
p	161	drivers/sound/dmabuf.c	dev_buf[dev][n] = snd_raw_buf[dev][i] + p;
p	162	drivers/sound/dmabuf.c	dev_buf_phys[dev][n] = snd_raw_buf_phys[dev][i] + p;
p	163	drivers/sound/dmabuf.c	p += bsz;
p	382	drivers/sound/dmabuf.c	int             p = dev_counts[dev][dev_qhead[dev]] + c;
p	384	drivers/sound/dmabuf.c	if (p >= dev_buffsize[dev])
p	391	drivers/sound/dmabuf.c	dev_counts[dev][dev_qhead[dev]] = p;
p	262	drivers/sound/pas2_mixer.c	struct sb_mixer_params p;
p	267	drivers/sound/pas2_mixer.c	IOCTL_FROM_USER ((char *) &p, (char *) user_p, 0, sizeof (p));
p	269	drivers/sound/pas2_mixer.c	if (p.record_source != SRC_MIC
p	270	drivers/sound/pas2_mixer.c	&& p.record_source != SRC_CD
p	271	drivers/sound/pas2_mixer.c	&& p.record_source != SRC_LINE)
p	283	drivers/sound/pas2_mixer.c	if (!p.dsp_stereo)
p	289	drivers/sound/pas2_mixer.c	switch (p.record_source)
p	77	drivers/sound/sequencer.c	int             c = count, p = 0;
p	94	drivers/sound/sequencer.c	COPY_TO_USER (buf, p, &iqueue[iqhead][0], 4);
p	95	drivers/sound/sequencer.c	p += 4;
p	157	drivers/sound/sequencer.c	int             p = 0, c, ev_size;
p	175	drivers/sound/sequencer.c	COPY_FROM_USER (event, buf, p, 4);
p	189	drivers/sound/sequencer.c	err = synth_devs[dev]->load_patch (dev, *(short *) &event[0], buf, p + 4, c, 0);
p	208	drivers/sound/sequencer.c	COPY_FROM_USER (&event[4], buf, p + 4, 4);
p	251	drivers/sound/sequencer.c	p += ev_size;
p	180	fs/binfmt_elf.c	bprm->p = copy_strings(1,&passed_p,bprm->page,bprm->p,2);
p	183	fs/binfmt_elf.c	if (!bprm->p) {
p	204	fs/binfmt_elf.c	bprm->p += change_ldt(0, bprm->page);
p	205	fs/binfmt_elf.c	current->start_stack = bprm->p;
p	307	fs/binfmt_elf.c	current->start_stack = p = elf_stack - 4;
p	309	fs/binfmt_elf.c	bprm->p -= MAX_ARG_PAGES*PAGE_SIZE;
p	310	fs/binfmt_elf.c	bprm->p = (unsigned long) create_tables((char *)bprm->p,bprm->argc,bprm->envc);
p	316	fs/binfmt_elf.c	current->start_stack = bprm->p;
p	328	fs/binfmt_elf.c	regs->esp = bprm->p;      /* stack pointer */
p	27	fs/block_dev.c	register char * p;
p	61	fs/block_dev.c	p = offset + bh->b_data;
p	66	fs/block_dev.c	memcpy_fromfs(p,buf,chars);
p	67	fs/block_dev.c	p += chars;
p	747	fs/buffer.c	int * p;
p	753	fs/buffer.c	p = b;
p	755	fs/buffer.c	block = *(p++);
p	765	fs/buffer.c	p = b;
p	773	fs/buffer.c	bh->b_blocknr = *(p++);
p	914	fs/buffer.c	struct buffer_head * tmp, * p;
p	929	fs/buffer.c	p = tmp;
p	932	fs/buffer.c	if (p == *bhp)
p	933	fs/buffer.c	*bhp = p->b_prev_free;
p	934	fs/buffer.c	remove_from_queues(p);
p	935	fs/buffer.c	put_unused_buffer_head(p);
p	264	fs/exec.c	unsigned long * create_tables(char * p,int argc,int envc)
p	273	fs/exec.c	mpnt->vm_start = PAGE_MASK & (unsigned long) p;
p	283	fs/exec.c	sp = (unsigned long *) (0xfffffffc & (unsigned long) p);
p	291	fs/exec.c	current->arg_start = (unsigned long) p;
p	293	fs/exec.c	put_fs_long((unsigned long) p,argv++);
p	294	fs/exec.c	while (get_fs_byte(p++)) /* nothing */ ;
p	297	fs/exec.c	current->arg_end = current->env_start = (unsigned long) p;
p	299	fs/exec.c	put_fs_long((unsigned long) p,envp++);
p	300	fs/exec.c	while (get_fs_byte(p++)) /* nothing */ ;
p	303	fs/exec.c	current->env_end = (unsigned long) p;
p	340	fs/exec.c	unsigned long p, int from_kmem)
p	346	fs/exec.c	if (!p)
p	363	fs/exec.c	if (p < len) {  /* this shouldn't happen - 128kB */
p	368	fs/exec.c	--p; --tmp; --len;
p	370	fs/exec.c	offset = p % PAGE_SIZE;
p	373	fs/exec.c	if (!(pag = (char *) page[p/PAGE_SIZE]) &&
p	374	fs/exec.c	!(pag = (char *) page[p/PAGE_SIZE] =
p	386	fs/exec.c	return p;
p	544	fs/exec.c	bprm.p = PAGE_SIZE*MAX_ARG_PAGES-4;
p	638	fs/exec.c	bprm.p = copy_strings(bprm.envc, envp, bprm.page, bprm.p, 0);
p	639	fs/exec.c	bprm.p = copy_strings(--bprm.argc, argv+1, bprm.page, bprm.p, 0);
p	649	fs/exec.c	bprm.p = copy_strings(1, &bprm.filename, bprm.page, bprm.p, 2);
p	652	fs/exec.c	bprm.p = copy_strings(1, &i_arg, bprm.page, bprm.p, 2);
p	655	fs/exec.c	bprm.p = copy_strings(1, &i_name, bprm.page, bprm.p, 2);
p	657	fs/exec.c	if (!bprm.p) {
p	672	fs/exec.c	bprm.p = copy_strings(bprm.envc,envp,bprm.page,bprm.p,0);
p	673	fs/exec.c	bprm.p = copy_strings(bprm.argc,argv,bprm.page,bprm.p,0);
p	674	fs/exec.c	if (!bprm.p) {
p	749	fs/exec.c	unsigned long p = bprm->p;
p	829	fs/exec.c	p += change_ldt(ex.a_text,bprm->page);
p	830	fs/exec.c	p -= MAX_ARG_PAGES*PAGE_SIZE;
p	831	fs/exec.c	p = (unsigned long) create_tables((char *)p,bprm->argc,bprm->envc);
p	832	fs/exec.c	current->start_stack = p;
p	834	fs/exec.c	regs->esp = p;      /* stack pointer */
p	201	fs/ext/file.c	char * p;
p	240	fs/ext/file.c	p = (pos % BLOCK_SIZE) + bh->b_data;
p	247	fs/ext/file.c	memcpy_fromfs(p,buf,c);
p	224	fs/ext/inode.c	unsigned long * p;
p	227	fs/ext/inode.c	p = inode->u.ext_i.i_data + nr;
p	229	fs/ext/inode.c	tmp = *p;
p	232	fs/ext/inode.c	if (tmp == *p)
p	243	fs/ext/inode.c	if (*p) {
p	248	fs/ext/inode.c	*p = tmp;
p	258	fs/ext/inode.c	unsigned long * p;
p	271	fs/ext/inode.c	p = nr + (unsigned long *) bh->b_data;
p	273	fs/ext/inode.c	tmp = *p;
p	276	fs/ext/inode.c	if (tmp == *p) {
p	293	fs/ext/inode.c	if (*p) {
p	298	fs/ext/inode.c	*p = tmp;
p	36	fs/ext/truncate.c	unsigned long * p;
p	43	fs/ext/truncate.c	p = inode->u.ext_i.i_data+i;
p	44	fs/ext/truncate.c	if (!(tmp = *p))
p	51	fs/ext/truncate.c	if ((bh && bh->b_count != 1) || tmp != *p) {
p	56	fs/ext/truncate.c	*p = 0;
p	64	fs/ext/truncate.c	static int trunc_indirect(struct inode * inode, int offset, unsigned long * p)
p	73	fs/ext/truncate.c	tmp = *p;
p	77	fs/ext/truncate.c	if (tmp != *p) {
p	82	fs/ext/truncate.c	*p = 0;
p	118	fs/ext/truncate.c	tmp = *p;
p	119	fs/ext/truncate.c	*p = 0;
p	127	fs/ext/truncate.c	static int trunc_dindirect(struct inode * inode, int offset, unsigned long * p)
p	135	fs/ext/truncate.c	tmp = *p;
p	139	fs/ext/truncate.c	if (tmp != *p) {
p	144	fs/ext/truncate.c	*p = 0;
p	168	fs/ext/truncate.c	tmp = *p;
p	169	fs/ext/truncate.c	*p = 0;
p	181	fs/ext/truncate.c	unsigned long * tind, * p;
p	185	fs/ext/truncate.c	p = inode->u.ext_i.i_data+11;
p	186	fs/ext/truncate.c	if (!(tmp = *p))
p	189	fs/ext/truncate.c	if (tmp != *p) {
p	194	fs/ext/truncate.c	*p = 0;
p	215	fs/ext/truncate.c	tmp = *p;
p	216	fs/ext/truncate.c	*p = 0;
p	71	fs/ext2/balloc.c	unsigned long * p = ((unsigned long *) addr) + (offset >> 5);
p	82	fs/ext2/balloc.c	: "r" (~(*p >> bit)));
p	86	fs/ext2/balloc.c	p++;
p	89	fs/ext2/balloc.c	res = find_first_zero_bit (p, size - 32 * (p - addr));
p	306	fs/ext2/balloc.c	char *p, *r;
p	399	fs/ext2/balloc.c	p = ((char *) bh->b_data) + (j >> 3);
p	400	fs/ext2/balloc.c	r = find_first_zero_byte (p,
p	87	fs/ext2/dcache.c	struct dir_cache_entry * p;
p	89	fs/ext2/dcache.c	for (p = queue_head[queue]; p != NULL && (p->dev != dev ||
p	90	fs/ext2/dcache.c	p->dir != dir || p->len != len ||
p	91	fs/ext2/dcache.c	strncmp (name, p->name, p->len) != 0);
p	92	fs/ext2/dcache.c	p = p->queue_next)
p	94	fs/ext2/dcache.c	return p;
p	103	fs/ext2/dcache.c	struct dir_cache_entry * p;
p	106	fs/ext2/dcache.c	for (p = first; p != NULL; p = p->next)
p	108	fs/ext2/dcache.c	p->dev, p->dir, p->name);
p	115	fs/ext2/dcache.c	static void add_to_cache (struct dir_cache_entry * p)
p	117	fs/ext2/dcache.c	p->prev = NULL;
p	118	fs/ext2/dcache.c	p->next = first;
p	120	fs/ext2/dcache.c	first->prev = p;
p	122	fs/ext2/dcache.c	last = p;
p	123	fs/ext2/dcache.c	first = p;
p	129	fs/ext2/dcache.c	static void add_to_queue (int queue, struct dir_cache_entry * p)
p	131	fs/ext2/dcache.c	p->queue_prev = NULL;
p	132	fs/ext2/dcache.c	p->queue_next = queue_head[queue];
p	134	fs/ext2/dcache.c	queue_head[queue]->queue_prev = p;
p	136	fs/ext2/dcache.c	queue_tail[queue] = p;
p	137	fs/ext2/dcache.c	queue_head[queue] = p;
p	143	fs/ext2/dcache.c	static void remove_from_cache (struct dir_cache_entry * p)
p	145	fs/ext2/dcache.c	if (p->prev)
p	146	fs/ext2/dcache.c	p->prev->next = p->next;
p	148	fs/ext2/dcache.c	first = p->next;
p	149	fs/ext2/dcache.c	if (p->next)
p	150	fs/ext2/dcache.c	p->next->prev = p->prev;
p	152	fs/ext2/dcache.c	last = p->prev;
p	153	fs/ext2/dcache.c	p->prev = NULL;
p	154	fs/ext2/dcache.c	p->next = NULL;
p	160	fs/ext2/dcache.c	static void remove_from_queue (int queue, struct dir_cache_entry * p)
p	162	fs/ext2/dcache.c	if (p->queue_prev)
p	163	fs/ext2/dcache.c	p->queue_prev->queue_next = p->queue_next;
p	165	fs/ext2/dcache.c	queue_head[queue] = p->queue_next;
p	166	fs/ext2/dcache.c	if (p->queue_next)
p	167	fs/ext2/dcache.c	p->queue_next->queue_prev = p->queue_prev;
p	169	fs/ext2/dcache.c	queue_tail[queue] = p->queue_prev;
p	170	fs/ext2/dcache.c	p->queue_prev = NULL;
p	171	fs/ext2/dcache.c	p->queue_next = NULL;
p	180	fs/ext2/dcache.c	struct dir_cache_entry * p;
p	185	fs/ext2/dcache.c	for (p = first; p != NULL; p = p2) {
p	186	fs/ext2/dcache.c	p2 = p->next;
p	187	fs/ext2/dcache.c	if (p->dev == dev) {
p	188	fs/ext2/dcache.c	remove_from_cache (p);
p	189	fs/ext2/dcache.c	remove_from_queue (hash (p->dev, p->dir), p);
p	190	fs/ext2/dcache.c	p->next = first_free;
p	191	fs/ext2/dcache.c	first_free = p;
p	207	fs/ext2/dcache.c	struct dir_cache_entry * p;
p	219	fs/ext2/dcache.c	if ((p = find_name (queue, dev, dir, our_name, len))) {
p	220	fs/ext2/dcache.c	if (p != first) {
p	221	fs/ext2/dcache.c	remove_from_cache (p);
p	222	fs/ext2/dcache.c	add_to_cache (p);
p	224	fs/ext2/dcache.c	if (p != queue_head[queue]) {
p	225	fs/ext2/dcache.c	remove_from_queue (queue, p);
p	226	fs/ext2/dcache.c	add_to_queue (queue, p);
p	231	fs/ext2/dcache.c	our_name, p->ino, hits, misses);
p	234	fs/ext2/dcache.c	return p->ino;
p	255	fs/ext2/dcache.c	struct dir_cache_entry * p;
p	267	fs/ext2/dcache.c	if ((p = find_name (queue, dev, dir, name, len))) {
p	268	fs/ext2/dcache.c	p->dir = dir;
p	269	fs/ext2/dcache.c	p->ino = ino;
p	270	fs/ext2/dcache.c	if (p != first) {
p	271	fs/ext2/dcache.c	remove_from_cache (p);
p	272	fs/ext2/dcache.c	add_to_cache (p);
p	274	fs/ext2/dcache.c	if (p != queue_head[queue]) {
p	275	fs/ext2/dcache.c	remove_from_queue (queue, p);
p	276	fs/ext2/dcache.c	add_to_queue (queue, p);
p	280	fs/ext2/dcache.c	p = first_free;
p	281	fs/ext2/dcache.c	first_free = p->next;
p	286	fs/ext2/dcache.c	p = last;
p	287	fs/ext2/dcache.c	last = p->prev;
p	290	fs/ext2/dcache.c	remove_from_queue (hash (p->dev, p->dir), p);
p	293	fs/ext2/dcache.c	p->dev = dev;
p	294	fs/ext2/dcache.c	p->dir = dir;
p	295	fs/ext2/dcache.c	p->ino = ino;
p	296	fs/ext2/dcache.c	strncpy (p->name, name, len);
p	297	fs/ext2/dcache.c	p->len = len;
p	298	fs/ext2/dcache.c	p->name[len] = '\0';
p	299	fs/ext2/dcache.c	add_to_cache (p);
p	300	fs/ext2/dcache.c	add_to_queue (queue, p);
p	315	fs/ext2/dcache.c	struct dir_cache_entry * p;
p	326	fs/ext2/dcache.c	if ((p = find_name (queue, dev, dir, name, len))) {
p	327	fs/ext2/dcache.c	remove_from_cache (p);
p	328	fs/ext2/dcache.c	remove_from_queue (queue, p);
p	329	fs/ext2/dcache.c	p->next = first_free;
p	330	fs/ext2/dcache.c	first_free = p;
p	211	fs/ext2/file.c	char * p;
p	254	fs/ext2/file.c	p = (pos % sb->s_blocksize) + bh->b_data;
p	261	fs/ext2/file.c	memcpy_fromfs (p, buf, c);
p	110	fs/ext2/inode.c	unsigned long * p;
p	114	fs/ext2/inode.c	p = inode->u.ext2_i.i_data + nr;
p	116	fs/ext2/inode.c	tmp = *p;
p	119	fs/ext2/inode.c	if (tmp == *p)
p	154	fs/ext2/inode.c	if (*p) {
p	159	fs/ext2/inode.c	*p = tmp;
p	177	fs/ext2/inode.c	unsigned long * p;
p	191	fs/ext2/inode.c	p = (unsigned long *) bh->b_data + nr;
p	193	fs/ext2/inode.c	tmp = *p;
p	196	fs/ext2/inode.c	if (tmp == *p) {
p	228	fs/ext2/inode.c	if (*p) {
p	233	fs/ext2/inode.c	*p = tmp;
p	45	fs/ext2/truncate.c	unsigned long * p;
p	55	fs/ext2/truncate.c	p = inode->u.ext2_i.i_data + i;
p	56	fs/ext2/truncate.c	tmp = *p;
p	69	fs/ext2/truncate.c	if ((bh && bh->b_count != 1) || tmp != *p) {
p	74	fs/ext2/truncate.c	*p = 0;
p	88	fs/ext2/truncate.c	static int trunc_indirect (struct inode * inode, int offset, unsigned long * p)
p	100	fs/ext2/truncate.c	tmp = *p;
p	104	fs/ext2/truncate.c	if (tmp != *p) {
p	109	fs/ext2/truncate.c	*p = 0;
p	157	fs/ext2/truncate.c	tmp = *p;
p	158	fs/ext2/truncate.c	*p = 0;
p	172	fs/ext2/truncate.c	unsigned long * p)
p	183	fs/ext2/truncate.c	tmp = *p;
p	187	fs/ext2/truncate.c	if (tmp != *p) {
p	192	fs/ext2/truncate.c	*p = 0;
p	217	fs/ext2/truncate.c	tmp = *p;
p	218	fs/ext2/truncate.c	*p = 0;
p	235	fs/ext2/truncate.c	unsigned long * tind, * p;
p	244	fs/ext2/truncate.c	p = inode->u.ext2_i.i_data + EXT2_TIND_BLOCK;
p	245	fs/ext2/truncate.c	if (!(tmp = *p))
p	248	fs/ext2/truncate.c	if (tmp != *p) {
p	253	fs/ext2/truncate.c	*p = 0;
p	276	fs/ext2/truncate.c	tmp = *p;
p	277	fs/ext2/truncate.c	*p = 0;
p	252	fs/hpfs/hpfs_fs.c	static unsigned choose_conv(unsigned char *p, unsigned len);
p	530	fs/hpfs/hpfs_fs.c	unsigned char *p = addr;
p	531	fs/hpfs/hpfs_fs.c	return p[0] == 0 && memcmp(p, p + 1, len - 1) == 0;
p	541	fs/hpfs/hpfs_fs.c	char *p, *rhs;
p	552	fs/hpfs/hpfs_fs.c	for (p = strtok(opts, ","); p != 0; p = strtok(0, ",")) {
p	553	fs/hpfs/hpfs_fs.c	if ((rhs = strchr(p, '=')) != 0)
p	555	fs/hpfs/hpfs_fs.c	if (!strcmp(p, "uid")) {
p	562	fs/hpfs/hpfs_fs.c	else if (!strcmp(p, "gid")) {
p	569	fs/hpfs/hpfs_fs.c	else if (!strcmp(p, "umask")) {
p	576	fs/hpfs/hpfs_fs.c	else if (!strcmp(p, "case")) {
p	584	fs/hpfs/hpfs_fs.c	else if (!strcmp(p, "conv")) {
p	943	fs/hpfs/hpfs_fs.c	static unsigned choose_conv(unsigned char *p, unsigned len)
p	951	fs/hpfs/hpfs_fs.c	c = *p++;
p	953	fs/hpfs/hpfs_fs.c	if (c == '\r' && len && *p == '\n')
p	275	fs/isofs/rock.c	{ int p;
p	276	fs/isofs/rock.c	for(p=0;p<rr->u.ER.len_id;p++) printk("%c",rr->u.ER.data[p]);
p	14	fs/isofs/util.c	isonum_711 (char * p)
p	16	fs/isofs/util.c	return (*p & 0xff);
p	20	fs/isofs/util.c	isonum_712 (char * p)
p	24	fs/isofs/util.c	val = *p;
p	31	fs/isofs/util.c	isonum_721 (char * p)
p	33	fs/isofs/util.c	return ((p[0] & 0xff) | ((p[1] & 0xff) << 8));
p	37	fs/isofs/util.c	isonum_722 (char * p)
p	39	fs/isofs/util.c	return (((p[0] & 0xff) << 8) | (p[1] & 0xff));
p	43	fs/isofs/util.c	isonum_723 (char * p)
p	46	fs/isofs/util.c	if (p[0] != p[3] || p[1] != p[2]) {
p	51	fs/isofs/util.c	return (isonum_721 (p));
p	55	fs/isofs/util.c	isonum_731 (char * p)
p	57	fs/isofs/util.c	return ((p[0] & 0xff)
p	58	fs/isofs/util.c	| ((p[1] & 0xff) << 8)
p	59	fs/isofs/util.c	| ((p[2] & 0xff) << 16)
p	60	fs/isofs/util.c	| ((p[3] & 0xff) << 24));
p	64	fs/isofs/util.c	isonum_732 (char * p)
p	66	fs/isofs/util.c	return (((p[0] & 0xff) << 24)
p	67	fs/isofs/util.c	| ((p[1] & 0xff) << 16)
p	68	fs/isofs/util.c	| ((p[2] & 0xff) << 8)
p	69	fs/isofs/util.c	| (p[3] & 0xff));
p	73	fs/isofs/util.c	isonum_733 (char * p)
p	79	fs/isofs/util.c	if (p[i] != p[7-i]) {
p	85	fs/isofs/util.c	return (isonum_731 (p));
p	92	fs/isofs/util.c	int iso_date(char * p, int flag)
p	97	fs/isofs/util.c	year = p[0] - 70;
p	98	fs/isofs/util.c	month = p[1];
p	99	fs/isofs/util.c	day = p[2];
p	100	fs/isofs/util.c	hour = p[3];
p	101	fs/isofs/util.c	minute = p[4];
p	102	fs/isofs/util.c	second = p[5];
p	103	fs/isofs/util.c	if (flag == 0) tz = p[6]; /* High sierra has no time zone */
p	193	fs/minix/file.c	char * p;
p	232	fs/minix/file.c	p = (pos % BLOCK_SIZE) + bh->b_data;
p	239	fs/minix/file.c	memcpy_fromfs(p,buf,c);
p	200	fs/minix/inode.c	unsigned short *p;
p	203	fs/minix/inode.c	p = inode->u.minix_i.i_data + nr;
p	205	fs/minix/inode.c	tmp = *p;
p	208	fs/minix/inode.c	if (tmp == *p)
p	219	fs/minix/inode.c	if (*p) {
p	224	fs/minix/inode.c	*p = tmp;
p	234	fs/minix/inode.c	unsigned short *p;
p	247	fs/minix/inode.c	p = nr + (unsigned short *) bh->b_data;
p	249	fs/minix/inode.c	tmp = *p;
p	252	fs/minix/inode.c	if (tmp == *p) {
p	269	fs/minix/inode.c	if (*p) {
p	274	fs/minix/inode.c	*p = tmp;
p	29	fs/minix/truncate.c	unsigned short * p;
p	37	fs/minix/truncate.c	p = i + inode->u.minix_i.i_data;
p	38	fs/minix/truncate.c	if (!(tmp = *p))
p	45	fs/minix/truncate.c	if ((bh && bh->b_count != 1) || tmp != *p) {
p	50	fs/minix/truncate.c	*p = 0;
p	58	fs/minix/truncate.c	static int trunc_indirect(struct inode * inode, int offset, unsigned short * p)
p	67	fs/minix/truncate.c	tmp = *p;
p	71	fs/minix/truncate.c	if (tmp != *p) {
p	76	fs/minix/truncate.c	*p = 0;
p	112	fs/minix/truncate.c	tmp = *p;
p	113	fs/minix/truncate.c	*p = 0;
p	124	fs/minix/truncate.c	unsigned short * dind, * p;
p	128	fs/minix/truncate.c	p = 8 + inode->u.minix_i.i_data;
p	129	fs/minix/truncate.c	if (!(tmp = *p))
p	132	fs/minix/truncate.c	if (tmp != *p) {
p	137	fs/minix/truncate.c	*p = 0;
p	158	fs/minix/truncate.c	tmp = *p;
p	159	fs/minix/truncate.c	*p = 0;
p	280	fs/namei.c	struct task_struct ** p;
p	360	fs/namei.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	362	fs/namei.c	if (!*p)
p	364	fs/namei.c	if (inode == (*p)->executable) {
p	368	fs/namei.c	for(mpnt = (*p)->mmap; mpnt; mpnt = mpnt->vm_next) {
p	39	fs/nfs/proc.c	p=nfs_rpc_header(p0,code)
p	41	fs/nfs/proc.c	static int *nfs_rpc_header(int *p, int procedure);
p	42	fs/nfs/proc.c	static int *nfs_rpc_verify(int *p);
p	50	fs/nfs/proc.c	static inline int *xdr_encode_fhandle(int *p, struct nfs_fh *fhandle)
p	52	fs/nfs/proc.c	*((struct nfs_fh *) p) = *fhandle;
p	53	fs/nfs/proc.c	p += (sizeof (*fhandle) + 3) >> 2;
p	54	fs/nfs/proc.c	return p;
p	57	fs/nfs/proc.c	static inline int *xdr_decode_fhandle(int *p, struct nfs_fh *fhandle)
p	59	fs/nfs/proc.c	*fhandle = *((struct nfs_fh *) p);
p	60	fs/nfs/proc.c	p += (sizeof (*fhandle) + 3) >> 2;
p	61	fs/nfs/proc.c	return p;
p	64	fs/nfs/proc.c	static inline int *xdr_encode_string(int *p, const char *string)
p	70	fs/nfs/proc.c	*p++ = htonl(len);
p	71	fs/nfs/proc.c	memcpy((char *) p, string, len);
p	72	fs/nfs/proc.c	memset(((char *) p) + len, '\0', (quadlen << 2) - len);
p	73	fs/nfs/proc.c	p += quadlen;
p	74	fs/nfs/proc.c	return p;
p	77	fs/nfs/proc.c	static inline int *xdr_decode_string(int *p, char *string, int maxlen)
p	81	fs/nfs/proc.c	len = ntohl(*p++);
p	84	fs/nfs/proc.c	memcpy(string, (char *) p, len);
p	86	fs/nfs/proc.c	p += (len + 3) >> 2;
p	87	fs/nfs/proc.c	return p;
p	90	fs/nfs/proc.c	static inline int *xdr_encode_data(int *p, char *data, int len)
p	95	fs/nfs/proc.c	*p++ = htonl(len);
p	96	fs/nfs/proc.c	memcpy((char *) p, data, len);
p	97	fs/nfs/proc.c	memset(((char *) p) + len, '\0', (quadlen << 2) - len);
p	98	fs/nfs/proc.c	p += quadlen;
p	99	fs/nfs/proc.c	return p;
p	102	fs/nfs/proc.c	static inline int *xdr_decode_data(int *p, char *data, int *lenp, int maxlen)
p	106	fs/nfs/proc.c	len = *lenp = ntohl(*p++);
p	109	fs/nfs/proc.c	memcpy(data, (char *) p, len);
p	110	fs/nfs/proc.c	p += (len + 3) >> 2;
p	111	fs/nfs/proc.c	return p;
p	114	fs/nfs/proc.c	static int *xdr_decode_fattr(int *p, struct nfs_fattr *fattr)
p	116	fs/nfs/proc.c	fattr->type = (enum nfs_stat) ntohl(*p++);
p	117	fs/nfs/proc.c	fattr->mode = ntohl(*p++);
p	118	fs/nfs/proc.c	fattr->nlink = ntohl(*p++);
p	119	fs/nfs/proc.c	fattr->uid = ntohl(*p++);
p	120	fs/nfs/proc.c	fattr->gid = ntohl(*p++);
p	121	fs/nfs/proc.c	fattr->size = ntohl(*p++);
p	122	fs/nfs/proc.c	fattr->blocksize = ntohl(*p++);
p	123	fs/nfs/proc.c	fattr->rdev = ntohl(*p++);
p	124	fs/nfs/proc.c	fattr->blocks = ntohl(*p++);
p	125	fs/nfs/proc.c	fattr->fsid = ntohl(*p++);
p	126	fs/nfs/proc.c	fattr->fileid = ntohl(*p++);
p	127	fs/nfs/proc.c	fattr->atime.seconds = ntohl(*p++);
p	128	fs/nfs/proc.c	fattr->atime.useconds = ntohl(*p++);
p	129	fs/nfs/proc.c	fattr->mtime.seconds = ntohl(*p++);
p	130	fs/nfs/proc.c	fattr->mtime.useconds = ntohl(*p++);
p	131	fs/nfs/proc.c	fattr->ctime.seconds = ntohl(*p++);
p	132	fs/nfs/proc.c	fattr->ctime.useconds = ntohl(*p++);
p	133	fs/nfs/proc.c	return p;
p	136	fs/nfs/proc.c	static int *xdr_encode_sattr(int *p, struct nfs_sattr *sattr)
p	138	fs/nfs/proc.c	*p++ = htonl(sattr->mode);
p	139	fs/nfs/proc.c	*p++ = htonl(sattr->uid);
p	140	fs/nfs/proc.c	*p++ = htonl(sattr->gid);
p	141	fs/nfs/proc.c	*p++ = htonl(sattr->size);
p	142	fs/nfs/proc.c	*p++ = htonl(sattr->atime.seconds);
p	143	fs/nfs/proc.c	*p++ = htonl(sattr->atime.useconds);
p	144	fs/nfs/proc.c	*p++ = htonl(sattr->mtime.seconds);
p	145	fs/nfs/proc.c	*p++ = htonl(sattr->mtime.useconds);
p	146	fs/nfs/proc.c	return p;
p	149	fs/nfs/proc.c	static int *xdr_decode_entry(int *p, struct nfs_entry *entry)
p	151	fs/nfs/proc.c	entry->fileid = ntohl(*p++);
p	152	fs/nfs/proc.c	if (!(p = xdr_decode_string(p, entry->name, NFS_MAXNAMLEN)))
p	154	fs/nfs/proc.c	entry->cookie = ntohl(*p++);
p	156	fs/nfs/proc.c	return p;
p	159	fs/nfs/proc.c	static int *xdr_decode_fsinfo(int *p, struct nfs_fsinfo *res)
p	161	fs/nfs/proc.c	res->tsize = ntohl(*p++);
p	162	fs/nfs/proc.c	res->bsize = ntohl(*p++);
p	163	fs/nfs/proc.c	res->blocks = ntohl(*p++);
p	164	fs/nfs/proc.c	res->bfree = ntohl(*p++);
p	165	fs/nfs/proc.c	res->bavail = ntohl(*p++);
p	166	fs/nfs/proc.c	return p;
p	172	fs/nfs/proc.c	int *p, *p0;
p	177	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	178	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	182	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	184	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	185	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	197	fs/nfs/proc.c	int *p, *p0;
p	202	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	203	fs/nfs/proc.c	p = xdr_encode_sattr(p, sattr);
p	204	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	208	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	210	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	211	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	223	fs/nfs/proc.c	int *p, *p0;
p	232	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	233	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	234	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	238	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	240	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	241	fs/nfs/proc.c	p = xdr_decode_fhandle(p, fhandle);
p	242	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	254	fs/nfs/proc.c	int *p, *p0;
p	259	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	260	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	264	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	266	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	267	fs/nfs/proc.c	if (!(p = xdr_decode_string(p, res, NFS_MAXPATHLEN))) {
p	283	fs/nfs/proc.c	int *p, *p0;
p	289	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	290	fs/nfs/proc.c	*p++ = htonl(offset);
p	291	fs/nfs/proc.c	*p++ = htonl(count);
p	292	fs/nfs/proc.c	*p++ = htonl(count); /* traditional, could be any value */
p	293	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	297	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	299	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	300	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	301	fs/nfs/proc.c	if (!(p = xdr_decode_data(p, data, &len, count))) {
p	317	fs/nfs/proc.c	int *p, *p0;
p	322	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	323	fs/nfs/proc.c	*p++ = htonl(offset); /* traditional, could be any value */
p	324	fs/nfs/proc.c	*p++ = htonl(offset);
p	325	fs/nfs/proc.c	*p++ = htonl(count); /* traditional, could be any value */
p	326	fs/nfs/proc.c	p = xdr_encode_data(p, data, count);
p	327	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	331	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	333	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	334	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	347	fs/nfs/proc.c	int *p, *p0;
p	352	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	353	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	354	fs/nfs/proc.c	p = xdr_encode_sattr(p, sattr);
p	355	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	359	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	361	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	362	fs/nfs/proc.c	p = xdr_decode_fhandle(p, fhandle);
p	363	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	374	fs/nfs/proc.c	int *p, *p0;
p	379	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	380	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	381	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	385	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	387	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	400	fs/nfs/proc.c	int *p, *p0;
p	405	fs/nfs/proc.c	p = xdr_encode_fhandle(p, old_dir);
p	406	fs/nfs/proc.c	p = xdr_encode_string(p, old_name);
p	407	fs/nfs/proc.c	p = xdr_encode_fhandle(p, new_dir);
p	408	fs/nfs/proc.c	p = xdr_encode_string(p, new_name);
p	409	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	413	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	415	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	427	fs/nfs/proc.c	int *p, *p0;
p	432	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	433	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	434	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	435	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	439	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	441	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	453	fs/nfs/proc.c	int *p, *p0;
p	458	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	459	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	460	fs/nfs/proc.c	p = xdr_encode_string(p, path);
p	461	fs/nfs/proc.c	p = xdr_encode_sattr(p, sattr);
p	462	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	466	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	468	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	481	fs/nfs/proc.c	int *p, *p0;
p	486	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	487	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	488	fs/nfs/proc.c	p = xdr_encode_sattr(p, sattr);
p	489	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	493	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	495	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	496	fs/nfs/proc.c	p = xdr_decode_fhandle(p, fhandle);
p	497	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	508	fs/nfs/proc.c	int *p, *p0;
p	513	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	514	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	515	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	519	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	521	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	533	fs/nfs/proc.c	int *p, *p0;
p	542	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	543	fs/nfs/proc.c	*p++ = htonl(cookie);
p	544	fs/nfs/proc.c	*p++ = htonl(size);
p	545	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	549	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	551	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	552	fs/nfs/proc.c	for (i = 0; i < count && *p++; i++) {
p	553	fs/nfs/proc.c	if (!(p = xdr_decode_entry(p, entry++)))
p	556	fs/nfs/proc.c	if (!p) {
p	561	fs/nfs/proc.c	eof = (i == count && !*p++ && *p++)
p	562	fs/nfs/proc.c	|| (i < count && *p++);
p	578	fs/nfs/proc.c	int *p, *p0;
p	583	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	584	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	588	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	590	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	591	fs/nfs/proc.c	p = xdr_decode_fsinfo(p, res);
p	604	fs/nfs/proc.c	static int *nfs_rpc_header(int *p, int procedure)
p	615	fs/nfs/proc.c	*p++ = htonl(++xid);
p	616	fs/nfs/proc.c	*p++ = htonl(RPC_CALL);
p	617	fs/nfs/proc.c	*p++ = htonl(RPC_VERSION);
p	618	fs/nfs/proc.c	*p++ = htonl(NFS_PROGRAM);
p	619	fs/nfs/proc.c	*p++ = htonl(NFS_VERSION);
p	620	fs/nfs/proc.c	*p++ = htonl(procedure);
p	621	fs/nfs/proc.c	*p++ = htonl(RPC_AUTH_UNIX);
p	622	fs/nfs/proc.c	p1 = p++;
p	623	fs/nfs/proc.c	*p++ = htonl(CURRENT_TIME); /* traditional, could be anything */
p	624	fs/nfs/proc.c	p = xdr_encode_string(p, (char *) sys);
p	625	fs/nfs/proc.c	*p++ = htonl(current->euid);
p	626	fs/nfs/proc.c	*p++ = htonl(current->egid);
p	627	fs/nfs/proc.c	p2 = p++;
p	629	fs/nfs/proc.c	*p++ = htonl(current->groups[i]);
p	631	fs/nfs/proc.c	*p1 = htonl((p - (p1 + 1)) << 2);
p	632	fs/nfs/proc.c	*p++ = htonl(RPC_AUTH_NULL);
p	633	fs/nfs/proc.c	*p++ = htonl(0);
p	634	fs/nfs/proc.c	return p;
p	637	fs/nfs/proc.c	static int *nfs_rpc_verify(int *p)
p	641	fs/nfs/proc.c	p++;
p	642	fs/nfs/proc.c	if ((n = ntohl(*p++)) != RPC_REPLY) {
p	646	fs/nfs/proc.c	if ((n = ntohl(*p++)) != RPC_MSG_ACCEPTED) {
p	650	fs/nfs/proc.c	switch (n = ntohl(*p++)) {
p	657	fs/nfs/proc.c	if ((n = ntohl(*p++)) > 400) {
p	661	fs/nfs/proc.c	p += (n + 3) >> 2;
p	662	fs/nfs/proc.c	if ((n = ntohl(*p++)) != RPC_SUCCESS) {
p	666	fs/nfs/proc.c	return p;
p	32	fs/proc/array.c	unsigned long p = file->f_pos;
p	44	fs/proc/array.c	if (p >= high_memory)
p	46	fs/proc/array.c	if (count > high_memory - p)
p	47	fs/proc/array.c	count = high_memory - p;
p	50	fs/proc/array.c	if (p < sizeof(struct user) && count > 0) {
p	52	fs/proc/array.c	if (p + count1 > sizeof(struct user))
p	53	fs/proc/array.c	count1 = sizeof(struct user)-p;
p	54	fs/proc/array.c	pnt = (char *) &dump + p;
p	57	fs/proc/array.c	p += count1;
p	62	fs/proc/array.c	while (p < 2*PAGE_SIZE && count > 0) {
p	65	fs/proc/array.c	p++;
p	69	fs/proc/array.c	memcpy_tofs(buf,(void *) (p - PAGE_SIZE),count);
p	125	fs/proc/array.c	struct task_struct ** p;
p	127	fs/proc/array.c	p = task;
p	128	fs/proc/array.c	while (++p < task+NR_TASKS) {
p	129	fs/proc/array.c	if (*p && (*p)->pid == pid)
p	130	fs/proc/array.c	return p;
p	135	fs/proc/array.c	static unsigned long get_phys_addr(struct task_struct ** p, unsigned long ptr)
p	139	fs/proc/array.c	if (!p || !*p || ptr >= TASK_SIZE)
p	141	fs/proc/array.c	page = *PAGE_DIR_OFFSET((*p)->tss.cr3,ptr);
p	154	fs/proc/array.c	static int get_array(struct task_struct ** p, unsigned long start, unsigned long end, char * buffer)
p	163	fs/proc/array.c	addr = get_phys_addr(p, start);
p	184	fs/proc/array.c	struct task_struct ** p = get_task(pid);
p	186	fs/proc/array.c	if (!p || !*p)
p	188	fs/proc/array.c	return get_array(p, (*p)->env_start, (*p)->env_end, buffer);
p	193	fs/proc/array.c	struct task_struct ** p = get_task(pid);
p	195	fs/proc/array.c	if (!p || !*p)
p	197	fs/proc/array.c	return get_array(p, (*p)->arg_start, (*p)->arg_end, buffer);
p	200	fs/proc/array.c	static unsigned long get_wchan(struct task_struct *p)
p	206	fs/proc/array.c	if (!p || p == current || p->state == TASK_RUNNING)
p	208	fs/proc/array.c	stack_page = p->kernel_stack_page;
p	211	fs/proc/array.c	ebp = p->tss.ebp;
p	229	fs/proc/array.c	struct task_struct ** p = get_task(pid);
p	235	fs/proc/array.c	if (!p || !*p)
p	237	fs/proc/array.c	if ((*p)->state < 0 || (*p)->state > 5)
p	240	fs/proc/array.c	state = "RSDZTD"[(*p)->state];
p	242	fs/proc/array.c	vsize = (*p)->kernel_stack_page;
p	246	fs/proc/array.c	vsize = (*p)->brk - (*p)->start_code + PAGE_SIZE-1;
p	250	fs/proc/array.c	wchan = get_wchan(*p);
p	252	fs/proc/array.c	switch((int) (*p)->sigaction[i].sa_handler) {
p	258	fs/proc/array.c	tty_pgrp = (*p)->tty;
p	267	fs/proc/array.c	(*p)->comm,
p	269	fs/proc/array.c	(*p)->p_pptr->pid,
p	270	fs/proc/array.c	(*p)->pgrp,
p	271	fs/proc/array.c	(*p)->session,
p	272	fs/proc/array.c	(*p)->tty,
p	274	fs/proc/array.c	(*p)->flags,
p	275	fs/proc/array.c	(*p)->min_flt,
p	276	fs/proc/array.c	(*p)->cmin_flt,
p	277	fs/proc/array.c	(*p)->maj_flt,
p	278	fs/proc/array.c	(*p)->cmaj_flt,
p	279	fs/proc/array.c	(*p)->utime,
p	280	fs/proc/array.c	(*p)->stime,
p	281	fs/proc/array.c	(*p)->cutime,
p	282	fs/proc/array.c	(*p)->cstime,
p	283	fs/proc/array.c	(*p)->counter,  /* this is the kernel priority ---
p	285	fs/proc/array.c	(*p)->priority, /* this is the nice value ---
p	287	fs/proc/array.c	(*p)->timeout,
p	288	fs/proc/array.c	(*p)->it_real_value,
p	289	fs/proc/array.c	(*p)->start_time,
p	291	fs/proc/array.c	(*p)->rss, /* you might want to shift this left 3 */
p	292	fs/proc/array.c	(*p)->rlim[RLIMIT_RSS].rlim_cur,
p	293	fs/proc/array.c	(*p)->start_code,
p	294	fs/proc/array.c	(*p)->end_code,
p	295	fs/proc/array.c	(*p)->start_stack,
p	298	fs/proc/array.c	(*p)->signal,
p	299	fs/proc/array.c	(*p)->blocked,
p	307	fs/proc/array.c	struct task_struct ** p = get_task(pid);
p	312	fs/proc/array.c	if (!p || !*p)
p	314	fs/proc/array.c	tpag = (*p)->end_code / PAGE_SIZE;
p	315	fs/proc/array.c	if ((*p)->state != TASK_ZOMBIE) {
p	316	fs/proc/array.c	pagedir = (unsigned long *) (*p)->tss.cr3;
p	355	fs/proc/array.c	struct task_struct **p = get_task(pid);
p	358	fs/proc/array.c	if (!p || !*p)
p	361	fs/proc/array.c	for(map = (*p)->mmap; map != NULL; map = map->vm_next) {
p	57	fs/proc/fd.c	struct task_struct * p;
p	103	fs/proc/fd.c	if ((p = task[i]) && p->pid == pid)
p	108	fs/proc/fd.c	if (fd >= NR_OPEN || !p->filp[fd] || !p->filp[fd]->f_inode)
p	114	fs/proc/fd.c	for (mpnt = p->mmap; mpnt; mpnt = mpnt->vm_next)
p	129	fs/proc/fd.c	struct task_struct * p;
p	159	fs/proc/fd.c	if ((p = task[i]) && p->pid == pid)
p	166	fs/proc/fd.c	if (!p->filp[fd] || !p->filp[fd]->f_inode)
p	171	fs/proc/fd.c	for (mpnt = p->mmap ; mpnt ; mpnt = mpnt->vm_next)
p	77	fs/proc/inode.c	struct task_struct * p;
p	90	fs/proc/inode.c	p = task[0];
p	92	fs/proc/inode.c	if ((p = task[i]) && (p->pid == pid))
p	94	fs/proc/inode.c	if (!p || i >= NR_TASKS)
p	134	fs/proc/inode.c	inode->i_uid = p->euid;
p	135	fs/proc/inode.c	inode->i_gid = p->egid;
p	171	fs/proc/inode.c	if (ino >= NR_OPEN || !p->filp[ino])
p	182	fs/proc/inode.c	for (mpnt = p->mmap ; mpnt ; mpnt = mpnt->vm_next)
p	45	fs/proc/link.c	struct task_struct * p;
p	58	fs/proc/link.c	if ((p = task[i]) && p->pid == pid)
p	65	fs/proc/link.c	inode = p->pwd;
p	68	fs/proc/link.c	inode = p->root;
p	71	fs/proc/link.c	inode = p->executable;
p	77	fs/proc/link.c	if (ino < NR_OPEN && p->filp[ino])
p	78	fs/proc/link.c	inode = p->filp[ino]->f_inode;
p	84	fs/proc/link.c	for(mpnt = p->mmap; mpnt && j >= 0;
p	133	fs/proc/root.c	struct task_struct * p;
p	158	fs/proc/root.c	p = task[nr];
p	159	fs/proc/root.c	if (!p || !(pid = p->pid))
p	41	fs/select.c	static void free_wait(select_table * p)
p	43	fs/select.c	struct select_table_entry * entry = p->entry + p->nr;
p	45	fs/select.c	while (p->nr > 0) {
p	46	fs/select.c	p->nr--;
p	19	include/linux/binfmts.h	unsigned long p;
p	44	include/linux/binfmts.h	extern unsigned long * create_tables(char * p,int argc,int envc);
p	46	include/linux/binfmts.h	unsigned long p, int from_kmem);
p	300	include/linux/sched.h	extern void sleep_on(struct wait_queue ** p);
p	301	include/linux/sched.h	extern void interruptible_sleep_on(struct wait_queue ** p);
p	302	include/linux/sched.h	extern void wake_up(struct wait_queue ** p);
p	303	include/linux/sched.h	extern void wake_up_interruptible(struct wait_queue ** p);
p	306	include/linux/sched.h	extern int send_sig(unsigned long sig,struct task_struct * p,int priv);
p	393	include/linux/sched.h	extern inline void add_wait_queue(struct wait_queue ** p, struct wait_queue * wait)
p	407	include/linux/sched.h	if (!*p) {
p	409	include/linux/sched.h	*p = wait;
p	411	include/linux/sched.h	wait->next = (*p)->next;
p	412	include/linux/sched.h	(*p)->next = wait;
p	417	include/linux/sched.h	extern inline void remove_wait_queue(struct wait_queue ** p, struct wait_queue * wait)
p	427	include/linux/sched.h	if ((*p == wait) &&
p	431	include/linux/sched.h	((*p = wait->next) == wait)) {
p	432	include/linux/sched.h	*p = NULL;
p	438	include/linux/sched.h	if (tmp == *p)
p	449	include/linux/sched.h	printk("list = %08x, queue = %08x\n",(unsigned long) p, (unsigned long) wait);
p	456	include/linux/sched.h	extern inline void select_wait(struct wait_queue ** wait_address, select_table * p)
p	460	include/linux/sched.h	if (!p || !wait_address)
p	462	include/linux/sched.h	if (p->nr >= __MAX_SELECT_TABLE_ENTRIES)
p	464	include/linux/sched.h	entry = p->entry + p->nr;
p	469	include/linux/sched.h	p->nr++;
p	496	include/linux/sched.h	#define REMOVE_LINKS(p) do { unsigned long flags; \
p	498	include/linux/sched.h	(p)->next_task->prev_task = (p)->prev_task; \
p	499	include/linux/sched.h	(p)->prev_task->next_task = (p)->next_task; \
p	501	include/linux/sched.h	if ((p)->p_osptr) \
p	502	include/linux/sched.h	(p)->p_osptr->p_ysptr = (p)->p_ysptr; \
p	503	include/linux/sched.h	if ((p)->p_ysptr) \
p	504	include/linux/sched.h	(p)->p_ysptr->p_osptr = (p)->p_osptr; \
p	506	include/linux/sched.h	(p)->p_pptr->p_cptr = (p)->p_osptr; \
p	509	include/linux/sched.h	#define SET_LINKS(p) do { unsigned long flags; \
p	511	include/linux/sched.h	(p)->next_task = &init_task; \
p	512	include/linux/sched.h	(p)->prev_task = init_task.prev_task; \
p	513	include/linux/sched.h	init_task.prev_task->next_task = (p); \
p	514	include/linux/sched.h	init_task.prev_task = (p); \
p	516	include/linux/sched.h	(p)->p_ysptr = NULL; \
p	517	include/linux/sched.h	if (((p)->p_osptr = (p)->p_pptr->p_cptr) != NULL) \
p	518	include/linux/sched.h	(p)->p_osptr->p_ysptr = p; \
p	519	include/linux/sched.h	(p)->p_pptr->p_cptr = p; \
p	522	include/linux/sched.h	#define for_each_task(p) \
p	523	include/linux/sched.h	for (p = &init_task ; (p = p->next_task) != &init_task ; )
p	107	include/linux/ultrasound.h	#define GUS_VOICEFREQ(chn, voice, p)    _GUS_CMD(chn, voice, _GUS_VOICEFREQ, \
p	108	include/linux/ultrasound.h	(p) & 0xffff, ((p) >> 16) & 0xffff)
p	44	kernel/dma.c	static __inline__ unsigned int mutex_atomic_swap(volatile unsigned int * p, unsigned int newval)
p	57	kernel/dma.c	: /* inputs: newval, p */ "0" (semval), "m" (*p)
p	25	kernel/exit.c	static int generate(unsigned long sig, struct task_struct * p)
p	28	kernel/exit.c	struct sigaction * sa = sig + p->sigaction - 1;
p	31	kernel/exit.c	if (p->flags & PF_PTRACED) {
p	32	kernel/exit.c	p->signal |= mask;
p	42	kernel/exit.c	p->signal |= mask;
p	46	kernel/exit.c	int send_sig(unsigned long sig,struct task_struct * p,int priv)
p	48	kernel/exit.c	if (!p || sig > 32)
p	50	kernel/exit.c	if (!priv && ((sig != SIGCONT) || (current->session != p->session)) &&
p	51	kernel/exit.c	(current->euid != p->euid) && (current->uid != p->uid) && !suser())
p	56	kernel/exit.c	if (p->state == TASK_STOPPED)
p	57	kernel/exit.c	p->state = TASK_RUNNING;
p	58	kernel/exit.c	p->exit_code = 0;
p	59	kernel/exit.c	p->signal &= ~( (1<<(SIGSTOP-1)) | (1<<(SIGTSTP-1)) |
p	64	kernel/exit.c	p->signal &= ~(1<<(SIGCONT-1));
p	66	kernel/exit.c	generate(sig,p);
p	78	kernel/exit.c	void release(struct task_struct * p)
p	82	kernel/exit.c	if (!p)
p	84	kernel/exit.c	if (p == current) {
p	89	kernel/exit.c	if (task[i] == p) {
p	91	kernel/exit.c	REMOVE_LINKS(p);
p	92	kernel/exit.c	free_page(p->kernel_stack_page);
p	93	kernel/exit.c	free_page((long) p);
p	104	kernel/exit.c	int bad_task_ptr(struct task_struct *p)
p	108	kernel/exit.c	if (!p)
p	111	kernel/exit.c	if (task[i] == p)
p	199	kernel/exit.c	struct task_struct *p;
p	203	kernel/exit.c	for_each_task(p) {
p	204	kernel/exit.c	if (p->session <= 0)
p	206	kernel/exit.c	if (p->pgrp == pgrp)
p	207	kernel/exit.c	return p->session;
p	208	kernel/exit.c	if (p->pid == pgrp)
p	209	kernel/exit.c	fallback = p->session;
p	220	kernel/exit.c	struct task_struct *p;
p	226	kernel/exit.c	for_each_task(p) {
p	227	kernel/exit.c	if (p->pgrp == pgrp) {
p	228	kernel/exit.c	if ((err = send_sig(sig,p,priv)) != 0)
p	244	kernel/exit.c	struct task_struct *p;
p	250	kernel/exit.c	for_each_task(p) {
p	251	kernel/exit.c	if (p->session == sess && p->leader) {
p	252	kernel/exit.c	if ((err = send_sig(sig,p,priv)) != 0)
p	263	kernel/exit.c	struct task_struct *p;
p	267	kernel/exit.c	for_each_task(p) {
p	268	kernel/exit.c	if (p && p->pid == pid)
p	269	kernel/exit.c	return send_sig(sig,p,priv);
p	285	kernel/exit.c	struct task_struct * p;
p	286	kernel/exit.c	for_each_task(p) {
p	287	kernel/exit.c	if (p->pid > 1 && p != current) {
p	289	kernel/exit.c	if ((err = send_sig(sig,p,0)) != -EPERM)
p	311	kernel/exit.c	struct task_struct *p;
p	313	kernel/exit.c	for_each_task(p) {
p	314	kernel/exit.c	if ((p->pgrp != pgrp) ||
p	315	kernel/exit.c	(p->state == TASK_ZOMBIE) ||
p	316	kernel/exit.c	(p->p_pptr->pid == 1))
p	318	kernel/exit.c	if ((p->p_pptr->pgrp != pgrp) &&
p	319	kernel/exit.c	(p->p_pptr->session == p->session))
p	327	kernel/exit.c	struct task_struct * p;
p	329	kernel/exit.c	for_each_task(p) {
p	330	kernel/exit.c	if (p->pgrp != pgrp)
p	332	kernel/exit.c	if (p->state == TASK_STOPPED)
p	340	kernel/exit.c	struct task_struct * p;
p	342	kernel/exit.c	for_each_task(p) {
p	343	kernel/exit.c	if (p->p_opptr == father)
p	345	kernel/exit.c	p->p_opptr = task[1];
p	347	kernel/exit.c	p->p_opptr = task[0];
p	353	kernel/exit.c	struct task_struct *p;
p	428	kernel/exit.c	while ((p = current->p_cptr) != NULL) {
p	429	kernel/exit.c	current->p_cptr = p->p_osptr;
p	430	kernel/exit.c	p->p_ysptr = NULL;
p	431	kernel/exit.c	p->flags &= ~(PF_PTRACED|PF_TRACESYS);
p	433	kernel/exit.c	p->p_pptr = task[1];
p	435	kernel/exit.c	p->p_pptr = task[0];
p	436	kernel/exit.c	p->p_osptr = p->p_pptr->p_cptr;
p	437	kernel/exit.c	p->p_osptr->p_ysptr = p;
p	438	kernel/exit.c	p->p_pptr->p_cptr = p;
p	439	kernel/exit.c	if (p->state == TASK_ZOMBIE)
p	440	kernel/exit.c	notify_parent(p);
p	447	kernel/exit.c	if ((p->pgrp != current->pgrp) &&
p	448	kernel/exit.c	(p->session == current->session) &&
p	449	kernel/exit.c	is_orphaned_pgrp(p->pgrp) &&
p	450	kernel/exit.c	has_stopped_jobs(p->pgrp)) {
p	451	kernel/exit.c	kill_pg(p->pgrp,SIGHUP,1);
p	452	kernel/exit.c	kill_pg(p->pgrp,SIGCONT,1);
p	456	kernel/exit.c	struct task_struct *p;
p	468	kernel/exit.c	for_each_task(p) {
p	469	kernel/exit.c	if (p->session == current->session)
p	470	kernel/exit.c	p->tty = -1;
p	504	kernel/exit.c	struct task_struct *p;
p	514	kernel/exit.c	for (p = current->p_cptr ; p ; p = p->p_osptr) {
p	516	kernel/exit.c	if (p->pid != pid)
p	519	kernel/exit.c	if (p->pgrp != current->pgrp)
p	522	kernel/exit.c	if (p->pgrp != -pid)
p	526	kernel/exit.c	if ((p->exit_signal != SIGCHLD) ^ ((options & __WCLONE) != 0))
p	529	kernel/exit.c	switch (p->state) {
p	531	kernel/exit.c	if (!p->exit_code)
p	533	kernel/exit.c	if (!(options & WUNTRACED) && !(p->flags & PF_PTRACED))
p	536	kernel/exit.c	put_fs_long((p->exit_code << 8) | 0x7f,
p	538	kernel/exit.c	p->exit_code = 0;
p	540	kernel/exit.c	getrusage(p, RUSAGE_BOTH, ru);
p	541	kernel/exit.c	retval = p->pid;
p	544	kernel/exit.c	current->cutime += p->utime + p->cutime;
p	545	kernel/exit.c	current->cstime += p->stime + p->cstime;
p	546	kernel/exit.c	current->cmin_flt += p->min_flt + p->cmin_flt;
p	547	kernel/exit.c	current->cmaj_flt += p->maj_flt + p->cmaj_flt;
p	549	kernel/exit.c	getrusage(p, RUSAGE_BOTH, ru);
p	550	kernel/exit.c	flag = p->pid;
p	552	kernel/exit.c	put_fs_long(p->exit_code, stat_addr);
p	553	kernel/exit.c	if (p->p_opptr != p->p_pptr) {
p	554	kernel/exit.c	REMOVE_LINKS(p);
p	555	kernel/exit.c	p->p_pptr = p->p_opptr;
p	556	kernel/exit.c	SET_LINKS(p);
p	557	kernel/exit.c	notify_parent(p);
p	559	kernel/exit.c	release(p);
p	92	kernel/fork.c	struct vm_area_struct * mpnt, **p, *tmp;
p	96	kernel/fork.c	p = &tsk->mmap;
p	106	kernel/fork.c	*p = tmp;
p	107	kernel/fork.c	p = &tmp->vm_next;
p	115	kernel/fork.c	#define copy_vm(p) ((clone_flags & COPYVM)?copy_page_tables(p):clone_page_tables(p))
p	125	kernel/fork.c	struct task_struct *p;
p	130	kernel/fork.c	if(!(p = (struct task_struct*)__get_free_page(GFP_KERNEL)))
p	135	kernel/fork.c	task[nr] = p;
p	136	kernel/fork.c	*p = *current;
p	137	kernel/fork.c	p->kernel_stack_page = 0;
p	138	kernel/fork.c	p->state = TASK_UNINTERRUPTIBLE;
p	139	kernel/fork.c	p->flags &= ~(PF_PTRACED|PF_TRACESYS);
p	140	kernel/fork.c	p->pid = last_pid;
p	141	kernel/fork.c	p->swappable = 1;
p	142	kernel/fork.c	p->p_pptr = p->p_opptr = current;
p	143	kernel/fork.c	p->p_cptr = NULL;
p	144	kernel/fork.c	SET_LINKS(p);
p	145	kernel/fork.c	p->signal = 0;
p	146	kernel/fork.c	p->it_real_value = p->it_virt_value = p->it_prof_value = 0;
p	147	kernel/fork.c	p->it_real_incr = p->it_virt_incr = p->it_prof_incr = 0;
p	148	kernel/fork.c	p->leader = 0;    /* process leadership doesn't inherit */
p	149	kernel/fork.c	p->utime = p->stime = 0;
p	150	kernel/fork.c	p->cutime = p->cstime = 0;
p	151	kernel/fork.c	p->min_flt = p->maj_flt = 0;
p	152	kernel/fork.c	p->cmin_flt = p->cmaj_flt = 0;
p	153	kernel/fork.c	p->start_time = jiffies;
p	157	kernel/fork.c	if (!(p->kernel_stack_page = __get_free_page(GFP_KERNEL)))
p	159	kernel/fork.c	p->tss.es = KERNEL_DS;
p	160	kernel/fork.c	p->tss.cs = KERNEL_CS;
p	161	kernel/fork.c	p->tss.ss = KERNEL_DS;
p	162	kernel/fork.c	p->tss.ds = KERNEL_DS;
p	163	kernel/fork.c	p->tss.fs = USER_DS;
p	164	kernel/fork.c	p->tss.gs = KERNEL_DS;
p	165	kernel/fork.c	p->tss.ss0 = KERNEL_DS;
p	166	kernel/fork.c	p->tss.esp0 = p->kernel_stack_page + PAGE_SIZE;
p	167	kernel/fork.c	p->tss.tr = _TSS(nr);
p	168	kernel/fork.c	childregs = ((struct pt_regs *) (p->kernel_stack_page + PAGE_SIZE)) - 1;
p	169	kernel/fork.c	p->tss.esp = (unsigned long) childregs;
p	170	kernel/fork.c	p->tss.eip = (unsigned long) ret_from_sys_call;
p	173	kernel/fork.c	p->tss.back_link = 0;
p	174	kernel/fork.c	p->tss.eflags = regs.eflags & 0xffffcfff;  /* iopl is always 0 for a new process */
p	182	kernel/fork.c	p->exit_signal = clone_flags & CSIGNAL;
p	183	kernel/fork.c	p->tss.ldt = _LDT(nr);
p	184	kernel/fork.c	if (p->ldt) {
p	185	kernel/fork.c	if ((p->ldt = (struct desc_struct*) __get_free_page(GFP_KERNEL)) != NULL)
p	186	kernel/fork.c	memcpy(p->ldt, current->ldt, PAGE_SIZE);
p	188	kernel/fork.c	p->tss.bitmap = offsetof(struct tss_struct,io_bitmap);
p	190	kernel/fork.c	p->tss.io_bitmap[i] = ~0;
p	192	kernel/fork.c	__asm__("clts ; fnsave %0 ; frstor %0":"=m" (p->tss.i387));
p	193	kernel/fork.c	p->semun = NULL; p->shm = NULL;
p	194	kernel/fork.c	if (copy_vm(p) || shm_fork(current, p))
p	198	kernel/fork.c	if ((f = p->filp[i]) != NULL)
p	199	kernel/fork.c	p->filp[i] = copy_fd(f);
p	202	kernel/fork.c	if ((f = p->filp[i]) != NULL)
p	211	kernel/fork.c	dup_mmap(p);
p	212	kernel/fork.c	set_tss_desc(gdt+(nr<<1)+FIRST_TSS_ENTRY,&(p->tss));
p	213	kernel/fork.c	if (p->ldt)
p	214	kernel/fork.c	set_ldt_desc(gdt+(nr<<1)+FIRST_LDT_ENTRY,p->ldt, 512);
p	218	kernel/fork.c	p->counter = current->counter >> 1;
p	219	kernel/fork.c	p->state = TASK_RUNNING;  /* do this last, just in case */
p	220	kernel/fork.c	return p->pid;
p	223	kernel/fork.c	REMOVE_LINKS(p);
p	224	kernel/fork.c	free_page(p->kernel_stack_page);
p	226	kernel/fork.c	free_page((long) p);
p	21	kernel/info.c	struct task_struct **p;
p	34	kernel/info.c	for (p = &LAST_TASK; p > &FIRST_TASK; p--)
p	35	kernel/info.c	if (*p) val.procs++;
p	237	kernel/module.c	char *p;
p	243	kernel/module.c	p = buf;
p	245	kernel/module.c	if (p - buf > 4096 - 100)
p	250	kernel/module.c	*p++ = *q++;
p	258	kernel/module.c	*p++ = ' ';
p	261	kernel/module.c	*p++ = *q++;
p	271	kernel/module.c	*p++ = *q++;
p	272	kernel/module.c	*p++ = '\n';
p	274	kernel/module.c	return p - buf;
p	144	kernel/printk.c	char *msg, *p, *buf_end;
p	154	kernel/printk.c	for (p = buf + 3; p < buf_end; p++) {
p	155	kernel/printk.c	msg = p;
p	158	kernel/printk.c	p[0] != '<' ||
p	159	kernel/printk.c	p[1] < '0' ||
p	160	kernel/printk.c	p[1] > '7' ||
p	161	kernel/printk.c	p[2] != '>'
p	163	kernel/printk.c	p -= 3;
p	164	kernel/printk.c	p[0] = '<';
p	165	kernel/printk.c	p[1] = DEFAULT_MESSAGE_LOGLEVEL - 1 + '0';
p	166	kernel/printk.c	p[2] = '>';
p	169	kernel/printk.c	msg_level = p[1] - '0';
p	171	kernel/printk.c	for (; p < buf_end; p++) {
p	172	kernel/printk.c	log_buf[(log_start+log_size) & (LOG_BUF_LEN-1)] = *p;
p	178	kernel/printk.c	if (*p == '\n')
p	182	kernel/printk.c	char tmp = p[1];
p	183	kernel/printk.c	p[1] = '\0';
p	185	kernel/printk.c	p[1] = tmp;
p	187	kernel/printk.c	if (*p == '\n')
p	204	kernel/printk.c	int  p = log_start;
p	212	kernel/printk.c	buf[j++] = log_buf[p];
p	213	kernel/printk.c	p++; p &= LOG_BUF_LEN-1;
p	198	kernel/sched.c	struct task_struct * p;
p	210	kernel/sched.c	p = &init_task;
p	212	kernel/sched.c	if ((p = p->next_task) == &init_task)
p	214	kernel/sched.c	if (ticks && p->it_real_value) {
p	215	kernel/sched.c	if (p->it_real_value <= ticks) {
p	216	kernel/sched.c	send_sig(SIGALRM, p, 1);
p	217	kernel/sched.c	if (!p->it_real_incr) {
p	218	kernel/sched.c	p->it_real_value = 0;
p	222	kernel/sched.c	p->it_real_value += p->it_real_incr;
p	223	kernel/sched.c	} while (p->it_real_value <= ticks);
p	225	kernel/sched.c	p->it_real_value -= ticks;
p	226	kernel/sched.c	if (p->it_real_value < itimer_next)
p	227	kernel/sched.c	itimer_next = p->it_real_value;
p	230	kernel/sched.c	if (p->state != TASK_INTERRUPTIBLE)
p	232	kernel/sched.c	if (p->signal & ~p->blocked) {
p	233	kernel/sched.c	p->state = TASK_RUNNING;
p	236	kernel/sched.c	if (p->timeout && p->timeout <= jiffies) {
p	237	kernel/sched.c	p->timeout = 0;
p	238	kernel/sched.c	p->state = TASK_RUNNING;
p	255	kernel/sched.c	next = p = &init_task;
p	257	kernel/sched.c	if ((p = p->next_task) == &init_task)
p	259	kernel/sched.c	if (p->state == TASK_RUNNING && p->counter > c)
p	260	kernel/sched.c	c = p->counter, next = p;
p	264	kernel/sched.c	for_each_task(p)
p	265	kernel/sched.c	p->counter = (p->counter >> 1) + p->priority;
p	296	kernel/sched.c	struct task_struct * p;
p	301	kernel/sched.c	if ((p = tmp->task) != NULL) {
p	302	kernel/sched.c	if ((p->state == TASK_UNINTERRUPTIBLE) ||
p	303	kernel/sched.c	(p->state == TASK_INTERRUPTIBLE)) {
p	304	kernel/sched.c	p->state = TASK_RUNNING;
p	305	kernel/sched.c	if (p->counter > current->counter)
p	323	kernel/sched.c	struct task_struct * p;
p	328	kernel/sched.c	if ((p = tmp->task) != NULL) {
p	329	kernel/sched.c	if (p->state == TASK_INTERRUPTIBLE) {
p	330	kernel/sched.c	p->state = TASK_RUNNING;
p	331	kernel/sched.c	if (p->counter > current->counter)
p	346	kernel/sched.c	static inline void __sleep_on(struct wait_queue **p, int state)
p	351	kernel/sched.c	if (!p)
p	356	kernel/sched.c	add_wait_queue(p, &wait);
p	360	kernel/sched.c	remove_wait_queue(p, &wait);
p	364	kernel/sched.c	void interruptible_sleep_on(struct wait_queue **p)
p	366	kernel/sched.c	__sleep_on(p,TASK_INTERRUPTIBLE);
p	369	kernel/sched.c	void sleep_on(struct wait_queue **p)
p	371	kernel/sched.c	__sleep_on(p,TASK_UNINTERRUPTIBLE);
p	379	kernel/sched.c	struct timer_list ** p;
p	384	kernel/sched.c	p = &next_timer;
p	387	kernel/sched.c	while (*p) {
p	388	kernel/sched.c	if ((*p)->expires > timer->expires) {
p	389	kernel/sched.c	(*p)->expires -= timer->expires;
p	390	kernel/sched.c	timer->next = *p;
p	393	kernel/sched.c	timer->expires -= (*p)->expires;
p	394	kernel/sched.c	p = &(*p)->next;
p	396	kernel/sched.c	*p = timer;
p	404	kernel/sched.c	struct timer_list **p;
p	406	kernel/sched.c	p = &next_timer;
p	409	kernel/sched.c	while (*p) {
p	410	kernel/sched.c	if (*p == timer) {
p	411	kernel/sched.c	if ((*p = timer->next) != NULL)
p	412	kernel/sched.c	(*p)->expires += timer->expires;
p	417	kernel/sched.c	expires += (*p)->expires;
p	418	kernel/sched.c	p = &(*p)->next;
p	440	kernel/sched.c	struct task_struct **p;
p	443	kernel/sched.c	for(p = &LAST_TASK; p > &FIRST_TASK; --p)
p	444	kernel/sched.c	if (*p && ((*p)->state == TASK_RUNNING ||
p	445	kernel/sched.c	(*p)->state == TASK_UNINTERRUPTIBLE ||
p	446	kernel/sched.c	(*p)->state == TASK_SWAPPING))
p	737	kernel/sched.c	static void show_task(int nr,struct task_struct * p)
p	741	kernel/sched.c	printk("%-8s %3d ", p->comm, (p == current) ? -nr : nr);
p	742	kernel/sched.c	if (((unsigned) p->state) < sizeof(stat_nam)/sizeof(char *))
p	743	kernel/sched.c	printk(stat_nam[p->state]);
p	747	kernel/sched.c	printk(" %08lX ", ((unsigned long *)p->tss.esp)[2]);
p	749	kernel/sched.c	p->tss.esp - p->kernel_stack_page, p->pid, p->p_pptr->pid);
p	750	kernel/sched.c	if (p->p_cptr)
p	751	kernel/sched.c	printk("%5d ", p->p_cptr->pid);
p	754	kernel/sched.c	if (p->p_ysptr)
p	755	kernel/sched.c	printk("%7d", p->p_ysptr->pid);
p	758	kernel/sched.c	if (p->p_osptr)
p	759	kernel/sched.c	printk(" %5d\n", p->p_osptr->pid);
p	778	kernel/sched.c	struct desc_struct * p;
p	786	kernel/sched.c	p = gdt+2+FIRST_TSS_ENTRY;
p	789	kernel/sched.c	p->a=p->b=0;
p	790	kernel/sched.c	p++;
p	791	kernel/sched.c	p->a=p->b=0;
p	792	kernel/sched.c	p++;
p	142	kernel/signal.c	struct sigaction *p;
p	144	kernel/signal.c	p = signum - 1 + current->sigaction;
p	145	kernel/signal.c	if (p->sa_handler == SIG_IGN) {
p	151	kernel/signal.c	if (p->sa_handler == SIG_DFL) {
p	180	kernel/signal.c	struct sigaction new_sa, *p;
p	184	kernel/signal.c	p = signum - 1 + current->sigaction;
p	198	kernel/signal.c	memcpy_tofs(oldaction, p, sizeof(struct sigaction));
p	201	kernel/signal.c	*p = new_sa;
p	34	kernel/sys.c	static int proc_sel(struct task_struct *p, int which, int who)
p	38	kernel/sys.c	if (!who && p == current)
p	40	kernel/sys.c	return(p->pid == who);
p	44	kernel/sys.c	return(p->pgrp == who);
p	48	kernel/sys.c	return(p->uid == who);
p	55	kernel/sys.c	struct task_struct **p;
p	65	kernel/sys.c	for(p = &LAST_TASK; p > &FIRST_TASK; --p) {
p	66	kernel/sys.c	if (!*p || !proc_sel(*p, which, who))
p	68	kernel/sys.c	if ((*p)->uid != current->euid &&
p	69	kernel/sys.c	(*p)->uid != current->uid && !suser()) {
p	75	kernel/sys.c	if (priority > (*p)->priority && !suser())
p	78	kernel/sys.c	(*p)->priority = priority;
p	85	kernel/sys.c	struct task_struct **p;
p	91	kernel/sys.c	for(p = &LAST_TASK; p > &FIRST_TASK; --p) {
p	92	kernel/sys.c	if (!*p || !proc_sel(*p, which, who))
p	94	kernel/sys.c	if ((*p)->priority > max_prio)
p	95	kernel/sys.c	max_prio = (*p)->priority;
p	697	kernel/sys.c	int getrusage(struct task_struct *p, int who, struct rusage *ru)
p	709	kernel/sys.c	r.ru_utime.tv_sec = CT_TO_SECS(p->utime);
p	710	kernel/sys.c	r.ru_utime.tv_usec = CT_TO_USECS(p->utime);
p	711	kernel/sys.c	r.ru_stime.tv_sec = CT_TO_SECS(p->stime);
p	712	kernel/sys.c	r.ru_stime.tv_usec = CT_TO_USECS(p->stime);
p	713	kernel/sys.c	r.ru_minflt = p->min_flt;
p	714	kernel/sys.c	r.ru_majflt = p->maj_flt;
p	717	kernel/sys.c	r.ru_utime.tv_sec = CT_TO_SECS(p->cutime);
p	718	kernel/sys.c	r.ru_utime.tv_usec = CT_TO_USECS(p->cutime);
p	719	kernel/sys.c	r.ru_stime.tv_sec = CT_TO_SECS(p->cstime);
p	720	kernel/sys.c	r.ru_stime.tv_usec = CT_TO_USECS(p->cstime);
p	721	kernel/sys.c	r.ru_minflt = p->cmin_flt;
p	722	kernel/sys.c	r.ru_majflt = p->cmaj_flt;
p	725	kernel/sys.c	r.ru_utime.tv_sec = CT_TO_SECS(p->utime + p->cutime);
p	726	kernel/sys.c	r.ru_utime.tv_usec = CT_TO_USECS(p->utime + p->cutime);
p	727	kernel/sys.c	r.ru_stime.tv_sec = CT_TO_SECS(p->stime + p->cstime);
p	728	kernel/sys.c	r.ru_stime.tv_usec = CT_TO_USECS(p->stime + p->cstime);
p	729	kernel/sys.c	r.ru_minflt = p->min_flt + p->cmin_flt;
p	730	kernel/sys.c	r.ru_majflt = p->maj_flt + p->cmaj_flt;
p	59	mm/kmalloc.c	#define BH(p) ((struct block_header *)(p))
p	73	mm/kmalloc.c	#define PAGE_DESC(p) ((struct page_descriptor *)(((unsigned long)(p)) & PAGE_MASK))
p	152	mm/kmalloc.c	struct block_header *p;
p	180	mm/kmalloc.c	(p    =  page->firstfree))
p	182	mm/kmalloc.c	if (p->bh_flags == MF_FREE)
p	184	mm/kmalloc.c	page->firstfree = p->bh_next;
p	195	mm/kmalloc.c	p->bh_flags =  MF_USED; /* As of now this block is officially in use */
p	196	mm/kmalloc.c	p->bh_length = size;
p	197	mm/kmalloc.c	return p+1; /* Pointer arithmetic: increments past header */
p	199	mm/kmalloc.c	printk ("Problem: block on freelist at %08lx isn't free.\n",(long)p);
p	222	mm/kmalloc.c	for (i=NBLOCKS(order),p=BH (page+1);i > 1;i--,p=p->bh_next)
p	224	mm/kmalloc.c	p->bh_flags = MF_FREE;
p	225	mm/kmalloc.c	p->bh_next = BH ( ((long)p)+sz);
p	228	mm/kmalloc.c	p->bh_flags = MF_FREE;
p	229	mm/kmalloc.c	p->bh_next = NULL;
p	268	mm/kmalloc.c	register struct block_header *p=((struct block_header *)ptr) -1;
p	271	mm/kmalloc.c	page = PAGE_DESC (p);
p	276	mm/kmalloc.c	(p->bh_flags != MF_USED))
p	279	mm/kmalloc.c	p, page->next, page->order);
p	283	mm/kmalloc.c	size != p->bh_length)
p	286	mm/kmalloc.c	p,size,p->bh_length);
p	289	mm/kmalloc.c	size = p->bh_length;
p	290	mm/kmalloc.c	p->bh_flags = MF_FREE; /* As of now this block is officially free */
p	294	mm/kmalloc.c	p->bh_next = page->firstfree;
p	295	mm/kmalloc.c	page->firstfree = p;
p	68	mm/memory.c	#define CODE_SPACE(addr,p) ((addr) < (p)->end_code)
p	703	mm/memory.c	struct task_struct * p, unsigned long error_code, unsigned long newpage)
p	710	mm/memory.c	from_page = (unsigned long)PAGE_DIR_OFFSET(p->tss.cr3,address);
p	765	mm/memory.c	struct task_struct ** p;
p	769	mm/memory.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	770	mm/memory.c	if (!*p)
p	772	mm/memory.c	if (tsk == *p)
p	774	mm/memory.c	if (inode != (*p)->executable) {
p	780	mm/memory.c	for (mpnt = (*p)->mmap; mpnt; mpnt = mpnt->vm_next) {
p	791	mm/memory.c	if (try_to_share(address,tsk,*p,error_code,newpage))
p	803	mm/memory.c	unsigned long *p;
p	805	mm/memory.c	p = PAGE_DIR_OFFSET(tsk->tss.cr3,address);
p	806	mm/memory.c	if (PAGE_PRESENT & *p)
p	807	mm/memory.c	return *p;
p	808	mm/memory.c	if (*p) {
p	810	mm/memory.c	*p = 0;
p	813	mm/memory.c	p = PAGE_DIR_OFFSET(tsk->tss.cr3,address);
p	814	mm/memory.c	if (PAGE_PRESENT & *p) {
p	816	mm/memory.c	return *p;
p	818	mm/memory.c	if (*p) {
p	820	mm/memory.c	*p = 0;
p	823	mm/memory.c	*p = page | PAGE_TABLE;
p	824	mm/memory.c	return *p;
p	827	mm/memory.c	*p = BAD_PAGETABLE | PAGE_TABLE;
p	1064	mm/memory.c	unsigned short * p;
p	1074	mm/memory.c	p = mem_map + tmp;
p	1075	mm/memory.c	start_mem = (unsigned long) p;
p	1076	mm/memory.c	while (p > mem_map)
p	1077	mm/memory.c	*--p = MAP_PAGE_RESERVED;
p	60	mm/swap.c	struct swap_info_struct * p;
p	67	mm/swap.c	p = &swap_info[type];
p	69	mm/swap.c	if (offset >= p->max) {
p	73	mm/swap.c	if (!(p->flags & SWP_USED)) {
p	77	mm/swap.c	while (set_bit(offset,p->swap_lockmap))
p	79	mm/swap.c	if (p->swap_device) {
p	80	mm/swap.c	ll_rw_page(rw,p->swap_device,offset,buf);
p	81	mm/swap.c	} else if (p->swap_file) {
p	86	mm/swap.c	block = offset << (12 - p->swap_file->i_sb->s_blocksize_bits);
p	88	mm/swap.c	for (i=0, j=0; j< PAGE_SIZE ; i++, j +=p->swap_file->i_sb->s_blocksize)
p	89	mm/swap.c	if (!(zones[i] = bmap(p->swap_file,block++))) {
p	93	mm/swap.c	ll_rw_swap_file(rw,p->swap_file->i_dev, zones, i,buf);
p	96	mm/swap.c	if (offset && !clear_bit(offset,p->swap_lockmap))
p	103	mm/swap.c	struct swap_info_struct * p;
p	106	mm/swap.c	p = swap_info;
p	107	mm/swap.c	for (type = 0 ; type < nr_swapfiles ; type++,p++) {
p	108	mm/swap.c	if ((p->flags & SWP_WRITEOK) != SWP_WRITEOK)
p	110	mm/swap.c	for (offset = p->lowest_bit; offset <= p->highest_bit ; offset++) {
p	111	mm/swap.c	if (p->swap_map[offset])
p	113	mm/swap.c	p->swap_map[offset] = 1;
p	115	mm/swap.c	if (offset == p->highest_bit)
p	116	mm/swap.c	p->highest_bit--;
p	117	mm/swap.c	p->lowest_bit = offset;
p	126	mm/swap.c	struct swap_info_struct * p;
p	139	mm/swap.c	p = type + swap_info;
p	140	mm/swap.c	if (offset >= p->max) {
p	144	mm/swap.c	if (!p->swap_map[offset]) {
p	148	mm/swap.c	p->swap_map[offset]++;
p	154	mm/swap.c	struct swap_info_struct * p;
p	166	mm/swap.c	p = & swap_info[type];
p	168	mm/swap.c	if (offset >= p->max) {
p	172	mm/swap.c	if (!(p->flags & SWP_USED)) {
p	176	mm/swap.c	while (set_bit(offset,p->swap_lockmap))
p	178	mm/swap.c	if (offset < p->lowest_bit)
p	179	mm/swap.c	p->lowest_bit = offset;
p	180	mm/swap.c	if (offset > p->highest_bit)
p	181	mm/swap.c	p->highest_bit = offset;
p	182	mm/swap.c	if (!p->swap_map[offset])
p	185	mm/swap.c	if (!--p->swap_map[offset])
p	187	mm/swap.c	if (!clear_bit(offset,p->swap_lockmap))
p	308	mm/swap.c	struct task_struct *p;
p	326	mm/swap.c	p = task[swap_task];
p	327	mm/swap.c	if(p && p->swappable && p->rss)
p	336	mm/swap.c	if(! p -> swap_cnt) {
p	337	mm/swap.c	p->dec_flt = (p->dec_flt * 3) / 4 + p->maj_flt - p->old_maj_flt;
p	338	mm/swap.c	p->old_maj_flt = p->maj_flt;
p	340	mm/swap.c	if(p->dec_flt >= SWAP_RATIO / SWAP_MIN) {
p	341	mm/swap.c	p->dec_flt = SWAP_RATIO / SWAP_MIN;
p	342	mm/swap.c	p->swap_cnt = SWAP_MIN;
p	343	mm/swap.c	} else if(p->dec_flt <= SWAP_RATIO / SWAP_MAX)
p	344	mm/swap.c	p->swap_cnt = SWAP_MAX;
p	346	mm/swap.c	p->swap_cnt = SWAP_RATIO / p->dec_flt;
p	352	mm/swap.c	for(table = p->swap_table; table < 1024; table++) {
p	353	mm/swap.c	pg_table = ((unsigned long *) p->tss.cr3)[table];
p	361	mm/swap.c	((unsigned long *) p->tss.cr3)[table] = 0;
p	369	mm/swap.c	for(page = p->swap_page; page < 1024; page++) {
p	375	mm/swap.c	p->rss--;
p	377	mm/swap.c	p->swap_table = table;
p	378	mm/swap.c	p->swap_page  = page + 1;
p	379	mm/swap.c	if((--p->swap_cnt) == 0)
p	384	mm/swap.c	p->rss--;
p	389	mm/swap.c	p->swap_page = 0;
p	396	mm/swap.c	p->swap_table = 0;
p	418	mm/swap.c	struct task_struct * p;
p	428	mm/swap.c	p = task[swap_task];
p	429	mm/swap.c	if (!p || !p->swappable) {
p	439	mm/swap.c	pg_table = ((unsigned long *) p->tss.cr3)[swap_table];
p	447	mm/swap.c	((unsigned long *) p->tss.cr3)[swap_table] = 0;
p	460	mm/swap.c	case 1: p->rss--; return 1;
p	461	mm/swap.c	default: p->rss--;
p	613	mm/swap.c	struct task_struct *p;
p	622	mm/swap.c	p = task[nr];
p	623	mm/swap.c	if (!p)
p	626	mm/swap.c	ppage = pgt + ((unsigned long *) p->tss.cr3);
p	651	mm/swap.c	++p->rss;
p	665	mm/swap.c	struct swap_info_struct * p;
p	675	mm/swap.c	p = swap_info;
p	676	mm/swap.c	for (type = 0 ; type < nr_swapfiles ; type++,p++) {
p	677	mm/swap.c	if ((p->flags & SWP_WRITEOK) != SWP_WRITEOK)
p	679	mm/swap.c	if (p->swap_file) {
p	680	mm/swap.c	if (p->swap_file == inode)
p	685	mm/swap.c	if (p->swap_device == inode->i_rdev)
p	692	mm/swap.c	p->flags = SWP_USED;
p	695	mm/swap.c	p->flags = SWP_WRITEOK;
p	698	mm/swap.c	nr_swap_pages -= p->pages;
p	699	mm/swap.c	iput(p->swap_file);
p	700	mm/swap.c	p->swap_file = NULL;
p	701	mm/swap.c	p->swap_device = 0;
p	702	mm/swap.c	vfree(p->swap_map);
p	703	mm/swap.c	p->swap_map = NULL;
p	704	mm/swap.c	free_page((long) p->swap_lockmap);
p	705	mm/swap.c	p->swap_lockmap = NULL;
p	706	mm/swap.c	p->flags = 0;
p	717	mm/swap.c	struct swap_info_struct * p;
p	725	mm/swap.c	p = swap_info;
p	726	mm/swap.c	for (type = 0 ; type < nr_swapfiles ; type++,p++)
p	727	mm/swap.c	if (!(p->flags & SWP_USED))
p	733	mm/swap.c	p->flags = SWP_USED;
p	734	mm/swap.c	p->swap_file = NULL;
p	735	mm/swap.c	p->swap_device = 0;
p	736	mm/swap.c	p->swap_map = NULL;
p	737	mm/swap.c	p->swap_lockmap = NULL;
p	738	mm/swap.c	p->lowest_bit = 0;
p	739	mm/swap.c	p->highest_bit = 0;
p	740	mm/swap.c	p->max = 1;
p	749	mm/swap.c	p->swap_device = swap_inode->i_rdev;
p	752	mm/swap.c	if (!p->swap_device)
p	758	mm/swap.c	if (p->swap_device == swap_info[i].swap_device)
p	762	mm/swap.c	p->swap_file = swap_inode;
p	765	mm/swap.c	p->swap_lockmap = (unsigned char *) get_free_page(GFP_USER);
p	766	mm/swap.c	if (!p->swap_lockmap) {
p	771	mm/swap.c	read_swap_page(SWP_ENTRY(type,0), (char *) p->swap_lockmap);
p	772	mm/swap.c	if (memcmp("SWAP-SPACE",p->swap_lockmap+4086,10)) {
p	777	mm/swap.c	memset(p->swap_lockmap+PAGE_SIZE-10,0,10);
p	779	mm/swap.c	p->lowest_bit = 0;
p	780	mm/swap.c	p->highest_bit = 0;
p	782	mm/swap.c	if (test_bit(i,p->swap_lockmap)) {
p	783	mm/swap.c	if (!p->lowest_bit)
p	784	mm/swap.c	p->lowest_bit = i;
p	785	mm/swap.c	p->highest_bit = i;
p	786	mm/swap.c	p->max = i+1;
p	795	mm/swap.c	p->swap_map = (unsigned char *) vmalloc(p->max);
p	796	mm/swap.c	if (!p->swap_map) {
p	800	mm/swap.c	for (i = 1 ; i < p->max ; i++) {
p	801	mm/swap.c	if (test_bit(i,p->swap_lockmap))
p	802	mm/swap.c	p->swap_map[i] = 0;
p	804	mm/swap.c	p->swap_map[i] = 0x80;
p	806	mm/swap.c	p->swap_map[0] = 0x80;
p	807	mm/swap.c	memset(p->swap_lockmap,0,PAGE_SIZE);
p	808	mm/swap.c	p->flags = SWP_WRITEOK;
p	809	mm/swap.c	p->pages = j;
p	814	mm/swap.c	free_page((long) p->swap_lockmap);
p	815	mm/swap.c	vfree(p->swap_map);
p	816	mm/swap.c	iput(p->swap_file);
p	817	mm/swap.c	p->swap_device = 0;
p	818	mm/swap.c	p->swap_file = NULL;
p	819	mm/swap.c	p->swap_map = NULL;
p	820	mm/swap.c	p->swap_lockmap = NULL;
p	821	mm/swap.c	p->flags = 0;
p	39	mm/vmalloc.c	struct task_struct * p;
p	41	mm/vmalloc.c	p = &init_task;
p	43	mm/vmalloc.c	((unsigned long *) p->tss.cr3)[dindex] = value;
p	44	mm/vmalloc.c	p = p->next_task;
p	45	mm/vmalloc.c	} while (p != &init_task);
p	127	mm/vmalloc.c	struct vm_struct **p, *tmp;
p	135	mm/vmalloc.c	for (p = &vmlist ; (tmp = *p) ; p = &tmp->next) {
p	137	mm/vmalloc.c	*p = tmp->next;
p	149	mm/vmalloc.c	struct vm_struct **p, *tmp, *area;
p	160	mm/vmalloc.c	for (p = &vmlist; (tmp = *p) ; p = &tmp->next) {
p	166	mm/vmalloc.c	area->next = *p;
p	167	mm/vmalloc.c	*p = area;
p	177	mm/vmalloc.c	struct vm_struct **p, *tmp;
p	181	mm/vmalloc.c	for (p = &vmlist; (tmp = *p) ; p = &tmp->next) {
p	165	net/inet/packet.c	struct packet_type *p;
p	167	net/inet/packet.c	p = (struct packet_type *) kmalloc(sizeof(*p), GFP_KERNEL);
p	168	net/inet/packet.c	if (p == NULL) return(-ENOMEM);
p	170	net/inet/packet.c	p->func = packet_rcv;
p	171	net/inet/packet.c	p->type = sk->num;
p	172	net/inet/packet.c	p->data = (void *)sk;
p	173	net/inet/packet.c	dev_add_pack(p);
p	176	net/inet/packet.c	sk->pair = (struct sock *)p;
p	89	net/inet/protocol.c	struct inet_protocol *p;
p	93	net/inet/protocol.c	for (p = inet_protos[hash] ; p != NULL; p=p->next) {
p	94	net/inet/protocol.c	DPRINTF((DBG_PROTO, "trying protocol %d\n", p->protocol));
p	95	net/inet/protocol.c	if (p->protocol == prot) return((struct inet_protocol *) p);
p	127	net/inet/protocol.c	struct inet_protocol *p;
p	137	net/inet/protocol.c	p = (struct inet_protocol *) inet_protos[hash];
p	138	net/inet/protocol.c	while(p != NULL) {
p	144	net/inet/protocol.c	if (p->next != NULL && p->next == prot) {
p	149	net/inet/protocol.c	if (p->copy == 0 && lp != NULL) lp->copy = 0;
p	150	net/inet/protocol.c	p->next = prot->next;
p	154	net/inet/protocol.c	if (p->next != NULL && p->next->protocol == prot->protocol) {
p	155	net/inet/protocol.c	lp = p;
p	158	net/inet/protocol.c	p = (struct inet_protocol *) p->next;
p	284	net/inet/raw.c	struct inet_protocol *p;
p	286	net/inet/raw.c	p = (struct inet_protocol *) kmalloc(sizeof (*p), GFP_KERNEL);
p	287	net/inet/raw.c	if (p == NULL) return(-ENOMEM);
p	289	net/inet/raw.c	p->handler = raw_rcv;
p	290	net/inet/raw.c	p->protocol = sk->protocol;
p	291	net/inet/raw.c	p->data = (void *)sk;
p	292	net/inet/raw.c	p->err_handler = raw_err;
p	293	net/inet/raw.c	p->name="USER";
p	294	net/inet/raw.c	p->frag_handler = NULL;  /* For now */
p	295	net/inet/raw.c	inet_add_protocol(p);
p	298	net/inet/raw.c	sk->pair = (struct sock *)p;
p	69	net/inet/route.c	struct rtable *r, *x, *p;
p	78	net/inet/route.c	p = NULL;
p	83	net/inet/route.c	if (p == NULL)
p	86	net/inet/route.c	p->rt_next = r->rt_next;
p	93	net/inet/route.c	p = r;
p	105	net/inet/route.c	struct rtable *r, *x, *p;
p	114	net/inet/route.c	p = NULL;
p	119	net/inet/route.c	if (p == NULL)
p	122	net/inet/route.c	p->rt_next = r->rt_next;
p	129	net/inet/route.c	p = r;
p	1779	net/inet/sock.c	struct inet_protocol *p;
p	1802	net/inet/sock.c	for(p = inet_protocol_base; p != NULL;) {
p	1805	net/inet/sock.c	tmp = (struct inet_protocol *) p->next;
p	1806	net/inet/sock.c	inet_add_protocol(p);
p	1807	net/inet/sock.c	printk("%s%s",p->name,tmp?", ":"\n");
p	1808	net/inet/sock.c	p = tmp;
p	48	net/inet/utils.c	register char *p;
p	50	net/inet/utils.c	p = (char *) &in;
p	52	net/inet/utils.c	(p[0] & 255), (p[1] & 255), (p[2] & 255), (p[3] & 255));
p	216	zBoot/gzip.h	#define SH(p) ((ush)(uch)((p)[0]) | ((ush)(uch)((p)[1]) << 8))
p	217	zBoot/gzip.h	#define LG(p) ((ulg)(SH(p)) | ((ulg)(SH((p)+2)) << 16))
p	122	zBoot/inflate.c	register unsigned *p;         /* pointer into c[], b[], or v[] */
p	137	zBoot/inflate.c	p = b;  i = n;
p	139	zBoot/inflate.c	c[*p++]++;                  /* assume all entries <= BMAX */
p	180	zBoot/inflate.c	p = c + 1;  xp = x + 2;
p	182	zBoot/inflate.c	*xp++ = (j += *p++);
p	188	zBoot/inflate.c	p = b;  i = 0;
p	190	zBoot/inflate.c	if ((j = *p++) != 0)
p	198	zBoot/inflate.c	p = v;                        /* grab values in bit order */
p	272	zBoot/inflate.c	if (p >= v + n)
p	274	zBoot/inflate.c	else if (*p < s)
p	276	zBoot/inflate.c	r.e = (uch)(*p < 256 ? 16 : 15);    /* 256 is end-of-block code */
p	277	zBoot/inflate.c	r.v.n = *p++;           /* simple code is just the value */
p	281	zBoot/inflate.c	r.e = (uch)e[*p - s];   /* non-simple--look up in lists */
p	282	zBoot/inflate.c	r.v.n = d[*p++ - s];
p	321	zBoot/inflate.c	register struct huft *p, *q;
p	325	zBoot/inflate.c	p = t;
p	326	zBoot/inflate.c	while (p != (struct huft *)NULL)
p	328	zBoot/inflate.c	q = (--p)->v.t;
p	329	zBoot/inflate.c	free(p);
p	330	zBoot/inflate.c	p = q;
p	83	zBoot/misc.c	void *p;
p	90	zBoot/misc.c	p = (void *)free_mem_ptr;
p	96	zBoot/misc.c	if (p == NULL) error("malloc = NULL\n");
p	97	zBoot/misc.c	return p;
p	260	zBoot/misc.c	static int p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};
p	264	zBoot/misc.c	for (i = 0; i < sizeof(p)/sizeof(int); i++)
p	265	zBoot/misc.c	e |= 1L << (31 - p[i]);