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.

275 lines
4.6 KiB

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