21  * rules and actions. This can be used to define tables with multiple entries
172  * xe_rtp_process_ctx_enable_active_tracking - Enable tracking of active entries
174  * Set additional metadata to track what entries are considered "active", i.e.
175  * their rules match the condition. Bits are never cleared: entries with
179  * @active_entries: bitmap to store the active entries
180  * @n_entries: number of entries to be processed
207  * xe_rtp_process_to_sr - Process all rtp @entries, adding the matching ones to
210  * @entries: Table with RTP definitions
213  *      register set are expected not to collide with previously added entries
215  * Walk the table pointed by @entries (with an empty sentinel) and add all
216  * entries with matching rules to @sr. If @hwe is not NULL, its mmio_base is
220 			  const struct xe_rtp_entry_sr *entries,  in xe_rtp_process_to_sr()  argument
230 	for (entry = entries; entry && entry->name; entry++) {  in xe_rtp_process_to_sr()
245 			rtp_mark_active(xe, ctx, entry - entries,  in xe_rtp_process_to_sr()
246 					entry - entries);  in xe_rtp_process_to_sr()
252  * xe_rtp_process - Process all rtp @entries, without running any action
254  * @entries: Table with RTP definitions
256  * Walk the table pointed by @entries (with an empty sentinel), executing the
262  * 2. There is support for OR operations by having entries with no name.
265 		    const struct xe_rtp_entry *entries)  in xe_rtp_process()  argument
274 	first_entry = entries;  in xe_rtp_process()
278 	for (entry = entries; entry && entry->rules; entry++) {  in xe_rtp_process()
285 		/* Fast-forward entry, eliminating the OR'ed entries */  in xe_rtp_process()
291 		rtp_mark_active(xe, ctx, first_entry - entries,  in xe_rtp_process()
292 				entry - entries);  in xe_rtp_process()