102 		struct pri_sequence *ps, *ps0;  in pool_deregister_ref()  local
110 		list_for_each_entry_safe(ps, ps0, &pseq_pool, head) {  in pool_deregister_ref()
111 			list_del(&ps->head);  in pool_deregister_ref()
113 			kfree(ps);  in pool_deregister_ref()
230 		struct pri_sequence ps, *new_ps;  in pseq_handler_create_sequences()  local
245 		ps.count = 2;  in pseq_handler_create_sequences()
246 		ps.count_falses = 0;  in pseq_handler_create_sequences()
247 		ps.first_ts = p->ts;  in pseq_handler_create_sequences()
248 		ps.last_ts = ts;  in pseq_handler_create_sequences()
249 		ps.pri = GET_PRI_TO_USE(pde->rs->pri_min,  in pseq_handler_create_sequences()
251 		ps.dur = ps.pri * (pde->rs->ppb - 1)  in pseq_handler_create_sequences()
256 		min_valid_ts = ts - ps.dur;  in pseq_handler_create_sequences()
264 			factor = pde_get_multiple(ps.last_ts - p2->ts, ps.pri,  in pseq_handler_create_sequences()
267 				ps.count++;  in pseq_handler_create_sequences()
268 				ps.first_ts = p2->ts;  in pseq_handler_create_sequences()
273 				ps.count_falses += tmp_false_count;  in pseq_handler_create_sequences()
280 		if (ps.count <= min_count)  in pseq_handler_create_sequences()
285 		ps.deadline_ts = ps.first_ts + ps.dur;  in pseq_handler_create_sequences()
296 		memcpy(new_ps, &ps, sizeof(ps));  in pseq_handler_create_sequences()
308 	struct pri_sequence *ps, *ps2;  in pseq_handler_add_to_existing_seqs()  local
309 	list_for_each_entry_safe(ps, ps2, &pde->sequences, head) {  in pseq_handler_add_to_existing_seqs()
314 		if (ts > ps->deadline_ts) {  in pseq_handler_add_to_existing_seqs()
315 			list_del_init(&ps->head);  in pseq_handler_add_to_existing_seqs()
316 			pool_put_pseq_elem(ps);  in pseq_handler_add_to_existing_seqs()
320 		delta_ts = ts - ps->last_ts;  in pseq_handler_add_to_existing_seqs()
321 		factor = pde_get_multiple(delta_ts, ps->pri,  in pseq_handler_add_to_existing_seqs()
324 			ps->last_ts = ts;  in pseq_handler_add_to_existing_seqs()
325 			ps->count++;  in pseq_handler_add_to_existing_seqs()
327 			if (max_count < ps->count)  in pseq_handler_add_to_existing_seqs()
328 				max_count = ps->count;  in pseq_handler_add_to_existing_seqs()
330 			ps->count_falses++;  in pseq_handler_add_to_existing_seqs()
339 	struct pri_sequence *ps;  in pseq_handler_check_detection()  local
344 	list_for_each_entry(ps, &pde->sequences, head) {  in pseq_handler_check_detection()
350 		if ((ps->count >= pde->rs->ppb_thresh) &&  in pseq_handler_check_detection()
351 		    (ps->count * pde->rs->num_pri >= ps->count_falses))  in pseq_handler_check_detection()
352 			return ps;  in pseq_handler_check_detection()
361 	struct pri_sequence *ps, *ps0;  in pri_detector_reset()  local
363 	list_for_each_entry_safe(ps, ps0, &pde->sequences, head) {  in pri_detector_reset()
364 		list_del_init(&ps->head);  in pri_detector_reset()
365 		pool_put_pseq_elem(ps);  in pri_detector_reset()
386 	struct pri_sequence *ps;  in pri_detector_add_pulse()  local
410 	ps = pseq_handler_check_detection(de);  in pri_detector_add_pulse()
412 	if (ps == NULL)  in pri_detector_add_pulse()
415 	return ps;  in pri_detector_add_pulse()