Lines Matching refs:steps

22 	steps=NULL;
31 g_free(steps);
32 steps=NULL;
37 printf("%i steps\n",nbStep);
39 printf("(%i %f) ",steps[i].x,steps[i].delta); // localization ok
48 // doesn't deallocate the steps array, to minimize memory operations
90 // add the steps
101 steps=(alpha_step*)g_realloc(steps,maxStep*sizeof(alpha_step));
104 steps[nbStep].x=curSt;
105 steps[nbStep].delta=stC;
107 steps[nbStep].x=curSt+1;
108 steps[nbStep].delta=needC-stC; // au final, on a toujours le bon delta, meme avec une arete completement verticale
117 steps=(alpha_step*)g_realloc(steps,maxStep*sizeof(alpha_step));
121 steps[nbStep].x=curSt;
122 steps[nbStep].delta=stC;
124 steps[nbStep].x=curEn;
125 steps[nbStep].delta=enC;
127 steps[nbStep].x=curEn+1;
128 steps[nbStep].delta=needC-stC-enC;
140 steps=(alpha_step*)g_realloc(steps,maxStep*sizeof(alpha_step));
146 steps[nbStep].x=i;
147 steps[nbStep].delta=miC;
153 steps=(alpha_step*)g_realloc(steps,maxStep*sizeof(alpha_step));
159 steps[nbStep].x=i;
160 steps[nbStep].delta=miC;
163 steps[nbStep].x=curEn;
164 steps[nbStep].delta=enC;
166 steps[nbStep].x=curEn+1;
167 steps[nbStep].delta=needC-stC-stFC-enC-(curEn-curSt-2)*miC;
174 steps=(alpha_step*)g_realloc(steps,maxStep*sizeof(alpha_step));
176 steps[nbStep].x=curSt;
177 steps[nbStep].delta=stC;
179 steps[nbStep].x=curSt+1;
180 steps[nbStep].delta=stFC;
183 steps[nbStep].x=i;
184 steps[nbStep].delta=miC;
190 steps=(alpha_step*)g_realloc(steps,maxStep*sizeof(alpha_step));
192 steps[nbStep].x=curSt;
193 steps[nbStep].delta=stC;
195 steps[nbStep].x=curSt+1;
196 steps[nbStep].delta=stFC;
199 steps[nbStep].x=i;
200 steps[nbStep].delta=miC;
203 steps[nbStep].x=curEn;
204 steps[nbStep].delta=enC;
206 steps[nbStep].x=curEn+1;
207 steps[nbStep].delta=needC-stC-stFC-enC-(curEn-curSt-2)*miC;
249 if ( nbStep > 0 ) qsort(steps,nbStep,sizeof(alpha_step),CmpStep);
255 steps=(alpha_step*)g_realloc(steps,maxStep*sizeof(alpha_step));
258 steps[nStep].x=st;
259 steps[nStep].delta=pente;
273 while ( curStep < nbStep && steps[curStep].x < nMin ) {
274 alpSum+=steps[curStep].delta;
279 for (;( curStep < nbStep && steps[curStep].x < dest.startPix) ;curStep++) alpSum+=steps[curStep].delta;
287 if ( alpSum > 0 && steps[curStep].x > curPos ) {
289 // the last position (curPos) up to the pixel we're moving to (steps[curStep].x)
290 int nst=curPos,nen=steps[curStep].x;
295 alpSum+=steps[curStep].delta;
296 curPos=steps[curStep].x;