ixgbe: Add iterator for cycling through rings on a q_vector
authorAlexander Duyck <alexander.h.duyck@intel.com>
Wed, 8 Feb 2012 07:50:04 +0000 (07:50 +0000)
committerJeff Kirsher <jeffrey.t.kirsher@intel.com>
Tue, 13 Mar 2012 03:55:24 +0000 (20:55 -0700)
Since there are multiple spots where we have to cycle through all of the
rings on a q_vector it makes sense to just add a function for iterating
through all of them.

Signed-off-by: Alexander Duyck <alexander.h.duyck@intel.com>
Tested-by: Stephen Ko <stephen.s.ko@intel.com>
Signed-off-by: Jeff Kirsher <jeffrey.t.kirsher@intel.com>
drivers/net/ethernet/intel/ixgbe/ixgbe.h
drivers/net/ethernet/intel/ixgbe/ixgbe_main.c

index 699899ac85d0122a3a64a5962980febce83c5ae9..03175cb7f078d43bf8d7e5d728d278604b8107e2 100644 (file)
@@ -296,6 +296,10 @@ struct ixgbe_ring_container {
        u8 itr;                         /* current ITR setting for ring */
 };
 
+/* iterator for handling rings in ring container */
+#define ixgbe_for_each_ring(pos, head) \
+       for (pos = (head).ring; pos != NULL; pos = pos->next)
+
 #define MAX_RX_PACKET_BUFFERS ((adapter->flags & IXGBE_FLAG_DCB_ENABLED) \
                               ? 8 : 1)
 #define MAX_TX_PACKET_BUFFERS MAX_RX_PACKET_BUFFERS
index 604540d6c6b68d2ffd3c05066f6028346722d327..95240ab29177aef82a15f5081df583cc29c4134c 100644 (file)
@@ -928,10 +928,10 @@ static void ixgbe_update_dca(struct ixgbe_q_vector *q_vector)
        if (q_vector->cpu == cpu)
                goto out_no_update;
 
-       for (ring = q_vector->tx.ring; ring != NULL; ring = ring->next)
+       ixgbe_for_each_ring(ring, q_vector->tx)
                ixgbe_update_tx_dca(adapter, ring, cpu);
 
-       for (ring = q_vector->rx.ring; ring != NULL; ring = ring->next)
+       ixgbe_for_each_ring(ring, q_vector->rx)
                ixgbe_update_rx_dca(adapter, ring, cpu);
 
        q_vector->cpu = cpu;
@@ -1706,10 +1706,10 @@ static void ixgbe_configure_msix(struct ixgbe_adapter *adapter)
                struct ixgbe_ring *ring;
                q_vector = adapter->q_vector[v_idx];
 
-               for (ring = q_vector->rx.ring; ring != NULL; ring = ring->next)
+               ixgbe_for_each_ring(ring, q_vector->rx)
                        ixgbe_set_ivar(adapter, 0, ring->reg_idx, v_idx);
 
-               for (ring = q_vector->tx.ring; ring != NULL; ring = ring->next)
+               ixgbe_for_each_ring(ring, q_vector->tx)
                        ixgbe_set_ivar(adapter, 1, ring->reg_idx, v_idx);
 
                if (q_vector->tx.ring && !q_vector->rx.ring) {
@@ -4195,7 +4195,7 @@ static int ixgbe_poll(struct napi_struct *napi, int budget)
                ixgbe_update_dca(q_vector);
 #endif
 
-       for (ring = q_vector->tx.ring; ring != NULL; ring = ring->next)
+       ixgbe_for_each_ring(ring, q_vector->tx)
                clean_complete &= !!ixgbe_clean_tx_irq(q_vector, ring);
 
        /* attempt to distribute budget to each queue fairly, but don't allow
@@ -4205,7 +4205,7 @@ static int ixgbe_poll(struct napi_struct *napi, int budget)
        else
                per_ring_budget = budget;
 
-       for (ring = q_vector->rx.ring; ring != NULL; ring = ring->next)
+       ixgbe_for_each_ring(ring, q_vector->rx)
                clean_complete &= ixgbe_clean_rx_irq(q_vector, ring,
                                                     per_ring_budget);
 
@@ -4940,10 +4940,10 @@ static void ixgbe_free_q_vector(struct ixgbe_adapter *adapter, int v_idx)
        struct ixgbe_q_vector *q_vector = adapter->q_vector[v_idx];
        struct ixgbe_ring *ring;
 
-       for (ring = q_vector->tx.ring; ring != NULL; ring = ring->next)
+       ixgbe_for_each_ring(ring, q_vector->tx)
                adapter->tx_ring[ring->queue_index] = NULL;
 
-       for (ring = q_vector->rx.ring; ring != NULL; ring = ring->next)
+       ixgbe_for_each_ring(ring, q_vector->rx)
                adapter->rx_ring[ring->queue_index] = NULL;
 
        adapter->q_vector[v_idx] = NULL;