chain_node
list_for_each_entry_continue(iter, &chan->chain, chain_node) {
list_for_each_entry(iter, &tdesc->group_list, chain_node) {
if (list_is_last(&desc->chain_node, &chan->chain) ||
list_del(&desc->chain_node);
chain_node) {
&chan->chain, chain_node) {
list_add_tail(&iter->chain_node, &chain);
INIT_LIST_HEAD(&slot->chain_node);
chain_node);
&old_chain_tail->chain_node);
chain_node);
iter->hw_next = list_entry(iter->chain_node.next,
chain_node);
iter = list_first_entry(&iter->chain_node,
chain_node);
chain_node);
iter->hw_next = list_entry(iter->chain_node.next,
chain_node);
iter = list_first_entry(&iter->chain_node,
chain_node);
iter->hw_next = list_entry(iter->chain_node.next,
chain_node);
iter = list_first_entry(&iter->chain_node,
chain_node);
chain_node) {
list_for_each_entry(iter, &sw_desc->group_list, chain_node) {
list_for_each_entry(iter, &sw_desc->group_list, chain_node) {
if (likely(!list_is_last(&iter->chain_node,
list_entry(iter->chain_node.next,
chain_node);
list_for_each_entry(iter, &sw_desc->group_list, chain_node) {
iter->hw_next = list_entry(iter->chain_node.next,
chain_node);
chain_node);
iter = list_entry(iter->chain_node.next,
chain_node);
iter->hw_next = list_entry(iter->chain_node.next,
chain_node);
chain_node) {
chain_node) {
&sw_desc->group_list, chain_node)
&sw_desc->group_list, chain_node) {
chain_node)
chain_node) {
iter = list_entry(iter->chain_node.next,
chain_node);
iter = list_entry(iter->chain_node.next,
chain_node);
chain_node) {
chain_node) {
chain_node) {
end = list_entry(end->chain_node.next,
struct ppc440spe_adma_desc_slot, chain_node);
desc = list_entry(hdesc->chain_node.next,
chain_node);
list_for_each_entry(iter, &desc->group_list, chain_node) {
desc = list_entry(desc->chain_node.next,
struct ppc440spe_adma_desc_slot, chain_node);
if (likely(!list_is_last(&iter->chain_node,
desc = list_entry(desc->chain_node.next,
chain_node);
iter->hw_next = list_entry(iter->chain_node.next,
struct ppc440spe_adma_desc_slot, chain_node);
chain_node) {
list_del(&iter->chain_node);
chain_node);
list_for_each_entry(iter, &sw_desc->group_list, chain_node) {
iter = list_first_entry(&iter->chain_node,
chain_node);
iter = list_first_entry(&iter->chain_node,
chain_node);
list_for_each_entry_from(iter, &desc->group_list, chain_node) {
chain_node);
iter = list_first_entry(&iter->chain_node,
chain_node);
iter = list_first_entry(&iter->chain_node,
chain_node);
chain_node) {
struct ppc440spe_adma_desc_slot, chain_node);
iter = list_entry(iter->chain_node.next,
struct ppc440spe_adma_desc_slot, chain_node);
iter = list_entry(iter->chain_node.next,
struct ppc440spe_adma_desc_slot, chain_node);
list_for_each_entry_from(iter, &desc->group_list, chain_node) {
if (likely(!list_is_last(&iter->chain_node,
iter->hw_next = list_entry(iter->chain_node.next,
chain_node);
chain_node) {
BUG_ON(&iter->chain_node == &chan->chain);
struct list_head chain_node; /* node in channel ops list */
list_is_first(&bridge->chain_node, &bridge->encoder->bridge_chain)) {
list_for_each_entry(bridge, &encoder->bridge_chain, chain_node) {
struct drm_bridge, chain_node));
list_for_each_entry_reverse(iter, &encoder->bridge_chain, chain_node) {
list_add(&bridge->chain_node, &previous->chain_node);
list_add(&bridge->chain_node, &encoder->bridge_chain);
list_del(&bridge->chain_node);
list_del(&bridge->chain_node);
list_for_each_entry_from(bridge, &encoder->bridge_chain, chain_node) {
list_for_each_entry_from(bridge, &encoder->bridge_chain, chain_node) {
list_for_each_entry_reverse(iter, &encoder->bridge_chain, chain_node) {
list_for_each_entry_from(bridge, &encoder->bridge_chain, chain_node) {
if (!list_is_last(&bridge->chain_node, &encoder->bridge_chain)) {
next = list_next_entry(bridge, chain_node);
chain_node) {
next = list_prev_entry(next, chain_node);
if (list_is_last(&next->chain_node,
chain_node) {
list_for_each_entry_reverse(iter, &encoder->bridge_chain, chain_node) {
chain_node) {
list_for_each_entry_from(next, &encoder->bridge_chain, chain_node) {
list_for_each_entry_from(bridge, &encoder->bridge_chain, chain_node) {
chain_node)
chain_node), 0);
list_for_each_entry(br_iter, &encoder->bridge_chain, chain_node)
struct list_head chain_node;
return list_is_last(&bridge->chain_node, &bridge->encoder->bridge_chain);
if (list_is_last(&bridge->chain_node, &bridge->encoder->bridge_chain))
return drm_bridge_get(list_next_entry(bridge, chain_node));
if (list_is_first(&bridge->chain_node, &bridge->encoder->bridge_chain))
return drm_bridge_get(list_prev_entry(bridge, chain_node));
struct drm_bridge, chain_node));
struct drm_bridge, chain_node));
struct list_head chain_node;
$$ = chain_node($1, $2);
struct node *chain_node(struct node *first, struct node *list);