winlinks
RB_FOREACH(wl, winlinks, &s->windows)
TAILQ_FOREACH(wl, &w->winlinks, wentry)
TAILQ_FOREACH(wl, &w->winlinks, wentry) {
TAILQ_FOREACH(wl, &w->winlinks, wentry)
TAILQ_FOREACH(wl, &w->winlinks, wentry) {
TAILQ_FOREACH(wl, &w->winlinks, wentry)
TAILQ_FOREACH(wl, &w->winlinks, wentry) {
RB_FOREACH(wl_loop, winlinks, &fs->s->windows) {
fs->wl = RB_MIN(winlinks, &fs->s->windows);
fs->wl = RB_MAX(winlinks, &fs->s->windows);
RB_FOREACH(wl, winlinks, &fs->s->windows) {
RB_FOREACH(wl, winlinks, &fs->s->windows) {
RB_FOREACH(wl, winlinks, &fs->s->windows) {
RB_FOREACH(wl, winlinks, &fs->s->windows) {
RB_FOREACH(wl, winlinks, &s->windows) {
if (RB_PREV(winlinks, &s->windows, wl) == NULL &&
RB_NEXT(winlinks, &s->windows, wl) == NULL)
RB_FOREACH(loop, winlinks, &s->windows) {
RB_FOREACH(loop, winlinks, &s->windows) {
RB_FOREACH(wl, winlinks, &s->windows)
session_select(s, RB_MIN(winlinks, &s->windows)->idx);
RB_FOREACH(wl, winlinks, &s->windows) {
TAILQ_REMOVE(&w_dst->winlinks, wl_dst, wentry);
TAILQ_REMOVE(&w_src->winlinks, wl_src, wentry);
TAILQ_INSERT_TAIL(&w_src->winlinks, wl_dst, wentry);
TAILQ_INSERT_TAIL(&w_dst->winlinks, wl_src, wentry);
wl = TAILQ_FIRST(&w->winlinks);
RB_FOREACH(wl, winlinks, &ft->s->windows) {
RB_FOREACH(wl, winlinks, &ft->s->windows) {
RB_FOREACH(wl, winlinks, &ft->s->windows) {
wl = RB_MAX(winlinks, &ft->s->windows);
if (ft->wl == RB_MAX(winlinks, &ft->wl->session->windows))
RB_FOREACH(wl, winlinks, &s->windows) {
if (ft->wl == RB_MIN(winlinks, &ft->wl->session->windows))
RB_FOREACH(wl, winlinks, &ft->s->windows) {
RB_FOREACH(wl, winlinks, &s->windows) {
RB_FOREACH(wl, winlinks, &s->windows) {
TAILQ_FOREACH(wl, &w->winlinks, wentry) {
TAILQ_FOREACH(wl, &w->winlinks, wentry) {
TAILQ_FOREACH(wl, &w->winlinks, wentry) {
TAILQ_FOREACH(wl, &w->winlinks, wentry) {
TAILQ_FOREACH(wl, &w->winlinks, wentry) {
RB_FOREACH(wl, winlinks, &s->windows) {
RB_FOREACH(wl, winlinks, &s->windows) {
TAILQ_FOREACH(wl, &w->winlinks, wentry) {
TAILQ_FOREACH(wl, &w->winlinks, wentry) {
wl = RB_MIN(winlinks, &s->windows);
wl = RB_MAX(winlinks, &s->windows);
struct winlinks old_windows, *ww;
RB_FOREACH(wl, winlinks, ww) {
struct winlinks old_wins;
RB_FOREACH(wl, winlinks, &old_wins) {
RB_FOREACH_SAFE(wl, winlinks, &old_wins, wl1)
RB_FOREACH(wl, winlinks, &s->windows) {
RB_FOREACH(wl, winlinks, &s->windows) {
RB_FOREACH(wl, winlinks, &s->windows) {
RB_FOREACH(wl, winlinks, &s->windows) {
RB_FOREACH(wl, winlinks, &s->windows) {
RB_FOREACH(wl, winlinks, &s->windows) {
TAILQ_HEAD(, winlink) winlinks;
RB_HEAD(winlinks, winlink);
struct winlinks windows;
TAILQ_REMOVE(&other_window->winlinks, other_winlink, wentry);
TAILQ_REMOVE(&cur_window->winlinks, cur_winlink, wentry);
TAILQ_INSERT_TAIL(&cur_window->winlinks, other_winlink, wentry);
TAILQ_INSERT_TAIL(&other_window->winlinks, cur_winlink, wentry);
RB_FOREACH(wl, winlinks, &s->windows) {
RB_FOREACH(wl, winlinks, &s->windows) {
RB_FOREACH(wl, winlinks, &s->windows) {
winlink_find_by_window(struct winlinks *wwl, struct window *w)
RB_FOREACH(wl, winlinks, wwl) {
winlink_find_by_index(struct winlinks *wwl, int idx)
return (RB_FIND(winlinks, wwl, &wl));
TAILQ_FOREACH(loop, &wl->window->winlinks, wentry) {
winlink_find_by_window_id(struct winlinks *wwl, u_int id)
RB_REMOVE(winlinks, &s->windows, wl);
RB_INSERT(winlinks, &s->windows, wl);
RB_FOREACH(wl, winlinks, wwl) {
winlink_next_index(struct winlinks *wwl, int idx)
winlink_count(struct winlinks *wwl)
RB_FOREACH(wl, winlinks, wwl)
winlink_add(struct winlinks *wwl, int idx)
RB_INSERT(winlinks, wwl, wl);
TAILQ_REMOVE(&wl->window->winlinks, wl, wentry);
TAILQ_INSERT_TAIL(&w->winlinks, wl, wentry);
winlink_remove(struct winlinks *wwl, struct winlink *wl)
TAILQ_REMOVE(&w->winlinks, wl, wentry);
RB_REMOVE(winlinks, wwl, wl);
return (RB_NEXT(winlinks, wwl, wl));
return (RB_PREV(winlinks, wwl, wl));
if ((wl = RB_NEXT(winlinks, wwl, wl)) == NULL)
wl = RB_MIN(winlinks, &s->windows);
if ((wl = RB_PREV(winlinks, wwl, wl)) == NULL)
wl = RB_MAX(winlinks, &s->windows);
TAILQ_INIT(&w->winlinks);
RB_GENERATE(winlinks, winlink, entry, winlink_cmp);