1/*
2 * SPDX-License-Identifier: MIT
3 *
4 * Copyright © 2018 Intel Corporation
5 */
6
7#ifndef _I915_SCHEDULER_H_
8#define _I915_SCHEDULER_H_
9
10#include <linux/bitops.h>
11#include <linux/list.h>
12#include <linux/kernel.h>
13
14#include "i915_scheduler_types.h"
15
16#define priolist_for_each_request(it, plist, idx) \
17	for (idx = 0; idx < ARRAY_SIZE((plist)->requests); idx++) \
18		list_for_each_entry(it, &(plist)->requests[idx], sched.link)
19
20#define priolist_for_each_request_consume(it, n, plist, idx) \
21	for (; \
22	     (plist)->used ? (idx = __ffs((plist)->used)), 1 : 0; \
23	     (plist)->used &= ~BIT(idx)) \
24		list_for_each_entry_safe(it, n, \
25					 &(plist)->requests[idx], \
26					 sched.link)
27
28void i915_sched_node_init(struct i915_sched_node *node);
29void i915_sched_node_reinit(struct i915_sched_node *node);
30
31bool __i915_sched_node_add_dependency(struct i915_sched_node *node,
32				      struct i915_sched_node *signal,
33				      struct i915_dependency *dep,
34				      unsigned long flags);
35
36int i915_sched_node_add_dependency(struct i915_sched_node *node,
37				   struct i915_sched_node *signal,
38				   unsigned long flags);
39
40void i915_sched_node_fini(struct i915_sched_node *node);
41
42void i915_schedule(struct i915_request *request,
43		   const struct i915_sched_attr *attr);
44
45void i915_schedule_bump_priority(struct i915_request *rq, unsigned int bump);
46
47struct list_head *
48i915_sched_lookup_priolist(struct intel_engine_cs *engine, int prio);
49
50void __i915_priolist_free(struct i915_priolist *p);
51static inline void i915_priolist_free(struct i915_priolist *p)
52{
53	if (p->priority != I915_PRIORITY_NORMAL)
54		__i915_priolist_free(p);
55}
56
57#endif /* _I915_SCHEDULER_H_ */
58