- c->x += master;
- c->w = tw - 2 * BORDERPX;
- c->h = th - 2 * BORDERPX;
- switch(stackpos) {
- case StackLeft:
- case StackRight:
- c->y = sy + (i - 1) * th + bh;
- if(i + 1 == n)
- c->h = sh - c->y - 2 * BORDERPX;
- break;
- case StackBottom:
- c->y = sy + master + (i - 1) * th + bh;
- if(i + 1 == n)
- c->h = sh - c->y - 2 * BORDERPX;
- break;
+ c->x += md;
+ if(th > bh) {
+ switch(stackpos) {
+ case StackLeft:
+ case StackRight:
+ c->y = sy + (i - 1) * th + bh;
+ if(i + 1 == n)
+ c->h = sh - c->y - 2 * BORDERPX;
+ break;
+ case StackBottom:
+ c->y = sy + md + (i - 1) * th + bh;
+ if(i + 1 == n)
+ c->h = sh - c->y - 2 * BORDERPX;
+ break;
+ }
+ c->w = tw - 2 * BORDERPX;
+ c->h = th - 2 * BORDERPX;
+ }
+ else { /* fallback if th < bh */
+ if(stackpos == StackBottom)
+ c->y += md;
+ c->w = stackw - 2 * BORDERPX;
+ c->h = stackh - 2 * BORDERPX;