Lines Matching defs:lp
133 register int* lp;
160 lp = cut->list;
176 *lp++ = range;
177 *lp++ = n;
181 *lp++ = --n;
182 *lp++ = 1;
187 *lp = HUGE;
188 n = 1 + (lp-cut->list)/2;
189 qsort(lp=cut->list,n,2*sizeof(*lp),mycomp);
191 for(n=0,range= -2,dp=lp; *lp!=HUGE; lp+=2)
193 if(lp[0] <= range)
195 if(lp[1]==HUGE)
200 if((c = lp[0]+lp[1]-range)>0)
208 range = *dp++ = lp[0];
209 if(lp[1]==HUGE)
214 range += (*dp++ = lp[1]);
218 lp = cut->list;
220 for(n=0; *lp!=HUGE; lp+=2)
222 c = *lp;
223 *lp -= n;
224 n = c+lp[1];
257 register const int* lp = cut->list;
273 if (!(ncol = skip = *(lp = cut->list)))
274 ncol = *++lp;
345 ncol = *++lp;
370 register const int *lp = cut->list;
395 if (nfields = *(lp = cut->list))
398 nfields = *++lp;
516 nfields = *++lp;