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.

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