p                  33 ldd3-samples-1.0.0/misc-modules/kdataalign.c struct p   {char c;  void *    t;} p;
p                  57 ldd3-samples-1.0.0/misc-modules/kdataalign.c 		(int)((void *)(&p.t)   - (void *)&p),
p                  30 ldd3-samples-1.0.0/misc-progs/dataalign.c struct p   {char c;  void *    t;} p;
p                  51 ldd3-samples-1.0.0/misc-progs/dataalign.c 	   (int)((void *)(&p.t)   - (void *)&p),
p                 283 ldd3-samples-1.0.0/scull/pipe.c 	struct scull_pipe *p;
p                 289 ldd3-samples-1.0.0/scull/pipe.c 		p = &scull_p_devices[i];
p                 290 ldd3-samples-1.0.0/scull/pipe.c 		if (down_interruptible(&p->sem))
p                 292 ldd3-samples-1.0.0/scull/pipe.c 		len += sprintf(buf+len, "\nDevice %i: %p\n", i, p);
p                 294 ldd3-samples-1.0.0/scull/pipe.c 		len += sprintf(buf+len, "   Buffer: %p to %p (%i bytes)\n", p->buffer, p->end, p->buffersize);
p                 295 ldd3-samples-1.0.0/scull/pipe.c 		len += sprintf(buf+len, "   rp %p   wp %p\n", p->rp, p->wp);
p                 296 ldd3-samples-1.0.0/scull/pipe.c 		len += sprintf(buf+len, "   readers %i   writers %i\n", p->nreaders, p->nwriters);
p                 297 ldd3-samples-1.0.0/scull/pipe.c 		up(&p->sem);
p                 412 ldd3-samples-1.0.0/scullc/main.c 	struct async_work *stuff = (struct async_work *) p;
p                 420 ldd3-samples-1.0.0/sculld/main.c 	struct async_work *stuff = (struct async_work *) p;
p                 411 ldd3-samples-1.0.0/scullp/main.c 	struct async_work *stuff = (struct async_work *) p;
p                 411 ldd3-samples-1.0.0/scullv/main.c 	struct async_work *stuff = (struct async_work *) p;
p                  23 mmap/anonmap.c 	double *p=off;
p                  28 mmap/anonmap.c 		fscanf(fp,"%lf", p);
p                  29 mmap/anonmap.c 		p++;
p                   6 pipe3.c        	int p,i;
p                  13 pipe3.c        	if (p=fork()) {
p                  13 pipe4.c        	int p,i;
p                  19 pipe4.c        	if (p=fork()) {
p                  17 pthread/broadcast.c 	int *p;
p                  19 pthread/broadcast.c 	p=malloc(SSIZE*sizeof(int));
p                  21 pthread/broadcast.c 		p[i] = arr[i];
p                  31 pthread/broadcast.c 			if (p[min] > p[j])
p                  34 pthread/broadcast.c 			int tmp=p[i];
p                  35 pthread/broadcast.c 			p[i]=p[min];
p                  36 pthread/broadcast.c 			p[min]=tmp;
p                  42 pthread/broadcast.c 	free (p);
p                  50 pthread/broadcast.c 	int *p;
p                  52 pthread/broadcast.c 	p=malloc(SSIZE*sizeof(int));
p                  54 pthread/broadcast.c 		p[i] = arr[i];
p                  62 pthread/broadcast.c 		int tmp=p[i];
p                  64 pthread/broadcast.c 		for (j=i-1; j>=0 && p[j]>=tmp; j--)
p                  65 pthread/broadcast.c 			p[j+1] = p[j];
p                  66 pthread/broadcast.c 		p[j+1]=tmp;	
p                  78 pthread/broadcast.c 	int *p;
p                  80 pthread/broadcast.c 	p=malloc(SSIZE*sizeof(int));
p                  82 pthread/broadcast.c 		p[i] = arr[i];
p                  96 pthread/broadcast.c 			int tmp=p[i];
p                  98 pthread/broadcast.c 			for (j=i-k; j>=0 && p[j]>=tmp; j -= k)
p                  99 pthread/broadcast.c 				p[j+k] = p[j];
p                 101 pthread/broadcast.c 			p[j+k]=tmp;	
p                 115 pthread/broadcast.c 	int *p;
p                 118 pthread/broadcast.c 	p=malloc(SSIZE*sizeof(int));
p                 120 pthread/broadcast.c 		p[i] = arr[i];
p                 127 pthread/broadcast.c 	qsort(p, SSIZE, sizeof(int), cmp);
p                 138 pthread/broadcast.c 	int *p;
p                 140 pthread/broadcast.c 	p=malloc(SSIZE*sizeof(int));
p                 142 pthread/broadcast.c 		p[i] = arr[i];
p                 155 pthread/broadcast.c 			if (p[j] > p[k]) {
p                 156 pthread/broadcast.c 				int tmp = p[j];
p                 157 pthread/broadcast.c 				p[j] = p[k];
p                 158 pthread/broadcast.c 				p[k] = tmp;