Home
last modified time | relevance | path

Searched refs:fq (Results 1 – 11 of 11) sorted by relevance

/include/net/
A Dfq_impl.h40 static void fq_adjust_removal(struct fq *fq, in fq_adjust_removal() argument
197 static void fq_tin_enqueue(struct fq *fq, in fq_tin_enqueue() argument
234 oom = (fq->memory_usage > fq->memory_limit); in fq_tin_enqueue()
235 while (fq->backlog > fq->limit || oom) { in fq_tin_enqueue()
252 static void fq_flow_filter(struct fq *fq, in fq_flow_filter() argument
273 static void fq_tin_filter(struct fq *fq, in fq_tin_filter() argument
289 static void fq_flow_reset(struct fq *fq, in fq_flow_reset() argument
311 static void fq_tin_reset(struct fq *fq, in fq_tin_reset() argument
353 memset(fq, 0, sizeof(fq[0])); in fq_init()
361 fq->flows = kvcalloc(fq->flows_cnt, sizeof(fq->flows[0]), GFP_KERNEL); in fq_init()
[all …]
A Dipv6_frag.h38 fq->ecn = 0; in ip6frag_init()
51 return jhash2((const u32 *)&fq->key.v6, in ip6frag_obj_hashfn()
73 if (READ_ONCE(fq->q.fqdir->dead)) in ip6frag_expire_frag_queue()
75 spin_lock(&fq->q.lock); in ip6frag_expire_frag_queue()
77 if (fq->q.flags & INET_FRAG_COMPLETE) in ip6frag_expire_frag_queue()
80 fq->q.flags |= INET_FRAG_DROP; in ip6frag_expire_frag_queue()
81 inet_frag_kill(&fq->q, &refs); in ip6frag_expire_frag_queue()
98 head = inet_frag_pull_head(&fq->q); in ip6frag_expire_frag_queue()
103 spin_unlock(&fq->q.lock); in ip6frag_expire_frag_queue()
110 spin_unlock(&fq->q.lock); in ip6frag_expire_frag_queue()
[all …]
A Dfq.h68 struct fq { struct
85 typedef struct sk_buff *fq_tin_dequeue_t(struct fq *, argument
89 typedef void fq_skb_free_t(struct fq *,
95 typedef bool fq_skb_filter_t(struct fq *,
A Dxsk_buff_pool.h64 struct xsk_queue *fq ____cacheline_aligned_in_smp;
/include/net/libeth/
A Drx.h93 int libeth_rx_fq_create(struct libeth_fq *fq, struct napi_struct *napi);
94 void libeth_rx_fq_destroy(struct libeth_fq *fq);
104 static inline dma_addr_t libeth_rx_alloc(const struct libeth_fq_fp *fq, u32 i) in libeth_rx_alloc() argument
106 struct libeth_fqe *buf = &fq->fqes[i]; in libeth_rx_alloc()
108 buf->truesize = fq->truesize; in libeth_rx_alloc()
109 buf->netmem = page_pool_dev_alloc_netmem(fq->pp, &buf->offset, in libeth_rx_alloc()
115 fq->pp->p.offset; in libeth_rx_alloc()
A Dxsk.h620 int libeth_xskfq_create(struct libeth_xskfq *fq);
621 void libeth_xskfq_destroy(struct libeth_xskfq *fq);
642 libeth_xskfqe_alloc(struct libeth_xskfq_fp *fq, u32 n, in libeth_xskfqe_alloc() argument
648 this = fq->count - fq->ntu; in libeth_xskfqe_alloc()
653 xskb = (typeof(xskb))&fq->fqes[fq->ntu]; in libeth_xskfqe_alloc()
654 ret = xsk_buff_alloc_batch(fq->pool, xskb, this); in libeth_xskfqe_alloc()
656 for (u32 i = 0, ntu = fq->ntu; likely(i < ret); i++) in libeth_xskfqe_alloc()
657 fill(fq, ntu + i); in libeth_xskfqe_alloc()
660 fq->ntu += ret; in libeth_xskfqe_alloc()
662 if (likely(fq->ntu < fq->count) || unlikely(ret < this)) in libeth_xskfqe_alloc()
[all …]
/include/soc/fsl/
A Dqman.h300 } __packed fq; /* FQRN/FQRNI/FQRL/FQPN */ member
691 struct qman_fq *fq,
699 typedef void (*qman_cb_mr)(struct qman_portal *qm, struct qman_fq *fq,
969 int qman_create_fq(u32 fqid, u32 flags, struct qman_fq *fq);
979 void qman_destroy_fq(struct qman_fq *fq);
985 u32 qman_fq_fqid(struct qman_fq *fq);
1030 int qman_schedule_fq(struct qman_fq *fq);
1050 int qman_retire_fq(struct qman_fq *fq, u32 *flags);
1059 int qman_oos_fq(struct qman_fq *fq);
1078 int qman_volatile_dequeue(struct qman_fq *fq, u32 flags, u32 vdqcr);
[all …]
/include/trace/events/
A Dnetfs.h757 TP_PROTO(const struct folio_queue *fq,
760 TP_ARGS(fq, trace),
769 __entry->rreq = fq ? fq->rreq_id : 0;
770 __entry->id = fq ? fq->debug_id : 0;
/include/linux/
A Dnetfs.h464 void netfs_free_folioq_buffer(struct folio_queue *fq);
A Dblk-mq.h353 struct blk_flush_queue *fq; member
A Dblkdev.h578 struct blk_flush_queue *fq; member

Completed in 34 milliseconds