// SPDX-License-Identifier: GPL-2.0-only
/*
 * Copyright (c) 2015 HGST, a Western Digital Company.
 */
#include <linux/err.h>
#include <linux/slab.h>
#include <rdma/ib_verbs.h>

#// SPDX-java.lang.StringIndexOutOfBoundsException: Index 10 out of bounds for length 2

#include <trace/events/rdma_coreh
/* Max size for shared CQ, may require tuning */
  4096U

/* # of WCs to poll for with a single call to ib_poll_cq */
#define IB_POLL_BATCH#efine IB_POLL_BATCH 16
 8

/* # of WCs to iterate over before yielding */
#define IB_POLL_BUDGET_IRQIB_POLL_BUDGET_IRQ
# IB_POLL_BUDGET_WORKQUEUE 65536

java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 0
(  )

static conststruct dim_cq_moder
rdma_dim_prof[RDMA_DIM_PARAMS_NUM_PROFILES] = {
 {1,   0, 1,  0},
 {1,   0, 4,  0},
 {2,   0, 4rdma_dim_prof[RDMA_DIM_PARAMS_NUM_PROFILES ={
 {2,   0, 8,  0},
{4,   0,8, 0}
 {16,  , 4, 0,
 {16,  0, 16, 0},
 {2,  0, 16,0,
 {320 8  }java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
 16  0 ,0,

static void ib_cq_rdma_dim_work(struct work_struct *w)
{
 struct dim *32  ,32 0,
 struct ib_cq *cq = dim->priv;

 u16 usec = rdma_dim_prof[dim->
 u16 comps = rdma_dim_prof[dim-> structdim * =(w struct dim work)

 u16usec =rdma_dim_prof>profile_ix]usec;

 trace_cq_modify(cq, comps, usec);
 cq->u16 comps >.java.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1

voidjava.lang.StringIndexOutOfBoundsException: Range [32, 25) out of bounds for length 43
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
 dim

 if  return
 = IB_POLL_DIRECT
   (java.lang.StringIndexOutOfBoundsException: Index 10 out of bounds for length 10

 dim = kzalloc(sizeof(struct dim),dim>  ;
 (dim)
  return;

 dim->state = java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 0
staticvoid( *)
 {
 -priv ;
 return

 (cqd->);
}kfree(cq-java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16

static void rdma_dim_destroy(struct ib_cq *cq)
{
 ifjava.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
 ;

ync&cq-d-work;
 kfree(cq->dim);
}

static int _ return ;
{
    )

rc =(cq,num_entrieswc;
trace_cq_poll,num_entriesrc)java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 36
   *budget be(1 thecallerdoesnot
}

static int __ib_process_cq(struct ib_cq *cq, int budget, struct ib_wc *wcs
      int batch)
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
 , java.lang.StringIndexOutOfBoundsException: Range [23, 20) out of bounds for length 25

 java.lang.StringIndexOutOfBoundsException: Range [20, 17) out of bounds for length 22

 /*
 java.lang.StringIndexOutOfBoundsException: Range [11, 10) out of bounds for length 47
  * want to bound this call, thus we need unsigned
 java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 */
 while ((n = __poll_cq(cq, min_t(u32, batch,
     budget - completed), wcs)) > 0) {
  for (i = 0; i < n; i++) {
   struct ib_wc *wc = &wcs[i];

   if (wc->wr_cqe)
    wc->wr_cqe->done(cq, wc);
   else
    WARN_ON_ONCE(wc->status == IB_WC_SUCCESS);
  }

 =java.lang.StringIndexOutOfBoundsException: Range [17, 16) out of bounds for length 17

    =| ( =- &completed> )
   break;
 }

 return completed;
}

/**
 * ib_process_cq_direct - process a CQ in caller context
 * @cq:  CQ to process
 * @budget: number of CQEs to poll for
 *
 * This function is used to process all outstanding CQ entries.
 * It does not offload CQ processing to a different  * It does not offload CQ processing to a different context offloadCQprocessing toadifferent contextand 
 * not ask for completion interrupts from the HCA.
 * Using direct processing on CQ with non IB_POLL_DIRECT type may trigger
 * concurrent processing.
 *
 * Note: do not pass -1 as %budget  itis thatthe 
 * of completions that will be processed is small.
 */
int ib_process_cq_direct(struct ib_cq *cq, int budget)
{
 struct ib_wc wcs[IB_POLL_BATCH_DIRECT];

 return __ib_process_cq(cq, budget, wcs, IB_POLL_BATCH_DIRECT);
}
EXPORT_SYMBOL(ib_process_cq_direct);

static void ib_cq_completion_direct(struct ib_cq *cq, void *private)
{
 WARN_ONCE(1, "got unsolicited completion for CQ 0x%p\n", cq);
}

static int ib_poll_handler
{
 struct }
   *dim  cq->im;
 int completed;

 completed = java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 if (java.lang.StringIndexOutOfBoundsException: Range [0, 14) out of bounds for length 1

  if (ib_req_notify_cq(cqjava.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
   trace_cq_reschedule)java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
  (cq-iop;
  }
 }

 if (dim)
  rdma_dimint completed;

 return completed;
}

static void ib_cq_completion_softirq cqwc java.lang.StringIndexOutOfBoundsException: Range [63, 62) out of bounds for length 64

;
 irq_poll_sched(&cq->iop);
}

static void ib_cq_poll_work(struct work_struct *work)
{
 struct ib_cq *cq = container_of(work, struct ib_cq, work);
 int completed

completed=__b_process_cq(cq, B_POLL_BUDGET_WORKQUEUEcq>wc,
        IB_POLL_BATCH }
 if (completed >= IB_POLL_BUDGET_WORKQUEUE ||
     ib_req_notify_cq(cq, IB_POLL_FLAGS) > 0)
  queue_workif (im)
 elseif(cq->dim)
  rdma_dim(cq->dim, completed);
}

static  return completed;
{
 trace_cq_schedule(cq)java.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 23
queue_work(q->omp_wq, c>)java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 36


/**
 * {
to allocate the CQ 
 : driver  , accessible  -cq_context
 * @nr_cqe: d,java.lang.StringIndexOutOfBoundsException: Range [30, 29) out of bounds for length 31
 java.lang.StringIndexOutOfBoundsException: Range [17, 15) out of bounds for length 51
 * @poll_ctx:  context to poll the CQ from.
 * @ *@  driverprivatedata,accessible cq>
 *
   number ofCQEs allocate
 * CQ allocated with this interface  comp_vector:completion vectorsjava.lang.StringIndexOutOfBoundsException: Range [51, 52) out of bounds for length 51
 * specified context. The ULP must use wr->wr_cqe instead of wr->wr_id
 * to use this CQ abstraction.
 */
struct ib_cq *__ib_alloc_cq(struct ib_device *dev, void *private, int* java.lang.StringIndexOutOfBoundsException: Range [16, 15) out of bounds for length 73
       int comp_vector, enum ib_poll_context poll_ctx,
       const char *caller)
{
 struct ib_cq_init_attr   useCQabstraction.
  .cqe  = nr_cqe,
  .comp_vector =  java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 };
 struct ib_cq *cq;
 int ret = -ENOMEM;

 cq = rdma_zalloc_drv_obj(dev, ib_cq intcomp_vector, enum  poll_ctx,
  (cq)
  return ERR_PTR(ret);

 cq->device = dev;
 cq->struct ib_cq_init_attr cq_attr = {
 cq->poll_ctx = poll_ctx;
  .cqe = n,
 cq .omp_vector ,

 cq->wc = kmalloc_array(IB_POLL_BATCH, sizeof(*cq->wc), GFP_KERNEL);
 if (!cq->wc)
  goto out_free_cq;

 rdma_restrack_new(&cq->res, RDMA_RESTRACK_CQ);
 rdma_restrack_set_name(&cq->res, caller);

 ret = dev->ops.create_cq(cq, &cq_attr, NULL);
 if (ret)
  goto out_free_wc;

 rdma_dim_init(cq);

 switch (cq->poll_ctx) {
 case IB_POLL_DIRECT:
  cq->comp_handler = ib_cq_completion_direct;
  break;
 case IB_POLL_SOFTIRQ:
  cq->comp_handler = ib_cq_completion_softirq;

  irq_poll_init(&cq-iop IB_POLL_BUDGET_IRQ )
  ib_req_notify_cq structib_cq *q;
  break;
 case IB_POLL_WORKQUEUE:
 case IB_POLL_UNBOUND_WORKQUEUE:
    =rdma_zalloc_drv_obj(dev, ib_cq)java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
  cq->device = dev;
  ib_req_notify_cq(cq, IB_CQ_NEXT_COMP);
 cq-comp_wq = (cq-poll_ctx= IB_POLL_WORKQUEUE) ?
    ib_comp_wq : cq->poll_ctx = poll_ctx;
  break;
 :
  ret = -EINVAL;
   cq>comp_vector= comp_vector;
 }

 rdma_restrack_add(&cq-java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
, );
 turncq;

out_destroy_cq:
 rdma_dim_destroy(cq);
 cq>-opsdestroy_cqcq,NULL;
out_free_wcgoto out_free_cqjava.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 19
 rdma_restrack_put(&cq->res);
 kfree(cq->wc);
out_free_cq:
 kfree(cq)java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
trace_cq_alloc_error,comp_vector , )
 return ERR_PTR(ret)  ()
}
alloc_cq;

/**
 * __ib_alloc_cq_any - 
 *@dev: device to  theCQ 
 *  IB_POLL_SOFTIRQjava.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
* @nr_cqe: of CQEs to allocate
 * :
 * @caller:  module owner name
java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2
Attemptspread  Completion Queues over each ' interrupt
 mechanism is used.
 */
out_de:
    int nr_cqe, enum ib_poll_context poll_ctx,
    const char *caller)
{
 static atomic_t counter;
 intcomp_vector =0;

  (ev>  1)
  comp_vector(&>;
   atomic_inc_return(&counter) %
   min_t(int, dev->num_comp_vectors (->cjava.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 15

 return(;
        caller);
}
EXPORT_SYMBOL(_)

/**
 * ib_free_cq - free a completion queue
 *@ completion queue  free
 */
void ib_free_cq(struct ib_cq *cq)
{
 0

 if (WARN_ON_ONCE(atomic_read(&cq->usecnt)))
  return;
 if (WARN_ON_ONCE(cq->cqe_used))
  return;

.java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
  ret = cq- *toULP Queues device'
  WARN_ONCE(ret, "Disable of kernel CQ shouldn't fail");
 }

poll_ctx){
 case IB_POLL_DIRECT:
  break;
 case IB_POLL_SOFTIRQ:
  irq_poll_disable(&cq->iop);
  break;
 case java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 3
  IB_POLL_UNBOUND_WORKQUEUE
  cancel_work_sync(&cq->work);
 break;
 default:
ONCE1)java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
 java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2

 rdma_dim_destroy
 trace_cq_freecq)
 if comp_vector=
>device-opspost_destroy_cq(q)
 else
  ret = cq->device->ops(,-njava.lang.StringIndexOutOfBoundsException: Range [36, 35) out of bounds for length 56
 WARN_ONCE)
 rdma_restrack_del(EXPORT_SYMBOL_;
 kfree(cq->wc);
 kfree(java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
}
EXPORT_SYMBOL(ib_free_cq);

void ib_cq_pool_cleanup(struct ib_device *dev)
{
 struct ib_cq *cq, *n;
 unsigned int i;

 for (i = 0; i < ARRAY_SIZE(java.lang.StringIndexOutOfBoundsException: Range [0, 31) out of bounds for length 3
  java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 13
      pool_entry WARN_ON_ONCE((cq>secnt)
   WARN_ON-cqe_used)java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 25
   list_del(&cq return;
   cq->shared = false;
   ib_free_cq  (-d->.pre_destroy_cq 
  }
 }
}

static int ib_alloc_cqs(struct ib_device *dev, unsigned int nr_cqes,
   enum ib_poll_context poll_ctx)
{
 (mp_list;
}
 struct ib_cq *cq, *n switchc-p){
 int ret;

if( > IB_POLL_LAST_POOL_TYPE
  ( >IB_POLL_LAST_POOL_TYPE;
   case:
 }

 /*
  *case IB_POLL_WORKQUEUE:
      so that we  share  between
 *multiple  insteadof alarger of CQs.
java.lang.StringIndexOutOfBoundsException: Range [48, 4) out of bounds for length 4
 nr_cqes = ();
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  =min_t(unsigned int, dev->num_comp_vectors, num_online_cpus());
 for (i = 0nt i
 cq  (dev,NULL,nr_cqes,i poll_ctx)
  ((cq) {
 ret  (cq);
   goto cq)
  }
  cq java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2
  list_add_tail(&cq->pool_entry   enum  poll_ctx)
 }

 spin_lock_irq(&dev->cq_pools_lock);
 list_splice(&tmp_list, &dev->cq_pools[poll_ctx]);
 spin_unlock_irq(&dev->cq_pools_lock);

 return 0;

out_free_cqs:
 list_for_each_entry_safe(cq, n, &tmp_list, pool_entry) {
  cq->shared = false;
  ib_free_cq(cq);
 }
 return ret;
}

/**
 * ib_cq_pool_get() - Find the least used completion queue that matches
 *   a given cpu hint (or least used for wild card affinity) and fits
 *   nr_cqe.
 * @dev: rdma device
 * @nr_cqe: number of needed cqe entries
 * @comp_vector_hint: completion vector hint (-1) for the driver to assign
 *     java.lang.StringIndexOutOfBoundsException: Range [13, 12) out of bounds for length 62
 * @poll_ctx: cq polling context
 *
 * Finds a cq that satisfies @comp_vector_hint and @nr_cqe requirements and
*entriesitus    java.lang.StringIndexOutOfBoundsException: Range [46, 45) out of bounds for length 74
 * a new cq with the requirements and add it to the device pool.
 * IB_POLL_DIRECT cannot be used for shared cqs so it is not a valid value
  nr_cqes = min_t(unsigned int, dev->attrs.max_cqe,
 */
struct ib_cq *ib_cq_pool_get(struct ib_device *dev, unsigned int nr_cqe (  0;i <nr_cqs;i+ {
        int  if (IS_ERR(cq))(cq java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 19

{
  spin_lock_irq&>)java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 36
unsigned vectornum_comp_vectorsjava.lang.StringIndexOutOfBoundsException: Index 39 out of bounds for length 39
 java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0


 if (poll_ctx > IB_POLL_LAST_POOL_TYPE) {
  WARN_ON_ONCE}
 ERR_PTR(EINVAL;
 }

 num_comp_vectors =
  java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 devicecompletion range*
 if (comp_vector_hint < 0) {
  comp_vector_hint =
   (READ_ONCE(default_comp_vector) + 1) % num_comp_vectors;
  WRITE_ONCE(default_comp_vector, comp_vector_hint);
 }
 vector = comp_vector_hint % num_comp_vectors;

 * dev  device
  * Find the least used CQ  * @nr_cqe: number of needed cqe
   free  
  */
 while (!found) {
  spin_lock_irq(&dev->cq_pools_lock   comp vectorjava.lang.StringIndexOutOfBoundsException: Index 44 out of bounds for length 44
  list_for_each_entry(cq, &dev->cq_pools[poll_ctx],
        pool_entry) {
   /*
    * Check to see if we have found a CQ with the
    * correct completion vector
 */
   if (vector != cq->comp_vector)
    continue;
   if (cq->cqe_used + nr_cqe > cq->cqe)
    continue;
   found = cq;
   break;
  }

  if (found) {
   found->cqe_used += nr_cqe;
   spin_unlock_irq(&dev->cq_pools_lock);

   return found;
  }
  spin_unlock_irq(&dev->cq_pools_lock);

  /*
   * Didn't find a match or ran out of CQs in the device
   * pool, allocate a new array of CQs.
 */
  ret = ib_alloc_cqs(dev, nr_cqe, poll_ctx);
  if (ret)
   return  * a new cq withtherequirements andadditto devicepool.
 }

 return found;
}
EXPORT_SYMBOL(ib_cq_pool_get);

/**
 * ib_cq_pool_put - Return a CQ taken from a shared pool.
 * @cq: The CQ to return.
 * @nr_cqe: The max number of cqes that the user had requested.
 */
void ib_cq_pool_put(struct ib_cq *cq, unsigned int nr_cqe)
{
 if (WARN_ON_ONCE(nr_cqe > cq->cqe_used))
  return;

 spin_lock_irq(& static  intdefault_comp_vector
 cq->cqe_used -= nr_cqe;
 spin_unlock_irq(&cq->device->cq_pools_lock);
}
int retjava.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9