bnx2x: Re-factor the initialization code

Moving the code to a more logical place and beautifying it. No real change in
behavior.

Signed-off-by: Vladislav Zolotarov <vladz@broadcom.com>
Signed-off-by: Eilon Greenstein <eilong@broadcom.com>
Signed-off-by: David S. Miller <davem@davemloft.net>

1 files changed, 113 insertions, 0 deletions

diff --git a/drivers/net/bnx2x_reg.h b/drivers/net/bnx2x_reg.h
index 999838629be3..1e6f5aa4eb5a 100644
--- a/drivers/net/bnx2x_reg.h
+++ b/drivers/net/bnx2x_reg.h
@@ -6019,3 +6019,116 @@ Theotherbitsarereservedandshouldbezero*/
 #define COMMAND_REG_SIMD_NOMASK     0x1c
 
 
+#define IGU_MEM_BASE                                            0x0000
+
+#define IGU_MEM_MSIX_BASE                                       0x0000
+#define IGU_MEM_MSIX_UPPER                                      0x007f
+#define IGU_MEM_MSIX_RESERVED_UPPER                     0x01ff
+
+#define IGU_MEM_PBA_MSIX_BASE                           0x0200
+#define IGU_MEM_PBA_MSIX_UPPER                          0x0200
+
+#define IGU_CMD_BACKWARD_COMP_PROD_UPD          0x0201
+#define IGU_MEM_PBA_MSIX_RESERVED_UPPER         0x03ff
+
+#define IGU_CMD_INT_ACK_BASE                            0x0400
+#define IGU_CMD_INT_ACK_UPPER\
+        (IGU_CMD_INT_ACK_BASE + MAX_SB_PER_PORT * NUM_OF_PORTS_PER_PATH - 1)
+#define IGU_CMD_INT_ACK_RESERVED_UPPER          0x04ff
+
+#define IGU_CMD_E2_PROD_UPD_BASE                        0x0500
+#define IGU_CMD_E2_PROD_UPD_UPPER\
+        (IGU_CMD_E2_PROD_UPD_BASE + MAX_SB_PER_PORT * NUM_OF_PORTS_PER_PATH - 1)
+#define IGU_CMD_E2_PROD_UPD_RESERVED_UPPER      0x059f
+
+#define IGU_CMD_ATTN_BIT_UPD_UPPER                      0x05a0
+#define IGU_CMD_ATTN_BIT_SET_UPPER                      0x05a1
+#define IGU_CMD_ATTN_BIT_CLR_UPPER                      0x05a2
+
+#define IGU_REG_SISR_MDPC_WMASK_UPPER           0x05a3
+#define IGU_REG_SISR_MDPC_WMASK_LSB_UPPER       0x05a4
+#define IGU_REG_SISR_MDPC_WMASK_MSB_UPPER       0x05a5
+#define IGU_REG_SISR_MDPC_WOMASK_UPPER          0x05a6
+
+#define IGU_REG_RESERVED_UPPER                          0x05ff
+
+
+#define CDU_REGION_NUMBER_XCM_AG 2
+#define CDU_REGION_NUMBER_UCM_AG 4
+
+
+/**
+ * String-to-compress [31:8] = CID (all 24 bits)
+ * String-to-compress [7:4] = Region
+ * String-to-compress [3:0] = Type
+ */
+#define CDU_VALID_DATA(_cid, _region, _type)\
+        (((_cid) << 8) | (((_region)&0xf)<<4) | (((_type)&0xf)))
+#define CDU_CRC8(_cid, _region, _type)\
+        (calc_crc8(CDU_VALID_DATA(_cid, _region, _type), 0xff))
+#define CDU_RSRVD_VALUE_TYPE_A(_cid, _region, _type)\
+        (0x80 | ((CDU_CRC8(_cid, _region, _type)) & 0x7f))
+#define CDU_RSRVD_VALUE_TYPE_B(_crc, _type)\
+        (0x80 | ((_type)&0xf << 3) | ((CDU_CRC8(_cid, _region, _type)) & 0x7))
+#define CDU_RSRVD_INVALIDATE_CONTEXT_VALUE(_val) ((_val) & ~0x80)
+
+/******************************************************************************
+ * Description:
+ *         Calculates crc 8 on a word value: polynomial 0-1-2-8
+ *         Code was translated from Verilog.
+ * Return:
+ *****************************************************************************/
+static inline u8 calc_crc8(u32 data, u8 crc)
+{
+        u8 D[32];
+        u8 NewCRC[8];
+        u8 C[8];
+        u8 crc_res;
+        u8 i;
+
+        /* split the data into 31 bits */
+        for (i = 0; i < 32; i++) {
+                D[i] = (u8)(data & 1);
+                data = data >> 1;
+        }
+
+        /* split the crc into 8 bits */
+        for (i = 0; i < 8; i++) {
+                C[i] = crc & 1;
+                crc = crc >> 1;
+        }
+
+        NewCRC[0] = D[31] ^ D[30] ^ D[28] ^ D[23] ^ D[21] ^ D[19] ^ D[18] ^
+                    D[16] ^ D[14] ^ D[12] ^ D[8] ^ D[7] ^ D[6] ^ D[0] ^ C[4] ^
+                    C[6] ^ C[7];
+        NewCRC[1] = D[30] ^ D[29] ^ D[28] ^ D[24] ^ D[23] ^ D[22] ^ D[21] ^
+                    D[20] ^ D[18] ^ D[17] ^ D[16] ^ D[15] ^ D[14] ^ D[13] ^
+                    D[12] ^ D[9] ^ D[6] ^ D[1] ^ D[0] ^ C[0] ^ C[4] ^ C[5] ^
+                    C[6];
+        NewCRC[2] = D[29] ^ D[28] ^ D[25] ^ D[24] ^ D[22] ^ D[17] ^ D[15] ^
+                    D[13] ^ D[12] ^ D[10] ^ D[8] ^ D[6] ^ D[2] ^ D[1] ^ D[0] ^
+                    C[0] ^ C[1] ^ C[4] ^ C[5];
+        NewCRC[3] = D[30] ^ D[29] ^ D[26] ^ D[25] ^ D[23] ^ D[18] ^ D[16] ^
+                    D[14] ^ D[13] ^ D[11] ^ D[9] ^ D[7] ^ D[3] ^ D[2] ^ D[1] ^
+                    C[1] ^ C[2] ^ C[5] ^ C[6];
+        NewCRC[4] = D[31] ^ D[30] ^ D[27] ^ D[26] ^ D[24] ^ D[19] ^ D[17] ^
+                    D[15] ^ D[14] ^ D[12] ^ D[10] ^ D[8] ^ D[4] ^ D[3] ^ D[2] ^
+                    C[0] ^ C[2] ^ C[3] ^ C[6] ^ C[7];
+        NewCRC[5] = D[31] ^ D[28] ^ D[27] ^ D[25] ^ D[20] ^ D[18] ^ D[16] ^
+                    D[15] ^ D[13] ^ D[11] ^ D[9] ^ D[5] ^ D[4] ^ D[3] ^ C[1] ^
+                    C[3] ^ C[4] ^ C[7];
+        NewCRC[6] = D[29] ^ D[28] ^ D[26] ^ D[21] ^ D[19] ^ D[17] ^ D[16] ^
+                    D[14] ^ D[12] ^ D[10] ^ D[6] ^ D[5] ^ D[4] ^ C[2] ^ C[4] ^
+                    C[5];
+        NewCRC[7] = D[30] ^ D[29] ^ D[27] ^ D[22] ^ D[20] ^ D[18] ^ D[17] ^
+                    D[15] ^ D[13] ^ D[11] ^ D[7] ^ D[6] ^ D[5] ^ C[3] ^ C[5] ^
+                    C[6];
+
+        crc_res = 0;
+        for (i = 0; i < 8; i++)
+                crc_res |= (NewCRC[i] << i);
+
+        return crc_res;
+}
+
+