i3
|
00001 /* 00002 * vim:ts=4:sw=4:expandtab 00003 * 00004 * i3 - an improved dynamic tiling window manager 00005 * © 2009-2011 Michael Stapelberg and contributors (see also: LICENSE) 00006 * 00007 * util.c: Utility functions, which can be useful everywhere within i3 (see 00008 * also libi3). 00009 * 00010 */ 00011 #ifndef _UTIL_H 00012 #define _UTIL_H 00013 00014 #include <err.h> 00015 00016 #include "data.h" 00017 00018 #define die(...) errx(EXIT_FAILURE, __VA_ARGS__); 00019 #define exit_if_null(pointer, ...) { if (pointer == NULL) die(__VA_ARGS__); } 00020 #define STARTS_WITH(string, needle) (strncasecmp(string, needle, strlen(needle)) == 0) 00021 #define CIRCLEQ_NEXT_OR_NULL(head, elm, field) (CIRCLEQ_NEXT(elm, field) != CIRCLEQ_END(head) ? \ 00022 CIRCLEQ_NEXT(elm, field) : NULL) 00023 #define CIRCLEQ_PREV_OR_NULL(head, elm, field) (CIRCLEQ_PREV(elm, field) != CIRCLEQ_END(head) ? \ 00024 CIRCLEQ_PREV(elm, field) : NULL) 00025 #define FOR_TABLE(workspace) \ 00026 for (int cols = 0; cols < (workspace)->cols; cols++) \ 00027 for (int rows = 0; rows < (workspace)->rows; rows++) 00028 00029 #define NODES_FOREACH(head) \ 00030 for (Con *child = (Con*)-1; (child == (Con*)-1) && ((child = 0), true);) \ 00031 TAILQ_FOREACH(child, &((head)->nodes_head), nodes) 00032 00033 #define NODES_FOREACH_REVERSE(head) \ 00034 for (Con *child = (Con*)-1; (child == (Con*)-1) && ((child = 0), true);) \ 00035 TAILQ_FOREACH_REVERSE(child, &((head)->nodes_head), nodes_head, nodes) 00036 00037 /* greps the ->nodes of the given head and returns the first node that matches the given condition */ 00038 #define GREP_FIRST(dest, head, condition) \ 00039 NODES_FOREACH(head) { \ 00040 if (!(condition)) \ 00041 continue; \ 00042 \ 00043 (dest) = child; \ 00044 break; \ 00045 } 00046 00047 #define FREE(pointer) do { \ 00048 if (pointer != NULL) { \ 00049 free(pointer); \ 00050 pointer = NULL; \ 00051 } \ 00052 } \ 00053 while (0) 00054 00055 #define CALL(obj, member, ...) obj->member(obj, ## __VA_ARGS__) 00056 00057 int min(int a, int b); 00058 int max(int a, int b); 00059 bool rect_contains(Rect rect, uint32_t x, uint32_t y); 00060 Rect rect_add(Rect a, Rect b); 00061 00067 bool update_if_necessary(uint32_t *destination, const uint32_t new_value); 00068 00084 void exec_i3_utility(char *name, char *argv[]); 00085 00091 void check_error(xcb_connection_t *conn, xcb_void_cookie_t cookie, 00092 char *err_message); 00093 00100 char *resolve_tilde(const char *path); 00101 00106 bool path_exists(const char *path); 00107 00108 00113 char *get_process_filename(const char *prefix); 00114 00120 void i3_restart(bool forget_layout); 00121 00122 #if defined(__OpenBSD__) || defined(__APPLE__) 00123 00124 /* 00125 * Taken from FreeBSD 00126 * Find the first occurrence of the byte string s in byte string l. 00127 * 00128 */ 00129 void *memmem(const void *l, size_t l_len, const void *s, size_t s_len); 00130 00131 #endif 00132 00133 #endif