2011-05-15 20:10:25 +02:00
|
|
|
/*
|
|
|
|
* vim:ts=4:sw=4:expandtab
|
|
|
|
*
|
|
|
|
* i3 - an improved dynamic tiling window manager
|
2015-04-04 02:17:56 +02:00
|
|
|
* © 2009 Michael Stapelberg and contributors (see also: LICENSE)
|
2011-05-15 20:10:25 +02:00
|
|
|
*
|
2011-10-23 00:40:02 +02:00
|
|
|
* assignments.c: Assignments for specific windows (for_window).
|
|
|
|
*
|
2011-05-15 20:10:25 +02:00
|
|
|
*/
|
|
|
|
#include "all.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Checks the list of assignments for the given window and runs all matching
|
|
|
|
* ones (unless they have already been run for this specific window).
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void run_assignments(i3Window *window) {
|
2011-10-23 22:45:12 +02:00
|
|
|
DLOG("Checking if any assignments match this window\n");
|
2011-05-15 20:10:25 +02:00
|
|
|
|
2012-02-15 22:02:40 +01:00
|
|
|
bool needs_tree_render = false;
|
|
|
|
|
2011-05-15 20:10:25 +02:00
|
|
|
/* Check if any assignments match */
|
|
|
|
Assignment *current;
|
2014-06-19 11:20:32 +02:00
|
|
|
TAILQ_FOREACH(current, &assignments, assignments) {
|
2011-05-15 20:10:25 +02:00
|
|
|
if (!match_matches_window(&(current->match), window))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
bool skip = false;
|
2013-12-25 20:01:37 +01:00
|
|
|
for (uint32_t c = 0; c < window->nr_assignments; c++) {
|
2011-05-15 20:10:25 +02:00
|
|
|
if (window->ran_assignments[c] != current)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
DLOG("This assignment already ran for the given window, not executing it again.\n");
|
|
|
|
skip = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (skip)
|
|
|
|
continue;
|
|
|
|
|
2015-10-25 14:27:08 +01:00
|
|
|
/* Store that we ran this assignment to not execute it again. We have
|
|
|
|
* to do this before running the actual command to prevent infinite
|
|
|
|
* loops. */
|
|
|
|
window->nr_assignments++;
|
|
|
|
window->ran_assignments = srealloc(window->ran_assignments, sizeof(Assignment *) * window->nr_assignments);
|
|
|
|
window->ran_assignments[window->nr_assignments - 1] = current;
|
|
|
|
|
2011-05-15 20:10:25 +02:00
|
|
|
DLOG("matching assignment, would do:\n");
|
|
|
|
if (current->type == A_COMMAND) {
|
|
|
|
DLOG("execute command %s\n", current->dest.command);
|
|
|
|
char *full_command;
|
2011-10-23 14:16:56 +02:00
|
|
|
sasprintf(&full_command, "[id=\"%d\"] %s", window->id, current->dest.command);
|
2014-05-28 08:01:50 +02:00
|
|
|
CommandResult *result = parse_command(full_command, NULL);
|
2012-02-07 23:38:21 +01:00
|
|
|
free(full_command);
|
|
|
|
|
2014-05-28 08:01:50 +02:00
|
|
|
if (result->needs_tree_render)
|
2012-02-15 22:02:40 +01:00
|
|
|
needs_tree_render = true;
|
2012-02-07 23:38:21 +01:00
|
|
|
|
2014-05-28 08:01:50 +02:00
|
|
|
command_result_free(result);
|
2011-05-15 20:10:25 +02:00
|
|
|
}
|
|
|
|
}
|
2012-02-15 22:02:40 +01:00
|
|
|
|
|
|
|
/* If any of the commands required re-rendering, we will do that now. */
|
|
|
|
if (needs_tree_render)
|
|
|
|
tree_render();
|
2011-05-15 20:10:25 +02:00
|
|
|
}
|
2011-05-23 18:41:17 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Returns the first matching assignment for the given window.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
Assignment *assignment_for(i3Window *window, int type) {
|
|
|
|
Assignment *assignment;
|
|
|
|
|
2014-06-19 11:20:32 +02:00
|
|
|
TAILQ_FOREACH(assignment, &assignments, assignments) {
|
2011-05-23 18:41:17 +02:00
|
|
|
if ((type != A_ANY && (assignment->type & type) == 0) ||
|
|
|
|
!match_matches_window(&(assignment->match), window))
|
|
|
|
continue;
|
2015-10-25 14:25:55 +01:00
|
|
|
DLOG("got a matching assignment\n");
|
2011-05-23 18:41:17 +02:00
|
|
|
return assignment;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|