common/cnxk: support tunnel header verification

[dpdk.git] / drivers / common / cpt / cpt_common.h

diff --git a/drivers/common/cpt/cpt_common.h b/drivers/common/cpt/cpt_common.h
index 1823939..d70668a 100644 (file)
--- a/drivers/common/cpt/cpt_common.h
+++ b/drivers/common/cpt/cpt_common.h
@@ -5,15 +5,14 @@
 #ifndef _CPT_COMMON_H_
 #define _CPT_COMMON_H_
 
+#include <rte_prefetch.h>
+#include <rte_mempool.h>
+
 /*
  * This file defines common macros and structs
  */
 
-/*
- * Macros to determine CPT model. Driver makefile will define CPT_MODEL
- * accordingly
- */
-#define CRYPTO_OCTEONTX                0x1
+#define TIME_IN_RESET_COUNT    5
 
 /* Default command timeout in seconds */
 #define DEFAULT_COMMAND_TIMEOUT        4
@@ -21,36 +20,12 @@
 #define CPT_COUNT_THOLD                32
 #define CPT_TIMER_THOLD                0x3F
 
-#define AE_TYPE 1
-#define SE_TYPE 2
-
-#ifndef ROUNDUP4
-#define ROUNDUP4(val)  (((val) + 3) & 0xfffffffc)
-#endif
-
-#ifndef ROUNDUP8
-#define ROUNDUP8(val)  (((val) + 7) & 0xfffffff8)
-#endif
-
-#ifndef ROUNDUP16
-#define ROUNDUP16(val) (((val) + 15) & 0xfffffff0)
-#endif
-
-#ifndef __hot
-#define __hot __attribute__((hot))
-#endif
-
 #define MOD_INC(i, l)   ((i) == (l - 1) ? (i) = 0 : (i)++)
 
-struct cptvf_meta_info {
-       void *cptvf_meta_pool;
-       int cptvf_op_mlen;
-       int cptvf_op_sb_mlen;
-};
-
-struct rid {
-       /** Request id of a crypto operation */
-       uintptr_t rid;
+struct cpt_qp_meta_info {
+       struct rte_mempool *pool;
+       int sg_mlen;
+       int lb_mlen;
 };
 
 /*
@@ -58,14 +33,12 @@ struct rid {
  *
  */
 struct pending_queue {
+       /** Array of pending requests */
+       void **rid_queue;
        /** Tail of queue to be used for enqueue */
-       uint16_t enq_tail;
+       unsigned int tail;
        /** Head of queue to be used for dequeue */
-       uint16_t deq_head;
-       /** Array of pending requests */
-       struct rid *rid_queue;
-       /** Pending requests count */
-       uint64_t pending_count;
+       unsigned int head;
 };
 
 struct cpt_request_info {
@@ -78,12 +51,77 @@ struct cpt_request_info {
                uint64_t ei0;
                uint64_t ei1;
                uint64_t ei2;
-               uint64_t ei3;
        } ist;
+       uint8_t *rptr;
+       const void *qp;
 
        /** Control path fields */
        uint64_t time_out;
        uint8_t extra_time;
-};
+} __rte_aligned(8);
+
+static __rte_always_inline void
+pending_queue_push(struct pending_queue *q, void *rid, unsigned int off,
+                       const int qsize)
+{
+       /* NOTE: no free space check, but it is expected that one is made */
+       q->rid_queue[(q->tail + off) & (qsize - 1)] = rid;
+}
+
+static __rte_always_inline void
+pending_queue_commit(struct pending_queue *q, unsigned int cnt,
+                       const unsigned int qsize)
+{
+       /* Ensure ordering between setting the entry and updating the tail */
+       rte_atomic_thread_fence(__ATOMIC_RELEASE);
+
+       q->tail = (q->tail + cnt) & (qsize - 1);
+}
+
+static __rte_always_inline void
+pending_queue_pop(struct pending_queue *q, const int qsize)
+{
+       /* NOTE: no empty check, but it is expected that one is made prior */
+
+       q->head = (q->head + 1) & (qsize - 1);
+}
+
+static __rte_always_inline void
+pending_queue_peek(struct pending_queue *q, void **rid, const int qsize,
+                       int prefetch_next)
+{
+       void *next_rid;
+       /* NOTE: no empty check, but it is expected that one is made */
+
+       *rid = q->rid_queue[q->head];
+
+       if (likely(prefetch_next)) {
+               next_rid = q->rid_queue[(q->head + 1) & (qsize - 1)];
+               rte_prefetch_non_temporal((void *)next_rid);
+       }
+}
+
+static __rte_always_inline unsigned int
+pending_queue_level(struct pending_queue *q, const int qsize)
+{
+       return (q->tail - q->head) & (qsize - 1);
+}
+
+static __rte_always_inline unsigned int
+pending_queue_free_slots(struct pending_queue *q, const int qsize,
+               const int reserved_slots)
+{
+       int free_slots;
+
+       free_slots = qsize - pending_queue_level(q, qsize);
+
+       /* Use only use qsize - 1 */
+       free_slots -= 1 + reserved_slots;
+
+       if (unlikely(free_slots < 0))
+               return 0;
+
+       return free_slots;
+}
 
 #endif /* _CPT_COMMON_H_ */