Home
last modified time | relevance | path

Searched refs:q (Results 1 – 25 of 971) sorted by relevance

12345678910>>...39

/linux/Documentation/networking/
H A Dtls-offload-layers.svg1q-0.609375 -0.359375 -1.203125 -0.359375q-0.546875 0 -0.96875 0.328125q-0.421875 0.328125 -0.60937…
/linux/sound/core/seq/oss/
H A Dseq_oss_readq.c35 struct seq_oss_readq *q; in snd_seq_oss_readq_new() local
37 q = kzalloc_flex(*q, q, maxlen); in snd_seq_oss_readq_new()
38 if (!q) in snd_seq_oss_readq_new()
41 q->maxlen = maxlen; in snd_seq_oss_readq_new()
42 q->qlen = 0; in snd_seq_oss_readq_new()
43 q->head = q->tail = 0; in snd_seq_oss_readq_new()
44 init_waitqueue_head(&q in snd_seq_oss_readq_new()
62 snd_seq_oss_readq_delete(struct seq_oss_readq * q) snd_seq_oss_readq_delete() argument
74 snd_seq_oss_readq_clear(struct seq_oss_readq * q) snd_seq_oss_readq_clear() argument
89 snd_seq_oss_readq_puts(struct seq_oss_readq * q,int dev,unsigned char * data,int len) snd_seq_oss_readq_puts() argument
123 snd_seq_oss_readq_sysex(struct seq_oss_readq * q,int dev,struct snd_seq_event * ev) snd_seq_oss_readq_sysex() argument
141 snd_seq_oss_readq_put_event(struct seq_oss_readq * q,union evrec * ev) snd_seq_oss_readq_put_event() argument
163 snd_seq_oss_readq_pick(struct seq_oss_readq * q,union evrec * rec) snd_seq_oss_readq_pick() argument
175 snd_seq_oss_readq_wait(struct seq_oss_readq * q) snd_seq_oss_readq_wait() argument
187 snd_seq_oss_readq_free(struct seq_oss_readq * q) snd_seq_oss_readq_free() argument
200 snd_seq_oss_readq_poll(struct seq_oss_readq * q,struct file * file,poll_table * wait) snd_seq_oss_readq_poll() argument
210 snd_seq_oss_readq_put_timestamp(struct seq_oss_readq * q,unsigned long curt,int seq_mode) snd_seq_oss_readq_put_timestamp() argument
238 snd_seq_oss_readq_info_read(struct seq_oss_readq * q,struct snd_info_buffer * buf) snd_seq_oss_readq_info_read() argument
[all...]
H A Dseq_oss_writeq.c27 struct seq_oss_writeq *q; in snd_seq_oss_writeq_new() local
30 q = kzalloc_obj(*q); in snd_seq_oss_writeq_new()
31 if (!q) in snd_seq_oss_writeq_new()
33 q->dp = dp; in snd_seq_oss_writeq_new()
34 q->maxlen = maxlen; in snd_seq_oss_writeq_new()
35 spin_lock_init(&q->sync_lock); in snd_seq_oss_writeq_new()
36 q->sync_event_put = 0; in snd_seq_oss_writeq_new()
37 q->sync_time = 0; in snd_seq_oss_writeq_new()
38 init_waitqueue_head(&q->sync_sleep); in snd_seq_oss_writeq_new()
47 return q; in snd_seq_oss_writeq_new()
[all …]
/linux/net/sched/
H A Dsch_choke.c75 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 in choke_zap_head_holes()
103 choke_zap_tail_holes(struct choke_sched_data * q) choke_zap_tail_holes() argument
116 struct choke_sched_data *q = qdisc_priv(sch); choke_drop_by_idx() local
179 choke_peek_random(const struct choke_sched_data * q,unsigned int * pidx) choke_peek_random() argument
199 choke_match_random(const struct choke_sched_data * q,struct sk_buff * nskb,unsigned int * pidx) choke_match_random() argument
215 struct choke_sched_data *q = qdisc_priv(sch); choke_enqueue() local
289 struct choke_sched_data *q = qdisc_priv(sch); choke_dequeue() local
310 struct choke_sched_data *q = qdisc_priv(sch); choke_reset() local
342 struct choke_sched_data *q = qdisc_priv(sch); choke_change() local
437 struct choke_sched_data *q = qdisc_priv(sch); choke_dump() local
466 struct choke_sched_data *q = qdisc_priv(sch); choke_dump_stats() local
481 struct choke_sched_data *q = qdisc_priv(sch); choke_destroy() local
488 struct choke_sched_data *q = qdisc_priv(sch); choke_peek_head() local
[all...]
H A Dsch_netem.c134 * q->limit.
220 static bool loss_4state(struct netem_sched_data *q) in loss_4state()
222 struct clgstate *clg = &q->clg; in loss_4state()
223 u32 rnd = prandom_u32_state(&q->prng.prng_state); in loss_4state()
285 static bool loss_gilb_ell(struct netem_sched_data *q) in loss_gilb_ell()
287 struct clgstate *clg = &q->clg; in loss_gilb_ell()
288 struct rnd_state *s = &q->prng.prng_state; in loss_gilb_ell()
307 static bool loss_event(struct netem_sched_data *q) in loss_event()
309 switch (q->loss_model) { in loss_event()
312 return q in loss_event()
210 loss_4state(struct netem_sched_data * q) loss_4state() argument
275 loss_gilb_ell(struct netem_sched_data * q) loss_gilb_ell() argument
297 loss_event(struct netem_sched_data * q) loss_event() argument
357 packet_time_ns(u64 len,const struct netem_sched_data * q) packet_time_ns() argument
374 struct netem_sched_data *q = qdisc_priv(sch); tfifo_reset() local
393 struct netem_sched_data *q = qdisc_priv(sch); tfifo_enqueue() local
452 struct netem_sched_data *q = qdisc_priv(sch); netem_enqueue() local
655 get_slot_next(struct netem_sched_data * q,u64 now) get_slot_next() argument
673 netem_peek(struct netem_sched_data * q) netem_peek() argument
690 netem_erase_head(struct netem_sched_data * q,struct sk_buff * skb) netem_erase_head() argument
703 struct netem_sched_data *q = qdisc_priv(sch); netem_dequeue() local
787 struct netem_sched_data *q = qdisc_priv(sch); netem_reset() local
861 get_slot(struct netem_sched_data * q,const struct nlattr * attr) get_slot() argument
883 get_correlation(struct netem_sched_data * q,const struct nlattr * attr) get_correlation() argument
892 get_reorder(struct netem_sched_data * q,const struct nlattr * attr) get_reorder() argument
900 get_corrupt(struct netem_sched_data * q,const struct nlattr * attr) get_corrupt() argument
908 get_rate(struct netem_sched_data * q,const struct nlattr * attr) get_rate() argument
922 get_loss_clg(struct netem_sched_data * q,const struct nlattr * attr) get_loss_clg() argument
1013 struct netem_sched_data *q = qdisc_priv(sch); netem_change() local
1141 struct netem_sched_data *q = qdisc_priv(sch); netem_init() local
1161 struct netem_sched_data *q = qdisc_priv(sch); netem_destroy() local
1170 dump_loss_model(const struct netem_sched_data * q,struct sk_buff * skb) dump_loss_model() argument
1222 const struct netem_sched_data *q = qdisc_priv(sch); netem_dump() local
1309 struct netem_sched_data *q = qdisc_priv(sch); netem_dump_class() local
1323 struct netem_sched_data *q = qdisc_priv(sch); netem_graft() local
1331 struct netem_sched_data *q = qdisc_priv(sch); netem_leaf() local
[all...]
H A Dsch_sfq.c143 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
153 return skb_get_hash_perturb(skb, &q->perturbation) & (q->divisor - 1); in sfq_hash()
159 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_classify() local
166 TC_H_MIN(skb->priority) <= q->divisor) in sfq_classify()
169 fl = rcu_dereference_bh(q->filter_list); in sfq_classify()
171 return sfq_hash(q, skb) + 1; in sfq_classify()
187 if (TC_H_MIN(res.classid) <= q->divisor) in sfq_classify()
[all …]
H A Dsch_sfb.c123 static void increment_one_qlen(u32 sfbhash, u32 slot, struct sfb_sched_data *q) in increment_one_qlen() argument
126 struct sfb_bucket *b = &q->bins[slot].bins[0][0]; in increment_one_qlen()
138 static void increment_qlen(const struct sfb_skb_cb *cb, struct sfb_sched_data *q) in increment_qlen() argument
144 increment_one_qlen(sfbhash, 0, q); in increment_qlen()
148 increment_one_qlen(sfbhash, 1, q); in increment_qlen()
152 struct sfb_sched_data *q) in decrement_one_qlen() argument
155 struct sfb_bucket *b = &q->bins[slot].bins[0][0]; in decrement_one_qlen()
167 static void decrement_qlen(const struct sk_buff *skb, struct sfb_sched_data *q) in decrement_qlen() argument
173 decrement_one_qlen(sfbhash, 0, q); in decrement_qlen()
177 decrement_one_qlen(sfbhash, 1, q); in decrement_qlen()
[all …]
H A Dsch_dualpi2.c147 static u64 head_enqueue_time(struct Qdisc *q) in head_enqueue_time() argument
149 struct sk_buff *skb = qdisc_peek_head(q); in head_enqueue_time()
170 static ktime_t next_pi2_timeout(struct dualpi2_sched_data *q) in next_pi2_timeout() argument
172 return ktime_add_ns(ktime_get_ns(), q->pi2_tupdate); in next_pi2_timeout()
185 static bool skb_apply_step(struct sk_buff *skb, struct dualpi2_sched_data *q) in skb_apply_step() argument
187 return skb_is_l4s(skb) && qdisc_qlen(q->l_queue) >= q->min_qlen_step; in skb_apply_step()
190 static bool dualpi2_mark(struct dualpi2_sched_data *q, struct sk_buff *skb) in dualpi2_mark() argument
193 WRITE_ONCE(q->ecn_mark, q->ecn_mark + 1); in dualpi2_mark()
199 static void dualpi2_reset_c_protection(struct dualpi2_sched_data *q) in dualpi2_reset_c_protection() argument
201 WRITE_ONCE(q->c_protection_credit, q->c_protection_init); in dualpi2_reset_c_protection()
[all …]
H A Dsch_red.c55 static inline int red_use_ecn(struct red_sched_data *q) in red_use_ecn() argument
57 return q->flags & TC_RED_ECN; in red_use_ecn()
60 static inline int red_use_harddrop(struct red_sched_data *q) in red_use_harddrop() argument
62 return q->flags & TC_RED_HARDDROP; in red_use_harddrop()
65 static int red_use_nodrop(struct red_sched_data *q) in red_use_nodrop() argument
67 return q->flags & TC_RED_NODROP; in red_use_nodrop()
74 struct red_sched_data *q = qdisc_priv(sch); in red_enqueue() local
75 struct Qdisc *child = q->qdisc; in red_enqueue()
79 q->vars.qavg = red_calc_qavg(&q in red_enqueue()
162 struct red_sched_data *q = qdisc_priv(sch); red_dequeue() local
179 struct red_sched_data *q = qdisc_priv(sch); red_peek() local
187 struct red_sched_data *q = qdisc_priv(sch); red_reset() local
195 struct red_sched_data *q = qdisc_priv(sch); red_offload() local
224 struct red_sched_data *q = qdisc_priv(sch); red_destroy() local
247 struct red_sched_data *q = qdisc_priv(sch); __red_change() local
331 struct red_sched_data *q = timer_container_of(q, t, adapt_timer); red_adaptative_timer() local
347 struct red_sched_data *q = qdisc_priv(sch); red_init() local
381 struct red_sched_data *q = qdisc_priv(sch); red_change() local
420 struct red_sched_data *q = qdisc_priv(sch); red_dump() local
457 struct red_sched_data *q = qdisc_priv(sch); red_dump_stats() local
487 struct red_sched_data *q = qdisc_priv(sch); red_dump_class() local
512 struct red_sched_data *q = qdisc_priv(sch); red_graft() local
525 struct red_sched_data *q = qdisc_priv(sch); red_leaf() local
[all...]
H A Dsch_fq_pie.c75 static unsigned int fq_pie_hash(const struct fq_pie_sched_data *q, in fq_pie_hash() argument
78 return reciprocal_scale(skb_get_hash(skb), q->flows_cnt); in fq_pie_hash()
84 struct fq_pie_sched_data *q = qdisc_priv(sch); in fq_pie_classify() local
91 TC_H_MIN(skb->priority) <= q->flows_cnt) in fq_pie_classify()
94 filter = rcu_dereference_bh(q->filter_list); in fq_pie_classify()
96 return fq_pie_hash(q, skb) + 1; in fq_pie_classify()
112 if (TC_H_MIN(res.classid) <= q->flows_cnt) in fq_pie_classify()
134 struct fq_pie_sched_data *q = qdisc_priv(sch); in fq_pie_qdisc_enqueue() local
152 sel_flow = &q->flows[idx]; in fq_pie_qdisc_enqueue()
155 memory_limited = q->memory_usage > q->memory_limit + skb->truesize; in fq_pie_qdisc_enqueue()
[all …]
H A Dsch_fq.c197 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()
213 static void fq_flow_unset_throttled(struct fq_sched_data *q, struct fq_flow *f) in fq_flow_unset_throttled() argument
215 rb_erase(&f->rate_node, &q->delayed); in fq_flow_unset_throttled()
216 q->throttled_flows--; in fq_flow_unset_throttled()
217 fq_flow_add_tail(q, f, OLD_FLOW); in fq_flow_unset_throttled()
220 static void fq_flow_rb_insert(struct fq_sched_data *q, struct fq_flow *f) in fq_flow_rb_insert() argument
222 struct rb_node **p = &q->delayed.rb_node, *parent = NULL; in fq_flow_rb_insert()
235 rb_insert_color(&f->rate_node, &q->delayed); in fq_flow_rb_insert()
237 if (q->time_next_delayed_flow > f->time_next_packet) in fq_flow_rb_insert()
[all …]
H A Dsch_hhf.c182 struct hhf_sched_data *q) in seek_list() argument
191 u32 prev = flow->hit_timestamp + q->hhf_evict_timeout; in seek_list()
201 WRITE_ONCE(q->hh_flows_current_cnt, in seek_list()
202 q->hh_flows_current_cnt - 1); in seek_list()
214 struct hhf_sched_data *q) in alloc_new_hh() argument
222 u32 prev = flow->hit_timestamp + q->hhf_evict_timeout; in alloc_new_hh()
229 if (q->hh_flows_current_cnt >= q->hh_flows_limit) { in alloc_new_hh()
230 WRITE_ONCE(q->hh_flows_overlimit, q->hh_flows_overlimit + 1); in alloc_new_hh()
238 WRITE_ONCE(q->hh_flows_current_cnt, q->hh_flows_current_cnt + 1); in alloc_new_hh()
250 struct hhf_sched_data *q = qdisc_priv(sch); in hhf_classify() local
[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()
72 struct skbprio_sched_data *q = qdisc_priv(sch); in skbprio_enqueue() local
81 qdisc = &q in skbprio_enqueue()
141 struct skbprio_sched_data *q = qdisc_priv(sch); skbprio_dequeue() local
181 struct skbprio_sched_data *q = qdisc_priv(sch); skbprio_init() local
212 struct skbprio_sched_data *q = qdisc_priv(sch); skbprio_reset() local
225 struct skbprio_sched_data *q = qdisc_priv(sch); skbprio_destroy() local
252 struct skbprio_sched_data *q = qdisc_priv(sch); skbprio_dump_class_stats() local
[all...]
H A Dsch_cbs.c108 struct cbs_sched_data *q = qdisc_priv(sch); in cbs_enqueue_offload() local
109 struct Qdisc *qdisc = q->qdisc; in cbs_enqueue_offload()
117 struct cbs_sched_data *q = qdisc_priv(sch); in cbs_enqueue_soft() local
118 struct Qdisc *qdisc = q->qdisc; in cbs_enqueue_soft()
120 if (sch->q.qlen == 0 && q->credits > 0) { in cbs_enqueue_soft()
122 * no enqueued packets and q->credits is positive. in cbs_enqueue_soft()
124 q->credits = 0; in cbs_enqueue_soft()
125 q->last = ktime_get_ns(); in cbs_enqueue_soft()
134 struct cbs_sched_data *q in cbs_enqueue() local
178 struct cbs_sched_data *q = qdisc_priv(sch); cbs_dequeue_soft() local
233 struct cbs_sched_data *q = qdisc_priv(sch); cbs_dequeue_offload() local
241 struct cbs_sched_data *q = qdisc_priv(sch); cbs_dequeue() local
248 struct cbs_sched_data *q = qdisc_priv(sch); cbs_reset() local
265 cbs_disable_offload(struct net_device * dev,struct cbs_sched_data * q) cbs_disable_offload() argument
290 cbs_enable_offload(struct net_device * dev,struct cbs_sched_data * q,const struct tc_cbs_qopt * opt,struct netlink_ext_ack * extack) cbs_enable_offload() argument
323 cbs_set_port_rate(struct net_device * dev,struct cbs_sched_data * q) cbs_set_port_rate() argument
350 struct cbs_sched_data *q; cbs_dev_notifier() local
378 struct cbs_sched_data *q = qdisc_priv(sch); cbs_change() local
418 struct cbs_sched_data *q = qdisc_priv(sch); cbs_init() local
449 struct cbs_sched_data *q = qdisc_priv(sch); cbs_destroy() local
468 struct cbs_sched_data *q = qdisc_priv(sch); cbs_dump() local
495 struct cbs_sched_data *q = qdisc_priv(sch); cbs_dump_class() local
509 struct cbs_sched_data *q = qdisc_priv(sch); cbs_graft() local
524 struct cbs_sched_data *q = qdisc_priv(sch); cbs_leaf() local
[all...]
H A Dsch_fq_codel.c70 static unsigned int fq_codel_hash(const struct fq_codel_sched_data *q, in fq_codel_hash() argument
73 return reciprocal_scale(skb_get_hash(skb), q->flows_cnt); in fq_codel_hash()
79 struct fq_codel_sched_data *q = qdisc_priv(sch); in fq_codel_classify() local
86 TC_H_MIN(skb->priority) <= q->flows_cnt) in fq_codel_classify()
89 filter = rcu_dereference_bh(q->filter_list); in fq_codel_classify()
91 return fq_codel_hash(q, skb) + 1; in fq_codel_classify()
107 if (TC_H_MIN(res.classid) <= q->flows_cnt) in fq_codel_classify()
140 struct fq_codel_sched_data *q = qdisc_priv(sch); in fq_codel_drop() local
154 for (i = 0; i < q->flows_cnt; i++) { in fq_codel_drop()
155 if (q->backlogs[i] > maxbacklog) { in fq_codel_drop()
[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()
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()
79 return q; in queue_list_remove()
[all …]
/linux/drivers/gpu/drm/xe/
H A Dxe_guc_submit.c55 exec_queue_to_guc(struct xe_exec_queue *q) in exec_queue_to_guc() argument
57 return &q->gt->uc.guc; in exec_queue_to_guc()
77 static bool exec_queue_registered(struct xe_exec_queue *q) in exec_queue_registered() argument
79 return atomic_read(&q->guc->state) & EXEC_QUEUE_STATE_REGISTERED; in exec_queue_registered()
82 static void set_exec_queue_registered(struct xe_exec_queue *q) in set_exec_queue_registered() argument
84 atomic_or(EXEC_QUEUE_STATE_REGISTERED, &q->guc->state); in set_exec_queue_registered()
87 static void clear_exec_queue_registered(struct xe_exec_queue *q) in clear_exec_queue_registered() argument
89 atomic_and(~EXEC_QUEUE_STATE_REGISTERED, &q->guc->state); in clear_exec_queue_registered()
92 static bool exec_queue_enabled(struct xe_exec_queue *q) in exec_queue_enabled() argument
94 return atomic_read(&q->guc->state) & EXEC_QUEUE_STATE_ENABLED; in exec_queue_enabled()
[all …]
/linux/drivers/net/ethernet/fungible/funeth/
H A Dfuneth_tx.c56 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
132 FUN_QSTAT_INC(q, tx_tls_fallback); in fun_tls_tx()
[all …]
/linux/net/xdp/
H A Dxsk_queue.h136 static inline void __xskq_cons_read_addr_unchecked(struct xsk_queue *q, u32 cached_cons, u64 *addr) in __xskq_cons_read_addr_unchecked() argument
138 struct xdp_umem_ring *ring = (struct xdp_umem_ring *)q->ring; in __xskq_cons_read_addr_unchecked()
139 u32 idx = cached_cons & q->ring_mask; in __xskq_cons_read_addr_unchecked()
144 static inline bool xskq_cons_read_addr_unchecked(struct xsk_queue *q, u64 *addr) in xskq_cons_read_addr_unchecked() argument
146 if (q->cached_cons != q->cached_prod) { in xskq_cons_read_addr_unchecked()
147 __xskq_cons_read_addr_unchecked(q, q->cached_cons, addr); in xskq_cons_read_addr_unchecked()
233 static inline bool xskq_has_descs(struct xsk_queue *q) in xskq_has_descs() argument
235 return q->cached_cons != q->cached_prod; in xskq_has_descs()
238 static inline bool xskq_cons_is_valid_desc(struct xsk_queue *q, in xskq_cons_is_valid_desc() argument
243 q->invalid_descs++; in xskq_cons_is_valid_desc()
[all …]
/linux/drivers/spi/
H A Dspi-fsl-qspi.c296 static bool needs_swap_endian(struct fsl_qspi *q) in needs_swap_endian() argument
298 return !!(q->devtype_data->quirks & QUADSPI_QUIRK_SWAP_ENDIAN); in needs_swap_endian()
301 static bool needs_4x_clock(struct fsl_qspi *q) in needs_4x_clock() argument
303 return !!(q->devtype_data->quirks & QUADSPI_QUIRK_4X_INT_CLK); in needs_4x_clock()
306 static bool needs_fill_txfifo(struct fsl_qspi *q) in needs_fill_txfifo() argument
308 return !!(q->devtype_data->quirks & QUADSPI_QUIRK_TKT253890); in needs_fill_txfifo()
311 static bool needs_wakeup_wait_mode(struct fsl_qspi *q) in needs_wakeup_wait_mode() argument
313 return !!(q->devtype_data->quirks & QUADSPI_QUIRK_TKT245618); in needs_wakeup_wait_mode()
316 static bool needs_amba_base_offset(struct fsl_qspi *q) in needs_amba_base_offset() argument
318 return !(q->devtype_data->quirks & QUADSPI_QUIRK_BASE_INTERNAL); in needs_amba_base_offset()
[all …]
/linux/drivers/net/wireless/mediatek/mt76/
H A Ddma.c159 mt76_dma_queue_magic_cnt_init(struct mt76_dev *dev, struct mt76_queue *q) in mt76_dma_queue_magic_cnt_init() argument
161 if (!mt76_queue_is_wed_rro(q)) in mt76_dma_queue_magic_cnt_init()
164 q->magic_cnt = 0; in mt76_dma_queue_magic_cnt_init()
165 if (mt76_queue_is_wed_rro_ind(q)) { in mt76_dma_queue_magic_cnt_init()
171 rro_desc = (struct mt76_wed_rro_desc *)q->desc; in mt76_dma_queue_magic_cnt_init()
172 for (i = 0; i < q->ndesc; i++) { in mt76_dma_queue_magic_cnt_init()
178 } else if (mt76_queue_is_wed_rro_rxdmad_c(q)) { in mt76_dma_queue_magic_cnt_init()
179 struct mt76_rro_rxdmad_c *dmad = (void *)q->desc; in mt76_dma_queue_magic_cnt_init()
184 for (i = 0; i < q->ndesc; i++) in mt76_dma_queue_magic_cnt_init()
194 mt76_dma_read_dma_idx(struct mt76_queue *q, int fallback) in mt76_dma_read_dma_idx() argument
[all …]
/linux/block/
H A Dblk-pm.c29 void blk_pm_runtime_init(struct request_queue *q, struct device *dev) in blk_pm_runtime_init() argument
31 q->dev = dev; in blk_pm_runtime_init()
32 q->rpm_status = RPM_ACTIVE; in blk_pm_runtime_init()
33 pm_runtime_set_autosuspend_delay(q->dev, -1); in blk_pm_runtime_init()
34 pm_runtime_use_autosuspend(q->dev); in blk_pm_runtime_init()
59 int blk_pre_runtime_suspend(struct request_queue *q) in blk_pre_runtime_suspend() argument
63 if (!q->dev) in blk_pre_runtime_suspend()
66 WARN_ON_ONCE(q->rpm_status != RPM_ACTIVE); in blk_pre_runtime_suspend()
68 spin_lock_irq(&q->queue_lock); in blk_pre_runtime_suspend()
69 q->rpm_status = RPM_SUSPENDING; in blk_pre_runtime_suspend()
[all …]
/linux/drivers/infiniband/sw/rxe/
H A Drxe_queue.h83 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()
120 prod = smp_load_acquire(&q->buf->producer_index); in queue_get_producer()
127 static inline u32 queue_get_consumer(const struct rxe_queue *q, in queue_get_consumer() argument
[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.c169 static inline struct sge_qset *rspq_to_qset(const struct sge_rspq *q) in rspq_to_qset() argument
171 return container_of(q, struct sge_qset, rspq); in rspq_to_qset()
174 static inline struct sge_qset *txq_to_qset(const struct sge_txq *q, int qidx) in txq_to_qset() argument
176 return container_of(q, struct sge_qset, txq[qidx]); in txq_to_qset()
189 const struct sge_rspq *q, unsigned int credits) in refill_rspq() argument
193 V_RSPQ(q->cntxt_id) | V_CREDITS(credits)); in refill_rspq()
233 static inline void unmap_skb(struct sk_buff *skb, struct sge_txq *q, in unmap_skb() argument
237 struct tx_sw_desc *d = &q->sdesc[cidx]; in unmap_skb()
240 sgp = (struct sg_ent *)&q->desc[cidx].flit[d->sflit]; in unmap_skb()
266 d = cidx + 1 == q->size ? q->sdesc : d + 1; in unmap_skb()
[all …]

12345678910>>...39