> to decide when you don’t have enough room left, or you can use some
other algorithm to
understand that you are recursing through your completion handler.
Again the solution is a
worlk item or worker thread.
Calling KeInsertQueueDpc from the DPC itself is also a solution for
stack overflow in state-machine-driven drivers.
Max