Configuration of dwm for Mac Computers
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

296 lines
4.6 KiB

18 years ago
18 years ago
18 years ago
  1. /*
  2. * (C)opyright MMVI Anselm R. Garbe <garbeam at gmail dot com>
  3. * See LICENSE file for license details.
  4. */
  5. #include "dwm.h"
  6. #include <stdio.h>
  7. /* static */
  8. static Client *
  9. minclient() {
  10. Client *c, *min;
  11. if((clients && clients->isfloat) || arrange == dofloat)
  12. return clients; /* don't touch floating order */
  13. for(min = c = clients; c; c = c->next)
  14. if(c->weight < min->weight)
  15. min = c;
  16. return min;
  17. }
  18. static void
  19. reorder() {
  20. Client *c, *newclients, *tail;
  21. newclients = tail = NULL;
  22. while((c = minclient())) {
  23. detach(c);
  24. if(tail) {
  25. c->prev = tail;
  26. tail->next = c;
  27. tail = c;
  28. }
  29. else
  30. tail = newclients = c;
  31. }
  32. clients = newclients;
  33. }
  34. static Client *
  35. nexttiled(Client *c) {
  36. for(c = getnext(c); c && c->isfloat; c = getnext(c->next));
  37. return c;
  38. }
  39. /* extern */
  40. void (*arrange)(Arg *) = DEFMODE;
  41. void
  42. detach(Client *c) {
  43. if(c->prev)
  44. c->prev->next = c->next;
  45. if(c->next)
  46. c->next->prev = c->prev;
  47. if(c == clients)
  48. clients = c->next;
  49. c->next = c->prev = NULL;
  50. }
  51. void
  52. dofloat(Arg *arg) {
  53. Client *c;
  54. maximized = False;
  55. for(c = clients; c; c = c->next) {
  56. if(isvisible(c)) {
  57. resize(c, True, TopLeft);
  58. }
  59. else
  60. ban(c);
  61. }
  62. if(!sel || !isvisible(sel)) {
  63. for(c = stack; c && !isvisible(c); c = c->snext);
  64. focus(c);
  65. }
  66. restack();
  67. }
  68. void
  69. dotile(Arg *arg) {
  70. int h, i, n, w;
  71. Client *c;
  72. maximized = False;
  73. w = sw - mw;
  74. for(n = 0, c = clients; c; c = c->next)
  75. if(isvisible(c) && !c->isfloat)
  76. n++;
  77. if(n > 1)
  78. h = (sh - bh) / (n - 1);
  79. else
  80. h = sh - bh;
  81. for(i = 0, c = clients; c; c = c->next) {
  82. if(isvisible(c)) {
  83. if(c->isfloat) {
  84. resize(c, True, TopLeft);
  85. continue;
  86. }
  87. if(n == 1) {
  88. c->x = sx;
  89. c->y = sy + bh;
  90. c->w = sw - 2;
  91. c->h = sh - 2 - bh;
  92. }
  93. else if(i == 0) {
  94. c->x = sx;
  95. c->y = sy + bh;
  96. c->w = mw - 2;
  97. c->h = sh - 2 - bh;
  98. }
  99. else if(h > bh) {
  100. c->x = sx + mw;
  101. c->y = sy + (i - 1) * h + bh;
  102. c->w = w - 2;
  103. if(i + 1 == n)
  104. c->h = sh - c->y - 2;
  105. else
  106. c->h = h - 2;
  107. }
  108. else { /* fallback if h < bh */
  109. c->x = sx + mw;
  110. c->y = sy + bh;
  111. c->w = w - 2;
  112. c->h = sh - 2 - bh;
  113. }
  114. resize(c, False, TopLeft);
  115. i++;
  116. }
  117. else
  118. ban(c);
  119. }
  120. if(!sel || !isvisible(sel)) {
  121. for(c = stack; c && !isvisible(c); c = c->snext);
  122. focus(c);
  123. }
  124. restack();
  125. }
  126. void
  127. focusnext(Arg *arg) {
  128. Client *c;
  129. if(!sel)
  130. return;
  131. if(!(c = getnext(sel->next)))
  132. c = getnext(clients);
  133. if(c) {
  134. focus(c);
  135. restack();
  136. }
  137. }
  138. void
  139. focusprev(Arg *arg) {
  140. Client *c;
  141. if(!sel)
  142. return;
  143. if(!(c = getprev(sel->prev))) {
  144. for(c = clients; c && c->next; c = c->next);
  145. c = getprev(c);
  146. }
  147. if(c) {
  148. focus(c);
  149. restack();
  150. }
  151. }
  152. Bool
  153. isvisible(Client *c) {
  154. unsigned int i;
  155. for(i = 0; i < ntags; i++)
  156. if(c->tags[i] && seltag[i])
  157. return True;
  158. return False;
  159. }
  160. void
  161. resizecol(Arg *arg) {
  162. unsigned int n;
  163. Client *c;
  164. for(n = 0, c = clients; c; c = c->next)
  165. if(isvisible(c) && !c->isfloat)
  166. n++;
  167. if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized)
  168. return;
  169. if(sel == getnext(clients)) {
  170. if(mw + arg->i > sw - 100 || mw + arg->i < 100)
  171. return;
  172. mw += arg->i;
  173. }
  174. else {
  175. if(mw - arg->i > sw - 100 || mw - arg->i < 100)
  176. return;
  177. mw -= arg->i;
  178. }
  179. arrange(NULL);
  180. }
  181. void
  182. restack() {
  183. Client *c;
  184. XEvent ev;
  185. if(!sel) {
  186. drawstatus();
  187. return;
  188. }
  189. if(sel->isfloat || arrange == dofloat) {
  190. XRaiseWindow(dpy, sel->win);
  191. XRaiseWindow(dpy, sel->twin);
  192. }
  193. if(arrange != dofloat)
  194. for(c = nexttiled(clients); c; c = nexttiled(c->next)) {
  195. XLowerWindow(dpy, c->twin);
  196. XLowerWindow(dpy, c->win);
  197. }
  198. drawall();
  199. XSync(dpy, False);
  200. while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
  201. }
  202. void
  203. togglemode(Arg *arg) {
  204. arrange = (arrange == dofloat) ? dotile : dofloat;
  205. if(sel)
  206. arrange(NULL);
  207. else
  208. drawstatus();
  209. }
  210. void
  211. toggleview(Arg *arg) {
  212. unsigned int i;
  213. seltag[arg->i] = !seltag[arg->i];
  214. for(i = 0; i < ntags && !seltag[i]; i++);
  215. if(i == ntags)
  216. seltag[arg->i] = True; /* cannot toggle last view */
  217. reorder();
  218. arrange(NULL);
  219. }
  220. void
  221. view(Arg *arg) {
  222. unsigned int i;
  223. for(i = 0; i < ntags; i++)
  224. seltag[i] = False;
  225. seltag[arg->i] = True;
  226. reorder();
  227. arrange(NULL);
  228. }
  229. void
  230. viewall(Arg *arg) {
  231. unsigned int i;
  232. for(i = 0; i < ntags; i++)
  233. seltag[i] = True;
  234. reorder();
  235. arrange(NULL);
  236. }
  237. void
  238. zoom(Arg *arg) {
  239. unsigned int n;
  240. Client *c;
  241. for(n = 0, c = clients; c; c = c->next)
  242. if(isvisible(c) && !c->isfloat)
  243. n++;
  244. if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized)
  245. return;
  246. if((c = sel) == nexttiled(clients))
  247. if(!(c = nexttiled(c->next)))
  248. return;
  249. detach(c);
  250. if(clients)
  251. clients->prev = c;
  252. c->next = clients;
  253. clients = c;
  254. focus(c);
  255. arrange(NULL);
  256. }