void
tksetbits(Tk *tk, int mask)
{
tk->flag |= mask;
for(tk = tk->slave; tk; tk = tk->next)
tksetbits(tk, mask);
}
static char*
tkcvswindchk(Tk *tk, TkCwind *w, Tk *oldsub)
{
Tk *sub;
sub = w->sub;
if (sub != oldsub) {
w->sub = oldsub;
if(sub == nil)
return nil;
if(sub->flag & Tkwindow)
return TkIstop;
if(sub->master != nil || sub->parent != nil)
return TkWpack;
if (oldsub != nil) {
oldsub->parent = nil;
oldsub->geom = nil;
oldsub->destroyed = nil;
}
w->sub = sub;
w->focus = nil;
sub->parent = tk;
tksetbits(w->sub, Tksubsub);
sub->geom = tkcvswindgeom;
sub->destroyed = tkcvssubdestry;
if(w->width == 0)
w->width = sub->req.width;
if(w->height == 0)
w->height = sub->req.height;
}
return nil;
}
char*
tkpack(TkTop *t, char *arg, char **val)
{
TkParam param = defparam;
TkParam *p = ¶m;
TkOptab tko[2];
Tk *tk, **l, *tkp;
TkName *names, *n;
char *e, *w, *buf;
buf = mallocz(Tkminitem, 0);
if(buf == nil)
return TkNomem;
w = tkword(t, arg, buf, buf+Tkminitem, nil);
if(strcmp(buf, "forget") == 0) {
e = tkforget(t, w);
free(buf);
return e;
}
if(strcmp(buf, "propagate") == 0) {
e = tkpropagate(t, w);
free(buf);
return e;
}
if(strcmp(buf, "slaves") == 0) {
e = tkslaves(t, w, val);
free(buf);
return e;
}
free(buf);
tko[0].ptr = p;
tko[0].optab = opts;
tko[1].ptr = nil;
names = nil;
e = tkparse(t, arg, tko, &names);
if(e != nil)
return e;
if((p->before && p->before->master == nil) ||
(p->after && p->after->master == nil)) {
tkfreename(names);
return TkNotpk;
}
for(n = names; n; n = n->link) {
tkp = tklook(t, n->name, 0);
if(tkp == nil) {
tkerr(t, n->name);
tkfreename(names);
return TkBadwp;
}
if(tkp->flag & Tkwindow) {
tkfreename(names);
return TkIstop;
}
if(tkp->parent != nil) {
tkfreename(names);
return TkWpack;
}
n->obj = tkp;
}
e = nil;
for(n = names; n; n = n->link) {
tk = n->obj;
if(tk->master == nil) {
tk->pad = ZP;
tk->ipad = ZP;
tk->flag &= ~(Tkanchor|Tkside|Tkfill|Tkexpand);
tk->flag |= Tktop;
}
if(tk->master != nil) {
tkpackqit(tk->master);
tkdelpack(tk);
}
if(p->before == nil && p->after == nil && p->in == nil) {
tkp = tklook(t, n->name, 1);
if(tkp == nil) {
e = TkBadwp;
tkerr(t, n->name);
goto Error;
}
e = tkcanpack(tk, tkp);
if (e != nil)
goto Error;
tkappendpack(tkp, tk, -1);
}
else {
if(p->in != nil) {
e = tkcanpack(tk, p->in);
if(e != nil)
goto Error;
tkappendpack(p->in, tk, -1);
}
else
if(p->before != nil) {
e = tkcanpack(tk, p->before->master);
if (e != nil)
goto Error;
tk->master = p->before->master;
l = &tk->master->slave;
for(;;) {
if(*l == p->before) {
tk->next = *l;
*l = tk;
break;
}
l = &(*l)->next;
}
p->before = tk;
}
else {
e = tkcanpack(tk, p->after->master);
if (e != nil)
goto Error;
tk->master = p->after->master;
tk->next = p->after->next;
p->after->next = tk;
p->after = tk;
}
}
tksetopt(p, tk);
if (tk->master->flag&Tksubsub)
tksetbits(tk, Tksubsub);
tkpackqit(tk->master);
}
Error:
tkfreename(names);
tkrunpack(t);
return e;
}
