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.

320 lines
4.6 KiB

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