Searched refs:stack_neighbour (Results 1 – 4 of 4) sorted by relevance
/dports/x11-wm/picom/picom-8.2/src/ |
H A D | win.h | 32 list_foreach(struct managed_win, w, win_stack, base.stack_neighbour) if (w->base.managed) 36 base.stack_neighbour) if (w->base.managed) 55 struct list_node stack_neighbour; member 80 struct list_node stack_neighbour; member
|
H A D | win.c | 1147 list_insert_after(prev, &new_w->stack_neighbour); in add_win() 1179 return add_win(ps, id, w->stack_neighbour.prev); in add_win_above() 1332 list_replace(&w->stack_neighbour, &new->base.stack_neighbour); in fill_win() 1726 list_remove(&w->stack_neighbour); in destroy_win_finish() 1802 list_move_before(&w->stack_neighbour, next); in restack_win() 1825 if (!list_node_is_last(&ps->window_stack, &w->stack_neighbour)) { in restack_above() 1826 old_below = list_next_entry(w, stack_neighbour)->id; in restack_above() 1846 new_next = &tmp_w->stack_neighbour; in restack_above() 1858 if (&w->stack_neighbour == ps->window_stack.next) { in restack_top() 2417 auto next = list_entry(i->next, struct win, stack_neighbour); in win_stack_find_next_managed() [all …]
|
H A D | dbus.c | 770 (list_node_is_last(&ps->window_stack, &w->base.stack_neighbour) in cdbus_process_win_get() 772 : list_entry(w->base.stack_neighbour.next, struct win, stack_neighbour) in cdbus_process_win_get()
|
H A D | picom.c | 1288 list_foreach_safe(struct win, w, &ps->window_stack, stack_neighbour) { in handle_new_windows() 2137 list_foreach(struct win, w, &ps->window_stack, stack_neighbour) { in session_init() 2185 list_foreach_safe(struct win, w, &ps->window_stack, stack_neighbour) { in session_destroy()
|