2010-03-02 06:47:21 -05:00
|
|
|
|
/*
|
2011-10-25 16:19:38 -04:00
|
|
|
|
* vim:ts=4:sw=4:expandtab
|
2010-03-02 06:47:21 -05:00
|
|
|
|
*
|
|
|
|
|
* i3 - an improved dynamic tiling window manager
|
2015-04-03 20:17:56 -04:00
|
|
|
|
* © 2009 Michael Stapelberg and contributors (see also: LICENSE)
|
2010-03-02 06:47:21 -05:00
|
|
|
|
*
|
2011-10-25 16:19:38 -04:00
|
|
|
|
* For more information on RandR, please see the X.org RandR specification at
|
|
|
|
|
* http://cgit.freedesktop.org/xorg/proto/randrproto/tree/randrproto.txt
|
|
|
|
|
* (take your time to read it completely, it answers all questions).
|
2010-03-02 06:47:21 -05:00
|
|
|
|
*
|
|
|
|
|
*/
|
2013-12-28 21:11:50 -05:00
|
|
|
|
#pragma once
|
2010-03-02 06:47:21 -05:00
|
|
|
|
|
2011-10-25 16:19:38 -04:00
|
|
|
|
#include "data.h"
|
|
|
|
|
#include <xcb/randr.h>
|
|
|
|
|
|
2010-03-02 06:47:21 -05:00
|
|
|
|
TAILQ_HEAD(outputs_head, xoutput);
|
|
|
|
|
extern struct outputs_head outputs;
|
|
|
|
|
|
2012-09-22 10:49:37 -04:00
|
|
|
|
typedef enum {
|
|
|
|
|
CLOSEST_OUTPUT = 0,
|
|
|
|
|
FARTHEST_OUTPUT = 1
|
|
|
|
|
} output_close_far_t;
|
|
|
|
|
|
2010-03-02 06:47:21 -05:00
|
|
|
|
/**
|
|
|
|
|
* We have just established a connection to the X server and need the initial
|
|
|
|
|
* XRandR information to setup workspaces for each screen.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2010-03-27 10:25:51 -04:00
|
|
|
|
void randr_init(int *event_base);
|
2010-03-02 06:47:21 -05:00
|
|
|
|
|
2010-03-09 14:00:56 -05:00
|
|
|
|
/**
|
|
|
|
|
* Disables RandR support by creating exactly one output with the size of the
|
|
|
|
|
* X11 screen.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
void disable_randr(xcb_connection_t *conn);
|
|
|
|
|
|
2011-01-04 18:16:10 -05:00
|
|
|
|
/**
|
|
|
|
|
* Initializes a CT_OUTPUT Con (searches existing ones from inplace restart
|
|
|
|
|
* before) to use for the given Output.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
void output_init_con(Output *output);
|
|
|
|
|
|
2011-05-14 16:34:34 -04:00
|
|
|
|
/**
|
|
|
|
|
* Initializes at least one workspace for this output, trying the following
|
|
|
|
|
* steps until there is at least one workspace:
|
|
|
|
|
*
|
|
|
|
|
* • Move existing workspaces, which are assigned to be on the given output, to
|
|
|
|
|
* the output.
|
|
|
|
|
* • Create the first assigned workspace for this output.
|
|
|
|
|
* • Create the first unused workspace.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
void init_ws_for_output(Output *output, Con *content);
|
|
|
|
|
|
2010-03-09 14:00:56 -05:00
|
|
|
|
/**
|
|
|
|
|
* Initializes the specified output, assigning the specified workspace to it.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2010-03-27 10:25:51 -04:00
|
|
|
|
//void initialize_output(xcb_connection_t *conn, Output *output, Workspace *workspace);
|
2010-03-09 14:00:56 -05:00
|
|
|
|
|
2010-03-02 06:47:21 -05:00
|
|
|
|
/**
|
|
|
|
|
* (Re-)queries the outputs via RandR and stores them in the list of outputs.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2012-03-31 04:53:04 -04:00
|
|
|
|
void randr_query_outputs(void);
|
2010-03-02 06:47:21 -05:00
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Returns the first output which is active.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2012-03-31 04:53:04 -04:00
|
|
|
|
Output *get_first_output(void);
|
2010-03-02 06:47:21 -05:00
|
|
|
|
|
2010-03-02 07:35:43 -05:00
|
|
|
|
/**
|
|
|
|
|
* Returns the output with the given name if it is active (!) or NULL.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
Output *get_output_by_name(const char *name);
|
|
|
|
|
|
2010-03-02 06:47:21 -05:00
|
|
|
|
/**
|
2010-03-05 10:18:41 -05:00
|
|
|
|
* Returns the active (!) output which contains the coordinates x, y or NULL
|
|
|
|
|
* if there is no output which contains these coordinates.
|
2010-03-02 06:47:21 -05:00
|
|
|
|
*
|
|
|
|
|
*/
|
2013-12-25 14:01:37 -05:00
|
|
|
|
Output *get_output_containing(unsigned int x, unsigned int y);
|
2010-03-02 06:47:21 -05:00
|
|
|
|
|
2013-03-21 13:36:40 -04:00
|
|
|
|
/*
|
|
|
|
|
* In contained_by_output, we check if any active output contains part of the container.
|
|
|
|
|
* We do this by checking if the output rect is intersected by the Rect.
|
|
|
|
|
* This is the 2-dimensional counterpart of get_output_containing.
|
|
|
|
|
* Since we don't actually need the outputs intersected by the given Rect (There could
|
|
|
|
|
* be many), we just return true or false for convenience.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
bool contained_by_output(Rect rect);
|
|
|
|
|
|
2010-03-02 06:47:21 -05:00
|
|
|
|
/**
|
2013-01-24 18:02:09 -05:00
|
|
|
|
* Gets the output which is the next one in the given direction.
|
|
|
|
|
*
|
|
|
|
|
* If close_far == CLOSEST_OUTPUT, then the output next to the current one will
|
|
|
|
|
* selected. If close_far == FARTHEST_OUTPUT, the output which is the last one
|
|
|
|
|
* in the given direction will be selected.
|
2010-03-02 06:47:21 -05:00
|
|
|
|
*
|
2013-01-24 18:02:09 -05:00
|
|
|
|
* NULL will be returned when no active outputs are present in the direction
|
|
|
|
|
* specified (note that ‘current’ counts as such an output).
|
2010-03-02 06:47:21 -05:00
|
|
|
|
*
|
|
|
|
|
*/
|
2013-01-24 18:02:09 -05:00
|
|
|
|
Output *get_output_next(direction_t direction, Output *current, output_close_far_t close_far);
|
2010-03-02 06:47:21 -05:00
|
|
|
|
|
2011-08-06 12:28:05 -04:00
|
|
|
|
/**
|
2013-01-24 18:02:09 -05:00
|
|
|
|
* Like get_output_next with close_far == CLOSEST_OUTPUT, but wraps.
|
|
|
|
|
*
|
|
|
|
|
* For example if get_output_next(D_DOWN, x, FARTHEST_OUTPUT) = NULL, then
|
|
|
|
|
* get_output_next_wrap(D_DOWN, x) will return the topmost output.
|
|
|
|
|
*
|
|
|
|
|
* This function always returns a output: if no active outputs can be found,
|
|
|
|
|
* current itself is returned.
|
2011-08-06 12:28:05 -04:00
|
|
|
|
*
|
|
|
|
|
*/
|
2013-01-24 18:02:09 -05:00
|
|
|
|
Output *get_output_next_wrap(direction_t direction, Output *current);
|