Home
last modified time | relevance | path

Searched +full:1 +full:q (Results 1 – 25 of 1114) sorted by relevance

12345678910>>...45

/linux/drivers/media/common/videobuf2/
H A Dvideobuf2-core.c36 #define PLANE_INDEX_MASK (BIT_MASK(PLANE_INDEX_BITS) - 1)
38 #define BUFFER_INDEX_MASK (MAX_BUFFER_INDEX - 1)
47 #define dprintk(q, level, fmt, arg...) \ argument
50 pr_info("[%s] %s: " fmt, (q)->name, __func__, \
103 #define log_qop(q, op) \ argument
104 dprintk(q, 2, "call_qop(%s)%s\n", #op, \
105 (q)->ops->op ? "" : " (nop)")
107 #define call_qop(q, op, args...) \ argument
111 log_qop(q, op); \
112 err = (q)->ops->op ? (q)->ops->op(args) : 0; \
[all …]
/linux/net/sched/
H A Dsch_choke.c46 #define CHOKE_MAX_QUEUE (128*1024 - 1)
69 unsigned int tab_mask; /* size - 1 */
75 static unsigned int choke_len(const struct choke_sched_data *q) in choke_len() argument
77 return (q->tail - q->head) & q->tab_mask; in choke_len()
81 static int use_ecn(const struct choke_sched_data *q) in use_ecn() argument
83 return q->flags & TC_RED_ECN; in use_ecn()
87 static int use_harddrop(const struct choke_sched_data *q) in use_harddrop() argument
89 return q->flags & TC_RED_HARDDROP; in use_harddrop()
93 static void choke_zap_head_holes(struct choke_sched_data *q) in choke_zap_head_holes() argument
96 q->head = (q->head + 1) & q->tab_mask; in choke_zap_head_holes()
[all …]
H A Dsch_netem.c35 Sources: [1] Mark Carson, Darrin Santay, "NIST Net - A Linux-based
60 [1] NetemCLG Home http://netgroup.uniroma2.it/NetemCLG
63 in the Netem module in the Linux kernel", available in [1]
125 TX_IN_GAP_PERIOD = 1,
132 GOOD_STATE = 1,
145 u32 a4; /* p14 for 4-states or 1-k for GE */
200 rho = (u64)state->rho + 1; in get_crandom()
201 answer = (value * ((1ull<<32) - rho) + state->last * rho) >> 32; in get_crandom()
210 static bool loss_4state(struct netem_sched_data *q) in loss_4state() argument
212 struct clgstate *clg = &q->clg; in loss_4state()
[all …]
H A Dsch_sfq.c68 - max mtu to 2^18-1;
76 #define SFQ_MAX_FLOWS (0x10000 - SFQ_MAX_DEPTH - 1) /* max number of flows */
80 /* This type should contain at least SFQ_MAX_DEPTH + 1 + SFQ_MAX_FLOWS values */
85 * Small indexes [0 ... SFQ_MAX_FLOWS - 1] are 'pointers' to slots[] array
126 struct sfq_head dep[SFQ_MAX_DEPTH + 1];
129 * dep[1] : list of flows with 1 packet
143 static inline struct sfq_head *sfq_dep_head(struct sfq_sched_data *q, sfq_index val) in sfq_dep_head() argument
146 return &q->slots[val].dep; in sfq_dep_head()
147 return &q->dep[val - SFQ_MAX_FLOWS]; in sfq_dep_head()
150 static unsigned int sfq_hash(const struct sfq_sched_data *q, in sfq_hash() argument
[all …]
H A Dsch_cake.c101 * @rec_inv_sqrt: reciprocal value of sqrt(count) >> 1
261 CAKE_FLAG_AUTORATE_INGRESS = BIT(1),
300 static u16 quantum_div[CAKE_QUEUES + 1] = {0};
306 1, 1, 1, 1, 1, 1, 1, 1,
316 2, 0, 1, 2, 4, 2, 2, 2,
317 1, 2, 1, 2, 1, 2, 1, 2,
327 0, 1, 0, 0, 2, 0, 0, 0,
328 1, 0, 0, 0, 0, 0, 0, 0,
338 0, 1, 0, 0, 2, 0, 0, 0,
339 1, 0, 0, 0, 0, 0, 0, 0,
[all …]
H A Dsch_skbprio.c40 static u16 calc_new_high_prio(const struct skbprio_sched_data *q) in calc_new_high_prio() argument
44 for (prio = q->highest_prio - 1; prio >= q->lowest_prio; prio--) { in calc_new_high_prio()
45 if (!skb_queue_empty(&q->qdiscs[prio])) in calc_new_high_prio()
53 static u16 calc_new_low_prio(const struct skbprio_sched_data *q) in calc_new_low_prio() argument
57 for (prio = q->lowest_prio + 1; prio <= q->highest_prio; prio++) { in calc_new_low_prio()
58 if (!skb_queue_empty(&q->qdiscs[prio])) in calc_new_low_prio()
62 /* SKB queue is empty, return SKBPRIO_MAX_PRIORITY - 1 in calc_new_low_prio()
65 return SKBPRIO_MAX_PRIORITY - 1; in calc_new_low_prio()
71 const unsigned int max_priority = SKBPRIO_MAX_PRIORITY - 1; in skbprio_enqueue()
72 struct skbprio_sched_data *q = qdisc_priv(sch); in skbprio_enqueue() local
[all …]
H A Dsch_fq.c66 * If packets have monotically increasing time_to_send, they are placed in O(1)
75 unsigned long age; /* (jiffies | 1UL) when flow was emptied, for gc */
79 /* Following field is only used for q->internal,
80 * because q->internal is not hashed in fq_root[]
93 struct rb_node rate_node; /* anchor in q->delayed tree */
109 #define FQ_PRIO2BAND_CRUMB_SIZE ((TC_PRIO_MAX + 1) >> 2)
176 f->age = jiffies | 1UL; in fq_flow_set_detached()
181 return !!(f->age & 1UL); in fq_flow_is_detached()
197 static void fq_flow_add_tail(struct fq_sched_data *q, struct fq_flow *flow, in fq_flow_add_tail() argument
200 struct fq_perband_flows *pband = &q->band_flows[flow->band]; in fq_flow_add_tail()
[all …]
H A Dsch_multiq.c32 struct multiq_sched_data *q = qdisc_priv(sch); in multiq_classify() local
35 struct tcf_proto *fl = rcu_dereference_bh(q->filter_list); in multiq_classify()
53 if (band >= q->bands) in multiq_classify()
54 return q->queues[0]; in multiq_classify()
56 return q->queues[band]; in multiq_classify()
79 sch->q.qlen++; in multiq_enqueue()
89 struct multiq_sched_data *q = qdisc_priv(sch); in multiq_dequeue() local
94 for (band = 0; band < q->bands; band++) { in multiq_dequeue()
96 q->curband++; in multiq_dequeue()
97 if (q in multiq_dequeue()
120 struct multiq_sched_data *q = qdisc_priv(sch); multiq_peek() local
151 struct multiq_sched_data *q = qdisc_priv(sch); multiq_reset() local
162 struct multiq_sched_data *q = qdisc_priv(sch); multiq_destroy() local
174 struct multiq_sched_data *q = qdisc_priv(sch); multiq_tune() local
238 struct multiq_sched_data *q = qdisc_priv(sch); multiq_init() local
263 struct multiq_sched_data *q = qdisc_priv(sch); multiq_dump() local
283 struct multiq_sched_data *q = qdisc_priv(sch); multiq_graft() local
296 struct multiq_sched_data *q = qdisc_priv(sch); multiq_leaf() local
304 struct multiq_sched_data *q = qdisc_priv(sch); multiq_find() local
319 multiq_unbind(struct Qdisc * q,unsigned long cl) multiq_unbind() argument
326 struct multiq_sched_data *q = qdisc_priv(sch); multiq_dump_class() local
336 struct multiq_sched_data *q = qdisc_priv(sch); multiq_dump_class_stats() local
349 struct multiq_sched_data *q = qdisc_priv(sch); multiq_walk() local
364 struct multiq_sched_data *q = qdisc_priv(sch); multiq_tcf_block() local
[all...]
H A Dsch_qfq.c25 [1] Paolo Valente,
52 aggregates. See [1] and [2] for a full description.
73 Lmax=1<<MTU_SHIFT, w_min = 1 .
80 inv_w = (1<<FRAC_BITS)/w_i
98 * in the range [1, 2^MAX_WSHIFT], and we try to map each aggregate i to the
108 #define QFQ_MAX_WEIGHT (1<<QFQ_MAX_WSHIFT) /* see qfq_slot_insert */
112 #define ONE_FP (1UL << FRAC_BITS)
116 #define QFQ_MAX_LMAX (1UL << QFQ_MTU_SHIFT)
189 struct qfq_group groups[QFQ_MAX_INDEX + 1]; /* The groups. */
212 struct qfq_sched *q = qdisc_priv(sch); in qfq_find_class() local
[all …]
H A Dsch_ets.c21 * has no traffic then band 1, etc.
54 u8 prio2band[TC_PRIO_MAX + 1];
58 static const struct nla_policy ets_policy[TCA_ETS_MAX + 1] = {
65 static const struct nla_policy ets_priomap_policy[TCA_ETS_MAX + 1] = {
69 static const struct nla_policy ets_quanta_policy[TCA_ETS_MAX + 1] = {
73 static const struct nla_policy ets_class_policy[TCA_ETS_MAX + 1] = {
97 struct ets_sched *q = qdisc_priv(sch); in ets_class_from_arg() local
99 if (arg == 0 || arg > q->nbands) in ets_class_from_arg()
101 return &q->classes[arg - 1]; in ets_class_from_arg()
106 struct ets_sched *q = qdisc_priv(sch); in ets_class_id() local
[all …]
H A Dsch_prio.c25 u8 prio2band[TC_PRIO_MAX+1];
33 struct prio_sched_data *q = qdisc_priv(sch); in prio_classify() local
41 fl = rcu_dereference_bh(q->filter_list); in prio_classify()
57 return q->queues[q->prio2band[band & TC_PRIO_MAX]]; in prio_classify()
61 band = TC_H_MIN(band) - 1; in prio_classify()
62 if (band >= q->bands) in prio_classify()
63 return q->queues[q->prio2band[0]]; in prio_classify()
65 return q->queues[band]; in prio_classify()
89 sch->q.qlen++; in prio_enqueue()
99 struct prio_sched_data *q = qdisc_priv(sch); in prio_peek() local
[all …]
/linux/drivers/net/ethernet/fungible/funeth/
H A Dfuneth_rx.c22 /* Per packet headroom in non-XDP mode. Present only for 1-frag packets. */
33 FUN_XDP_FLUSH_REDIR = 1,
50 static void cache_offer(struct funeth_rxq *q, const struct funeth_rxbuf *buf) in cache_offer() argument
52 struct funeth_rx_cache *c = &q->cache; in cache_offer()
58 dma_unmap_page_attrs(q->dma_dev, buf->dma_addr, PAGE_SIZE, in cache_offer()
67 static bool cache_get(struct funeth_rxq *q, struct funeth_rxbuf *rb) in cache_get() argument
69 struct funeth_rx_cache *c = &q->cache; in cache_get()
77 dma_sync_single_for_device(q->dma_dev, buf->dma_addr, in cache_get()
88 dma_unmap_page_attrs(q->dma_dev, buf->dma_addr, PAGE_SIZE, in cache_get()
98 static int funeth_alloc_page(struct funeth_rxq *q, struct funeth_rxbuf *rb, in funeth_alloc_page() argument
[all …]
H A Dfuneth_tx.c48 dma_unmap_single(dev, addr[-1], data_len, DMA_TO_DEVICE); in fun_map_pkt()
56 static void *txq_end(const struct funeth_txq *q) in txq_end() argument
58 return (void *)q->hw_wb; in txq_end()
64 static unsigned int txq_to_end(const struct funeth_txq *q, void *p) in txq_to_end() argument
66 return txq_end(q) - p; in txq_to_end()
78 static struct fun_dataop_gl *fun_write_gl(const struct funeth_txq *q, in fun_write_gl() argument
90 i < ngle && txq_to_end(q, gle); i++, gle++) in fun_write_gl()
93 if (txq_to_end(q, gle) == 0) { in fun_write_gl()
94 gle = (struct fun_dataop_gl *)q->desc; in fun_write_gl()
107 static struct sk_buff *fun_tls_tx(struct sk_buff *skb, struct funeth_txq *q, in fun_tls_tx() argument
[all …]
/linux/drivers/net/wireless/mediatek/mt76/
H A Ddma.c189 mt76_dma_sync_idx(struct mt76_dev *dev, struct mt76_queue *q) in mt76_dma_sync_idx() argument
191 Q_WRITE(q, desc_base, q->desc_dma); in mt76_dma_sync_idx()
192 if (q->flags & MT_QFLAG_WED_RRO_EN) in mt76_dma_sync_idx()
193 Q_WRITE(q, ring_size, MT_DMA_RRO_EN | q->ndesc); in mt76_dma_sync_idx()
195 Q_WRITE(q, ring_size, q->ndesc); in mt76_dma_sync_idx()
196 q->head = Q_READ(q, dma_idx); in mt76_dma_sync_idx()
197 q->tail = q->head; in mt76_dma_sync_idx()
200 void __mt76_dma_queue_reset(struct mt76_dev *dev, struct mt76_queue *q, in __mt76_dma_queue_reset() argument
203 if (!q || !q->ndesc) in __mt76_dma_queue_reset()
206 if (!mt76_queue_is_wed_rro_ind(q)) { in __mt76_dma_queue_reset()
[all …]
/linux/drivers/net/wireless/broadcom/b43/
H A Dpio.c24 static u16 generate_cookie(struct b43_pio_txqueue *q, in generate_cookie() argument
37 cookie = (((u16)q->index + 1) << 12); in generate_cookie()
49 struct b43_pio_txqueue *q = NULL; in parse_cookie() local
54 q = pio->tx_queue_AC_BK; in parse_cookie()
57 q = pio->tx_queue_AC_BE; in parse_cookie()
60 q = pio->tx_queue_AC_VI; in parse_cookie()
63 q = pio->tx_queue_AC_VO; in parse_cookie()
66 q = pio->tx_queue_mcast; in parse_cookie()
69 if (B43_WARN_ON(!q)) in parse_cookie()
72 if (B43_WARN_ON(pack_index >= ARRAY_SIZE(q->packets))) in parse_cookie()
[all …]
/linux/drivers/net/ethernet/chelsio/cxgb3/
H A Dsge.c66 #define FL1_PG_ORDER (PAGE_SIZE > 8192 ? 0 : 1)
94 TXQ_RUNNING = 1 << 0, /* fetch engine is running */
95 TXQ_LAST_PKT_DB = 1 << 1, /* last packet rang the doorbell */
141 dma_addr_t addr[MAX_SKB_FRAGS + 1];
148 * desc = 1 + (flits - 2) / (WR_FLITS - 1).
154 #if SGE_NUM_GENBITS == 1
155 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
160 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
165 # error "SGE_NUM_GENBITS must be 1 or 2"
169 static inline struct sge_qset *rspq_to_qset(const struct sge_rspq *q) in rspq_to_qset() argument
[all …]
/linux/sound/core/seq/oss/
H A Dseq_oss_readq.c20 //#define SNDRV_SEQ_OSS_MAX_TIMEOUT (unsigned long)(-1)
35 struct seq_oss_readq *q; in snd_seq_oss_readq_new() local
37 q = kzalloc(sizeof(*q), GFP_KERNEL); in snd_seq_oss_readq_new()
38 if (!q) in snd_seq_oss_readq_new()
41 q->q = kcalloc(maxlen, sizeof(union evrec), GFP_KERNEL); in snd_seq_oss_readq_new()
42 if (!q->q) { in snd_seq_oss_readq_new()
43 kfree(q); in snd_seq_oss_readq_new()
47 q->maxlen = maxlen; in snd_seq_oss_readq_new()
48 q->qlen = 0; in snd_seq_oss_readq_new()
49 q->head = q->tail = 0; in snd_seq_oss_readq_new()
[all …]
/linux/drivers/gpu/drm/xe/
H A Dxe_guc_submit.c49 exec_queue_to_guc(struct xe_exec_queue *q) in exec_queue_to_guc() argument
51 return &q->gt->uc.guc; in exec_queue_to_guc()
59 #define EXEC_QUEUE_STATE_REGISTERED (1 << 0)
60 #define EXEC_QUEUE_STATE_ENABLED (1 << 1)
61 #define EXEC_QUEUE_STATE_PENDING_ENABLE (1 << 2)
62 #define EXEC_QUEUE_STATE_PENDING_DISABLE (1 << 3)
63 #define EXEC_QUEUE_STATE_DESTROYED (1 << 4)
64 #define EXEC_QUEUE_STATE_SUSPENDED (1 << 5)
65 #define EXEC_QUEUE_STATE_RESET (1 << 6)
66 #define EXEC_QUEUE_STATE_KILLED (1 << 7)
[all …]
H A Dxe_exec_queue.c32 XE_EXEC_QUEUE_TIMESLICE = 1,
37 static int exec_queue_user_extensions(struct xe_device *xe, struct xe_exec_queue *q,
40 static void __xe_exec_queue_free(struct xe_exec_queue *q) in __xe_exec_queue_free() argument
42 if (xe_exec_queue_uses_pxp(q)) in __xe_exec_queue_free()
43 xe_pxp_exec_queue_remove(gt_to_xe(q->gt)->pxp, q); in __xe_exec_queue_free()
44 if (q->vm) in __xe_exec_queue_free()
45 xe_vm_put(q->vm); in __xe_exec_queue_free()
47 if (q->xef) in __xe_exec_queue_free()
48 xe_file_put(q->xef); in __xe_exec_queue_free()
50 kfree(q); in __xe_exec_queue_free()
[all …]
/linux/sound/core/seq/
H A Dseq_queue.c50 static int queue_list_add(struct snd_seq_queue *q) in queue_list_add() argument
57 queue_list[i] = q; in queue_list_add()
58 q->queue = i; in queue_list_add()
63 return -1; in queue_list_add()
68 struct snd_seq_queue *q; in queue_list_remove() local
71 q = queue_list[id]; in queue_list_remove()
72 if (q) { in queue_list_remove()
73 guard(spinlock)(&q->owner_lock); in queue_list_remove()
74 if (q->owner == client) { in queue_list_remove()
76 q->klocked = 1; in queue_list_remove()
[all …]
/linux/drivers/infiniband/sw/rxe/
H A Drxe_queue.h18 * - The driver indices are always masked off to q->index_mask
26 * - By passing the type in the parameter list separate from q
83 void rxe_queue_reset(struct rxe_queue *q);
88 int rxe_queue_resize(struct rxe_queue *q, unsigned int *num_elem_p,
95 static inline u32 queue_next_index(struct rxe_queue *q, int index) in queue_next_index() argument
97 return (index + 1) & q->index_mask; in queue_next_index()
100 static inline u32 queue_get_producer(const struct rxe_queue *q, in queue_get_producer() argument
108 prod = smp_load_acquire(&q->buf->producer_index); in queue_get_producer()
112 prod = q->index; in queue_get_producer()
116 prod = q->buf->producer_index; in queue_get_producer()
[all …]
/linux/drivers/spi/
H A Dspi-fsl-qspi.c59 #define QUADSPI_MCR_SWRSTHD_MASK BIT(1)
101 #define QUADSPI_SR_IP_ACC_MASK BIT(1)
125 #define QUADSPI_LCKER_UNLOCK BIT(1)
134 #define LUT_CMD 1
158 #define LUT_PAD(x) (fls(x) - 1)
175 #define QUADSPI_QUIRK_4X_INT_CLK BIT(1)
277 static inline int needs_swap_endian(struct fsl_qspi *q) in needs_swap_endian() argument
279 return q->devtype_data->quirks & QUADSPI_QUIRK_SWAP_ENDIAN; in needs_swap_endian()
282 static inline int needs_4x_clock(struct fsl_qspi *q) in needs_4x_clock() argument
284 return q->devtype_data->quirks & QUADSPI_QUIRK_4X_INT_CLK; in needs_4x_clock()
[all …]
/linux/drivers/net/ethernet/pensando/ionic/
H A Dionic_txrx.c15 static dma_addr_t ionic_tx_map_single(struct ionic_queue *q,
18 static dma_addr_t ionic_tx_map_frag(struct ionic_queue *q,
22 static void ionic_tx_desc_unmap_bufs(struct ionic_queue *q,
25 static void ionic_tx_clean(struct ionic_queue *q,
30 static inline void ionic_txq_post(struct ionic_queue *q, bool ring_dbell) in ionic_txq_post() argument
32 ionic_q_post(q, ring_dbell); in ionic_txq_post()
35 static inline void ionic_rxq_post(struct ionic_queue *q, bool ring_dbell) in ionic_rxq_post() argument
37 ionic_q_post(q, ring_dbell); in ionic_rxq_post()
40 bool ionic_txq_poke_doorbell(struct ionic_queue *q) in ionic_txq_poke_doorbell() argument
46 netdev = q->lif->netdev; in ionic_txq_poke_doorbell()
[all …]
/linux/drivers/net/ethernet/mellanox/mlxsw/
H A Dpci.c101 struct mlxsw_pci_queue *q; member
174 static char *__mlxsw_pci_queue_elem_get(struct mlxsw_pci_queue *q, in __mlxsw_pci_queue_elem_get() argument
177 return q->mem_item.buf + (elem_size * elem_index); in __mlxsw_pci_queue_elem_get()
181 mlxsw_pci_queue_elem_info_get(struct mlxsw_pci_queue *q, int elem_index) in mlxsw_pci_queue_elem_info_get() argument
183 return &q->elem_info[elem_index]; in mlxsw_pci_queue_elem_info_get()
187 mlxsw_pci_queue_elem_info_producer_get(struct mlxsw_pci_queue *q) in mlxsw_pci_queue_elem_info_producer_get() argument
189 int index = q->producer_counter & (q->count - 1); in mlxsw_pci_queue_elem_info_producer_get()
191 if ((u16) (q->producer_counter - q->consumer_counter) == q->count) in mlxsw_pci_queue_elem_info_producer_get()
193 return mlxsw_pci_queue_elem_info_get(q, index); in mlxsw_pci_queue_elem_info_producer_get()
197 mlxsw_pci_queue_elem_info_consumer_get(struct mlxsw_pci_queue *q) in mlxsw_pci_queue_elem_info_consumer_get() argument
[all …]
/linux/drivers/accel/habanalabs/common/
H A Dhw_queue.c23 ptr &= ((HL_QUEUE_LENGTH << 1) - 1); in hl_hw_queue_add_ptr()
28 return atomic_read(ci) & ((queue_len << 1) - 1); in queue_ci_get()
31 static inline int queue_free_slots(struct hl_hw_queue *q, u32 queue_len) in queue_free_slots() argument
33 int delta = (q->pi - queue_ci_get(&q->ci, queue_len)); in queue_free_slots()
44 struct hl_hw_queue *q; in hl_hw_queue_update_ci() local
50 q = &hdev->kernel_queues[0]; in hl_hw_queue_update_ci()
53 if (!hdev->asic_prop.max_queues || q->queue_type == QUEUE_TYPE_HW) in hl_hw_queue_update_ci()
58 * 1. All queues of a non completion CS will never get a completion. in hl_hw_queue_update_ci()
61 for (i = 0 ; i < hdev->asic_prop.max_queues ; i++, q++) { in hl_hw_queue_update_ci()
62 if (!cs_needs_completion(cs) || q->queue_type == QUEUE_TYPE_INT) in hl_hw_queue_update_ci()
[all …]

12345678910>>...45