mirror of
https://github.com/vale981/bspwm
synced 2025-03-06 02:01:42 -05:00
78 lines
3.6 KiB
C
78 lines
3.6 KiB
C
/* Copyright (c) 2012, Bastien Dejean
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
|
|
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef BSPWM_QUERY_H
|
|
#define BSPWM_QUERY_H
|
|
|
|
#define PTH_TOK "/"
|
|
|
|
typedef enum {
|
|
DOMAIN_TREE,
|
|
DOMAIN_MONITOR,
|
|
DOMAIN_DESKTOP,
|
|
DOMAIN_NODE
|
|
} domain_t;
|
|
|
|
enum {
|
|
SELECTOR_OK,
|
|
SELECTOR_INVALID,
|
|
SELECTOR_BAD_MODIFIERS,
|
|
SELECTOR_BAD_DESCRIPTOR
|
|
};
|
|
|
|
void query_tree(FILE *rsp);
|
|
void query_monitor(monitor_t *m, FILE *rsp);
|
|
void query_desktop(desktop_t *d, FILE *rsp);
|
|
void query_node(node_t *n, FILE *rsp);
|
|
void query_presel(presel_t *p, FILE *rsp);
|
|
void query_client(client_t *c, FILE *rsp);
|
|
void query_rectangle(xcb_rectangle_t r, FILE *rsp);
|
|
void query_padding(padding_t p, FILE *rsp);
|
|
void query_history(FILE *rsp);
|
|
void query_coordinates(coordinates_t *loc, FILE *rsp);
|
|
void query_stack(FILE *rsp);
|
|
int query_node_ids(coordinates_t *ref, coordinates_t *trg, node_select_t *sel, FILE *rsp);
|
|
int query_node_ids_in(node_t *n, desktop_t *d, monitor_t *m, coordinates_t *ref, coordinates_t *trg, node_select_t *sel, FILE *rsp);
|
|
int query_desktop_ids(coordinates_t *ref, coordinates_t *trg, desktop_select_t *sel, FILE *rsp);
|
|
int query_monitor_ids(coordinates_t *ref, coordinates_t *trg, monitor_select_t *sel, FILE *rsp);
|
|
void print_modifier_mask(uint16_t m, FILE *rsp);
|
|
void print_pointer_action(pointer_action_t a, FILE *rsp);
|
|
node_select_t make_node_select(void);
|
|
desktop_select_t make_desktop_select(void);
|
|
monitor_select_t make_monitor_select(void);
|
|
int node_from_desc(char *desc, coordinates_t *ref, coordinates_t *dst);
|
|
int desktop_from_desc(char *desc, coordinates_t *ref, coordinates_t *dst);
|
|
int monitor_from_desc(char *desc, coordinates_t *ref, coordinates_t *dst);
|
|
bool locate_window(xcb_window_t win, coordinates_t *loc);
|
|
bool locate_desktop(char *name, coordinates_t *loc);
|
|
bool locate_monitor(char *name, coordinates_t *loc);
|
|
bool desktop_from_id(uint32_t id, coordinates_t *loc, monitor_t *mm);
|
|
bool desktop_from_index(uint16_t idx, coordinates_t *loc, monitor_t *mm);
|
|
bool monitor_from_id(uint32_t id, coordinates_t *loc);
|
|
bool monitor_from_index(int idx, coordinates_t *loc);
|
|
bool node_matches(coordinates_t *loc, coordinates_t *ref, node_select_t sel);
|
|
bool desktop_matches(coordinates_t *loc, coordinates_t *ref, desktop_select_t sel);
|
|
bool monitor_matches(coordinates_t *loc, __attribute__((unused)) coordinates_t *ref, monitor_select_t sel);
|
|
|
|
#endif
|