Lines Matching defs:ps
101 struct pri_sequence *ps, *ps0;
109 list_for_each_entry_safe(ps, ps0, &pseq_pool, head) {
110 list_del(&ps->head);
112 kfree(ps);
229 struct pri_sequence ps, *new_ps;
244 ps.count = 2;
245 ps.count_falses = 0;
246 ps.first_ts = p->ts;
247 ps.last_ts = ts;
248 ps.pri = GET_PRI_TO_USE(pde->rs->pri_min,
250 ps.dur = ps.pri * (pde->rs->ppb - 1)
255 min_valid_ts = ts - ps.dur;
263 factor = pde_get_multiple(ps.last_ts - p2->ts, ps.pri,
266 ps.count++;
267 ps.first_ts = p2->ts;
272 ps.count_falses += tmp_false_count;
279 if (ps.count <= min_count)
284 ps.deadline_ts = ps.first_ts + ps.dur;
295 memcpy(new_ps, &ps, sizeof(ps));
307 struct pri_sequence *ps, *ps2;
308 list_for_each_entry_safe(ps, ps2, &pde->sequences, head) {
313 if (ts > ps->deadline_ts) {
314 list_del_init(&ps->head);
315 pool_put_pseq_elem(ps);
319 delta_ts = ts - ps->last_ts;
320 factor = pde_get_multiple(delta_ts, ps->pri,
323 ps->last_ts = ts;
324 ps->count++;
326 if (max_count < ps->count)
327 max_count = ps->count;
329 ps->count_falses++;
338 struct pri_sequence *ps;
343 list_for_each_entry(ps, &pde->sequences, head) {
349 if ((ps->count >= pde->rs->ppb_thresh) &&
350 (ps->count * pde->rs->num_pri >= ps->count_falses))
351 return ps;
360 struct pri_sequence *ps, *ps0;
362 list_for_each_entry_safe(ps, ps0, &pde->sequences, head) {
363 list_del_init(&ps->head);
364 pool_put_pseq_elem(ps);
385 struct pri_sequence *ps;
409 ps = pseq_handler_check_detection(de);
411 if (ps == NULL)
414 return ps;