tag	line	file	source code
p	25	fs/block_dev.c	register char * p;
p	45	fs/block_dev.c	p = offset + bh->b_data;
p	50	fs/block_dev.c	memcpy_fromfs(p,buf,chars);
p	51	fs/block_dev.c	p += chars;
p	627	fs/buffer.c	struct buffer_head * tmp, * p;
p	643	fs/buffer.c	p = tmp;
p	646	fs/buffer.c	remove_from_queues(p);
p	647	fs/buffer.c	put_unused_buffer_head(p);
p	244	fs/exec.c	static unsigned long * create_tables(char * p,int argc,int envc)
p	249	fs/exec.c	sp = (unsigned long *) (0xfffffffc & (unsigned long) p);
p	257	fs/exec.c	current->arg_start = (unsigned long) p;
p	259	fs/exec.c	put_fs_long((unsigned long) p,argv++);
p	260	fs/exec.c	while (get_fs_byte(p++)) /* nothing */ ;
p	263	fs/exec.c	current->arg_end = current->env_start = (unsigned long) p;
p	265	fs/exec.c	put_fs_long((unsigned long) p,envp++);
p	266	fs/exec.c	while (get_fs_byte(p++)) /* nothing */ ;
p	269	fs/exec.c	current->env_end = (unsigned long) p;
p	306	fs/exec.c	unsigned long p, int from_kmem)
p	312	fs/exec.c	if (!p)
p	329	fs/exec.c	if (p < len) {  /* this shouldn't happen - 128kB */
p	334	fs/exec.c	--p; --tmp; --len;
p	336	fs/exec.c	offset = p % PAGE_SIZE;
p	339	fs/exec.c	if (!(pag = (char *) page[p/PAGE_SIZE]) &&
p	340	fs/exec.c	!(pag = (char *) page[p/PAGE_SIZE] =
p	352	fs/exec.c	return p;
p	435	fs/exec.c	unsigned long p=PAGE_SIZE*MAX_ARG_PAGES-4;
p	533	fs/exec.c	p = copy_strings(envc, envp, page, p, 0);
p	534	fs/exec.c	p = copy_strings(--argc, argv+1, page, p, 0);
p	544	fs/exec.c	p = copy_strings(1, &filename, page, p, 1);
p	547	fs/exec.c	p = copy_strings(1, &i_arg, page, p, 2);
p	550	fs/exec.c	p = copy_strings(1, &i_name, page, p, 2);
p	552	fs/exec.c	if (!p) {
p	578	fs/exec.c	p = copy_strings(envc,envp,page,p,0);
p	579	fs/exec.c	p = copy_strings(argc,argv,page,p,0);
p	580	fs/exec.c	if (!p) {
p	622	fs/exec.c	p += change_ldt(ex.a_text,page);
p	623	fs/exec.c	p -= MAX_ARG_PAGES*PAGE_SIZE;
p	624	fs/exec.c	p = (unsigned long) create_tables((char *)p,argc,envc);
p	628	fs/exec.c	current->start_stack = p;
p	629	fs/exec.c	current->rss = (TASK_SIZE - p + PAGE_SIZE-1) / PAGE_SIZE;
p	642	fs/exec.c	eip[3] = p;      /* stack pointer */
p	198	fs/ext/file.c	char * p;
p	237	fs/ext/file.c	p = (pos % BLOCK_SIZE) + bh->b_data;
p	244	fs/ext/file.c	memcpy_fromfs(p,buf,c);
p	221	fs/ext/inode.c	unsigned long * p;
p	224	fs/ext/inode.c	p = inode->u.ext_i.i_data + nr;
p	226	fs/ext/inode.c	tmp = *p;
p	229	fs/ext/inode.c	if (tmp == *p)
p	240	fs/ext/inode.c	if (*p) {
p	245	fs/ext/inode.c	*p = tmp;
p	255	fs/ext/inode.c	unsigned long * p;
p	268	fs/ext/inode.c	p = nr + (unsigned long *) bh->b_data;
p	270	fs/ext/inode.c	tmp = *p;
p	273	fs/ext/inode.c	if (tmp == *p) {
p	290	fs/ext/inode.c	if (*p) {
p	295	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	68	fs/ext2/balloc.c	unsigned *p = ((unsigned *) addr) + (offset >> 5);
p	79	fs/ext2/balloc.c	: "r" (~(*p >> bit)));
p	83	fs/ext2/balloc.c	p++;
p	86	fs/ext2/balloc.c	res = find_first_zero_bit (p, size - 32 * (p - addr));
p	298	fs/ext2/balloc.c	char *p, *r;
p	392	fs/ext2/balloc.c	p = ((char *) bh->b_data) + (j >> 3);
p	393	fs/ext2/balloc.c	r = find_first_zero_byte (p,
p	85	fs/ext2/dcache.c	struct dir_cache_entry *p;
p	87	fs/ext2/dcache.c	for (p = queue_head[queue]; p!= NULL && (p->dev != dev ||
p	88	fs/ext2/dcache.c	p->dir != dir || p->len != len || strncmp (name, p->name, p->len));
p	89	fs/ext2/dcache.c	p = p->queue_next)
p	91	fs/ext2/dcache.c	return p;
p	100	fs/ext2/dcache.c	struct dir_cache_entry *p;
p	103	fs/ext2/dcache.c	for (p = first; p != NULL; p = p->next)
p	105	fs/ext2/dcache.c	p->dev, p->dir, p->name);
p	112	fs/ext2/dcache.c	static void add_to_cache (struct dir_cache_entry *p)
p	114	fs/ext2/dcache.c	p->prev = NULL;
p	115	fs/ext2/dcache.c	p->next = first;
p	117	fs/ext2/dcache.c	first->prev = p;
p	119	fs/ext2/dcache.c	last = p;
p	120	fs/ext2/dcache.c	first = p;
p	126	fs/ext2/dcache.c	static void add_to_queue (int queue, struct dir_cache_entry *p)
p	128	fs/ext2/dcache.c	p->queue_prev = NULL;
p	129	fs/ext2/dcache.c	p->queue_next = queue_head[queue];
p	131	fs/ext2/dcache.c	queue_head[queue]->queue_prev = p;
p	133	fs/ext2/dcache.c	queue_tail[queue] = p;
p	134	fs/ext2/dcache.c	queue_head[queue] = p;
p	140	fs/ext2/dcache.c	static void remove_from_cache (struct dir_cache_entry *p)
p	142	fs/ext2/dcache.c	if (p->prev)
p	143	fs/ext2/dcache.c	p->prev->next = p->next;
p	145	fs/ext2/dcache.c	first = p->next;
p	146	fs/ext2/dcache.c	if (p->next)
p	147	fs/ext2/dcache.c	p->next->prev = p->prev;
p	149	fs/ext2/dcache.c	last = p->prev;
p	155	fs/ext2/dcache.c	static void remove_from_queue (int queue, struct dir_cache_entry *p)
p	157	fs/ext2/dcache.c	if (p->queue_prev)
p	158	fs/ext2/dcache.c	p->queue_prev->queue_next = p->queue_next;
p	160	fs/ext2/dcache.c	queue_head[queue] = p->queue_next;
p	161	fs/ext2/dcache.c	if (p->queue_next)
p	162	fs/ext2/dcache.c	p->queue_next->queue_prev = p->queue_prev;
p	164	fs/ext2/dcache.c	queue_tail[queue] = p->queue_prev;
p	173	fs/ext2/dcache.c	struct dir_cache_entry *p;
p	178	fs/ext2/dcache.c	for (p = first; p != NULL; p = p2) {
p	179	fs/ext2/dcache.c	p2 = p->next;
p	180	fs/ext2/dcache.c	if (p->dev == dev) {
p	181	fs/ext2/dcache.c	remove_from_cache (p);
p	182	fs/ext2/dcache.c	remove_from_queue (hash (p->dev, p->dir), p);
p	183	fs/ext2/dcache.c	p->next = first_free;
p	184	fs/ext2/dcache.c	first_free = p;
p	202	fs/ext2/dcache.c	struct dir_cache_entry *p;
p	214	fs/ext2/dcache.c	if ((p = find_name (queue, dev, dir, our_name, len))) {
p	215	fs/ext2/dcache.c	if (p != first) {
p	216	fs/ext2/dcache.c	remove_from_cache (p);
p	217	fs/ext2/dcache.c	add_to_cache (p);
p	219	fs/ext2/dcache.c	if (p != queue_head[queue]) {
p	220	fs/ext2/dcache.c	remove_from_queue (queue, p);
p	221	fs/ext2/dcache.c	add_to_queue (queue, p);
p	226	fs/ext2/dcache.c	our_name, p->ino, hits, misses);
p	229	fs/ext2/dcache.c	return p->ino;
p	252	fs/ext2/dcache.c	struct dir_cache_entry *p;
p	264	fs/ext2/dcache.c	if ((p = find_name (queue, dev, dir, name, len))) {
p	265	fs/ext2/dcache.c	p->dir = dir;
p	266	fs/ext2/dcache.c	p->ino = ino;
p	267	fs/ext2/dcache.c	if (p != first) {
p	268	fs/ext2/dcache.c	remove_from_cache (p);
p	269	fs/ext2/dcache.c	add_to_cache (p);
p	271	fs/ext2/dcache.c	if (p != queue_head[queue]) {
p	272	fs/ext2/dcache.c	remove_from_queue (queue, p);
p	273	fs/ext2/dcache.c	add_to_queue (queue, p);
p	277	fs/ext2/dcache.c	p = first_free;
p	278	fs/ext2/dcache.c	first_free = p->next;
p	283	fs/ext2/dcache.c	p = last;
p	284	fs/ext2/dcache.c	last = p->prev;
p	287	fs/ext2/dcache.c	remove_from_queue (hash (p->dev, p->dir), p);
p	290	fs/ext2/dcache.c	p->dev = dev;
p	291	fs/ext2/dcache.c	p->dir = dir;
p	292	fs/ext2/dcache.c	p->ino = ino;
p	293	fs/ext2/dcache.c	strncpy (p->name, name, len);
p	294	fs/ext2/dcache.c	p->len = len;
p	295	fs/ext2/dcache.c	p->name[len] = '\0';
p	296	fs/ext2/dcache.c	add_to_cache (p);
p	297	fs/ext2/dcache.c	add_to_queue (queue, p);
p	314	fs/ext2/dcache.c	struct dir_cache_entry *p;
p	325	fs/ext2/dcache.c	if ((p = find_name (queue, dev, dir, name, len))) {
p	326	fs/ext2/dcache.c	remove_from_cache (p);
p	327	fs/ext2/dcache.c	remove_from_queue (queue, p);
p	328	fs/ext2/dcache.c	p->next = first_free;
p	329	fs/ext2/dcache.c	first_free = p;
p	204	fs/ext2/file.c	char * p;
p	249	fs/ext2/file.c	p = (pos % sb->s_blocksize) + bh->b_data;
p	256	fs/ext2/file.c	memcpy_fromfs (p, buf, c);
p	429	fs/ext2/inode.c	unsigned long * p;
p	433	fs/ext2/inode.c	p = inode->u.ext2_i.i_data + nr;
p	435	fs/ext2/inode.c	tmp = *p;
p	438	fs/ext2/inode.c	if (tmp == *p)
p	474	fs/ext2/inode.c	if (*p) {
p	479	fs/ext2/inode.c	*p = tmp;
p	494	fs/ext2/inode.c	unsigned long * p;
p	508	fs/ext2/inode.c	p = nr + (unsigned long *) bh->b_data;
p	510	fs/ext2/inode.c	tmp = *p;
p	513	fs/ext2/inode.c	if (tmp == *p) {
p	548	fs/ext2/inode.c	if (*p) {
p	553	fs/ext2/inode.c	*p = tmp;
p	36	fs/ext2/truncate.c	unsigned long * p;
p	46	fs/ext2/truncate.c	p = inode->u.ext2_i.i_data + i;
p	47	fs/ext2/truncate.c	tmp = *p;
p	55	fs/ext2/truncate.c	if ((bh && bh->b_count != 1) || tmp != *p) {
p	60	fs/ext2/truncate.c	*p = 0;
p	69	fs/ext2/truncate.c	static int trunc_indirect (struct inode * inode, int offset, unsigned long * p)
p	81	fs/ext2/truncate.c	tmp = *p;
p	85	fs/ext2/truncate.c	if (tmp != *p) {
p	90	fs/ext2/truncate.c	*p = 0;
p	129	fs/ext2/truncate.c	tmp = *p;
p	130	fs/ext2/truncate.c	*p = 0;
p	140	fs/ext2/truncate.c	unsigned long * p)
p	151	fs/ext2/truncate.c	tmp = *p;
p	155	fs/ext2/truncate.c	if (tmp != *p) {
p	160	fs/ext2/truncate.c	*p = 0;
p	185	fs/ext2/truncate.c	tmp = *p;
p	186	fs/ext2/truncate.c	*p = 0;
p	199	fs/ext2/truncate.c	unsigned long * tind, * p;
p	208	fs/ext2/truncate.c	p = inode->u.ext2_i.i_data + EXT2_TIND_BLOCK;
p	209	fs/ext2/truncate.c	if (!(tmp = *p))
p	212	fs/ext2/truncate.c	if (tmp != *p) {
p	217	fs/ext2/truncate.c	*p = 0;
p	242	fs/ext2/truncate.c	tmp = *p;
p	243	fs/ext2/truncate.c	*p = 0;
p	271	fs/isofs/rock.c	{ int p;
p	272	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	88	fs/isofs/util.c	int iso_date(char * p, int flag)
p	93	fs/isofs/util.c	year = p[0] - 70;
p	94	fs/isofs/util.c	month = p[1];
p	95	fs/isofs/util.c	day = p[2];
p	96	fs/isofs/util.c	hour = p[3];
p	97	fs/isofs/util.c	minute = p[4];
p	98	fs/isofs/util.c	second = p[5];
p	99	fs/isofs/util.c	if (flag == 0) tz = p[6]; /* High sierra has no time zone */
p	192	fs/minix/file.c	char * p;
p	231	fs/minix/file.c	p = (pos % BLOCK_SIZE) + bh->b_data;
p	238	fs/minix/file.c	memcpy_fromfs(p,buf,c);
p	195	fs/minix/inode.c	unsigned short *p;
p	198	fs/minix/inode.c	p = inode->u.minix_i.i_data + nr;
p	200	fs/minix/inode.c	tmp = *p;
p	203	fs/minix/inode.c	if (tmp == *p)
p	214	fs/minix/inode.c	if (*p) {
p	219	fs/minix/inode.c	*p = tmp;
p	229	fs/minix/inode.c	unsigned short *p;
p	242	fs/minix/inode.c	p = nr + (unsigned short *) bh->b_data;
p	244	fs/minix/inode.c	tmp = *p;
p	247	fs/minix/inode.c	if (tmp == *p) {
p	264	fs/minix/inode.c	if (*p) {
p	269	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	284	fs/namei.c	struct task_struct ** p;
p	364	fs/namei.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	365	fs/namei.c	if (!*p)
p	367	fs/namei.c	if (inode == (*p)->executable) {
p	371	fs/namei.c	for (i=0; i < (*p)->numlibraries; i++)
p	372	fs/namei.c	if (inode == (*p)->libraries[i].library) {
p	36	fs/nfs/proc.c	static int *nfs_rpc_header(int *p, int procedure);
p	37	fs/nfs/proc.c	static int *nfs_rpc_verify(int *p);
p	45	fs/nfs/proc.c	static inline int *xdr_encode_fhandle(int *p, struct nfs_fh *fhandle)
p	47	fs/nfs/proc.c	*((struct nfs_fh *) p) = *fhandle;
p	48	fs/nfs/proc.c	p += (sizeof (*fhandle) + 3) >> 2;
p	49	fs/nfs/proc.c	return p;
p	52	fs/nfs/proc.c	static inline int *xdr_decode_fhandle(int *p, struct nfs_fh *fhandle)
p	54	fs/nfs/proc.c	*fhandle = *((struct nfs_fh *) p);
p	55	fs/nfs/proc.c	p += (sizeof (*fhandle) + 3) >> 2;
p	56	fs/nfs/proc.c	return p;
p	59	fs/nfs/proc.c	static inline int *xdr_encode_string(int *p, const char *string)
p	65	fs/nfs/proc.c	*p++ = htonl(len);
p	66	fs/nfs/proc.c	memcpy((char *) p, string, len);
p	67	fs/nfs/proc.c	memset(((char *) p) + len, '\0', (quadlen << 2) - len);
p	68	fs/nfs/proc.c	p += quadlen;
p	69	fs/nfs/proc.c	return p;
p	72	fs/nfs/proc.c	static inline int *xdr_decode_string(int *p, char *string, int maxlen)
p	76	fs/nfs/proc.c	len = ntohl(*p++);
p	79	fs/nfs/proc.c	memcpy(string, (char *) p, len);
p	81	fs/nfs/proc.c	p += (len + 3) >> 2;
p	82	fs/nfs/proc.c	return p;
p	85	fs/nfs/proc.c	static inline int *xdr_encode_data(int *p, char *data, int len)
p	90	fs/nfs/proc.c	*p++ = htonl(len);
p	91	fs/nfs/proc.c	memcpy((char *) p, data, len);
p	92	fs/nfs/proc.c	memset(((char *) p) + len, '\0', (quadlen << 2) - len);
p	93	fs/nfs/proc.c	p += quadlen;
p	94	fs/nfs/proc.c	return p;
p	97	fs/nfs/proc.c	static inline int *xdr_decode_data(int *p, char *data, int *lenp, int maxlen)
p	101	fs/nfs/proc.c	len = *lenp = ntohl(*p++);
p	104	fs/nfs/proc.c	memcpy(data, (char *) p, len);
p	106	fs/nfs/proc.c	p += (len + 3) >> 2;
p	107	fs/nfs/proc.c	return p;
p	110	fs/nfs/proc.c	static int *xdr_decode_fattr(int *p, struct nfs_fattr *fattr)
p	112	fs/nfs/proc.c	fattr->type = ntohl(*p++);
p	113	fs/nfs/proc.c	fattr->mode = ntohl(*p++);
p	114	fs/nfs/proc.c	fattr->nlink = ntohl(*p++);
p	115	fs/nfs/proc.c	fattr->uid = ntohl(*p++);
p	116	fs/nfs/proc.c	fattr->gid = ntohl(*p++);
p	117	fs/nfs/proc.c	fattr->size = ntohl(*p++);
p	118	fs/nfs/proc.c	fattr->blocksize = ntohl(*p++);
p	119	fs/nfs/proc.c	fattr->rdev = ntohl(*p++);
p	120	fs/nfs/proc.c	fattr->blocks = ntohl(*p++);
p	121	fs/nfs/proc.c	fattr->fsid = ntohl(*p++);
p	122	fs/nfs/proc.c	fattr->fileid = ntohl(*p++);
p	123	fs/nfs/proc.c	fattr->atime.seconds = ntohl(*p++);
p	124	fs/nfs/proc.c	fattr->atime.useconds = ntohl(*p++);
p	125	fs/nfs/proc.c	fattr->mtime.seconds = ntohl(*p++);
p	126	fs/nfs/proc.c	fattr->mtime.useconds = ntohl(*p++);
p	127	fs/nfs/proc.c	fattr->ctime.seconds = ntohl(*p++);
p	128	fs/nfs/proc.c	fattr->ctime.useconds = ntohl(*p++);
p	129	fs/nfs/proc.c	return p;
p	132	fs/nfs/proc.c	static int *xdr_encode_sattr(int *p, struct nfs_sattr *sattr)
p	134	fs/nfs/proc.c	*p++ = htonl(sattr->mode);
p	135	fs/nfs/proc.c	*p++ = htonl(sattr->uid);
p	136	fs/nfs/proc.c	*p++ = htonl(sattr->gid);
p	137	fs/nfs/proc.c	*p++ = htonl(sattr->size);
p	138	fs/nfs/proc.c	*p++ = htonl(sattr->atime.seconds);
p	139	fs/nfs/proc.c	*p++ = htonl(sattr->atime.useconds);
p	140	fs/nfs/proc.c	*p++ = htonl(sattr->mtime.seconds);
p	141	fs/nfs/proc.c	*p++ = htonl(sattr->mtime.useconds);
p	142	fs/nfs/proc.c	return p;
p	145	fs/nfs/proc.c	static int *xdr_decode_entry(int *p, struct nfs_entry *entry)
p	147	fs/nfs/proc.c	entry->fileid = ntohl(*p++);
p	148	fs/nfs/proc.c	if (!(p = xdr_decode_string(p, entry->name, NFS_MAXNAMLEN)))
p	150	fs/nfs/proc.c	entry->cookie = ntohl(*p++);
p	152	fs/nfs/proc.c	return p;
p	155	fs/nfs/proc.c	static int *xdr_decode_fsinfo(int *p, struct nfs_fsinfo *res)
p	157	fs/nfs/proc.c	res->tsize = ntohl(*p++);
p	158	fs/nfs/proc.c	res->bsize = ntohl(*p++);
p	159	fs/nfs/proc.c	res->blocks = ntohl(*p++);
p	160	fs/nfs/proc.c	res->bfree = ntohl(*p++);
p	161	fs/nfs/proc.c	res->bavail = ntohl(*p++);
p	162	fs/nfs/proc.c	return p;
p	168	fs/nfs/proc.c	int *p, *p0;
p	172	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	173	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_GETATTR);
p	174	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	175	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	179	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	181	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	182	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	194	fs/nfs/proc.c	int *p, *p0;
p	198	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	199	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_SETATTR);
p	200	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	201	fs/nfs/proc.c	p = xdr_encode_sattr(p, sattr);
p	202	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	206	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	208	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	209	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	221	fs/nfs/proc.c	int *p, *p0;
p	229	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	230	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_LOOKUP);
p	231	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	232	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	233	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	237	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	239	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	240	fs/nfs/proc.c	p = xdr_decode_fhandle(p, fhandle);
p	241	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	253	fs/nfs/proc.c	int *p, *p0;
p	257	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	258	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_READLINK);
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	288	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	289	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_READ);
p	290	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	291	fs/nfs/proc.c	*p++ = htonl(offset);
p	292	fs/nfs/proc.c	*p++ = htonl(count);
p	293	fs/nfs/proc.c	*p++ = htonl(count); /* traditional, could be any value */
p	294	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	298	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	300	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	301	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	302	fs/nfs/proc.c	if (!(p = xdr_decode_data(p, data, &len, count))) {
p	318	fs/nfs/proc.c	int *p, *p0;
p	322	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	323	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_WRITE);
p	324	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	325	fs/nfs/proc.c	*p++ = htonl(offset); /* traditional, could be any value */
p	326	fs/nfs/proc.c	*p++ = htonl(offset);
p	327	fs/nfs/proc.c	*p++ = htonl(count); /* traditional, could be any value */
p	328	fs/nfs/proc.c	p = xdr_encode_data(p, data, count);
p	329	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	333	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	335	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	336	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	349	fs/nfs/proc.c	int *p, *p0;
p	353	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	354	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_CREATE);
p	355	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	356	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	357	fs/nfs/proc.c	p = xdr_encode_sattr(p, sattr);
p	358	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	362	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	364	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	365	fs/nfs/proc.c	p = xdr_decode_fhandle(p, fhandle);
p	366	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	377	fs/nfs/proc.c	int *p, *p0;
p	381	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	382	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_REMOVE);
p	383	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	384	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	385	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	389	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	391	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	404	fs/nfs/proc.c	int *p, *p0;
p	408	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	409	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_RENAME);
p	410	fs/nfs/proc.c	p = xdr_encode_fhandle(p, old_dir);
p	411	fs/nfs/proc.c	p = xdr_encode_string(p, old_name);
p	412	fs/nfs/proc.c	p = xdr_encode_fhandle(p, new_dir);
p	413	fs/nfs/proc.c	p = xdr_encode_string(p, new_name);
p	414	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	418	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	420	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	432	fs/nfs/proc.c	int *p, *p0;
p	436	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	437	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_LINK);
p	438	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	439	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	440	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	441	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	445	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	447	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	459	fs/nfs/proc.c	int *p, *p0;
p	463	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	464	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_SYMLINK);
p	465	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	466	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	467	fs/nfs/proc.c	p = xdr_encode_string(p, path);
p	468	fs/nfs/proc.c	p = xdr_encode_sattr(p, sattr);
p	469	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	473	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	475	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	488	fs/nfs/proc.c	int *p, *p0;
p	492	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	493	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_MKDIR);
p	494	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	495	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	496	fs/nfs/proc.c	p = xdr_encode_sattr(p, sattr);
p	497	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	501	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	503	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	504	fs/nfs/proc.c	p = xdr_decode_fhandle(p, fhandle);
p	505	fs/nfs/proc.c	p = xdr_decode_fattr(p, fattr);
p	516	fs/nfs/proc.c	int *p, *p0;
p	520	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	521	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_RMDIR);
p	522	fs/nfs/proc.c	p = xdr_encode_fhandle(p, dir);
p	523	fs/nfs/proc.c	p = xdr_encode_string(p, name);
p	524	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	528	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	530	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	542	fs/nfs/proc.c	int *p, *p0;
p	550	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	551	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_READDIR);
p	552	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	553	fs/nfs/proc.c	*p++ = htonl(cookie);
p	554	fs/nfs/proc.c	*p++ = htonl(size);
p	555	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	559	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	561	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	562	fs/nfs/proc.c	for (i = 0; i < count && *p++; i++) {
p	563	fs/nfs/proc.c	if (!(p = xdr_decode_entry(p, entry++)))
p	566	fs/nfs/proc.c	if (!p) {
p	571	fs/nfs/proc.c	eof = (i == count && !*p++ && *p++)
p	572	fs/nfs/proc.c	|| (i < count && *p++);
p	588	fs/nfs/proc.c	int *p, *p0;
p	592	fs/nfs/proc.c	p = p0 = (int *) get_free_page(GFP_KERNEL);
p	593	fs/nfs/proc.c	p = nfs_rpc_header(p, NFSPROC_STATFS);
p	594	fs/nfs/proc.c	p = xdr_encode_fhandle(p, fhandle);
p	595	fs/nfs/proc.c	if ((status = nfs_rpc_call(server, p0, p)) < 0) {
p	599	fs/nfs/proc.c	if (!(p = nfs_rpc_verify(p0)))
p	601	fs/nfs/proc.c	else if ((status = ntohl(*p++)) == NFS_OK) {
p	602	fs/nfs/proc.c	p = xdr_decode_fsinfo(p, res);
p	615	fs/nfs/proc.c	static int *nfs_rpc_header(int *p, int procedure)
p	626	fs/nfs/proc.c	*p++ = htonl(++xid);
p	627	fs/nfs/proc.c	*p++ = htonl(RPC_CALL);
p	628	fs/nfs/proc.c	*p++ = htonl(RPC_VERSION);
p	629	fs/nfs/proc.c	*p++ = htonl(NFS_PROGRAM);
p	630	fs/nfs/proc.c	*p++ = htonl(NFS_VERSION);
p	631	fs/nfs/proc.c	*p++ = htonl(procedure);
p	632	fs/nfs/proc.c	*p++ = htonl(RPC_AUTH_UNIX);
p	633	fs/nfs/proc.c	p1 = p++;
p	634	fs/nfs/proc.c	*p++ = htonl(CURRENT_TIME); /* traditional, could be anything */
p	635	fs/nfs/proc.c	p = xdr_encode_string(p, sys);
p	636	fs/nfs/proc.c	*p++ = htonl(current->euid);
p	637	fs/nfs/proc.c	*p++ = htonl(current->egid);
p	638	fs/nfs/proc.c	p2 = p++;
p	640	fs/nfs/proc.c	*p++ = htonl(current->groups[i]);
p	642	fs/nfs/proc.c	*p1 = htonl((p - (p1 + 1)) << 2);
p	643	fs/nfs/proc.c	*p++ = htonl(RPC_AUTH_NULL);
p	644	fs/nfs/proc.c	*p++ = htonl(0);
p	645	fs/nfs/proc.c	return p;
p	648	fs/nfs/proc.c	static int *nfs_rpc_verify(int *p)
p	652	fs/nfs/proc.c	p++;
p	653	fs/nfs/proc.c	if ((n = ntohl(*p++)) != RPC_REPLY) {
p	657	fs/nfs/proc.c	if ((n = ntohl(*p++)) != RPC_MSG_ACCEPTED) {
p	661	fs/nfs/proc.c	switch (n = ntohl(*p++)) {
p	668	fs/nfs/proc.c	if ((n = ntohl(*p++)) > 400) {
p	672	fs/nfs/proc.c	p += (n + 3) >> 2;
p	673	fs/nfs/proc.c	if ((n = ntohl(*p++)) != RPC_SUCCESS) {
p	677	fs/nfs/proc.c	return p;
p	81	fs/proc/array.c	struct task_struct ** p;
p	83	fs/proc/array.c	p = task;
p	84	fs/proc/array.c	while (++p < task+NR_TASKS) {
p	85	fs/proc/array.c	if (*p && (*p)->pid == pid)
p	86	fs/proc/array.c	return p;
p	91	fs/proc/array.c	static unsigned long get_phys_addr(struct task_struct ** p, unsigned long ptr)
p	95	fs/proc/array.c	if (!p || !*p || ptr >= TASK_SIZE)
p	97	fs/proc/array.c	page = (*p)->tss.cr3;
p	112	fs/proc/array.c	static int get_array(struct task_struct ** p, unsigned long start, unsigned long end, char * buffer)
p	121	fs/proc/array.c	addr = get_phys_addr(p, start);
p	142	fs/proc/array.c	struct task_struct ** p = get_task(pid);
p	144	fs/proc/array.c	if (!p || !*p)
p	146	fs/proc/array.c	return get_array(p, (*p)->env_start, (*p)->env_end, buffer);
p	151	fs/proc/array.c	struct task_struct ** p = get_task(pid);
p	153	fs/proc/array.c	if (!p || !*p)
p	155	fs/proc/array.c	return get_array(p, (*p)->arg_start, (*p)->arg_end, buffer);
p	158	fs/proc/array.c	static unsigned long get_wchan(struct task_struct *p)
p	164	fs/proc/array.c	if (!p || p == current || p->state == TASK_RUNNING)
p	166	fs/proc/array.c	ebp = p->tss.ebp;
p	167	fs/proc/array.c	stack_page = p->kernel_stack_page;
p	182	fs/proc/array.c	struct task_struct ** p = get_task(pid);
p	187	fs/proc/array.c	if (!p || !*p)
p	189	fs/proc/array.c	if ((*p)->state < 0 || (*p)->state > 5)
p	192	fs/proc/array.c	state = "RSDZTD"[(*p)->state];
p	193	fs/proc/array.c	wchan = get_wchan(*p);
p	195	fs/proc/array.c	switch((int) (*p)->sigaction[i].sa_handler) {
p	201	fs/proc/array.c	tty_pgrp = (*p)->tty;
p	210	fs/proc/array.c	(*p)->comm,
p	212	fs/proc/array.c	(*p)->p_pptr->pid,
p	213	fs/proc/array.c	(*p)->pgrp,
p	214	fs/proc/array.c	(*p)->session,
p	215	fs/proc/array.c	(*p)->tty,
p	217	fs/proc/array.c	(*p)->flags,
p	218	fs/proc/array.c	(*p)->min_flt,
p	219	fs/proc/array.c	(*p)->cmin_flt,
p	220	fs/proc/array.c	(*p)->maj_flt,
p	221	fs/proc/array.c	(*p)->cmaj_flt,
p	222	fs/proc/array.c	(*p)->utime,
p	223	fs/proc/array.c	(*p)->stime,
p	224	fs/proc/array.c	(*p)->cutime,
p	225	fs/proc/array.c	(*p)->cstime,
p	226	fs/proc/array.c	(*p)->counter,  /* this is the kernel priority ---
p	228	fs/proc/array.c	(*p)->priority, /* this is the nice value ---
p	230	fs/proc/array.c	(*p)->timeout,
p	231	fs/proc/array.c	(*p)->it_real_value,
p	232	fs/proc/array.c	(*p)->start_time,
p	233	fs/proc/array.c	VSIZE((*p),(*p)->kernel_stack_page),
p	234	fs/proc/array.c	(*p)->rss, /* you might want to shift this left 3 */
p	235	fs/proc/array.c	(*p)->rlim[RLIMIT_RSS].rlim_cur,
p	236	fs/proc/array.c	(*p)->start_code,
p	237	fs/proc/array.c	(*p)->end_code,
p	238	fs/proc/array.c	(*p)->start_stack,
p	239	fs/proc/array.c	KSTK_ESP((*p)->kernel_stack_page),
p	240	fs/proc/array.c	KSTK_EIP((*p)->kernel_stack_page),
p	241	fs/proc/array.c	(*p)->signal,
p	242	fs/proc/array.c	(*p)->blocked,
p	250	fs/proc/array.c	struct task_struct ** p = get_task(pid);
p	255	fs/proc/array.c	if (!p || !*p)
p	257	fs/proc/array.c	tpag = (*p)->end_code / PAGE_SIZE;
p	258	fs/proc/array.c	if ((*p)->state != TASK_ZOMBIE) {
p	259	fs/proc/array.c	pagedir = (void *)((*p)->tss.cr3 + ((*p)->start_code >> 20));
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	112	fs/proc/fd.c	if (fd >= p->numlibraries)
p	124	fs/proc/fd.c	struct task_struct * p;
p	154	fs/proc/fd.c	if ((p = task[i]) && p->pid == pid)
p	161	fs/proc/fd.c	if (!p->filp[fd] || !p->filp[fd]->f_inode)
p	164	fs/proc/fd.c	if (fd >= p->numlibraries)
p	75	fs/proc/inode.c	struct task_struct * p;
p	88	fs/proc/inode.c	p = task[0];
p	90	fs/proc/inode.c	if ((p = task[i]) && (p->pid == pid))
p	92	fs/proc/inode.c	if (!p || i >= NR_TASKS)
p	113	fs/proc/inode.c	inode->i_uid = p->euid;
p	114	fs/proc/inode.c	inode->i_gid = p->egid;
p	149	fs/proc/inode.c	if (ino >= NR_OPEN || !p->filp[ino])
p	157	fs/proc/inode.c	if (ino >= p->numlibraries)
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	82	fs/proc/link.c	if (ino < p->numlibraries)
p	83	fs/proc/link.c	inode = p->libraries[ino].library;
p	126	fs/proc/root.c	struct task_struct * p;
p	151	fs/proc/root.c	p = task[nr];
p	152	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	274	include/linux/sched.h	extern void sleep_on(struct wait_queue ** p);
p	275	include/linux/sched.h	extern void interruptible_sleep_on(struct wait_queue ** p);
p	276	include/linux/sched.h	extern void wake_up(struct wait_queue ** p);
p	277	include/linux/sched.h	extern void wake_up_interruptible(struct wait_queue ** p);
p	279	include/linux/sched.h	extern int send_sig(unsigned long sig,struct task_struct * p,int priv);
p	359	include/linux/sched.h	extern inline void add_wait_queue(struct wait_queue ** p, struct wait_queue * wait)
p	372	include/linux/sched.h	if (!*p) {
p	374	include/linux/sched.h	*p = wait;
p	376	include/linux/sched.h	wait->next = (*p)->next;
p	377	include/linux/sched.h	(*p)->next = wait;
p	382	include/linux/sched.h	extern inline void remove_wait_queue(struct wait_queue ** p, struct wait_queue * wait)
p	391	include/linux/sched.h	if ((*p == wait) &&
p	395	include/linux/sched.h	((*p = wait->next) == wait)) {
p	396	include/linux/sched.h	*p = NULL;
p	402	include/linux/sched.h	if (tmp == *p)
p	413	include/linux/sched.h	printk("list = %08x, queue = %08x\n",p,wait);
p	420	include/linux/sched.h	extern inline void select_wait(struct wait_queue ** wait_address, select_table * p)
p	424	include/linux/sched.h	if (!p || !wait_address)
p	426	include/linux/sched.h	if (p->nr >= __MAX_SELECT_TABLE_ENTRIES)
p	428	include/linux/sched.h	entry = p->entry + p->nr;
p	433	include/linux/sched.h	p->nr++;
p	460	include/linux/sched.h	#define REMOVE_LINKS(p) \
p	461	include/linux/sched.h	if ((p)->p_osptr) \
p	462	include/linux/sched.h	(p)->p_osptr->p_ysptr = (p)->p_ysptr; \
p	463	include/linux/sched.h	if ((p)->p_ysptr) \
p	464	include/linux/sched.h	(p)->p_ysptr->p_osptr = (p)->p_osptr; \
p	466	include/linux/sched.h	(p)->p_pptr->p_cptr = (p)->p_osptr
p	468	include/linux/sched.h	#define SET_LINKS(p) \
p	469	include/linux/sched.h	(p)->p_ysptr = NULL; \
p	470	include/linux/sched.h	if (((p)->p_osptr = (p)->p_pptr->p_cptr) != NULL) \
p	471	include/linux/sched.h	(p)->p_osptr->p_ysptr = p; \
p	472	include/linux/sched.h	(p)->p_pptr->p_cptr = p
p	213	kernel/blk_drv/blk.h	struct task_struct * p;
p	243	kernel/blk_drv/blk.h	if ((p = req->waiting) != NULL) {
p	245	kernel/blk_drv/blk.h	p->state = TASK_RUNNING;
p	246	kernel/blk_drv/blk.h	if (p->counter > current->counter)
p	39	kernel/blk_drv/genhd.c	struct partition *p;
p	58	kernel/blk_drv/genhd.c	p = 0x1BE + (void *)bh->b_data;
p	63	kernel/blk_drv/genhd.c	if (p->sys_ind == EXTENDED_PARTITION ||
p	64	kernel/blk_drv/genhd.c	!(hd->part[current_minor].nr_sects = p->nr_sects))
p	66	kernel/blk_drv/genhd.c	hd->part[current_minor].start_sect = this_sector + p->start_sect;
p	71	kernel/blk_drv/genhd.c	p++;
p	79	kernel/blk_drv/genhd.c	if (p->sys_ind != EXTENDED_PARTITION ||
p	80	kernel/blk_drv/genhd.c	!(hd->part[current_minor].nr_sects = p->nr_sects))
p	82	kernel/blk_drv/genhd.c	hd->part[current_minor].start_sect = first_sector + p->start_sect;
p	83	kernel/blk_drv/genhd.c	this_sector = first_sector + p->start_sect;
p	98	kernel/blk_drv/genhd.c	struct partition *p;
p	113	kernel/blk_drv/genhd.c	p = 0x1BE + (void *)bh->b_data;
p	114	kernel/blk_drv/genhd.c	for (i=1 ; i<=4 ; minor++,i++,p++) {
p	115	kernel/blk_drv/genhd.c	if (!(hd->part[minor].nr_sects = p->nr_sects))
p	117	kernel/blk_drv/genhd.c	hd->part[minor].start_sect = first_sector + p->start_sect;
p	121	kernel/blk_drv/genhd.c	if (p->sys_ind == EXTENDED_PARTITION) {
p	131	kernel/blk_drv/genhd.c	p = 0x1BE + (void *)bh->b_data;
p	133	kernel/blk_drv/genhd.c	p--;
p	136	kernel/blk_drv/genhd.c	if (!(p->start_sect && p->nr_sects))
p	138	kernel/blk_drv/genhd.c	hd->part[current_minor].start_sect = p->start_sect;
p	139	kernel/blk_drv/genhd.c	hd->part[current_minor].nr_sects = p->nr_sects;
p	200	kernel/blk_drv/genhd.c	struct gendisk *p;
p	207	kernel/blk_drv/genhd.c	for (p = gendisk_head ; p ; p=p->next) {
p	208	kernel/blk_drv/genhd.c	setup_dev(p);
p	209	kernel/blk_drv/genhd.c	nr += p->nr_real;
p	90	kernel/blk_drv/scsi/aha1542.h	#define any2scsi(up, p)        \
p	91	kernel/blk_drv/scsi/aha1542.h	(up)[0] = (((unsigned long)(p)) >> 16)  ;  \
p	92	kernel/blk_drv/scsi/aha1542.h	(up)[1] = (((unsigned long)(p)) >> 8);    \
p	93	kernel/blk_drv/scsi/aha1542.h	(up)[2] = ((unsigned long)(p));
p	97	kernel/blk_drv/scsi/aha1542.h	#define xany2scsi(up, p)  \
p	98	kernel/blk_drv/scsi/aha1542.h	(up)[0] = ((long)(p)) >> 24;  \
p	99	kernel/blk_drv/scsi/aha1542.h	(up)[1] = ((long)(p)) >> 16;  \
p	100	kernel/blk_drv/scsi/aha1542.h	(up)[2] = ((long)(p)) >> 8;  \
p	101	kernel/blk_drv/scsi/aha1542.h	(up)[3] = ((long)(p));
p	89	kernel/blk_drv/scsi/aha1740.h	#define any2scsi(up, p)        \
p	90	kernel/blk_drv/scsi/aha1740.h	(up)[0] = (((unsigned long)(p)) >> 16)  ;  \
p	91	kernel/blk_drv/scsi/aha1740.h	(up)[1] = (((unsigned long)(p)) >> 8);    \
p	92	kernel/blk_drv/scsi/aha1740.h	(up)[2] = ((unsigned long)(p));
p	96	kernel/blk_drv/scsi/aha1740.h	#define xany2scsi(up, p)  \
p	97	kernel/blk_drv/scsi/aha1740.h	(up)[0] = ((long)(p)) >> 24;  \
p	98	kernel/blk_drv/scsi/aha1740.h	(up)[1] = ((long)(p)) >> 16;  \
p	99	kernel/blk_drv/scsi/aha1740.h	(up)[2] = ((long)(p)) >> 8;  \
p	100	kernel/blk_drv/scsi/aha1740.h	(up)[3] = ((long)(p));
p	451	kernel/blk_drv/scsi/scsi.h	struct task_struct * p;
p	483	kernel/blk_drv/scsi/scsi.h	if ((p = req->waiting) != NULL) {
p	485	kernel/blk_drv/scsi/scsi.h	p->state = TASK_RUNNING;
p	486	kernel/blk_drv/scsi/scsi.h	if (p->counter > current->counter)
p	140	kernel/blk_drv/scsi/scsi_debug.c	struct partition * p;
p	239	kernel/blk_drv/scsi/scsi_debug.c	p = (struct partition* ) (buff + 0x1be);
p	242	kernel/blk_drv/scsi/scsi_debug.c	p->start_sect = starts[npart];
p	243	kernel/blk_drv/scsi/scsi_debug.c	p->nr_sects = starts[npart+1] - starts [npart];
p	244	kernel/blk_drv/scsi/scsi_debug.c	p->sys_ind = 0x81;  /* Linux partition */
p	245	kernel/blk_drv/scsi/scsi_debug.c	p++;
p	76	kernel/blk_drv/scsi/scsi_ioctl.c	struct task_struct * p;
p	81	kernel/blk_drv/scsi/scsi_ioctl.c	if ((p = req->waiting) != NULL) {
p	83	kernel/blk_drv/scsi/scsi_ioctl.c	p->state = TASK_RUNNING;
p	84	kernel/blk_drv/scsi/scsi_ioctl.c	if (p->counter > current->counter)
p	657	kernel/blk_drv/scsi/sd.c	struct task_struct * p;
p	662	kernel/blk_drv/scsi/sd.c	if ((p = req->waiting) != NULL) {
p	664	kernel/blk_drv/scsi/sd.c	p->state = TASK_RUNNING;
p	665	kernel/blk_drv/scsi/sd.c	if (p->counter > current->counter)
p	615	kernel/blk_drv/scsi/sr.c	struct task_struct * p;
p	620	kernel/blk_drv/scsi/sr.c	if ((p = req->waiting) != NULL) {
p	622	kernel/blk_drv/scsi/sr.c	p->state = TASK_RUNNING;
p	623	kernel/blk_drv/scsi/sr.c	if (p->counter > current->counter)
p	23	kernel/blk_drv/scsi/sr_ioctl.c	struct task_struct * p;
p	28	kernel/blk_drv/scsi/sr_ioctl.c	if ((p = req->waiting) != NULL) {
p	30	kernel/blk_drv/scsi/sr_ioctl.c	p->state = TASK_RUNNING;
p	31	kernel/blk_drv/scsi/sr_ioctl.c	if (p->counter > current->counter)
p	107	kernel/blk_drv/scsi/wd7000.h	#define any2scsi(up, p)      \
p	108	kernel/blk_drv/scsi/wd7000.h	(up)[0] = (((long)(p)) >> 16);  \
p	109	kernel/blk_drv/scsi/wd7000.h	(up)[1] = ((long)(p)) >> 8;    \
p	110	kernel/blk_drv/scsi/wd7000.h	(up)[2] = ((long)(p));
p	114	kernel/blk_drv/scsi/wd7000.h	#define xany2scsi(up, p)  \
p	115	kernel/blk_drv/scsi/wd7000.h	(up)[0] = ((long)(p)) >> 24;  \
p	116	kernel/blk_drv/scsi/wd7000.h	(up)[1] = ((long)(p)) >> 16;  \
p	117	kernel/blk_drv/scsi/wd7000.h	(up)[2] = ((long)(p)) >> 8;  \
p	118	kernel/blk_drv/scsi/wd7000.h	(up)[3] = ((long)(p));
p	599	kernel/chr_drv/console.c	static void respond_string(char * p, int currcons, struct tty_struct * tty)
p	601	kernel/chr_drv/console.c	while (*p) {
p	602	kernel/chr_drv/console.c	put_tty_queue(*p, &tty->read_q);
p	603	kernel/chr_drv/console.c	p++;
p	645	kernel/chr_drv/console.c	unsigned char *p;
p	648	kernel/chr_drv/console.c	for (p = (unsigned char *)origin+1; p < (unsigned char *)scr_end; p+=2)
p	649	kernel/chr_drv/console.c	*p = (*p & 0x88) | (((*p >> 4) | (*p << 4)) & 0x77);
p	651	kernel/chr_drv/console.c	for (p = (unsigned char *)origin+1; p < (unsigned char *)scr_end; p+=2)
p	652	kernel/chr_drv/console.c	*p ^= *p & 0x07 == 1 ? 0x70 : 0x77;
p	740	kernel/chr_drv/console.c	unsigned short * p = (unsigned short *) pos;
p	743	kernel/chr_drv/console.c	tmp = *p;
p	744	kernel/chr_drv/console.c	*p = old;
p	746	kernel/chr_drv/console.c	p++;
p	760	kernel/chr_drv/console.c	unsigned short * p = (unsigned short *) pos;
p	763	kernel/chr_drv/console.c	*p = *(p+1);
p	764	kernel/chr_drv/console.c	p++;
p	766	kernel/chr_drv/console.c	*p = video_erase_char;
p	34	kernel/chr_drv/mem.c	unsigned long p = file->f_pos;
p	46	kernel/chr_drv/mem.c	if (p >= high_memory)
p	48	kernel/chr_drv/mem.c	if (count > high_memory - p)
p	49	kernel/chr_drv/mem.c	count = high_memory - p;
p	52	kernel/chr_drv/mem.c	if (p < sizeof(struct user) && count > 0) {
p	54	kernel/chr_drv/mem.c	if (p + count1 > sizeof(struct user))
p	55	kernel/chr_drv/mem.c	count1 = sizeof(struct user)-p;
p	56	kernel/chr_drv/mem.c	pnt = (char *) &dump + p;
p	59	kernel/chr_drv/mem.c	p += count1;
p	64	kernel/chr_drv/mem.c	while (p < (4096 + 4096) && count > 0) {
p	67	kernel/chr_drv/mem.c	p++;
p	71	kernel/chr_drv/mem.c	memcpy_tofs(buf,(void *) (p - 4096),count);
p	79	kernel/chr_drv/mem.c	unsigned long p = file->f_pos;
p	84	kernel/chr_drv/mem.c	if (p >= high_memory)
p	86	kernel/chr_drv/mem.c	if (count > high_memory - p)
p	87	kernel/chr_drv/mem.c	count = high_memory - p;
p	89	kernel/chr_drv/mem.c	while (p < 4096 && count > 0) {
p	92	kernel/chr_drv/mem.c	p++;
p	96	kernel/chr_drv/mem.c	memcpy_tofs(buf,(void *) p,count);
p	104	kernel/chr_drv/mem.c	unsigned long p = file->f_pos;
p	109	kernel/chr_drv/mem.c	if (p >= high_memory)
p	111	kernel/chr_drv/mem.c	if (count > high_memory - p)
p	112	kernel/chr_drv/mem.c	count = high_memory - p;
p	114	kernel/chr_drv/mem.c	while (p < 4096 && count > 0) {
p	117	kernel/chr_drv/mem.c	p++;
p	121	kernel/chr_drv/mem.c	memcpy_fromfs((void *) p,buf,count);
p	129	kernel/chr_drv/tty_io.c	unsigned char  *p = bufp;
p	137	kernel/chr_drv/tty_io.c	*p++ =  tty->read_q.buf[tail++];
p	234	kernel/chr_drv/tty_io.c	struct task_struct **p;
p	259	kernel/chr_drv/tty_io.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	260	kernel/chr_drv/tty_io.c	if ((*p) && (*p)->tty == tty->line)
p	261	kernel/chr_drv/tty_io.c	(*p)->tty = -1;
p	1087	kernel/chr_drv/tty_io.c	struct task_struct **p;
p	1139	kernel/chr_drv/tty_io.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	1140	kernel/chr_drv/tty_io.c	if ((*p) && (*p)->tty == tty->line)
p	1141	kernel/chr_drv/tty_io.c	(*p)->tty = -1;
p	1329	kernel/chr_drv/tty_io.c	struct task_struct **p;
p	1337	kernel/chr_drv/tty_io.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	1338	kernel/chr_drv/tty_io.c	if (!(*p))
p	1340	kernel/chr_drv/tty_io.c	if (((*p)->tty == line) ||
p	1341	kernel/chr_drv/tty_io.c	((session > 0) && ((*p)->session == session)))
p	1342	kernel/chr_drv/tty_io.c	send_sig(SIGKILL, *p, 1);
p	1345	kernel/chr_drv/tty_io.c	filp = (*p)->filp[i];
p	1348	kernel/chr_drv/tty_io.c	send_sig(SIGKILL, *p, 1);
p	1376	kernel/chr_drv/tty_io.c	char *p;
p	1389	kernel/chr_drv/tty_io.c	p = bufp;
p	1392	kernel/chr_drv/tty_io.c	tty->write_q.buf[head++] = *p++;
p	1398	kernel/chr_drv/tty_io.c	tty->write_data_ptr = p;
p	1418	kernel/chr_drv/tty_io.c	unsigned char * p;
p	1435	kernel/chr_drv/tty_io.c	p = tty->write_data_ptr;
p	1438	kernel/chr_drv/tty_io.c	tty->write_q.buf[head++] = *p++;
p	1442	kernel/chr_drv/tty_io.c	tty->write_data_ptr = p;
p	103	kernel/chr_drv/tty_ioctl.c	struct task_struct **p;
p	110	kernel/chr_drv/tty_ioctl.c	for (p = &FIRST_TASK ; p <= &LAST_TASK ; p++, n++)
p	111	kernel/chr_drv/tty_ioctl.c	if (*p)
p	113	kernel/chr_drv/tty_ioctl.c	c = (char *)(*p);
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	23	kernel/exit.c	int send_sig(unsigned long sig,struct task_struct * p,int priv)
p	25	kernel/exit.c	if (!p || sig > 32)
p	27	kernel/exit.c	if (!priv && ((sig != SIGCONT) || (current->session != p->session)) &&
p	28	kernel/exit.c	(current->euid != p->euid) && (current->uid != p->uid) && !suser())
p	33	kernel/exit.c	if (p->state == TASK_STOPPED)
p	34	kernel/exit.c	p->state = TASK_RUNNING;
p	35	kernel/exit.c	p->exit_code = 0;
p	36	kernel/exit.c	p->signal &= ~( (1<<(SIGSTOP-1)) | (1<<(SIGTSTP-1)) |
p	41	kernel/exit.c	p->signal &= ~(1<<(SIGCONT-1));
p	43	kernel/exit.c	p->signal |= (1<<(sig-1));
p	44	kernel/exit.c	if (p->flags & PF_PTRACED) {
p	46	kernel/exit.c	p->exit_code = sig;
p	49	kernel/exit.c	if (p->p_pptr != NULL && p->p_pptr->state == TASK_INTERRUPTIBLE)
p	50	kernel/exit.c	p->p_pptr->state = TASK_RUNNING;
p	53	kernel/exit.c	if (p->state == TASK_INTERRUPTIBLE || p->state == TASK_RUNNING)
p	54	kernel/exit.c	p->state = TASK_STOPPED;
p	59	kernel/exit.c	void release(struct task_struct * p)
p	63	kernel/exit.c	if (!p)
p	65	kernel/exit.c	if (p == current) {
p	70	kernel/exit.c	if (task[i] == p) {
p	72	kernel/exit.c	REMOVE_LINKS(p);
p	73	kernel/exit.c	free_page(p->kernel_stack_page);
p	74	kernel/exit.c	free_page((long) p);
p	85	kernel/exit.c	int bad_task_ptr(struct task_struct *p)
p	89	kernel/exit.c	if (!p)
p	92	kernel/exit.c	if (task[i] == p)
p	180	kernel/exit.c	struct task_struct **p;
p	184	kernel/exit.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	185	kernel/exit.c	if (!*p || (*p)->session <= 0)
p	187	kernel/exit.c	if ((*p)->pgrp == pgrp)
p	188	kernel/exit.c	return (*p)->session;
p	189	kernel/exit.c	if ((*p)->pid == pgrp)
p	190	kernel/exit.c	fallback = (*p)->session;
p	201	kernel/exit.c	struct task_struct **p;
p	207	kernel/exit.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p)
p	208	kernel/exit.c	if (*p && (*p)->pgrp == pgrp) {
p	209	kernel/exit.c	if ((err = send_sig(sig,*p,priv)) != 0)
p	224	kernel/exit.c	struct task_struct **p;
p	230	kernel/exit.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p)
p	231	kernel/exit.c	if (*p && (*p)->session == sess && (*p)->leader) {
p	232	kernel/exit.c	if ((err = send_sig(sig,*p,priv)) != 0)
p	242	kernel/exit.c	struct task_struct **p;
p	246	kernel/exit.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p)
p	247	kernel/exit.c	if (*p && (*p)->pid == pid)
p	248	kernel/exit.c	return send_sig(sig,*p,priv);
p	258	kernel/exit.c	struct task_struct **p = NR_TASKS + task;
p	264	kernel/exit.c	while (--p > &FIRST_TASK)
p	265	kernel/exit.c	if (*p && (*p)->pid > 1 && *p != current) {
p	267	kernel/exit.c	if ((err = send_sig(sig,*p,0)) != -EPERM)
p	288	kernel/exit.c	struct task_struct **p;
p	290	kernel/exit.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	291	kernel/exit.c	if (!(*p) ||
p	292	kernel/exit.c	((*p)->pgrp != pgrp) ||
p	293	kernel/exit.c	((*p)->state == TASK_ZOMBIE) ||
p	294	kernel/exit.c	((*p)->p_pptr->pid == 1))
p	296	kernel/exit.c	if (((*p)->p_pptr->pgrp != pgrp) &&
p	297	kernel/exit.c	((*p)->p_pptr->session == (*p)->session))
p	305	kernel/exit.c	struct task_struct ** p;
p	307	kernel/exit.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	308	kernel/exit.c	if (!*p || (*p)->pgrp != pgrp)
p	310	kernel/exit.c	if ((*p)->state == TASK_STOPPED)
p	318	kernel/exit.c	struct task_struct ** p;
p	320	kernel/exit.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p)
p	321	kernel/exit.c	if (*p && (*p)->p_opptr == father)
p	323	kernel/exit.c	(*p)->p_opptr = task[1];
p	325	kernel/exit.c	(*p)->p_opptr = task[0];
p	330	kernel/exit.c	struct task_struct *p;
p	379	kernel/exit.c	while ((p = current->p_cptr) != NULL) {
p	380	kernel/exit.c	current->p_cptr = p->p_osptr;
p	381	kernel/exit.c	p->p_ysptr = NULL;
p	382	kernel/exit.c	p->flags &= ~(PF_PTRACED|PF_TRACESYS);
p	384	kernel/exit.c	p->p_pptr = task[1];
p	386	kernel/exit.c	p->p_pptr = task[0];
p	387	kernel/exit.c	p->p_osptr = p->p_pptr->p_cptr;
p	388	kernel/exit.c	p->p_osptr->p_ysptr = p;
p	389	kernel/exit.c	p->p_pptr->p_cptr = p;
p	390	kernel/exit.c	if (p->state == TASK_ZOMBIE)
p	391	kernel/exit.c	send_sig(SIGCHLD,p->p_pptr,1);
p	398	kernel/exit.c	if ((p->pgrp != current->pgrp) &&
p	399	kernel/exit.c	(p->session == current->session) &&
p	400	kernel/exit.c	is_orphaned_pgrp(p->pgrp) &&
p	401	kernel/exit.c	has_stopped_jobs(p->pgrp)) {
p	402	kernel/exit.c	kill_pg(p->pgrp,SIGHUP,1);
p	403	kernel/exit.c	kill_pg(p->pgrp,SIGCONT,1);
p	407	kernel/exit.c	struct task_struct **p;
p	419	kernel/exit.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p)
p	420	kernel/exit.c	if (*p && (*p)->session == current->session)
p	421	kernel/exit.c	(*p)->tty = -1;
p	453	kernel/exit.c	struct task_struct *p;
p	464	kernel/exit.c	for (p = current->p_cptr ; p ; p = p->p_osptr) {
p	466	kernel/exit.c	if (p->pid != pid)
p	469	kernel/exit.c	if (p->pgrp != current->pgrp)
p	472	kernel/exit.c	if (p->pgrp != -pid)
p	475	kernel/exit.c	switch (p->state) {
p	477	kernel/exit.c	if (!p->exit_code)
p	479	kernel/exit.c	if (!(options & WUNTRACED) && !(p->flags & PF_PTRACED))
p	482	kernel/exit.c	put_fs_long((p->exit_code << 8) | 0x7f,
p	484	kernel/exit.c	p->exit_code = 0;
p	486	kernel/exit.c	getrusage(p, RUSAGE_BOTH, ru);
p	487	kernel/exit.c	return p->pid;
p	489	kernel/exit.c	current->cutime += p->utime + p->cutime;
p	490	kernel/exit.c	current->cstime += p->stime + p->cstime;
p	491	kernel/exit.c	current->cmin_flt += p->min_flt + p->cmin_flt;
p	492	kernel/exit.c	current->cmaj_flt += p->maj_flt + p->cmaj_flt;
p	494	kernel/exit.c	getrusage(p, RUSAGE_BOTH, ru);
p	495	kernel/exit.c	flag = p->pid;
p	497	kernel/exit.c	put_fs_long(p->exit_code, stat_addr);
p	498	kernel/exit.c	if (p->p_opptr != p->p_pptr) {
p	499	kernel/exit.c	REMOVE_LINKS(p);
p	500	kernel/exit.c	p->p_pptr = p->p_opptr;
p	501	kernel/exit.c	SET_LINKS(p);
p	502	kernel/exit.c	send_sig(SIGCHLD,p->p_pptr,1);
p	504	kernel/exit.c	release(p);
p	61	kernel/fork.c	#define copy_vm(p) (IS_CLONE?clone_page_tables:copy_page_tables)(p)
p	73	kernel/fork.c	struct task_struct *p;
p	77	kernel/fork.c	p = (struct task_struct *) get_free_page(GFP_KERNEL);
p	78	kernel/fork.c	if (!p)
p	82	kernel/fork.c	free_page((unsigned long) p);
p	85	kernel/fork.c	task[nr] = p;
p	86	kernel/fork.c	*p = *current;
p	87	kernel/fork.c	p->kernel_stack_page = 0;
p	88	kernel/fork.c	p->state = TASK_UNINTERRUPTIBLE;
p	89	kernel/fork.c	p->flags &= ~(PF_PTRACED|PF_TRACESYS);
p	90	kernel/fork.c	p->pid = last_pid;
p	91	kernel/fork.c	if (p->pid > 1)
p	92	kernel/fork.c	p->swappable = 1;
p	93	kernel/fork.c	p->p_pptr = p->p_opptr = current;
p	94	kernel/fork.c	p->p_cptr = NULL;
p	95	kernel/fork.c	SET_LINKS(p);
p	96	kernel/fork.c	p->signal = 0;
p	97	kernel/fork.c	p->it_real_value = p->it_virt_value = p->it_prof_value = 0;
p	98	kernel/fork.c	p->it_real_incr = p->it_virt_incr = p->it_prof_incr = 0;
p	99	kernel/fork.c	p->leader = 0;    /* process leadership doesn't inherit */
p	100	kernel/fork.c	p->utime = p->stime = 0;
p	101	kernel/fork.c	p->cutime = p->cstime = 0;
p	102	kernel/fork.c	p->min_flt = p->maj_flt = 0;
p	103	kernel/fork.c	p->cmin_flt = p->cmaj_flt = 0;
p	104	kernel/fork.c	p->start_time = jiffies;
p	105	kernel/fork.c	p->tss.back_link = 0;
p	106	kernel/fork.c	p->tss.ss0 = 0x10;
p	107	kernel/fork.c	p->tss.eip = eip;
p	108	kernel/fork.c	p->tss.eflags = eflags & 0xffffcfff;  /* iopl is always 0 for a new process */
p	109	kernel/fork.c	p->tss.eax = 0;
p	110	kernel/fork.c	p->tss.ecx = ecx;
p	111	kernel/fork.c	p->tss.edx = edx;
p	112	kernel/fork.c	p->tss.ebx = ebx;
p	113	kernel/fork.c	p->tss.esp = esp;
p	115	kernel/fork.c	p->tss.esp = ebx;
p	116	kernel/fork.c	p->tss.ebp = ebp;
p	117	kernel/fork.c	p->tss.esi = esi;
p	118	kernel/fork.c	p->tss.edi = edi;
p	119	kernel/fork.c	p->tss.es = es & 0xffff;
p	120	kernel/fork.c	p->tss.cs = cs & 0xffff;
p	121	kernel/fork.c	p->tss.ss = ss & 0xffff;
p	122	kernel/fork.c	p->tss.ds = ds & 0xffff;
p	123	kernel/fork.c	p->tss.fs = fs & 0xffff;
p	124	kernel/fork.c	p->tss.gs = gs & 0xffff;
p	125	kernel/fork.c	p->tss.ldt = _LDT(nr);
p	126	kernel/fork.c	p->tss.trace_bitmap = offsetof(struct tss_struct,io_bitmap) << 16;
p	128	kernel/fork.c	p->tss.io_bitmap[i] = ~0;
p	130	kernel/fork.c	__asm__("clts ; fnsave %0 ; frstor %0"::"m" (p->tss.i387));
p	131	kernel/fork.c	p->kernel_stack_page = get_free_page(GFP_KERNEL);
p	132	kernel/fork.c	if (!p->kernel_stack_page || copy_vm(p)) {
p	134	kernel/fork.c	REMOVE_LINKS(p);
p	135	kernel/fork.c	free_page(p->kernel_stack_page);
p	136	kernel/fork.c	free_page((long) p);
p	139	kernel/fork.c	p->tss.esp0 = PAGE_SIZE + p->kernel_stack_page;
p	141	kernel/fork.c	if ((f = p->filp[i]) != NULL)
p	152	kernel/fork.c	set_tss_desc(gdt+(nr<<1)+FIRST_TSS_ENTRY,&(p->tss));
p	153	kernel/fork.c	set_ldt_desc(gdt+(nr<<1)+FIRST_LDT_ENTRY,&(p->ldt));
p	154	kernel/fork.c	p->counter = current->counter >> 1;
p	155	kernel/fork.c	p->state = TASK_RUNNING;  /* do this last, just in case */
p	156	kernel/fork.c	return p->pid;
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	152	kernel/printk.c	int  p = log_start;
p	158	kernel/printk.c	buf[j++] = log_buf[p];
p	159	kernel/printk.c	p++; p &= 4095;
p	105	kernel/sched.c	struct task_struct ** p;
p	110	kernel/sched.c	for(p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	111	kernel/sched.c	if (!*p || ((*p)->state != TASK_INTERRUPTIBLE))
p	113	kernel/sched.c	if ((*p)->timeout && (*p)->timeout < jiffies) {
p	114	kernel/sched.c	(*p)->timeout = 0;
p	115	kernel/sched.c	(*p)->state = TASK_RUNNING;
p	116	kernel/sched.c	} else if ((*p)->signal & ~(*p)->blocked)
p	117	kernel/sched.c	(*p)->state = TASK_RUNNING;
p	126	kernel/sched.c	p = &task[NR_TASKS];
p	128	kernel/sched.c	if (!*--p)
p	130	kernel/sched.c	if ((*p)->state == TASK_RUNNING && (*p)->counter > c)
p	131	kernel/sched.c	c = (*p)->counter, next = i;
p	135	kernel/sched.c	for(p = &LAST_TASK ; p > &FIRST_TASK ; --p)
p	136	kernel/sched.c	if (*p)
p	137	kernel/sched.c	(*p)->counter = ((*p)->counter >> 1) +
p	138	kernel/sched.c	(*p)->priority;
p	162	kernel/sched.c	struct task_struct * p;
p	167	kernel/sched.c	if ((p = tmp->task) != NULL) {
p	168	kernel/sched.c	if ((p->state == TASK_UNINTERRUPTIBLE) ||
p	169	kernel/sched.c	(p->state == TASK_INTERRUPTIBLE)) {
p	170	kernel/sched.c	p->state = TASK_RUNNING;
p	171	kernel/sched.c	if (p->counter > current->counter)
p	189	kernel/sched.c	struct task_struct * p;
p	194	kernel/sched.c	if ((p = tmp->task) != NULL) {
p	195	kernel/sched.c	if (p->state == TASK_INTERRUPTIBLE) {
p	196	kernel/sched.c	p->state = TASK_RUNNING;
p	197	kernel/sched.c	if (p->counter > current->counter)
p	212	kernel/sched.c	static inline void __sleep_on(struct wait_queue **p, int state)
p	217	kernel/sched.c	if (!p)
p	222	kernel/sched.c	add_wait_queue(p, &wait);
p	226	kernel/sched.c	remove_wait_queue(p, &wait);
p	230	kernel/sched.c	void interruptible_sleep_on(struct wait_queue **p)
p	232	kernel/sched.c	__sleep_on(p,TASK_INTERRUPTIBLE);
p	235	kernel/sched.c	void sleep_on(struct wait_queue **p)
p	237	kernel/sched.c	__sleep_on(p,TASK_UNINTERRUPTIBLE);
p	312	kernel/sched.c	struct timer_list * p;
p	322	kernel/sched.c	for (p = timer_list ; p < timer_list + TIME_REQUESTS ; p++)
p	323	kernel/sched.c	if (!p->fn)
p	325	kernel/sched.c	if (p >= timer_list + TIME_REQUESTS)
p	327	kernel/sched.c	p->fn = fn;
p	328	kernel/sched.c	p->jiffies = jiffies;
p	329	kernel/sched.c	p->next = next_timer;
p	330	kernel/sched.c	next_timer = p;
p	331	kernel/sched.c	while (p->next && p->next->jiffies < p->jiffies) {
p	332	kernel/sched.c	p->jiffies -= p->next->jiffies;
p	333	kernel/sched.c	fn = p->fn;
p	334	kernel/sched.c	p->fn = p->next->fn;
p	335	kernel/sched.c	p->next->fn = fn;
p	336	kernel/sched.c	jiffies = p->jiffies;
p	337	kernel/sched.c	p->jiffies = p->next->jiffies;
p	338	kernel/sched.c	p->next->jiffies = jiffies;
p	339	kernel/sched.c	p = p->next;
p	341	kernel/sched.c	if (p->next)
p	342	kernel/sched.c	p->next->jiffies -= p->jiffies;
p	363	kernel/sched.c	struct task_struct **p;
p	366	kernel/sched.c	for(p = &LAST_TASK; p > &FIRST_TASK; --p)
p	367	kernel/sched.c	if (*p && (*p)->state == TASK_RUNNING)
p	513	kernel/sched.c	static void show_task(int nr,struct task_struct * p)
p	518	kernel/sched.c	printk("%d: pid=%d, state=%d, father=%d, child=%d, ",(p == current)?-nr:nr,p->pid,
p	519	kernel/sched.c	p->state, p->p_pptr->pid, p->p_cptr ? p->p_cptr->pid : -1);
p	522	kernel/sched.c	if (!(stack = (char *) p->kernel_stack_page)) {
p	529	kernel/sched.c	printk("   PC=%08X.", *(1019 + (unsigned long *) p));
p	530	kernel/sched.c	if (p->p_ysptr || p->p_osptr)
p	532	kernel/sched.c	p->p_ysptr ? p->p_ysptr->pid : -1,
p	533	kernel/sched.c	p->p_osptr ? p->p_osptr->pid : -1);
p	551	kernel/sched.c	struct desc_struct * p;
p	558	kernel/sched.c	p = gdt+2+FIRST_TSS_ENTRY;
p	561	kernel/sched.c	p->a=p->b=0;
p	562	kernel/sched.c	p++;
p	563	kernel/sched.c	p->a=p->b=0;
p	564	kernel/sched.c	p++;
p	83	kernel/signal.c	struct sigaction *p;
p	85	kernel/signal.c	p = signum - 1 + current->sigaction;
p	86	kernel/signal.c	if (p->sa_handler == SIG_IGN) {
p	92	kernel/signal.c	if (p->sa_handler == SIG_DFL) {
p	119	kernel/signal.c	struct sigaction new, *p;
p	123	kernel/signal.c	p = signum - 1 + current->sigaction;
p	135	kernel/signal.c	memcpy_tofs(oldaction, p, sizeof(struct sigaction));
p	138	kernel/signal.c	*p = new;
p	38	kernel/sys.c	static int proc_sel(struct task_struct *p, int which, int who)
p	42	kernel/sys.c	if (!who && p == current)
p	44	kernel/sys.c	return(p->pid == who);
p	48	kernel/sys.c	return(p->pgrp == who);
p	52	kernel/sys.c	return(p->uid == who);
p	59	kernel/sys.c	struct task_struct **p;
p	69	kernel/sys.c	for(p = &LAST_TASK; p > &FIRST_TASK; --p) {
p	70	kernel/sys.c	if (!*p || !proc_sel(*p, which, who))
p	72	kernel/sys.c	if ((*p)->uid != current->euid &&
p	73	kernel/sys.c	(*p)->uid != current->uid && !suser()) {
p	79	kernel/sys.c	if (priority > (*p)->priority && !suser())
p	82	kernel/sys.c	(*p)->priority = priority;
p	89	kernel/sys.c	struct task_struct **p;
p	95	kernel/sys.c	for(p = &LAST_TASK; p > &FIRST_TASK; --p) {
p	96	kernel/sys.c	if (!*p || !proc_sel(*p, which, who))
p	98	kernel/sys.c	if ((*p)->priority > max_prio)
p	99	kernel/sys.c	max_prio = (*p)->priority;
p	648	kernel/sys.c	int getrusage(struct task_struct *p, int who, struct rusage *ru)
p	660	kernel/sys.c	r.ru_utime.tv_sec = CT_TO_SECS(p->utime);
p	661	kernel/sys.c	r.ru_utime.tv_usec = CT_TO_USECS(p->utime);
p	662	kernel/sys.c	r.ru_stime.tv_sec = CT_TO_SECS(p->stime);
p	663	kernel/sys.c	r.ru_stime.tv_usec = CT_TO_USECS(p->stime);
p	664	kernel/sys.c	r.ru_minflt = p->min_flt;
p	665	kernel/sys.c	r.ru_majflt = p->maj_flt;
p	668	kernel/sys.c	r.ru_utime.tv_sec = CT_TO_SECS(p->cutime);
p	669	kernel/sys.c	r.ru_utime.tv_usec = CT_TO_USECS(p->cutime);
p	670	kernel/sys.c	r.ru_stime.tv_sec = CT_TO_SECS(p->cstime);
p	671	kernel/sys.c	r.ru_stime.tv_usec = CT_TO_USECS(p->cstime);
p	672	kernel/sys.c	r.ru_minflt = p->cmin_flt;
p	673	kernel/sys.c	r.ru_majflt = p->cmaj_flt;
p	676	kernel/sys.c	r.ru_utime.tv_sec = CT_TO_SECS(p->utime + p->cutime);
p	677	kernel/sys.c	r.ru_utime.tv_usec = CT_TO_USECS(p->utime + p->cutime);
p	678	kernel/sys.c	r.ru_stime.tv_sec = CT_TO_SECS(p->stime + p->cstime);
p	679	kernel/sys.c	r.ru_stime.tv_usec = CT_TO_USECS(p->stime + p->cstime);
p	680	kernel/sys.c	r.ru_minflt = p->min_flt + p->cmin_flt;
p	681	kernel/sys.c	r.ru_majflt = p->maj_flt + p->cmaj_flt;
p	61	mm/memory.c	#define CODE_SPACE(addr,p) ((addr) < (p)->end_code)
p	667	mm/memory.c	struct task_struct * p, unsigned long error_code, unsigned long newpage)
p	674	mm/memory.c	from_page = p->tss.cr3 + ((address>>20) & 0xffc);
p	725	mm/memory.c	struct task_struct ** p;
p	730	mm/memory.c	for (p = &LAST_TASK ; p > &FIRST_TASK ; --p) {
p	731	mm/memory.c	if (!*p)
p	733	mm/memory.c	if (tsk == *p)
p	735	mm/memory.c	if (inode != (*p)->executable) {
p	736	mm/memory.c	for (i=0; i < (*p)->numlibraries; i++)
p	737	mm/memory.c	if (inode == (*p)->libraries[i].library)
p	739	mm/memory.c	if (i >= (*p)->numlibraries)
p	742	mm/memory.c	if (try_to_share(address,tsk,*p,error_code,newpage))
p	754	mm/memory.c	unsigned long *p;
p	756	mm/memory.c	p = (unsigned long *) (tsk->tss.cr3 + ((address >> 20) & 0xffc));
p	757	mm/memory.c	if (PAGE_PRESENT & *p)
p	758	mm/memory.c	return *p;
p	759	mm/memory.c	if (*p) {
p	761	mm/memory.c	*p = 0;
p	764	mm/memory.c	p = (unsigned long *) (tsk->tss.cr3 + ((address >> 20) & 0xffc));
p	765	mm/memory.c	if (PAGE_PRESENT & *p) {
p	767	mm/memory.c	return *p;
p	769	mm/memory.c	if (*p) {
p	771	mm/memory.c	*p = 0;
p	774	mm/memory.c	*p = page | PAGE_TABLE;
p	775	mm/memory.c	return *p;
p	778	mm/memory.c	*p = BAD_PAGETABLE | PAGE_TABLE;
p	1046	mm/memory.c	unsigned short * p;
p	1056	mm/memory.c	p = mem_map + tmp;
p	1057	mm/memory.c	start_mem = (unsigned long) p;
p	1058	mm/memory.c	while (p > mem_map)
p	1059	mm/memory.c	*--p = MAP_PAGE_RESERVED;
p	59	mm/swap.c	struct swap_info_struct * p;
p	66	mm/swap.c	p = &swap_info[type];
p	72	mm/swap.c	if (!(p->flags & SWP_USED)) {
p	76	mm/swap.c	while (set_bit(offset,p->swap_lockmap))
p	78	mm/swap.c	if (p->swap_device) {
p	79	mm/swap.c	ll_rw_page(rw,p->swap_device,offset,buf);
p	80	mm/swap.c	} else if (p->swap_file) {
p	86	mm/swap.c	if (!(zones[i] = bmap(p->swap_file,block++))) {
p	90	mm/swap.c	ll_rw_swap_file(rw,p->swap_file->i_dev, zones,4,buf);
p	93	mm/swap.c	if (clear_bit(offset,p->swap_lockmap))
p	100	mm/swap.c	struct swap_info_struct * p;
p	103	mm/swap.c	p = swap_info;
p	104	mm/swap.c	for (type = 0 ; type < nr_swapfiles ; type++,p++) {
p	105	mm/swap.c	if ((p->flags & SWP_WRITEOK) != SWP_WRITEOK)
p	107	mm/swap.c	for (offset = p->lowest_bit; offset <= p->highest_bit ; offset++) {
p	108	mm/swap.c	if (p->swap_map[offset])
p	110	mm/swap.c	p->swap_map[offset] = 1;
p	111	mm/swap.c	if (offset == p->highest_bit)
p	112	mm/swap.c	p->highest_bit--;
p	113	mm/swap.c	p->lowest_bit = offset;
p	122	mm/swap.c	struct swap_info_struct * p;
p	133	mm/swap.c	p = type + swap_info;
p	138	mm/swap.c	if (!p->swap_map[offset]) {
p	142	mm/swap.c	p->swap_map[offset]++;
p	148	mm/swap.c	struct swap_info_struct * p;
p	158	mm/swap.c	p = & swap_info[type];
p	164	mm/swap.c	if (!(p->flags & SWP_USED)) {
p	168	mm/swap.c	while (set_bit(offset,p->swap_lockmap))
p	170	mm/swap.c	if (offset < p->lowest_bit)
p	171	mm/swap.c	p->lowest_bit = offset;
p	172	mm/swap.c	if (offset > p->highest_bit)
p	173	mm/swap.c	p->highest_bit = offset;
p	174	mm/swap.c	if (!p->swap_map[offset])
p	177	mm/swap.c	p->swap_map[offset]--;
p	178	mm/swap.c	if (clear_bit(offset,p->swap_lockmap))
p	279	mm/swap.c	struct task_struct * p;
p	289	mm/swap.c	p = task[swap_task];
p	290	mm/swap.c	if (!p || !p->swappable) {
p	300	mm/swap.c	pg_table = ((unsigned long *) p->tss.cr3)[swap_table];
p	308	mm/swap.c	((unsigned long *) p->tss.cr3)[swap_table] = 0;
p	321	mm/swap.c	case 1: p->rss--; return 1;
p	322	mm/swap.c	default: p->rss--;
p	472	mm/swap.c	struct task_struct *p;
p	481	mm/swap.c	p = task[nr];
p	482	mm/swap.c	if (!p)
p	485	mm/swap.c	ppage = pgt + ((unsigned long *) p->tss.cr3);
p	519	mm/swap.c	++p->rss;
p	533	mm/swap.c	struct swap_info_struct * p;
p	543	mm/swap.c	p = swap_info;
p	544	mm/swap.c	for (type = 0 ; type < nr_swapfiles ; type++,p++) {
p	545	mm/swap.c	if ((p->flags & SWP_WRITEOK) != SWP_WRITEOK)
p	547	mm/swap.c	if (p->swap_file) {
p	548	mm/swap.c	if (p->swap_file == inode)
p	553	mm/swap.c	if (p->swap_device == inode->i_rdev)
p	560	mm/swap.c	p->flags = SWP_USED;
p	563	mm/swap.c	p->flags = SWP_WRITEOK;
p	566	mm/swap.c	iput(p->swap_file);
p	567	mm/swap.c	p->swap_file = NULL;
p	568	mm/swap.c	p->swap_device = 0;
p	569	mm/swap.c	free_page((long) p->swap_map);
p	570	mm/swap.c	p->swap_map = NULL;
p	571	mm/swap.c	free_page((long) p->swap_lockmap);
p	572	mm/swap.c	p->swap_lockmap = NULL;
p	573	mm/swap.c	p->flags = 0;
p	584	mm/swap.c	struct swap_info_struct * p;
p	592	mm/swap.c	p = swap_info;
p	593	mm/swap.c	for (type = 0 ; type < nr_swapfiles ; type++,p++)
p	594	mm/swap.c	if (!(p->flags & SWP_USED))
p	600	mm/swap.c	p->flags = SWP_USED;
p	601	mm/swap.c	p->swap_file = NULL;
p	602	mm/swap.c	p->swap_device = 0;
p	603	mm/swap.c	p->swap_map = NULL;
p	604	mm/swap.c	p->swap_lockmap = NULL;
p	605	mm/swap.c	p->lowest_bit = 0;
p	606	mm/swap.c	p->highest_bit = 0;
p	609	mm/swap.c	p->flags = 0;
p	614	mm/swap.c	p->flags = 0;
p	618	mm/swap.c	p->swap_device = swap_inode->i_rdev;
p	620	mm/swap.c	if (!p->swap_device) {
p	621	mm/swap.c	p->flags = 0;
p	627	mm/swap.c	if (p->swap_device == swap_info[i].swap_device) {
p	628	mm/swap.c	p->swap_device = 0;
p	629	mm/swap.c	p->flags = 0;
p	634	mm/swap.c	p->swap_file = swap_inode;
p	637	mm/swap.c	p->flags = 0;
p	641	mm/swap.c	p->swap_lockmap = (char *) get_free_page(GFP_USER);
p	642	mm/swap.c	if (!tmp || !p->swap_lockmap) {
p	645	mm/swap.c	free_page((long) p->swap_lockmap);
p	646	mm/swap.c	iput(p->swap_file);
p	647	mm/swap.c	p->swap_device = 0;
p	648	mm/swap.c	p->swap_file = NULL;
p	649	mm/swap.c	p->swap_map = NULL;
p	650	mm/swap.c	p->swap_lockmap = NULL;
p	651	mm/swap.c	p->flags = 0;
p	658	mm/swap.c	free_page((long) p->swap_lockmap);
p	659	mm/swap.c	iput(p->swap_file);
p	660	mm/swap.c	p->swap_device = 0;
p	661	mm/swap.c	p->swap_file = NULL;
p	662	mm/swap.c	p->swap_map = NULL;
p	663	mm/swap.c	p->swap_lockmap = NULL;
p	664	mm/swap.c	p->flags = 0;
p	669	mm/swap.c	p->lowest_bit = 0;
p	670	mm/swap.c	p->highest_bit = 0;
p	673	mm/swap.c	if (!p->lowest_bit)
p	674	mm/swap.c	p->lowest_bit = i;
p	675	mm/swap.c	p->highest_bit = i;
p	681	mm/swap.c	free_page((long) p->swap_lockmap);
p	682	mm/swap.c	iput(p->swap_file);
p	683	mm/swap.c	p->swap_device = 0;
p	684	mm/swap.c	p->swap_file = NULL;
p	685	mm/swap.c	p->swap_map = NULL;
p	686	mm/swap.c	p->swap_lockmap = NULL;
p	687	mm/swap.c	p->flags = 0;
p	697	mm/swap.c	p->swap_map = tmp;
p	698	mm/swap.c	p->flags = SWP_WRITEOK;
p	110	net/tcp/ip.c	struct ip_protocol *p;
p	113	net/tcp/ip.c	for (p = ip_protos[hash] ; p != NULL; p=p->next)
p	115	net/tcp/ip.c	PRINTK (("trying protocol %d\n", p->protocol));
p	116	net/tcp/ip.c	if (p->protocol == prot)
p	117	net/tcp/ip.c	return (p);
p	150	net/tcp/ip.c	struct ip_protocol *p;
p	162	net/tcp/ip.c	for (p = (struct ip_protocol *)ip_protos[hash];
p	163	net/tcp/ip.c	p != NULL;
p	164	net/tcp/ip.c	p = (struct ip_protocol *) p->next)
p	169	net/tcp/ip.c	if (p->next != NULL && p->next == prot)
p	174	net/tcp/ip.c	if (p->copy == 0 && lp != NULL)
p	176	net/tcp/ip.c	p->next = prot->next;
p	180	net/tcp/ip.c	if (p->next != NULL && p->next->protocol == prot->protocol)
p	182	net/tcp/ip.c	lp = p;
p	279	net/tcp/ip.c	struct rtable *r, *x, *p;
p	284	net/tcp/ip.c	p = NULL;
p	288	net/tcp/ip.c	(long) r, (long) r->next, (long) p, (long) r->dev,
p	293	net/tcp/ip.c	if (p == NULL) rt_base = r->next;
p	294	net/tcp/ip.c	else p->next = r->next;
p	301	net/tcp/ip.c	p = r;
p	208	net/tcp/packet.c	struct packet_type *p;
p	209	net/tcp/packet.c	p = kmalloc (sizeof (*p), GFP_KERNEL);
p	210	net/tcp/packet.c	if (p == NULL) return (-ENOMEM);
p	212	net/tcp/packet.c	p->func = packet_rcv;
p	213	net/tcp/packet.c	p->type = sk->num;
p	214	net/tcp/packet.c	p->data = (void *)sk;
p	215	net/tcp/packet.c	dev_add_pack (p);
p	218	net/tcp/packet.c	sk->pair = (volatile struct sock *)p;
p	344	net/tcp/raw.c	struct ip_protocol *p;
p	345	net/tcp/raw.c	p = kmalloc (sizeof (*p), GFP_KERNEL);
p	346	net/tcp/raw.c	if (p == NULL) return (-ENOMEM);
p	348	net/tcp/raw.c	p->handler = raw_rcv;
p	349	net/tcp/raw.c	p->protocol = sk->protocol;
p	350	net/tcp/raw.c	p->data = (void *)sk;
p	351	net/tcp/raw.c	p->err_handler = raw_err;
p	352	net/tcp/raw.c	add_ip_protocol (p);
p	355	net/tcp/raw.c	sk->pair = (volatile struct sock *)p;
p	880	net/tcp/sock.c	struct ip_protocol *p;
p	890	net/tcp/sock.c	for (p = ip_protocol_base; p != NULL;)
p	894	net/tcp/sock.c	tmp = (struct ip_protocol *) p->next;
p	895	net/tcp/sock.c	add_ip_protocol (p);
p	896	net/tcp/sock.c	p = tmp;
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	79	zBoot/misc.c	void *p;
p	86	zBoot/misc.c	p = (void *)free_mem_ptr;
p	92	zBoot/misc.c	if (p == NULL) error("malloc = NULL\n");
p	93	zBoot/misc.c	return p;
p	234	zBoot/misc.c	static int p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};
p	238	zBoot/misc.c	for (i = 0; i < sizeof(p)/sizeof(int); i++)
p	239	zBoot/misc.c	e |= 1L << (31 - p[i]);