Lines Matching defs:neighbours
205 uint8_t neighbours[4];
213 memset(neighbours, src[-1], 4);
215 neighbours[TOP] = src[-stride];
217 neighbours[TOP_LEFT] = neighbours[LEFT] = neighbours[TOP];
219 neighbours[TOP_LEFT] = src[-stride - 1];
220 neighbours[ LEFT] = src[-1];
223 neighbours[TOP_RIGHT] = src[-stride + 1];
225 neighbours[TOP_RIGHT] = neighbours[TOP];
229 if (x >= 2 && src[-2] == neighbours[LEFT])
231 if (y >= 2 && src[-2 * stride] == neighbours[TOP])
235 ref_pix[0] = neighbours[0];
238 if (ref_pix[j] == neighbours[i])
241 ref_pix[nlen++] = neighbours[i];
249 if (neighbours[TOP] == neighbours[TOP_LEFT]) {
250 if (neighbours[TOP_RIGHT] == neighbours[TOP_LEFT])
252 else if (neighbours[LEFT] == neighbours[TOP_LEFT])
256 } else if (neighbours[TOP_RIGHT] == neighbours[TOP_LEFT]) {
257 if (neighbours[LEFT] == neighbours[TOP_LEFT])
261 } else if (neighbours[LEFT] == neighbours[TOP_LEFT]) {
268 if (neighbours[TOP] == neighbours[TOP_LEFT])
270 else if (neighbours[TOP_RIGHT] == neighbours[TOP_LEFT])
272 else if (neighbours[LEFT] == neighbours[TOP_LEFT])
274 else if (neighbours[TOP_RIGHT] == neighbours[TOP])
276 else if (neighbours[TOP] == neighbours[LEFT])