/** struct xe_range_fence_ops - XE range fence ops */ struct xe_range_fence_ops { /** @free: free range fence op */ void (*free)(struct xe_range_fence *rfence);
};
/** struct xe_range_fence - XE range fence (address conflict tracking) */ struct xe_range_fence { /** @rb: RB tree node inserted into interval tree */ struct rb_node rb; /** @start: start address of range fence is interval tree */
u64 start; /** @last: last address (inclusive) of range fence is interval tree */
u64 last; /** @__subtree_last: interval tree internal usage */
u64 __subtree_last; /** * @fence: fence signals address in range fence no longer has conflict
*/ struct dma_fence *fence; /** @tree: interval tree which range fence belongs to */ struct xe_range_fence_tree *tree; /** * @cb: callback when fence signals to remove range fence free from interval tree
*/ struct dma_fence_cb cb; /** @link: used to defer free of range fence to non-irq context */ struct llist_node link; /** @ops: range fence ops */ conststruct xe_range_fence_ops *ops;
};
/** struct xe_range_fence_tree - interval tree to store range fences */ struct xe_range_fence_tree { /** @root: interval tree root */ struct rb_root_cached root; /** @list: list of pending range fences to be freed */ struct llist_head list;
};
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.