Bilinear diophantine equations

Question

Is there a fast way ($O((\log n)^c)$) to solve $$ax+by+xy=n$$ over integers when $a,b$ are known and $0<x,y<a,b$ holds?

Answer 1

$$ (x+b)(y+a) = n + ab $$ four