2009-02-14 02:33:31 +01:00
|
|
|
|
/*
|
|
|
|
|
* vim:ts=8:expandtab
|
|
|
|
|
*
|
|
|
|
|
* i3 - an improved dynamic tiling window manager
|
|
|
|
|
*
|
2009-12-19 22:39:00 +01:00
|
|
|
|
* © 2009 Michael Stapelberg and contributors
|
2009-02-14 02:33:31 +01:00
|
|
|
|
*
|
|
|
|
|
* See file LICENSE for license information.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2009-02-14 20:12:50 +01:00
|
|
|
|
#include <xcb/xcb.h>
|
2009-07-28 14:03:50 +02:00
|
|
|
|
#include <err.h>
|
2009-02-14 20:12:50 +01:00
|
|
|
|
|
|
|
|
|
#include "data.h"
|
|
|
|
|
|
2009-02-13 19:04:45 +01:00
|
|
|
|
#ifndef _UTIL_H
|
|
|
|
|
#define _UTIL_H
|
|
|
|
|
|
2009-07-28 14:03:50 +02:00
|
|
|
|
#define die(...) errx(EXIT_FAILURE, __VA_ARGS__);
|
2009-02-15 22:52:33 +01:00
|
|
|
|
#define exit_if_null(pointer, ...) { if (pointer == NULL) die(__VA_ARGS__); }
|
2009-03-14 21:31:22 +01:00
|
|
|
|
#define STARTS_WITH(string, needle) (strncasecmp(string, needle, strlen(needle)) == 0)
|
2009-02-23 01:41:26 +01:00
|
|
|
|
#define CIRCLEQ_NEXT_OR_NULL(head, elm, field) (CIRCLEQ_NEXT(elm, field) != CIRCLEQ_END(head) ? \
|
|
|
|
|
CIRCLEQ_NEXT(elm, field) : NULL)
|
|
|
|
|
#define CIRCLEQ_PREV_OR_NULL(head, elm, field) (CIRCLEQ_PREV(elm, field) != CIRCLEQ_END(head) ? \
|
|
|
|
|
CIRCLEQ_PREV(elm, field) : NULL)
|
2009-03-11 00:20:56 +01:00
|
|
|
|
#define FOR_TABLE(workspace) \
|
2009-05-09 13:01:23 +02:00
|
|
|
|
for (int cols = 0; cols < (workspace)->cols; cols++) \
|
|
|
|
|
for (int rows = 0; rows < (workspace)->rows; rows++)
|
2009-03-30 08:27:53 +02:00
|
|
|
|
#define FREE(pointer) do { \
|
2009-06-21 13:44:14 +02:00
|
|
|
|
if (pointer != NULL) { \
|
2009-03-30 08:27:53 +02:00
|
|
|
|
free(pointer); \
|
|
|
|
|
pointer = NULL; \
|
|
|
|
|
} \
|
|
|
|
|
} \
|
|
|
|
|
while (0)
|
2009-03-11 00:20:56 +01:00
|
|
|
|
|
2009-04-19 20:44:34 +02:00
|
|
|
|
TAILQ_HEAD(keyvalue_table_head, keyvalue_element);
|
|
|
|
|
extern struct keyvalue_table_head by_parent;
|
|
|
|
|
extern struct keyvalue_table_head by_child;
|
2009-02-15 22:52:33 +01:00
|
|
|
|
|
2009-02-15 01:58:09 +01:00
|
|
|
|
int min(int a, int b);
|
|
|
|
|
int max(int a, int b);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
|
|
|
|
|
/**
|
2009-06-29 21:54:51 +02:00
|
|
|
|
* Safe-wrapper around malloc which exits if malloc returns NULL (meaning that
|
|
|
|
|
* there is no more memory available)
|
2009-04-07 19:02:07 +02:00
|
|
|
|
*
|
|
|
|
|
*/
|
2009-02-15 02:52:52 +01:00
|
|
|
|
void *smalloc(size_t size);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
|
|
|
|
|
/**
|
2009-06-29 21:54:51 +02:00
|
|
|
|
* Safe-wrapper around calloc which exits if malloc returns NULL (meaning that
|
|
|
|
|
* there is no more memory available)
|
2009-04-07 19:02:07 +02:00
|
|
|
|
*
|
|
|
|
|
*/
|
2009-02-24 14:18:08 +01:00
|
|
|
|
void *scalloc(size_t size);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
|
|
|
|
|
/**
|
2009-06-29 21:54:51 +02:00
|
|
|
|
* Safe-wrapper around strdup which exits if malloc returns NULL (meaning that
|
|
|
|
|
* there is no more memory available)
|
2009-04-07 19:02:07 +02:00
|
|
|
|
*
|
|
|
|
|
*/
|
2009-02-15 02:52:52 +01:00
|
|
|
|
char *sstrdup(const char *str);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
|
2009-04-19 20:44:34 +02:00
|
|
|
|
/**
|
|
|
|
|
* Inserts an element into the given keyvalue-table using the given key.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
bool table_put(struct keyvalue_table_head *head, uint32_t key, void *value);
|
|
|
|
|
|
|
|
|
|
/**
|
2009-06-29 21:54:51 +02:00
|
|
|
|
* Removes the element from the given keyvalue-table with the given key and
|
|
|
|
|
* returns its value;
|
2009-04-19 20:44:34 +02:00
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
void *table_remove(struct keyvalue_table_head *head, uint32_t key);
|
|
|
|
|
|
|
|
|
|
/**
|
2009-06-29 21:54:51 +02:00
|
|
|
|
* Returns the value of the element of the given keyvalue-table with the given
|
|
|
|
|
* key.
|
2009-04-19 20:44:34 +02:00
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
void *table_get(struct keyvalue_table_head *head, uint32_t key);
|
|
|
|
|
|
2009-04-07 19:02:07 +02:00
|
|
|
|
/**
|
2009-06-29 21:54:51 +02:00
|
|
|
|
* Starts the given application by passing it through a shell. We use double
|
|
|
|
|
* fork to avoid zombie processes. As the started application’s parent exits
|
|
|
|
|
* (immediately), the application is reparented to init (process-id 1), which
|
|
|
|
|
* correctly handles childs, so we don’t have to do it :-).
|
2009-04-07 19:02:07 +02:00
|
|
|
|
*
|
2009-06-29 21:54:51 +02:00
|
|
|
|
* The shell is determined by looking for the SHELL environment variable. If
|
|
|
|
|
* it does not exist, /bin/sh is used.
|
2009-04-07 19:02:07 +02:00
|
|
|
|
*
|
|
|
|
|
*/
|
2009-02-14 01:36:12 +01:00
|
|
|
|
void start_application(const char *command);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
|
|
|
|
|
/**
|
2009-06-29 21:54:51 +02:00
|
|
|
|
* Checks a generic cookie for errors and quits with the given message if
|
|
|
|
|
* there was an error.
|
2009-04-07 19:02:07 +02:00
|
|
|
|
*
|
|
|
|
|
*/
|
2009-06-29 21:54:51 +02:00
|
|
|
|
void check_error(xcb_connection_t *conn, xcb_void_cookie_t cookie,
|
|
|
|
|
char *err_message);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Converts the given string to UCS-2 big endian for use with
|
2009-06-29 21:54:51 +02:00
|
|
|
|
* xcb_image_text_16(). The amount of real glyphs is stored in real_strlen, a
|
|
|
|
|
* buffer containing the UCS-2 encoded string (16 bit per glyph) is
|
2009-04-07 19:02:07 +02:00
|
|
|
|
* returned. It has to be freed when done.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2009-03-08 17:47:45 +01:00
|
|
|
|
char *convert_utf8_to_ucs2(char *input, int *real_strlen);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
|
|
|
|
|
/**
|
2009-04-11 14:08:19 +02:00
|
|
|
|
* Returns the client which comes next in focus stack (= was selected before) for
|
|
|
|
|
* the given container, optionally excluding the given client.
|
2009-04-07 19:02:07 +02:00
|
|
|
|
*
|
|
|
|
|
*/
|
2009-06-29 21:54:51 +02:00
|
|
|
|
Client *get_last_focused_client(xcb_connection_t *conn, Container *container,
|
|
|
|
|
Client *exclude);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Sets the given client as focused by updating the data structures correctly,
|
2009-06-29 21:54:51 +02:00
|
|
|
|
* updating the X input focus and finally re-decorating both windows (to
|
|
|
|
|
* signalize the user the new focus situation)
|
2009-04-07 19:02:07 +02:00
|
|
|
|
*
|
|
|
|
|
*/
|
2009-04-01 12:50:42 +02:00
|
|
|
|
void set_focus(xcb_connection_t *conn, Client *client, bool set_anyways);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Called when the user switches to another mode or when the container is
|
|
|
|
|
* destroyed and thus needs to be cleaned up.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2009-03-04 21:49:29 +01:00
|
|
|
|
void leave_stack_mode(xcb_connection_t *conn, Container *container);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
|
|
|
|
|
/**
|
2009-06-29 21:54:51 +02:00
|
|
|
|
* Switches the layout of the given container taking care of the necessary
|
|
|
|
|
* house-keeping
|
2009-04-07 19:02:07 +02:00
|
|
|
|
*
|
|
|
|
|
*/
|
2009-02-24 00:30:04 +01:00
|
|
|
|
void switch_layout_mode(xcb_connection_t *conn, Container *container, int mode);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
|
|
|
|
|
/**
|
2009-05-16 17:32:36 +02:00
|
|
|
|
* Gets the first matching client for the given window class/window title.
|
|
|
|
|
* If the paramater specific is set to a specific client, only this one
|
|
|
|
|
* will be checked.
|
2009-04-07 19:02:07 +02:00
|
|
|
|
*
|
|
|
|
|
*/
|
2009-06-29 21:54:51 +02:00
|
|
|
|
Client *get_matching_client(xcb_connection_t *conn,
|
|
|
|
|
const char *window_classtitle, Client *specific);
|
2009-02-13 19:04:45 +01:00
|
|
|
|
|
2010-01-03 14:52:38 +01:00
|
|
|
|
/*
|
|
|
|
|
* Restart i3 in-place
|
|
|
|
|
* appends -a to argument list to disable autostart
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
void i3_restart();
|
|
|
|
|
|
2009-09-02 22:25:50 +02:00
|
|
|
|
#if defined(__OpenBSD__)
|
|
|
|
|
/* OpenBSD does not provide memmem(), so we provide FreeBSD’s implementation */
|
|
|
|
|
void *memmem(const void *l, size_t l_len, const void *s, size_t s_len);
|
|
|
|
|
#endif
|
|
|
|
|
|
2009-02-13 19:04:45 +01:00
|
|
|
|
#endif
|