Lines Matching defs:qe
82 struct sched_queue_entry *qe;
84 qe = (struct sched_queue_entry *)arg;
92 fw_class = bind ? qe->param.class : FW_SCHED_CLS_NONE;
93 fw_param = (fw_mnem | FW_PARAMS_PARAM_YZ_V(qe->cntxt_id));
137 struct sched_queue_entry *qe;
139 list_for_each_entry(qe, &e->entry_list, list) {
140 if (qe->cntxt_id == val) {
141 found = qe;
173 struct sched_queue_entry *qe = NULL;
181 qe = t4_sched_entry_lookup(pi, SCHED_QUEUE, txq->q.cntxt_id);
182 return qe ? &pi->sched_tbl->tab[qe->param.class] : NULL;
187 struct sched_queue_entry *qe = NULL;
199 qe = t4_sched_entry_lookup(pi, SCHED_QUEUE, txq->q.cntxt_id);
200 if (qe) {
201 err = t4_sched_bind_unbind_op(pi, (void *)qe, SCHED_QUEUE,
206 e = &pi->sched_tbl->tab[qe->param.class];
207 list_del(&qe->list);
208 kvfree(qe);
218 struct sched_queue_entry *qe = NULL;
228 qe = kvzalloc(sizeof(struct sched_queue_entry), GFP_KERNEL);
229 if (!qe)
241 qe->cntxt_id = qid;
242 memcpy(&qe->param, p, sizeof(qe->param));
244 e = &s->tab[qe->param.class];
245 err = t4_sched_bind_unbind_op(pi, (void *)qe, SCHED_QUEUE, true);
249 list_add_tail(&qe->list, &e->entry_list);
255 kvfree(qe);
333 struct sched_queue_entry *qe;
335 list_for_each_entry(qe, &e->entry_list, list)
336 t4_sched_queue_unbind(pi, &qe->param);
361 struct ch_sched_queue *qe = (struct ch_sched_queue *)arg;
364 err = t4_sched_queue_bind(pi, qe);
366 err = t4_sched_queue_unbind(pi, qe);
410 struct ch_sched_queue *qe = (struct ch_sched_queue *)arg;
412 class_id = qe->class;
457 struct ch_sched_queue *qe = (struct ch_sched_queue *)arg;
459 class_id = qe->class;