labwc/src/resistance.c

152 lines
4.2 KiB
C
Raw Normal View History

// SPDX-License-Identifier: GPL-2.0-only
#include <assert.h>
#include <limits.h>
#include "common/border.h"
#include "common/macros.h"
2021-10-23 22:31:39 -04:00
#include "config/rcxml.h"
#include "edges.h"
#include "labwc.h"
2023-01-31 03:35:13 +01:00
#include "resistance.h"
#include "view.h"
2021-10-23 22:31:39 -04:00
2021-10-24 21:14:05 -04:00
static void
check_edge(int *next, struct edge current, struct edge target,
struct edge oppose, struct edge align, int tolerance)
2021-10-24 21:14:05 -04:00
{
int cur = current.offset;
int tgt = target.offset;
int opp = oppose.offset;
int aln = align.offset;
/* Ignore non-moving edges */
if (cur == tgt) {
return;
}
/*
* The edge defined by current and moving to target may encounter two
* edges of another region: the opposing edge of the region is that in
* the opposite orientation of the moving edge (i.e., left <-> right or
* top <-> bottom); the aligned edge of the region is that in the same
* orientation as the moving edge (i.e., left <->left, top <-> top,
* right <-> right, bottom <-> bottom).
*
* Any opposing or aligned edge of a region is considered "valid" in
* this search if the resist/attract zone (defined by tolerance) of
* that edge contains the target position of the moving edge.
*/
/* Direction of motion for the edge */
const bool decreasing = tgt < cur;
/* Check the opposing edge */
bool valid = false;
if (decreasing) {
const int lo = clipped_sub(opp, abs(tolerance));
const int hi = clipped_sub(opp, MIN(tolerance, 0));
valid = tgt >= lo && tgt < hi;
} else {
/* Check for increasing movement across opposing edge */
const int lo = clipped_add(opp, MIN(tolerance, 0));
const int hi = clipped_add(opp, abs(tolerance));
valid = tgt > lo && tgt <= hi;
}
if (valid && edges_traverse_edge(current, target, oppose)) {
*next = edge_get_best(*next, opp, decreasing);
2021-10-24 21:14:05 -04:00
}
/* Check the aligned edge */
valid = false;
if (decreasing) {
const int lo = clipped_sub(aln, abs(tolerance));
const int hi = clipped_sub(aln, MIN(tolerance, 0));
valid = tgt >= lo && tgt < hi;
} else {
const int lo = clipped_add(aln, MIN(tolerance, 0));
const int hi = clipped_add(aln, abs(tolerance));
valid = tgt > lo && tgt <= hi;
}
if (valid && edges_traverse_edge(current, target, align)) {
*next = edge_get_best(*next, aln, decreasing);
}
}
2021-10-23 22:31:39 -04:00
static void
check_edge_output(int *next, struct edge current, struct edge target,
struct edge oppose, struct edge align)
{
check_edge(next, current, target,
oppose, align, rc.screen_edge_strength);
}
static void
check_edge_window(int *next, struct edge current, struct edge target,
struct edge oppose, struct edge align)
{
check_edge(next, current, target,
oppose, align, rc.window_edge_strength);
2021-10-23 22:31:39 -04:00
}
2021-10-23 22:48:04 -04:00
void
resistance_move_apply(struct view *view, double *x, double *y)
2021-10-23 22:48:04 -04:00
{
assert(view);
struct border next_edges;
edges_initialize(&next_edges);
struct wlr_box target = {
.x = *x,
.y = *y,
.width = view->current.width,
.height = view->current.height,
};
if (rc.screen_edge_strength != 0) {
/* Find any relevant output edges encountered by this move */
edges_find_outputs(&next_edges, view, target, NULL,
check_edge_output, /* use_pending */ false);
}
if (rc.window_edge_strength != 0) {
/* Find any relevant window edges encountered by this move */
edges_find_neighbors(&next_edges, view, target, NULL,
check_edge_window, /* use_pending */ false);
}
/* If any "best" edges were encountered during this move, snap motion */
edges_adjust_move_coords(view, next_edges,
&target.x, &target.y, /* use_pending */ false);
*x = target.x;
*y = target.y;
}
void
resistance_resize_apply(struct view *view, struct wlr_box *new_geom)
{
assert(view);
assert(!view->shaded);
struct border next_edges;
edges_initialize(&next_edges);
if (rc.screen_edge_strength != 0) {
/* Find any relevant output edges encountered by this move */
edges_find_outputs(&next_edges, view, *new_geom, NULL,
check_edge_output, /* use_pending */ false);
}
2021-10-26 15:15:52 -04:00
if (rc.window_edge_strength != 0) {
/* Find any relevant window edges encountered by this move */
edges_find_neighbors(&next_edges, view, *new_geom, NULL,
check_edge_window, /* use_pending */ false);
2021-10-23 22:48:04 -04:00
}
/* If any "best" edges were encountered during this move, snap motion */
edges_adjust_resize_geom(view, next_edges,
view->server->resize_edges, new_geom, /* use_pending */ false);
2021-10-23 22:48:04 -04:00
}