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