146     return barrier->y1 == barrier->y2;  in barrier_is_horizontal()
157  * x1/y1 → x2/y2 represents.
160 barrier_get_direction(int x1, int y1, int x2, int y2)  in barrier_get_direction()  argument
169     if (y2 > y1)  in barrier_get_direction()
171     if (y2 < y1)  in barrier_get_direction()
179  * x1/y1 → x2/y2. This function only tests whether the directions could be
210  * Test if the movement vector x1/y1 → x2/y2 is intersecting with the
217  * @param y2 Y end coordinate of movement vector
224                     int x1, int y1, int x2, int y2, double *distance)  in barrier_is_blocking()  argument
236         y = F(t, y1, y2);  in barrier_is_blocking()
237         if (!inside_segment(y, barrier->y1, barrier->y2))  in barrier_is_blocking()
245         t = T(barrier->y1, y1, y2);  in barrier_is_blocking()
250         if (y2 > y1 && t == 0)  in barrier_is_blocking()
266     int x1, x2, y1, y2;  in barrier_inside_hit_box()  local
272     y2 = barrier->y2;  in barrier_inside_hit_box()
285             y2 += HIT_EDGE_EXTENTS;  in barrier_inside_hit_box()
288     return x >= x1 && x <= x2 && y >= y1 && y <= y2;  in barrier_inside_hit_box()
317  * Find the nearest barrier client that is blocking movement from x1/y1 to x2/y2.
323  * @param y2 Y end coordinate of movement vector
329                      int x1, int y1, int x2, int y2)  in barrier_find_nearest()  argument
349         if (barrier_is_blocking(b, x1, y1, x2, y2, &distance)) {  in barrier_find_nearest()
623     ret->barrier.y2 = stuff->y2;  in CreatePointerBarrierClient()
625     sort_min_max(&ret->barrier.y1, &ret->barrier.y2);  in CreatePointerBarrierClient()
790     b.y2 = stuff->y2;  in XICreatePointerBarrier()
800     if (barrier_is_horizontal(&b) && (b.y1 < 0 || b.y2 < 0))  in XICreatePointerBarrier()