2 * ion/mod_tiling/split.c
4 * Copyright (c) Tuomo Valkonen 1999-2007.
6 * See the included file LICENSE for details.
13 #include <libtu/minmax.h>
15 #include <libtu/objp.h>
16 #include <ioncore/common.h>
17 #include <ioncore/focus.h>
18 #include <ioncore/global.h>
19 #include <ioncore/window.h>
20 #include <ioncore/resize.h>
21 #include <ioncore/attach.h>
22 #include <ioncore/manage.h>
23 #include <ioncore/extlconv.h>
24 #include <ioncore/rectangle.h>
25 #include <ioncore/saveload.h>
26 #include <ioncore/names.h>
29 #include "split-stdisp.h"
32 static Rb_node split_of_map=NULL;
35 /*{{{ Geometry helper functions */
38 int split_size(WSplit *split, int dir)
40 return (dir==SPLIT_HORIZONTAL ? split->geom.w : split->geom.h);
43 int split_other_size(WSplit *split, int dir)
45 return (dir==SPLIT_VERTICAL ? split->geom.w : split->geom.h);
48 int split_pos(WSplit *split, int dir)
50 return (dir==SPLIT_HORIZONTAL ? split->geom.x : split->geom.y);
53 int split_other_pos(WSplit *split, int dir)
55 return (dir==SPLIT_VERTICAL ? split->geom.x : split->geom.y);
59 static int reg_calcresize(WRegion *reg, int dir, int nsize)
63 if(dir==SPLIT_HORIZONTAL)
64 tmp=region_min_w(reg);
66 tmp=region_min_h(reg);
68 return (nsize<tmp ? tmp : nsize);
72 /* No, these are not even supposed to be proper/consistent
73 * Z \cup {\infty, -\infty} calculation rules.
76 static int infadd(int x, int y)
78 if(x==INT_MAX || y==INT_MAX)
85 static int infsub(int x, int y)
96 /* Negative "unused space" means no SPLIT_UNUSED under a node, while
97 * zero unused space means there's a zero-sized SPLIT_UNUSED under the
100 static int unusedadd(int x, int y)
104 return maxof(x, 0)+maxof(y, 0);
108 static void bound(int *what, int min, int max)
120 /*{{{ Functions to get and set a region's containing node */
123 #define node_of_reg splittree_node_of
125 WSplitRegion *splittree_node_of(WRegion *reg)
130 /*assert(REGION_MANAGER_CHK(reg, WTiling)!=NULL);*/
132 if(split_of_map!=NULL){
133 node=rb_find_pkey_n(split_of_map, reg, &found);
135 return (WSplitRegion*)(node->v.val);
142 #define set_node_of_reg splittree_set_node_of
145 bool splittree_set_node_of(WRegion *reg, WSplitRegion *split)
150 /*assert(REGION_MANAGER_CHK(reg, WTiling)!=NULL);*/
152 if(split_of_map==NULL){
155 split_of_map=make_rb();
156 if(split_of_map==NULL)
160 node=rb_find_pkey_n(split_of_map, reg, &found);
162 rb_delete_node(node);
164 return (rb_insertp(split_of_map, reg, split)!=NULL);
174 WPrimn primn_invert(WPrimn primn)
176 return (primn==PRIMN_TL
184 WPrimn primn_none2any(WPrimn primn)
186 return (primn==PRIMN_NONE ? PRIMN_ANY : primn);
196 bool split_init(WSplit *split, const WRectangle *geom)
199 split->ws_if_root=NULL;
203 split->max_w=INT_MAX;
204 split->max_h=INT_MAX;
210 bool splitinner_init(WSplitInner *split, const WRectangle *geom)
212 return split_init(&(split->split), geom);
216 bool splitsplit_init(WSplitSplit *split, const WRectangle *geom, int dir)
218 splitinner_init(&(split->isplit), geom);
222 split->current=SPLIT_CURRENT_TL;
227 bool splitregion_init(WSplitRegion *split, const WRectangle *geom,
230 split_init(&(split->split), geom);
233 set_node_of_reg(reg, split);
238 bool splitst_init(WSplitST *split, const WRectangle *geom, WRegion *reg)
240 splitregion_init(&(split->regnode), geom, reg);
241 split->orientation=REGION_ORIENTATION_HORIZONTAL;
242 split->corner=MPLEX_STDISP_BL;
247 WSplitSplit *create_splitsplit(const WRectangle *geom, int dir)
249 CREATEOBJ_IMPL(WSplitSplit, splitsplit, (p, geom, dir));
253 WSplitRegion *create_splitregion(const WRectangle *geom, WRegion *reg)
255 CREATEOBJ_IMPL(WSplitRegion, splitregion, (p, geom, reg));
259 WSplitST *create_splitst(const WRectangle *geom, WRegion *reg)
261 CREATEOBJ_IMPL(WSplitST, splitst, (p, geom, reg));
271 void split_deinit(WSplit *split)
273 assert(split->parent==NULL);
277 void splitinner_deinit(WSplitInner *split)
279 split_deinit(&(split->split));
283 void splitsplit_deinit(WSplitSplit *split)
286 split->tl->parent=NULL;
287 destroy_obj((Obj*)(split->tl));
290 split->br->parent=NULL;
291 destroy_obj((Obj*)(split->br));
294 splitinner_deinit(&(split->isplit));
298 void splitregion_deinit(WSplitRegion *split)
300 if(split->reg!=NULL){
301 set_node_of_reg(split->reg, NULL);
305 split_deinit(&(split->split));
309 void splitst_deinit(WSplitST *split)
311 splitregion_deinit(&(split->regnode));
318 /*{{{ Size bounds management */
321 static void splitregion_update_bounds(WSplitRegion *node, bool recursive)
324 WSplit *snode=(WSplit*)node;
326 assert(node->reg!=NULL);
328 region_size_hints(node->reg, &hints);
330 snode->min_w=maxof(1, hints.min_set ? hints.min_width : 1);
331 snode->max_w=INT_MAX;
334 snode->min_h=maxof(1, hints.min_set ? hints.min_height : 1);
335 snode->max_h=INT_MAX;
340 static void splitst_update_bounds(WSplitST *node, bool rec)
342 WSplit *snode=(WSplit*)node;
344 if(node->regnode.reg==NULL){
345 snode->min_w=CF_STDISP_MIN_SZ;
346 snode->min_h=CF_STDISP_MIN_SZ;
347 snode->max_w=CF_STDISP_MIN_SZ;
348 snode->max_h=CF_STDISP_MIN_SZ;
351 region_size_hints(node->regnode.reg, &hints);
352 snode->min_w=maxof(1, hints.min_set ? hints.min_width : 1);
353 snode->max_w=maxof(snode->min_w, hints.min_width);
354 snode->min_h=maxof(1, hints.min_set ? hints.min_height : 1);
355 snode->max_h=maxof(snode->min_h, hints.min_height);
361 if(node->orientation==REGION_ORIENTATION_HORIZONTAL){
362 snode->min_w=CF_STDISP_MIN_SZ;
363 snode->max_w=INT_MAX;
365 snode->min_h=CF_STDISP_MIN_SZ;
366 snode->max_h=INT_MAX;
371 static void splitsplit_update_bounds(WSplitSplit *split, bool recursive)
374 WSplit *node=(WSplit*)split;
376 assert(split->tl!=NULL && split->br!=NULL);
382 split_update_bounds(tl, TRUE);
383 split_update_bounds(br, TRUE);
386 if(split->dir==SPLIT_HORIZONTAL){
387 node->max_w=infadd(tl->max_w, br->max_w);
388 node->min_w=infadd(tl->min_w, br->min_w);
389 node->unused_w=unusedadd(tl->unused_w, br->unused_w);
390 node->min_h=maxof(tl->min_h, br->min_h);
391 node->max_h=maxof(minof(tl->max_h, br->max_h), node->min_h);
392 node->unused_h=minof(tl->unused_h, br->unused_h);
394 node->max_h=infadd(tl->max_h, br->max_h);
395 node->min_h=infadd(tl->min_h, br->min_h);
396 node->unused_h=unusedadd(tl->unused_h, br->unused_h);
397 node->min_w=maxof(tl->min_w, br->min_w);
398 node->max_w=maxof(minof(tl->max_w, br->max_w), node->min_w);
399 node->unused_w=minof(tl->unused_w, br->unused_w);
404 void split_update_bounds(WSplit *node, bool recursive)
406 CALL_DYN(split_update_bounds, node, (node, recursive));
410 void splitsplit_update_geom_from_children(WSplitSplit *node)
412 WSplit *split=(WSplit*)node;
414 if(node->dir==SPLIT_VERTICAL){
415 ((WSplit*)node)->geom.h=node->tl->geom.h+node->br->geom.h;
416 ((WSplit*)node)->geom.y=node->tl->geom.y;
417 }else if(node->dir==SPLIT_HORIZONTAL){
418 ((WSplit*)node)->geom.w=node->tl->geom.w+node->br->geom.w;
419 ((WSplit*)node)->geom.x=node->tl->geom.x;
427 /*{{{ Status display handling helper functions. */
430 static WSplitST *saw_stdisp=NULL;
433 void splittree_begin_resize()
439 void splittree_end_resize()
441 if(saw_stdisp!=NULL){
442 split_regularise_stdisp(saw_stdisp);
448 static void splittree_scan_stdisp_rootward_(WSplitInner *node_)
450 WSplitSplit *node=OBJ_CAST(node_, WSplitSplit);
453 if(OBJ_IS(node->tl, WSplitST)){
454 saw_stdisp=(WSplitST*)(node->tl);
456 }else if(OBJ_IS(node->br, WSplitST)){
457 saw_stdisp=(WSplitST*)(node->br);
462 if(node_->split.parent!=NULL)
463 splittree_scan_stdisp_rootward_(node_->split.parent);
467 void splittree_scan_stdisp_rootward(WSplit *node)
469 if(node->parent!=NULL)
470 splittree_scan_stdisp_rootward_(node->parent);
474 static WSplitSplit *splittree_scan_stdisp_parent(WSplit *node_, bool set_saw)
476 WSplitSplit *r, *node=OBJ_CAST(node_, WSplitSplit);
481 if(OBJ_IS(node->tl, WSplitST)){
483 saw_stdisp=(WSplitST*)node->tl;
487 if(OBJ_IS(node->br, WSplitST)){
489 saw_stdisp=(WSplitST*)node->br;
493 r=splittree_scan_stdisp_parent(node->tl, set_saw);
495 r=splittree_scan_stdisp_parent(node->br, set_saw);
500 static bool stdisp_immediate_child(WSplitSplit *node)
502 return (node!=NULL && (OBJ_IS(node->tl, WSplitST) ||
503 OBJ_IS(node->br, WSplitST)));
507 static WSplit *move_stdisp_out_of_way(WSplit *node)
509 WSplitSplit *stdispp;
511 if(!OBJ_IS(node, WSplitSplit))
514 stdispp=splittree_scan_stdisp_parent(node, TRUE);
519 while(stdispp->tl!=node && stdispp->br!=node){
520 if(!split_try_unsink_stdisp(stdispp, FALSE, TRUE)){
521 warn(TR("Unable to move the status display out of way."));
526 return (WSplit*)stdispp;
533 /*{{{ Low-level resize code; from root to leaf */
536 static void split_do_resize_default(WSplit *node, const WRectangle *ng,
537 WPrimn hprimn, WPrimn vprimn,
544 static void splitregion_do_resize(WSplitRegion *node, const WRectangle *ng,
545 WPrimn hprimn, WPrimn vprimn,
548 assert(node->reg!=NULL);
549 region_fit(node->reg, ng, REGION_FIT_EXACT);
550 split_update_bounds(&(node->split), FALSE);
551 node->split.geom=*ng;
555 static void splitst_do_resize(WSplitST *node, const WRectangle *ng,
556 WPrimn hprimn, WPrimn vprimn,
561 if(node->regnode.reg==NULL){
562 ((WSplit*)node)->geom=*ng;
564 splitregion_do_resize(&(node->regnode), ng, hprimn, vprimn,
570 static int other_dir(int dir)
572 return (dir==SPLIT_VERTICAL ? SPLIT_HORIZONTAL : SPLIT_VERTICAL);
576 static void adjust_sizes(int *tls_, int *brs_, int nsize, int sz,
577 int tlmin, int brmin, int tlmax, int brmax,
585 bound(&tls, tlmin, tlmax);
587 bound(&brs, brmin, brmax);
589 bound(&tls, tlmin, tlmax);
590 }else if(primn==PRIMN_BR){
592 bound(&brs, brmin, brmax);
594 bound(&tls, tlmin, tlmax);
596 bound(&brs, brmin, brmax);
597 }else{ /* && PRIMN_ANY */
599 bound(&tls, tlmin, tlmax);
601 bound(&brs, brmin, brmax);
603 bound(&tls, tlmin, tlmax);
611 static void get_minmaxunused(WSplit *node, int dir,
612 int *min, int *max, int *unused)
614 if(dir==SPLIT_VERTICAL){
616 *max=maxof(*min, node->max_h);
617 *unused=minof(node->unused_h, node->geom.h);
620 *max=maxof(*min, node->max_w);
621 *unused=minof(node->unused_w, node->geom.w);
626 void splitsplit_do_resize(WSplitSplit *node, const WRectangle *ng,
627 WPrimn hprimn, WPrimn vprimn, bool transpose)
629 assert(ng->w>=0 && ng->h>=0);
630 assert(node->tl!=NULL && node->br!=NULL);
631 assert(!transpose || (hprimn==PRIMN_ANY && vprimn==PRIMN_ANY));
634 WSplit *tl=node->tl, *br=node->br;
635 int tls=split_size((WSplit*)tl, node->dir);
636 int brs=split_size((WSplit*)br, node->dir);
638 /* Status display can not be transposed. */
639 int dir=((transpose && !stdisp_immediate_child(node))
640 ? other_dir(node->dir)
642 int nsize=(dir==SPLIT_VERTICAL ? ng->h : ng->w);
643 int primn=(dir==SPLIT_VERTICAL ? vprimn : hprimn);
644 int tlmin, tlmax, tlunused, tlused;
645 int brmin, brmax, brunused, brused;
646 WRectangle tlg=*ng, brg=*ng;
648 get_minmaxunused(tl, dir, &tlmin, &tlmax, &tlunused);
649 get_minmaxunused(br, dir, &brmin, &brmax, &brunused);
651 tlused=maxof(0, tls-maxof(0, tlunused));
652 brused=maxof(0, brs-maxof(0, brunused));
653 /* tlmin, brmin >= 1 => (tls>=tlmin, brs>=brmin => sz>0) */
656 if(primn==PRIMN_ANY && (tlunused>=0 || brunused>=0)){
657 if(nsize<=tlused+brused){
658 /* Need to shrink a tangible node */
659 adjust_sizes(&tls, &brs, nsize, sz,
660 tlmin, brmin, tlused, brused, primn);
662 /* Just expand or shrink unused space */
663 adjust_sizes(&tls, &brs, nsize, sz,
665 (tlunused<0 ? tlused : tlmax),
666 (brunused<0 ? brused : brmax), primn);
670 adjust_sizes(&tls, &brs, nsize, sz,
671 tlmin, brmin, tlmax, brmax, primn);
676 /* Bad fit; just size proportionally. */
681 tls=split_size(tl, node->dir)*nsize/sz;
686 if(dir==SPLIT_VERTICAL){
696 split_do_resize(tl, &tlg, hprimn, vprimn, transpose);
697 split_do_resize(br, &brg, hprimn, vprimn, transpose);
700 ((WSplit*)node)->geom=*ng;
701 split_update_bounds((WSplit*)node, FALSE);
706 void split_do_resize(WSplit *node, const WRectangle *ng,
707 WPrimn hprimn, WPrimn vprimn, bool transpose)
709 CALL_DYN(split_do_resize, node, (node, ng, hprimn, vprimn, transpose));
713 void split_resize(WSplit *node, const WRectangle *ng,
714 WPrimn hprimn, WPrimn vprimn)
716 split_update_bounds(node, TRUE);
717 splittree_begin_resize();
718 split_do_resize(node, ng, hprimn, vprimn, FALSE);
719 splittree_end_resize();
726 /*{{{ Low-level resize code; request towards root */
729 static void flexibility(WSplit *node, int dir, int *shrink, int *stretch)
731 if(dir==SPLIT_VERTICAL){
732 *shrink=maxof(0, node->geom.h-node->min_h);
733 if(OBJ_IS(node, WSplitST))
734 *stretch=maxof(0, node->max_h-node->geom.h);
738 *shrink=maxof(0, node->geom.w-node->min_w);
739 if(OBJ_IS(node, WSplitST))
740 *stretch=maxof(0, node->max_w-node->geom.w);
747 static void calc_amount(int *amount, int rs, WSplit *other, int dir)
751 flexibility(other, dir, &shrink, &stretch);
754 *amount=minof(rs, shrink);
756 *amount=-minof(-rs, stretch);
763 static void splitsplit_do_rqsize(WSplitSplit *p, WSplit *node,
764 RootwardAmount *ha, RootwardAmount *va,
765 WRectangle *rg, bool tryonly)
767 WPrimn hprimn=PRIMN_ANY, vprimn=PRIMN_ANY;
768 WRectangle og, pg, ng;
774 assert(!ha->any || ha->tl==0);
775 assert(!va->any || va->tl==0);
776 assert(p->tl==node || p->br==node);
786 ca=(p->dir==SPLIT_VERTICAL ? va : ha);
788 if(thisnode==PRIMN_TL || ca->any){
789 calc_amount(&amount, ca->br, other, p->dir);
791 }else/*if(thisnode==PRIMN_BR)*/{
792 calc_amount(&amount, ca->tl, other, p->dir);
796 if(((WSplit*)p)->parent==NULL /*||
797 (ha->tl==0 && ha->br==0 && va->tl==0 && va->br==0)*/){
798 if(((WSplit*)p)->ws_if_root!=NULL)
799 pg=REGION_GEOM((WTiling*)(((WSplit*)p)->ws_if_root));
801 pg=((WSplit*)p)->geom;
803 splitinner_do_rqsize(((WSplit*)p)->parent, (WSplit*)p, ha, va,
807 assert(pg.w>=0 && pg.h>=0);
812 if(p->dir==SPLIT_VERTICAL){
813 ng.h=maxof(0, node->geom.h+amount);
814 og.h=maxof(0, other->geom.h-amount);
815 adjust_sizes(&(ng.h), &(og.h), pg.h, ng.h+og.h,
816 node->min_h, other->min_h, node->max_h, other->max_h,
817 PRIMN_TL /* node is passed as tl param */);
818 if(thisnode==PRIMN_TL)
824 ng.w=maxof(0, node->geom.w+amount);
825 og.w=maxof(0, other->geom.w-amount);
826 adjust_sizes(&(ng.w), &(og.w), pg.w, ng.w+og.w,
827 node->min_w, other->min_w, node->max_w, other->max_w,
828 PRIMN_TL /* node is passed as tl param */);
829 if(thisnode==PRIMN_TL)
837 /* Entä jos 'other' on stdisp? */
838 split_do_resize(other, &og, hprimn, vprimn, FALSE);
840 ((WSplit*)p)->geom=pg;
847 void splitinner_do_rqsize(WSplitInner *p, WSplit *node,
848 RootwardAmount *ha, RootwardAmount *va,
849 WRectangle *rg, bool tryonly)
851 CALL_DYN(splitinner_do_rqsize, p, (p, node, ha, va, rg, tryonly));
855 static void initra(RootwardAmount *ra, int p, int s, int op, int os,
860 ra->br=(p+s)-(op+os);
868 void split_do_rqgeom_(WSplit *node, const WRectangle *ng,
869 bool hany, bool vany, WRectangle *rg,
872 RootwardAmount ha, va;
874 if(node->parent==NULL){
875 if(node->ws_if_root!=NULL)
876 *rg=REGION_GEOM((WTiling*)(node->ws_if_root));
880 initra(&ha, ng->x, ng->w, node->geom.x, node->geom.w, hany);
881 initra(&va, ng->y, ng->h, node->geom.y, node->geom.h, vany);
883 splitinner_do_rqsize(node->parent, node, &ha, &va, rg, tryonly);
891 /*{{{ Resize interface */
894 static void bnd(int *pos, int *sz, int opos, int osz, int minsz, int maxsz)
896 int ud=abs(*pos-opos);
897 int dd=abs((*pos+*sz)-(opos+osz));
901 bound(sz, minsz, maxsz);
902 *pos+=(szrq-*sz)*ud/(ud+dd);
907 WSplit *split_find_root(WSplit *split)
909 if(split->parent==NULL)
911 return split_find_root((WSplit*)split->parent);
915 void splittree_rqgeom(WSplit *sub, int flags, const WRectangle *geom_,
918 bool hany=flags®ION_RQGEOM_WEAK_X;
919 bool vany=flags®ION_RQGEOM_WEAK_Y;
920 bool tryonly=flags®ION_RQGEOM_TRYONLY;
921 WRectangle geom=*geom_;
923 WSplit *root=split_find_root(sub);
928 split_update_bounds(root, TRUE);
930 if(OBJ_IS(sub, WSplitST)){
931 WSplitST *sub_as_stdisp=(WSplitST*)sub;
933 if(flags®ION_RQGEOM_TRYONLY){
934 warn(TR("REGION_RQGEOM_TRYONLY unsupported for status display."));
938 split_regularise_stdisp(sub_as_stdisp);
940 if(sub_as_stdisp->orientation==REGION_ORIENTATION_HORIZONTAL){
949 split_update_bounds(root, TRUE);
952 /* Handle internal size bounds */
953 bnd(&(geom.x), &(geom.w), sub->geom.x, sub->geom.w,
954 sub->min_w, sub->max_w);
955 bnd(&(geom.y), &(geom.h), sub->geom.y, sub->geom.h,
956 sub->min_h, sub->max_h);
958 /* Check if we should resize to both tl and br */
961 geom.w+=sub->geom.x-geom.x;
966 geom.h+=sub->geom.y-geom.y;
970 splittree_begin_resize();
972 split_do_rqgeom_(sub, &geom, hany, vany, geomret, tryonly);
975 split_do_resize(sub, geomret, hany, vany, FALSE);
976 splittree_end_resize();
985 * Attempt to resize and/or move the split tree starting at \var{node}.
986 * Behaviour and the \var{g} parameter are as for \fnref{WRegion.rqgeom}
987 * operating on \var{node} (if it were a \type{WRegion}).
990 ExtlTab split_rqgeom(WSplit *node, ExtlTab g)
992 WRectangle geom, ogeom;
993 int flags=REGION_RQGEOM_WEAK_ALL;
998 if(extl_table_gets_i(g, "x", &(geom.x)))
999 flags&=~REGION_RQGEOM_WEAK_X;
1000 if(extl_table_gets_i(g, "y", &(geom.y)))
1001 flags&=~REGION_RQGEOM_WEAK_Y;
1002 if(extl_table_gets_i(g, "w", &(geom.w)))
1003 flags&=~REGION_RQGEOM_WEAK_W;
1004 if(extl_table_gets_i(g, "h", &(geom.h)))
1005 flags&=~REGION_RQGEOM_WEAK_H;
1007 geom.w=maxof(1, geom.w);
1008 geom.h=maxof(1, geom.h);
1010 splittree_rqgeom(node, flags, &geom, &ogeom);
1012 return extl_table_from_rectangle(&ogeom);
1015 warn(TR("Invalid node."));
1016 return extl_table_none();
1026 void splittree_changeroot(WSplit *root, WSplit *node)
1028 WTiling *ws=(WTiling*)(root->ws_if_root);
1031 assert(ws->split_tree==root);
1032 root->ws_if_root=NULL;
1033 ws->split_tree=node;
1035 node->ws_if_root=ws;
1041 static void splitsplit_replace(WSplitSplit *split, WSplit *child,
1044 assert(split->tl==child || split->br==child);
1046 if(split->tl==child)
1053 what->parent=(WSplitInner*)split;
1054 what->ws_if_root=NULL; /* May not be needed. */
1058 void splitinner_replace(WSplitInner *split, WSplit *child, WSplit *what)
1060 CALL_DYN(splitinner_replace, split, (split, child, what));
1064 WSplitRegion *splittree_split(WSplit *node, int dir, WPrimn primn,
1065 int minsize, WRegionSimpleCreateFn *fn,
1070 WSplitSplit *nsplit;
1071 WSplitRegion *nnode;
1072 WSplitInner *psplit;
1077 assert(node!=NULL && parent!=NULL);
1079 if(OBJ_IS(node, WSplitST)){
1080 warn(TR("Splitting the status display is not allowed."));
1084 splittree_begin_resize();
1086 if(!move_stdisp_out_of_way(node))
1089 if(primn!=PRIMN_TL && primn!=PRIMN_BR)
1091 if(dir!=SPLIT_HORIZONTAL && dir!=SPLIT_VERTICAL)
1094 split_update_bounds(split_find_root(node), TRUE);
1095 objmin=(dir==SPLIT_VERTICAL ? node->min_h : node->min_w);
1097 s=split_size(node, dir);
1098 sn=maxof(minsize, s/2);
1099 so=maxof(objmin, s-sn);
1104 if(dir==SPLIT_VERTICAL)
1108 split_do_rqgeom_(node, &ng, TRUE, TRUE, &rg, TRUE);
1109 rs=(dir==SPLIT_VERTICAL ? rg.h : rg.w);
1110 if(rs<minsize+objmin){
1111 warn(TR("Unable to split: not enough free space."));
1114 split_do_rqgeom_(node, &ng, TRUE, TRUE, &rg, FALSE);
1115 rs=(dir==SPLIT_VERTICAL ? rg.h : rg.w);
1120 so=maxof(rs/2, objmin);
1125 splittree_scan_stdisp_rootward(node);
1128 /* Create split and new window
1130 fp.mode=REGION_FIT_EXACT;
1133 nsplit=create_splitsplit(&(fp.g), dir);
1138 if(dir==SPLIT_VERTICAL){
1148 nreg=fn(parent, &fp);
1151 destroy_obj((Obj*)nsplit);
1155 nnode=create_splitregion(&(fp.g), nreg);
1157 destroy_obj((Obj*)nreg);
1158 destroy_obj((Obj*)nsplit);
1162 /* Now that everything's ok, resize and move original node.
1165 if(dir==SPLIT_VERTICAL){
1175 split_do_resize(node, &ng,
1176 (dir==SPLIT_HORIZONTAL ? primn : PRIMN_ANY),
1177 (dir==SPLIT_VERTICAL ? primn : PRIMN_ANY),
1180 /* Set up split structure
1182 psplit=node->parent;
1185 splitinner_replace(psplit, node, (WSplit*)nsplit);
1187 splittree_changeroot(node, (WSplit*)nsplit);
1189 node->parent=(WSplitInner*)nsplit;
1190 ((WSplit*)nnode)->parent=(WSplitInner*)nsplit;
1192 if(primn==PRIMN_BR){
1194 nsplit->br=(WSplit*)nnode;
1195 nsplit->current=SPLIT_CURRENT_TL;
1197 nsplit->tl=(WSplit*)nnode;
1199 nsplit->current=SPLIT_CURRENT_BR;
1202 splittree_end_resize();
1214 static void splitsplit_remove(WSplitSplit *node, WSplit *child,
1217 static int nstdisp=0;
1218 WSplitInner *parent;
1221 assert(node->tl==child || node->br==child);
1228 assert(other!=NULL);
1230 if(nstdisp==0 && reclaim_space && OBJ_IS(other, WSplitST)){
1231 /* Try to move stdisp out of the way. */
1232 split_try_unsink_stdisp(node, FALSE, TRUE);
1233 assert(child->parent!=NULL);
1235 splitinner_remove(child->parent, child, reclaim_space);
1240 parent=((WSplit*)node)->parent;
1243 splitinner_replace(parent, (WSplit*)node, other);
1245 splittree_changeroot((WSplit*)node, other);
1248 split_resize(other, &(((WSplit*)node)->geom), PRIMN_ANY, PRIMN_ANY);
1254 ((WSplit*)node)->parent=NULL;
1255 destroy_obj((Obj*)node);
1259 void splitinner_remove(WSplitInner *node, WSplit *child, bool reclaim_space)
1261 CALL_DYN(splitinner_remove, node, (node, child, reclaim_space));
1265 void splittree_remove(WSplit *node, bool reclaim_space)
1267 if(node->parent!=NULL)
1268 splitinner_remove(node->parent, node, reclaim_space);
1269 else if(node->ws_if_root!=NULL)
1270 splittree_changeroot(node, NULL);
1272 destroy_obj((Obj*)node);
1279 /*{{{ Tree traversal */
1282 static bool defaultfilter(WSplit *node)
1284 return (OBJ_IS(node, WSplitRegion) &&
1285 ((WSplitRegion*)node)->reg!=NULL);
1289 static WSplit *split_current_todir_default(WSplit *node,
1290 WPrimn hprimn, WPrimn vprimn,
1291 WSplitFilter *filter)
1294 filter=defaultfilter;
1296 return (filter(node) ? node : NULL);
1300 static WSplit *splitsplit_current_todir(WSplitSplit *node,
1301 WPrimn hprimn, WPrimn vprimn,
1302 WSplitFilter *filter)
1304 WPrimn primn=(node->dir==SPLIT_HORIZONTAL ? hprimn : vprimn);
1305 WSplit *first, *second, *ret;
1307 if(primn==PRIMN_TL ||
1308 (primn==PRIMN_ANY && node->current==SPLIT_CURRENT_TL)){
1311 }else if(primn==PRIMN_BR ||
1312 (primn==PRIMN_ANY && node->current==SPLIT_CURRENT_BR)){
1319 ret=split_current_todir(first, hprimn, vprimn, filter);
1321 ret=split_current_todir(second, hprimn, vprimn, filter);
1322 if(ret==NULL && filter!=NULL){
1323 if(filter((WSplit*)node))
1331 WSplit *split_current_todir(WSplit *node, WPrimn hprimn, WPrimn vprimn,
1332 WSplitFilter *filter)
1335 CALL_DYN_RET(ret, WSplit*, split_current_todir, node,
1336 (node, hprimn, vprimn, filter));
1341 /* Note: both hprimn and vprimn are inverted when descending. Therefore
1342 * one should be either PRIMN_NONE or PRIMN_ANY for sensible geometric
1343 * navigation. (Both are PRIMN_TL or PRIMN_BR for pseudo-linear
1344 * next/previous navigation.)
1346 WSplit *splitsplit_nextto(WSplitSplit *node, WSplit *child,
1347 WPrimn hprimn, WPrimn vprimn,
1348 WSplitFilter *filter)
1350 WPrimn primn=(node->dir==SPLIT_HORIZONTAL ? hprimn : vprimn);
1351 WSplit *split=NULL, *nnode=NULL;
1353 if(node->tl==child && (primn==PRIMN_BR || primn==PRIMN_ANY))
1355 else if(node->br==child && (primn==PRIMN_TL || primn==PRIMN_ANY))
1359 nnode=split_current_todir(split,
1360 primn_none2any(primn_invert(hprimn)),
1361 primn_none2any(primn_invert(vprimn)),
1366 nnode=split_nextto((WSplit*)node, hprimn, vprimn, filter);
1372 WSplit *splitinner_nextto(WSplitInner *node, WSplit *child,
1373 WPrimn hprimn, WPrimn vprimn,
1374 WSplitFilter *filter)
1377 CALL_DYN_RET(ret, WSplit*, splitinner_nextto, node,
1378 (node, child, hprimn, vprimn, filter));
1383 WSplit *split_nextto(WSplit *node, WPrimn hprimn, WPrimn vprimn,
1384 WSplitFilter *filter)
1386 while(node->parent!=NULL){
1387 WSplit *ret=splitinner_nextto(node->parent, node,
1388 hprimn, vprimn, filter);
1391 node=(WSplit*)node->parent;
1397 void splitinner_mark_current_default(WSplitInner *split, WSplit *child)
1399 if(((WSplit*)split)->parent!=NULL)
1400 splitinner_mark_current(((WSplit*)split)->parent, (WSplit*)split);
1404 void splitsplit_mark_current(WSplitSplit *split, WSplit *child)
1406 assert(child==split->tl || child==split->br);
1408 split->current=(split->tl==child ? SPLIT_CURRENT_TL : SPLIT_CURRENT_BR);
1410 splitinner_mark_current_default(&(split->isplit), child);
1414 void splitinner_mark_current(WSplitInner *split, WSplit *child)
1416 CALL_DYN(splitinner_mark_current, split, (split, child));
1420 static void splitsplit_forall(WSplitSplit *node, WSplitFn *fn)
1427 void splitinner_forall(WSplitInner *node, WSplitFn *fn)
1429 CALL_DYN(splitinner_forall, node, (node, fn));
1433 static WSplit *splitsplit_current(WSplitSplit *split)
1435 return (split->current==SPLIT_CURRENT_TL ? split->tl : split->br);
1440 * Returns the most previously active child node of \var{split}.
1444 WSplit *splitinner_current(WSplitInner *node)
1447 CALL_DYN_RET(ret, WSplit*, splitinner_current, node, (node));
1455 /*{{{ X window handling */
1458 static void splitregion_stacking(WSplitRegion *split,
1459 Window *bottomret, Window *topret)
1463 if(split->reg!=NULL)
1464 region_stacking(split->reg, bottomret, topret);
1468 void splitsplit_stacking(WSplitSplit *split,
1469 Window *bottomret, Window *topret)
1471 Window tlb=None, tlt=None;
1472 Window brb=None, brt=None;
1474 split_stacking(split->tl, &tlb, &tlt);
1475 split_stacking(split->br, &brb, &brt);
1477 /* To make sure that this condition holds is left to the workspace
1478 * code to do after a split tree has been loaded or modified.
1480 if(split->current==SPLIT_CURRENT_TL){
1481 *topret=(tlt!=None ? tlt : brt);
1482 *bottomret=(brb!=None ? brb : tlb);
1484 *topret=(brt!=None ? brt : tlt);
1485 *bottomret=(tlb!=None ? tlb : brb);
1489 void split_stacking(WSplit *split, Window *bottomret, Window *topret)
1494 CALL_DYN(split_stacking, split, (split, bottomret, topret));
1499 static void splitregion_restack(WSplitRegion *split, Window other, int mode)
1501 if(split->reg!=NULL)
1502 region_restack(split->reg, other, mode);
1505 void splitsplit_restack(WSplitSplit *split, Window other, int mode)
1507 Window bottom=None, top=None;
1508 WSplit *first, *second;
1510 if(split->current==SPLIT_CURRENT_TL){
1518 split_restack(first, other, mode);
1519 split_stacking(first, &bottom, &top);
1524 split_restack(second, other, mode);
1527 void split_restack(WSplit *split, Window other, int mode)
1529 CALL_DYN(split_restack, split, (split, other, mode));
1533 static void splitregion_map(WSplitRegion *split)
1535 if(split->reg!=NULL)
1536 region_map(split->reg);
1539 static void splitinner_map(WSplitInner *split)
1541 splitinner_forall(split, split_map);
1544 void split_map(WSplit *split)
1546 CALL_DYN(split_map, split, (split));
1550 static void splitregion_unmap(WSplitRegion *split)
1552 if(split->reg!=NULL)
1553 region_unmap(split->reg);
1556 static void splitinner_unmap(WSplitInner *split)
1558 splitinner_forall(split, split_unmap);
1561 void split_unmap(WSplit *split)
1563 CALL_DYN(split_unmap, split, (split));
1567 static void splitregion_reparent(WSplitRegion *split, WWindow *wwin)
1569 if(split->reg!=NULL){
1570 WRectangle g=split->split.geom;
1571 region_reparent(split->reg, wwin, &g, REGION_FIT_EXACT);
1576 static void splitsplit_reparent(WSplitSplit *split, WWindow *wwin)
1578 if(split->current==SPLIT_CURRENT_TL){
1579 split_reparent(split->br, wwin);
1580 split_reparent(split->tl, wwin);
1582 split_reparent(split->tl, wwin);
1583 split_reparent(split->br, wwin);
1588 void split_reparent(WSplit *split, WWindow *wwin)
1590 CALL_DYN(split_reparent, split, (split, wwin));
1597 /*{{{ Transpose, flip, rotate */
1600 void splitsplit_flip_default(WSplitSplit *split)
1602 WRectangle tlng, brng;
1603 WRectangle *sg=&((WSplit*)split)->geom;
1606 assert(split->tl!=NULL && split->br!=NULL);
1608 split_update_bounds((WSplit*)split, TRUE);
1610 tlng=split->tl->geom;
1611 brng=split->br->geom;
1613 if(split->dir==SPLIT_HORIZONTAL){
1615 tlng.x=sg->x+sg->w-tlng.w;
1618 tlng.y=sg->y+sg->h-tlng.h;
1622 split->tl=split->br;
1624 split->current=(split->current==SPLIT_CURRENT_TL
1626 : SPLIT_CURRENT_TL);
1628 split_do_resize(split->tl, &brng, PRIMN_ANY, PRIMN_ANY, FALSE);
1629 split_do_resize(split->br, &tlng, PRIMN_ANY, PRIMN_ANY, FALSE);
1633 static void splitsplit_flip_(WSplitSplit *split)
1635 CALL_DYN(splitsplit_flip, split, (split));
1640 * Flip contents of \var{node}.
1643 void splitsplit_flip(WSplitSplit *split)
1645 splittree_begin_resize();
1647 if(!move_stdisp_out_of_way((WSplit*)split))
1650 splitsplit_flip_(split);
1652 splittree_end_resize();
1663 static FlipDir flipdir=FLIP_VERTICAL;
1666 static void do_flip(WSplit *split)
1668 WSplitSplit *ss=OBJ_CAST(split, WSplitSplit);
1671 if((flipdir==FLIP_ANY
1672 || (ss->dir==SPLIT_VERTICAL && flipdir==FLIP_VERTICAL)
1673 || (ss->dir==SPLIT_HORIZONTAL && flipdir==FLIP_HORIZONTAL))
1674 && !OBJ_IS(ss->tl, WSplitST)
1675 && !OBJ_IS(ss->br, WSplitST)){
1676 splitsplit_flip_(ss);
1680 if(OBJ_IS(ss, WSplitInner))
1681 splitinner_forall((WSplitInner*)ss, do_flip);
1685 static void splittree_flip_dir(WSplit *splittree, FlipDir dir)
1687 /* todo stdisp outta way */
1688 if(OBJ_IS(splittree, WSplitInner)){
1690 splitinner_forall((WSplitInner*)splittree, do_flip);
1695 static bool split_fliptrans_to(WSplit *node, const WRectangle *geom,
1696 bool trans, FlipDir flip)
1701 splittree_begin_resize();
1703 /* split_do_resize can do things right if 'node' has stdisp as child,
1704 * but otherwise transpose will put the stdisp in a bad split
1705 * configuration if it is contained within 'node', so we must
1706 * first move it and its fixed parent split below node. For correct
1707 * geometry calculation we move it immediately below node, and
1708 * resize stdisp's fixed parent node instead.
1710 node2=move_stdisp_out_of_way(node);
1715 split_update_bounds(node2, TRUE);
1717 split_do_rqgeom_(node2, geom, PRIMN_ANY, PRIMN_ANY, &rg, FALSE);
1719 split_do_resize(node2, &rg, PRIMN_ANY, PRIMN_ANY, trans);
1722 splittree_flip_dir(node2, flip);
1724 splittree_end_resize();
1730 bool split_transpose_to(WSplit *node, const WRectangle *geom)
1732 return split_fliptrans_to(node, geom, TRUE, FLIP_ANY);
1737 * Transpose contents of \var{node}.
1740 void split_transpose(WSplit *node)
1742 WRectangle g=node->geom;
1744 split_transpose_to(node, &g);
1748 bool split_rotate_to(WSplit *node, const WRectangle *geom, int rotation)
1750 FlipDir flip=FLIP_NONE;
1753 if(rotation==SCREEN_ROTATION_90){
1754 flip=FLIP_HORIZONTAL;
1756 }else if(rotation==SCREEN_ROTATION_180){
1758 }else if(rotation==SCREEN_ROTATION_270){
1763 return split_fliptrans_to(node, geom, trans, flip);
1773 * Return parent split for \var{split}.
1777 WSplitInner *split_parent(WSplit *split)
1779 return split->parent;
1784 * Returns the area of workspace used by the regions under \var{split}.
1788 ExtlTab split_geom(WSplit *split)
1790 return extl_table_from_rectangle(&(split->geom));
1795 * Returns the top or left child node of \var{split} depending
1796 * on the direction of the split.
1800 WSplit *splitsplit_tl(WSplitSplit *split)
1807 * Returns the bottom or right child node of \var{split} depending
1808 * on the direction of the split.
1812 WSplit *splitsplit_br(WSplitSplit *split)
1818 * Returns the direction of \var{split}; either \codestr{vertical} or
1819 * \codestr{horizontal}.
1823 const char *splitsplit_dir(WSplitSplit *split)
1825 return (split->dir==SPLIT_VERTICAL ? "vertical" : "horizontal");
1830 * Returns the region contained in \var{node}.
1834 WRegion *splitregion_reg(WSplitRegion *node)
1843 /*{{{ Save support */
1846 ExtlTab split_base_config(WSplit *node)
1848 ExtlTab t=extl_create_table();
1849 extl_table_sets_s(t, "type", OBJ_TYPESTR(node));
1854 static bool splitregion_get_config(WSplitRegion *node, ExtlTab *ret)
1861 if(!region_supports_save(node->reg)){
1862 warn(TR("Unable to get configuration for %s."),
1863 region_name(node->reg));
1867 rt=region_get_configuration(node->reg);
1868 t=split_base_config(&(node->split));
1869 extl_table_sets_t(t, "regparams", rt);
1870 extl_unref_table(rt);
1877 static bool splitst_get_config(WSplitST *node, ExtlTab *ret)
1879 *ret=split_base_config((WSplit*)node);
1884 static bool splitsplit_get_config(WSplitSplit *node, ExtlTab *ret)
1886 ExtlTab tab, tltab, brtab;
1889 if(!split_get_config(node->tl, &tltab))
1890 return split_get_config(node->br, ret);
1892 if(!split_get_config(node->br, &brtab)){
1897 tab=split_base_config((WSplit*)node);
1899 tls=split_size(node->tl, node->dir);
1900 brs=split_size(node->br, node->dir);
1902 extl_table_sets_s(tab, "dir", (node->dir==SPLIT_VERTICAL
1903 ? "vertical" : "horizontal"));
1905 extl_table_sets_i(tab, "tls", tls);
1906 extl_table_sets_t(tab, "tl", tltab);
1907 extl_unref_table(tltab);
1909 extl_table_sets_i(tab, "brs", brs);
1910 extl_table_sets_t(tab, "br", brtab);
1911 extl_unref_table(brtab);
1919 bool split_get_config(WSplit *node, ExtlTab *tabret)
1922 CALL_DYN_RET(ret, bool, split_get_config, node, (node, tabret));
1930 /*{{{ The classes */
1933 static DynFunTab split_dynfuntab[]={
1934 {split_do_resize, split_do_resize_default},
1935 {(DynFun*)split_current_todir, (DynFun*)split_current_todir_default},
1939 static DynFunTab splitinner_dynfuntab[]={
1940 {splitinner_mark_current, splitinner_mark_current_default},
1941 {split_map, splitinner_map},
1942 {split_unmap, splitinner_unmap},
1946 static DynFunTab splitsplit_dynfuntab[]={
1947 {split_update_bounds, splitsplit_update_bounds},
1948 {split_do_resize, splitsplit_do_resize},
1949 {splitinner_do_rqsize, splitsplit_do_rqsize},
1950 {splitinner_replace, splitsplit_replace},
1951 {splitinner_remove, splitsplit_remove},
1952 {(DynFun*)split_current_todir, (DynFun*)splitsplit_current_todir},
1953 {(DynFun*)splitinner_current, (DynFun*)splitsplit_current},
1954 {(DynFun*)splitinner_nextto, (DynFun*)splitsplit_nextto},
1955 {splitinner_mark_current, splitsplit_mark_current},
1956 {(DynFun*)split_get_config, (DynFun*)splitsplit_get_config},
1957 {splitinner_forall, splitsplit_forall},
1958 {split_restack, splitsplit_restack},
1959 {split_stacking, splitsplit_stacking},
1960 {split_reparent, splitsplit_reparent},
1961 {splitsplit_flip, splitsplit_flip_default},
1965 static DynFunTab splitregion_dynfuntab[]={
1966 {split_update_bounds, splitregion_update_bounds},
1967 {split_do_resize, splitregion_do_resize},
1968 {(DynFun*)split_get_config, (DynFun*)splitregion_get_config},
1969 {split_map, splitregion_map},
1970 {split_unmap, splitregion_unmap},
1971 {split_restack, splitregion_restack},
1972 {split_stacking, splitregion_stacking},
1973 {split_reparent, splitregion_reparent},
1977 static DynFunTab splitst_dynfuntab[]={
1978 {split_update_bounds, splitst_update_bounds},
1979 {split_do_resize, splitst_do_resize},
1980 {(DynFun*)split_get_config, (DynFun*)splitst_get_config},
1986 IMPLCLASS(WSplit, Obj, split_deinit, split_dynfuntab);
1989 IMPLCLASS(WSplitInner, WSplit, splitinner_deinit, splitinner_dynfuntab);
1992 IMPLCLASS(WSplitSplit, WSplitInner, splitsplit_deinit, splitsplit_dynfuntab);
1995 IMPLCLASS(WSplitRegion, WSplit, splitregion_deinit, splitregion_dynfuntab);
1998 IMPLCLASS(WSplitST, WSplitRegion, splitst_deinit, splitst_dynfuntab);