keithp at keithp.com
Mon Feb 5 18:06:52 PST 2007
On Mon, 2007-02-05 at 20:04 -0500, David Reveman wrote:
> From the talks keithp has given on the subject I've understood that
> implementing this properly is very hard, if not impossible. Is that not
> the case anymore?
The hard part was making it asynchronous and routing it through the X
protocol itself. I did a small fraction of that implementation before
abandoning it. Creating a synchronous back-channel would work, although
I have concerns about performance in that case.
> Non-contiguous windows are important so I wouldn't want an
> implementation that didn't support that. It didn't add any complexity to
> support it in my implementation but I can't be 100% sure of that yet as
> it's not fully complete though.
Yeah, I can't imagine that will be all that complicated. How about the
ability to map from multiple representations of the same window?
> The only problem I see with a tri-mesh approach is that you'll have to
> increase the resolution of the mesh to have it match the output in some
I don't see this as a major blocker; we're only traversing it for input.
Of course, we'll need something better than linear search if you're goi
keith.packard at intel.com
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 189 bytes
Desc: This is a digitally signed message part
More information about the xorg