317  * Find the nearest barrier client that is blocking movement from x1/y1 to x2/y2.
324  * @return The barrier nearest to the movement origin that blocks this movement.
331     struct PointerBarrierClient *c, *nearest = NULL;  in barrier_find_nearest()  local
352                 nearest = c;  in barrier_find_nearest()
357     return nearest;  in barrier_find_nearest()
398     struct PointerBarrier *nearest = NULL;  in input_constrain_cursor()  local
429      * Given the origin and the movement vector, get the nearest barrier  in input_constrain_cursor()
433      * destination, again finding the nearest barrier and clamping.  in input_constrain_cursor()
445         nearest = &c->barrier;  in input_constrain_cursor()
457         barrier_clamp_to_barrier(nearest, dir, &x, &y);  in input_constrain_cursor()
459         if (barrier_is_vertical(nearest)) {  in input_constrain_cursor()
463         else if (barrier_is_horizontal(nearest)) {  in input_constrain_cursor()