22  * rules and actions. This can be used to define tables with multiple entries
24  * the values to the registers that have matching rules.
35 			 const struct xe_rtp_rule *rules,  in rule_matches()  argument
42 	for (r = rules, i = 0; i < n_rules; r = &rules[++i]) {  in rule_matches()
47 			 * rules passed or none were evaluated. For both cases,  in rule_matches()
48 			 * shortcut the other rules and return the proper value.  in rule_matches()
121 			 * Advance rules until we find XE_RTP_MATCH_OR to check  in rule_matches()
124 			while (++i < n_rules && rules[i].match_type != XE_RTP_MATCH_OR)  in rule_matches()
167 	if (!rule_matches(xe, gt, hwe, entry->rules, entry->n_rules))  in rtp_process_one_sr()
206  * their rules match the condition. Bits are never cleared: entries with
207  * matching rules set the corresponding bit in the bitmap.
240  * @sr: Save-restore struct where matching rules execute the action. This can be
245  * entries with matching rules to @sr. If @hwe is not NULL, its mmio_base is
288  * rules. One difference from xe_rtp_process_to_sr(): there is no action
303 	for (entry = entries; entry && entry->rules; entry++) {  in xe_rtp_process()
304 		if (!rule_matches(xe, gt, hwe, entry->rules, entry->n_rules))  in xe_rtp_process()