/* * SPDX-License-Identifier: MIT * * Copyright © 2018 Intel Corporation */ #ifndef _I915_SCHEDULER_H_ #define _I915_SCHEDULER_H_ #include <linux/bitops.h> #include <linux/list.h> #include <linux/kernel.h> #include "i915_scheduler_types.h" struct drm_printer; #define priolist_for_each_request(it, plist) \ list_for_each_entry(it, &(plist)->requests, sched.link) #define priolist_for_each_request_consume(it, n, plist) \ list_for_each_entry_safe(it, n, &(plist)->requests, sched.link) void i915_sched_node_init(struct i915_sched_node *node); void i915_sched_node_reinit(struct i915_sched_node *node); bool __i915_sched_node_add_dependency(struct i915_sched_node *node, struct i915_sched_node *signal, struct i915_dependency *dep, unsigned long flags); int i915_sched_node_add_dependency(struct i915_sched_node *node, struct i915_sched_node *signal, unsigned long flags); void i915_sched_node_fini(struct i915_sched_node *node); void i915_schedule(struct i915_request *request, const struct i915_sched_attr *attr); struct list_head * i915_sched_lookup_priolist(struct intel_engine_cs *engine, int prio); void __i915_priolist_free(struct i915_priolist *p); static inline void i915_priolist_free(struct i915_priolist *p) { if (p->priority != I915_PRIORITY_NORMAL) __i915_priolist_free(p); } void i915_request_show_with_schedule(struct drm_printer *m, const struct i915_request *rq, const char *prefix, int indent); #endif /* _I915_SCHEDULER_H_ */