Lines Matching full:curr
196 static void F1(DFData* curr, int width) {
198 DFData* check = curr - width-1;
201 if (distSq < curr->fDistSq) {
204 curr->fDistSq = distSq;
205 curr->fDistVector = distVec;
209 check = curr - width;
212 if (distSq < curr->fDistSq) {
214 curr->fDistSq = distSq;
215 curr->fDistVector = distVec;
219 check = curr - width+1;
222 if (distSq < curr->fDistSq) {
225 curr->fDistSq = distSq;
226 curr->fDistVector = distVec;
230 check = curr - 1;
233 if (distSq < curr->fDistSq) {
235 curr->fDistSq = distSq;
236 curr->fDistVector = distVec;
242 static void F2(DFData* curr, int width) {
244 DFData* check = curr + 1;
248 if (distSq < curr->fDistSq) {
250 curr->fDistSq = distSq;
251 curr->fDistVector = distVec;
257 static void B1(DFData* curr, int width) {
259 DFData* check = curr - 1;
262 if (distSq < curr->fDistSq) {
264 curr->fDistSq = distSq;
265 curr->fDistVector = distVec;
271 static void B2(DFData* curr, int width) {
273 DFData* check = curr + 1;
276 if (distSq < curr->fDistSq) {
278 curr->fDistSq = distSq;
279 curr->fDistVector = distVec;
283 check = curr + width-1;
286 if (distSq < curr->fDistSq) {
289 curr->fDistSq = distSq;
290 curr->fDistVector = distVec;
294 check = curr + width;
297 if (distSq < curr->fDistSq) {
299 curr->fDistSq = distSq;
300 curr->fDistVector = distVec;
304 check = curr + width+1;
307 if (distSq < curr->fDistSq) {
310 curr->fDistSq = distSq;
311 curr->fDistVector = distVec;
