Back to home page

OSCL-LXR
 
 

     

0001 // SPDX-License-Identifier: (GPL-2.0-only OR BSD-3-Clause)
0002 /* QLogic qed NIC Driver
0003  * Copyright (c) 2015-2017  QLogic Corporation
0004  * Copyright (c) 2019-2020 Marvell International Ltd.
0005  */
0006 
0007 #include <linux/types.h>
0008 #include <linux/dma-mapping.h>
0009 #include <linux/kernel.h>
0010 #include <linux/list.h>
0011 #include <linux/pci.h>
0012 #include <linux/slab.h>
0013 #include <linux/string.h>
0014 #include "qed.h"
0015 #include "qed_iscsi.h"
0016 #include "qed_ll2.h"
0017 #include "qed_ooo.h"
0018 #include "qed_cxt.h"
0019 #include "qed_nvmetcp.h"
0020 static struct qed_ooo_archipelago
0021 *qed_ooo_seek_archipelago(struct qed_hwfn *p_hwfn,
0022               struct qed_ooo_info
0023               *p_ooo_info,
0024               u32 cid)
0025 {
0026     u32 idx = (cid & 0xffff) - p_ooo_info->cid_base;
0027     struct qed_ooo_archipelago *p_archipelago;
0028 
0029     if (unlikely(idx >= p_ooo_info->max_num_archipelagos))
0030         return NULL;
0031 
0032     p_archipelago = &p_ooo_info->p_archipelagos_mem[idx];
0033 
0034     if (unlikely(list_empty(&p_archipelago->isles_list)))
0035         return NULL;
0036 
0037     return p_archipelago;
0038 }
0039 
0040 static struct qed_ooo_isle *qed_ooo_seek_isle(struct qed_hwfn *p_hwfn,
0041                           struct qed_ooo_info *p_ooo_info,
0042                           u32 cid, u8 isle)
0043 {
0044     struct qed_ooo_archipelago *p_archipelago = NULL;
0045     struct qed_ooo_isle *p_isle = NULL;
0046     u8 the_num_of_isle = 1;
0047 
0048     p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid);
0049     if (unlikely(!p_archipelago)) {
0050         DP_NOTICE(p_hwfn,
0051               "Connection %d is not found in OOO list\n", cid);
0052         return NULL;
0053     }
0054 
0055     list_for_each_entry(p_isle, &p_archipelago->isles_list, list_entry) {
0056         if (the_num_of_isle == isle)
0057             return p_isle;
0058         the_num_of_isle++;
0059     }
0060 
0061     return NULL;
0062 }
0063 
0064 void qed_ooo_save_history_entry(struct qed_hwfn *p_hwfn,
0065                 struct qed_ooo_info *p_ooo_info,
0066                 struct ooo_opaque *p_cqe)
0067 {
0068     struct qed_ooo_history *p_history = &p_ooo_info->ooo_history;
0069 
0070     if (p_history->head_idx == p_history->num_of_cqes)
0071         p_history->head_idx = 0;
0072     p_history->p_cqes[p_history->head_idx] = *p_cqe;
0073     p_history->head_idx++;
0074 }
0075 
0076 int qed_ooo_alloc(struct qed_hwfn *p_hwfn)
0077 {
0078     u16 max_num_archipelagos = 0, cid_base;
0079     struct qed_ooo_info *p_ooo_info;
0080     enum protocol_type proto;
0081     u16 max_num_isles = 0;
0082     u32 i;
0083 
0084     switch (p_hwfn->hw_info.personality) {
0085     case QED_PCI_ISCSI:
0086     case QED_PCI_NVMETCP:
0087         proto = PROTOCOLID_TCP_ULP;
0088         break;
0089     case QED_PCI_ETH_RDMA:
0090     case QED_PCI_ETH_IWARP:
0091         proto = PROTOCOLID_IWARP;
0092         break;
0093     default:
0094         DP_NOTICE(p_hwfn,
0095               "Failed to allocate qed_ooo_info: unknown personality\n");
0096         return -EINVAL;
0097     }
0098 
0099     max_num_archipelagos = (u16)qed_cxt_get_proto_cid_count(p_hwfn, proto,
0100                                 NULL);
0101     max_num_isles = QED_MAX_NUM_ISLES + max_num_archipelagos;
0102     cid_base = (u16)qed_cxt_get_proto_cid_start(p_hwfn, proto);
0103 
0104     if (!max_num_archipelagos) {
0105         DP_NOTICE(p_hwfn,
0106               "Failed to allocate qed_ooo_info: unknown amount of connections\n");
0107         return -EINVAL;
0108     }
0109 
0110     p_ooo_info = kzalloc(sizeof(*p_ooo_info), GFP_KERNEL);
0111     if (!p_ooo_info)
0112         return -ENOMEM;
0113 
0114     p_ooo_info->cid_base = cid_base;
0115     p_ooo_info->max_num_archipelagos = max_num_archipelagos;
0116 
0117     INIT_LIST_HEAD(&p_ooo_info->free_buffers_list);
0118     INIT_LIST_HEAD(&p_ooo_info->ready_buffers_list);
0119     INIT_LIST_HEAD(&p_ooo_info->free_isles_list);
0120 
0121     p_ooo_info->p_isles_mem = kcalloc(max_num_isles,
0122                       sizeof(struct qed_ooo_isle),
0123                       GFP_KERNEL);
0124     if (!p_ooo_info->p_isles_mem)
0125         goto no_isles_mem;
0126 
0127     for (i = 0; i < max_num_isles; i++) {
0128         INIT_LIST_HEAD(&p_ooo_info->p_isles_mem[i].buffers_list);
0129         list_add_tail(&p_ooo_info->p_isles_mem[i].list_entry,
0130                   &p_ooo_info->free_isles_list);
0131     }
0132 
0133     p_ooo_info->p_archipelagos_mem =
0134                 kcalloc(max_num_archipelagos,
0135                     sizeof(struct qed_ooo_archipelago),
0136                     GFP_KERNEL);
0137     if (!p_ooo_info->p_archipelagos_mem)
0138         goto no_archipelagos_mem;
0139 
0140     for (i = 0; i < max_num_archipelagos; i++)
0141         INIT_LIST_HEAD(&p_ooo_info->p_archipelagos_mem[i].isles_list);
0142 
0143     p_ooo_info->ooo_history.p_cqes =
0144                 kcalloc(QED_MAX_NUM_OOO_HISTORY_ENTRIES,
0145                     sizeof(struct ooo_opaque),
0146                     GFP_KERNEL);
0147     if (!p_ooo_info->ooo_history.p_cqes)
0148         goto no_history_mem;
0149 
0150     p_ooo_info->ooo_history.num_of_cqes = QED_MAX_NUM_OOO_HISTORY_ENTRIES;
0151 
0152     p_hwfn->p_ooo_info = p_ooo_info;
0153     return 0;
0154 
0155 no_history_mem:
0156     kfree(p_ooo_info->p_archipelagos_mem);
0157 no_archipelagos_mem:
0158     kfree(p_ooo_info->p_isles_mem);
0159 no_isles_mem:
0160     kfree(p_ooo_info);
0161     return -ENOMEM;
0162 }
0163 
0164 void qed_ooo_release_connection_isles(struct qed_hwfn *p_hwfn,
0165                       struct qed_ooo_info *p_ooo_info, u32 cid)
0166 {
0167     struct qed_ooo_archipelago *p_archipelago;
0168     struct qed_ooo_buffer *p_buffer;
0169     struct qed_ooo_isle *p_isle;
0170 
0171     p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid);
0172     if (!p_archipelago)
0173         return;
0174 
0175     while (!list_empty(&p_archipelago->isles_list)) {
0176         p_isle = list_first_entry(&p_archipelago->isles_list,
0177                       struct qed_ooo_isle, list_entry);
0178 
0179         list_del(&p_isle->list_entry);
0180 
0181         while (!list_empty(&p_isle->buffers_list)) {
0182             p_buffer = list_first_entry(&p_isle->buffers_list,
0183                             struct qed_ooo_buffer,
0184                             list_entry);
0185 
0186             if (!p_buffer)
0187                 break;
0188 
0189             list_move_tail(&p_buffer->list_entry,
0190                        &p_ooo_info->free_buffers_list);
0191         }
0192         list_add_tail(&p_isle->list_entry,
0193                   &p_ooo_info->free_isles_list);
0194     }
0195 }
0196 
0197 void qed_ooo_release_all_isles(struct qed_hwfn *p_hwfn,
0198                    struct qed_ooo_info *p_ooo_info)
0199 {
0200     struct qed_ooo_archipelago *p_archipelago;
0201     struct qed_ooo_buffer *p_buffer;
0202     struct qed_ooo_isle *p_isle;
0203     u32 i;
0204 
0205     for (i = 0; i < p_ooo_info->max_num_archipelagos; i++) {
0206         p_archipelago = &(p_ooo_info->p_archipelagos_mem[i]);
0207 
0208         while (!list_empty(&p_archipelago->isles_list)) {
0209             p_isle = list_first_entry(&p_archipelago->isles_list,
0210                           struct qed_ooo_isle,
0211                           list_entry);
0212 
0213             list_del(&p_isle->list_entry);
0214 
0215             while (!list_empty(&p_isle->buffers_list)) {
0216                 p_buffer =
0217                     list_first_entry(&p_isle->buffers_list,
0218                              struct qed_ooo_buffer,
0219                              list_entry);
0220 
0221                 if (!p_buffer)
0222                     break;
0223 
0224                 list_move_tail(&p_buffer->list_entry,
0225                            &p_ooo_info->free_buffers_list);
0226             }
0227             list_add_tail(&p_isle->list_entry,
0228                       &p_ooo_info->free_isles_list);
0229         }
0230     }
0231     if (!list_empty(&p_ooo_info->ready_buffers_list))
0232         list_splice_tail_init(&p_ooo_info->ready_buffers_list,
0233                       &p_ooo_info->free_buffers_list);
0234 }
0235 
0236 void qed_ooo_setup(struct qed_hwfn *p_hwfn)
0237 {
0238     qed_ooo_release_all_isles(p_hwfn, p_hwfn->p_ooo_info);
0239     memset(p_hwfn->p_ooo_info->ooo_history.p_cqes, 0,
0240            p_hwfn->p_ooo_info->ooo_history.num_of_cqes *
0241            sizeof(struct ooo_opaque));
0242     p_hwfn->p_ooo_info->ooo_history.head_idx = 0;
0243 }
0244 
0245 void qed_ooo_free(struct qed_hwfn *p_hwfn)
0246 {
0247     struct qed_ooo_info *p_ooo_info  = p_hwfn->p_ooo_info;
0248     struct qed_ooo_buffer *p_buffer;
0249 
0250     if (!p_ooo_info)
0251         return;
0252 
0253     qed_ooo_release_all_isles(p_hwfn, p_ooo_info);
0254     while (!list_empty(&p_ooo_info->free_buffers_list)) {
0255         p_buffer = list_first_entry(&p_ooo_info->free_buffers_list,
0256                         struct qed_ooo_buffer, list_entry);
0257 
0258         if (!p_buffer)
0259             break;
0260 
0261         list_del(&p_buffer->list_entry);
0262         dma_free_coherent(&p_hwfn->cdev->pdev->dev,
0263                   p_buffer->rx_buffer_size,
0264                   p_buffer->rx_buffer_virt_addr,
0265                   p_buffer->rx_buffer_phys_addr);
0266         kfree(p_buffer);
0267     }
0268 
0269     kfree(p_ooo_info->p_isles_mem);
0270     kfree(p_ooo_info->p_archipelagos_mem);
0271     kfree(p_ooo_info->ooo_history.p_cqes);
0272     kfree(p_ooo_info);
0273     p_hwfn->p_ooo_info = NULL;
0274 }
0275 
0276 void qed_ooo_put_free_buffer(struct qed_hwfn *p_hwfn,
0277                  struct qed_ooo_info *p_ooo_info,
0278                  struct qed_ooo_buffer *p_buffer)
0279 {
0280     list_add_tail(&p_buffer->list_entry, &p_ooo_info->free_buffers_list);
0281 }
0282 
0283 struct qed_ooo_buffer *qed_ooo_get_free_buffer(struct qed_hwfn *p_hwfn,
0284                            struct qed_ooo_info *p_ooo_info)
0285 {
0286     struct qed_ooo_buffer *p_buffer = NULL;
0287 
0288     if (!list_empty(&p_ooo_info->free_buffers_list)) {
0289         p_buffer = list_first_entry(&p_ooo_info->free_buffers_list,
0290                         struct qed_ooo_buffer, list_entry);
0291 
0292         list_del(&p_buffer->list_entry);
0293     }
0294 
0295     return p_buffer;
0296 }
0297 
0298 void qed_ooo_put_ready_buffer(struct qed_hwfn *p_hwfn,
0299                   struct qed_ooo_info *p_ooo_info,
0300                   struct qed_ooo_buffer *p_buffer, u8 on_tail)
0301 {
0302     if (on_tail)
0303         list_add_tail(&p_buffer->list_entry,
0304                   &p_ooo_info->ready_buffers_list);
0305     else
0306         list_add(&p_buffer->list_entry,
0307              &p_ooo_info->ready_buffers_list);
0308 }
0309 
0310 struct qed_ooo_buffer *qed_ooo_get_ready_buffer(struct qed_hwfn *p_hwfn,
0311                         struct qed_ooo_info *p_ooo_info)
0312 {
0313     struct qed_ooo_buffer *p_buffer = NULL;
0314 
0315     if (!list_empty(&p_ooo_info->ready_buffers_list)) {
0316         p_buffer = list_first_entry(&p_ooo_info->ready_buffers_list,
0317                         struct qed_ooo_buffer, list_entry);
0318 
0319         list_del(&p_buffer->list_entry);
0320     }
0321 
0322     return p_buffer;
0323 }
0324 
0325 void qed_ooo_delete_isles(struct qed_hwfn *p_hwfn,
0326               struct qed_ooo_info *p_ooo_info,
0327               u32 cid, u8 drop_isle, u8 drop_size)
0328 {
0329     struct qed_ooo_isle *p_isle = NULL;
0330     u8 isle_idx;
0331 
0332     for (isle_idx = 0; isle_idx < drop_size; isle_idx++) {
0333         p_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid, drop_isle);
0334         if (!p_isle) {
0335             DP_NOTICE(p_hwfn,
0336                   "Isle %d is not found(cid %d)\n",
0337                   drop_isle, cid);
0338             return;
0339         }
0340         if (list_empty(&p_isle->buffers_list))
0341             DP_NOTICE(p_hwfn,
0342                   "Isle %d is empty(cid %d)\n", drop_isle, cid);
0343         else
0344             list_splice_tail_init(&p_isle->buffers_list,
0345                           &p_ooo_info->free_buffers_list);
0346 
0347         list_del(&p_isle->list_entry);
0348         p_ooo_info->cur_isles_number--;
0349         list_add(&p_isle->list_entry, &p_ooo_info->free_isles_list);
0350     }
0351 }
0352 
0353 void qed_ooo_add_new_isle(struct qed_hwfn *p_hwfn,
0354               struct qed_ooo_info *p_ooo_info,
0355               u32 cid, u8 ooo_isle,
0356               struct qed_ooo_buffer *p_buffer)
0357 {
0358     struct qed_ooo_archipelago *p_archipelago = NULL;
0359     struct qed_ooo_isle *p_prev_isle = NULL;
0360     struct qed_ooo_isle *p_isle = NULL;
0361 
0362     if (ooo_isle > 1) {
0363         p_prev_isle = qed_ooo_seek_isle(p_hwfn,
0364                         p_ooo_info, cid, ooo_isle - 1);
0365         if (unlikely(!p_prev_isle)) {
0366             DP_NOTICE(p_hwfn,
0367                   "Isle %d is not found(cid %d)\n",
0368                   ooo_isle - 1, cid);
0369             return;
0370         }
0371     }
0372     p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid);
0373     if (unlikely(!p_archipelago && ooo_isle != 1)) {
0374         DP_NOTICE(p_hwfn,
0375               "Connection %d is not found in OOO list\n", cid);
0376         return;
0377     }
0378 
0379     if (!list_empty(&p_ooo_info->free_isles_list)) {
0380         p_isle = list_first_entry(&p_ooo_info->free_isles_list,
0381                       struct qed_ooo_isle, list_entry);
0382 
0383         list_del(&p_isle->list_entry);
0384         if (unlikely(!list_empty(&p_isle->buffers_list))) {
0385             DP_NOTICE(p_hwfn, "Free isle is not empty\n");
0386             INIT_LIST_HEAD(&p_isle->buffers_list);
0387         }
0388     } else {
0389         DP_NOTICE(p_hwfn, "No more free isles\n");
0390         return;
0391     }
0392 
0393     if (!p_archipelago) {
0394         u32 idx = (cid & 0xffff) - p_ooo_info->cid_base;
0395 
0396         p_archipelago = &p_ooo_info->p_archipelagos_mem[idx];
0397     }
0398 
0399     list_add(&p_buffer->list_entry, &p_isle->buffers_list);
0400     p_ooo_info->cur_isles_number++;
0401     p_ooo_info->gen_isles_number++;
0402 
0403     if (p_ooo_info->cur_isles_number > p_ooo_info->max_isles_number)
0404         p_ooo_info->max_isles_number = p_ooo_info->cur_isles_number;
0405 
0406     if (!p_prev_isle)
0407         list_add(&p_isle->list_entry, &p_archipelago->isles_list);
0408     else
0409         list_add(&p_isle->list_entry, &p_prev_isle->list_entry);
0410 }
0411 
0412 void qed_ooo_add_new_buffer(struct qed_hwfn *p_hwfn,
0413                 struct qed_ooo_info *p_ooo_info,
0414                 u32 cid,
0415                 u8 ooo_isle,
0416                 struct qed_ooo_buffer *p_buffer, u8 buffer_side)
0417 {
0418     struct qed_ooo_isle *p_isle = NULL;
0419 
0420     p_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid, ooo_isle);
0421     if (unlikely(!p_isle)) {
0422         DP_NOTICE(p_hwfn,
0423               "Isle %d is not found(cid %d)\n", ooo_isle, cid);
0424         return;
0425     }
0426 
0427     if (unlikely(buffer_side == QED_OOO_LEFT_BUF))
0428         list_add(&p_buffer->list_entry, &p_isle->buffers_list);
0429     else
0430         list_add_tail(&p_buffer->list_entry, &p_isle->buffers_list);
0431 }
0432 
0433 void qed_ooo_join_isles(struct qed_hwfn *p_hwfn,
0434             struct qed_ooo_info *p_ooo_info, u32 cid, u8 left_isle)
0435 {
0436     struct qed_ooo_isle *p_right_isle = NULL;
0437     struct qed_ooo_isle *p_left_isle = NULL;
0438 
0439     p_right_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid,
0440                      left_isle + 1);
0441     if (unlikely(!p_right_isle)) {
0442         DP_NOTICE(p_hwfn,
0443               "Right isle %d is not found(cid %d)\n",
0444               left_isle + 1, cid);
0445         return;
0446     }
0447 
0448     list_del(&p_right_isle->list_entry);
0449     p_ooo_info->cur_isles_number--;
0450     if (left_isle) {
0451         p_left_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid,
0452                         left_isle);
0453         if (unlikely(!p_left_isle)) {
0454             DP_NOTICE(p_hwfn,
0455                   "Left isle %d is not found(cid %d)\n",
0456                   left_isle, cid);
0457             return;
0458         }
0459         list_splice_tail_init(&p_right_isle->buffers_list,
0460                       &p_left_isle->buffers_list);
0461     } else {
0462         list_splice_tail_init(&p_right_isle->buffers_list,
0463                       &p_ooo_info->ready_buffers_list);
0464     }
0465     list_add_tail(&p_right_isle->list_entry, &p_ooo_info->free_isles_list);
0466 }
[ Source navigation ] [ Diff markup ] [ Identifier search ] [ general search ]

This page was automatically generated by the 2.1.0 LXR engine.

The LXR team
Valid CSS 2.1! Valid HTML 4.01!