aboutsummaryrefslogtreecommitdiffstats
path: root/sway/output.c
blob: 97b8a4a6d0985889ce640c96b9a3985c377fb46c (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
#include <strings.h>
#include <ctype.h>
#include <stdlib.h>
#include "output.h"
#include "log.h"
#include "list.h"

void output_get_scaled_size(wlc_handle handle, struct wlc_size *size) {
	*size = *wlc_output_get_resolution(handle);
	uint32_t scale = wlc_output_get_scale(handle);
	size->w /= scale;
	size->h /= scale;
}

swayc_t *output_by_name(const char* name, const struct wlc_point *abs_pos) {
	if (strcasecmp(name, "left") == 0) {
		return swayc_adjacent_output(NULL, MOVE_LEFT, abs_pos, true);
	} else if (strcasecmp(name, "right") == 0) {
		return swayc_adjacent_output(NULL, MOVE_RIGHT, abs_pos, true);
	} else if (strcasecmp(name, "up") == 0) {
		return swayc_adjacent_output(NULL, MOVE_UP, abs_pos, true);
	} else if (strcasecmp(name, "down") == 0) {
		return swayc_adjacent_output(NULL, MOVE_DOWN, abs_pos, true);
	} else {
		for(int i = 0; i < root_container.children->length; ++i) {
			swayc_t *c = root_container.children->items[i];
			if (c->type == C_OUTPUT && strcasecmp(c->name, name) == 0) {
				return c;
			}
		}
	}
	return NULL;
}

// Position is where on the edge (as absolute position) the adjacent output should be searched for.
swayc_t *swayc_adjacent_output(swayc_t *output, enum movement_direction dir,
		const struct wlc_point *abs_pos, bool pick_closest) {

	if (!output) {
		output = swayc_active_output();
	}
	// In order to find adjacent outputs we need to test that the outputs are
	// aligned on one axis (decided by the direction given) and that the given
	// position is within the edge of the adjacent output. If no such output
	// exists we pick the adjacent output within the edge that is closest to
	// the given position, if any.
	swayc_t *adjacent = NULL;
	char *dir_text = NULL;
	switch(dir) {
		case MOVE_LEFT:
		case MOVE_RIGHT: ;
			double delta_y = 0;
			for(int i = 0; i < root_container.children->length; ++i) {
				swayc_t *c = root_container.children->items[i];
				if (c == output || c->type != C_OUTPUT) {
					continue;
				}
				bool x_aligned = dir == MOVE_LEFT ?
					c->x + c->width == output->x :
					c->x == output->x + output->width;
				if (!x_aligned) {
					continue;
				}
				if (abs_pos->y >= c->y && abs_pos->y <= c->y + c->height) {
					delta_y = 0;
					adjacent = c;
					break;
				} else if (pick_closest) {
					// track closest adjacent output
					double top_y = c->y, bottom_y = c->y + c->height;
					if (top_y >= output->y && top_y <= output->y + output->height) {
						double delta = top_y - abs_pos->y;
						if (delta < 0) delta = -delta;
						if (delta < delta_y || !adjacent) {
							delta_y = delta;
							adjacent = c;
						}
					}
					// we check both points and pick the closest
					if (bottom_y >= output->y && bottom_y <= output->y + output->height) {
						double delta = bottom_y - abs_pos->y;
						if (delta < 0) delta = -delta;
						if (delta < delta_y || !adjacent) {
							delta_y = delta;
							adjacent = c;
						}
					}
				}
			}
			dir_text = dir == MOVE_LEFT ? "left of" : "right of";
			if (adjacent && delta_y == 0) {
				sway_log(L_DEBUG, "%s (%.0fx%.0f+%.0f+%.0f) is %s current output %s (y-position %i)",
						adjacent->name, adjacent->width, adjacent->height, adjacent->x, adjacent->y,
						dir_text, output->name, abs_pos->y);
			} else if (adjacent) {
				// so we end up picking the closest adjacent output because
				// there is no directly adjacent to the given position
				sway_log(L_DEBUG, "%s (%.0fx%.0f+%.0f+%.0f) is %s current output %s (y-position %i, delta: %.0f)",
					adjacent->name, adjacent->width, adjacent->height, adjacent->x, adjacent->y,
					dir_text, output->name, abs_pos->y, delta_y);
			}
			break;
		case MOVE_UP:
		case MOVE_DOWN: ;
			double delta_x = 0;
			for(int i = 0; i < root_container.children->length; ++i) {
				swayc_t *c = root_container.children->items[i];
				if (c == output || c->type != C_OUTPUT) {
					continue;
				}
				bool y_aligned = dir == MOVE_UP ?
					c->y + c->height == output->y :
					c->y == output->y + output->height;
				if (!y_aligned) {
					continue;
				}
				if (abs_pos->x >= c->x && abs_pos->x <= c->x + c->width) {
					delta_x = 0;
					adjacent = c;
					break;
				} else if (pick_closest) {
					// track closest adjacent output
					double left_x = c->x, right_x = c->x + c->width;
					if (left_x >= output->x && left_x <= output->x + output->width) {
						double delta = left_x - abs_pos->x;
						if (delta < 0) delta = -delta;
						if (delta < delta_x || !adjacent) {
							delta_x = delta;
							adjacent = c;
						}
					}
					// we check both points and pick the closest
					if (right_x >= output->x && right_x <= output->x + output->width) {
						double delta = right_x - abs_pos->x;
						if (delta < 0) delta = -delta;
						if (delta < delta_x || !adjacent) {
							delta_x = delta;
							adjacent = c;
						}
					}
				}
			}
			dir_text = dir == MOVE_UP ? "above" : "below";
			if (adjacent && delta_x == 0) {
				sway_log(L_DEBUG, "%s (%.0fx%.0f+%.0f+%.0f) is %s current output %s (x-position %i)",
						adjacent->name, adjacent->width, adjacent->height, adjacent->x, adjacent->y,
						dir_text, output->name, abs_pos->x);
			} else if (adjacent) {
				// so we end up picking the closest adjacent output because
				// there is no directly adjacent to the given position
				sway_log(L_DEBUG, "%s (%.0fx%.0f+%.0f+%.0f) is %s current output %s (x-position %i, delta: %.0f)",
					adjacent->name, adjacent->width, adjacent->height, adjacent->x, adjacent->y,
					dir_text, output->name, abs_pos->x, delta_x);
			}
			break;
		default:
			sway_abort("Function called with invalid argument.");
			break;
	}
	return adjacent;
}

void get_absolute_position(swayc_t *container, struct wlc_point *point) {
	if (!container || !point)
		sway_abort("Need container and wlc_point (was %p, %p).", container, point);

	if (container->type == C_OUTPUT) {
		// Coordinates are already absolute.
		point->x = container->x;
		point->y = container->y;
	} else {
		swayc_t *output = swayc_parent_by_type(container, C_OUTPUT);
		if (container->type == C_WORKSPACE) {
			// Workspace coordinates are actually wrong/arbitrary, but should
			// be same as output.
			point->x = output->x;
			point->y = output->y;
		} else {
			point->x = output->x + container->x;
			point->y = output->y + container->y;
		}
	}
}

void get_absolute_center_position(swayc_t *container, struct wlc_point *point) {
	get_absolute_position(container, point);
	point->x += container->width/2;
	point->y += container->height/2;
}

static int sort_workspace_cmp_qsort(const void *_a, const void *_b) {
	swayc_t *a = *(void **)_a;
	swayc_t *b = *(void **)_b;
	int retval = 0;

	if (isdigit(a->name[0]) && isdigit(b->name[0])) {
		int a_num = strtol(a->name, NULL, 10);
		int b_num = strtol(b->name, NULL, 10);
		retval = (a_num < b_num) ? -1 : (a_num > b_num);
	} else if (isdigit(a->name[0])) {
		retval = -1;
	} else if (isdigit(b->name[0])) {
		retval = 1;
	}

	return retval;
}

void sort_workspaces(swayc_t *output) {
	list_stable_sort(output->children, sort_workspace_cmp_qsort);
}