Home
last modified time | relevance | path

Searched refs:nodes_head (Results 1 – 25 of 49) sorted by relevance

12

/dports/x11-wm/i3/i3-4.20.1/src/
H A Dtree.c94 croot = TAILQ_FIRST(&(croot->nodes_head)); in tree_restore()
100 Con *out = TAILQ_FIRST(&(croot->nodes_head)); in tree_restore()
102 Con *ws = TAILQ_FIRST(&(out->nodes_head)); in tree_restore()
112 TAILQ_REMOVE(&(croot->nodes_head), __i3, nodes); in tree_restore()
206 for (child = TAILQ_FIRST(&(con->nodes_head)); child;) { in tree_close_internal()
434 TAILQ_FOREACH (current, &(con->nodes_head), nodes) { in mark_unmapped()
549 Con *const wrap = previous ? TAILQ_LAST(&(parent->nodes_head), nodes_head) in get_tree_next()
662 child = TAILQ_FIRST(&(con->nodes_head)); in tree_flatten()
684 while (!TAILQ_EMPTY(&(child->nodes_head))) { in tree_flatten()
685 current = TAILQ_FIRST(&(child->nodes_head)); in tree_flatten()
[all …]
H A Dworkspace.c32 TAILQ_FOREACH (output, &(croot->nodes_head), nodes) { in get_existing_workspace_by_name()
46 TAILQ_FOREACH (output, &(croot->nodes_head), nodes) { in get_existing_workspace_by_num()
630 prev = TAILQ_PREV(current, nodes_head, nodes); in workspace_prev()
635 TAILQ_FOREACH_REVERSE (output, &(croot->nodes_head), nodes_head, nodes) { in workspace_prev()
657 TAILQ_FOREACH_REVERSE (output, &(croot->nodes_head), nodes_head, nodes) { in workspace_prev()
752 prev = TAILQ_PREV(current, nodes_head, nodes); in workspace_prev_on_output()
871 while (!TAILQ_EMPTY(&(ws->nodes_head))) { in ws_force_orientation()
872 Con *child = TAILQ_FIRST(&(ws->nodes_head)); in ws_force_orientation()
935 if (TAILQ_EMPTY(&(ws->nodes_head))) { in workspace_encapsulate()
949 while (!TAILQ_EMPTY(&(ws->nodes_head))) { in workspace_encapsulate()
[all …]
H A Dcon.c55 TAILQ_INIT(&(new->nodes_head)); in con_new_skeleton()
103 struct nodes_head *nodes_head = &(parent->nodes_head); in _con_attach() local
111 TAILQ_INSERT_TAIL(nodes_head, con, nodes); in _con_attach()
113 current = TAILQ_FIRST(nodes_head); in _con_attach()
141 TAILQ_FOREACH (loop, nodes_head, nodes) { in _con_attach()
154 TAILQ_INSERT_TAIL(nodes_head, con, nodes); in _con_attach()
187 nodes_head = &(target->nodes_head); in _con_attach()
362 return TAILQ_EMPTY(&(con->nodes_head)); in con_is_leaf()
1603 most = TAILQ_LAST(&(con->nodes_head), nodes_head); in con_descend_direction()
1626 most = TAILQ_LAST(&(con->nodes_head), nodes_head); in con_descend_direction()
[all …]
H A Dmove.c161 TAILQ_INSERT_AFTER(&(parent->nodes_head), target, con, nodes); in insert_con_into()
185 TAILQ_INSERT_HEAD(&(ws->nodes_head), con, nodes); in attach_to_workspace()
187 TAILQ_INSERT_TAIL(&(ws->nodes_head), con, nodes); in attach_to_workspace()
302 ? TAILQ_PREV(con, nodes_head, nodes) in tree_move()
319 TAILQ_SWAP(swap, con, &(swap->parent->nodes_head), nodes); in tree_move()
321 TAILQ_SWAP(con, swap, &(swap->parent->nodes_head), nodes); in tree_move()
356 …Con *next = (direction == D_UP || direction == D_LEFT ? TAILQ_PREV(above, nodes_head, nodes) : TAI… in tree_move()
H A Dewmh.c17 TAILQ_FOREACH (output, &(croot->nodes_head), nodes) \
18 TAILQ_FOREACH (ws, &(output_get_content(output)->nodes_head), nodes) \
130 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in ewmh_update_wm_desktop_recursively()
188 TAILQ_FOREACH (output, &(croot->nodes_head), nodes) { in ewmh_update_wm_desktop()
190 TAILQ_FOREACH (workspace, &(output_get_content(output)->nodes_head), nodes) { in ewmh_update_wm_desktop()
H A Drender.c115 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in render_con()
169 assert(!TAILQ_EMPTY(&con->nodes_head)); in precalculate_sizes()
174 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in precalculate_sizes()
195 TAILQ_FOREACH (output, &(con->nodes_head), nodes) { in render_root()
205 TAILQ_FOREACH (output, &(con->nodes_head), nodes) { in render_root()
282 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in render_output()
318 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in render_output()
323 TAILQ_FOREACH (dockchild, &(child->nodes_head), nodes) { in render_output()
331 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in render_output()
H A Drandr.c337 TAILQ_FOREACH (current, &(croot->nodes_head), nodes) { in output_init_con()
473 if (!TAILQ_EMPTY(&(content->nodes_head))) { in init_ws_for_output()
479 visible = TAILQ_FIRST(&(content->nodes_head)); in init_ws_for_output()
531 TAILQ_FOREACH (workspace, &(content->nodes_head), nodes) { in output_change_mode()
848 while (!TAILQ_EMPTY(&(old_content->nodes_head))) { in move_content()
849 current = TAILQ_FIRST(&(old_content->nodes_head)); in move_content()
876 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in move_content()
882 while (!TAILQ_EMPTY(&(child->nodes_head))) { in move_content()
883 dock = TAILQ_FIRST(&(child->nodes_head)); in move_content()
980 for (con = TAILQ_FIRST(&(croot->nodes_head)); con;) { in randr_query_outputs()
[all …]
H A Dclick.c350 TAILQ_FOREACH (output, &(croot->nodes_head), nodes) { in handle_button_press()
373 TAILQ_FOREACH_REVERSE (child, &(con->nodes_head), nodes_head, nodes) { in handle_button_press()
H A Dresize.c96 second = TAILQ_PREV(first, nodes_head, nodes); in resize_find_tiling_participants()
103 second = TAILQ_PREV(first, nodes_head, nodes); in resize_find_tiling_participants()
/dports/x11-wm/i3-gaps/i3-4.20.1/src/
H A Dtree.c94 croot = TAILQ_FIRST(&(croot->nodes_head)); in tree_restore()
100 Con *out = TAILQ_FIRST(&(croot->nodes_head)); in tree_restore()
102 Con *ws = TAILQ_FIRST(&(out->nodes_head)); in tree_restore()
112 TAILQ_REMOVE(&(croot->nodes_head), __i3, nodes); in tree_restore()
206 for (child = TAILQ_FIRST(&(con->nodes_head)); child;) { in tree_close_internal()
434 TAILQ_FOREACH (current, &(con->nodes_head), nodes) { in mark_unmapped()
549 Con *const wrap = previous ? TAILQ_LAST(&(parent->nodes_head), nodes_head) in get_tree_next()
662 child = TAILQ_FIRST(&(con->nodes_head)); in tree_flatten()
684 while (!TAILQ_EMPTY(&(child->nodes_head))) { in tree_flatten()
685 current = TAILQ_FIRST(&(child->nodes_head)); in tree_flatten()
[all …]
H A Dcon.c55 TAILQ_INIT(&(new->nodes_head)); in con_new_skeleton()
103 struct nodes_head *nodes_head = &(parent->nodes_head); in _con_attach() local
111 TAILQ_INSERT_TAIL(nodes_head, con, nodes); in _con_attach()
113 current = TAILQ_FIRST(nodes_head); in _con_attach()
141 TAILQ_FOREACH (loop, nodes_head, nodes) { in _con_attach()
154 TAILQ_INSERT_TAIL(nodes_head, con, nodes); in _con_attach()
187 nodes_head = &(target->nodes_head); in _con_attach()
362 return TAILQ_EMPTY(&(con->nodes_head)); in con_is_leaf()
1603 most = TAILQ_LAST(&(con->nodes_head), nodes_head); in con_descend_direction()
1626 most = TAILQ_LAST(&(con->nodes_head), nodes_head); in con_descend_direction()
[all …]
H A Dworkspace.c32 TAILQ_FOREACH (output, &(croot->nodes_head), nodes) { in get_existing_workspace_by_name()
46 TAILQ_FOREACH (output, &(croot->nodes_head), nodes) { in get_existing_workspace_by_num()
655 prev = TAILQ_PREV(current, nodes_head, nodes); in workspace_prev()
660 TAILQ_FOREACH_REVERSE (output, &(croot->nodes_head), nodes_head, nodes) { in workspace_prev()
682 TAILQ_FOREACH_REVERSE (output, &(croot->nodes_head), nodes_head, nodes) { in workspace_prev()
777 prev = TAILQ_PREV(current, nodes_head, nodes); in workspace_prev_on_output()
896 while (!TAILQ_EMPTY(&(ws->nodes_head))) { in ws_force_orientation()
897 Con *child = TAILQ_FIRST(&(ws->nodes_head)); in ws_force_orientation()
960 if (TAILQ_EMPTY(&(ws->nodes_head))) { in workspace_encapsulate()
974 while (!TAILQ_EMPTY(&(ws->nodes_head))) { in workspace_encapsulate()
[all …]
H A Dmove.c161 TAILQ_INSERT_AFTER(&(parent->nodes_head), target, con, nodes); in insert_con_into()
185 TAILQ_INSERT_HEAD(&(ws->nodes_head), con, nodes); in attach_to_workspace()
187 TAILQ_INSERT_TAIL(&(ws->nodes_head), con, nodes); in attach_to_workspace()
302 ? TAILQ_PREV(con, nodes_head, nodes) in tree_move()
319 TAILQ_SWAP(swap, con, &(swap->parent->nodes_head), nodes); in tree_move()
321 TAILQ_SWAP(con, swap, &(swap->parent->nodes_head), nodes); in tree_move()
356 …Con *next = (direction == D_UP || direction == D_LEFT ? TAILQ_PREV(above, nodes_head, nodes) : TAI… in tree_move()
H A Dewmh.c17 TAILQ_FOREACH (output, &(croot->nodes_head), nodes) \
18 TAILQ_FOREACH (ws, &(output_get_content(output)->nodes_head), nodes) \
130 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in ewmh_update_wm_desktop_recursively()
188 TAILQ_FOREACH (output, &(croot->nodes_head), nodes) { in ewmh_update_wm_desktop()
190 TAILQ_FOREACH (workspace, &(output_get_content(output)->nodes_head), nodes) { in ewmh_update_wm_desktop()
H A Drender.c144 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in render_con()
198 assert(!TAILQ_EMPTY(&con->nodes_head)); in precalculate_sizes()
203 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in precalculate_sizes()
224 TAILQ_FOREACH (output, &(con->nodes_head), nodes) { in render_root()
234 TAILQ_FOREACH (output, &(con->nodes_head), nodes) { in render_root()
311 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in render_output()
347 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in render_output()
352 TAILQ_FOREACH (dockchild, &(child->nodes_head), nodes) { in render_output()
360 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in render_output()
H A Drandr.c337 TAILQ_FOREACH (current, &(croot->nodes_head), nodes) { in output_init_con()
473 if (!TAILQ_EMPTY(&(content->nodes_head))) { in init_ws_for_output()
479 visible = TAILQ_FIRST(&(content->nodes_head)); in init_ws_for_output()
531 TAILQ_FOREACH (workspace, &(content->nodes_head), nodes) { in output_change_mode()
848 while (!TAILQ_EMPTY(&(old_content->nodes_head))) { in move_content()
849 current = TAILQ_FIRST(&(old_content->nodes_head)); in move_content()
876 TAILQ_FOREACH (child, &(con->nodes_head), nodes) { in move_content()
882 while (!TAILQ_EMPTY(&(child->nodes_head))) { in move_content()
883 dock = TAILQ_FIRST(&(child->nodes_head)); in move_content()
980 for (con = TAILQ_FIRST(&(croot->nodes_head)); con;) { in randr_query_outputs()
[all …]
H A Dclick.c350 TAILQ_FOREACH (output, &(croot->nodes_head), nodes) { in handle_button_press()
373 TAILQ_FOREACH_REVERSE (child, &(con->nodes_head), nodes_head, nodes) { in handle_button_press()
H A Dresize.c96 second = TAILQ_PREV(first, nodes_head, nodes); in resize_find_tiling_participants()
103 second = TAILQ_PREV(first, nodes_head, nodes); in resize_find_tiling_participants()
H A Doutput.c19 TAILQ_FOREACH (child, &(output->nodes_head), nodes) { in output_get_content()
/dports/x11-wm/i3/i3-4.20.1/include/
H A Dutil.h31 TAILQ_FOREACH (child, &((head)->nodes_head), nodes)
35 TAILQ_FOREACH_REVERSE (child, &((head)->nodes_head), nodes_head, nodes)
H A Ddata.h696 TAILQ_HEAD(nodes_head, Con) nodes_head;
/dports/x11-wm/i3-gaps/i3-4.20.1/include/
H A Dutil.h31 TAILQ_FOREACH (child, &((head)->nodes_head), nodes)
35 TAILQ_FOREACH_REVERSE (child, &((head)->nodes_head), nodes_head, nodes)
H A Ddata.h718 TAILQ_HEAD(nodes_head, Con) nodes_head;
/dports/www/uwsgi/uwsgi-2.0.20/core/
H A Dlegion.c104 struct uwsgi_legion_node *uln = ul->nodes_head; in legion_rebuild_scrolls()
137 if (!ul->nodes_head) { in uwsgi_legion_add_node()
138 ul->nodes_head = node; in uwsgi_legion_add_node()
153 if (node == ul->nodes_head) { in uwsgi_legion_remove_node()
154 ul->nodes_head = node->next; in uwsgi_legion_remove_node()
184 struct uwsgi_legion_node *nodes = ul->nodes_head; in uwsgi_legion_get_node()
207 struct uwsgi_legion_node *node = legion->nodes_head; in legions_check_nodes()
237 struct uwsgi_legion_node *nodes = ul->nodes_head; in legions_report_quorum()
253 struct uwsgi_legion_node *nodes = ul->nodes_head; in uwsgi_legion_checksum()
302 struct uwsgi_legion_node *nodes = ul->nodes_head; in legions_check_nodes_step2()
[all …]
/dports/www/uwsgi/uwsgi-2.0.20/plugins/legion_cache_fetch/
H A Dlegion_cache_fetch.c19 struct uwsgi_legion_node *legion_nodes = ul->nodes_head; in legion_action_cache_fetch_from_legion()

12