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-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++)
|
2011-05-14 22:11:09 +02:00
|
|
|
|
|
|
|
#define NODES_FOREACH(head) \
|
|
|
|
for (Con *child = (Con*)-1; (child == (Con*)-1) && ((child = 0), true);) \
|
|
|
|
TAILQ_FOREACH(child, &((head)->nodes_head), nodes)
|
|
|
|
|
Modify workspace next/prev to account for workspaces on all outputs.
Generally, the traversal goes: numbered workspaces in order, and then
named workspaces in the order in which they appear in the tree.
Example:
Output 1: Output 2:
1 3 D C 2 4 B A
Traversal: 1, 2, 3, 4, D, C, B, A, 1, ...
Note, after the numbered workspaces, we traverse the named workspaces
from output 1, and then output 2, etc.
2011-08-03 23:41:40 +02:00
|
|
|
#define NODES_FOREACH_REVERSE(head) \
|
|
|
|
for (Con *child = (Con*)-1; (child == (Con*)-1) && ((child = 0), true);) \
|
|
|
|
TAILQ_FOREACH_REVERSE(child, &((head)->nodes_head), nodes_head, nodes)
|
|
|
|
|
2011-05-14 22:11:09 +02:00
|
|
|
/* greps the ->nodes of the given head and returns the first node that matches the given condition */
|
|
|
|
#define GREP_FIRST(dest, head, condition) \
|
|
|
|
NODES_FOREACH(head) { \
|
|
|
|
if (!(condition)) \
|
|
|
|
continue; \
|
|
|
|
\
|
|
|
|
(dest) = child; \
|
|
|
|
break; \
|
|
|
|
}
|
|
|
|
|
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
|
|
|
|
2011-02-14 18:08:36 +01:00
|
|
|
#define CALL(obj, member, ...) obj->member(obj, ## __VA_ARGS__)
|
|
|
|
|
2009-02-15 01:58:09 +01:00
|
|
|
int min(int a, int b);
|
|
|
|
int max(int a, int b);
|
2010-04-13 18:43:37 +02:00
|
|
|
bool rect_contains(Rect rect, uint32_t x, uint32_t y);
|
2010-11-12 21:41:10 +01:00
|
|
|
Rect rect_add(Rect a, Rect b);
|
2009-04-07 19:02:07 +02:00
|
|
|
|
2010-02-28 18:39:11 +01:00
|
|
|
/**
|
|
|
|
* Updates *destination with new_value and returns true if it was changed or false
|
|
|
|
* if it was the same
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
bool update_if_necessary(uint32_t *destination, const uint32_t new_value);
|
|
|
|
|
2011-07-10 14:33:19 +02:00
|
|
|
/**
|
|
|
|
* exec()s an i3 utility, for example the config file migration script or
|
|
|
|
* i3-nagbar. This function first searches $PATH for the given utility named,
|
|
|
|
* then falls back to the dirname() of the i3 executable path and then falls
|
|
|
|
* back to the dirname() of the target of /proc/self/exe (on linux).
|
|
|
|
*
|
|
|
|
* This function should be called after fork()ing.
|
|
|
|
*
|
|
|
|
* The first argument of the given argv vector will be overwritten with the
|
|
|
|
* executable name, so pass NULL.
|
|
|
|
*
|
|
|
|
* If the utility cannot be found in any of these locations, it exits with
|
|
|
|
* return code 2.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void exec_i3_utility(char *name, char *argv[]);
|
|
|
|
|
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
|
|
|
|
2011-03-21 23:54:13 +01:00
|
|
|
/**
|
2010-12-01 01:47:16 +01:00
|
|
|
* This function resolves ~ in pathnames.
|
|
|
|
* It may resolve wildcards in the first part of the path, but if no match
|
|
|
|
* or multiple matches are found, it just returns a copy of path as given.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
char *resolve_tilde(const char *path);
|
|
|
|
|
2011-03-21 23:54:13 +01:00
|
|
|
/**
|
2010-12-01 01:47:16 +01:00
|
|
|
* Checks if the given path exists by calling stat().
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
bool path_exists(const char *path);
|
|
|
|
|
2011-03-21 23:54:13 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns the name of a temporary file with the specified prefix.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
char *get_process_filename(const char *prefix);
|
|
|
|
|
|
|
|
/**
|
2010-01-03 14:52:38 +01:00
|
|
|
* Restart i3 in-place
|
|
|
|
* appends -a to argument list to disable autostart
|
|
|
|
*
|
|
|
|
*/
|
2010-12-30 21:43:34 +01:00
|
|
|
void i3_restart(bool forget_layout);
|
2010-01-03 14:52:38 +01:00
|
|
|
|
2011-07-17 15:18:45 +02:00
|
|
|
#if defined(__OpenBSD__) || defined(__APPLE__)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Taken from FreeBSD
|
|
|
|
* Find the first occurrence of the byte string s in byte string l.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void *memmem(const void *l, size_t l_len, const void *s, size_t s_len);
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if defined(__APPLE__)
|
2011-07-17 22:18:00 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Taken from FreeBSD
|
|
|
|
* Returns a pointer to a new string which is a duplicate of the
|
|
|
|
* string, but only copies at most n characters.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
char *strndup(const char *str, size_t n);
|
|
|
|
|
2011-07-17 15:18:45 +02:00
|
|
|
#endif
|
|
|
|
|
2009-02-13 19:04:45 +01:00
|
|
|
#endif
|