mirror of
https://github.com/NickHu/sway
synced 2024-12-27 21:58:11 +01:00
44c2fafa4f
When the gaps become too large for the space available gracefully reduced them all the way to 0 if needed. Fixes #4294
77 lines
1.7 KiB
C
77 lines
1.7 KiB
C
#ifndef _SWAY_NODE_H
|
|
#define _SWAY_NODE_H
|
|
#include <stdbool.h>
|
|
#include "list.h"
|
|
|
|
#define MIN_SANE_W 100
|
|
#define MIN_SANE_H 60
|
|
|
|
struct sway_root;
|
|
struct sway_output;
|
|
struct sway_workspace;
|
|
struct sway_container;
|
|
struct sway_transaction_instruction;
|
|
struct wlr_box;
|
|
|
|
enum sway_node_type {
|
|
N_ROOT,
|
|
N_OUTPUT,
|
|
N_WORKSPACE,
|
|
N_CONTAINER,
|
|
};
|
|
|
|
struct sway_node {
|
|
enum sway_node_type type;
|
|
union {
|
|
struct sway_root *sway_root;
|
|
struct sway_output *sway_output;
|
|
struct sway_workspace *sway_workspace;
|
|
struct sway_container *sway_container;
|
|
};
|
|
|
|
/**
|
|
* A unique ID to identify this node.
|
|
* Primarily used in the get_tree JSON output.
|
|
*/
|
|
size_t id;
|
|
|
|
struct sway_transaction_instruction *instruction;
|
|
size_t ntxnrefs;
|
|
bool destroying;
|
|
|
|
// If true, indicates that the container has pending state that differs from
|
|
// the current.
|
|
bool dirty;
|
|
|
|
struct {
|
|
struct wl_signal destroy;
|
|
} events;
|
|
};
|
|
|
|
void node_init(struct sway_node *node, enum sway_node_type type, void *thing);
|
|
|
|
const char *node_type_to_str(enum sway_node_type type);
|
|
|
|
/**
|
|
* Mark a node as dirty if it isn't already. Dirty nodes will be included in the
|
|
* next transaction then unmarked as dirty.
|
|
*/
|
|
void node_set_dirty(struct sway_node *node);
|
|
|
|
bool node_is_view(struct sway_node *node);
|
|
|
|
char *node_get_name(struct sway_node *node);
|
|
|
|
void node_get_box(struct sway_node *node, struct wlr_box *box);
|
|
|
|
struct sway_output *node_get_output(struct sway_node *node);
|
|
|
|
enum sway_container_layout node_get_layout(struct sway_node *node);
|
|
|
|
struct sway_node *node_get_parent(struct sway_node *node);
|
|
|
|
list_t *node_get_children(struct sway_node *node);
|
|
|
|
bool node_has_ancestor(struct sway_node *node, struct sway_node *ancestor);
|
|
|
|
#endif
|