22  * rules and actions. This can be used to define tables with multiple entries
203  * xe_rtp_process_ctx_enable_active_tracking - Enable tracking of active entries
205  * Set additional metadata to track what entries are considered "active", i.e.
206  * their rules match the condition. Bits are never cleared: entries with
210  * @active_entries: bitmap to store the active entries
211  * @n_entries: number of entries to be processed
236  * xe_rtp_process_to_sr - Process all rtp @entries, adding the matching ones to
239  * @entries: Table with RTP definitions
240  * @n_entries: Number of entries to process, usually ARRAY_SIZE(entries)
243  *      register set are expected not to collide with previously added entries
245  * Walk the table pointed by @entries (with an empty sentinel) and add all
246  * entries with matching rules to @sr. If @hwe is not NULL, its mmio_base is
250 			  const struct xe_rtp_entry_sr *entries,  in xe_rtp_process_to_sr()  argument
264 	xe_assert(xe, entries);  in xe_rtp_process_to_sr()
266 	for (entry = entries; entry - entries < n_entries; entry++) {  in xe_rtp_process_to_sr()
281 			rtp_mark_active(xe, ctx, entry - entries);  in xe_rtp_process_to_sr()
287  * xe_rtp_process - Process all rtp @entries, without running any action
289  * @entries: Table with RTP definitions
291  * Walk the table pointed by @entries (with an empty sentinel), executing the
298 		    const struct xe_rtp_entry *entries)  in xe_rtp_process()  argument
307 	for (entry = entries; entry && entry->rules; entry++) {  in xe_rtp_process()
311 		rtp_mark_active(xe, ctx, entry - entries);  in xe_rtp_process()