Home
last modified time | relevance | path

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

12345678910>>...45

/Linux-v5.10/drivers/media/v4l2-core/
Dvideobuf-core.c50 #define CALL(q, f, arg...) \ argument
51 ((q->int_ops->f) ? q->int_ops->f(arg) : 0)
52 #define CALLPTR(q, f, arg...) \ argument
53 ((q->int_ops->f) ? q->int_ops->f(arg) : NULL)
55 struct videobuf_buffer *videobuf_alloc_vb(struct videobuf_queue *q) in videobuf_alloc_vb() argument
59 BUG_ON(q->msize < sizeof(*vb)); in videobuf_alloc_vb()
61 if (!q->int_ops || !q->int_ops->alloc_vb) { in videobuf_alloc_vb()
66 vb = q->int_ops->alloc_vb(q->msize); in videobuf_alloc_vb()
76 static int state_neither_active_nor_queued(struct videobuf_queue *q, in state_neither_active_nor_queued() argument
82 spin_lock_irqsave(q->irqlock, flags); in state_neither_active_nor_queued()
[all …]
/Linux-v5.10/crypto/
Dgf128mul.c25 1. distributions of this source code include the above copyright
56 #define gf128mul_dat(q) { \ argument
57 q(0x00), q(0x01), q(0x02), q(0x03), q(0x04), q(0x05), q(0x06), q(0x07),\
58 q(0x08), q(0x09), q(0x0a), q(0x0b), q(0x0c), q(0x0d), q(0x0e), q(0x0f),\
59 q(0x10), q(0x11), q(0x12), q(0x13), q(0x14), q(0x15), q(0x16), q(0x17),\
60 q(0x18), q(0x19), q(0x1a), q(0x1b), q(0x1c), q(0x1d), q(0x1e), q(0x1f),\
61 q(0x20), q(0x21), q(0x22), q(0x23), q(0x24), q(0x25), q(0x26), q(0x27),\
62 q(0x28), q(0x29), q(0x2a), q(0x2b), q(0x2c), q(0x2d), q(0x2e), q(0x2f),\
63 q(0x30), q(0x31), q(0x32), q(0x33), q(0x34), q(0x35), q(0x36), q(0x37),\
64 q(0x38), q(0x39), q(0x3a), q(0x3b), q(0x3c), q(0x3d), q(0x3e), q(0x3f),\
[all …]
/Linux-v5.10/net/sched/
Dsch_choke.c46 #define CHOKE_MAX_QUEUE (128*1024 - 1)
70 unsigned int tab_mask; /* size - 1 */
76 static unsigned int choke_len(const struct choke_sched_data *q) in choke_len() argument
78 return (q->tail - q->head) & q->tab_mask; in choke_len()
82 static int use_ecn(const struct choke_sched_data *q) in use_ecn() argument
84 return q->flags & TC_RED_ECN; in use_ecn()
88 static int use_harddrop(const struct choke_sched_data *q) in use_harddrop() argument
90 return q->flags & TC_RED_HARDDROP; in use_harddrop()
94 static void choke_zap_head_holes(struct choke_sched_data *q) in choke_zap_head_holes() argument
97 q->head = (q->head + 1) & q->tab_mask; in choke_zap_head_holes()
[all …]
Dsch_sfb.c34 #define SFB_NUMBUCKETS (1 << SFB_BUCKET_SHIFT) /* N bins per Level */
35 #define SFB_BUCKET_MASK (SFB_NUMBUCKETS - 1)
69 u8 slot; /* current active bins (0 or 1) */
123 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 sk_buff *skb, struct sfb_sched_data *q) in increment_qlen() argument
144 increment_one_qlen(sfbhash, 0, q); in increment_qlen()
146 sfbhash = sfb_hash(skb, 1); in increment_qlen()
148 increment_one_qlen(sfbhash, 1, q); in increment_qlen()
152 struct sfb_sched_data *q) in decrement_one_qlen() argument
[all …]
Dsch_sfq.c68 - max mtu to 2^18-1;
76 #define SFQ_MAX_FLOWS (0x10000 - SFQ_MAX_DEPTH - 1) /* max number of flows */
81 * Scale allot by 8 (1<<3) so that no overflow occurs.
84 #define SFQ_ALLOT_SIZE(X) DIV_ROUND_UP(X, 1 << SFQ_ALLOT_SHIFT)
86 /* This type should contain at least SFQ_MAX_DEPTH + 1 + SFQ_MAX_FLOWS values */
91 * Small indexes [0 ... SFQ_MAX_FLOWS - 1] are 'pointers' to slots[] array
133 struct sfq_head dep[SFQ_MAX_DEPTH + 1];
136 * dep[1] : list of flows with 1 packet
150 static inline struct sfq_head *sfq_dep_head(struct sfq_sched_data *q, sfq_index val) in sfq_dep_head() argument
153 return &q->slots[val].dep; in sfq_dep_head()
[all …]
Dsch_netem.c33 Sources: [1] Mark Carson, Darrin Santay, "NIST Net - A Linux-based
58 [1] NetemCLG Home http://netgroup.uniroma2.it/NetemCLG
61 in the Netem module in the Linux kernel", available in [1]
116 TX_IN_GAP_PERIOD = 1,
123 GOOD_STATE = 1,
136 u32 a4; /* p14 for 4-states or 1-k for GE */
190 rho = (u64)state->rho + 1; in get_crandom()
191 answer = (value * ((1ull<<32) - rho) + state->last * rho) >> 32; in get_crandom()
200 static bool loss_4state(struct netem_sched_data *q) in loss_4state() argument
202 struct clgstate *clg = &q->clg; in loss_4state()
[all …]
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 …]
Dsch_cake.c100 * @rec_inv_sqrt: reciprocal value of sqrt(count) >> 1
260 CAKE_FLAG_AUTORATE_INGRESS = BIT(1),
299 static u16 quantum_div[CAKE_QUEUES + 1] = {0};
305 1, 1, 1, 1, 1, 1, 1, 1,
315 2, 0, 1, 2, 4, 2, 2, 2,
316 1, 2, 1, 2, 1, 2, 1, 2,
326 0, 1, 0, 0, 2, 0, 0, 0,
327 1, 0, 0, 0, 0, 0, 0, 0,
337 0, 1, 0, 0, 2, 0, 0, 0,
338 1, 0, 0, 0, 0, 0, 0, 0,
[all …]
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->curband >= q->bands) in multiq_dequeue()
[all …]
Dsch_cbq.c23 Sources: [1] Sally Floyd and Van Jacobson, "Link-sharing and Resource
48 allotment is W*r_i, and r_1+...+r_k = r < 1
103 struct Qdisc *q; /* Elementary queueing discipline */ member
111 level of children + 1 for nodes.
129 struct cbq_class *defaults[TC_PRIO_MAX + 1];
134 int nclasses[TC_CBQ_MAXPRIO + 1];
135 unsigned int quanta[TC_CBQ_MAXPRIO + 1];
140 struct cbq_class *active[TC_CBQ_MAXPRIO + 1]; /* List of all classes
166 cbq_class_lookup(struct cbq_sched_data *q, u32 classid) in cbq_class_lookup() argument
170 clc = qdisc_class_find(&q->clhash, classid); in cbq_class_lookup()
[all …]
Dsch_fq.c65 * If packets have monotically increasing time_to_send, they are placed in O(1)
74 unsigned long age; /* (jiffies | 1UL) when flow was emptied, for gc */
87 struct rb_node rate_node; /* anchor in q->delayed tree */
146 f->age = jiffies | 1UL; in fq_flow_set_detached()
151 return !!(f->age & 1UL); in fq_flow_is_detached()
172 static void fq_flow_unset_throttled(struct fq_sched_data *q, struct fq_flow *f) in fq_flow_unset_throttled() argument
174 rb_erase(&f->rate_node, &q->delayed); in fq_flow_unset_throttled()
175 q->throttled_flows--; in fq_flow_unset_throttled()
176 fq_flow_add_tail(&q->old_flows, f); in fq_flow_unset_throttled()
179 static void fq_flow_set_throttled(struct fq_sched_data *q, struct fq_flow *f) in fq_flow_set_throttled() argument
[all …]
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 …]
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)
190 struct qfq_group groups[QFQ_MAX_INDEX + 1]; /* The groups. */
208 struct qfq_sched *q = qdisc_priv(sch); in qfq_find_class() local
211 clc = qdisc_class_find(&q->clhash, classid); in qfq_find_class()
[all …]
/Linux-v5.10/drivers/media/common/videobuf2/
Dvideobuf2-core.c37 #define dprintk(q, level, fmt, arg...) \ argument
40 pr_info("[%s] %s: " fmt, (q)->name, __func__, \
93 #define log_qop(q, op) \ argument
94 dprintk(q, 2, "call_qop(%s)%s\n", #op, \
95 (q)->ops->op ? "" : " (nop)")
97 #define call_qop(q, op, args...) \ argument
101 log_qop(q, op); \
102 err = (q)->ops->op ? (q)->ops->op(args) : 0; \
104 (q)->cnt_ ## op++; \
108 #define call_void_qop(q, op, args...) \ argument
[all …]
/Linux-v5.10/drivers/net/wireless/mediatek/mt76/
Ddma.c81 mt76_dma_alloc_queue(struct mt76_dev *dev, struct mt76_queue *q, in mt76_dma_alloc_queue() argument
88 spin_lock_init(&q->lock); in mt76_dma_alloc_queue()
90 q->regs = dev->mmio.regs + ring_base + idx * MT_RING_SIZE; in mt76_dma_alloc_queue()
91 q->ndesc = n_desc; in mt76_dma_alloc_queue()
92 q->buf_size = bufsize; in mt76_dma_alloc_queue()
93 q->hw_idx = idx; in mt76_dma_alloc_queue()
95 size = q->ndesc * sizeof(struct mt76_desc); in mt76_dma_alloc_queue()
96 q->desc = dmam_alloc_coherent(dev->dev, size, &q->desc_dma, GFP_KERNEL); in mt76_dma_alloc_queue()
97 if (!q->desc) in mt76_dma_alloc_queue()
100 size = q->ndesc * sizeof(*q->entry); in mt76_dma_alloc_queue()
[all …]
/Linux-v5.10/drivers/net/wireless/broadcom/b43/
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-v5.10/sound/core/seq/oss/
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-v5.10/drivers/s390/cio/
Dqdio_main.c38 register unsigned long __schid asm ("1") = schid; in do_siga_sync()
56 register unsigned long __schid asm ("1") = schid; in do_siga_input()
85 register unsigned long __schid asm("1") = schid; in do_siga_output()
103 * @q: queue to manipulate
112 static int qdio_do_eqbs(struct qdio_q *q, unsigned char *state, in qdio_do_eqbs() argument
115 int tmp_count = count, tmp_start = start, nr = q->nr; in qdio_do_eqbs()
118 qperf_inc(q, eqbs); in qdio_do_eqbs()
120 if (!q->is_input_q) in qdio_do_eqbs()
121 nr += q->irq_ptr->nr_input_qs; in qdio_do_eqbs()
123 ccq = do_eqbs(q->irq_ptr->sch_token, state, nr, &tmp_start, &tmp_count, in qdio_do_eqbs()
[all …]
/Linux-v5.10/drivers/net/ethernet/chelsio/cxgb3/
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 */
139 dma_addr_t addr[MAX_SKB_FRAGS + 1];
146 * desc = 1 + (flits - 2) / (WR_FLITS - 1).
152 #if SGE_NUM_GENBITS == 1
153 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
158 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
163 # error "SGE_NUM_GENBITS must be 1 or 2"
167 static inline struct sge_qset *fl_to_qset(const struct sge_fl *q, int qidx) in fl_to_qset() argument
[all …]
/Linux-v5.10/block/
Dblk-sysfs.c61 static ssize_t queue_requests_show(struct request_queue *q, char *page) in queue_requests_show() argument
63 return queue_var_show(q->nr_requests, (page)); in queue_requests_show()
67 queue_requests_store(struct request_queue *q, const char *page, size_t count) in queue_requests_store() argument
72 if (!queue_is_mq(q)) in queue_requests_store()
82 err = blk_mq_update_nr_requests(q, nr); in queue_requests_store()
89 static ssize_t queue_ra_show(struct request_queue *q, char *page) in queue_ra_show() argument
91 unsigned long ra_kb = q->backing_dev_info->ra_pages << in queue_ra_show()
98 queue_ra_store(struct request_queue *q, const char *page, size_t count) in queue_ra_store() argument
106 q->backing_dev_info->ra_pages = ra_kb >> (PAGE_SHIFT - 10); in queue_ra_store()
111 static ssize_t queue_max_sectors_show(struct request_queue *q, char *page) in queue_max_sectors_show() argument
[all …]
Dblk-settings.c25 void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout) in blk_queue_rq_timeout() argument
27 q->rq_timeout = timeout; in blk_queue_rq_timeout()
41 lim->max_discard_segments = 1; in blk_set_default_limits()
93 * @q: the request queue for the device
102 void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr) in blk_queue_bounce_limit() argument
107 q->bounce_gfp = GFP_NOIO; in blk_queue_bounce_limit()
115 dma = 1; in blk_queue_bounce_limit()
116 q->limits.bounce_pfn = max(max_low_pfn, b_pfn); in blk_queue_bounce_limit()
119 dma = 1; in blk_queue_bounce_limit()
120 q->limits.bounce_pfn = b_pfn; in blk_queue_bounce_limit()
[all …]
/Linux-v5.10/sound/core/seq/
Dseq_queue.c50 static int queue_list_add(struct snd_seq_queue *q) in queue_list_add() argument
58 queue_list[i] = q; in queue_list_add()
59 q->queue = i; in queue_list_add()
66 return -1; in queue_list_add()
71 struct snd_seq_queue *q; in queue_list_remove() local
75 q = queue_list[id]; in queue_list_remove()
76 if (q) { in queue_list_remove()
77 spin_lock(&q->owner_lock); in queue_list_remove()
78 if (q->owner == client) { in queue_list_remove()
80 q->klocked = 1; in queue_list_remove()
[all …]
/Linux-v5.10/drivers/spi/
Dspi-fsl-qspi.c60 #define QUADSPI_MCR_SWRSTHD_MASK BIT(1)
102 #define QUADSPI_SR_IP_ACC_MASK BIT(1)
126 #define QUADSPI_LCKER_UNLOCK BIT(1)
135 #define LUT_CMD 1
159 #define LUT_PAD(x) (fls(x) - 1)
176 #define QUADSPI_QUIRK_4X_INT_CLK BIT(1)
278 static inline int needs_swap_endian(struct fsl_qspi *q) in needs_swap_endian() argument
280 return q->devtype_data->quirks & QUADSPI_QUIRK_SWAP_ENDIAN; in needs_swap_endian()
283 static inline int needs_4x_clock(struct fsl_qspi *q) in needs_4x_clock() argument
285 return q->devtype_data->quirks & QUADSPI_QUIRK_4X_INT_CLK; in needs_4x_clock()
[all …]
/Linux-v5.10/drivers/gpu/drm/amd/amdkfd/
Dkfd_mqd_manager_vi.c48 struct queue_properties *q) in update_cu_mask() argument
53 if (q->cu_mask_count == 0) in update_cu_mask()
57 q->cu_mask, q->cu_mask_count, se_mask); in update_cu_mask()
61 m->compute_static_thread_mgmt_se1 = se_mask[1]; in update_cu_mask()
72 static void set_priority(struct vi_mqd *m, struct queue_properties *q) in set_priority() argument
74 m->cp_hqd_pipe_priority = pipe_priority_map[q->priority]; in set_priority()
75 m->cp_hqd_queue_priority = q->priority; in set_priority()
79 struct queue_properties *q) in allocate_mqd() argument
92 struct queue_properties *q) in init_mqd() argument
103 m->compute_pipelinestat_enable = 1; in init_mqd()
[all …]
/Linux-v5.10/drivers/misc/habanalabs/common/
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_int_hw_queue_update_ci() local
50 q = &hdev->kernel_queues[0]; in hl_int_hw_queue_update_ci()
51 for (i = 0 ; i < hdev->asic_prop.max_queues ; i++, q++) { in hl_int_hw_queue_update_ci()
52 if (q->queue_type == QUEUE_TYPE_INT) in hl_int_hw_queue_update_ci()
53 atomic_add(cs->jobs_in_queue_cnt[i], &q->ci); in hl_int_hw_queue_update_ci()
61 * @q: pointer to habanalabs queue structure
[all …]

12345678910>>...45