about summary refs log tree commit diff stats
path: root/tile.c
blob: 2481eb3be8143314703343ac9f62587f383dae31 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
/* See LICENSE file for copyright and license details. */
#include "dwm.h"
#include <stdio.h>

/* static */

static double mwfact = MWFACT;

/* extern */

void
addtomwfact(const char *arg) {
	double delta;

	if(lt->arrange != tile)
		return;

	/* arg handling, manipulate mwfact */
	if(arg && (1 == sscanf(arg, "%lf", &delta))) {
		if(delta + mwfact > 0.1 && delta + mwfact < 0.9)
			mwfact += delta;
	}
	lt->arrange();
}

void
tile(void) {
	unsigned int i, n, nx, ny, nw, nh, mw, th;
	Client *c;

	for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
		n++;

	/* window geoms */
	mw = (n == 1) ? waw : mwfact * waw;
	th = (n > 1) ? wah / (n - 1) : 0;
	if(n > 1 && th < bh)
		th = wah;

	nx = wax;
	ny = way;
	for(i = 0, c = clients; c; c = c->next)
		if(isvisible(c)) {
			unban(c);
			if(c->isfloating)
				continue;
			c->ismax = False;
			if(i == 0) { /* master */
				nw = mw - 2 * c->border;
				nh = wah - 2 * c->border;
			}
			else {  /* tile window */
				if(i == 1) {
					ny = way;
					nx += mw;
				}
				nw = waw - mw - 2 * c->border;
				if(i + 1 == n) /* remainder */
					nh = (way + wah) - ny - 2 * c->border;
				else
					nh = th - 2 * c->border;
			}
			resize(c, nx, ny, nw, nh, False);
			if(n > 1 && th != wah)
				ny += nh + 2 * c->border;
			i++;
		}
		else
			ban(c);
	focus(NULL);
	restack();
}

void
zoom(const char *arg) {
	Client *c;

	if(!sel || lt->arrange == floating || sel->isfloating)
		return;
	if((c = sel) == nexttiled(clients))
		if(!(c = nexttiled(c->next)))
			return;
	detach(c);
	attach(c);
	focus(c);
	lt->arrange();
}
op.s == "&" or op.id == ord(wAnd): compileConstraints(p.sons[1], result) compileConstraints(p.sons[2], result) result.add(ppAnd) else: patternError(p) elif p.len == 2 and (op.s == "~" or op.id == ord(wNot)): compileConstraints(p.sons[1], result) result.add(ppNot) else: patternError(p) of nkAccQuoted, nkPar: if p.len == 1: compileConstraints(p.sons[0], result) else: patternError(p) of nkIdent: let spec = p.ident.s.normalize case spec of "atom": result.add(ppAtom) of "lit": result.add(ppLit) of "sym": result.add(ppSym) of "ident": result.add(ppIdent) of "call": result.add(ppCall) of "alias": result[0] = chr(aqShouldAlias.ord) of "noalias": result[0] = chr(aqNoAlias.ord) of "lvalue": result.add(ppLValue) of "local": result.add(ppLocal) of "sideeffect": result.add(ppSideEffect) of "nosideeffect": result.add(ppNoSideEffect) else: # check all symkinds: internalAssert int(high(TSymKind)) < 255 for i in low(TSymKind)..high(TSymKind): if cmpIgnoreStyle(($i).substr(2), spec) == 0: result.add(ppSymKind) result.add(chr(i.ord)) return # check all nodekinds: internalAssert int(high(TNodeKind)) < 255 for i in low(TNodeKind)..high(TNodeKind): if cmpIgnoreStyle($i, spec) == 0: result.add(ppNodeKind) result.add(chr(i.ord)) return patternError(p) else: patternError(p) proc semNodeKindConstraints*(p: PNode): PNode = ## does semantic checking for a node kind pattern and compiles it into an ## efficient internal format. assert p.kind == nkCurlyExpr result = newNodeI(nkStrLit, p.info) result.strVal = newStringOfCap(10) result.strVal.add(chr(aqNone.ord)) if p.len >= 2: for i in 1.. <p.len: compileConstraints(p.sons[i], result.strVal) if result.strVal.len > MaxStackSize-1: internalError(p.info, "parameter pattern too complex") else: patternError(p) result.strVal.add(ppEof) type TSideEffectAnalysis* = enum seUnknown, seSideEffect, seNoSideEffect proc checkForSideEffects*(n: PNode): TSideEffectAnalysis = case n.kind of nkCallKinds: # only calls can produce side effects: let op = n.sons[0] if op.kind == nkSym and isRoutine(op.sym): let s = op.sym if sfSideEffect in s.flags: return seSideEffect # assume no side effect: result = seNoSideEffect elif tfNoSideEffect in op.typ.flags: # indirect call without side effects: result = seNoSideEffect else: # indirect call: assume side effect: return seSideEffect # we need to check n[0] too: (FwithSideEffectButReturnsProcWithout)(args) for i in 0 .. <n.len: let ret = checkForSideEffects(n.sons[i]) if ret == seSideEffect: return ret elif ret == seUnknown and result == seNoSideEffect: result = seUnknown of nkNone..nkNilLit: # an atom cannot produce a side effect: result = seNoSideEffect else: # assume no side effect: result = seNoSideEffect for i in 0 .. <n.len: let ret = checkForSideEffects(n.sons[i]) if ret == seSideEffect: return ret elif ret == seUnknown and result == seNoSideEffect: result = seUnknown type TAssignableResult* = enum arNone, # no l-value and no discriminant arLValue, # is an l-value arLocalLValue, # is an l-value, but local var; must not escape # its stack frame! arDiscriminant, # is a discriminant arStrange # it is a strange beast like 'typedesc[var T]' proc isAssignable*(owner: PSym, n: PNode; isUnsafeAddr=false): TAssignableResult = ## 'owner' can be nil! result = arNone case n.kind of nkSym: let kinds = if isUnsafeAddr: {skVar, skResult, skTemp, skParam, skLet} else: {skVar, skResult, skTemp} if n.sym.kind in kinds: if owner != nil and owner.id == n.sym.owner.id and sfGlobal notin n.sym.flags: result = arLocalLValue else: result = arLValue elif n.sym.kind == skParam and n.sym.typ.kind == tyVar: result = arLValue elif n.sym.kind == skType: let t = n.sym.typ.skipTypes({tyTypeDesc}) if t.kind == tyVar: result = arStrange of nkDotExpr: if skipTypes(n.sons[0].typ, abstractInst-{tyTypeDesc}).kind in {tyVar, tyPtr, tyRef}: result = arLValue else: result = isAssignable(owner, n.sons[0], isUnsafeAddr) if result != arNone and sfDiscriminant in n.sons[1].sym.flags: result = arDiscriminant of nkBracketExpr: if skipTypes(n.sons[0].typ, abstractInst-{tyTypeDesc}).kind in {tyVar, tyPtr, tyRef}: result = arLValue else: result = isAssignable(owner, n.sons[0], isUnsafeAddr) of nkHiddenStdConv, nkHiddenSubConv, nkConv: # Object and tuple conversions are still addressable, so we skip them # XXX why is 'tyOpenArray' allowed here? if skipTypes(n.typ, abstractPtrs-{tyTypeDesc}).kind in {tyOpenArray, tyTuple, tyObject}: result = isAssignable(owner, n.sons[1], isUnsafeAddr) elif compareTypes(n.typ, n.sons[1].typ, dcEqIgnoreDistinct): # types that are equal modulo distinction preserve l-value: result = isAssignable(owner, n.sons[1], isUnsafeAddr) of nkHiddenDeref, nkDerefExpr, nkHiddenAddr: result = arLValue of nkObjUpConv, nkObjDownConv, nkCheckedFieldExpr: result = isAssignable(owner, n.sons[0], isUnsafeAddr) of nkCallKinds: # builtin slice keeps lvalue-ness: if getMagic(n) in {mArrGet, mSlice}: result = isAssignable(owner, n.sons[1], isUnsafeAddr) of nkStmtList, nkStmtListExpr: if n.typ != nil: result = isAssignable(owner, n.lastSon, isUnsafeAddr) else: discard proc isLValue*(n: PNode): bool = isAssignable(nil, n) in {arLValue, arLocalLValue, arStrange} proc matchNodeKinds*(p, n: PNode): bool = # matches the parameter constraint 'p' against the concrete AST 'n'. # Efficiency matters here. var stack {.noinit.}: array[0..MaxStackSize, bool] # empty patterns are true: stack[0] = true var sp = 1 template push(x: bool) = stack[sp] = x inc sp let code = p.strVal var pc = 1 while true: case TOpcode(code[pc]) of ppEof: break of ppOr: stack[sp-2] = stack[sp-1] or stack[sp-2] dec sp of ppAnd: stack[sp-2] = stack[sp-1] and stack[sp-2] dec sp of ppNot: stack[sp-1] = not stack[sp-1] of ppSym: push n.kind == nkSym of ppAtom: push isAtom(n) of ppLit: push n.kind in {nkCharLit..nkNilLit} of ppIdent: push n.kind == nkIdent of ppCall: push n.kind in nkCallKinds of ppSymKind: let kind = TSymKind(code[pc+1]) push n.kind == nkSym and n.sym.kind == kind inc pc of ppNodeKind: let kind = TNodeKind(code[pc+1]) push n.kind == kind inc pc of ppLValue: push isAssignable(nil, n) in {arLValue, arLocalLValue} of ppLocal: push isAssignable(nil, n) == arLocalLValue of ppSideEffect: push checkForSideEffects(n) == seSideEffect of ppNoSideEffect: push checkForSideEffects(n) != seSideEffect inc pc result = stack[sp-1]